Augur: mission queries and inverse design
39,322 words63 subsections42 tables7 listingsPlan version 1.1
On this page39
Crates: frob-mission (queries, semantics, the search over families) and frob-synth (constructive lanes that
propose designs). The family-certificate payload of the .frobcert bundle and its checking rules live in
frob-cert, which is Lemma's crate (§12, §34.9): it defines and reads the payload, and frob-lemma writes it.
Formats: .fmission (schema owned by frob-spec, §34.9) and the family section of .frobcert.
Labelling convention for this chapter. Numbers inside a fixture are exact consequences of the fixture's stated model; they are DESIGN, because the fixture is a specification of a known answer, and each is hand-checkable from the equations printed beside it. Numbers that report what a plan-time pilot observed are FACT, Appendix K, and cite a path inside the planning reproduction bundle, which Appendix H locates (§25.22). Thresholds in gates are TARGET. Figures from the literature are FACT with their source in Appendix H, each to be re-read from the primary source before a gate cites it. No number in this chapter is a measurement of FrankenRobotics, because no FrankenRobotics code exists.
25.1 What Augur owns and what it is for
Every other subsystem answers a question about one design: does it close, does it stand, how does it score on this task, is it better than that one. Augur answers a question about a set of designs. The unit of work is a mission query: the caller supplies an admissible design grammar with part and fabrication tolerances, a family of worlds, an observation interface, a policy class, a horizon, success and hard-loss predicates, and the quantifiers that relate them. The answer is a pair of design sets, an inner set I and an outer set O, with
I ⊆ F ⊆ O,
where F is the set of designs that satisfy the mission (§25.4.1). Every design in I carries a checked reason why it works. Every design outside O carries a checked reason why it cannot work. The designs in O ∖ I are returned as unresolved cells, each with the competing explanations that keep it open and the cheapest next test that could close it. Witnesses (a controller, a force allocation, a counterexample world) travel with the answer in a portable bundle that a separate program checks on a machine with no GPU and no access to the proposing agent.
The contrast with scoring one design is the reason the subsystem exists.
| Scoring one design | A mission query | |
|---|---|---|
| Input | One design, one task, one policy | A family of designs, a family of worlds, a class of policies, explicit quantifiers |
| Output | A number with an uncertainty | Two sets, I and O, with witnesses and unresolved cells |
| A negative result | "This design scored 0.44 with this policy" | "No design in this cell works under any admitted policy", or "unknown, and here is why" |
| What training failure means | The design looks bad | Nothing about the design: a failed search does not discharge an existential quantifier (§25.4.2) |
| What an edit costs | Re-run | Re-check only the obligations the edit touches (§25.8) |
| Who can audit it | Whoever can re-run the simulator | Anyone with frob-verify and the bundle (§25.5) |
A worked illustration of why the quantifiers are part of the question. Ask for the least expensive modular carrier that moves a fragile box from a rack, across a wet strip, onto a counter. Four choices change the answer: whether the controller sees a surface label; whether its policy may use earlier slip; whether the payload can be weighed before the journey; and whether a different policy may be trained for each body. Augur can also return the smallest alteration of the body, the sensor suite or the world that makes the mission attainable. A cheaper ramp strip, a different axle ratio and a better sensor then become competing, testable engineering decisions with separate procurement and operating costs.
mission, world uncertainty, observations ──┐
├─► causal design game ─┬─► exact or conservative family bounds ──┐
parts, site edits, fabrication limits ─────┘ └─► trajectories on batch-cpu, CUDA, Metal │
└─► controller witness or │
counterexample ─────────────────┤
▼
next probe, measurement or edit ◄── unresolved cells with competing explanations ◄── independent checker
│ │
└────────────► back into the game admitted cells (I), excluded cells (D ∖ O)
The gym, the batched tiers and the referee are execution engines for experiments that a query chooses. They are not the product of this chapter.
What each crate owns.
| Crate | Layer | Owns | Does not own |
|---|---|---|---|
frob-mission |
5 | Admission of .fmission queries (the schema, the parser and the canonical form are owned by frob-spec, §34.9); the semantic kernel (quantifier prefixes, cells, verdicts, the four proof rules as proposers); lowering a query to small subproblems (static linear and conic programs, finite observation games, interval constraints, product systems, simulation campaigns); the search over cells; the six mission verbs and experiment.suggest |
Dynamics, contact, sensors, scene compilation, statistics, replay: it calls their owners |
frob-synth |
5 | Constructive lanes that propose candidate designs for a query: monotone co-design, trajectory optimization with design variables, bounded exact linkage synthesis, numerical continuation | Any verdict. A synthesized design is a candidate until frob-mission and the checker say otherwise |
frob-cert |
6 | The family-certificate payload of .frobcert: canonical encoding, the closed registry of proof kinds, and the checking rule for each kind, written against std only so that frob-verify (§12) can link it without the proposer |
The proposer's solvers; the container and signing conventions of the bundle, which §12 fixes |
Tier. The subsystem as a whole is F. Its exactly solvable fragments are S: linear static families with rational certificates, finite observation games, schema admission and the checker. Region certificates, the search over hybrid contact cells, probe design and the constructive lanes are F. Facility co-design, multi-robot handoff, skill transport, shape-space atlases and continuation are M, behind feature flags and off the critical path. §25.27 gives every F and M mechanism its pilot, its falsifier, the ceiling of its benefit and its kill gate.
What Augur takes from other chapters. The design language and module contracts (§14); actuator cards (§15); the three tiers and the transactional referee step (§16); family batches (§17); contact laws and wrench cones (§18); scenes, clearance complexes and priced retrofits (§19); the clock contract with its seven instants and the boundary ordering rule (§20); the baseline controller and skill artifacts (§22); policies (§23); requirements and the blinded qualification lane (§24); adversarial world search and minimal counterexample worlds (§26); counterfactual forks (§27); static analyses, the memo graph and paired comparison (§28); replay addresses (§29); calibration (§30); proof classes, the claim product and the offline auditor (§8, §12); the verb registry, envelope, budgets and jobs (§32); the ten-fold test (§39).
25.2 Decisions
- ADR-AUGUR-01: the answer to a design question is a pair of sets with proofs, never a score. Reason: a score cannot distinguish "this design fails" from "this search failed", and it cannot be reused after an edit without re-running. Sets with per-cell proofs can.
- ADR-AUGUR-02: the quantifier prefix is written by the caller and is part of the mission identity. There is no default prefix. Reason: the same plant gives opposite answers under "one command per known build" and "one command for the whole family" (§25.4.2), and evidence for the easier order looks identical in a table of results.
- ADR-AUGUR-03: conventional formulations first. A query is lowered to the most ordinary sound formulation available: a lifted robust linear program, a scenario-tree program, a quantifier-free interval test, an enumeration. A specialized family solver or kernel is written only after repeated changed queries show, with measured timings, that the ordinary route is the bottleneck. Reason: in every plan-time pilot the conventional formulation tied the specialized one (§25.22).
- ADR-AUGUR-04: propose anywhere, check on the CPU in exact or outward-rounded arithmetic. A proposer may use single precision on CUDA or Metal, a floating-point solver, a learned heuristic or an agent's guess. Nothing a proposer says is believed. A cell enters I, or leaves O, only when the checker accepts a certificate for it.
- ADR-AUGUR-05: the checker shares no code with the proposer. The checking rules in
frob-certdepend onstdonly and carry their own rational and interval arithmetic. Reason: a Monte Carlo run and a solver that share one mistranslated model agree on the wrong answer; independence of the checker is the only defence the format can offer. - ADR-AUGUR-06: region evidence is per constraint, with a bounded split set. Interval and Taylor-model certificates are issued for one constraint; bisection is confined to about six parameters and the others are enclosed at full range. Isotropic paving of a design box of ten to twenty dimensions is not attempted (§25.6, §25.34). Reason: bisection arithmetic and the published record.
- ADR-AUGUR-07: unknown is a verdict. A cell is inner, excluded or unresolved. Solver failure, timeout, an enclosure that straddles a threshold and a mode sequence that cannot be enclosed all yield unresolved. Nothing converts unresolved into either of the other two.
- ADR-AUGUR-08: answers are anytime. Each decided cell is individually certified, so the answer at any moment is a valid answer to "what is known under this budget". More work can only move cells out of the unresolved set (INV-AUGUR-04).
- ADR-AUGUR-09: a rival's answer goes through the same checker.
frob-verifyaccepts a bundle from any producer. If a short robust program over a conventional solver produces the same checked scope at similar turnaround, the studio ships that program behind the same verbs and says so (§25.27, KILL-AUGUR-TIE). - ADR-AUGUR-10: the weakest input sets the class. An answer's class is the claim product (§8) of its cells'
classes. A cell proved by a certificate is
Certified; a cell supported by replayed trajectories isTested; an empirical coverage statement isEstimated. No operation infrob-missionraises a class. - ADR-AUGUR-11:
.fmissionis canonical JSON with exact numbers as strings.MissionIdis the BLAKE3 hash of the canonical bytes. Rationals are reduced integer pairs "p/q" with a positive denominator; integers above 2⁵³ never travel as JSON numbers (§32). - ADR-AUGUR-12: hidden as-built parameters live in the world, not in the design index. A policy may be indexed by the known nominal build. It may not be indexed by a tolerance the controller cannot observe (§25.4.2).
25.3 The user contract
25.3.1 Verbs
The mission cluster has six verbs. experiment.suggest is a seventh verb in its own cluster because it also
serves comparison and calibration (§28, §30). All seven are generated from the verb registry (§32), accept
--estimate, take a budget, and return the standard envelope. Long queries return a job handle after a bounded
synchronous wait.
| Verb | Kind | Mathematical output | What a design agent does with it | Tier |
|---|---|---|---|---|
mission.synthesize |
run | Inner and outer feasible sets over named parameters and topologies; witness controllers; unresolved cells; cost bounds when an objective is given | Chooses from a whole family of wheels, legs, transmissions and sensors under constraints | F; S on linear static and finite-game fragments |
mission.refute |
run | A scoped impossibility bound, or a witness that defeats one proposed design and controller; the binding constraint and the smallest admitted change that relaxes it | Stops an unproductive policy search; asks for the smallest physical change that would help | F; S on the same fragments |
mission.distinguish |
run | The smallest admissible intervention or instrument whose readings separate alternatives that imply different mission decisions; otherwise two witness mechanisms with opposing margins | Decides whether to collect a measurement, move a mount or fund more simulation | F |
mission.separate |
run | An executable, physically admissible pair of worlds in which a design ordering or a diagnosis changes, minimized, with the edit that removes the effect | Learns which terrain or interior feature exposes a failure and ships it as a regression (search machinery in §26) | F |
mission.transport |
run | A map between task interfaces and a local policy with a bounded error, or a counterexample naming the contact mode where authority is lost | Reuses a carry or step skill on another morphology and retrains only the named modes | F for the certified map with its bounded error (the static core of §25.11); M beyond the static core |
mission.revalidate |
run | Surviving certificates, invalidated regions, required reruns and their cost, after an edit to the mission, the design family, a card or the world | Changes a motor or a floor tolerance without redoing the qualified part of a study | F; the dependency-keyed part is S |
experiment.suggest |
read | Ranked information-gathering proposals with testable predictions: a measurement, a probe, a simulation at a higher tier, a cell to split | Spends the next unit of budget where it can change a decision | F |
Two registered verbs transport, and their scopes differ. mission.transport moves a certified claim through an
interface map with a bounded error F: its output is a proof object or a counterexample, and nothing in it is
learned. skill.transport (§22.10) moves a skill artifact (.fskill) to another body with a learned residual M.
A skill moved by skill.transport carries no certified claim across unless mission.transport has issued the
interface certificate for the same pair of bodies.
A point query is mission.synthesize with every design parameter bound; it returns one cell. An existence query
asks only whether I is nonempty; it returns true with a witness, false with an exclusion of the whole domain,
or unknown with the reason. The body is a free output parameter of a set comprehension, and binding it is a
special case, not a different interface.
mission.synthesize is also the one-verb route from a brief to a set of survivors: it carves the family, runs
the cohorts it needs, races them and returns cells with verdicts. That it saves serial agent turns is a
HYPOTHESIS; the test is whether agents given this verb reach accepted answers in fewer turns than agents driving
the lower verbs by hand (measured inside GATE-AUGUR-07). If they do not, it remains a convenience.
CLI forms follow the registry: frob mission synthesize carrier.fmission --json,
frob mission refute carrier.fmission --design d:41aa… --policy p:07c2…,
frob mission revalidate a:93f0… --after-edit e:5d1c…, frob experiment suggest a:93f0… --budget gpu-s=600.
25.3.2 The .fmission schema (FMT-FMISSION, frob.mission/1)
| Field | Content | Rule |
|---|---|---|
design_domain |
A design family from §14: template or grammar, admitted topologies, free and bound parameters with unit, chart and box, part and fabrication tolerances, and the admitted interface-preserving isomorphisms | Free parameters name their chart (for example inverse-length), because convexity and monotonicity are properties of a chart |
world |
A nonempty declared family: geometry, physics, hidden parameters, initial-state uncertainty. kind is bounded-set (worst case) or population (a named law) |
Fixed before any candidate is tested. Empty or inconsistent families are refused |
world.persistence |
For each hidden parameter: fixed-per-execution or resampled at a named instant |
No default (§25.4.2) |
observation |
The channel Y: fields, noise bounds, and timing in the instants of §20 (sample, exposure, timestamp, arrival, decision, command, actuation) | A field with no arrival instant is refused |
policy_class |
causal on the history of Y; what indexes the policy (nominal-design, cell, family); actuation authority; randomization; decision makers |
clairvoyant is accepted only as a labelled relaxation that can exclude, never include |
horizon |
static, a finite time, a tick count, or a declared terminal mode set |
Unbounded horizons need a declared completion |
predicates |
accept, the Boolean acceptance predicate A; hard_loss; optional margins. Atoms carry their comparator (<, ≤, =) and units, and may reference requirement terms of a .ftask (§24) |
Shaping rewards are not predicates |
quantifiers |
The ordered prefix of binders: exists policy with its scope, forall world, forall execution, or prob world ≥ p with population and confidence |
Part of MissionId |
objective |
Optional: a declared cost over the design domain, and the claim wanted (feasible-candidate, minimum-with-matching-lower-bound, pareto) |
Scalarizing several objectives is the caller's decision and is recorded |
evidence |
Profile: exact (rational certificates), enclosed (outward-rounded intervals), empirical (sample coverage under a named population); accepted classes |
An answer never mixes profiles inside one cell |
resolution |
The largest unresolved set the caller will accept, in a stated measure, and any mandatory interior, exterior and boundary obligations | A vacuous enclosure cannot satisfy a mandatory obligation |
response |
Which parts of the answer to return | — |
budget |
Wall seconds, CPU core-seconds, GPU seconds, referee seconds, checker seconds, sync_wait_ms |
§25.3.4 |
A complete query. This is the stance family of §25.13 and it is small enough to check by hand.
{
"schema": "frob.mission/1",
"name": "stance-family-400N",
"verb": "mission.synthesize",
"design_domain": {
"family": "template:four-point-stance@1",
"topologies": ["rect4"],
"ports": ["foot.pp", "foot.pm", "foot.mp", "foot.mm"],
"isomorphisms": ["mirror-x", "mirror-y"],
"free": [
{ "name": "v", "meaning": "1 / half_width", "unit": "1/m", "chart": "inverse-length", "box": ["2", "6"] }
],
"bound": [
{ "name": "u", "meaning": "1 / half_length", "unit": "1/m", "value": "3" },
{ "name": "cap", "meaning": "normal-force rating per foot, port order", "unit": "N",
"value": ["160", "160", "160", "160"] }
],
"tolerances": []
},
"world": {
"kind": "bounded-set",
"family": "static-payload-envelope@1",
"frame": { "origin": "footprint-centre", "axes": "x-forward, y-left, z-up", "handedness": "right" },
"parameters": [
{ "name": "W", "meaning": "total vertical load", "unit": "N", "value": "400" },
{ "name": "P", "meaning": "first moment (Σ xᵢ·fᵢ, Σ yᵢ·fᵢ) of the support forces", "unit": "N*m",
"hull": [["60", "30"], ["60", "-30"], ["-60", "30"], ["-60", "-30"]] }
],
"hidden": [],
"persistence": {}
},
"observation": {
"channel": "payload-wrench@1",
"fields": ["W", "P"],
"noise": "none",
"timing": { "arrival": "before-decision", "clock": "static" }
},
"policy_class": {
"kind": "causal",
"indexed_by": "nominal-design",
"authority": "independent-normal-force",
"randomization": "none",
"decision_makers": ["allocator"]
},
"horizon": { "kind": "static" },
"predicates": {
"accept": [
{ "id": "force-balance", "expr": "Σ fᵢ = W" },
{ "id": "moment-balance", "expr": "Σ qᵢ·fᵢ = P" },
{ "id": "unilateral", "expr": "fᵢ ≥ 0" },
{ "id": "rating", "expr": "fᵢ ≤ capᵢ" }
],
"hard_loss": [],
"margins": []
},
"quantifiers": [
{ "q": "exists", "var": "policy", "scope": "per-nominal-design" },
{ "q": "forall", "var": "world" },
{ "q": "forall", "var": "execution" }
],
"objective": { "minimize": "1 / v", "unit": "m", "claim": "minimum-with-matching-lower-bound" },
"evidence": { "profile": "exact", "arithmetic": "rational", "accept_classes": ["certified"] },
"resolution": { "max_unresolved": { "measure": "interval-length", "chart": "v", "value": "0" },
"mandatory": ["interior", "exterior", "boundary"] },
"response": ["inner", "excluded", "unresolved", "witnesses", "cost_bounds", "candidate_cost_gap",
"next_test", "certificate"],
"budget": { "wall_s": 60, "cpu_core_s": 60, "gpu_s": 0, "referee_s": 0, "checker_s": 10, "sync_wait_ms": 2000 }
}
The same contract for a mission that needs dynamics, sensing and a deadline differs only in its fields. A fragment for the carrier of §25.1:
{ "schema": "frob.mission/1", "name": "delivery-and-placement", "verb": "mission.synthesize",
"design_domain": { "family": "grammar:modular-carrier@1", "free": ["design"] },
"world": { "kind": "bounded-set", "family": "bounded-friction-payload-and-clock@1",
"persistence": { "payload_mass": "fixed-per-execution", "strip_friction": "fixed-per-execution" } },
"observation": { "channel": "actor/encoders-imu-and-finite-depth@1" },
"policy_class": { "kind": "causal", "indexed_by": "nominal-design", "randomization": "none" },
"predicates": { "accept": ["fits_loaded_door", "payload_supported", "driver_limits", "goal_before_deadline"] },
"quantifiers": [ { "q": "exists", "var": "policy", "scope": "per-nominal-design" },
{ "q": "forall", "var": "world" }, { "q": "forall", "var": "execution" } ],
"objective": { "minimize": "declared_part_cost", "claim": "minimum-with-matching-lower-bound" },
"response": ["inner", "excluded", "unresolved", "witnesses", "cost_bounds", "candidate_cost_gap", "next_test"] }
25.3.3 The answer
The envelope's result for the stance query, abridged. outer is not listed: it is the domain minus the
excluded cells, by INV-AUGUR-02.
{ "schema": "frob.envelope/1", "verb": "mission.synthesize", "ok": true, "exit": 0,
"result": {
"mission_id": "q:5b1e…",
"inner": [ { "cell": "c0", "topology": "rect4", "chart": "v", "box": ["2", "14/3"], "closed": [true, true],
"policy": "selectable-per-nominal-design", "proofs": ["p0", "p1", "p2", "p3"] } ],
"excluded": [ { "cell": "c1", "topology": "rect4", "chart": "v", "box": ["14/3", "6"], "closed": [false, true],
"proofs": ["p4"], "binding": "rating at foot.pp under P = (60, 30) N*m" } ],
"unresolved": [],
"witnesses": [ { "proof": "p0", "kind": "lp-primal", "vertex": ["60", "30"],
"forces_N": ["160", "130", "110", "0"], "at": { "v": "14/3" } } ],
"cost_bounds": { "incumbent": "3/14", "lower_bound": "3/14", "unit": "m", "attained": true, "gap": "0" },
"next_test": null,
"certificate": { "bundle": "b3:77ac…", "kinds": ["lp-primal", "lp-farkas", "partition"], "checker": "frob-verify/1" },
"assumptions": ["independent-normal-force authority", "payload wrench observed before allocation",
"point feet, coplanar, static"],
"authorization": { "execution_authorized": false, "hardware_safety_signoff": false,
"sim_to_real_certified": false } },
"evidence": { "class": "Certified", "tier": "static", "determinism": "exact" },
"cost": { "wall_ms": 38, "cpu_core_s": 0.04, "gpu_s": 0 },
"warnings": [ "boundary design has zero reserve on two constraints (rating at foot.pp, unilateral at foot.mm)" ],
"next_actions": [ { "command": "frob mission synthesize stance.fmission --set predicates.margins='fᵢ ≥ 10 N'",
"why": "Continuous four-foot contact needs a positive force floor; the boundary moves." } ] }
Every cell names its topology, coordinate chart, units, bounds, whether each end is closed, the assumptions it
depends on, and whether the whole cell shares one policy or has a constructively selectable policy per known
design. An empty inner means no certified witness so far. An empty outer set (the whole domain excluded) means
the requested family is excluded under the declared model. A nonempty unresolved list is work still to do, and
its probability mass is reported only under a weighting of topology classes and continuous parameters that the
caller supplied.
25.3.4 Budgets, estimates and stops
--estimatereturns the cost of admission, lowering, proposing and checking separately, with intervals, and runs nothing. Checker time is a budget line of its own because it is part of decision time (§25.12).- A query that would exceed a session budget is refused with the estimate attached.
- A budget stop returns the certified cells. DESIGN: because each decided cell is certified on its own, a
query that stops on budget returns exit 0 when the unresolved set satisfies
resolution, and exit 2 with the flagresolution-unmetwhen it does not. Exit 4 is returned only when the budget ended before admission and the first checked cell, in which case nothing is published. This is the standing rule "a budget stop publishes nothing partial as a result" applied to a result whose parts are separately complete; the reconciliation is recorded as OPEN-AUGUR-7 for the owner of §32. - Long queries are jobs. Progress events report decided measure, unresolved measure, certificates checked, and the current next test. Cancellation drains: proposals in flight are discarded, checked cells are kept.
- A mission answer has an address
a:…and is immutable. A later query with more budget produces a new answer that refines the old one.
25.3.5 Chance constraints
A probabilistic prefix names three things: the population the probability is over, the event whose probability is bounded, and the confidence level of the evidence. A worst-case bound over an interval of a material parameter and a probability over manufactured units are different statements and use different binders.
A mission of several stages either preserves the joint law across stages or allocates failure budgets that add
up to the mission allowance. The smallest case that shows why: among 20 equally likely worlds, two stages each
pass in 19. If their failed worlds differ, 18 of 20 missions pass. If they coincide, 19 of 20 pass. Independent
stages with those marginal rates give 0.95² = 0.9025. If each stage instead has conditional success of at least
0.95 at every history that reaches it, the product is a lower bound. Marginal stage certificates alone do not
identify mission reliability, so Augur reports joint episode outcomes when it has them and refuses to multiply
marginals without a stated dependence assumption (FROB-REF-846).
Empirical cells go through the study types of §24: a fixed-n exact study with its reachability pre-analysis, or an anytime-valid study, never a mixture. Confirmation of a mission answer on sealed worlds uses the blinded qualification lane.
25.3.6 Minimum, repair and gap claims
- A claimed minimum is returned as an incumbent cost together with a checked matching lower bound. Without the
lower bound the claim is
feasible-candidateand says so. - Strict feasible sets can have an unattained infimum. In the docking family of §25.15, at read error ε = 5/16,
repair by raising the actuator bound requires U > 3/4; on a continuous catalog there is no smallest increase.
Augur returns the open threshold, any feasible priced candidate and its gap to the infimum. A discrete catalog
may attain a smallest repair, and then the answer says
attained: true. mission.refutereports the binding constraint from the dual of the excluding relaxation, and the smallest admitted change that relaxes it, as a typed edit to the design, the sensor suite, the world or the mission.- Feasibility and optimality are separate obligations (§25.8). A feasible witness can survive an edit that destroys the optimality of the design it belongs to.
Refusals are listed in §25.24.
25.4 Semantics
A mission answer is only as good as the definition it answers. This section fixes the definition so that an optimizer, a learned policy, a cache or a GPU kernel cannot change the question while answering it.
25.4.1 Objects and the feasible set
- D, the design domain, is the disjoint union of the parameter spaces of the typed assembly graphs that the query admits, quotiented only by admitted, interface-preserving isomorphisms (§14). Two designs that differ by a relabelling the mission cannot observe are one design; nothing else is identified.
- W, the world family, is the nonempty declared set of world conditions: geometry, physics, hidden parameters and initial-state uncertainty. Its scope is fixed before candidates are tested. A body that cannot satisfy an admitted clearance or load case carries that failure; the case is not removed from W to make room.
- Π_Y is the set of causal policies on the history of the available channel Y: at each decision instant the command is a function of the observations that have arrived by that instant under the clock contract of §20.
- T(d, π, w) is the set of maximal admitted executions of design d under policy π in world w. It is a set because contact can be set-valued and because unobserved disturbances remain free.
- A(τ) is the mission's Boolean acceptance predicate on an execution τ, including temporal requirements, hard limits and terminal outcomes.
The robust design family is
F = { d ∈ D : ∃ π ∈ Π_Y ∀ w ∈ W, T(d, π, w) ≠ ∅ ∧ ∀ τ ∈ T(d, π, w), A(τ) }.
The clause T(d, π, w) ≠ ∅ matters: a design whose dynamics are undefined in some admitted world does not satisfy the universal quantifier vacuously.
25.4.2 Quantifier order
The prefix ∃π ∀w ∀τ says: one policy, chosen knowing the nominal design and nothing about the hidden world, must succeed in every world on every admitted execution. Three weaker statements are easy to prove by accident, and each is refused as evidence for F.
| Weaker statement | How it arises | Why it is not F |
|---|---|---|
| ∀w ∃π (clairvoyant) | A controller is tuned or trained after the hidden world is known; a per-world optimum is computed | The controller uses information it will not have |
| ∃π for each as-built unit | One controller per realized tolerance | Two indistinguishable builds that need different commands cannot each get their own |
| ∃τ instead of ∀τ | A favourable contact branch is selected in simulation | In set-valued contact, a stick or slip fork with any failing admissible branch defeats a universal certificate |
The standing regression. A one-axis pusher moves a package by y = max(0, g·u − d), with build gain g, command u and hidden gap d. On g ∈ [1/2, 2], u ∈ [0, 2], d ∈ [0, 1/4], with required y ∈ [3/4, 5/4]: for every known gain the command u = 1/g works for every gap (g·u = 1, so y ∈ [3/4, 1]); no single command works for the whole gain family, because g·u ∈ [1, 5/4] for both g = 1/2 and g = 2 would need u ≥ 2 and u ≤ 5/8. "A command per known build" returns the whole interval. "One command for the family" returns the empty set. The two queries differ by one binder, and this pair is a permanent regression test of the public interface (§25.26).
Rules that follow from the order.
- Index a design-dependent policy by the known nominal build. Hidden as-built tolerances stay in W until an admitted calibration observation reveals them. Assigning one controller to each realized tolerance would certify a choice that is not available. Each cell records whether it shares one policy or has a constructively selectable policy per known design.
- A rollout refutes a particular controller, not a design. Excluding a design under ∃π requires an argument that covers every admitted controller. A finite experiment that fails to train a controller does not discharge the quantifier, and Augur never converts a failed training run into an exclusion.
- A refuter must match the claim it refutes. For the statement "every controller has some failing disturbance", one successful trajectory against one disturbance is not a counterexample; a counterexample is one body and one causal controller that meet the mission for every admitted disturbance.
- Hidden parameters are persistent unless declared otherwise. Take a prescribed out-and-back motion of one
second each way with a positive gain that is hidden and fixed for the execution, g ∈ {1, 2}. The net
displacement is g − g = 0 in both worlds. If the gain is resampled per move, the reachable net displacements
are {−1, 0, 1}. Treating a fixed parameter as a per-step disturbance enlarges the world family: it is
conservative for inclusion and unsound for exclusion (it would exclude a return-to-start mission that the
persistent model satisfies). Treating a resampled disturbance as fixed is the opposite error. So
world.persistencehas no default. - Private randomization does not rescue a guaranteed mission. Where the prefix is ∀w, a randomized policy
must succeed with probability one in every world. Randomization changes the answer only under a
probbinder. - Each actuator has a named decision maker with its own history of received packets, observable actions and local measurements at its commitment time. A centralized controller is admitted only when the information actually reaches it, and its command actually arrives, by the same deadline (§25.17).
- The checker rejects evidence for the easier order. A certificate records the prefix it proves. A bundle
whose proofs are valid for a different prefix than the query's is rejected even when every hash is consistent
(
FROB-REF-881).
25.4.3 Progress, Zeno behaviour and unknown
Each execution must progress to the horizon or to a declared terminal outcome. The rules:
- Deadlock, undefined dynamics and Zeno behaviour without an admitted completion cannot earn success. An execution that stops before the horizon, or accumulates infinitely many events in finite time, does not satisfy A.
- A model-level failure of progress is a failing execution. When deadlock or a Zeno accumulation is a property of the declared hybrid model, shown by an exact or enclosed argument, it blocks inclusion, and when it is shown for every admitted policy it supports exclusion.
- An admitted completion restores evaluation. If the mission model declares what follows an accumulation point (a bouncing contact that comes to rest and enters a declared resting mode), A is evaluated on the completed execution.
- A numerical failure is unknown. Non-convergence, step-size collapse, a retry budget exhausted in the transactional step, a NaN, or an integrator that cannot locate an event leave the verdict unresolved, unless independent evidence establishes physical failure or impossibility under the mission model. A solver error is never an exclusion.
- Comparators are evaluated as declared. Strict, non-strict and equality atoms are distinct. In the docking
family at U = 3/4 and ε = 5/16 the separation between the two reading sets is exactly zero and the strict
predicate fails. Conversely on 0 < w ≤ 1 every realization has w > 0 although the infimum is 0. A uniform
positive lower bound is sufficient for strict feasibility and can itself be requested as a robustness margin,
but that stronger requirement is stated in
predicates.margins, not assumed. - Scalarization is the caller's decision. Several objectives are not combined into one number by Augur.
25.4.4 The answer as data
The public answer carries I ⊆ F ⊆ O as a list of cells. DESIGN sketch, fixing intent and not signatures:
pub struct Cell { topology: TopologyId, chart: ChartId, bounds: Vec<Bound>, // closed or open per end
units: Vec<Unit>, assumptions: AssumptionSet, policy_scope: PolicyScope }
pub enum Binder { Exists { var: Var, scope: PolicyScope }, ForAll { var: Var },
Prob { var: Var, population: PopulationId, at_least: Ratio, confidence: Ratio } }
pub enum Verdict { Inner(Vec<ProofRef>), Excluded(Vec<ProofRef>), Unresolved(Vec<Explanation>) }
pub struct Answer { mission: MissionId, cells: Vec<(Cell, Verdict)>, cost: Option<CostBounds>,
next_test: Option<NextTest>, claim: ClaimProduct, bundle: BundleHash }
pub enum Explanation { StraddlesThreshold, ModeSequenceUnenclosed, SolverFailure, BudgetExhausted,
CompetingMechanisms(Vec<MechanismRef>), NeedsMeasurement(MeasurementRef) }
In an empirical profile, sample coverage and confidence under a named population are returned in separate fields and never folded into the cell geometry.
25.4.5 Four proof rules
These are the only ways a cell changes status. Each is implementable and checkable independently, and each has a deliberately invalid fixture that the checker must reject.
Rule 1: necessary-condition exclusion. Relax the controller and the dynamics: allow any contact force inside an outer wrench cone, any torque under an upper envelope, any observation the controller might wish for. Infeasibility of the relaxation eliminates every realization it covers. The certificate records the set inclusions that make it a relaxation (the true force set is inside the outer cone; the true torque set is under the envelope) and the dual separating vector. Two limits:
- Infeasible sample points do not eliminate their enclosing cell. Exclusion of a cell needs a certificate that is valid over the cell: a parametric dual vector with a sign proof, or a monotonicity argument.
- The relaxation must enclose every admissible state and energy source. A quasi-static work cut for a passive sill crossing of an 8 kg body over a 12 mm rise requires 8 × 9.81 × 0.012 = 0.94176 J against a 0.90 J budget and excludes the crossing; 0.05 J of approach kinetic energy, absent from the budget, removes the exclusion. Static rejection is a candidate for a dynamic test until the model it uses contains the dynamics' resources.
Rule 2: constructive inclusion. Supply one causal controller, an admissible contact schedule, event guards,
and a sound reachable tube or an exact witness for the whole cell. Check actuator bounds, material domains and
the mission predicate over the enclosure. At an uncertain mode boundary, branch conservatively or return
unresolved. The referee is used to hunt for counterexamples, which can only remove a cell from I. Scope today:
exact witnesses exist for static, quasi-static and finite-game cells; sound reachable tubes for contact-rich
full-order cells do not exist in the suite, and such cells stay unresolved with Tested trajectories attached
(OPEN-AUGUR-5).
Rule 3: monotone inheritance or symmetry. A verdict moves across a cell only under the conditions for that verdict. For exclusion, transport the relaxation and the violating witness. For inclusion, require a checked realization or refinement that preserves admissible disturbances, causal information, realizable policies, mission outputs and all admitted branches (§25.4.6). Matching outer wrench boxes cannot transport success across an unobserved joint stop. For symmetry, the group element must fix the mission, map W onto itself and map Π_Y onto itself; restricting a policy class to equivariant deterministic policies is a change of Π_Y. With two symmetric actuators where success needs exactly one of them to act, the winning actions (0, 1) and (1, 0) are exchanged by the symmetry and the only invariant deterministic actions, (0, 0) and (1, 1), both fail.
Rule 4: exact partitions and composition. The union of proved inner cells is inner. To remove a cell E from the outer set, prove E ∩ F = ∅; disjointness of E from the known inner cells leaves E open. A mission contract composes with a subtask only when the first stage's guaranteed end set lies within the second's admissible entry set, with matching clocks, uncertainty dependencies and state memory. Two individually successful videos, one per stage, prove no such inclusion.
25.4.6 Monotonicity and its test
Monotonicity is the cheapest source of family verdicts and the easiest to misuse. Write d ≼ d′ for an order on a chart (a larger rating, a longer stroke, a wider stance in a stated coordinate).
- Exclusion transports downward from d′ to d ≼ d′ when the relaxed feasible set at d is contained in the relaxed feasible set at d′. The obligation is a set inclusion between relaxations.
- Inclusion transports upward from d to d′ ≽ d when (i) every disturbance admitted at d′ is admitted at d, (ii) the witness controller is realizable at d′ and receives the same or a finer observation history, (iii) the mission outputs at d′ satisfy A whenever those at d do, and (iv) every admitted branch at d′ is simulated by an admitted branch at d. The obligation is an alternating refinement, not a set inclusion.
The first does not give the second. Enlarging a convex set of allowable contact forces admits more loads in a static model, so widening a physical sole helps the static inclusion; the same wider sole may collide during swing, which is a new branch at d′ that no branch at d simulates. A design that passes the static test and is "monotonically better" is still outside I until condition (iv) is checked.
The test (monotone-transport, §25.5.2) has three parts, all run by the checker:
- Structural sign. Every dependence of the lowered constraint expressions on the transported parameter has a proved sign over the whole cell: the outward-rounded enclosure of the partial derivative excludes zero, or the parameter enters only as the bound of a set that provably grows. A sign that holds at sample points is not a proof.
- Side conditions present. The four inclusion conditions, or the one exclusion condition, each appear as a
sub-certificate. A transport with a missing side condition is rejected (
FROB-REF-852), not weakened. - Scope. The transport names the model stratum it holds in (fixed contact mode sequence, fixed topology, fixed observation timing). Crossing a stratum boundary ends the transport.
A falsification harness accompanies the proof: for each declared monotone direction, random ordered pairs in the cell are evaluated at the highest available tier, and a single reversal withdraws every verdict transported along that direction and files the pair as a counterexample (GATE-AUGUR-08).
25.4.7 Shortcuts that are not proofs
Each row is a plausible argument, the smallest case that breaks it, and the rule that replaces it. All are seeded into the negative-control registry (§38) and the counterexample catalogue (Appendix N).
| Shortcut | Smallest counterexample | Replacement |
|---|---|---|
| The midpoint of two feasible designs is feasible | Feet at (±1 − e, ±1) m, each capped at 0.5 N, load W at the origin. Moment balance needs W·(1 + e)/2 from the positive-x pair. Designs (e, W) = (0, 1.9) and (0.9, 1) each need 0.95 N and pass. Their midpoint (0.45, 1.45) needs 841/800 N from a pair capped at 1 N | Convexity is claimed only in a chart where the constraints are affine, with design-independent mission vertices (§25.13); mass–geometry coupling is kept when CAD edits are lowered |
| Variants that are pairwise compatible can share a controller | Commands (x, y) ∈ [0, 1]². Three variants need x ≥ 2/3, y ≥ 2/3 and x + y ≤ 1. Every pair has a common command; the triple needs x + y ≥ 4/3 and x + y ≤ 1 | Minimal conflict sets, not pairs (§25.18) |
| A command exists for each design, so one exists for the family | The pusher of §25.4.2 | The prefix is explicit |
| A feasible allocation exists, so the body is admitted | Stance at half-width 1/4 m: the active allocation (155, 135, 105, 5) N fits 160 N ratings; an equal-spring passive suspension produces (175, 115, 85, 25) N | The authority that realizes the allocation, and the observations that arrive in time, are part of the certificate |
| The support polygon contains the load and total capacity suffices | Of 2,304 bodies in the stance grid, this screen accepts 1,596 that the exact model rejects (FACT, §25.22) | Per-foot ratings and moment balance together |
| Sample points in a cell fail, so the cell is excluded | Any cell that straddles a boundary | A certificate valid over the cell |
| Both stages succeed 95% of the time, so the mission succeeds 90.25% | The 20-world example of §25.3.5: 18/20 or 19/20 | Joint law or additive budgets |
| Each projection of the product covers its marginal outcomes | Paired outcomes (0, 0) and (1, 1) project onto {0, 1} for both robots and hide (1, 0) (§25.16) | Enclose the joint outcome set |
| The per-component limits are met, so the assembly is feasible | Two fingers each need one powered tick; the bus powers one finger per tick. Deadline of one tick: zero schedules. Two ticks: two schedules. Local motor limits are identical in both cases, and an additive peak rule prunes the feasible case | The joint, time-dependent resource contract |
| The probe separates every admitted mechanism, so its verdict is safe | A fourth mechanism shares the probe's early trace and reverses all 225 held-out decisions (§25.14) | Conditional witness; direct measurement of the target always admitted |
| A root of the synthesis equations is a mechanism | A crank-rocker whose precision poses lie on two assembly circuits (§25.21.3) | Circuit and branch certificates |
| A Lie-bracket direction is reachable | ẋ = u with u ∈ [0, 1]: rank one, and negative x is unreachable from zero | The integrated finite witness |
25.4.8 Arithmetic, and where proof assistants are used
- Deterministic set arithmetic uses interval and affine bounds with outward rounding, and checked linear-program duals where they apply.
- A certificate may be proposed in low precision on CUDA or Metal, then rationally reconstructed or enclosed, then checked on the CPU. For a linear program the proposer's floating-point solution names an active set; the basis system is solved exactly over ℚ; the checker tests exact primal feasibility, and for an optimum, exact dual feasibility. If reconstruction fails the cell is unresolved.
- Condition numbers, residual bounds, domain versions and the strictness of each inequality are checker inputs, not proposer annotations.
- On polynomial subdomains a sum-of-squares bound with a checked residual and a finite domain may be tried F.
- Strict predicates evaluated in bulk on a device use the exact-integer kernel class or guarded single precision with an exact fallback (§35). Unguarded single-precision comparison is not admitted for a verdict: on a 65,536-row boundary screen it produced 452 false admissions and 23,438 false exclusions (FACT, §25.22).
- Proof assistants are used on reusable proof rules and on translations (§12). A theorem prover is not dispatched for each wheel and terrain pair.
25.4.9 Owners worth probing before new code is written
FACT (paths under frankensim/crates/, read 2026-11-21; each to be re-read at the pinned commit before a gate
cites it): fs-sos/src/lib.rs describes polynomial models, sum-of-squares programs lowered to a block
semidefinite program, and a verifier that encloses residuals with interval arithmetic and treats the numerical
solve as untrusted (two cases in which that verifier's returned value is not a bound at the pin, a trimmed coefficient and a final subtraction rounded to nearest, are recorded with the foundation facts of §33, and no fs-sos value enters a certificate unchecked); fs-ivl provides outward-rounded intervals, affine forms and multivariate Taylor models
(multi_taylor.rs: range_subdomain, recenter) and interval Newton with DEFAULT_MAX_ROOT_BOXES = 65_536
(newton.rs); fs-regime exposes a π-group basis, scaling maps and model admission; fs-voi exposes
ranking-flip probability, expected opportunity loss and recommend_unknown_resolutions; fs-eproc contains
sequential evidence routines; fs-checker re-checks evidence packages outside the solving process through a
closed registry of semantic witness kinds. All are reached through the airlock unless §33 lists them as
bedrock-direct. Missing in the suite: a paving driver, contractors, interval forms of the robot static analyses,
a trajectory optimizer (§25.21.2) and any homotopy solver (§25.21.4).
The robotics-specific work is the mapping from a causal mission and a morphology to sound small subproblems, and the cross-check from each result back to the mission. Every mapping has a deliberately invalid fixture (PO-AUGUR-01).
25.5 Certificates
A positive or a negative answer must be readable on a machine that has neither the original agent nor a GPU.
25.5.1 What the bundle contains
The container, hashing and signing conventions of .frobcert are fixed in §12. This section fixes the family
payload that frob-cert defines and reads and that frob-lemma writes (§34.9).
| Part | Content |
|---|---|
| Query | The canonical .fmission bytes and MissionId |
| Definitions | Units, frames (origin, axes, handedness, sign conventions), clocks and the instants used |
| Interfaces | Ordered ports of the design family; the order is data, and reordering is a different certificate |
| Model assumptions | Plant and actuator assumptions, the authority model, the contact law and tier each proof relies on, as digests and as text |
| Policy class | The digest of Π_Y: channel, timing, indexing, randomization, decision makers |
| Cells | Topology, variable chart, bounds with open or closed ends, assumptions |
| Prefix and horizon | The quantifier order and horizon each proof establishes |
| Proofs | For each: its kind from the closed registry, its witness payload, its side-condition sub-certificates, the expected verdict |
| Primitive equations | The independently reviewable equations each proof is about, in the bundle, in Unicode text and as an expression DAG |
| Producer and checker | Producer identity and build; the checker protocol version the bundle targets |
| Flags | The authorization object with the three no-authorization flags of §8.2, all false, and the claim product of the answer |
Numbers are exact rationals, serialized as reduced integer pairs with a positive denominator, or outward-rounded intervals with a declared implementation and precision. The primitive equations travel in the bundle because a proof about the wrong translation of a contact law remains a physical error, and a reviewer can only find that error by reading what was actually proved.
25.5.2 Proof kinds used by mission answers (rows of the one closed registry frob.cert.kinds/1, §12.4)
| Kind | Establishes | Payload | The checker recomputes | Class | Tier |
|---|---|---|---|---|---|
lp-primal |
A feasible point for each listed vertex, or an affine-in-chart family of points over a cell | Rational vectors or affine maps | Every equality and bound exactly; for a family, at the cell's vertices | Certified | S |
lp-farkas |
A linear relaxation is infeasible at a point or over a cell | A dual vector y, constant or rational in the cell parameters, with a sign proof | yᵀw > Σᵢ max(0, (Aᵀy)ᵢ)·cᵢ exactly | Certified | S |
conic-farkas |
A second-order-cone relaxation is infeasible | A rational dual in the dual cone | Cone membership by exact squaring; strict separation | Certified | F |
interval-box |
One constraint holds, or fails, over a box whose split set has at most six parameters | Expression DAG digest, box, claimed enclosure | The enclosure, with the checker's own interval arithmetic | Certified | F |
taylor-box |
The same, by a Taylor model | Coefficients and remainder bound | The remainder bound and the range | Certified | F |
sos-gram |
A polynomial is nonnegative on a box | Rational Gram matrix and multipliers | The polynomial identity exactly; positive semidefiniteness by LDLᵀ over ℚ | Certified | F |
finite-game |
A causal policy wins against every world of a finite scenario tree | Policy table keyed by observation history | Every world and every error vertex; that equal histories receive equal commands | Certified | S |
alias-pair |
No causal policy succeeds in both of two worlds | Two worlds; their observation sets up to commitment; their success sets | That a common history exists; that the success sets are disjoint; the stated scope (all admitted probes, or one named experiment) | Certified | S |
monotone-transport |
A verdict moves along an order | Direction, sign enclosures, side-condition sub-certificates | §25.4.6 | Certified | F |
symmetry-transport |
A verdict moves along a group element | Signed permutation; invariance of mission, W and Π_Y | The images exactly | Certified | F |
partition |
Listed cells cover a region exactly | Cells | Exact box arithmetic: the union equals the region and interiors are disjoint | Certified | S |
composition |
Stage contracts chain | End-set ⊆ entry-set sub-certificates; clock and resource ledgers | Each inclusion; that no resource is spent twice | Certified | F |
product-unreachable |
The pair (A succeeds, B fails) is unreachable | Enclosure of joint outcomes and its coverage argument | That the enclosure covers every admitted joint branch and excludes (1, 0) | Certified | F |
trace-witness |
One execution refutes a fixed design and controller, or separates two designs | Replay address, digest, monitor verdict | Format and digest only | Tested | S |
sample-coverage |
An empirical bound under a named population | Counts, population, method | The bound from the counts | Estimated | S |
An unknown kind, a known kind at an unknown version, or a kind used outside its declared scope is rejected.
25.5.3 A specimen
For the stance family the positive specimen orders the feet [++, +−, −+, −−]; fixes half-length 1/3 m and half-width 3/14 m; four independent 160 N capacities; a 400 N weight. It encodes the four horizontal first moments P = (Σ xᵢ·fᵢ, Σ yᵢ·fᵢ) = (±60, ±30) N·m about the footprint centre. In right-handed axes with +z upward the support torque is Σ rᵢ × (0, 0, fᵢ) = (P_y, −P_x, 0). For P = (60, 30) the ordered forces 160, 130, 110, 0 N give torque (30, −60, 0) N·m, and the payload applies its negative in static equilibrium. The packet types each field: frame, origin, sign and units.
{ "kind": "lp-primal", "cell": "c0@v=14/3", "ports": ["foot.pp", "foot.pm", "foot.mp", "foot.mm"],
"feet_m": [["1/3", "3/14"], ["1/3", "-3/14"], ["-1/3", "3/14"], ["-1/3", "-3/14"]], "cap_N": ["160", "160", "160", "160"],
"authority": "independent-normal-force", "observed_before_decision": ["W", "P"],
"vertices": [
{ "W_N": "400", "P_Nm": ["60", "30"], "f_N": ["160", "130", "110", "0"] },
{ "W_N": "400", "P_Nm": ["60", "-30"], "f_N": ["130", "160", "0", "110"] },
{ "W_N": "400", "P_Nm": ["-60", "30"], "f_N": ["110", "0", "160", "130"] },
{ "W_N": "400", "P_Nm": ["-60", "-30"], "f_N": ["0", "110", "130", "160"] } ],
"law_class": "adjustable", "law": { "kind": "multilinear-vertex", "arguments": ["P_x", "P_y"], "note": "bilinear interpolation of the four vertex allocations over the load rectangle; no single affine law attains this width" },
"expects": "inner" }
{ "kind": "lp-farkas", "cell": "c1: v in (14/3, 6]", "relaxation": "A·f = (W, u·P_x, v·P_y), 0 ≤ f ≤ cap",
"A": [["1", "1", "1", "1"], ["1", "1", "-1", "-1"], ["1", "-1", "1", "-1"]],
"y": ["0", "1/2", "1/2"], "note": "yᵀA = (1, 0, 0, −1), so yᵀA·f = f₊₊ − f₋₋ ≤ 160",
"value": "yᵀ(W, u·P_x, v·P_y) = 30·u + 15·v = 90 + 15·v at u = 3", "sign": "90 + 15·v > 160 for all v > 14/3",
"expects": "excluded" }
The checker recomputes vertical force and both torque components for each vertex, checks each capacity, validates coverage of the payload envelope by a law of the declared class (here the bilinear interpolant of the four vertex allocations; the same vertices labelled as one affine law are rejected, by the controller-class rule of this chapter), and checks that the information the allocator is assumed to have is in the observation contract. At half-width 1/5 m (v = 5) the dual gives 165 N required against 160 N available.
Mutations that must cause rejection or withdrawal (GATE-AUGUR-01): a swapped foot ordering with unchanged
forces; a packet that passes (60, 30) directly as the torque; an unreported positive force floor; a passive
authority tag on a certificate that assumes independent forces; a changed quantifier with consistent hashes; a
missing side condition; an unknown proof kind; a non-reduced or negative-denominator rational; a cell whose
closed end was certified only as open.
25.5.4 What frob-verify checks, and what it does not
It checks:
- bundle integrity and schema; that every hash it can recompute matches;
- that each proof's kind and version are in the closed registry;
- that the prefix, horizon, policy class and cell each proof establishes are the query's;
- that every side condition a rule requires is present;
- every witness, by exact rational or outward-rounded recomputation from the primitive equations in the bundle, using its own big-integer, rational and interval arithmetic with declared size limits (a certificate beyond the limits is refused, not approximated);
- partition coverage and the open or closed status of every boundary;
- that the answer's claim class equals the weakest class among its cells;
- that the
authorizationobject is present with its three flags, allfalse.
It does not check, and a bundle must not be read as establishing:
- that the primitive equations describe the physical robot, floor or sensor. That is the Fidelity and Reality claims of §8, and no certificate in this chapter makes them;
- that the lowering from the design and mission to the primitive equations is correct. This is mitigated, not solved: the equations are in the bundle for review, each lowering has an invalid fixture, and supported templates are lowered twice by independent code (PO-AUGUR-01);
- any trajectory. A
trace-witnessis accepted as well-formed; replaying it is a separate act by the referee (§29), and the cell staysTested; - that the unresolved set is as small as it could be, or that the search was competent;
- cost data, catalog prices, or the weighting behind a reported probability mass;
- any statistical statement beyond recomputing a bound from counts.
25.5.5 One false certificate
A certificate is false when frob-verify accepted it and a concrete execution, allocation or world inside its
stated scope contradicts it. One false certificate has four consequences, none discretionary:
- The proof kind and checker version involved are disabled in the registry until the cause is found.
- Every stored bundle that used them is marked withdrawn; dependent answers are re-derived or downgraded to
Tested. - In the ten-fold test the arm that submitted it is disqualified from the scoped claim (§39).
- The counterexample becomes a permanent fixture in the checker's mutation corpus.
A truthful unresolved cell is never a false certificate. It counts against coverage where a definitive answer was required, and nowhere else.
25.6 Region evidence within its real scope F
What is not attempted. Paving a joint design box of ten to twenty dimensions with certified feasible and infeasible boxes. The arithmetic: 10⁴ boxes are 13 bisections; in 20 dimensions that is less than one cut per axis, and uniform boxes have side 0.64 of the domain (0.41 in 10 dimensions), so a constraint surface that depends on most parameters crosses nearly every box. The published record agrees (FACT, Appendix H): interval design of parallel robots is described by its own practitioners as exponential branch and bound, suited to small and medium problems, with a worked example of five design parameters; a three-dimensional dextrous-workspace paving took about five hours and left an error bound of up to a third of the certified volume; Taylor models delay the growth with dimension very little when dependent intervals lack cancellation structure.
What is built. Certificates for one constraint over a box of the parameters that constraint depends on, bisected along at most about six of them, combined by products, intersections and monotonicity (the split set and the weak-variable enclosure are §25.34).
- The constraint-to-parameter graph. Each lowered constraint g_k lists the parameters S_k it reads. Legged static analyses are sparse by construction: joint torque, reach and clearance of one leg depend on roughly three to six parameters of that leg (HYPOTHESIS; the measured sparsity for the plan's robot classes is OPEN-AUGUR-3, and closure constraints of linkage legs raise the coupled dimension).
- Per-constraint pavings. For each g_k, an inner set I_k and an outer set O_k in the coordinates S_k, built
by bisection with interval, affine or Taylor-model enclosures and forward–backward contractors. Each box
carries an
interval-boxortaylor-boxcertificate. - Combination. A design is in the region answer's inner set when it lies in every cylinder over I_k, and
outside the outer set when it lies outside some cylinder over O_k. The joint set is represented implicitly, by
k membership tests; it is never enumerated. Its volume, when wanted, is an
Estimatedquantity from sampling. - Monotone bounds first. A mass budget or a rating bound that is monotone in one parameter removes its half
space with one
monotone-transportcertificate and no bisection. - Dual witnesses for static conditions. Where a condition is a linear or second-order-cone feasibility
problem (static equilibrium with ratings, friction cones, torque envelopes), the exclusion is an
lp-farkasorconic-farkascertificate. A parametric dual with a sign proof covers a whole cell at once, as in §25.5.3, which is why linear static families do not need paving at all. - Pointwise checks remain. An agent needs a check at the points it proposes. Region certificates are a source of evidence quality and of tolerance robustness (a box around a design is a statement about every as-built unit inside it). They are not presented as a speed lever, and deciding volume is not the same as saving simulations.
Scope of a region certificate. It covers the static rigid model named in the bundle. It says nothing about dynamic performance, run-up, landing or recovery.
Killed forms, not built. Sampling only inside a certified inner ellipsoid: it cuts off the feasibility boundary, where optima sit, and misses disconnected islands. A logarithmic change of variables to linearize posynomial constraints for an integer-linear decision procedure: the logarithm of a posynomial is a convex log-sum-exp, neither linear nor polynomial. Cylindrical algebraic decomposition for reachable sets: doubly exponential beyond four or five variables.
Pilot before funding. A 12-parameter quadruped box (three link lengths, two hip offsets, three masses, gear ratio, motor mass, body length and width) with static joint torque in three stance postures, reach to a foothold set, and self-clearance. Pave with 10⁴ boxes in four arms: plain intervals, affine forms, contractors, and per-constraint decomposition. Falsifier: the best arm leaves more than 90% undecided, or more than 95% of the decided volume falls to a single monotone bound. Cost: about two engineer-days and CPU minutes (TARGET). Ceiling of benefit, stated before any speed test: none is claimed; pointwise static checks with an existing library give the same pruning for proposed designs.
25.7 Searching a family: quotients, cuts and cell refinement F
The loop. frob-mission keeps a worklist of cells. For each cell it tries, in order of cost: a monotone or
symmetry transport from a decided neighbour; a static exclusion; an exact or finite-game inclusion; a region
certificate; a simulation campaign that can refute an inclusion or support a Tested verdict; a split. A cell
that resists everything stays unresolved with its explanations. The order in which cells are attempted is a
scheduling heuristic and may use fs-voi opportunity loss; scheduling never controls validity, because every
decided cell has its own certificate.
Discrete families: typed holes and checked cuts. A topology family is a bounded design term with typed holes (§14): a mount hole is a frame, a legal joint subgroup and a port signature; a contact attachment is a conservative wrench envelope; battery, thermal, payload and geometric requirements are typed quantities with tolerances. The search fills holes best-first and prunes a partial term only with a bound that is checked over every legal completion of that node: an optimistic upper capability bound against a requirement, or a conservative lower resource bound against a budget. Dominance pruning between partial terms requires a recorded monotonicity argument. A minimized counterexample yields a cut only when it provably generalizes over the excluded family. Each cut is a certificate; a prune is wrong if any discarded design is independently feasible under the same mission, even when the eventual winner survives.
- Pilot before funding. Exhaust a frozen catalog of 1,024 leaves on the CPU, with and without cuts. Falsifier: one false cut, or less than 70% of evaluation cost saved (TARGET).
- Ceiling. The saving is bounded by the fraction of the catalog that static bounds can decide; it is measured on the frozen catalog before any claim.
The mission-observable quotient. Two designs need separate evaluation only if the mission can tell them
apart. For a mission M, frob-mission compiles a projection π_M from designs to exactly the invariants that
enter M's lowered equations: total pseudo-inertia, collision hulls, joint and actuator parameters, port
coordinates, sensor visibility, bus and thermal parameters, cost terms. Designs share a class only when their
projections are equal over all active observables; adding a placement-dependent observable (a hotspot, a harness
length) enlarges the projection and splits classes. Results are memoized on the class (§28).
- Known answer. Eight equal ballast slugs in 24 collinear slots: C(24, 8) = 735,471 placements enter rigid-body dynamics only through (N, Σx, Σx²), giving 24,546 classes. Slots {0, 3} and {1, 2} of a two-slug variant have equal Σx = 3 and different Σx² (9 and 5) and must not be merged.
- Status of the rule. "Equal projections imply identical modelled traces" is a statement about the simulator.
It is a structural rule with a bit-identical replay test on sampled class members, classed
Tested; it is not a proof-kernel obligation. - Honest scope. The size of the quotient is a property of the fixture. Independent material or compliance changes can make every class a singleton. No ratio is claimed.
Starter designs across families. When the design domain spans several archetype families (wheeled, tracked,
legged, hybrid), mission.synthesize first sizes one starter design per family by the static analyses and the
co-design closure (§25.21.1) and ranks the families before any simulation. This is orchestration, not a lever of
its own. Falsifier: on 20 missions the eventual winner lies outside the top two ranked families more than 15% of
the time (TARGET), in which case the ranking is dropped and every family is searched. Interpolating between
topologies through continuous coupling weights is not built: the limit of a vanishing limb is ill-conditioned.
Inconsistent missions. Admission tests the predicates against the world family with every design constraint
relaxed. If they conflict, the query is refused with a minimal conflicting subset, found by deletion filtering
over the linear and interval relaxation, with a Farkas certificate where the conflict is linear
(FROB-REF-877). This is S for linear conflicts and F beyond.
25.8 Revalidation after an edit F
mission.revalidate answers: after this edit, which of my verdicts are still proved, which are withdrawn, what
must be rerun and what will it cost. The edit may be to the mission, the design family, an actuator or material
card, a sensor, a clock, or the world.
A hash identifies; only an implication licenses skipping a recheck. Each reusable object records the implication it proved. A room segment may guarantee a lower wheel-traction margin under a stated surface and normal-load interval; a changed motor alone can invalidate that normal-load interval through acceleration. Reuse requires checking the newly implied assumptions against the saved ones.
Feasibility and optimality are separate obligations. A cost-9 cart may be the certified minimum while a cost-5 relay is excluded by a doorway. Widen only the relay's doorway. The cart and its complete successful trace remain valid, and the optimum moves to 5. Before returning a minimum or a complete Pareto set after an edit, Augur revalidates the competing exclusions, the global cost bound, catalog membership and prices. It preserves the cart's witness and withdraws the stale minimum, including when an amendment adds a new admissible catalog part.
The assumption lattice, with polarity. Assumption sets are ordered by inclusion of admitted worlds and commands. Each transport of a verdict across an edit is marked with its direction:
| Edit | Inclusion (a universal guarantee with the same witness) | Exclusion |
|---|---|---|
| Narrow the disturbance set | Preserved | Must be rechecked |
| Enlarge the disturbance set | Must be rechecked | Preserved when its witness lies in the old set and the policy class and information contract are unchanged |
| Relax an actuator limit | Preserved if the old command is still realizable and the plant and observations still realize the old dynamics | Must be rechecked |
| Relax a requirement | Preserved | Must be rechecked |
| Improve a sensor, or deliver a packet earlier | Preserved if every new observation history is one the old policy was proved on, or the old observation can be reconstructed from the new one | Can be destroyed: an observation-based impossibility may no longer hold |
| Delay a packet across a decision instant | Must be rechecked | Must be rechecked |
| Simultaneous edits to two fields | Joint check; per-field monotonicity rarely proves an interaction | Joint check |
Mechanism. Every certificate lists its dependency support: the physical parameters, metric intervals,
stages, scene cells, clocks, cards and model versions it actually used, including implicit ones (a common noise
model, the gravity frame, a calibrated renderer, a torque derating, a preprocessing graph). An edit disjoint
from a certificate's support preserves it. An edit inside the support triggers either the precise obligation
whose slack the changed interval must still fit, or a rerun. Each cheap revalidation carries an independently
checkable mask over evidence obligations. For a missed dependency, the withdrawal names the two worlds or the
new mode that invalidates it. The dependency-keyed part of this is the memo graph of §28; frob-mission adds
the polarity table and the optimality obligations.
Two structural rules come from other chapters and are applied here unchanged. From the module contracts of §14: swapping a leaf module preserves its siblings' local certificates, while an edit that touches a shared battery bus, a shared thermal sink, a cross-branch kinematic loop or base-coupled contact invalidates global ones; the control pair is a mirror swap, which must reuse, against a shared-bus edit, which must invalidate. From the fork rules of §29: a simulation prefix is reused after an intervention only when the intervention is classified as leaving that prefix unchanged.
What the plan-time pilot showed. On a four-state camera-delivery fixture (two scenes that commit at ticks 2 and 4; a packet delivered at tick 1, then renamed, then at tick 2, then at tick 3), a semantic receipt and a conventional dependency graph given the same eligibility guard evaluated 2, 0, 0 and 1 scene pairs and recomputed the verdict 1, 0, 0 and 1 times, and both matched fresh replay; the variant that omitted delivery time inherited a stale promotion (FACT, §25.22). So a correctly keyed graph ties, and there is no reuse advantage to claim on that fixture. The opportunity that remains is obtaining a physical non-dependence or sensitivity certificate cheaply enough to matter.
Pilot before funding, with a hard stop. Freeze a campaign of 30 amendments before either system sees it: visual-only, camera-timing, sole geometry, floor law, torque, shared-noise, load-authority and facility edits; edits that matter to telemetry and not to a decision; and an apparently cosmetic change that advances a packet by one control tick. A separate engineer implements the incremental incumbent (demand-driven recomputation with solver sensitivity information). Every decision is replayed independently. Record every incorrectly inherited success and every unnecessary invalidation; count unsafe reuse as a false accept even if a later change happens to restore feasibility. Falsifier: any incorrectly inherited verdict. Continue only in cells where the two systems are equally correct and measured critical-path costs support the registered target. Ceiling: bounded by the dirty fraction of the campaign; a dependency analysis at plan time puts exact reuse of rollouts after a mass or geometry edit at no more than about 10% of compute (HYPOTHESIS until measured on our own memo graph), so the benefit lies in analyses and certificates, not in trajectories.
25.9 Design–world duality and minimal counterexamples F
Redesigning the body and designing the world are two sides of one decision problem. Given feasible rivals d_A and
d_B, mission.separate searches a physically admitted world family for a world where the predicted preference
changes by a practically important margin. The smallest such change is often more informative than the largest
simulated reward: for a threshold, one changed edge radius; for a warehouse, a short compliant mat under load;
for a kitchen, a joint condition of layout, optics and friction near a turn.
- Worlds are built from typed procedural primitives and real captures with scale and uncertainty (§19).
- Smallness is defined in authored units: lexicographic edit count first, then normalized physical distance.
- Priors are distinct from admissibility. A rare admissible case can be a useful counterexample while carrying negligible operational probability; both facts are reported, separately.
- Monitors, not rewards. Temporal goals compile into monitors on signed clearance, work, support, sensor age and completion time (§24). Hard limits are frozen separately from shaping rewards.
- The loop. Propose a design; search for violating environments; reproduce the violation on the referee; minimize the violating scene; update the admissible region. Two experiments are carried through every iteration: the failing world, and the counterfactual edit that removes the effect.
- A shrinking trajectory that changes the failure mechanism gets a new event classification. Minimization preserves the first cause (§29) or it starts a new counterexample.
- A scene rewrite declares the causal path it changes: geometry, material, optics, clocks or actors. Moving a light in a commercial kitchen can alter the depth-dropout distribution without altering friction; wetness may affect both. An intervention that does not know which path it changes is not admitted.
- One route proves nothing universal. A route through one environment cannot establish a universal design
verdict; it is a
trace-witness. - Fair baselines. Scenario-based baselines receive the same world generator and the same monitors.
The search machinery (rare-event exploration, bounded-weight estimation, delta-debugging minimization, the
.fmcw format, and the solvability evidence that keeps a counterexample world admissible) is Nemesis, §26.
Augur contributes the question (a pair of designs and a decision, not one design and a score), the admissibility
contract, and the dual query: the smallest priced edit to the world that restores the mission, drawn from the
retrofit catalog of §19 and entered into the same budget as edits to the robot (§25.17).
Pilot and falsifier: the first hybrid-contact slice of §25.23 (row 3). Kill gate: KILL-AUGUR-SEPARATE.
25.10 When a better body cannot rescue a blind policy F
A design agent should be able to ask whether spending more compute on training with the present sensor suite can ever satisfy the mission.
The observation-indistinguishability witness (alias-pair). Construct two physically admissible latent
states that require disjoint successful actions. Fix the permissible probe actions, the time available, the
observation histories and the policy's information. For equal prior classes and a fixed observation experiment
with distributions P and Q, the best probability of distinguishing the states is (1 + TV(P, Q))/2, where TV is
the total-variation distance; this caps action success when success requires distinguishing them. If active
probing is allowed, the bound is taken over all permitted probe strategies, or it is labelled as applying to the
specified experiment only. A claimed universal observability bound fails if a permitted policy can perform a
safe probe the model left out.
The exact fixture. Two sealed payload classes require disjoint final forces, [2, 4] N and [7, 9] N. A binary probe reports the correct class with probability 3/4.
| Sensing policy | Success per class | Meets a 90% target |
|---|---|---|
| Blind | 1/2 | No |
| One read | 3/4 | No |
| Three independent reads, majority | 27/32 | No |
| Five independent reads | 459/512 | No |
| Seven independent reads | 3807/4096 | Yes |
| Nine reads sharing one common fault bit | 3/4 | No |
| One read of a distinct 95% modality | 19/20 | Yes |
| Stop at a vote gap of two, unbounded horizon | 9/10, with 16/5 expected reads | Yes, only without a deadline |
| The same rule, forced to guess after six reads | 225/256 | No |
Exact Bayes classification on the full observation sequence attains the same numbers. Three lessons are part of the specification. First, error dependence, not per-read accuracy, sets the value of redundancy: the common-mode row is the assumption that reverses the sensor-budget decision. Second, "seven" is a fixed-horizon result and is not a lower bound on expected cost across adaptive policies: the sequential rule reaches 90% in 3.2 expected reads. Third, the chance of still waiting after six reads is 27/512, and forcing a fair guess then gives 225/256, below 90%; so delay is priced and the mission deadline is enforced for every sensing policy that is compared.
Three engineering answers to one perceptual ambiguity. The first robot task conceals one of two container classes behind identical exteriors and admits three design edits: a load-sensitive wrist (extract the information), a different camera placement (move to acquire it), or a compliant passive gripper whose success sets overlap (change the mechanics so the information is unnecessary). All three are compared against a calibrated forcemeter and an optimal finite-belief controller, with common-mode faults and occluded placements held out.
A body can remove the need for a sensor. The two force bands are disjoint for a controller that commands terminal force. Consider a different, explicitly modelled plant: a displacement-driven jaw with a series spring of stiffness K closes by x mm on one of two linearly elastic objects, both in contact at x = 0, with stiffnesses k₁ = 1 and k₂ = 4 N/mm. At quasi-static equilibrium F_j = x / (1/K + 1/k_j). Put c = 1/K in mm/N. With at most 6 mm of stroke, a single command works on both hidden classes exactly when
max{ 2(c + 1), 7(c + 1/4) } ≤ x ≤ min{ 4(c + 1), 9(c + 1/4), 6 }.
In (c, x) coordinates this is an exact polyhedral family, and it is an inner cell with a shared policy.
- At K = 4 N/mm, any x ∈ [7/2, 9/2] mm works; x = 4 mm gives 3.2 N and 8 N.
- With stroke capped at 6 mm the stiffness must be at least 28/17 N/mm. At that boundary x = 6 mm, the stiffer object receives 7 N and the softer 56/15 N. The binding condition is the stroke available for the 7 N requirement.
- Relaxing the stroke reveals the force-compatibility bound K ≥ 4/3 N/mm.
This change of body alters the map from command to force. It leaves the information bound for a force-commanded plant intact. A conventional impedance engineer given the same equations designs the same jaw; the value claimed is that the three answers are returned by one query in one comparable form. The falsifiers are physical: break the assumed correlation between required grip and object stiffness by allowing the same stiffness in both hidden classes, and the passive jaw supplies the same force to both and cannot meet disjoint bands; misaligned initial contact, hysteresis, settling time and impact overshoot are further tests. The agent chooses between a better sensor, a passive constitutive law and a low-cost probe by their robustness over independently measured variations. This is a co-design question with a clear experimental answer even if simulation speed is unchanged.
Pilot: run (§25.22, the sensor-alias pilot). Kill gate: KILL-AUGUR-ALIAS.
25.11 Transfer of control through a physical interface M
A shared neural network can save training when robots differ. The stronger goal is to tell an agent which part
of a closed-loop skill can be transferred, and why. mission.transport works at the task boundary.
The object. A skill (§22, .fskill) is represented at its task interface by an observable state, an action
or wrench interface, reachable predecessor and terminal sets, and clock and environment assumptions. A source
robot A and a new embodiment B may realize the same interface through different internal contact modes.
The relation. Seek a relation R(x_A, x_B) and a causal refinement map from abstract commands to target efforts such that:
- every admitted initial target state is related to an abstract state compatible with its observable history;
- for each permitted abstract command, the implementable interface selects one target command using only information available before disturbances act;
- for every admitted target disturbance and every resulting target successor, there is an allowed abstract successor related to it, respecting any shared disturbance law;
- observations, task outputs, timing and target progress are preserved.
This is an alternating simulation: the controller chooses, then the environment chooses. A target with successors {stable, fall} cannot refine an abstract stable-only transition by selecting just its stable branch. Approximate relations carry error and timing budgets small enough to preserve the mission's acceptance predicates.
The F static core. For a carried tray, match tray pose, velocity, allowable contact wrench and
acceleration limits. A quadruped and a wheeled carrier have fundamentally different support transitions, so only
the tray stabilization objective and its feedback state are ported, and only when the target's reachable wrench
set at the tray interface covers the requested one. That coverage test is a polytope or cone containment and is
certified with lp-primal and lp-farkas. Residual motions are resolved by whole-body inverse dynamics (§22).
The counterexample output. At a ramp crest the target may lose lateral authority. The verb returns that contact mode, the requested wrench, the attainable set and a rerunnable counterexample. This localizes the required retraining or body edit to one mode.
The experiment that decides funding. Three treatments at equal compute and equal source data: training from scratch; an ordinary cross-morphology conditioned policy with full transfer learning (§23); and interface-based transfer with limited adaptation. Record new trials to target, irrecoverable failures, task success, contact impulse and energy. Freeze the target morphology and terrain before tuning. A successful transfer of a skill segment does not certify the remainder of the mission.
- Pilot before funding. The tray interface between one wheeled carrier and one quadruped on the CPU referee, with the ramp-crest loss of authority planted. Falsifier: the interface arm needs as many new target trials as the conditioned-policy arm, or it reports coverage where the referee shows a fall.
- Ceiling. The published record for policy inheritance across single-limb topology edits is 33–100% of from-scratch steps (FACT, Appendix H: transfer results), so the saving on a changed-support transfer may be nil; the claim is localization of what must be retrained.
- Kill gate. KILL-AUGUR-TRANSPORT.
25.12 Physics across design families on CUDA and Metal F
A family query wants many related designs in one batch, not only many copies of one body. The batching mechanism is Phylum (§17): per-world model variants inside padded capacities and size buckets. This section states what Augur requires of it and what Augur may conclude from it.
Packing. A family is packed by joint topology, shared rigid subtrees, sensor graph, active contact mode and layout. Continuous parameters live in columns; motion subspaces are shared constants where the family is homogeneous.
Segmenting. A diverging batch is segmented at the first guard whose sign is ambiguous. Exact common-subexpression sharing across designs is allowed only if all inputs and rounding rules agree. Reusing a nearby trajectory needs its own error certificate:
- in smooth phases, a bound on the defect from a local tangent metric, a residual enclosure and the horizon;
- at a contact guard, a transversality margin, event-order separation, a bounded reset map and a bound on the induced change in event time;
- around grazing, redundant contacts or uncertain mode sequences, a fork to separate referee solves.
A small distance in design space alone gives no right to reuse a contact history. After any merge, public timestamps and sensor histories are checked for each logical world.
Placement. Candidate screening and residual evaluation run in bulk. The two RTX 4090 take independent design and scene shards; the Metal worker takes the same portable cell description under its precision profile. Each native device completes the closed loop on its own before a hybrid profile may claim acceleration. Certificates, sensor tensors and physics states are batched by residency. The checker queue runs on the CPU; its capacity and transfer time count toward decision time. A fair comparator also caches graphs, factors and compiled kernels.
The scaling limit. If a fraction f of matched wall time is improvable by a factor r and the new method adds relative overhead h, the speedup is at most
1 / (1 − f + f/r + h)
under that serial cost model. Infinite acceleration of 85% of a workflow gives at most 6.7. With f = 0.97, r = 40 and h = 0.02 the ceiling is about 13.5 (illustrative values, not measurements). The three terms are measured on the strong baseline's critical path before any family kernel is written. Two rules follow. Cheap GPU kernels on already-pruned cells are unlikely to decide anything. A pruning ratio is never multiplied by a GPU speedup that was measured on work the pruning already removed. For overlapped queues the serial model does not apply, and the actual critical path and the throughput of accepted outcomes are measured instead.
What the native pilot showed (FACT, §25.22). Two 65,536-row docking-boundary screens ran on the M5 Ultra and on both RTX 4090. Guarded single precision gave identical decision bytes on each card, on a two-shard placement and on Metal (18 of 18 digest comparisons) with no final error, at the price of an exact host fallback on every row of the near-boundary grid and on 7,282 rows of the separated grid. An exact integer kernel, on Metal and on one RTX 4090, classified every row on the device with no fallback. The host integer path was still the fastest at that size: 23–35 µs on the Mac's CPU against 209–309 µs through Metal, of which 7–13 µs was GPU-active; and 0.42–0.78 ms on the Linux host's CPU against 0.95–1.66 ms on one card and 2.56–4.39 ms on two shards. Dispatch and transfer dominate a small host-resident job. This says nothing about GPU-resident simulation. It does fix two rules of this chapter: strict predicates on a device use the exact-integer class or a guard band with exact fallback, and a family screen is placed where its data lives.
Kill rule carried into §39: time a real amended-mission workflow before writing a specialized CUDA or Metal family solver; if the cost that cannot be removed already exceeds one tenth of the strongest baseline's time, a ten-fold improvement requires changing another stage or changing the claim.
25.13 The continuous morphology family with an exact answer S
This fixture is specified completely so that it can serve as a known answer for mission.synthesize,
mission.refute, the certificate format and the checker.
The mission. A robot carries a 400 N vertical load on four point feet at (±a, ±b). Its centre of mass can move through a rectangle with half-dimensions 150 mm (along x) and 75 mm (along y). Each foot can deliver any independently commanded normal reaction from 0 to 160 N. The pose is fixed, the contacts are coplanar, and all other wrench components are zero. The allocator observes the load and its position before it allocates. Given half-length a = 1/3 m, how narrow can the robot be and still balance the entire continuous payload envelope?
The answer. Half-width b = 3/14 m, a foot-centre spacing of 3/7 m.
Derivation. Order the feet [++, +−, −+, −−] and write u = 1/a, v = 1/b. The payload envelope is the convex hull of the four mission vertices (W, P_x, P_y) = (400, ±60, ±30), because 400 N × 0.15 m = 60 N·m and 400 N × 0.075 m = 30 N·m. Put r = (W + u·P_x)/2, the total force on the two +x feet, and s = (W + v·P_y)/2, the total on the two +y feet. With t = f₊₊ the equilibrium solutions are the one-parameter family
f = ( t, r − t, s − t, W − r − s + t ),
and the vertex is feasible exactly when
max{ 0, r − c₊₋, s − c₋₊, r + s − W } ≤ min{ c₊₊, r, s, c₋₋ + r + s − W }.
At the vertex (400, 60, 30) with u = 3 and equal ratings of 160 N: r = 290, s = 200 + 15v, and the binding pair is t ≥ r + s − W = 90 + 15v (from f₋₋ ≥ 0) against t ≤ 160 (the rating of the ++ foot). So the ++ foot must carry at least 90 + 15/b N, and the vertex is feasible exactly when v ≤ 14/3, that is b ≥ 3/14 m. Reflections cover the other three vertices, and for a fixed design the set of balanced wrenches is convex, so the vertices cover the rectangle.
| Vertex P (N·m) | Forces [++, +−, −+, −−] at b = 3/14 m (N) |
|---|---|
| (60, 30) | (160, 130, 110, 0) |
| (60, −30) | (130, 160, 0, 110) |
| (−60, 30) | (110, 0, 160, 130) |
| (−60, −30) | (0, 110, 130, 160) |
- Inner cell. v ∈ [2, 14/3], with the affine witness (160, 130, 40 + 15v, 70 − 15v) at the vertex (60, 30) and its reflections; each component is affine in v, so checking the two ends of the cell checks the cell.
- Excluded cell. v ∈ (14/3, 6], by the dual y = (0, 1/2, 1/2) of §25.5.3. At b = 1/5 m the ++ foot would need 165 N from a 160 N rating.
- Boundary. The boundary design has zero reserve on two constraints. A designer who wants continuous four-foot contact imposes a positive lower force and re-solves; an unreported force floor is a rejected certificate.
Generalization. Take a full-rank planar template with points qᵢ, actual feet pᵢ = A·qᵢ + d, total vertical load W and spatial first moment P. Set B = A⁻¹ and e = −B·d. Then Σ fᵢ = W and Σ qᵢ·fᵢ = B·P + e·W. With 0 ≤ fᵢ ≤ cᵢ these are linear constraints in the inverse geometry (B, e), the ratings c and the vertex forces, when the mission vertices (W, P) are fixed independently of the design, or when each transformed row has separately been shown affine in the chosen variables. Two equivalent formulations:
- Lifted. One force vector per mission vertex, shared (B, e, c); a robust linear program. For the fixture: 22 variables, 12 equalities, 16 inequalities.
- Projected. Write the wrench zonotope Σ [0, cᵢ]·gᵢ with generators gᵢ = (1, qᵢ). Every facet of a full-dimensional three-dimensional zonotope is parallel to two generators, so for each pair with a nonzero cross product n = g_j × g_k and each mission vertex w emit the pair of support inequalities Σᵢ min(0, cᵢ·n·gᵢ) ≤ n·w ≤ Σᵢ max(0, cᵢ·n·gᵢ). At most 2·V·C(m, 2) rows suffice for m contacts and V load vertices. For the fixture: 6 variables and 32 distinct inequalities.
Convexity in inverse coordinates requires a suitable domain, such as positive bounded inverse lengths. General lateral friction, contact switches and coupled torque limits need different owners (§18, §22). The method builds on established static-equilibrium projection and actuation-aware feasible regions (FACT, Appendix H: Bretl and Lall; Orsolino et al.).
Where convexity fails. A body mass that changes with the design breaks it even with a fixed centre of mass: the midpoint counterexample of §25.4.7. Mass–geometry dependence is kept when CAD edits and payloads are lowered, and a convex hull through two witnesses is not a certificate.
Where authority fails. At b = 1/4 m the ++ force may be anything in [150, 160] N; the midpoint allocation
(155, 135, 105, 5) N balances the vertex (60, 30). A passive suspension of four equal springs on rigid planar
ground adds the compatibility equation f₊₊ + f₋₋ = f₊₋ + f₋₊ and produces (175, 115, 85, 25) N, 15 N over the
rating, with every foot still loaded. The typed certificate therefore states whether the controller can realize
the assumed load sharing and which load observations arrive in time; the same body is inner under
independent-normal-force and excluded under passive-equal-spring.
Validation grid. u, v ∈ {2, 3, 4} per metre and four independent ratings in {0, 80, 160, 240} N give 2,304 bodies; the four mission vertices and their centroid give 11,520 body–load states. The exact answer: 2,254 feasible states, 114 bodies that cover the whole mission, and 1,596 bodies that a support-polygon-plus-total- capacity screen accepts and the exact model rejects (first example: u = v = 2, ratings (80, 80, 80, 160) N, vertex (60, 30), where t would need to be at least 180 N and at most 80 N).
What the pilot showed (FACT, §25.22). Two exact formulations agreed on 11,520 of 11,520 states; the checker reconstructed all 2,254 feasible allocations; a conventional solver agreed on 102 of 102 spot checks; the lifted robust program and the projected formulation each reached the optimum in one solve. The specialized formulation therefore has no speed advantage, and ADR-AUGUR-03 follows: the lifted program is the first implementation, and a specialized kernel is earned through repeated changed queries with real timings.
25.14 Probe and instrument design F
Two materials may produce the same entire force history at one pad radius and prefer opposite grippers at the mission dwell. Fitting a more expressive curve at that radius cannot select the hardware. The question is not "what are this object's physics" but "what is the cheapest realizable experiment that separates the design decisions, or which two indistinguishable worlds require different decisions".
The experiment grammar. The studio has a grammar of experiments beside its grammar of bodies. An experiment may change fixture compliance, pad radius, sensor position, command waveform, exposure time or permitted preload. It is compiled through the same power, frame, observation and contact interfaces as a production body (§14, §18, §20), so a probe is a small robot with a task. Each proposal returns three things: an executable simulated experiment; a bill of fixture parts; and a measurement contract (what is read, when, with what error bound, and which reading implies which decision) that a separate engineer could execute. Theory and precedent exist for choosing tests among hypotheses that require different decisions, and for learning probing actions in simulation (FACT, Appendix H: decision-region determination; active exploration for system identification). The bet here is narrower: synthesize an instrument, check the decision it resolves, and reuse its calibrated result for a whole family.
The algorithm of mission.distinguish.
- Keep the set of physical mechanisms compatible with the archived observations and their uncertainty.
- Partition the mechanisms by the design decision each implies.
- If every mechanism implies the same decision, stop: identification is not needed.
- Otherwise choose the least costly realizable intervention whose possible readings, over the admitted nuisance intervals and measurement error, form disjoint closed sets for every pair of mechanisms with opposite decisions.
- Where observation sets still overlap, return two witness mechanisms, their opposing design margins, and a way to carry the uncertainty into the mission.
- Always admit testing the target directly, at mission conditions, as a candidate.
- If the observations fit no admitted mechanism, report a discrepancy; do not pick the nearest.
experiment.suggest is the scheduler's public face over the same machinery. Its inputs are competing
designs or unresolved cells, their uncertainty, the remaining budget and the allowed parameter changes. It
returns ranked information-gathering proposals (a probe, a measurement on the real part, a rerun at a higher
tier, a cell to split), each with a testable prediction per mechanism and its cost. Ranking uses decision
relevance, with fs-voi where its finite Gaussian menu fits (FACT: that is its present limit); a proposal on a
design that cannot change the decision is worth nothing. The ranking orders work; it never licenses a verdict.
The fixture. A gripper holds its closure displacement. A compact pad A has contact radius a₀ and initial normal load 120 N. A broad pad B has radius 2a₀ and initial load 100 N. The Coulomb coefficient is 0.5 and the supported tangential load is evaluated at the handover, T = 1 s. The normalized load relaxes as R(r, t) = q + (1 − q)·exp(−t / (τ·f(r))) with radius ratio r = a/a₀, q ∈ [0.18, 0.22], τ ∈ [0.9, 1.1] s. Four synthetic laws differ only in f:
| Law | f(r) | Meaning | Preferred pad at T |
|---|---|---|---|
| V | 1 | Intrinsic relaxation | Compact: 29.66 N against 24.72 N |
| P | r² | Relaxation time grows with the square of contact size | Broad: 41.15 N against 29.66 N |
| C | min(r, 1)² | Capped drainage length | Compact, as V for r ≥ 1 |
| D (withheld) | For r ≥ 1 the exponent is −[k·min(s, 1/4) + (1 + (1 − k)/3)·max(s − 1/4, 0)] with s = t/τ and k = 1/r²; for r < 1, as P | Follows P until s = 1/4, then reaches the V value at s = 1 | Compact |
The values are at q = 0.20, τ = 1 s. At r = 1 all four histories coincide for every q, τ and t, so a recording at the compact radius, at any frame rate, cannot choose the pad. Contact size is a physically motivated distinguishing variable (FACT, Appendix H: contact-size dependence in gel indentation); the laws themselves are artificial and the loads are stipulated.
Probe candidates are r ∈ {1/4, 1/2, 1, 3/2, 2, 3} and t ∈ {1/16, 1/8, 1/4, 1/2, 1, 2} s, with normalized read error bounded by ±0.02 and cost 0.25 s of setup plus the exposure t. Each law is scored on 225 deterministic cases (25 pairs of q and τ, three probe errors, three errors on the archived reading).
| Method | V | P | C | D | Cost |
|---|---|---|---|---|---|
| Archived trace alone | refuses 225 | refuses 225 | refuses 225 | refuses 225 | 0 |
| Probe generated for {V, P}: r = 1/4 at 62.5 ms | 225 correct | 225 correct | 225 wrong | 225 wrong | 0.3125 s |
| Probe generated for {V, P, C}: r = 2 at 125 ms | 225 correct | 225 correct | 225 correct | 225 wrong | 0.375 s |
| Programmed expert, same laws, grid and intervals | 225 correct | 225 correct | 225 correct | 225 wrong | 0.375 s |
| Direct: measure B at mission dwell, with the archived A reading | 225 correct | 225 correct | 225 correct | 225 correct | 1.25 s |
For the three-law probe the readings lie in [0.8737, 0.9362] under V and C and in [0.9520, 0.9982] under P; the nearest ends are 0.0158 apart after error and nuisance are included, so the separation is real inside the admitted class.
The lesson, which is normative. A probe that is perfect in class can reverse on held-out cases: the three-law probe was right in 675 of 675 admitted cases and wrong in 225 of 225 cases of the withheld law, whose early trace is identical to P's. An in-family residual check cannot expose that alias, because the reading falls inside the predicted interval. Therefore:
- a probe verdict is a conditional witness, and its condition (the admitted mechanism set) is in the certificate and in the answer's assumptions;
- a stopping rule derived from a probe is not used on an uncharacterized material;
- the direct measurement at mission conditions is always in the candidate set and is the stronger comparator; an early reading taken during the same stroke may be continued to the mission dwell, which preserves the audit trail and forfeits the exposure saving;
- generating a probe for a mechanism class that omits a member (the two-law probe on law C) is the same failure, one level down.
Ceiling, stated before any speed test. With setup h, common validation cost v and engineering cost e per decision, the ratio of direct to probe cost is (h + 1 + v + e_direct)/(h + 1/8 + v + e_probe). With equal engineering it is at most 8 at zero overhead and 3.33 at the stipulated h = 0.25 s. Against the programmed expert, who chooses the same schedule from the same intervals, it is 1. No ten-fold effect is supported.
The family consequence. Which combinations of pads can sustain a 75 N pull? If the contacts are independently loaded and total pull is additive, a sum of per-pad lower bounds admits an assembly and a sum of upper bounds excludes it. With compact and broad modules of 100 g and 120 g, at centred nominal readings (q = 0.20, τ = 1 s, zero realized read error) the minimum certified mass is three compact pads (300 g, lower bound 85.37 N; the best lighter assembly has upper bound 61.72 N) under V, and two broad pads (240 g, lower bound 80.30 N; the best lighter assembly has upper bound 73.01 N) under P. Three ways this certificate fails, each a fixture:
- Additivity. A common pressure regulator or coupled deformation invalidates it. The first two-pad scene tries to break the assumption.
- Wrench balance. Two point pads at transverse positions ±s, no admissible contact couple, and a 75 N pull at offset e carry 37.5·(1 ± e/s) N. At e/s = 0.15 one pad needs 43.125 N, above the nominal broad P-law upper bound of about 42.152 N, although the two lower bounds sum to about 80.304 N. Centred and eccentric pulls are separate fixtures.
- Nuisance. An admitted low-force V observation (q = 0.18, τ = 0.9 s, compact read error −0.02) drops the three-compact lower bound to 73.79 N, below 75 N. The minimum-mass certificates hold at the centred nominal readings only, and say so.
Pilot: run (§25.22). Next experiment before funding the grammar: hide multi-pad spacing, actuator coupling, a finite layer and friction variability in an independently implemented contact model; give both arms unseen layouts, the same probe grammar and direct tests at mission dwell. Falsifier: a single false assertion of a lower bound under cross-pad coupling, or generic interval propagation plus direct measurement matching the authoring and validation cost. Kill gate: KILL-AUGUR-PROBE.
25.15 Buying information with early control inputs S as a fixture, F as a method
A first control input can be a probe: it changes what later observations reveal. Whether that helps depends on when the observation arrives. The docking family is the first mission slice (M1, CPU only) because it is exact, dynamic, causal, and small enough to check by hand.
Model. Measure position in metres and time in seconds. A robot docks in three one-second ticks from x₀ = v₀ = 0, with acceleration g·u_k held constant over tick k, hidden fixed gain g ∈ {1, 2}, commands bounded by abs(u_k) ≤ U, and target (x₃, v₃) = (1, 0). Exact zero-order-hold integration gives
v₃ = g·(u₀ + u₁ + u₂), x₃ = g·(5u₀/2 + 3u₁/2 + u₂/2).
The only informative packet is the first velocity reading v₁ = g·u₀. It arrives either before the second command is decided, or after the third command is committed.
On-time packet: a witness. Choose u₀ = 1/4. The packet identifies g = 4·v₁. Then u₁ = 1/g − 1/2 and u₂ = −u₀ − u₁. The sequences are (1/4, 1/2, −3/4) for g = 1 and (1/4, 0, −1/4) for g = 2, both within U = 3/4, and both reach (1, 0) exactly.
Late packet: an exclusion. A causal controller must issue the same command vector in both worlds. The
terminal position for a common vector scales with g, so it cannot equal 1 for both gains. Private randomization
cannot give guaranteed success in both either. The same hardware and the same two plants admit opposite answers
to the robust mission solely because of the delivery time. This is an alias-pair certificate whose scope is
"all admitted policies".
The exact sensor–actuator trade-off. Let U ∈ [1/2, 1]. Give the early packet additive error in the closed interval [−ε, +ε], with no later informative packet. Write p = u₀. The terminal equations force u₁ = 1/g − 2p and u₂ = p − 1/g. Intersecting the actuator bounds for both worlds gives 1 − U ≤ p ≤ (U + 1/2)/2. At a reading possible in both worlds the required second commands differ by 1/2, so the two reading sets, centred at p and 2p, must be disjoint: p > 2ε. Maximizing the separation gives the exact family
ε < (U + 1/2)/4, with equality excluded.
For U = 3/4 the probe p = 1/4 tolerates ε below 1/8; the probe p = 5/8 tolerates ε below 5/16, a tolerable
sensor error 2.5 times larger on the same actuator. At equality both worlds can report 15/16 while requiring
second commands −1/4 and −3/4. Physics, sensor and controller appear in one hardware design inequality, and
mission.refute at ε = 5/16 reports the binding constraint and the open repair threshold U > 3/4 (§25.3.6).
The grid that checks the implementation. 17 actuator bounds at spacing 1/32 and 33 error levels at spacing 1/64 give 561 cells: 344 admissible, 217 excluded, nine of them exact boundary cases. All 561 late-packet cells are excluded.
Hidden manufacturing tolerance reverses the verdict. Keep the packet, the deadline and the exact target, and admit one more gain, 33/32. At U = 3/4 and ε = 1/64 the reading (65/64)·p is possible for both g = 1 and g = 33/32 for every first command, so both worlds receive the same remaining commands. Their final positions are c and 33c/32, and the smallest achievable worst absolute error is 1/65 m (at c = 64/65), attainable with zero final velocity. More generally, with bounded probes and ε > 0, a nondegenerate interval of hidden positive gains contains an indistinguishable pair that requires different second commands, so an exact docking guarantee fails; the amended game with a finite position tolerance is solved for a continuous gain interval in this chapter's subsection on docking to a finite tolerance (least guaranteed tolerance (√1745 − 41)/32 m, about 24.2 mm, at U = 3/4 and ε = 1/64). The rule: gain support, delivery deadline, error units and target tolerance are bound to a classifier's eligibility. A screen compiled for {1, 2} is not reused on {1, 33/32, 2}; under that amendment every one of its positive labels is wrong.
What the pilot showed (FACT, §25.22). The two command sequences were checked in rational arithmetic. An independently formulated scenario-tree comparator, built from the raw state transition, used two linear-program extrema for the first command and one common-command feasibility program per actuator bound; those 51 solves matched 561 of 561 cells, and three further solves checked the fixed-probe control. On the amended three-gain mission all 34,590 nominally feasible labels on each 65,536-row native grid reverse. An ordinary observation-tree robust planner given the same model, actions and latencies gets the same answer; there is no claim of a new algorithm, and no product or device timing follows from a scalar model.
The method beyond the fixture F. For a mission with a movable velocity sensor, a soft docking pad, or real
contact, Augur seeks the error and delay threshold at which one causal policy still works, records whether the
threshold is attained, and independently searches for an observation history consistent with two worlds that
defeats its last common action. Sensor processing, latency and actuator authority are charged to one budget. The
lowering is a finite observation game when the hidden set and the packet schedule are finite, and a Tested
campaign otherwise. Pilot before funding the general method: recover this family through the public verbs,
including the equality counterexample and the withdrawal under the three-gain amendment; the conventional
scenario-tree program is the baseline and may be the shipped implementation.
25.16 Proving that a replacement improves a decision when neither robot has a guarantee F
An engineer asks: can replacing this sole cause a formerly successful delivery to fail? The two success sets are expensive to compute and may be mostly unknown. Ask directly for the relation.
Definition. For two fixed causal controllers, a regression is a shared world input in which A succeeds and B fails. Build the product of the two systems driven by the same exogenous scene, payload and clock law, and ask whether the terminal pair (A succeeds, B fails) = (1, 0) is reachable.
- Unreachability of (1, 0) over an enclosure of every admitted joint execution, with progress and nonempty
executions, establishes dominance on the cell (
product-unreachable). - A concrete admissible paired trace that reaches (1, 0) is a counterexample (
trace-witness). - An outer enclosure that intersects (1, 0) triggers a witness search or an unresolved verdict.
Joint coverage is checked explicitly. The diagonal pairs (0, 0) and (1, 1) project onto both full marginal outcome sets and hide (1, 0) when the two internal branch choices can vary independently. Only the declared shared inputs and disturbances are coupled; every other admissible branch combination is retained for a worst-case assertion. A learned controller retuned for each body needs its own information and budget contract and is a different query.
The hand-checkable example. Let one measured surface parameter z range over [0, 1]. A completes when z ≥ 3/5 and B when z ≥ 2/5. Each has both successful and failing worlds; neither has a guarantee. A separate interval for each binary output allows all four pairs. The coupled constraint eliminates (1, 0): the replacement loses no previous success and adds the interval [2/5, 3/5). Under a uniform law the gain is 1/5; without a law the interval of newly covered surfaces is still an engineering answer. A relative zero-loss assertion does not establish that either robot meets the absolute mission, so the verb emits the per-design absolute hard-limit verdicts beside the paired verdict, with the required telemetry and energy accounting, even when the relation was proved cheaply.
Shared inputs are compiled at physical coordinates. Two tyres following different paths over the same floor need not receive equal friction samples at corresponding ticks. The product uses one space-indexed material field and each robot's actual contact point. Shared latent lighting produces different sensor residuals once the cameras diverge. This is where the product differs from pairing episodes by world address (§28): pairing by address shares seeds, and a seed indexed by tick is not a field indexed by position. The checker confirms that each projection of the product solves its original plant and that the common variables express the requested physical comparison. The initial domain is split where a mode transition could break relational invariance, and a numerical branch that cannot be enclosed goes to per-case replay.
Challenger. A conventional hybrid reachability tool on exactly the same coupled product with common inputs and the same terminal monitor (FACT, Appendix H: Flow*). The proposed advantage is selective closure of decision cells, reuse across amendments, and a robot-specific lowering that preserves spatially coupled disturbances. Every assumption translation, uncertainty split and checker call is charged to both arms.
- Pilot before funding. One contact transition (a sole replacement on a single step edge) with a shared space-indexed friction field: close parameter boxes where every compatible branch pair has identical joint labels, split or replay the rest, and feed the labels to the frozen paired rule of §24. Falsifier: one mislabelled draw against per-case referee replay, or the conventional tool closing the same cells at similar cost.
- Ceiling. Bounded by the fraction of paired draws whose joint label can be closed without replay, measured on the pilot before any claim.
- Kill gate. KILL-AUGUR-DOMINANCE.
The stronger combined test, scheduled after both pilots: replace a sole, perturb the clock, and ask which previous A/B conclusions can still be proved without rebuilding the contact and observation history (§25.8).
25.17 Designing the robot, the facility and the handoff together M
The flagship query is a brownfield logistics commission. An engineer provides a partial 3D survey of a stockroom, a retail aisle and a commercial kitchen; a catalog of body modules; permissible room changes; pack temperatures; and delivery windows. A shared doorway and an unloading counter are the bottlenecks. The query asks for a Pareto set over body cost, facility-change cost, energy per delivered item, worst admitted delivery time, and route availability after one module or charger drops out. The answer can be one modified carrier, two simpler robots with a handoff, a small threshold retrofit, or a finding that every allowed alternative leaves a mission unmet. A dry warehouse loading bay, a furnished apartment and sloping outdoor service terrain are transfer tests with new geometry, measurements and holdouts.
- Compile a surveyed site into possible worlds. Scans and CAD are registered to a gravity frame (§19). Clearance, door swing, movable racks, wheel–floor friction, lighting, clock uncertainty and material provenance are carried separately. An unseen gap beneath a shelf has possible geometry, not assumed geometry. A route depends on the swept body volume and turning radius including the payload. Sensor views follow the same reconstructed geometry and their own latency. The site model attaches actionable residuals: the one doorway width, or wet-surface measurement, on which two solutions disagree.
- Compose mission stages across robots. Each approach, latch, carry, handoff and recharge exports entry and exit sets, occupancy intervals, available observations, resource budgets and load-wrench limits. Stages compose only if every promised exit lies in the next admitted entry under a compatible clock and the shared payload state (rule 4). Two robots cannot each spend the same reserve charge, use the same doorway during incompatible intervals, or both count the payload support. The timed discrete schedule is searched as a master problem; continuous subproblems on the referee and the batched tiers generate feasible witnesses and sound infeasibility cuts; a timed-out motion search leaves its candidate open. Each actuator has a named decision maker with its own history at commitment time.
- Give the optimizer a priced world-edit grammar. A removable ramp, a sensor fiducial, a change of docking pose, a wheel or sole swap, a repositioned handoff surface, where the brief permits them, each with installation time, access constraints, floor availability, calibration, part tolerances and future maintenance (the retrofit catalog of §19). Editing the floor and editing the robot enter the same budget. The comparator receives the same actions and costs and conventional mixed-integer scheduling, motion-planning and robust-optimization tools. The answer is a lower bound plus feasible alternatives, the remaining optimality gap, and the intervention that removes it.
- Model operation over time. Tyre and track wear, changing traction, motor thermal reserve, battery sag, cleaning cycles and load uncertainty are coupled only through versioned owner models (§15, §31). Shared disturbances vary across vehicles. One cold episode does not validate a shift: replay a hot restart and the loss of a charger at a handoff. Family claims stay conditional on calibrated duty-cycle ranges and on the specified recovery controller.
- Earn difficult matter one decision at a time. A sloshing tote changes braking and handoff forces, a hanging cable changes allowable turns, a compliant carton changes allowable grip. Start with rigid ballast, a damped pendulum and a single compliant contact as independent reference cases (the rigid proxies of §19). Promote fluid, rod or textile coupling only where a held-out design ranking actually changes and comparison with measured or independently resolved motion improves.
- Return counterfactuals an engineer can act on. Under each change budget: the cheapest repair when
attained, or an infimum bound and the gap of an admitted candidate; the minimal obstruction for each excluded
alternative; the smallest site survey that could settle a tie; and a dispatchable simulated acceptance
mission for each survivor. After a door is narrowed or a gripper supplier changes the material,
mission.revalidatereports which prior measurements, certificates and trained skills survive by their actual physical dependencies.
The information fixture. In a handoff, A sees the payload bit and B must choose its matching latch before observing A. A pooled-history planner succeeds on both bits. Every deterministic local choice for B fails on one. Delivering the bit to B by its commitment restores success. The certificate records channel capacity and worst admitted delivery time, and the counterexample is checked with on-time and with late delivery.
The acceptance fixture begins with two carriers, one counter, one door, two material states and a single handoff. The discrete schedules are enumerated, and the comparator uses the same strongest continuous subsolvers. A complete reference verdict requires a feasible witness or a checked exclusion for every relevant continuous subproblem, with optimality bounds for any minimum; unresolved cells are reported when the continuous subsolver times out. Four failures are hidden: a protruding payload corner, a common loss of traction, a skewed handoff clock, and a supply change. The studio must withdraw the affected family claims and export a minimized failing scenario for each.
Stop rule. Expansion to a multi-room shift is funded only after the fixture discriminates at least two feasible engineering strategies and recovers each seeded failure. If the fixture fails, the work reduces to the failed subtask, and until that subtask is revalidated its uncertainty propagates through the handoff contract.
- Ceiling. Unknown, and stated as such: this is the largest scope in the plan and no pilot beyond the handoff bit and the shared-bus schedule has run. Nothing in M0–M7 depends on it.
- Kill gate. KILL-AUGUR-FACILITY.
25.18 How much a factory must tell a shared controller F on supplied sets, M from contact
A product engineer can pay to measure, store and transmit a calibration label for each manufactured variant. The query asks for the minimum number of distinct labels that lets one controller serve all admitted variants and payloads by a common commitment deadline. The information passed from manufacturing becomes a design variable beside the mechanism and the sensor. A label that arrives after a decision is committed has zero value for it.
The encoder premise comes first. When the factory can identify the variant by the labelling deadline, the
colouring below computes what the controller needs. When the factory measures an unknown build, the query
requires an encoder from available station records to tags, and a decoder from the received tag and the field
observation to commands. Suppose builds A and B need opposite commands, and their possible station records are
{left, shared} and {shared, right}. Both can yield shared, so every encoder emits the same tag in that case,
and no number of tags guarantees success on both if the field history also agrees. An independently established
build identity, or another separating factory measurement, restores the premise; its cost, uncertainty and
delivery time are priced.
The colouring. For a fixed observation-identical prefix let K_s be the set of commands that work for every admitted payload and tolerance of variant s. A set of variants can share a label exactly when their command sets have a common point. Build a hypergraph on variants with an edge for each inclusion-minimal collection whose intersection is empty. The least number of labels is the least number of colours with no monochromatic edge. A colouring with one feasible command per colour certifies an upper bound; a checked impossibility of colouring with one fewer proves minimality. For finitely many convex command sets in dimension m, Helly's theorem bounds a minimal obstruction by m + 1 sets. Hidden contact modes can make the sets nonconvex and remove that shortcut. If one variant has an empty command set on its own, no label makes the fixed-prefix mission feasible.
One label map across histories. The factory commits to one label map before the later history is known. For finitely many exogenous public histories, collect the minimal conflicts at each history among the variants that admit it, colour their union once, and return an action for every reachable (label, history) pair. With variants A, B, C and three public readings that require opposite command bits for A and B at the first, B and C at the second, C and A at the third, two labels suffice at each reading separately and a fixed map needs three. Both counts are tested. For action-dependent histories the query is a causal policy tree with a common factory map and shared-prefix decisions.
Known answers.
- Pairwise compatibility is not enough. Commands (x, y) ∈ [0, 1]². Three variants require x ≥ 2/3, y ≥ 2/3 and x + y ≤ 1. Every pair intersects; the triple does not. Two labels suffice: (2/3, 2/3) for the first two and (0, 0) for the third. One label is impossible, since x + y ≥ 4/3 conflicts with x + y ≤ 1.
- Deadlines change feasibility. A one-axis placement with error e = u − bᵢ − q − δ, where the fixture offset bᵢ ∈ {−1/4, 0, 1/4} mm identifies the variant, the manufacturing offset q ∈ [−1/32, 1/32] mm is hidden, the payload term δ ∈ [−w, w] mm is hidden, and success is abs(e) ≤ 3/8 mm. The largest tolerable payload half-width w is 3/32, 7/32 and 11/32 mm with one, two and three labels delivered before commitment, and 3/32 mm for any number of labels delivered late or for one common action.
What the pilots showed (FACT, §25.22). An independent SMT encoding returned unsatisfiable for one shared label and satisfiable for two, with its own two-label witness. On the deadline fixture, belief-window intersection and symbolic elimination agreed on all five cases. So ordinary elimination already answers the query on supplied sets, and no advantage over an SMT or mixed-integer baseline is claimed.
The open problem is extraction. The expensive step is obtaining K_s from a physical gripper across friction, pose, deadline and compliant contact. For a real commissioning question only inner and outer command sets may be known: a constructive common action needs inner sets, an impossibility needs inconsistent outer sets. The verb returns a lower and an upper label count when they differ, and names the one measurement that would narrow the gap. The first purchase decision is whether deriving command sets from a qualified gripper is cheaper than testing or labelling every part directly.
- Pilot before funding the M part. One manufacturing fixture: derive inner and outer command sets for three gripper variants from the referee, compare the label interval with direct per-part testing at equal cost. The SMT or mixed-integer baseline receives the same command envelopes, their full derivation costs, and equal access to existing labels. Falsifier: derivation costs more than direct labelling, or an inner set contains a command the referee shows failing.
- Ceiling. The label count saved, times the per-label cost, minus derivation cost; unknown until the pilot.
- Kill gate. KILL-AUGUR-LABELS.
25.19 Using geometric phase to invent locomotion F on kinematic fixtures, M as an atlas
A wheeled snake or an admitted wheel–leg mechanism can move through cycles of internal shape even though its shape ends where it started. The forward oracle exists already: the holonomy construction of §10 (C-08) and the connection-curvature analysis A-09 (§28) rank morphologies by displacement per shape cycle. Augur turns the oracle into an inverse query with a body edit in it: find the least costly periodic shape change that gives a specified displacement, has zero net yaw and fits a doorway; and if none exists, name the hardware change that enables that direction of motion.
Setting. Represent the pose by g ∈ SE(2) and the shape by r. On a qualified no-slip, fixed-rank, quasi-static stratum, derive or learn a local connection g⁻¹·ġ = −A(r)·ṙ from the rolling constraints and the force model. A change of coordinates changes the representation of A; reconstructing the same physical gait in a different chart or body frame must predict the same physical motion after transforming back, and that is a test (FACT, Appendix H: Hatton and Choset).
Procedure. Start with a mechanism with two shape variables and one contractible loop. Integrate the ordered body twists on the group to obtain the holonomy. Use the curvature of the connection to propose small loops that generate useful translation; retain group ordering for large loops. A wheel or foot arrangement that changes the constraint distribution is a body edit in the same search, so the agent can ask which hardware change enables a direction of motion at a given posture, and then ask for a finite example with actual control, thermal and clearance limits.
Limits that are part of the specification.
- Contact-mode transitions require hybrid reset maps and fresh constraint-rank checks. A loop in shape space that crosses slip or lift-off cannot borrow its old connection.
- A four-wheel fixed-axis skid-steer turns by scrubbing. With fore and aft axles at ±a, exact lateral no-slip requires both v_y + a·ω = 0 and v_y − a·ω = 0, which forces ω = 0 for a > 0. Its yaw needs a separately qualified slip model, and the no-slip connection must refuse it.
- A Lie-bracket accessibility direction is infinitesimal and depends on the drift and the admissible inputs. With ẋ = u ∈ [0, 1] the rank is one and negative x is still unreachable from zero. A finite mission needs the integrated witness, not the rank.
Known answer. A two-wheel differential drive with a free caster, wheel radius ρ and half-track w, under ideal rolling. Its shape variables are the two wheel angles. The square loop (left wheel forward by δ, right wheel forward by δ, left wheel back by δ, right wheel back by δ) produces zero net yaw, zero net advance and a sideways displacement of exactly 4w·(1 − cos θ) with θ = ρ·δ/(2w), which is ρ²·δ²/(2w) to leading order: the Lie bracket of the two wheel fields. The reversed loop produces the opposite displacement.
Reference cases. A fixed steering configuration (no holonomy); a loop and its reverse; a joint-axis reflection; a lateral-slip counterexample that must withdraw a gait. The comparison arm is direct collocation and trajectory optimization over the same loops, in cycles per metre at the same actuator costs. Scores: the computed group displacement, the ordered-cycle reversal residual, operating-region coverage, energy, and time to recover a new gait after changing wheel spacing.
- Pilot before funding. The differential-drive loop and a three-link kinematic crawler on the CPU referee. Falsifier: the reversal residual or the chart-change residual exceeds tolerance, or trajectory optimization finds every proposed gait at lower total cost.
- Funding rule for the atlas M. A shape-space atlas is funded only after an independent full referee rollout admits at least one newly proposed gait, and a changed-contact test withdraws a formerly valid one.
- Ceiling. Exact only for principally kinematic systems; for dynamic walking it is a diagnostic. Published full-order orbit solves take about 4–260 s of CPU at 20–68 states (FACT, Appendix H: orbit-library solve times), so a gait proposal is a screening signal.
- Kill gate. KILL-AUGUR-PHASE.
25.20 Computing with symmetry at the instant of contact F as a test, M as an amortization
A symmetry of the body (§10, C-09) saves work only while it commutes with the events of the hybrid dynamics. The compiler checks that claim at an individual event. For a group element h, pre- and post-event states x⁻ and x⁺, and a transversal event e, let S_e map perturbations across the event, including the change in its time (the saltation matrix of the hybrid constructions in §10). A consistent relabelling of states, contacts and parameters must give
D h(x⁺) · S_e(x⁻) = S_{h·e}(h·x⁻) · D h(x⁻).
This is a commuting-diagram test with a physical observable.
The test. Reflect a four-foot landing and exchange the left and right sole laws. In the symmetric fixture, transforming a one-sided perturbation before the impact or after it must predict the same change in tray roll and ankle load. Repeat with an asymmetric payload, unequal packet latency, a grazing toe, and two simultaneous contacts; each of these must break the identity or route to the rules below.
Rules.
- A small or uncertain guard-crossing speed makes a single-event saltation matrix unreliable; derivatives near grazing are labelled unsupported.
- A new event order makes the correspondence itself ambiguous. Preserve both continuations, split the symmetry class, or run full referee trajectories.
- A passing check transports a local derivative to a corresponding event, and no more. Reducing one nominal trajectory into symmetry blocks requires a symmetry that fixes its nominal state, history, parameters and event, or a separately checked intertwining relation between the admitted subspaces at that trajectory's endpoints.
- A sliding impact and its mirror can obey the identity while a normal-speed perturbation changes tangential speed at either impact. That cross term stays in the full derivative. Mirrored sliding events and an invariant sticking event are exercised separately.
- Finite performance claims still need finite changes and the complete operating envelope.
- A proof about fixed-shape gain changes cannot transport a derivative through the replacement of a wheel or a limb.
- Simultaneous touchdowns that are simultaneous by symmetry (trot, bound, pronk) are admitted, not refused; they are the case the identity is for.
Use. A change of symmetry may itself locate the physical decision boundary an engineer needs to inspect, so a failed identity is reported as a finding with its event, not as an error.
- Pilot before funding. The identity in CPU reference coordinates with relocated one-sided finite differences on the mirrored four-foot landing. Falsifier: the identity holds on the asymmetric-payload mutation, or fails on the symmetric fixture beyond the finite-difference error.
- The M question. Whether checking the symmetry mask and event map once per family reduces the time to decide a design amendment on either GPU. The challenger gets an event-aware differentiable simulator, graph automorphisms, finite-difference fallback and the same sealed costs. Where mode bifurcations dominate, the event telemetry is kept and the assumption of amortized tangent work is retired.
- Ceiling. At most the group order on the tangent work of symmetric events, and tangent work is a fraction of decision time that is measured first.
- Kill gate. KILL-AUGUR-SYMEVENT.
25.21 Constructive lanes (frob-synth)
The lanes above decide. These propose. A design that comes out of frob-synth is a candidate with a label; it
enters I only through §25.4.5. Each lane is exposed as a strategy of mission.synthesize
(--strategy codesign|refine|linkage|continuation) and reports its candidates into the same answer.
Two small exact constructions ride on the same machinery and need no lane of their own.
- Mass placement inside a chassis volume F. Given a target pseudo-inertia and the CAD support of a body,
find nonnegative masses on a finite basis of admissible sites that realize it; the placement is an
lp-primalwitness and infeasibility anlp-farkasexclusion. Known answer: mass 1 kg in a ball of radius 1/10 m with principal moments 1/125 kg·m² each passes positivity, the triangle inequalities and the per-axis bound I ≤ m·r², yet needs a mean squared radius of 3/250 m² where only 1/100 m² is available (a thin shell reaches 1/150 kg·m²), so no placement exists. - Single-actuator-loss robustness F. For each catalogued actuator removal, a rank screen on the remaining
wrench map, then a bounded feasible allocation as a linear program. It answers the static half of "route
availability after one module drops out" (§25.17); dynamic recovery needs more than rank and stays
Tested.
25.21.1 Monotone co-design S for catalog closure, F for Pareto antichains
What it is. Components are feasibility relations between a poset of delivered functionality and a poset of
required resources (§10, C-12; posets and antichains live in frob-algebra). Carrying a given payload for a
given shift requires motor torque, electrical supply and heat rejection; adding battery capacity adds mass that
flows back into the torque requirement. In the monotone admissible fragment this feedback is a least fixed point
over resource antichains, found by Kleene iteration x₀ = ⊥, x_{k+1} = f(x_k). The lane returns the antichain of
minimal resources (least mass, least power) that deliver the functionality, or a proof that the iteration
leaves the admitted resource bound, which is an exclusion of the catalog under the stated relations.
Stated conditions. The order on each poset; monotonicity and Scott continuity of each component map; the bounds; the convergence criterion (a fixed antichain, or exit from the bound). On finite catalog chains termination is guaranteed.
Scope. Actuator, gearbox, battery, compute and material selection (FACT, Appendix H: Censi; Zardini et al.
for component selection). Gait performance is not monotone in link lengths, so locomotion enters only through a
surrogate that comes from simulation, and a result that rests on such a surrogate is Estimated.
Do not force the plant into a monotone budget model. If a changed gearing trades a larger static moment for a blocked swing, or introduces a contact mode, the possibilities are kept in separate cells or the original mechanics are dispatched. Shared resources are joint and time-dependent: the two-finger bus of §25.4.7 has zero feasible one-tick schedules and two feasible two-tick schedules with identical local motor limits, and it is the negative control for any contract compiler. The research question is how much of a physically measured robot and facility can share such contracts across edits, counting the cost to derive and independently validate them.
- Known answers. The mass-spiral closed form of worked card GB-03; the two-finger bus.
- Pilot before funding the F part. A 20-variant sweep of wheel radius, mass and gearbox against a dependency graph given the same checked envelopes and warm solves, tracing the whole feedback path from electrical limits to drive torque, normal load, traction and controller-visible state. Falsifier: any pruned design is independently feasible under the same mission; or the lane mis-ranks more than 20% of the top designs against the referee.
- Ceiling. Bounded by the share of the design decision that is component sizing; a conventional monotone co-design solver is the comparator and may be the implementation.
- Kill gate. KILL-SYNTH-CODESIGN.
25.21.2 Trajectory optimization with design variables F
What it is. Local refinement of one design for one motion: a direct transcription whose decision variables
are states, controls and contact forces at knot points and a vector θ of continuous design parameters (link
lengths, attachment points, trunk shape, motor mass, gear ratio). Constraints are the dynamics defects, friction
cones, actuator envelopes from the cards (§15), joint limits and the mission's hard limits. The contact
schedule, the topology and the task are fixed in advance. Gradients with respect to θ come from the derived
kernels (§21). The solver is sequential quadratic programming or an augmented Lagrangian (FACT: fs-ascent has
both, with certificates of KKT residuals; fs-adjoint has an implicit-function-theorem module). No collocation,
multiple-shooting or differential-dynamic-programming trajectory optimizer was found in a search of fs-opt,
fs-ascent, fs-control and fs-adjoint (FACT-to-recheck at the pinned commit), so the transcription is new
work here, on the CPU.
Its published scale (FACT, Appendix H; to be re-read). On a 12-degree-of-freedom quadruped with a design vector of 4 to 17 parameters, the worst observed solve was 252 s against 600 s for a covariance-matrix evolution strategy on 8 threads, and cost improvements held in simulation within 10% of those found in optimization (Dinev et al.). A two-joint monoped took about 9 hours for 10³ trajectory problems at 33.72 s per solver call (Fadini et al.). The surviving claim is therefore: about 12 degrees of freedom, up to 17 continuous parameters, a fixed contact schedule, 4 to 10 minutes on 8 CPU threads.
What it is not. It is not a design search, a controller, or evidence. The optimized plan assumes rigid
contact and ideal actuators unless the cards say otherwise. No source read reports the fraction of optimized
designs that pass an independent closed-loop evaluation; that fraction is the deciding number and is
unmeasured. A refined design therefore leaves the lane labelled candidate, with its nominal trajectory and
its sensitivity to each parameter, and goes to the fidelity ladder of §28.
- Pilot before funding. With an existing external optimizer, outside the product, generate 20 candidate designs for three missions (trot at 1 m/s, a 0.3 m step, a 5 kg payload) on a 12-degree-of-freedom quadruped, each within 10 minutes on 8 threads; evaluate each on the referee route of §24 against the nominal design on held-out terrain. Falsifier: more than 10 of 20 fail or do not beat nominal, or solves exceed the budget. Cost: about three engineer-days and 10 GPU-hours (TARGET).
- Ceiling. It refines; it does not decide more designs per turn. An existing optimizer over an existing dynamics library does this today, so the lane is parity, not an advantage.
- Kill gate. KILL-SYNTH-TRAJOPT.
25.21.3 Bounded exact linkage synthesis F
What it is. Constructive design of parallel legs, ankles, steering linkages and small closed chains from
precision poses, in exact arithmetic, inside the real limits of the symbolic sibling. FACT
(frankensympy/crates/fsym-solvers/src/real_rur.rs, fsym-polys/src/groebner.rs): the real solver is capped at
8 variables, 64 equations, 4,096 terms, total degree 256, 4,096-bit coefficients, 2 × 10⁸ work units and
512 MiB, for zero-dimensional ideals only; Gröbner bases are capped at 1,024 basis polynomials and 10⁶ pending
pairs; there is no homotopy solver. Unbounded whole-robot Gröbner synthesis is therefore not built.
Three steps.
- Three-pose planar dyads. Given three positions P₁, P₂, P₃ of a moving pivot in rational coordinates, eliminate the crank radius from ‖Pᵢ − O‖² = ‖P₁ − O‖²: the fixed pivot O solves the rational 2×2 system 2·(Pᵢ − P₁)·O = ‖Pᵢ‖² − ‖P₁‖², i = 2, 3. Degenerate cases split by determinant rank. With a lug-pair catalog and pivot keep-in regions this enumerates dyads exactly.
- Finite higher-order templates. Five-pose Burmester problems and planar four- and five-bar templates are
posed as loop-closure polynomials in half-angle charts, with a Rabinowitsch saturation s·δ(x) − 1 = 0 to
exclude zero-length and collinear roots. Only zero-dimensional systems inside the caps are submitted; a
system outside them is refused (
FROB-REF-857), not truncated. - Circuit, branch and clearance certificate. Real roots are isolated by interval contraction. One assembly circuit must traverse all target poses in order, with the reciprocal of the loop-closure Jacobian determinant bounded along the way, no self-collision, and the required reach. A tolerance box around the dimensions carries the certificate to as-built units.
The algebra is textbook; the certificate is the value. Step 3 exists because a root of the synthesis equations is not a mechanism. Take ground pivots O₂ = (0, 0) and O₄ = (4, 0), crank O₂A of length 1, coupler AB of length 4 and rocker O₄B of length 3: a crank-rocker. The distance from A to O₄ ranges over [3, 5] and never reaches 1 or 7, so A, B and O₄ are never collinear and the sign of (B − A) × (O₄ − A) is constant on each assembly circuit. At crank angle 0 the closure equations give B = (11/3, ±√80/3); at crank angle π they give B = (11/5, ±12/5). A design whose precision poses are (crank 0, B above) and (crank π, B below) satisfies every synthesis equation and cannot be driven from one pose to the other without disassembly. The circuit certificate is the constant nonzero sign, proved over the crank interval by enclosure.
Output. A linkage as a .fmodule (§14) with its port contract, plus certificates of kinds interval-box
and partition for the circuit, branch, clearance and tolerance claims.
- Known answers. P₁ = (0, 0), P₂ = (2, 0), P₃ = (0, 2) give O = (1, 1) and radius² = 2; collinear positions give determinant zero and a refusal; five finitely separated poses give at most four real Burmester pairs (FACT, classical; Appendix H); the crank-rocker circuit defect above.
- Pilot before funding. 240 template instances (three-pose dyads with a lug catalog and keep-in regions), comparing the lane with multi-start numerical optimization of the same dimensions under the same circuit and clearance checks. Falsifier: a certified linkage binds or changes circuit on the referee; or more than a quarter of the template instances fall outside the caps.
- Ceiling. Three-position synthesis has closed-form circumcentres, so no speed claim is made against a competent baseline; the claim is the certificate.
- Kill gate. KILL-SYNTH-LINKAGE.
25.21.4 Numerical continuation M, on the CPU
What it is. For mechanism families whose synthesis or kinematics systems exceed the exact caps (four- and six-bar path synthesis, Stewart–Gough forward kinematics, 6R inverse kinematics, parallel ankles), solve one generic complex instance of the family once, then treat each new specification as a parameter homotopy H(z, t) = F(z; (1 − t)·p₀ + t·p₁) and track only the solution paths.
Decisions inside the lane.
- CPU, double precision. Path tracking wants
f64; Metal has no double precision; the GPU is not its home. An adaptive predictor–corrector with endgames, and recovery of ill-conditioned paths in extended precision. - Start systems by monodromy with a trace test, not by a polyhedral start system, whose one-time cost for large families is unpriced. The generic solve is a ledgered, cached artifact with its own budget.
- Certification outside the proof kernel. Each claimed root gets a Smale α-test, α(f, z) < (13 − 3√17)/4 ≈ 0.157671, evaluated in exact rational or interval arithmetic by the checker: quadratic convergence of Newton's iteration from z to a root within twice the Newton step, distinctness by disjoint balls, non-reality by disjointness with the conjugate ball, and reality by the robust test of C-34 (α(f, z) < 0.03 with ‖z − Re z‖ < 1/(20·γ(f, z))). An α-test proves a nearby nonsingular root and nothing about roots that were not found.
- Labels.
Completeonly when the certified count equals an independent generic count from a trace test, with no lost paths and no positive-dimensional components. OtherwisePartial(certified_n, lost_n). APartialresult can support inclusion of the designs it found and can never support an exclusion.
Scale of the problem (FACT, Appendix H; to be re-read). The nine-point four-bar path-synthesis problem has 1,442 cognate triples, 4,326 solutions, against 286,720 paths for the best multihomogeneous homotopy; a six-bar case in the literature needed a solution set of about 1.5 million; Stewart–Gough forward kinematics has 40 solutions and 6R inverse kinematics 16.
- Pilot before funding. Stewart–Gough forward kinematics on the CPU: recover 40 certified roots for ten
generic parameter sets by parameter homotopy from one monodromy solve. Falsifier: any lost path that the trace
test does not flag, or a
Completelabel on a run that missed a root. - Ceiling. It answers "all isolated solutions" for one family at a time; nothing on the critical path needs it, and random mutation plus the exact lane covers the plan's reference robots.
- Kill gate. KILL-SYNTH-CONT.
25.22 What was actually checked at plan time
Paper-scale pilots were run during planning, with protocols frozen before execution and independent rechecks of
the main results. They are in the planning reproduction bundle (Appendix H gives its location and digest; paths
below are inside it; its runner replays the standard-library checks with python3 -B verify.py and the full set
with --all). Every row is FACT, Appendix K, about a small program on a small model.
| Pilot | Path in the bundle | What it measured | Result | What it implies here |
|---|---|---|---|---|
| Static stance family | mor/repro/P01-* |
Two exact classifiers of body–load feasibility; projected against lifted robust program | 11,520 of 11,520 states agree; 2,254 feasible allocations reconstructed; 114 of 2,304 bodies cover the mission; 102 of 102 conventional-solver spot checks agree; both programs return half-width 3/14 m in one solve each; a support-polygon-plus-capacity screen wrongly accepts 1,596 bodies | The family query is sound and useful; it has no speed advantage over a standard lifted program |
| Stance falsifier | mor/repro/P01-* |
The same body under equal passive springs | (175, 115, 85, 25) N against a 160 N rating, where the active allocation peaks at 155 N | The authority model is part of the claim |
| Material probe | mor/repro/P02-* |
Generated probe, programmed expert and direct measurement over 900 deterministic cases and four laws | Three-law probe 675 of 675 in class and 0 of 225 on the withheld law; expert equals generator; direct dwell 900 of 900 | Probe verdicts are conditional; direct measurement is the stronger comparator; no speed claim |
| Pad family | mor/repro/P02-identification-family.* |
Minimum certified mass for a 75 N pull | 300 g and 240 g at centred nominal readings only; an admitted reading drops the three-compact bound to 73.79 N | Certificates are bound to their reading set |
| Sensor aliasing | mor/repro/P03-* |
Exact Bayes success with repeated binary reads | 27/32, 459/512, 3807/4096; a shared error bit stays at 3/4; a stop-at-gap-two rule reaches 9/10 in 16/5 expected reads | Error dependence and deadlines decide sensor budgets |
| Docking, two gains | mor/repro/P04-*, P05-* |
Exact three-tick docking with one velocity packet | Both gains dock with an on-time packet; ε < (U + 1/2)/4; 561 cells: 344 admitted, 217 excluded, nine on the boundary; all 561 late-packet cells excluded; 51 linear programs agree | Observation timing decides feasibility; a conventional scenario tree gets the same answer |
| Docking, three gains | followups/docking_support.* |
Add gain 33/32 | Exact docking unsatisfiable; worst error at least 1/65 m; 34,590 positive labels per grid reverse | Certificates are bound to the declared hypothesis support |
| Pusher | pusher/ |
Specialized against composed solver on ten fixtures; six corrupted certificates | 20 of 20 intervals match in each arm; six of six bad certificates rejected; composed over specialized median time 1.345 warm and 1.088 cold | No new kind of answer on this plant; the speed gate failed |
| Pusher audit | pusher/AUDIT_PILOT.md, pusher/audit_pilot/ |
Timing ceiling; quantifier elimination from the raw plant | A residual of 575.7 µs that the solver does not touch (parsing, assembly, checking, serialization and harness, not separately timed), so a zero-cost solver would reach about 1.46 warm (842.8 ÷ 575.7); an off-the-shelf engine produced the family answer directly for 8 of 12 queries | The speed test had no power; compute the ceiling before running one |
| Labels and deadlines | information/deadline_check.*, compare_cod3_tags.smt2 |
Payload-width frontier against number and timing of labels; three-polytope fixture | 3/32, 7/32, 11/32 mm for one, two, three early labels; 3/32 mm late; one label unsatisfiable, two satisfiable | Deadlines change feasibility; ordinary elimination answers the query |
| Decision reuse | information/reuse_check.* |
Semantic receipt against a hermetic dependency graph over four edit states | Both: 3 pair evaluations and 2 reductions; all verdicts match fresh replay; omitting one dependency inherits a stale promotion | No reuse advantage over a correctly keyed graph |
| Shared bus | information/contract_bus_check.py |
Two fingers on one unit-current bus | Zero one-tick schedules; two two-tick schedules; an additive peak rule falsely prunes | Negative control for contract compilers |
| Admission fixtures | followups/r2_contracts.py, r4_contracts.py |
Exact counterexamples for mass support, design-dependent load, factory and handoff information, symmetric actions, persistent hidden dynamics, dependent stage outcomes | Each prints its counterexample | The rows of §25.4.7 |
| Native screens | native/metal/, native/cuda/ |
A 65,536-row docking-boundary screen on the M5 Ultra and both RTX 4090 | Unguarded single precision: 452 false admissions and 23,438 false exclusions on the near grid; guarded with exact fallback: zero final errors and identical bytes on all placements; exact integer kernels: zero errors, zero fallback; host integer path fastest at this size | Strict predicates need exact or guarded kernels; dispatch dominates small host-resident jobs |
| Static against dynamic sill | sill/ |
Sampled statics against a planar dynamic scorer, 156 cases | 94 agree; 62 static rejections succeed dynamically; an audit found scorer defects | A static rejection is a candidate for a dynamic test |
What the pilots did not do is as important as what they did.
- None used FrankenSim dynamics, FrankenSim contact or a real sensor pipeline. The analytic pilots used small CPU programs and conventional solvers. The native runs executed one scalar decision kernel.
- The integrated interface remains a hypothesis. The independent audit of the planning study classed "a scoped interface for checked inclusions, exclusions and unresolved cells, returning a distinguishing intervention or an ambiguity witness" as HYPOTHESIS: the pilots establish that individual witness types can be computed; none runs a combined agent interface, certifies an acquired physical capability, or measures authoring cost.
- Every pilot's strong baseline tied or won. A lifted linear program tied the projection. A programmed expert tied the probe generator and direct measurement beat both on the withheld law. Exact Bayes tied the sensor calculation. A scenario-tree program tied the docking family. A dependency graph tied the receipt. Quantifier elimination produced the pusher answers. What survives is the interface: one typed question, a checked answer in a common form, and the discipline of counterexamples. That is what this chapter specifies, and why ADR-AUGUR-03 and ADR-AUGUR-09 exist.
- No physical claim follows. The material laws are artificial, the loads stipulated, the plants scalar.
25.23 Delivery order and stop decisions
The aim is to find the first class of amended engineering decisions where the whole workflow can be an order of magnitude faster, starting where correctness is independently decidable and extending to high-dimensional contact, vision and learning only after a cost has been located that survives strong baselines.
| Order | Milestone | Working slice | Evidence that buys the next investment | Decision if the test fails |
|---|---|---|---|---|
| 1 | M1 | A fresh agent is given the docking mission. Through the CLI or MCP it changes the allowed motor authority, the read error and the delivery tick, and asks for the feasible sensor–actuator region | frob-verify reproduces the boundary ε < (U + 1/2)/4, finds the exact shared reading at equality, and accepts an ordinary scenario-tree program as a competing answer. The agent explains which hardware restriction to relax |
Repair the mapping from sensors and actuators to the game before adding physics. Ship the reference algorithm if it gives the better answer per engineering hour |
| 2 | M1–M3 | Amend the stance, material and load-sharing assumptions of §25.13–§25.14 through one schema | One edit preserves a valid witness; a second forces withdrawal; a third changes the required instrument. All three match independent full recomputation | If uncertainty in the physical contract dominates, spend the next increment on measurement, or settle for a narrower envelope |
| 3 | M3 | Seek a decision in hybrid contact that the cheap model gets wrong, starting from a dry and split-grip stance, one periodic gait and a rear-wheel pull-over | A paired world or an edited body reverses a design decision for a reproducible physical reason and breaks an overbroad proof. A refined controller or body recovers under the named conditions | If scene reduction changes the mechanism, or collocation wins, keep the counterexample and advance the conventional control path |
| 4 | M4 | Time source-to-verdict amendments on heterogeneous bodies with sensing, controller updates, contact and independent checking | The matched rival spends enough time on repeatable work for ten-fold to remain possible. A breakdown by stage locates the saving. Both native backends agree on accepted outcomes for the tested profile | Stop specialized GPU work in cells where transfers, authoring, training, checker work or baseline reuse rule out the target |
| 5 | M8 | Return an engineer's Pareto set for the two-carrier brownfield handoff, then commission the multi-room shift | A modified site, a modified body and a relay policy are compared under one mission. Withheld evidence overturns or supports a named prediction. Speed and physical claims are reported separately | Reduce to the failed subtask; until it is revalidated its uncertainty propagates through the handoff contract |
The first slice an implementer can finish. Two gains, two packet timings, one actuator bound, one observation-noise family. Translate the query to a conventional scenario-tree linear program; export the exact success region and the equality counterexample; check both outside the process; mutate the packet timestamp and rerun. The compulsory interfaces are a causal history, a feasible controller, two indistinguishable worlds, an exact physical parameter chart, and an independent checker. The verb returns what additional measurement or actuator authority would restore feasibility. This ships as a CPU worked example before the first complex GPU kernel exists, and it is the M1 exit demonstration for this chapter.
The second slice, which could reveal a ten-fold opportunity. Change one measured surface law in a warehouse with multiple routes, body variants and sensor mounts. Compile the exact dependency support of each accepted result (§25.8). Prove that an edit disjoint from a result's support preserves it, or recheck the precise obligation where the changed interval still lies within slack. A conventional dependency graph, an incremental optimizer and a hot-started simulator are eligible comparators, and their fastest correct implementation sets the bar.
A release cell names its capability and its limit, for example "exact static family with independent active vertical reactions", "time-bounded sensor game certificate", or "empirical mobile-manipulator ranking in the sealed kitchen setup". No cell is described more broadly than the fixture that qualified it.
25.24 Refusals
Mission and certificate refusals are in the 8xx family (evidence and protocol). The block 840–859 is used
here. Each carries a message, the offending field and ranked repairs.
| Code | Refused because | First repair offered |
|---|---|---|
FROB-REF-868 |
The .fmission file is not valid: unknown field, missing unit, misspelt parameter, number not an exact string |
The schema diff |
FROB-REF-874 |
The world family is empty, or its scope changed after candidates were tested | The emptying constraint |
FROB-REF-877 |
The predicates conflict with the world family for every design | A minimal conflicting subset, with its Farkas certificate where linear |
FROB-REF-881 |
Evidence or a certificate establishes a different quantifier prefix than the query's, including clairvoyant evidence offered for a robust claim | The prefix it does establish |
FROB-REF-884 |
No quantifier prefix, or a hidden parameter with no persistence declaration | The two candidate declarations and the fixture that separates them |
FROB-REF-887 |
A policy is indexed by a parameter the controller cannot observe | Move the parameter into the world, or add the calibration observation |
FROB-REF-846 |
A chance constraint lacks its population, event or confidence, or marginal stage rates are multiplied without a dependence assumption | The joint-outcome request |
FROB-REF-847 |
An observation has no arrival instant, or a policy uses information before it arrives | The instant at which it becomes usable |
FROB-REF-848 |
A proof kind is unknown, at an unknown version, disabled, or used outside its scope | The kinds admitted for this claim |
FROB-REF-849 |
Certificate arithmetic is malformed: a non-reduced rational, a size limit exceeded, an interval without a declared rounding | Re-encode; or split the cell |
FROB-REF-850 |
A frame, unit, sign or port order in a certificate does not match its definitions (a first moment passed as a torque; reordered feet) | The typed field that disagrees |
FROB-REF-851 |
A certificate assumes an authority the design does not declare, or omits a force floor or other active bound | Re-solve under the declared authority |
FROB-REF-852 |
A monotone or symmetry transport lacks a side condition | The missing sub-certificate |
FROB-REF-853 |
A minimum is claimed without a matching lower bound, or an unattained infimum is reported as attained | feasible-candidate with its gap |
FROB-REF-854 |
A classifier, screen or certificate is reused outside its eligibility: support, deadline, error units or tolerance changed | mission.revalidate |
FROB-REF-855 |
Evidence profiles are mixed inside one cell, or a probability mass is requested without a supplied weighting | Split the cell; supply the weighting |
FROB-REF-856 |
A region certificate is requested over more parameters than the admitted limit, or a joint paving is requested | The per-constraint decomposition |
FROB-REF-857 |
A synthesis system is outside the symbolic caps or is not zero-dimensional | A smaller template, or the continuation lane with its label |
FROB-REF-858 |
Stage composition fails: an exit set not inside the next entry set, a clock mismatch, or a resource spent twice | The violating state or interval |
FROB-REF-859 |
An experiment or world edit cannot be realized through the declared interfaces, or does not declare the causal path it changes | The nearest realizable intervention |
Standing rules, in addition to those of §35: a failed training run is never an exclusion; a solver failure is never an exclusion; an unresolved cell is never reported as either verdict; and a query whose estimate exceeds its budget is refused under the budget family with the estimate attached.
25.25 Invariants and proof obligations
| ID | Invariant |
|---|---|
| INV-AUGUR-01 | I ⊆ F ⊆ O under the declared model: every inner cell has an inclusion proof for the query's exact prefix, and every cell outside O has an exclusion proof for it |
| INV-AUGUR-02 | The inner, excluded and unresolved cells of an answer partition the declared domain, with disjoint interiors and stated boundary ownership |
| INV-AUGUR-03 | MissionId changes whenever a quantifier, comparator, world support, persistence declaration, observation timing, policy class or horizon changes |
| INV-AUGUR-04 | Answers are monotone in work: a later answer to the same MissionId moves cells only out of the unresolved set. A cell leaves I or re-enters O only through a logged withdrawal that names its counterexample |
| INV-AUGUR-05 | The class of an answer is the weakest class among its cells, and no operation raises a class |
| INV-AUGUR-06 | No numerical failure, timeout or failed search is recorded as an exclusion |
| INV-AUGUR-07 | A policy is never indexed by a quantity absent from the observation contract at the decision instant |
| INV-AUGUR-08 | A .frobcert family payload is self-contained: checking needs no network, no GPU, no simulator and no producer |
| INV-AUGUR-09 | Every exported answer, witness and bundle carries the authorization object with its three flags, all false |
| INV-AUGUR-10 | Scheduling heuristics (opportunity loss, learned proposers, agent guesses) can change the order and cost of work and cannot change any verdict |
| INV-AUGUR-11 | A candidate from frob-synth has no verdict until frob-mission assigns one through a proof rule |
| ID | Obligation | Verification |
|---|---|---|
| PO-AUGUR-01 | Each lowering from a design family and a mission to primitive equations is correct | A second, independently written lowering for every supported template, compared exactly; one deliberately invalid fixture per lowering that the checker must reject |
| PO-AUGUR-02 | The checker's big-integer and rational arithmetic is exact | Differential test against an independent implementation on 10⁶ random operations and all fixture certificates |
| PO-AUGUR-03 | The checker's interval arithmetic is outward-rounded using std only |
Every operation widened by one unit in the last place in each direction; property test that the enclosure contains the exact rational result |
| PO-AUGUR-04 | partition checking is exact, including open and closed ends |
Exhaustive test on boxes with shared faces, edges and corners in up to six dimensions |
| PO-AUGUR-05 | Bundle bytes are a deterministic function of the answer (class D0) | Encode on two hosts and two worker counts; compare digests |
| PO-AUGUR-06 | Each proof rule of §25.4.5 is sound on its finite and polyhedral fragments | Stated as candidate theorem cards for §12; until proved, tested against the mutation corpus and classed by the weakest step |
| PO-AUGUR-07 | The checker's dependency closure is std and shares no source file with any proposer |
A closure check in the build, and a file-set comparison |
25.26 Known answers
Each row is exact under its stated model and hand-checkable. The numbered known-answer suite is compiled in §38.
| Fixture | Exact answer | Exercises |
|---|---|---|
| Stance family: 400 N, feet (±1/3, ±b) m, 160 N ratings, centre-of-mass rectangle 150 mm × 75 mm | b ≥ 3/14 m; forces (160, 130, 110, 0) N at the (60, 30) N·m vertex; 165 N needed at b = 1/5 m | mission.synthesize, lp-primal, lp-farkas, partition |
| Stance grid: u, v ∈ {2, 3, 4}, ratings ∈ {0, 80, 160, 240}⁴, four vertices and centroid | 2,254 of 11,520 states feasible; 114 of 2,304 bodies cover the mission; a weak screen falsely accepts 1,596 | Lowering; negative control for static stability |
| Passive equal springs at b = 1/4 m | (175, 115, 85, 25) N against the active (155, 135, 105, 5) N | Authority in certificates |
| Design-dependent load | Feet (±1 − e, ±1) m, 0.5 N ratings: (e, W) = (0, 1.9) and (0.9, 1) feasible, midpoint needs 841/800 N | Chart and convexity admission |
| Pusher, y = max(0, g·u − d), g ∈ [1/2, 2], u ∈ [0, 2], d ∈ [0, 1/4], y ∈ [3/4, 5/4] | Per-build command set: all of [1/2, 2]; shared command set: empty | Quantifier order |
| Pusher battery, ten frozen cases | Twenty intervals, including shared-tight: shared set {1}; both-ends: [2/3, 5/4]; branch-crossing: shared [0, 3/8] |
Closed ends, singletons, saturation branch |
| Persistent gain | Out-and-back with fixed g ∈ {1, 2}: net 0; resampled: {−1, 0, 1} | world.persistence |
| Twenty worlds, two stages at 19/20 | 18/20 if failures differ, 19/20 if they coincide, 0.9025 if independent | Chance constraints |
| Mandatory work | 8 kg over 12 mm: 0.94176 J against 0.90 J; 0.05 J of approach energy removes the exclusion | Rule 1 scope |
| Binary sensor at 3/4 | 27/32, 459/512, 3807/4096 for 3, 5, 7 reads; 3/4 with a common fault bit; sequential 9/10 in 16/5 reads; 225/256 when forced at six | alias-pair, deadlines |
| Passive jaw, k = 1 and 4 N/mm, bands [2, 4] and [7, 9] N, stroke 6 mm | Feasible iff max{2(c+1), 7(c+1/4)} ≤ x ≤ min{4(c+1), 9(c+1/4), 6}; K ≥ 28/17 N/mm; K ≥ 4/3 N/mm without the stroke cap | Shared-policy inner cell |
| Docking, g ∈ {1, 2}, on-time packet | Sequences (1/4, 1/2, −3/4) and (1/4, 0, −1/4) reach (1, 0) | finite-game |
| Docking, late packet | No common command vector | alias-pair |
| Docking family | ε < (U + 1/2)/4 on U ∈ [1/2, 1]; 344 admitted, 217 excluded, 9 boundary cells of 561; at U = 3/4, ε = 5/16 both worlds can read 15/16 | Strict comparators; unattained infimum |
| Docking, third gain 33/32 at ε = 1/64 | No exact docking; best worst-case error 1/65 m | Eligibility and withdrawal |
| Pad probe, four laws | 29.66 N compact; 24.72 N and 41.15 N broad; three-law probe 675 of 675 and 0 of 225; direct 900 of 900 | Conditional witnesses |
| Pad family, 75 N | 300 g under V, 240 g under P at centred readings; eccentric pull needs 43.125 N at e/s = 0.15 | Additivity and wrench balance |
| Coupled A/B on z ∈ [0, 1] | A iff z ≥ 3/5, B iff z ≥ 2/5: (1, 0) unreachable; gain [2/5, 3/5) | product-unreachable |
| Handoff bit | Pooled history wins both; every local deterministic choice loses one; a timely bit restores both | Decision makers |
| Shared bus | Zero one-tick schedules, two two-tick schedules | Joint resource contracts |
| Three variants in [0, 1]² | Two labels suffice, one is impossible | Minimal conflict sets |
| Three variants, three readings | Two labels per reading, three for a fixed map | Label map across histories |
| Station records {left, shared}, {shared, right} | No tag count suffices | Encoder premise |
| Label deadline | w ≤ 3/32, 7/32, 11/32 mm for one, two, three early labels; 3/32 mm late | Deadlines |
| Ballast quotient | 735,471 placements, 24,546 classes; {0, 3} and {1, 2} must split | Mission-observable quotient |
| Differential-drive loop | Sideways 4w·(1 − cos(ρδ/2w)), zero net yaw and advance; reversed loop opposite | Holonomy query |
| Skid-steer no-slip | ω = 0 | Connection admission |
| ẋ = u ∈ [0, 1] | Negative x unreachable | Finite witness rule |
| Mass placement: 1 kg in a ball of radius 1/10 m, principal moments 1/125 kg·m² | No placement: mean squared radius 3/250 m² needed, 1/100 m² available | Support-aware inertia synthesis |
| Three-pose dyad (0, 0), (2, 0), (0, 2) | Pivot (1, 1), radius² = 2 | Linkage lane |
| Crank-rocker 1, 4, 3 on ground 4 | B = (11/5, ±12/5) at crank angle π; the two signs are different circuits | Circuit certificate |
| Stewart–Gough forward kinematics; 6R inverse kinematics | 40 and 16 solutions (FACT, to be re-read) | Continuation labels |
| Guarded strict predicate on 65,536 rows | 34,590 admitted, 30,946 excluded, of which 1,820 are exact ties; no error after exact fallback | Exact-integer and guarded kernels |
25.27 Gates and kill gates
Tier, pilot, ceiling and kill gate for every F and M mechanism. "Run" means the paper-scale pilot of §25.22 exists; its integrated counterpart is still required by the gate named.
| Mechanism | Tier | Paper-scale pilot and falsifier | Ceiling of benefit, stated before any speed test | Kill gate |
|---|---|---|---|---|
| Mission queries with inner and outer sets | F | Run: stance, docking, pusher. Falsifier: a short conventional program gives the same checked scope at similar turnaround | Measured ties so far (1.345 warm, 1.088 cold; ceiling 1.46 on that workload). The claim is a kind of answer, not speed | KILL-AUGUR-TIE |
| Family certificates and the checker | F | Run: six corrupted certificates rejected. Falsifier: one accepted false certificate | None claimed | KILL-AUGUR-FALSECERT |
| Region certificates on sub-boxes | F | To run: the 12-parameter box of §25.6 | None claimed; pointwise checks prune equally for proposed designs | KILL-AUGUR-REGION |
| Checked cuts over discrete families | F | To run: the 1,024-leaf catalog of §25.7 | The statically decidable fraction of the catalog | KILL-AUGUR-CUTS |
| Mission-observable quotient | F | Run as an enumeration. Falsifier: two merged designs with different replayed traces | Fixture-dependent; none claimed | KILL-AUGUR-CUTS |
| Revalidation by implication | F | Run: four-state fixture (tie). To run: the 30-amendment campaign | The dirty fraction; a keyed graph ties on the toy | KILL-AUGUR-REUSE |
| Design–world separation | F | To run: slice 3 of §25.23 | None claimed | KILL-AUGUR-SEPARATE |
| Alias witnesses | F | Run: sensor pilot | None claimed; exact Bayes ties | KILL-AUGUR-ALIAS |
| Probe design | F | Run: material pilot. To run: coupled-layout experiment | At most 8, 3.33 at stipulated setup, 1 against the expert | KILL-AUGUR-PROBE |
| Early-input information games beyond the fixture | F | Run on the scalar plant | None claimed; scenario trees tie | KILL-AUGUR-TIE |
| Product-system dominance | F | To run: one contact transition | Fraction of paired draws closed without replay | KILL-AUGUR-DOMINANCE |
| Label minimization on supplied sets | F | Run: SMT and elimination tie | None over SMT | KILL-AUGUR-LABELS |
| Label minimization from contact | M | To run: three-variant gripper fixture | Unknown until the pilot | KILL-AUGUR-LABELS |
| Skill transport by interface | M | To run: tray interface, three treatments | Possibly nil on changed-support transfers | KILL-AUGUR-TRANSPORT |
| Facility, handoff and world edits | M | To run: the acceptance fixture of §25.17 | Unknown | KILL-AUGUR-FACILITY |
| Holonomy query; shape-space atlas | F; M | To run: differential drive and crawler | Kinematic systems only | KILL-AUGUR-PHASE |
| Symmetry–event identity; amortized use | F; M | To run: mirrored landing | Group order on a measured fraction | KILL-AUGUR-SYMEVENT |
| Pareto antichains over catalogs | F | To run: 20-variant sweep | Component-sizing share of the decision | KILL-SYNTH-CODESIGN |
| Trajectory optimization with design variables | F | To run: 20 candidates, three missions | Parity with existing optimizers | KILL-SYNTH-TRAJOPT |
| Bounded exact linkage synthesis | F | To run: 240 template instances | The certificate, not speed | KILL-SYNTH-LINKAGE |
| Numerical continuation | M | To run: Stewart–Gough, 40 roots | One family at a time | KILL-SYNTH-CONT |
Convergence gates. Thresholds are TARGET.
| Gate | Claim | Milestone | Threshold (TARGET) |
|---|---|---|---|
| GATE-AUGUR-01 | Known answer | M1 | Admission and checker reject 100% of a mutation corpus of at least 60 mutated queries and certificates (every mutation of §25.5.3, every row of §25.4.7, a swapped prefix, a clairvoyant witness) with the expected refusal code; zero false accepts |
| GATE-AUGUR-02 | Known answer | M1 | The stance family through the public verb: boundary exactly 3/14 m; four vertex witnesses; dual (0, 1/2, 1/2) for the excluded cell; 11,520 of 11,520 grid states agree with an independent zonotope test; lifted and projected formulations agree; the passive-spring amendment withdraws the cell at b = 1/4 m |
| GATE-AUGUR-03 | Known answer | M1 | The docking family through the public verbs: 561 of 561 cells, nine boundary cells excluded, all late-packet cells excluded, the equality reading 15/16 exported, the three-gain amendment withdraws every positive cell and reports 1/65 m |
| GATE-AUGUR-04 | Known answer | M1 | The pusher battery: 20 of 20 intervals with exact ends, and the per-build and shared queries return [1/2, 2] and ∅ for the same plant |
| GATE-AUGUR-05 | Proof | M1 | Every Certified cell of GATE-AUGUR-02 to 04 is accepted by frob-verify built from an empty environment on a host with no GPU, in under 10 s in total; bundle digests identical across two hosts |
| GATE-AUGUR-06 | Proof | M1, repeated at M3 | Checker independence: dependency closure is std; zero shared source files with proposers; a seeded-fault campaign of at least 200 mutated witnesses per proof kind yields zero false accepts |
| GATE-AUGUR-07 | Performance | M1 | A fresh agent given only the generated documentation completes 10 scripted docking and stance amendments, names the binding hardware restriction in at least 9, and never reports an unresolved cell as a verdict; the serial turn count is recorded against a second arm restricted to the lower verbs |
| GATE-AUGUR-08 | Known answer | M3 | Monotone transport: zero false transports on a planted set of at least 20 non-monotone fixtures (including the widened sole); the falsification harness finds every planted reversal within 10⁴ ordered pairs |
| GATE-AUGUR-09 | Known answer | M4 | Region certificates on the 12-parameter box: the per-constraint arm decides at least 50% of each constraint's sub-box volume within 10⁴ boxes; no single monotone bound accounts for more than 95% of decided volume; zero certified boxes contradicted by 10⁶ point evaluations |
| GATE-AUGUR-10 | Known answer | M3 | Alias and jaw fixtures exact; mission.refute on the blind payload task returns all three engineering answers with their conditions |
| GATE-AUGUR-11 | Design comparison | M4 | Probe design: 675 of 675 in class; zero unconditional verdicts issued on the withheld law; the direct measurement is offered in every proposal list and is right in 900 of 900 |
| GATE-AUGUR-12 | Known answer | M3 | Revalidation on the frozen 30-amendment campaign: zero incorrectly inherited verdicts; unnecessary invalidations at most 20% of unaffected verdicts; the cost-9 and cost-5 fixture keeps the witness and withdraws the minimum |
| GATE-AUGUR-13 | Design comparison | M3 | Separation: for each of 10 planted design reversals, mission.separate returns an admissible world pair whose minimized edit list has at most 3 edits and whose first cause is unchanged by minimization, confirmed on the referee |
| GATE-AUGUR-14 | Performance | M3, M4 | Ceiling before speed: every registered speed comparison in this subsystem records measured f, r and h on the strong baseline and is refused when 1/(1 − f + f/r + h) is below the claimed ratio |
| GATE-AUGUR-15 | Parity | M4 | Family execution: inner, excluded and unresolved labels for the 65,536-row screen and for one 1,024-design family batch are identical on batch-cpu, CUDA and Metal under the exact-integer or guarded class, with zero final errors against exact CPU arithmetic |
| GATE-AUGUR-16 | Design comparison | M4 | Product dominance: the z fixture exact; on the contact-transition pilot zero mislabelled joint outcomes against per-case referee replay over 10⁴ draws |
| GATE-AUGUR-17 | Known answer | M4 | Constructive lanes: the co-design fixed point equals the GB-03 closed form and rejects the additive-peak rule on the bus fixture; the three-pose dyad and both circuit fixtures exact; zero certified linkages change circuit on the referee across 240 instances |
| GATE-AUGUR-18 | Design comparison | M4 | Refinement: of 20 trajectory-optimized candidates per mission, at least 10 pass the referee route and beat the nominal design on held-out terrain, each solved within 10 minutes on 8 threads |
| GATE-AUGUR-19 | Known answer | M4 | Labels: the three-variant, three-reading and station-record fixtures exact; with inner and outer sets the returned label interval contains the exact count on 20 generated instances |
| GATE-AUGUR-20 | Known answer | M6 | Holonomy: differential-drive loop within 10⁻⁹ of 4w·(1 − cos θ); loop-reversal and chart-change residuals below 10⁻⁸ m; the skid-steer and slip mutations refused or withdrawn; one newly proposed gait admitted by a full referee rollout |
| GATE-AUGUR-21 | Known answer | M6 | Symmetry at contact: the identity holds to finite-difference error on the mirrored landing and fails by a margin of at least 10 times that error on each of the four asymmetric mutations |
| GATE-AUGUR-22 | Known answer | M8 | Continuation: 40 certified Stewart–Gough roots on 10 generic parameter sets; Complete issued only when the trace test agrees; lost paths at most 0.1% and every one flagged |
| GATE-AUGUR-23 | Design comparison | M8 | Skill transport: the three-treatment experiment on the tray interface, pre-registered; the planted ramp-crest loss of authority is reported with its mode and a replayable counterexample |
| GATE-AUGUR-24 | Design comparison | M8 | Facility fixture: at least two feasible engineering strategies discriminated; each of the four seeded failures recovered with a withdrawal and a minimized scenario; the optimality gap reported for every unresolved continuous subproblem |
The partial ten-fold gate at M3 (GATE-TENFOLD-06) and the tournament at M7 (GATE-TENFOLD-07; §39) draw their body-envelope and sensing strata from the fixtures of this chapter; their thresholds are defined there.
Kill gates.
| Kill gate | Trigger | Fallback, named in advance |
|---|---|---|
| ✖ KILL-AUGUR-TIE | On the strata of the M3 partial gate (GATE-TENFOLD-06) that use this chapter, a short robust program over a conventional solver reaches the same checked scope at comparable turnaround | Ship that program behind the same verbs, schema and checker. Retire any claim of exclusive expressivity on those families. Spend the research budget on the first mission the program cannot resolve |
| ✖ KILL-AUGUR-FALSECERT | One certificate accepted by frob-verify is shown false within its scope |
§25.5.5. If the cause is the rule and not an implementation defect, the proof kind is removed and its cells become Tested |
| ✖ KILL-AUGUR-REGION | The pilot of §25.6 meets its falsifier (more than 90% undecided in the best arm, or more than 95% of decided volume from one monotone bound), or GATE-AUGUR-09 fails after one repair cycle | Region certificates are removed. Family answers use dual witnesses, monotone bounds and pointwise static analyses at proposed designs; untested regions are reported as sample coverage, Estimated |
| ✖ KILL-AUGUR-CUTS | One false cut on the frozen catalog, or less than 70% of evaluation cost saved; or one quotient merge with different replayed traces | Cuts off: exhaustive evaluation with the static screen as an ordering heuristic. Quotient off: memoize on full model identity only |
| ✖ KILL-AUGUR-REUSE | One incorrectly inherited verdict from an implication rule | That rule is removed; reuse falls back to the dependency-keyed memo graph of §28 |
| ✖ KILL-AUGUR-SEPARATE | Minimization changes the failure mechanism in more than 20% of planted cases, or a conventional scenario tool with the same generator matches the result at equal cost | Ship the Nemesis search and minimization without the design-pair query; keep counterexamples as regressions |
| ✖ KILL-AUGUR-ALIAS | Generated alias witnesses are contradicted by a permitted probe in more than 5% of audited cases | Witnesses are labelled experiment-specific only; universal observability claims are refused |
| ✖ KILL-AUGUR-PROBE | The generator never beats the programmed expert plus direct measurement at matched correctness on the coupled-layout experiment, or issues one false lower bound | experiment.suggest ships the expert grid and the direct measurement; the experiment grammar is parked |
| ✖ KILL-AUGUR-DOMINANCE | One mislabelled joint outcome, or a conventional reachability tool closes the same cells at similar cost | Paired comparison by replay under the studies of §24; the product lowering is kept only as the rule for space-indexed shared inputs |
| ✖ KILL-AUGUR-LABELS | Deriving command sets costs more than labelling every part, or an inner set contains a failing command | The query is kept for supplied sets through a conventional solver; extraction from contact is parked |
| ✖ KILL-AUGUR-TRANSPORT | The interface arm needs as many target trials as the conditioned policy, or reports coverage where the referee shows a fall | Family policies and inheritance of §23; the wrench-coverage test is kept as a static analysis |
| ✖ KILL-AUGUR-FACILITY | The acceptance fixture fails to discriminate two strategies or misses a seeded failure after one repair cycle | Single-robot missions with priced world edits from §19; multi-robot composition is parked |
| ✖ KILL-AUGUR-PHASE | No proposed gait is admitted by a full rollout, or trajectory optimization finds every proposed gait at lower total cost | A-09 remains a forward diagnostic; the inverse query and the atlas are parked |
| ✖ KILL-AUGUR-SYMEVENT | The identity cannot separate the symmetric fixture from its mutations, or amortization shows no reduction in decision time on either GPU | Per-event finite differences; symmetry is used only on smooth kernels as in §10 |
| ✖ KILL-SYNTH-CODESIGN | The lane mis-ranks more than 20% of top designs against the referee, or prunes one independently feasible design | Restrict to the closure analysis A-10 for actuator, battery and compute selection |
| ✖ KILL-SYNTH-TRAJOPT | GATE-AUGUR-18 fails, or solves exceed the budget at 12 degrees of freedom | Continuous optimization of §28 with the baseline controller in the inner loop |
| ✖ KILL-SYNTH-LINKAGE | A certified linkage binds or changes circuit on the referee, or more than 25% of template instances exceed the caps | Multi-start numerical optimization of linkage dimensions with the same circuit and clearance check, classed Tested |
| ✖ KILL-SYNTH-CONT | More than 0.1% lost paths, an unflagged lost path, or a missed known count | The exact lane plus multi-start CPU recovery; every result labelled Partial |
25.28 Open questions
- OPEN-AUGUR-1. Whether
.fmissionpredicates are written in the requirement language of.ftask(§24) or only reference its terms by identifier. Default: reference by identifier, so there is one grammar. Owner: the Arena lead. Blocks GATE-AUGUR-01. - OPEN-AUGUR-2. Whether the linear programs are solved exactly over ℚ or in floating point with rational
reconstruction. Default: the cone solver of
frob-algebrain floating point, basis reconstruction over ℚ, exact check; a failed reconstruction leaves the cell unresolved. Decide at GATE-AUGUR-02 from the reconstruction failure rate. - OPEN-AUGUR-3. The measured sparsity of the constraint-to-parameter graph for the plan's robot classes, and the coupled dimension that linkage closure adds. Default: region certificates are refused above six parameters. Owner: the Augur lead. Blocks GATE-AUGUR-09.
- OPEN-AUGUR-4. Whether a quantifier-elimination or SMT engine is admitted as a production dependency or only as a comparator outside the product. Default: comparator only; the product uses in-tree elimination for small linear systems. Owner: the project owner. Decide before the M3 partial gate, because KILL-AUGUR-TIE depends on it.
- OPEN-AUGUR-5. Sound reachable tubes for contact-rich full-order cells. No owner in the suite provides
them. Default: constructive inclusion is limited to static, quasi-static, finite-game and low-dimensional
smooth cells; contact-rich cells stay unresolved with
Testedtrajectories. Revisit at M4. - OPEN-AUGUR-6 (settled by §34, ADR-WS-02). Where the
std-only checking code lives, and who writes bundles.frob-certhas an empty dependency table and holds the schema, the reader and the checking rule for each proof kind;frob-verifyis its binary.frob-missionnever links it. A mission answer leavesfrob-missionas plain proof objects (witnesses, cells, dual vectors, enclosures) in types defined infrob-core;frob-lemmaserializes those objects into a.frobcertbundle, written against the schema and sharing no code with the reader;frob-verbsthen runs the checker on the bundle before the answer is returned. Where this chapter says thatfrob-cert"reads and writes" the family payload, read:frob-certdefines and reads it,frob-lemmawrites it. A defect shared by proposer and checker would need the same mistake in two code bases that have no common source. - OPEN-AUGUR-7. The exit code of a mission query that stops on budget with certified cells (§25.3.4).
Default: exit 2 with
resolution-unmet. Owner: the Tether lead. - OPEN-AUGUR-8. Who reviews the primitive equations in a bundle, and whether that review is recorded in the bundle. Default: unreviewed bundles say so in their flags and cannot be cited under the Proof claim outside the fixtures of §25.26.
- OPEN-AUGUR-9. Whether
.fmissionversion 1 expresses several decision makers with separate histories. Default: the field is present and accepts one decision maker; more than one is refused until slice 5. - OPEN-AUGUR-10. The compute and calendar envelope for the M slices of §25.17 to §25.20. Default: none is funded before its pilot passes. Owner: the project owner.
- OPEN-AUGUR-11. Whether a measure on unresolved sets should be standardized (volume in a named chart).
Default: no measure; the caller supplies one in
resolution, and probability mass is reported only under a supplied weighting.
25.29 Chance claims transport only through a coupling
What it is. F A restriction on mission.transport (§25.11), and the proof object that lifts it. The
refinement relation of §25.11 matches every possible successor of the target to an allowed successor of the source.
That preserves universal claims. It preserves only the support of a probability law, so it carries no chance claim
and no expected value.
Counterexample. Source and target each have one action and two outcomes, success and failure. The source succeeds with probability 0.99 and the target with probability 0.01. Every target successor has a matching source successor, so the relation holds, and the claim "succeeds with probability at least 0.95" is true of the source and false of the target. Every coupling of the two laws disagrees on at least 0.98 of its mass, which is their total-variation distance.
Mechanism. DESIGN:
- A transport certificate declares the kind of each transported claim:
universal,chanceorexpectation. - For
chanceandexpectationit carries a coupling budget: for each step t of the horizon, a bound εₜ on the total-variation distance between the source and target transition-and-observation kernels at related states, under the command that the interface selects. The transported bounds are P_target(accept) ≥ P_source(accept) − Σₜ εₜ and, for a quantity in [0, B], |E_target − E_source| ≤ B·Σₜ εₜ. The coupling is causal: it uses no disturbance that the interface cannot have observed. - Sources of εₜ, in order of strength. Exact computation for finite kernels (class Certified). A common-noise
construction in which both systems are driven by one disturbance stream compiled at physical coordinates (C-40)
and the relation is shown to persist, with its failure rate bounded from sealed paired runs (class Tested: a
one-sided upper confidence bound). Otherwise none, and the claim is measured on the target by
eval.qualify. - A certificate that marks a chance claim
universal, or omits the budget, is rejected byfrob-verify(refusal: chance claim transported without a coupling budget).
Owner: frob-mission (proposer); frob-lemma and frob-cert (bundle and check).
Known answers. The two-outcome case: Σ ε = 0.98, the transported bound is 0.01, and the claim is refused. A finite chain of 10 steps with ε = 0.003 per step: a source probability of 0.99 transports to at least 0.96, and the exact target value computed by enumeration lies above it.
Pilot, ceiling, kill. Pilot: 200 random finite Markov fixtures with known kernels, then the tray carried by a wheeled base and by a quadruped. Falsifier: one transported bound that the exact or sealed target value violates. Ceiling: the budget helps only when Σ ε is small against the slack of the claim; it saves one qualification study per transported skill and no simulation time.
| GATE-AUGUR-25 | Known answer. Zero violated bounds over the 200 finite fixtures; the two-outcome reversal is refused; on the tray fixture the 95% upper bound of the measured budget is below the claim's slack for at least one skill, or the kill gate fires. Finite part M4; tray M8. |
| ✖ KILL-COUPLING | Trigger: one violated transported bound that survives a repair cycle, or no skill on the tray fixture with a budget below its slack. Fallback: mission.transport carries universal claims only, and every chance or expected-value claim is re-measured on the target in the qualification lane of §24.13. |
25.30 No monotone fill without a proof of monotonicity
What it is. S A restriction on proof rule 3 (§25.4) and on every sweep that feeds a mission answer. A verdict at an unevaluated parameter value is never inferred from its neighbours unless a checked monotonicity argument for that parameter, model and verdict is attached. An observed pattern is not such an argument.
Counterexample. FACT (planning archive, the 300-trajectory planar friction sweep of the sill fixture; Appendix H; to be re-run before a gate cites it): for the 75 mm wheel, a sharp lip and the payload shifted 40 mm backward, the planar scorer returns success, timeout, success at μ = 0.500, 0.525 and 0.550. Filling every friction level above the first success adds one success that did not occur. With the scoring period held at 1 ms, halving the physics step from 50 µs to 25 µs changes the triplet to timeout, timeout, success; at 25 µs with a stiffer contact and adjusted damping all three succeed. The physical reading of the middle timeout is unresolved, and the fill is refuted without resolving it.
Mechanism. DESIGN:
mission.synthesize,nemesis.searchandphylum.sweepreturnunresolvedfor every parameter value that was neither evaluated nor covered by a proof. No verb interpolates verdicts.- A fill is a proof step of the monotone-inheritance kind. It cites the theorem that makes the verdict monotone in the parameter under the declared model. The creep-limit rows of §24.10 qualify, because the friction demand μ ≥ tan θ is monotone in μ by construction. A dynamic rollout verdict has no such theorem by default.
- A detector runs on every swept scalar: along the sorted grid it counts the sign changes of the verdict. More than
one change is recorded as a non-monotone outcome, with the grid, the step and the contact parameters, and is
routed to the fidelity ledger (§16.8) for step-halving and stiffness variants. Results that depend on the affected
interval are typed
model-conditionaluntil the variants agree. - When the physics step is refined the requirement clock stays fixed (§24.5), so two refinements are compared on one definition of the verdict.
Owner: frob-mission (answers); frob-nemesis and frob-phylum (sweeps); frob-analyze (detector).
Known answer. A planted fixture with a provable band: a cart on a compliant sill mount passes below and above a resonance band of mount stiffness and fails inside it, so the grid shows pass, fail, pass. The licensed fill on the creep rig reproduces its exhaustive grid exactly. The unlicensed fill on the banded fixture is refused.
| GATE-AUGUR-26 | Known answer. On the banded fixture the detector flags the non-monotone outcome in 100 of 100 seeds, no verdict is filled, and the mission answer leaves the band unresolved; on the creep rig the licensed fill equals the exhaustive grid at every point; a mutant that fills above the first success is caught on both. M3. |
25.31 Monomial screens in exponent coordinates
This subsection extends §25.6 ("Monotone bounds first") and the static-exclusion step of the worklist in §25.7. It
excludes a whole design family when a conjunction of sizing relations is contradictory, with a certificate that is
checked in integer arithmetic. Tier S. Owners: frob-mission for the screen, frob-cert for the proof kind and its
checking rule. Verb: mission.refute for a family, and the worklist of mission.synthesize.
The object. Design parameters θ₁, …, θₙ are positive: lengths, masses, ratios, ratings. A monomial constraint is c · θ₁^a₁ ⋯ θₙ^aₙ ≤ 1 with c a positive rational and integer exponents (rational exponents are cleared by raising the inequality to a common power). Parameter bounds are monomial constraints: lo/θᵢ ≤ 1 and θᵢ/hi ≤ 1. Many static sizing relations have this form: holding torque m·g·ℓ ≤ N·τ, no-load speed v·N ≤ ω·ℓ, bus current, pressure against sinkage.
The certificate. For constraints k = 1, …, K with coefficients c_k and exponent rows a_k, nonnegative integers λ_k, not all zero, with
Σ_k λ_k · a_k = 0 and Π_k c_k^λ_k > 1
prove that no positive θ satisfies all K constraints: multiplying the constraints raised to the powers λ_k cancels every parameter and leaves Π_k c_k^λ_k ≤ 1, a contradiction. In the coordinates y = ln θ the constraints are the linear system a_k · y ≤ −ln c_k, and by the theorem of the alternative such λ exists whenever the system is infeasible; because the exponent matrix is rational, λ can be taken integer. The search is a linear program in floating point. Only the certificate is trusted: the checker verifies n integer sums, one per parameter, and compares one product of integer powers of rationals with 1. It never evaluates a logarithm. Multipliers and bit sizes have declared caps, and a certificate beyond them is refused, not approximated.
DESIGN: the proof kind monomial-product is added to the closed registry of §25.5.2 with class Certified, the
checking rule above and an invalid fixture per field. A cell's box bounds enter as constraints, so the same rule
excludes one cell or the whole positive orthant.
Sums of monomials. A constraint P(θ) = Σ_j m_j(θ) ≤ 1 with several monomial terms is not linear in y: its logarithm is a convex log-sum-exp. Two necessary conditions are monomial and may join the system:
- each term alone: m_j ≤ 1;
- a weighted mean inequality: for positive rational weights w_j with Σ w_j = 1 and common denominator D, Σ_j m_j ≥ Π_j (m_j/w_j)^w_j, so P ≤ 1 implies Π_j (m_j/w_j)^(D·w_j) ≤ 1.
Any positive weights are sound. Default weights are equal, plus the term shares m_j/P at the centre of the cell, rounded to denominators of at most 16. The screen only excludes. Inclusion, and cells the screen does not decide, go to the per-constraint lane of §25.6.
Known answer: no gear ratio and no leg length helps. A leg must hold m·g = 12 kg · 9.81 m/s² = 117.72 N at lever arm ℓ and move the foot at v = 1.5 m/s, through a reduction N, with a motor of torque τ = 2 N·m and speed ω = 80 rad/s. The two constraints are (117.72/2) · ℓ · N⁻¹ ≤ 1 and (1.5/80) · ℓ⁻¹ · N ≤ 1, with coefficients 2943/50 and 3/160 and exponent rows (1, −1) and (−1, 1). The multipliers λ = (1, 1) cancel both parameters and give 8829/8000 = 1.103625 > 1. No (ℓ, N) exists. The certificate reads as physics: the mission needs m·g·v = 176.58 W and the motor's corner power τ·ω is 160 W. Control: with τ = 2.5 N·m the product is 17,658/20,000 = 0.8829, no certificate exists, and ℓ = 0.2 m with N = 10 satisfies both constraints (0.94176 and 0.9375).
A per-constraint paving does not see this cheaply. Over ℓ ∈ [0.1, 0.4] m and N ∈ [5, 50] each constraint alone is satisfiable (0.118 at ℓ = 0.1, N = 50 for the first; 0.234 at ℓ = 0.4, N = 5 for the second). The two feasible sets, ℓ/N ≤ 0.01699 and ℓ/N ≥ 0.01875, are separated by a diagonal band that boxes approximate only by refinement.
Counterexample: the term-wise screen is not a decision. With two terms m₁ = m₂ = 0.6 each term passes and the sum is 1.2. Equal weights give 4·m₁·m₂ = 1.44 > 1 and exclude it. With m₁ = 0.9 and m₂ = 0.15 the sum is 1.05, equal weights give 4 · 0.135 = 0.54 and do not exclude, and the weights (6/7, 1/7) give 1.05⁷ ≈ 1.407 > 1 and do. Over a cell with fixed weights the relaxation is an outer approximation, so an undecided cell says nothing.
Scope and ceiling. An exclusion covers the static rigid model named in the bundle and says nothing about dynamic
performance. No speed claim is made: for a single proposed design a pointwise check gives the same answer. The value
is a family exclusion with a one-line certificate and a named binding pair of constraints, which mission.refute
reports with the smallest change of a constant that removes the contradiction (here, motor corner power above
176.58 W).
Gate. GATE-AUGUR-27 (Known answer, M3). On 1,000 generated monomial systems of at most 12 parameters and 24
constraints with planted status: no feasible system is excluded; every infeasible system whose contradiction has a
product of at least 1.01 and fits the size caps is excluded; every certificate is accepted by frob-verify, and each
of 200 mutated certificates (one multiplier or one coefficient changed) is rejected. The leg fixture returns
λ = (1, 1) and 8829/8000; its control returns the witness; the two-term case (0.9, 0.15) is excluded at weights
(6/7, 1/7) and not at equal weights.
25.32 Utility brackets and the dominance stop
Utility brackets F. This extends Rules 1 and 2 of §25.4.5 from feasibility to a bounded task utility, and gives the ladder of §28.9 a sound reason to stop spending controller effort on a design. For a mission whose task declares a utility u ∈ [0, 1] (a success probability, a normalized payload, a normalized energy margin), a design d and a world law, a bracket is a pair L_d ≤ U*_d ≤ Ū_d, where U*_d is the best value any admitted causal controller achieves.
- The upper end Ū_d uses the relaxations of Rule 1: every contact force inside an outer wrench cone, every torque under the card envelope, the energy budget of A-20 with every admitted energy source, reach and deadline limits, and any observation a controller could wish for. Per scenario the relaxation is optimized for u instead of tested for feasibility, and Ū_d(w) is the outward-rounded optimum with its dual as certificate. Over a world law, the mean of Ū_d(w) on the sampled scenarios carries an upper confidence bound.
- The lower end L_d is achieved performance: rollouts of one frozen controller on confirmation addresses that its development never read, with a lower confidence bound. A stronger controller raises L_d and leaves Ū_d valid.
With m the comparison's margin and u_req the requirement threshold, four labels follow.
| Condition | Label | Consequence |
|---|---|---|
| Ū_d < u_req | body-limited |
An exclusion under Rule 1, with its certificate |
| Ū_d − L_d ≤ m | saturated |
More controller effort cannot change a decision at this margin |
| Ū_d − L_d > m, and Ū_d at or above the k-th best lower end | controller-limited |
Effort belongs on the controller; the design escalates (the budget curves of §28) |
| Ū_d < L_c for a competitor c | dominated |
The dominance stop: d receives no further training, fine-tuning or planner budget in this comparison |
Only the dominance stop removes work, and it is sound only when both bounds hold at once. With M designs compared at a study level α, each one-sided bound is taken at level α/(2M) (DESIGN: a union bound; a design's bounds across scenarios share one world sample). The stop ends effort inside one comparison. It is not an exclusion from O: a dominated design may still satisfy the mission.
Worked case. A carrier of body mass 10 kg lifts a payload p through h = 2 m on a ramp with 300 J of usable stored energy at the foot, and the mission admits arrival at the foot at up to 1.5 m/s. Utility is p divided by 10 kg. Every controller obeys (10 + p)·(g·h − v²/2) ≤ 300 J, so 10 + p ≤ 300/(19.62 − 1.125) = 16.22 kg and Ū = 0.622. A relaxation that leaves out the approach energy gives 10 + p ≤ 300/19.62 = 15.29 kg and Ū = 0.529. Against a competitor with L_c = 0.60 the incomplete relaxation issues a dominance stop, and it is false: p = 6 kg is feasible with a run-up, because 16 × 9.81 × 2 = 313.92 J ≤ 300 + ½·16·1.5² = 318 J. The sound bound 0.622 does not stop the design. This is the utility form of the sill case of Rule 1, and the incomplete relaxation is the seeded defect the gate must catch.
Honest limits. A bound over all controllers is only as tight as its relaxation. For contact-rich full-order tasks it is often vacuous (Ū = 1); the bracket then says nothing and has cost one small program. Whole-body certifying relaxations are not built here. The value concentrates in briefs limited by energy, torque, reach or a deadline.
Ceiling. The stop removes controller-stage work only. If a fraction x of candidates is dominated before training and computing the bounds costs a fraction y of baseline controller work, the stage shrinks by 1/((1 − x) + y): 10 at x = 0.93 and y = 0.03, and 1.4 at x = 0.3 (illustrative). The end-to-end gain is capped by the controller stage's share of the phase ledger (§2.2).
Owners and verbs. frob-mission produces both ends as Rule 1 certificates over the relaxations of frob-analyze;
frob-opt applies the labels and the stop in the ladder. mission.refute returns Ū_d with its binding constraint.
eval.compare --bracket returns both ends, the label and, for a dominated design, the competitor and both
certificates. A request to stop on a bound whose relaxation does not enclose a declared state or energy source is
refused, under the existing rule for exclusions (§28.4).
| Gate | Claim | Threshold (TARGET) | First milestone |
|---|---|---|---|
| GATE-AUGUR-28 | Known answer; Design comparison | On an exhaustively solvable planar ramp-and-carrier family (states and controls discretized so the optimum of each of at least 500 design and scenario pairs is known by dynamic programming): every Ū at or above the optimum, every L at or below it, zero false dominance stops; the run-up candidate is not stopped and the relaxation without approach energy is rejected. On a held-out brief limited by energy or torque: controller effort per accepted decision at least 3 times lower than static filters followed by the ladder, at matched decisions | M4 |
| Kill gate | Trigger | Fallback |
|---|---|---|
| ✖ KILL-AUGUR-BRACKET | One false stop on the solvable family or in an audited campaign (the audit of §28.12 samples dominated designs and trains them); or less than 3 times at matched decisions; or the label changes the agent's next action in under a tenth of comparisons | Brackets are printed as advisory labels, no stop is automatic, and designs leave the ladder only by the ladder's own rules |
25.33 Placement and sizing along a prescribed motion
A fifth constructive lane F. For a fixed topology with fixed joint axes and link lengths, the inverse dynamics of a prescribed motion is linear in the inertial parameters (C-03, C-04). At knot k of a motion (q_k, q̇_k, q̈_k) with active contacts C_k,
Y(q_k, q̇_k, q̈_k)·π = Sᵀ·τ_k + Σ_{c ∈ C_k} J_c(q_k)ᵀ·λ_{c,k},
where π stacks the ten inertial parameters of every body, S selects the actuated coordinates, and Y is the regressor
that frob-kir emits from the derived inverse-dynamics kernel. The lane (mission.synthesize --strategy placement,
owned by frob-synth) takes a small library of nominal motions for the archetype (from the gait atlas, the skill
artifacts and centroidal planning) and solves one cone program per motion and per catalog choice, over:
- inertia: π = π_fixed + Σ_s m_s·φ_s with m_s ≥ 0, where φ_s is the parameter vector of a unit mass at an admissible site s (battery cells, compute, ballast), and, for bodies whose distribution is free, the pseudo-inertia cone and the mass-support bound of C-03;
- contact forces λ_{c,k} inside the friction cone of the scene's interface card at that contact;
- joint torques τ_k, tied to the others by the equation above, under the cards of §15 at fixed gear ratios N: peak |τ_{j,k}| ≤ η·N·τ_peak; thermal ‖τ_j‖₂ ≤ √K·η·N·τ_cont over the K knots; voltage R·|τ_{j,k}|/(η·N·k_t) + k_e·N·|q̇_{j,k}| ≤ V_bus, linear because q̇ is data;
- objective: electrical energy Σ_j Σ_k [R·(τ_{j,k}/(η·N·k_t))² + τ_{j,k}·q̇_{j,k}]·Δt, a convex quadratic.
The solver is the one cone solver of §22.5, on the CPU; the certificate kinds are lp-primal, lp-farkas and
conic-farkas of §25.5. Three results come back: a placement and sizing that realizes the motion at least energy; a
lower bound on electrical energy for that motion; or a dual certificate that no placement and no admissible contact
forces realize it.
What the certificate says, and what it does not. The statement excluded is the pair (design cell, motion). A design that completes the mission by a different motion is untouched. The lane therefore proposes candidates and prunes motions; it removes a cell from O only when the mission itself prescribes the motion (a declared lift profile, a commanded acceleration). A count of library motions a design can realize is a screening signal under rule 4 of §28.4.
Three limits, each with its smallest case.
- A continuous site enters quadratically. A mass m at position x contributes m·x to the first moments and m·x² to the second. The program is linear in masses at fixed sites, not in a position. A splittable mass (cells along a rail) is exact; for one unsplittable module the program is a relaxation whose infeasibility still excludes every single-site placement, and a fractional optimum is rounded and re-solved.
- Energy is not jointly convex in torque and gear ratio. With N a variable the peak, thermal and voltage limits stay convex (the voltage limit times N reads c₁·|τ| + k_e·|q̇|·N² ≤ V_bus·N), so feasibility over a continuous ratio is one cone program. The copper-loss term g(τ, N) = τ²/N² is not convex: g(0, 1) = 0, g(2, 3) = 4/9 and at the midpoint g(1, 2) = 1/4 > 2/9. Minimum energy therefore enumerates catalog ratios, one program each.
- Link lengths are not variables. Y depends on them nonlinearly. They are enumerated on the cells of the query.
Known answer. A rear-drive cart with wheelbase 1 m and centre of mass at floor height: 15 kg fixed at 0.5 m from the rear axle and a 5 kg battery at x_b on a rail. The rear normal force is g·[7.5 + 5·(1 − x_b)] and traction needs μ·N_r ≥ 20·a. With μ = 1/2 and g = 981/100 m/s²: at a = 3 m/s² the motion is feasible exactly when x_b ≤ 35/654 m (53.5 mm); the largest acceleration over all placements is 0.5 × 9.81 × 12.5/20 = 3.066 m/s²; at a = 4 m/s² the program is infeasible for every placement, with the traction inequality as its dual. The same 4 m/s² motion is feasible with all wheels driven (μ·g = 4.905 m/s²), and the original cart reaches the same goal by a slower motion: the certificate excludes a motion, not the cart.
Pilot, ceiling and gate. Ceiling: the lane decides only the share of a design decision that is placement and sizing for known motions, and it starts a search; it does not replace one. A conventional optimizer over a dynamics library can pose the same program, so this is a convenience of the typed core and not a differentiator. Pilot before funding: the cart and one quadruped trot with a movable battery, two engineer-days on the CPU.
| Gate | Claim | Threshold (TARGET) | First milestone |
|---|---|---|---|
| GATE-AUGUR-29 | Known answer; Design comparison | The cart: boundary 35/654 m in exact rationals, the dual at 4 m/s² accepted by frob-verify. The regressor identity Y·π equals the derived inverse dynamics within 10⁻¹² relative on 10⁴ random states per reference robot. A request for jointly optimal energy and ratio is routed to enumeration. On 30 designs and two missions, candidates initialized by the lane beat their class templates by at least 15% in electrical cost of transport in closed-loop evaluation at a 95% paired lower bound, or start within 10% of the optimum that forward co-design reaches; the share of designs infeasible on every library motion that still pass the mission is reported |
M4 |
| Kill gate | Trigger | Fallback |
|---|---|---|
| ✖ KILL-SYNTH-REGRESSOR | The design-comparison part of GATE-AUGUR-29 fails; or more than 15% of designs infeasible on every library motion pass the mission in closed loop, in which case the motion-count screening signal is withdrawn first | The mass-placement program of §25.21 and A-24 as they stand; candidates start from class templates |
25.34 Weak-variable enclosure and the split set
Boxes of any dimension with a bounded split set F. This extends §25.6 and corrects the reading of ADR-AUGUR-06 under which a certificate's box has at most about six parameters. What is bounded is the number of parameters that are bisected, not the number the constraint reads. A constraint may depend on every parameter of a family and still be decided over most of the box, when most of that dependence is weak.
Definitions. For a lowered constraint g(x) ≤ 0 on a box B ⊂ ℝⁿ, an affine-form enclosure gives g(x) ∈ g₀ + Σᵢ aᵢ·εᵢ + r·[−1, 1] with εᵢ ∈ [−1, 1]. Parameter i contributes width 2·|aᵢ| and the nonlinear remainder contributes 2·r. Order the parameters by |aᵢ|. The split set S is the leading part of that order, capped at six (DESIGN: the cap of ADR-AUGUR-06). The other parameters are weak, and the weak width is ω = 2·(Σ_{i ∉ S} |aᵢ| + r) with every weak parameter at its full range.
Algorithm. A queue holds sub-boxes that differ from B only in the coordinates of S.
- Enclose g over the sub-box with every weak parameter at full range. Upper end at most 0: inner. Lower end above
0: excluded. Either result is an
interval-boxortaylor-boxcertificate whose box is the full n-dimensional sub-box. The checker's work is linear in n per box. - Otherwise bisect along the parameter of S with the largest current contribution. The enclosure is linearized again on each sub-box, so the aᵢ are local and the order may change.
- Stop splitting a sub-box when the width contributed by S falls below ω. No further split inside S can decide
it, because the weak parameters alone straddle the threshold. The cell is
unresolvedwith the reasonweak-variable width, and the report names the weak parameter with the largest |aᵢ| as the next candidate. - The budget is the box count of §25.6, per constraint.
Combination across constraints is unchanged: a design is inner when it lies in every constraint's inner set. Each set is now stored over the whole box with its split set recorded.
Known answer. On [0, 1]²⁰ let m = (1/19)·Σ_{i=2..20} (2·xᵢ − 1) and δ = 0.01·m², so 0 ≤ δ ≤ 0.01. Require g₁ = x₁ + δ − 0.8 ≤ 0 and g₂ = 0.2 + δ − x₁ ≤ 0. Both constraints read all 20 parameters and neither is monotone in x₂ to x₂₀. With S = {x₁} the weak width is 0.01. The slab x₁ < 0.2 is excluded by g₂; 0.21 ≤ x₁ ≤ 0.79 is inner for both; x₁ > 0.8 is excluded by g₁; the slabs [0.2, 0.21) and (0.79, 0.8] are unresolved. Five slabs decide 0.98 of the volume: 0.58 inner and 0.40 excluded. An isotropic paving of the same box with the budget of §25.6 (10⁴ boxes, 13 bisections, less than one cut per axis) decides almost none of it.
Negative control. g = Σ_{i=1..20} xᵢ − 10 ≤ 0 on the same box. Every parameter contributes the same width, 1.
With any six parameters in S the weak width is 14 and the sum over S ranges over [0, 6]. An inner cell would need
that sum to be at most −4 and an excluded cell would need it above 10; neither can occur. Stopping rule 3 fires at
once, since 6 < 14. The mechanism must return unresolved for the whole box after one enclosure and no
bisection, although half the volume is feasible by symmetry. A run that bisects here burns budget, and a run that
returns an inner or excluded cell is unsound. The exact answer to this constraint belongs to the monotone rule of
§25.6. That is the point of the control: the split-set rule is for dependence that is weak, not for strong
dependence spread evenly.
Scope and ceiling. The mechanism decides volume only where the weak width is small against the constraint's margin. HYPOTHESIS: for the static constraints of legged and wheeled classes, the parameters of other limbs and of distal bodies enter one leg's torque, reach and clearance constraints weakly, through posture and load share. OPEN-AUGUR-3 measures the constraint-to-parameter graph and now records |aᵢ| per parameter, not only incidence. Ceiling: no speed claim. Decided volume is evidence quality and tolerance robustness (§25.6); the number that matters is candidate evaluations avoided.
Owner and verbs. frob-mission owns the driver and the choice of S; enclosures come from the interval and
Taylor-model arithmetic behind the airlock; certificates are of the existing kinds. mission.refute and
mission.synthesize take --split-cap k (default 6) and report, per constraint, S, ω and the three volume shares.
| Gate | Claim | Threshold (TARGET) | First milestone |
|---|---|---|---|
| GATE-AUGUR-30 | Known answer; Design comparison | The 20-parameter case returns five slabs with shares 0.58, 0.40 and 0.02, and frob-verify accepts every certificate. The negative control returns unresolved for the whole box with one enclosure evaluation and no bisection. On the 12-parameter static quadruped family of §25.6, against per-constraint decomposition restricted to constraints that read at most six parameters and at the same box budget: at least 10 percentage points more decided volume, or at least 10% more candidate evaluations avoided, with no certificate rejected |
M4 |
| Kill gate | Trigger | Fallback |
|---|---|---|
| ✖ KILL-WEAKVAR | The comparison of the gate fails; or more than 90% of the volume of constraints that read more than six parameters stays unresolved at budget on the reference families | ADR-AUGUR-06 as first written: a constraint that reads more than six parameters receives no region certificate and is checked pointwise |
25.35 The controller class is part of a family answer
What it is. S A typing rule for inclusion over a set of loads or disturbances. A cell is certified for a
declared class of control laws, and the certificate carries the law. One feasible command per vertex of a load set
shows that a feasible command exists for every load in the hull, because the constraints are convex. It does not show
that a controller of the declared class can produce those commands. The class is the set of functions from the
observed quantities to the command, and it is a field of policy_class beside the authority model of §25.13. Owner:
frob-mission for the lowering, frob-cert for the checking rule. Verbs: mission.synthesize, mission.refute.
The stance family under three classes. The mission of §25.13: 400 N on feet at (±a, ±b) with a = 1/3 m, ratings of 160 N, and load moments P = (P_x, P_y) with abs(P_x) ≤ 60 N·m and abs(P_y) ≤ 30 N·m. The feet are ordered [++, +−, −+, −−], and foot i has signs (s_x, s_y).
| Class | Smallest half-width b | A law that attains it |
|---|---|---|
adjustable: any function of the observed P |
3/14 m | f(P) = Σ_σ w_σ(P)·f_σ over the four vertex allocations f_σ of §25.13, with w_σ(P) = ¼·(1 + σ_x·P_x/60)·(1 + σ_y·P_y/30) |
affine: f(P) = f₀ + A·P |
1/2 m | fᵢ(P) = 100 + s_x·P_x/(4a) + s_y·P_y/(4b) newtons |
constant: P is not observed before the command |
none | No fixed f satisfies Σ xᵢ·fᵢ = P_x for two values of P_x |
- Adjustable. The weights w_σ are nonnegative, sum to one and satisfy Σ w_σ·P_σ = P. The interpolant therefore meets the three balance equations at every P and stays inside the ratings by convexity. It is not affine: at b = 3/14 m its coefficient of P_x·P_y is (−20, 20, 20, −20)/1800 N per (N·m)². At P = 0 it gives 100 N on every foot.
- The four witnesses are not values of one affine law. An affine function on a rectangle satisfies f(60, 30) + f(−60, −30) = f(60, −30) + f(−60, 30). The vertex allocations give (160, 240, 240, 160) N on the left and (240, 160, 160, 240) N on the right.
- Affine. If an affine law is feasible, so is its image under each reflection of the load rectangle with the matching exchange of feet, and so is the average of the four images, because the constraints are convex and the mission is symmetric. The average is invariant under the reflections, which forces the form in the table, and the balance equations fix its coefficients. Its largest value is 100 + 60/(4a) + 30/(4b) = 145 + 15/(2b) N, which is at most 160 N exactly when b ≥ 1/2 m; its smallest value, 55 − 15/(2b) N, is positive there. The affine class needs 7/3 times the half-width of the adjustable class.
- The passive suspension is an affine controller. The symmetric affine law is the load sharing of four equal springs. At b = 1/4 m it gives (175, 115, 85, 25) N at the vertex (60, 30), which is the passive allocation of §25.13. The authority counterexample and the class counterexample are one fact seen twice.
Mechanism. DESIGN.
policy_classgains the fieldlaw, one ofadjustable,affine,piecewise-affineandconstant. The arguments of the law are the fields listed as observed before the decision. A query that asks for inclusion over a load or disturbance set and omitslawis refused (refusal: inclusion over a disturbance set without a declared law class).- Lowering. For
adjustable: one command per vertex of the load polytope, which is the lifted program of §25.13; the returned law is the multilinear interpolant on a box, and the barycentric interpolant on a declared triangulation otherwise. Foraffine: the unknowns are (f₀, A); equalities are imposed as identities in P by matching coefficients; inequalities are imposed at the vertices, where an affine function on a polytope takes its extremes. Forconstant: one command for every vertex. - Certificate. The
lp-primalkind carries alawobject with its kind (multilinear-vertex,barycentric,affineorconstant) and its data. The checker recomputes the balance equations and the ratings at every vertex. Foraffineit checks that the listed vertex commands equal f₀ + A·P exactly. Formultilinear-vertexit checks that the load set is a box whose vertices are the listed ones. In every case it checks that each argument of the law arrives before the decision instant (§20.4). mission.refuteunderaffine, for b in [3/14, 1/2) m, returns the dual of the affine program and names the class as a repair beside the geometric one: widen to 1/2 m, or admit a law that is not affine.
Known answers (exact rationals; every value is derived on file from the stated inputs).
| Case | Value | Mutation that must fail |
|---|---|---|
adjustable, b = 3/14 m |
Inner, with the bilinear law; 100 N per foot at P = 0 | The four vertex commands labelled affine |
affine, b = 1/2 m |
Inner; (160, 130, 70, 40) N at the vertex (60, 30) | — |
affine, b = 1/4 m |
Excluded; the symmetric law needs 175 N | A hull certificate with no law object |
constant, any b |
Excluded | A constant command accepted because each vertex has some feasible command |
| GATE-AUGUR-31 | Known answer. Through the public verb the stance family returns 3/14 m under adjustable with the bilinear law, 1/2 m under affine with the symmetric law and a matching dual, and an exclusion for every b under constant. The bilinear law evaluated on a 121 × 61 grid of loads meets every balance equation and rating in exact rationals. The four vertex witnesses relabelled affine are rejected by frob-verify, and so is a certificate with no law object. M1. |
25.36 Docking to a finite tolerance over a continuous gain interval
What it is. S The amended docking game that §25.15 leaves open, solved in closed form. It is a second known
answer of the docking family: a least guaranteed tolerance over a continuum of hidden gains, with an irrational
algebraic optimum, a rational witness above it and a rational exclusion below it. Owner: frob-mission, with
frob-conformance for the fixture. Verbs: mission.synthesize with the objective "least guaranteed tolerance", and
mission.refute.
The game. The plant, the three ticks and the packet timing are those of §25.15. The gain g is any constant in [1, 2]. The command bound is U = 3/4. The first velocity reading r = g·p + e arrives before the second command, with e in [−ε, +ε] and ε = 1/64. The robot must be exactly at rest after the third tick, and the guarantee sought is abs(x₃ − 1) ≤ δ for every admitted g and e.
The answer. The least guaranteed tolerance is δ* = (√1745 − 41)/32 m, about 24.1624 mm, the positive root of 16·δ²
- 41·δ − 1 = 0. It is attained with the first command p* = (39 + √1745)/128, about 0.631041. A 20 mm requirement is infeasible. A 25 mm requirement is met with the rational probe p = 5/8.
Derivation. Write p = u₀ and c = 2p + u₁. Rest forces u₂ = −p − u₁, and then x₃ = g·c. For p > 0 the limits on u₁ and u₂ confine c to [2p − U, p + U]. A reading r admits the gains [a, b] with a = max(1, (r − ε)/p) and b = min(2, (r
- ε)/p), and the tolerance requires (1 − δ)/a ≤ c ≤ (1 + δ)/b. A common c exists at every reading exactly when three conditions hold.
- Ambiguity. The ratio b/a is largest at the reading p + ε, where a = 1 and b = 1 + 2ε/p. The interval for c is nonempty there exactly when ε/(p + ε) ≤ δ, that is p ≥ ε·(1 − δ)/δ.
- Reach at the high gain. Where the reading admits g = 2, c is at most (1 + δ)/2, so 2p − U ≤ (1 + δ)/2, that is p ≤ (2U + 1 + δ)/4.
- Reach at the low gain. Where the reading admits g = 1, c is at least 1 − δ, so p + U ≥ 1 − δ.
A larger probe eases the first condition and tightens the second. Equating them gives 4ε·(1 − δ) = δ·(2U + 1 + δ),
which is 16·δ² + 41·δ − 1 = 0 at U = 3/4 and ε = 1/64, with p* = (2U + 1 + δ*)/4. The third condition is slack. A
probe p ≤ 0 gives c ≤ U = 3/4, which is short of 1 − δ in the world g = 1 for every δ < 1/4. The error interval and
the tolerance are closed, so the optimum is attained and the answer carries attained: true, unlike the strict family
of §25.3.6. DESIGN arithmetic: for other values with U ≥ (1 + δ)/2 the same argument gives the positive root of δ² +
(2U + 1 + 4ε)·δ − 4ε = 0.
The witness policy. After the reading, compute [a, b], choose any c in [max((1 − δ)/a, 2p − U), min((1 + δ)/b, p + U)], and command u₁ = c − 2p and u₂ = −p − u₁.
Certificates. The optimum is irrational. It is returned as the root of its polynomial with a rational enclosure, bracketed by two rational certificates.
- Inclusion at δ = 1/40 with p = 5/8. 1/41 ≤ 1/40; 2p − U = 1/2 ≤ 41/80; p + U = 11/8 ≥ 39/40. The reading interval
[p − ε, 2p + ε] is partitioned at p + ε and 2p − ε, and the interval for c is checked at the ends of each piece,
where its bounds are monotone in r. Kind:
partitionoverinterval-boxpieces. - Exclusion at δ = 1/50. The polynomial is negative there: 16/2500 + 41/50 − 1 = −0.1736. Every p in (0, 49/64)
fails condition 1 through an alias pair: the worlds g = 1 with e = +ε and g = min(2, 1 + 2ε/p) with the error that
gives the same reading share p + ε and need disjoint values of c. Every p above 63/100 fails condition 2. Since
63/100 < 49/64, the two cases cover (0, 3/4], and p ≤ 0 fails as above. Kind:
alias-pair, with apartitionof the probe axis.
What the fixture is for. It checks that Augur returns a minimum that is not rational, that a closed tolerance is reported as attained, and that a continuum of hidden parameters is settled by endpoint reasoning with a certificate and not by sampling gains.
FACT (a recorded pilot, Appendix K; to be re-run before a gate cites it): a solver on the raw three-tick dynamics excluded 20 mm, and independent interval checks confirmed inclusion at the threshold. Recomputed for this section in exact rationals: the witness policy at δ = 1/40 and p = 5/8, run on the raw dynamics for 2,049 gains and 65 errors, ends at rest inside the tolerance in all 133,185 cases; at δ = 1/50 no probe on a grid of 95 values succeeds on all cases.
| GATE-AUGUR-32 | Known answer. Through the public verbs: δ = 1/50 is excluded with the alias pair and the partition of the probe axis; δ = 1/40 is included with p = 5/8; the minimum is returned as the root of 16·δ² + 41·δ − 1 with an enclosure no wider than 10⁻⁹ m and attained: true. The witness policy passes the 133,185 exact cases on the raw dynamics. A screen compiled for the gain set {1, 2} is refused on the interval [1, 2]. M1. |
25.37 Channel laws: the joint error law of repeated reads, and the code that carries a label
What it is. S Two declarations that a guarantee about information must carry, each with the smallest case in
which omitting it gives a wrong answer. A sensor budget states the joint law of its read errors, not their pairwise
tables. A label count states the channel that carries the label and the length of the message. Owner: frob-sense for
the error law, frob-mission for the label query, frob-analyze for analysis A-17. Verbs: sense.alias,
mission.synthesize.
Pairwise independence is not joint independence. A hidden binary class is read seven times, and each read is right with probability 3/4.
| Declared law of the errors | Best success, equal priors |
|---|---|
| Jointly independent | 3807/4096, about 0.9294 |
| One fault bit shared by all reads | 3/4 |
| The pairwise-independent law below | 55/64, about 0.8594 |
In each class draw the number K of wrong reads as 1, 2, 3 or 4 with probabilities (43, 3, 9, 9)/64, and place them uniformly among the seven slots. Each read is wrong with probability E[K]/7 = (112/64)/7 = 1/4. Each pair is wrong together with probability E[K·(K − 1)]/42 = (168/64)/42 = 1/16, so every pair has the table of two independent reads. A history with one or two errors relative to one class has six or five relative to the other, which has probability zero there, and is decoded with certainty. A history with three errors relative to one class has four relative to the other, and its likelihood is (9/64)/35 under both. The best decoder succeeds with probability 46/64 + ½·(18/64) = 55/64. A requirement of 0.9 is met by the independent law and missed by this one, with the same accuracy and the same pair tables.
DESIGN. A sensor card states error_dependence: joint-independent, shared-fault, declared-law (a finite joint
law by reference), pairwise or unknown. Analysis A-17 and sense.alias credit redundancy, meaning a success
probability above the single-read accuracy, only under joint-independent, under a declared-law whose best decoder
is found by enumeration (128 histories here), or under a proved lower bound on the histories that decide. Under
pairwise or unknown the guaranteed value is the single-read accuracy, and a request for more is refused (refusal:
redundancy credited without a joint error law).
A label is a message. The label query of §25.18 counts labels. The factory must also deliver the label by the
commitment deadline over a real channel. DESIGN: the query gains channel, one of clean, erasures(e) (up to e
known positions lost) and flips(t) (up to t unknown bit errors), for a one-shot binary message of fixed length with
no feedback, and a bit time. For L labels the least length n is the least n that admits a binary code of L words with
minimum distance 1, e + 1 or 2t + 1. The answer returns the label count, the length, a code, and the check n × bit
time ≤ time to commitment. For L ≤ 16 and n ≤ 12 (DESIGN caps) the least length is found by exhaustive search: the
code is the upper-bound witness, and the exhausted search, or a counting argument where one exists, is the lower
bound.
Known answers for the three labels of the one-label-map fixture of §25.18.
| Channel | Least length | Code | Why no shorter |
|---|---|---|---|
clean |
2 bits | 00, 01, 10 | One bit has two words |
erasures(1) |
3 bits | 000, 011, 101 (pairwise distance 2) | Any three words of length 2 include a pair at distance 1 |
flips(1) |
5 bits | 00000, 00111, 11001 (distances 3, 3, 4) | Distance at least 3 for each pair needs the three distances to sum to 9; each bit position adds at most 2 to that sum, since three binary symbols cannot differ pairwise; four bits give at most 8 |
A transmission deadline of four bit times therefore admits guaranteed operation under one erasure and excludes it under one flip. The checker enumerates the received-word sets under the declared channel and verifies that they are disjoint.
| GATE-AUGUR-33 | Known answer. Enumeration of the 128 histories returns 55/64 for the pairwise law, 3807/4096 for the independent law and 3/4 for the shared fault, exactly; a redundancy claim on a card marked pairwise is refused. The three label rows return 2, 3 and 5 bits with codes whose received-word sets are disjoint; the four-bit request under flips(1) returns an exclusion with the counting argument. On 20 generated instances with L ≤ 8 and e, t ≤ 2 the least length equals brute force. The error-law rows at M3, the label rows at M4. |
25.38 Shared nuisance parameters, and the probe for four admitted laws
What it is. F Two additions to §25.14. The first is a rule: nuisance parameters that two quantities share in the
world stay shared in every bound that compares them. The second is a known answer: once the delayed law D is admitted
to the mechanism set, a probe exists that separates all four laws, at a longer dwell than the three-law probe. Owner:
frob-mission. Verbs: mission.distinguish, experiment.suggest.
Shared parameters. In the fixture both pads of one trial have the same residual fraction q and the same time constant τ. The margin of the compact pad over the broad pad at the handover is m(q, τ) = 60·R(1, T; q, τ) − 50·R(2, T; q, τ) newtons. Minimizing the two terms separately lets the compact pad take (q, τ) = (0.18, 0.9 s) while the broad pad takes (0.22, 1.1 s). No such trial exists.
| Law | Least m with q and τ shared | Least m with independent extremes |
|---|---|---|
| V and C | 4.50 N, at (0.18, 0.9 s) | 0.28 N |
| D | 4.72 N, at (0.18, 1.1 s) | −0.078 N |
| P | −13.06 N; the broad pad wins everywhere, by at least 10.02 N | −15.08 N |
The values are derived on file on a 201 × 201 grid of the box. FACT (a recorded pilot, Appendix K; to be re-run): an enclosure of the D row reported at least 4.07 N shared and −0.0776 N independent. Under D the independent bound changes sign. It reports that the broad pad might win where the compact pad wins by more than 4.7 N over the whole box.
DESIGN. Every nuisance parameter of a mission or a measurement contract has a scope: the set of quantities that read
one realization (a trial, a pad pair, a batch of material, a unit). Interval and affine evaluation treats a scoped
parameter as one variable across every expression in its scope, by a shared noise symbol or by subdividing the shared
box, never as an independent interval per expression. A parameter with no declared scope is evaluated independently
and the result is marked scope: undeclared. That direction is safe for inclusion, since it only widens the
unresolved set. It is not safe for refutation: an extreme point of an independent box is not a world, and it cannot
serve as a counterexample witness (refusal: witness assembled from unshared values of a shared parameter).
The four-law probe. With D admitted the decisions are compact for V, C and D and broad for P. On the candidate grid of §25.14 no probe at a dwell of 1/4 s or less separates P from D, because D follows P until t/τ = 1/4. At 1/2 s three radii separate them after both read errors of ±0.02 are included.
| Probe | Least reading under P | Greatest reading under V, C, D | Gap after both errors | Cost |
|---|---|---|---|---|
| r = 3/2, t = 1/2 s | 0.8206 | 0.7677 | 0.0129 | 0.75 s |
| r = 2, t = 1/2 s | 0.8937 | 0.7874 | 0.0662 | 0.75 s |
| r = 3, t = 1/2 s | 0.9509 | 0.8019 | 0.1090 | 0.75 s |
Each of the three decides all 900 enumerated cases correctly (four laws, 225 cases each). Against the direct
measurement at mission dwell, 1.25 s with the archived compact reading, the modeled time ratio is 1.25/0.75 = 5/3.
DESIGN: among probes of equal cost mission.distinguish chooses the largest gap, here r = 3. A tie-break by smallest
radius returns a gap eight times smaller at the same cost.
What this does not change. The 225 reversals of the three-law probe on the withheld law stand, and so does the normative lesson of §25.14. This is a result on a known mechanism set. A fifth law outside it can reverse it again, and the direct measurement at mission conditions stays in the candidate set.
Ceiling, stated before any speed test. 5/3 in modeled exposure time on this fixture, and 1 against a programmed expert who is given the same four laws.
| GATE-AUGUR-34 | Known answer. The margin table reproduces to 10⁻³ N, and a refutation built from the independent extremes under law D is refused. With four laws admitted mission.distinguish returns a probe at t = 1/2 s with r = 3 and a gap of at least 0.10, decides 900 of 900 cases, and returns no probe at any dwell of 1/4 s or less. M4. |
| ✖ KILL-AUGUR-PROBE | The existing kill gate of §25.27 gains one trigger: a certificate or a counterexample that depends on unshared values of a parameter declared shared passes the checker. Its fallback is unchanged. |
25.39 Sizing witnesses for fixed points, and Pareto coverage of a catalog
What it is. S Two acceptance rules for the co-design lane of §25.21.1. A sizing answer on a continuous resource
is accepted on a witness, never on a small increment. A complete Pareto claim over discrete builds is accepted on a
disposition for every omitted option, never on a sweep of weights. Owner: frob-synth, with frob-algebra for the
order checks. Verb: mission.synthesize.
A small increment is not a fixed point. A pack of mass m needs a pack of mass F(m) = 1 + 0.99·m kilograms to carry itself and the payload. Kleene iteration from zero gives x_k = 100·(1 − 0.99ᵏ). After 527 iterations the iterate is about 99.5 kg and the next step adds 5 g. The least feasible mass is 100 kg. A stop on "increment below 10 g" returns a pack half a kilogram too light, and F(99.5) = 99.505 > 99.5 shows that it does not carry itself.
DESIGN. On a finite catalog chain the criterion of §25.21.1 stands: the iteration stops at exact equality. On a continuous resource the lane returns a bracket.
- Upper witness. A value U with F(U) ≤ U in the product order. Because F is monotone, every Kleene iterate from the bottom stays below U, so the least fixed point is at most U and U is feasible. The check is one evaluation of F.
- Lower bound. Any Kleene iterate from the bottom is at most the least fixed point.
- Width. The answer states U − x_k. Where a contraction constant q < 1 has been proved in a stated norm, the distance from x_{k+1} to the fixed point is at most q·‖x_{k+1} − x_k‖/(1 − q), which proposes U; the proposal is still checked by F(U) ≤ U.
In the fixture q = 0.99: from 99.5 kg the bound is 0.99 × 0.005/0.01 = 0.495 kg above 99.505 kg, which gives 100 kg,
and F(100) = 100. A sizing answer without an upper witness is labeled lower-bound-only and cannot be returned as a
design (refusal: sizing returned without a feasibility witness).
A weighted sum does not find every nondominated build. Three feasible builds have (body cost, facility cost) equal to (0, 6), (4, 4) and (6, 0). None dominates another. For weights (w₁, w₂) ≥ 0, not both zero, the build (4, 4) is best only if 4w₁ ≤ 2w₂ and 4w₂ ≤ 2w₁, which together force both weights to zero: the two extremes average to (3, 3), which is not a build and lies below (4, 4). A facility budget of four makes (4, 4) the unique build of least body cost.
DESIGN. An answer with the claim pareto over a discrete catalog lists, for every option it omits, one disposition:
dominated-by with the dominating option, infeasible with its exclusion, or unresolved. If any option is
unresolved the claim is downgraded to pareto-candidates, and the answer carries the remaining coverage obligation.
Candidates are generated by dominance filtering on a finite catalog and by constrained queries (least body cost
subject to a bound on each other objective at its attained values) otherwise; weighted sums may propose points and
never close the set.
| GATE-AUGUR-35 | Known answer. On the scalar pack the lane returns a bracket whose upper end passes F(U) ≤ U and lies within 1 g of 100 kg; the increment-stopping mutant returns 99.5 kg and is refused. On the three-build catalog all three builds are returned with dispositions; a weights-only mutant omits (4, 4) and fails; the budget query returns (4, 4). On 20 generated catalogs of at most 200 options the returned set equals brute-force dominance filtering. M4. |