FrankenRobotics

The constructions (C-01 onward)

24,772 words40 subsections3 tables7 listingsPlan version 1.1

On this page40
C-01 Configuration is a Lie group, and joints are subgroupsC-02 The frame groupoid and typed spatial algebraC-03 Inertia lives on a coneC-04 Dynamics is the Euler–Poincaré equation on a treeC-05 Time stepping stays on the groupC-06 Contact is a cone program in the dual algebraC-07 Wheels are a distribution, and maneuvering is a Lie bracketC-08 Locomotion is holonomyC-09 A morphology has two symmetry groupsC-10 Gaits are subgroups, and their timing is max-plus linearC-11 Kinematics is algebraic geometryC-12 A robot is a composition over typed portsC-13 Estimation and control live on groupsC-14 Kernels are derived, typed by dimension, and carry certificatesC-15 Evidence is a test martingaleC-16 A gait is a hybrid orbit: saltation, return maps, labeled derivativesC-17 A mission is a quantified set of designsC-18 Assumptions form a lattice, and verdicts have polarityC-19 Information has a clock: causal policies and indistinguishabilityC-20 Observability is a Gramian modulo a gaugeC-21 Designs are canonical up to the similarity groupC-22 A campaign is quotiented by symmetry orbitsC-23 A family policy is a section, and edits transport itC-24 A geometric-algebra policy on the kinematic treeC-25 Fidelity tiers are coupled estimatorsC-26 Rungs are trusted by rank agreement and conformal marginsC-27 Rare failures: bounded weights certify, splitting exploresC-28 A failure has a minimal counterexample worldC-29 A deterministic forkable simulator is a causal modelC-30 Requirements are temporal logic over unit-normalized predicatesC-31 Safety is an energy budget first, a filter secondC-32 Region certificates and dual witnesses of infeasibilityC-33 Clearance is certified from both sidesC-34 Linkage synthesis: an exact bounded lane and a continuation laneC-35 Structure and life: topology, fatigue, toleranceC-36 The trapezoidal variational step and the discrete nonholonomic stepC-37 The four-dimensional contact cone and joint-level rowsC-38 Actuators are port-Hamiltonian with a thermal nodeC-39 The value of an experiment, and the design of a probeC-40 Dominance is unreachability in a product system

Each construction is stated with one schema: the object, what it replaces, the payoff, the honest limits where the evidence narrows the claim, the foundations as they exist today, the test, and the tier. A construction tagged F or M adds a pilot and ceiling line (D-10), and where it helps a retired when line names the observation that withdraws the optimization. Symbols are defined in §11 and Appendix D.

Four reading rules apply to the whole chapter.

  1. Foundations are FACT, observed on 2026-11-21 at FrankenSim 483d09c682f2, FrankenSymPy 29f847c1 and FrankenLean 4426f8ea7. A foundation that exists is not a foundation that is admitted: admission is §33.
  2. Numbers inside a test are exact arithmetic on the stated fixture, written so that a reader can check them by hand. They are known answers, not measurements.
  3. Thresholds are TARGET. A figure quoted from a publication, or from a planning pilot that ran outside this repository, is FACT with an entry in the source register (Appendix H), to be re-read from the primary source or re-run here before a gate cites it.
  4. A construction fixes mathematics and its test. Types, kernels, verbs and gates are owned by the chapter and the crates named in the table below, and each gate lives in that chapter.
Id Construction Tier Owning chapter Crates
C-01 Configuration is a Lie group, and joints are subgroups S / F §13, §14 frob-lie, frob-model
C-02 The frame groupoid and typed spatial algebra S §13 frob-lie
C-03 Inertia lives on a cone S / F §13, §14 frob-lie, frob-model
C-04 Dynamics is the Euler–Poincaré equation on a tree S §16 frob-dyn
C-05 Time stepping stays on the group S / F §16 frob-lie, frob-dyn
C-06 Contact is a cone program in the dual algebra S / F §18 frob-algebra, frob-contact
C-07 Wheels are a distribution, and maneuvering is a Lie bracket S / F §18, §28 frob-contact, frob-analyze
C-08 Locomotion is holonomy F §28 frob-analyze
C-09 A morphology has two symmetry groups S / F §13, §23 frob-algebra, frob-learn
C-10 Gaits are subgroups, and their timing is max-plus linear F §22 frob-algebra, frob-gait
C-11 Kinematics is algebraic geometry S / F / M §13, §28 frob-lie, frob-analyze
C-12 A robot is a composition over typed ports F §14 frob-design, frob-model
C-13 Estimation and control live on groups S / F §22 frob-control
C-14 Kernels are derived, typed by dimension, and carry certificates F §21 frob-kir
C-15 Evidence is a test martingale S §24, §28 frob-arena
C-16 A gait is a hybrid orbit: saltation, return maps, labeled derivatives F §16, §22 frob-dyn, frob-gait
C-17 A mission is a quantified set of designs F §25 frob-mission
C-18 Assumptions form a lattice, and verdicts have polarity F §25, §28 frob-mission
C-19 Information has a clock: causal policies and indistinguishability S / F §20, §25 frob-sense, frob-mission
C-20 Observability is a Gramian modulo a gauge S §20, §22 frob-sense, frob-analyze
C-21 Designs are canonical up to the similarity group S / F §14, §17 frob-model, frob-phylum
C-22 A campaign is quotiented by symmetry orbits S / F §17, §28 frob-algebra, frob-phylum
C-23 A family policy is a section, and edits transport it F §23 frob-learn
C-24 A geometric-algebra policy on the kinematic tree M §23 frob-learn
C-25 Fidelity tiers are coupled estimators S / F §24, §28 frob-arena
C-26 Rungs are trusted by rank agreement and conformal margins F §28 frob-opt
C-27 Rare failures: bounded weights certify, splitting explores S / F §26 frob-nemesis
C-28 A failure has a minimal counterexample world F §26 frob-nemesis
C-29 A deterministic forkable simulator is a causal model S §27 frob-autopsy
C-30 Requirements are temporal logic over unit-normalized predicates S §24 frob-spec
C-31 Safety is an energy budget first, a filter second F; tube tables M §22 frob-shield
C-32 Region certificates and dual witnesses of infeasibility F §25 frob-mission, frob-cert
C-33 Clearance is certified from both sides F §19 frob-scene
C-34 Linkage synthesis: an exact bounded lane and a continuation lane F / M §28 frob-synth
C-35 Structure and life: topology, fatigue, tolerance F §31 frob-foundry
C-36 The trapezoidal variational step and the discrete nonholonomic step F / S §16 frob-dyn
C-37 The four-dimensional contact cone and joint-level rows S §18, §15 frob-contact, frob-actuate
C-38 Actuators are port-Hamiltonian with a thermal node S §15 frob-actuate
C-39 The value of an experiment, and the design of a probe S / F §28, §30 frob-opt, frob-ground
C-40 Dominance is unreachability in a product system F §25 frob-mission

C-01 Configuration is a Lie group, and joints are subgroups

  • Object. A floating-base robot's configuration space is Q = SE(3) × G₁ × … × Gₙ. Joint j contributes the map θ ↦ ∏ₖ exp(θₖ Sₖ) for screws Sₖ ∈ 𝔰𝔢(3). When span{Sₖ} is closed under the bracket, the joint is a connected subgroup of SE(3). Those subgroups fall into twelve conjugacy classes (Hervé): the identity; line translation; rotation about an axis; helical motion of pitch p; planar translation; cylindrical; spatial translation; planar gliding SE(2); spherical SO(3); translating screw; Schönflies; and SE(3) itself. The six lower pairs are the revolute, prismatic, helical, cylindrical, planar and spherical classes. A joint that is not a subgroup (a universal joint) is a product of one-parameter subgroups. Joint limits cut a feasible subset out of Q and loop closures cut level sets; the regular part is a manifold where the constraint Jacobian has constant rank, and singular poses, unilateral contacts and mode changes need the stratified description of C-16. State also includes motor, battery, thermal, contact-memory, estimator and controller coordinates.
  • Replaces. enum JointKind with one hand-written code path per case.
  • Payoff. One kernel generator parameterized by a screw basis covers every joint. Mobility analysis (A-01) can use intersections and products in the subgroup lattice, which gives the right answer for the exceptional over-constrained linkages whose mobility follows from subgroup structure (Sarrus) and returns no verdict for paradoxical ones (Bennett, Bricard), whose mobility rests on metric conditions and is decided by the rank test alone; both kinds are linkages where the Grübler–Kutzbach count is wrong.
  • Foundations. fs-mbd has JointKind = Fixed | Revolute | Prismatic | Helical only, with no spherical, universal or planar joints; fs-ga has Twist::bracket and Twist::ad. The joint catalog crate fs-kinematics proposed by FrankenSim's charter does not exist.
  • Test. Bracket-closure classification of a screw basis in exact rational arithmetic (T-11). Known answers: the Sarrus linkage has mobility 1 where the count gives 0, and the Bennett linkage has mobility 1 where the count gives −2.
  • Pilot and ceiling. For lattice mobility: the Sarrus and Bennett linkages and one over-constrained leg linkage, against the rank of the constraint Jacobian at exact rational sample points. The lattice must return 1 for Sarrus and undecided for Bennett, where the rank test returns 1. Falsifier: one wrong mobility. Ceiling: a correct analysis where the count is wrong; no speed is claimed. Fallback: the numerical rank test alone.
  • Tier. S for the generator and classification; F for lattice-based mobility.

C-02 The frame groupoid and typed spatial algebra

  • Object. Frames are objects and a rigid transform a_from_b is a morphism from b to a, so transforms form a groupoid. The adjoint Ad is a functor from that groupoid to invertible maps on 𝔰𝔢(3); the group coadjoint is its contragredient on 𝔰𝔢(3)*, the inverse transpose. A twist is a vector typed by a frame, a wrench is a covector typed by a frame, and their pairing is power, which does not depend on the frame. Three maps move quantities between frames and each is its own type (§11.3): the twist map Ad_g, the wrench pushforward Ad_g⁻ᵀ, and the wrench pullback Ad_gᵀ. A reflection is not a morphism of this groupoid, because improper isometries are not in SE(3); it acts through the parity rule of §11.4 as a separately typed map. Coordinate charts (logarithms, joint charts) are partial maps with stated overlap domains.
  • Replaces. 4×4 matrices and 6-vectors whose frames live in comments.
  • Payoff. a_from_b · b_from_c has type a_from_c, and nothing else composes. A twist in frame b cannot be added to a twist in frame c, and a wrench cannot be moved by the twist map. Static frames are phantom types; model-indexed frames are checked at model compile time, so batched kernels pay nothing. A derivative query at a chart cut requests another chart or receives a typed refusal.
  • Foundations. fs-ga provides Se3::{compose, inverse, adjoint, coadjoint}, Twist::transform_by, Wrench::{pairing, transform_by}; Se3::coadjoint is documented as Ad⁻ᵀ, which fixes the convention of §11.2. fs-mbd already names transforms world_from_base.
  • Test. Ad(gh) = Ad(g)·Ad(h); invariance of the pairing under a change of frame (T-04, T-05). The sample set includes tiny angles, translations near the origin, rotations approaching π from both sides and sign-equivalent quaternions. A single reversed adjoint must fail at least three independent fixtures: the composition law, the pairing, and the planar fixture of C-04. A loop of chart changes returns to the identity inside its stated error budget.
  • Retired when. A loop of chart changes exceeds its error budget: that chart pair is withdrawn from the derivative path and the query is refused.
  • Tier. S.

C-03 Inertia lives on a cone

  • Object. A rigid body's ten inertial parameters are equivalent to the 4×4 pseudo-inertia matrix P = [[Σ, h], [hᵀ, m]], with Σ the second moment of mass and h the first. The parameters are physically consistent exactly when P is positive definite (Wensing, Kim, Slotine). The cone of such matrices with its affine-invariant metric is a Riemannian symmetric space; the log-Euclidean parametrization S = log P is an equivalent chart for optimizers and either may be used. Positivity is necessary and not sufficient for a declared envelope: a body whose mass lies inside a ball of centre o and radius ρ also satisfies the mass-support bound ‖c − o‖² + tr(I_C)/(2m) ≤ ρ², whose left side is the mass-weighted mean squared distance from o.
  • Replaces. Ten free floats.
  • Payoff. Import validation is an eigenvalue test with a certificate (T-19). Optimization and identification steps follow geodesics and cannot leave the feasible set. By default inertias are not parameters at all: they are computed from geometry and material density, so an agent designs shapes and materials. A body with a declared wall thickness is a shell, computed by the difference rule of §11.5, and a solid fill of a large enclosure raises a density warning instead of passing silently.
  • Foundations. fs-mbd::SpatialInertia; fs-mbd-material (material-derived inertia, about 60k lines); fs-opt manifold variables with retractions.
  • Test. Round trip between P and spatial inertia; detection of triangle-inequality violations; an audit of every reference robot in Appendix G. Mass-support fixture: a centred 1 kg part with three principal moments of 0.008 kg·m² passes the positivity and triangle tests yet needs 0.012 m² where a ball of radius 0.10 m allows 0.010 m²; an isotropic thin shell of that radius, with moments 1/150 kg·m², reaches equality. Shell fixture: an aluminium box of 0.4 × 0.3 × 0.2 m at 2,700 kg/m³ has mass 64.8 kg as a solid and 3.45 kg with a 2.5 mm wall, a ratio of 18.8.
  • Pilot and ceiling. For Riemannian identification: recovery of planted inertial parameters of one link from simulated excitation, against a projected Euclidean fit. Falsifier: no fewer infeasible iterates and no better recovery at equal data. Ceiling: identification quality for the calibration lane of §30. Fallback: a Euclidean fit projected onto the cone.
  • Tier. S for validation and geometry-derived inertia; F for Riemannian identification.

C-04 Dynamics is the Euler–Poincaré equation on a tree

  • Object. With body velocity ξ = g⁻¹ġ of the base and shape s (the joints), the body momentum is μ = 𝕀(s)·(ξ + 𝔸(s)·ṡ). Here 𝕀(s) is the locked inertia, which is the composite rigid-body inertia at the base, and 𝔸 is the mechanical connection. The base obeys μ̇ = ad*_ξ μ plus applied wrenches, with ad*_ξ = ad_ξᵀ as fixed in §11.2. Featherstone's recursions (RNEA, CRBA, ABA) evaluate these equations on the kinematic tree using Ad, ad and ad*. In generalized coordinates the smooth equations read M(q)·v̇ + h(q, v) = B(q)·u + J(q)ᵀf + f_ext with q̇ = 𝒯(q)·v.
  • Replaces. An opaque step function.
  • Payoff. Centroidal momentum is the momentum map, so centroidal quantities and their dynamics are available without extra code and the centroidal controller of §22 is the reduced equation. In ballistic flight the centre of mass follows a parabola and angular momentum about it is constant, which is an exact test. The change of angular momentum minus the external angular impulse about one fixed inertial origin is a diagnostic that separates unexpected yaw caused by a controller or by friction from an accounting defect. The recursion is parallel across tree depth, which is the shape a GPU wants.
  • Honest limits. The batched tiers materialize a dense mass matrix per world for mechanisms of 18 to 60 degrees of freedom (DESIGN, §16); a tree-operator route that avoids it is F and is meant for larger mechanisms. A limb summarized at its attachment port by its articulated inertia and bias wrench is positive semidefinite, not definite: eliminating a joint axis s by I − I·s·(sᵀI·s)⁻¹·sᵀI removes one direction (for I the identity and s the first axis the result is diag(0, 1, 1, 1, 1, 1)), so multi-limb ground contact still goes through the coupled base solve.
  • Foundations. fs-mbd::articulated::{forward_kinematics, inverse_dynamics, forward_dynamics, free_floating_forward_dynamics, free_floating_momentum} and generalized::free_floating_terms (mass matrix by a composite-rigid-body pass).
  • Test. Parity with fs-mbd (GATE-KIN-03); ballistic invariants; kinetic energy equals ½·vᵀM v; Ṁ − 2C is skew. The first fixture a reader can reproduce on paper is a planar 2R chain with link lengths 0.4 m and 0.3 m, joint angles 0 and π/2, axes along +z. The tool point is (0.4, 0.3) m and the translational Jacobian is J = [[−0.3, −0.3], [0.4, 0.0]] m/rad. A tool force (10, 0) N gives both joint torques −3 N·m; joint rates (0.2, −0.1) rad/s give tool velocity (−0.03, 0.08) m/s; both power computations give −0.3 W. For a space screw column (ωᵢ, vᵢ) the point-velocity column at p is vᵢ + ωᵢ × p; the space Jacobian pairs with the wrench (p × F, F) about the origin and the point Jacobian pairs with F. Counterexample: taking the lower three rows of the space Jacobian as the point Jacobian fails this fixture. The same part graph is compiled to a symbolic expression, a CPU operator and a device kernel, and all three reproduce the fixture.
  • Tier. S.

C-05 Time stepping stays on the group

  • Object. An update is g₊ = g · τ(h ξ) for a retraction τ from the algebra to the group. Two retractions are supported: the exponential, and the Cayley map cay(x) = (I − x/2)⁻¹(I + x/2), which is rational and lands exactly on SO(3) and SE(3). On SE(3), cay(ω, v) has rotation cay(ω̂) and translation (I − ω̂/2)⁻¹v. The structure-preserving lane uses a discrete Lagrangian on the group; for a free rigid body, and for a rigid body in a potential, its discrete Euler–Poincaré equations conserve exactly the discrete momentum map of every symmetry the potential keeps, which is all of it for a free body (discrete Noether) and the step is symplectic and time-reversible. C-36 gives the step as an algorithm.
  • Replaces. Adding a quaternion increment and renormalizing; Runge–Kutta on Euler angles.
  • Payoff. In exact arithmetic the update is group-valued, so the only thing left to remove is round-off: one normalization per step by a correctly rounded square root, a correction of order 10⁻⁷ in single precision instead of the order-h² projection that an additive update needs. The Cayley update uses only +, −, ×, ÷ and √, which IEEE 754 requires to be correctly rounded, so it is a candidate for bit-identical execution on CPU, CUDA and Metal (HYPOTHESIS; GATE-SPARK-01). A rational update is an object a polynomial identity checker can certify (T-01, T-02). Bounded energy error makes cost of transport trustworthy over long rollouts.
  • Honest limits. Cayley is second-order: it rotates by 2·atan(|ω|h/2) instead of |ω|h (GB-01), so its use is bounded by |ω|h ≤ 0.2 per substep and refused beyond (FROB-REF-212). The default rollout integrator is semi-implicit Euler with implicit joint damping and a group update; the articulated variational integrator is Frontier. Group membership and symplecticity are separate properties with separate tests. No symplectic or energy claim is made for an articulated tree, whose mass matrix depends on configuration, and the property is moot once dissipative contact impulses enter. A conservation claim names the quantity, the symmetry, the boundary conditions, the integrator and the tolerance. The exponential lane evaluates sin θ/θ, (1 − cos θ)/θ² and (θ − sin θ)/θ³ by branch-free polynomials below a declared small-angle threshold, in the referee only.
  • Foundations. fs-time has a discrete Euler–Poincaré step on SE(3) with dep_momentum_adjoint and a RATTLE projection hook. fs-mbd stepping is a second-order Lie midpoint step that its contract calls "neither an energy-exact nor a variational/symplectic integrator".
  • Test. Group-membership residual stays within four units in the last place over 10⁷ steps with the per-step normalization on, and grows no faster than a random walk with it off; momentum conservation in free flight; bounded energy error; measured order by step halving.
  • Pilot and ceiling. For the variational lane: the pilot, kill and ceiling of C-36.
  • Tier. S for retractions and the semi-implicit lane; F for the articulated variational lane.

C-06 Contact is a cone program in the dual algebra

  • Object. At a contact frame the impulse γ = (γₙ, γₜ) lies in the friction cone 𝒦_μ = {‖γₜ‖ ≤ μ·γₙ}, with Signorini complementarity along the normal and maximal dissipation in the tangent plane. 𝒦_μ is a linear image of the second-order cone, which is the cone of squares of a spin-factor Jordan algebra. The nonnegative orthant (joint limits) and the positive-semidefinite cone (C-03, SOS certificates) are the other symmetric cones that occur. The fast tiers solve a convex, compliant problem in generalized velocities: v = argmin ½·(v − v*)ᵀA(v − v*) + Σ_c ℓ_c(J_c v), where minus the gradient of the convex potential ℓ_c is the contact impulse. The referee tier solves non-associated Coulomb friction with exact complementarity; its written specification is the hard-contact law, a nonlinear complementarity problem and not one convex program, which is also offered as an optional batch law F. C-37 extends the cone with a spin component and adds joint-level rows.
  • Replaces. Projected Gauss–Seidel with softness knobs that have no physical meaning.
  • Payoff. One Cone abstraction (Jordan product, spectral decomposition, projection, barrier) serves contact, joint limits, the control programs of §22 and the certificates of §12. The fast solve is strictly convex, so it has one solution and its gradient norm bounds the distance to it: solver error is a recorded number per step. Parameters are physical (stiffness, dissipation time, friction coefficient). The known artifacts of the convex model (bounded creep of a stuck contact, energy stored in compliance) are named and measured against the referee in the fidelity ledger. On a fixed active set the converged factor is reused for sensitivity and counterfactual right-hand sides F; each column carries the bound ‖x̂ − x*‖ ≤ (‖b − A·x̂‖ + ρ)/λ, with ρ the rounding margin of the computed residual (§18.19) and λ a lower bound on the smallest eigenvalue, and a guard that reroutes any column crossing a stick, slip or open boundary to the full solve.
  • Honest limits. A design ranking that reverses between the compliant law and the hard-contact law is reported as a fidelity-dependent ranking and cannot be promoted (§28). A pyramid approximation of the cone is not used: the box |γₜ₁| ≤ μγₙ, |γₜ₂| ≤ μγₙ admits (μγₙ, μγₙ), of norm √2·μγₙ, which is 41% of traction that does not exist along the diagonals.
  • Foundations. fs-contact::frictional_multicontact::solve_frictional_contacts (simultaneous Signorini–Coulomb by semismooth Newton–Krylov, MAX_CONTACTS = 21 in fs-contact/src/sustained/solve.rs, an event solve without persistent time stepping); elliptic friction; Hertz, Hunt–Crossley and JKR normal laws; fs-tribo friction laws. FrankenSim's persistent stepper lanes (Moreau–Jean, IPC) are open beads without code. The sustained contact step is reported to assume a fixed witness (FACT to recheck; an admission test and an upstream work item, §33).
  • Test. The known answers of §18; Hessian positive semidefinite by construction (T-08); projection identities (T-07); the planted pyramid-cone exploit above is caught by the model-form check.
  • Pilot and ceiling. For the hard-contact batch law and factor reuse: the known answers of §18 and one 21-contact stack on batch-cpu. Falsifier (TARGET): a residual above the declared tolerance at a fixed iteration budget on more than 1% of contact islands, in which case the law stays the referee's specification and is not offered in batch. Ceiling: fidelity for the law; for factor reuse, the solve share of a counterfactual burst.
  • Tier. S for the convex compliant model; F for pressure-field patches, barrier contact, the hard-contact batch law and factor reuse.

C-07 Wheels are a distribution, and maneuvering is a Lie bracket

  • Object. Rolling constraints are Pfaffian, A(q)·q̇ = 0, and define a distribution 𝒟 = ker A. The flag 𝒟 ⊂ 𝒟 + [𝒟, 𝒟] ⊂ … has a growth vector that decides controllability (Chow–Rashevskii) and cost: a direction first reached at bracket depth w needs path length of order ε^(1/w) to move a distance ε (ball-box theorem).
  • Replaces. Folklore about which bases can do what.
  • Payoff. A static maneuverability index for a wheeled base in tight interiors (A-07, GB-05). Bracket motion primitives for planners. For kinematic bases, the base motion follows from wheel motion with no dynamics at all. Ideal rolling is also the known-answer oracle for the frictional wheel contact that the simulator runs by default. A defect such as a mecanum base with misaligned rollers is a rank drop in the constraint distribution, which the growth vector reports; the curvature test of C-08 does not detect it and is not used for it.
  • Honest limits. A bracket direction is infinitesimal and assumes reversible inputs: with ẋ = u ∈ [0, 1] the rank is one and negative x is still unreachable from zero, so a finite mission needs an integrated witness. Ideal rolling is a regime: a four-wheel fixed-axis base with axles at ±a satisfies lateral no-slip only if v_y + a·ω = 0 and v_y − a·ω = 0, which forces ω = 0, so its yaw exists only under a separately qualified slip model.
  • Foundations. fs-mbd::planar_drive is SE(2) differential-drive kinematics with "no force, traction, slip"; FrankenSim's nonholonomic lane is proposed, not built. FrankenSymPy's diff on scalar expressions exists, so brackets of vector fields can be computed symbolically today. planar_drive is reported to have a near-straight integration defect (FACT to recheck): from heading 32 rad with wheel speeds 1 and 1 + 6·10⁻¹³ m/s on a 0.5 m track, 400 steps of 1/400 s return zero translation where the limit is about (0.8342, 0.5514) m. It becomes an admission test and an upstream work item (§33).
  • Test. Growth vectors: differential drive (2, 3); car-like with steering (2, 3, 4); car with one trailer (2, 3, 4, 5); ideal omnidirectional base (3). Rolling disk and Chaplygin sleigh trajectories. Independent pose formula for a constant-twist step: Δp = v·Δt·sinc(δ/2)·(cos(θ + δ/2), sin(θ + δ/2)) with δ = ω·Δt and sinc(0) = 1; a unit-speed half turn through +π in one second gives the chord (0, 2/π) m. Exact straight travel, near-zero curvature, wrapped and unwrapped headings, and incremental against one-shot integration agree.
  • Retired when. The drive slips outside the ideal-rolling regime: the kinematic prediction is withdrawn for that operating region and the frictional model answers.
  • Pilot and ceiling. For the index and primitives: four reference bases in three doorway scenes, index against measured wheel travel (GB-05). Falsifier: the index ranks the bases differently from measured cost. Ceiling: a static screen for wheeled bases. Fallback: the growth vector and a turning-footprint check.
  • Tier. S for the growth vector; F for the index and primitives.

C-08 Locomotion is holonomy

  • Object. Q → Q/G is a principal bundle over shape space. A connection 𝔸 splits motion into shape change and group motion: ξ = −𝔸(s)·ṡ + 𝕀(s)⁻¹·p, with 𝔸 = 𝕀⁻¹·𝕀_BS from the block form of the kinetic energy, or from the Pfaffian constraints W_g·ξ + W_s·ṡ = 0 when rank W_g = dim G. For a closed loop in shape space (one gait cycle) the net displacement is the holonomy, the right-ordered path exponential of −∮𝔸·ds, which to leading order is minus the integral of the curvature D𝔸 over the enclosed surface. The component formula and its sign are fixed in §11.6.
  • Replaces. Trial-and-error gait search for kinematic locomotors.
  • Payoff. A design oracle with no rollouts: curvature integrated over reachable shape space estimates, to leading order in loop size, the displacement per cycle, so two morphologies can be ranked before simulation (A-09). With zero angular momentum the same formula gives the reorientation a robot achieves in flight by cycling limbs or a tail. Read as an inverse query, it asks for the least costly periodic shape change that gives a specified displacement with zero net yaw, and a wheel or foot arrangement that changes the constraint distribution is a body edit in the same search.
  • Honest scope. Exact for principally kinematic systems (kinematic wheeled bases, snake-like crawlers, zero-momentum free flight). For dynamic walking it is a diagnostic, not a predictor. Curvature computed in poor coordinates misleads; the minimum-perturbation coordinates of Hatton and Choset are required. A connection belongs to one contact stratum: a loop in shape space that crosses slip or lift-off cannot borrow its old connection, and each stance stratum of a legged robot has its own with switching maps between them.
  • Foundations. None in the siblings. Derivatives of 𝔸(s) come from fs-ad forward duals.
  • Test. Elroy's beanie: two coaxial bodies with inertias I₁, I₂ and zero momentum; a relative rotation Δψ rotates body 1 by −I₂/(I₁ + I₂)·Δψ. A planar three-link floating body: net rotation per cycle against direct integration, with the loop doubled, reversed and sped up until the approximation breaks. Sign control: the component formula with the bracket term's sign flipped must fail the same loop by an error of order one. Chart control: the same physical gait reconstructed in another body frame predicts the same motion.
  • Pilot and ceiling. Pilot: the three-link body and one wheeled-snake fixture on the CPU, compared with direct collocation on cycles per metre and actuator cost. A shape-space atlas is funded only after an independent full rollout admits at least one newly proposed gait and a changed-contact test withdraws a formerly valid one. Falsifier: held-out loop ranking or drift error outside its budget. Ceiling: it replaces gait search for kinematic locomotors only. Fallback: direct collocation over the same loops.
  • Tier. F.

C-09 A morphology has two symmetry groups

  • Object. Two nested finite groups are computed for every pair of a design and a task, and both are stored with it. The mechanical group Γ_mech is the set of automorphisms of the labeled kinematic tree that are realized by an isometry of the body and preserve link lengths, pseudo-inertias, joint screws, actuator cards, gear ratios and gear directions. The observation-preserving group Γ_obs ≤ Γ_mech is the subgroup that also preserves every sensor pose and field of view, the payload, the task goal and its orientation, gravity, and the terrain and guard structure the task declares. Candidate automorphisms are found by colouring the part graph (part type, side-specific limits, gear direction, material), and each generator is then checked on transforms, inertias and channels. Under an isometry with orthogonal part P, polar vectors (positions, linear velocities, forces) map by P and axial vectors (angular velocities, torques, angular momenta) map by det(P)·P (§11.4), so a mirrored limb can need a sign change at its encoder. The representations ρ on configuration, velocity, action and observation spaces are signed permutations computed from that rule, not tables. The dynamics are equivariant under Γ_mech when gravity and terrain are transformed with the robot, and under the elements that fix them otherwise: f(ρ_X(g)·x, ρ_U(g)·u) = ρ_X(g)·f(x, u). Each representation splits into isotypic components, and the Reynolds operator W ↦ |Γ|⁻¹·Σ_g ρ_out(g)·W·ρ_in(g)⁻¹ projects any linear map onto the equivariant ones exactly. The real irreducible representations of the groups that occur (cyclic, dihedral, their products and wreath products) are of real type or of complex type. A real-type block is a scalar. A complex-type pair, which appears for Cₙ with n ≥ 3 when no mirror is present, is parameterized by 2×2 blocks [[a, −b], [b, a]], which is cheaper than averaging and equal to it. No symmetry group of a robot in this plan has an irreducible of quaternionic type, and none is implemented. Typical groups: C₂ for a biped; C₂ × C₂ for a quadruped built symmetric fore-aft and left-right; a dihedral group for a radially symmetric hexapod. A quadruped with a front-only lidar has Γ_mech = C₂ × C₂ and Γ_obs = C₂.

  • Replaces. Hand-written mirror functions with sign tables per robot.

  • Payoff. Both groups are computed from the design (A-03); a symmetry declared by an author is an assertion to check. There are three uses, with three different preconditions.

    1. Metamorphic tests. One test of the entire simulator per generator of Γ_mech, applied to robot, terrain, gravity and sensors together.
    2. Distributional augmentation. A transformed trajectory is added to training data whenever the transformation preserves the distribution of worlds and tasks. It may pair two different worlds.
    3. Exact reduction. Invariant critics inside one world, orbit deduplication (C-22), closed-loop block-diagonal linearizations and gait orbits (C-10) use only Γ_obs, intersected with the stabilizers of the current payload, boundary conditions and contact mode. Weight tying needs Γ_obs and invariance in law of the world and command distributions; block-diagonal mass and stiffness matrices need only Γ_mech ∩ Stab(configuration) (§13.4). Reduction inside one world needs invariance of that world.

    Observations declared invariant under world yaw and horizontal translation define a quotient decision process, and a metamorphic test checks that declaration against the full state including terrain. Design constructors mirror and radial produce symmetric designs with known generators.

  • Honest limits. A linearized operator that commutes with the action preserves the isotypic blocks; an equivariant nonlinear map need not decouple into independent nonlinear blocks. Hard equivariance is not free: FACT (source register, to be re-read) is that augmentation makes an ordinary network about as data-efficient as an equivariant one, and that hard constraints are more fragile under distribution shift. A deterministic equivariant policy cannot choose between symmetric alternatives, so a failure of tied-policy search excludes only the tied policy class. A quadruped crossing a one-sided slippery patch must be allowed asymmetric actions.

  • Foundations. FrankenSymPy has no group theory in Rust; FrankenLean's re-check accepted none of Mathlib's 43 representation-theory modules; fs-symmetry is about 480 lines covering cyclic groups. The groups here have at most a few dozen elements, so closure, conjugacy classes, characters and projectors are built in frob-algebra.

  • Test. Step equivariance to round-off for every generator of Γ_mech (T-10); character orthogonality; idempotent projectors; ρ(g)·M(q)·ρ(g)ᵀ = M(ρ(g)·q). Parity: under the sagittal mirror P = diag(1, −1, 1) the axial image of a joint axis a is −P·a, so a pitch axis along y keeps its sign and roll and yaw axes change theirs; a table that flips all three, or none, fails the step-equivariance test. Two latches: two identical latches of which exactly one must close. At a reflection-fixed observation a deterministic policy tied by the reflection issues equal commands, and both equal commands fail; either asymmetric choice succeeds, and a policy that draws one of the two uniformly is equivariant in law. The test asserts that the studio reports the tied deterministic class as excluded and nothing more. Broken symmetry: adding a one-sided payload removes the reflection from Γ_obs, and the reduced calculation is replaced by the full one without an author's edit.

  • Retired when. A physical or sensing asymmetry leaves Γ_obs trivial for a design and task; tying is then off and augmentation alone remains.

  • Pilot and ceiling. For equivariant networks: three arms on one quadruped family, namely a policy equivariant under Γ_obs conditioned on transformed terrain, an augmented ordinary policy, and an unaugmented baseline, ranked separately on sample efficiency, compute and out-of-distribution return. Falsifier: the equivariant arm does not beat the augmented arm beyond seed spread. Ceiling: a factor |Γ_obs| in data, of which augmentation already collects most. Fallback: augmentation alone.

  • Tier. S for detection of both groups, augmentation and metamorphic tests; F for equivariant networks under Γ_obs.

C-10 Gaits are subgroups, and their timing is max-plus linear

  • Object. A periodic gait of a symmetric system has a group H of spatio-temporal symmetries (elements that map the orbit to itself up to a phase shift) and a normal subgroup K of purely spatial symmetries; H/K is cyclic (Buono and Golubitsky). The ambient group is the leg-permutation part of Γ_obs, intersected with the isotropy subgroup of the commanded velocity. That group is small: a quadruped commanded forward keeps only the left-right mirror C₂, under which trot, pace and walk share the pair (C₂, 1) and bound and pronk share (C₂, C₂). The six primary gaits are separated only by the symmetry group of a declared leg-clock network, ℤ₄ × ℤ₂ for the eight-cell quadruped network of Golubitsky et al.; that group contains permutations that no isometry of the body realizes, so it is a declared symmetry of the controller's coupling and not a subgroup of Γ_obs. Under ℤ₄ × ℤ₂ trot, pace, bound, walk, pronk and the jump are distinct (H, K) pairs with prescribed phase lags. A footfall schedule is a max-plus linear system x(k+1) = A ⊗ x(k) whose eigenvalue is the stride period and whose eigenvector gives the steady phase offsets (Lopes et al.).
  • Replaces. Hand-tuned phase-offset tables per robot.
  • Payoff. A gait atlas (A-04): every (H, K) pair of the design's leg-permutation group, with phase relations, each usable as a clock for the baseline controller and as a reference for reward shaping. Periodic-orbit search restricted to symmetric trajectories has lower dimension: shooting on [0, T/m] inside Fix(K) with the twisted boundary condition x(T/m) = h·x(0). Max-plus synthesis gives schedules with a guaranteed steady state and a bound on transition time between gaits. Orbits continued in design parameters give a screening signal and a warm start (C-16).
  • Honest limits. The enumeration lists admissible symmetry types, not realized gaits. An orbit computed inside Fix(K) can hide unstable multipliers transverse to it, so the monodromy is always computed on the full space. Trot, bound and pronk have simultaneous touchdowns by construction; simultaneity is handled by a coupled solve and is never a reason to refuse a gait (C-16). FACT (source register, to be re-read): published full-order orbit solves take about 4 to 260 s of CPU at 20 to 68 states, so an orbit is a screening signal for periodic gaits on regular ground and not a referee-ready controller.
  • Foundations. fs-tropical has max_cycle_mean and critical_circuit; fs-spectral::floquet analyses a supplied monodromy, including non-normal transient growth. Nothing else.
  • Test. With the ℤ₄ × ℤ₂ clock-network group declared, the quadruped atlas recovers the primary gaits reported by Golubitsky et al. (1999); with the body group C₂ alone it returns the pairs (C₂, C₂), (C₂, 1) and (1, 1) and reports trot, pace and walk as one class; the max-plus eigenvalue of a trot schedule equals the stride period computed by hand. The enumeration of (H, K) pairs is decided exhaustively on the subgroup lattice (T-25).
  • Pilot and ceiling. Pilot: trot and bound orbits of one quadruped under the synthesized baseline controller of §22, continued in one design parameter, with the full-space multipliers. Falsifier: orbit ranking of ten design variants disagrees with rollout ranking at Kendall τ below 0.5 (TARGET). Ceiling: the cost of one orbit is between about 1% and 63% of a 410 s quadruped training run (4 s and 260 s; FACT, source register), so the atlas replaces training only as a screen. Fallback: the atlas as phase patterns and controller clocks, without orbits.
  • Tier. F.

C-11 Kinematics is algebraic geometry

  • Object. Forward kinematics is a product of exponentials, a polynomial map in (cᵢ, sᵢ) with cᵢ² + sᵢ² = 1. Inverse-kinematics solution sets, workspace boundaries and singular loci are therefore real algebraic varieties, and SE(3) embeds as the Study quadric through dual quaternions.
  • Replaces. Numerical IK with no statement of how many solutions exist.
  • Payoff. Closed-form IK for three-joint legs, derived once by elimination and emitted as a kernel. Certified IK: all solutions in a box with existence and uniqueness certificates by interval Newton. Singular loci det J = 0 for leg Jacobians, giving singularity-free workspace volume and distance-to-singularity along a nominal gait (A-06). Linkage synthesis is the same algebra read as a design problem (C-34).
  • Honest limits. FrankenSymPy has Buchberger with a cap of 1,024 basis polynomials, no F4, and univariate resultants only, so general 6R inverse kinematics is not promised. Its real solver real_rur is capped at 8 variables, 64 equations, degree 256 and 4,096-bit coefficients and handles zero-dimensional ideals only. It has no homotopy solver.
  • Foundations. FrankenSymPy fsym-polys (Gröbner over ℚ with certificates, elimination, real RUR), CertifyRootBox (at most 16 coordinates); fs-ivl Krawczyk; fs-ga PGA motors as dual quaternions.
  • Test. A spatial 3R positioning chain has up to four IK solutions; the certified solver finds exactly the solutions the closed form gives.
  • Pilot and ceiling. For certified IK: the 3R chain and one six-joint leg inside the caps. Falsifier: a missed or a spurious solution against the closed form. Ceiling: problems inside the caps above. Fallback: numerical IK with multistart, labeled incomplete. The M part is piloted with C-34.
  • Tier. S for product-of-exponentials and leg IK; F for certified IK; M for Study-quadric synthesis.

C-12 A robot is a composition over typed ports

  • Object. Components expose typed ports: a mechanical port carries a twist and a wrench at a frame, a shaft port carries (ω, τ), an electrical port (V, I), a thermal port (T, Q̇), a signal port a typed message with a rate and a latency bound. Interconnection is power-conserving (a Dirac structure): the port powers of a composition sum to zero, and an algebraic loop is refused. Designs are terms of an operad of wiring diagrams, and five functors give them meaning: kinematic (to the frame groupoid), dynamic (to port-Hamiltonian components), geometric (to collision Regions), budget (to monotone maps between resource and functionality posets), and symmetry (to groups). A design with feedback, such as heavier actuators needing more torque, is a least fixed point found by Kleene iteration (Censi's monotone co-design). A reusable subassembly is a module file (.fmodule) referenced by content hash, carrying its port signature, its local inertia and passivity results, and a boundary descriptor.
  • Replaces. A monolithic XML file plus a sizing spreadsheet.
  • Payoff. Editing a subterm recomputes only that subterm's meanings, by content-addressed memoization. "Does the design close?" is answered before simulation with either the minimal mass and power or a proof of infeasibility (A-10, GB-03). The energy ledger of §29 is the port structure read at run time. Gears are transformers and motors are gyrators, which is standard bond-graph algebra.
  • Honest limits. Reuse across an edit is licensed by an implication, not by a matching hash (D-11). Swapping a leaf keeps its siblings' local results. An edit that touches a shared battery bus, a shared thermal sink, a cross-branch kinematic loop or base-coupled contact invalidates every global result, because a shared moving base couples all limbs through the contact operator. A port contract must carry time correlation: two fingers on one unit-current bus have identical local summaries, and a rule that adds their peak demands rejects a task that a two-tick schedule completes (FACT, planning pilot, to be re-run: no one-tick schedule and two two-tick schedules are feasible). The budget functor applies in the monotone fragment only; where a change of gearing trades a larger static moment for a blocked swing or a new contact mode, the alternatives stay in separate cells or the original mechanics are dispatched.
  • Foundations. fs_ports::component::Component (contract v0, not frozen) with ports(), class(), stored_energy_j(); fs-system::SystemBuilder; fs-mbd already wraps a rigid body as a Component; fs-phs::interconnect_mapped exists, constrained Dirac structures are deferred there and no passivity proof generator exists; FrankenSim's operating rule since 2026-11-09 is "Compose, do not enumerate".
  • Test. Each functor commutes with composition (property test). The energy balance closes every step: supplied = stored change + dissipated + exported, to tolerance. Kleene iteration matches the closed form of GB-03. The rational gear law holds as an identity (T-15). Invalidation controls: a mirror swap of a leaf must reuse its siblings' results, an edit to the shared bus must invalidate, a reversed port sign must be refused, and the two-finger bus fixture must not be pruned.
  • Pilot and ceiling. A 64-edit sequence over one modular quadruped, counting recomputed sub-terms per edit and running the four invalidation controls. Falsifier: one stale result after an edit. Ceiling: time from an edit to its derived meanings, a small share of a design loop once a replay takes seconds. Fallback: whole-model recompilation on every edit.
  • Tier. F, deliberately thin: one data structure and five functors, not a framework.

C-13 Estimation and control live on groups

  • Object. The floating-base state (rotation, velocity, position) is an element of SE₂(3), extended by contact points to SE₂₊ₖ(3). IMU dynamics are group-affine, so the invariant error obeys an exactly linear equation and the invariant extended Kalman filter applies (Barrau and Bonnabel; Hartley et al.). Control errors are group errors g_d⁻¹·g and their logarithms. Centroidal model-predictive control is a program over contact wrenches in the cones of C-06 subject to the reduced equation of C-04. Whole-body control is an inverse-dynamics program over the same cones. Flat wheeled bases are tracked through their flat outputs.
  • Replaces. Euler-angle PD loops and estimators that become inconsistent.
  • Payoff. Every design receives an estimator and a baseline controller synthesized from its model (GOAL-13). Policies can be evaluated on estimated state instead of privileged state. The control programs reuse the cone solver of C-06, so one kernel family serves physics and control. When a requested task wrench lies outside a body's attainable set, the same solver returns a separating dual witness before any training (C-32).
  • Honest limits. With biases, delays and uncertain contact the error equation is no longer state-independent; the filter is labeled imperfect-invariant and its log-linearity is evaluated, not assumed. Position and yaw are gauge freedoms under proprioception and gravity (C-20). Barrier and sum-of-squares certificates are available for reduced-order templates only; none is claimed for full-order dynamics (C-31).
  • Foundations. fs-control is motor current and speed control only (about 2.6k lines); fs-ga::lie_opt has geodesic means and se3_optimize; model-predictive synthesis in FrankenSim is proposed, not built.
  • Test. Filter consistency (normalized estimation error squared inside χ² bounds); geometric PD convergence from attitude errors near π; KKT residuals of every control program. Scoring gauge: a metric gravity-referenced estimate is aligned with one translation and one yaw per trajectory and never with a fitted scale, because a 2 m estimate of a 1 m motion has zero residual after a factor of ½.
  • Pilot and ceiling. For synthesis across morphologies: the reference robots of Appendix G under the three-outcome report of §22. Falsifier: the baseline-controller bet of §4 fails its gate. Ceiling: a baseline for screening and for day-one feedback, never the evaluator of record. Fallback: the three-outcome report says not-synthesizable and the design waits for a learned or sampling controller.
  • Tier. S for geometric PD and the invariant filter; F for controller synthesis across morphologies and for reduced-order barrier certificates.

C-14 Kernels are derived, typed by dimension, and carry certificates

  • Object. A kernel's arithmetic is a straight-line program (SLP) over +, −, ×, ÷, √ and selects, generated from symbolic expressions with common-subexpression elimination. Loops with constant bounds live in the skeleton around it. Every value carries its physical dimension as an exponent vector over fs-qty's base dimensions, and a program type-checks only if every sum is homogeneous: physical quantities form a graded algebra and the kernel respects the grading. Derivative programs (a forward product J·v and a transposed product Jᵀ·w) come from automatic differentiation of the SLP. Identities the kernel must satisfy are polynomial identities, checked by FrankenSymPy's proof kernel and bound to the kernel's content hash. A rewrite of an SLP belongs to one of two classes. Class E changes no bit under round-to-nearest with contraction off: commutation, common-subexpression and dead-code elimination, scaling by a power of two, scheduling. Class R is equal over the reals only: reassociation, distribution, fused multiply-add. A class-E rewrite ships a rule trace that an independent checker replays (T-27); a class-R rewrite makes a different kernel with a new identity, an error bound and a fidelity run.
  • Replaces. Hand-written kernels with hand-written derivatives in three languages.
  • Payoff. The same arithmetic on three backends; adjoints for smooth kernels without extra work; no dimension errors; certificates that travel with the code. Each kernel records its register and stack pressure, its rewrite fuel and its expression size, and derivation is capped on all of them.
  • Honest limits. Derivation is kept for correctness, certificates and CPU derivative kernels. As a GPU throughput lever it is not claimed: FACT (source register, to be re-read) is that the Lie-algebraic recursions are about 16 to 20% of an incumbent's step, which caps specialization near 1.2×, so per-design specialization is for survivors only and only if this project's own profile shows a larger share (§21). No sine, cosine or fused multiply-add appears in a batched kernel (§35).
  • Foundations. FrankenSymPy has Expr, fsym_calculus::diff, Matrix::jacobian, simplify, a proof kernel with Claim::AlgebraicIdentity and a PolynomialNormalForm rule, and an offline verifier (fsym-capsule-consumer). It has no multi-output code generation with CSE and no GPU emitters; its bytecode interpreter caps an expression at 8,192 operations. FrankenRobotics therefore owns the SLP representation and its emitters (frob-kir) and uses FrankenSymPy at build time as the derivation engine and certificate checker.
  • Test. Emitted Rust against FrankenSymPy's own evaluation and against fs-ad dual numbers; emitted GPU source against emitted Rust on each backend (GATE-SPARK-02). Adjoint duality for every derivative pair: ⟨J·v, w⟩ = ⟨v, Jᵀ·w⟩ on random v and w. Rewrite control: in f32 with a = 10⁸, b = −10⁸, c = 1, (a + b) + c is 1 and a + (b + c) is 0, so a reassociation filed as class E must be rejected by the trace checker.
  • Pilot and ceiling. The M0 kernels (the Cayley update, the adjoint, one recursion step for one body) derived, emitted on three backends and certified. Falsifier: the trigger of KILL-KIR. Ceiling: correctness, derivatives and certificates; as throughput, about 1.2× at most on the figure above. Fallback: that of KILL-KIR.
  • Tier. F.

C-15 Evidence is a test martingale

  • Object. Comparing designs A and B on paired episodes with common random numbers yields differences dᵢ. A betting e-process Eₙ = ∏ᵢ (1 + λᵢ·d̃ᵢ) is a nonnegative supermartingale under the null hypothesis that B is no better, so by Ville's inequality the chance it ever exceeds 1/α is at most α. The comparison can stop at any time. Predictions an agent registers before a run are scored with proper scoring rules. Two study types are declared and never mixed inside one study (§24). An anytime-valid study uses an e-process. A fixed-n study uses an exact test at a sample size chosen in advance, and ships a pre-analysis listing which verdicts are reachable at that n (T-26). For one bit per paired episode (does the disagreement exceed a frozen envelope?), a pair of one-sided e-processes compiles to an integer table (n, k) → promote, reject or continue, with ln E = (n − k)·ln((1 − p₀)/(1 − p₁)) + k·ln(p₀/p₁) for the promoting side. Repeated confirmation requests spend α as αᵢ = α/[i·(i + 1)] for the i-th request, a series that sums to α.
  • Replaces. "Mean reward over five seeds."
  • Payoff. Fewer episodes when the answer is clear, a valid error rate when the agent peeks, and cancellation of the losing arm the moment it loses (§28, GB-06). Error control survives an agent's adaptive retries.
  • Honest limits. Pairing by world address shares seeds. It does not make two robots that take different paths meet the same friction at the same tick; shared inputs are compiled at physical coordinates (C-40). Paired statistics are refused under an uncontrolled determinism class (§35). Time-uniform inference and a sealed fixed-n decision are different procedures, and neither substitutes for the other.
  • Foundations. fs-race and fs-eproc exist in FrankenSim; counter-based random streams keyed by logical identity exist in fs-rand.
  • Test. Empirical type-I error under the null at or below α over 10⁴ simulated comparisons with optional stopping. Table check: with p₀ = 0.05, p₁ = 0.30 and α = 0.01 a clean pair multiplies the evidence by 0.95/0.70 and an exceedance divides it by 6, so promotion needs 16 clean pairs, or 22 pairs with one exceedance. Reachability check: under a two-sided 97.5% exact Clopper–Pearson rule (the level of §24.10) at n = 64 with a ±5 point indifference band, perfect concordance gives the interval [−0.0662, +0.0662], so no outcome can return a tie; a study that needs that verdict is refused at admission.
  • Tier. S.

C-16 A gait is a hybrid orbit: saltation, return maps, labeled derivatives

  • Object. A hybrid automaton has modes m, each with a domain D_m (a stratum of the state space), a smooth flow ẋ = f_m(x), guards g_e and resets R_e on its outgoing edges e. A mode is a set of active inequalities and bilateral constraints with a stick or slip label per contact and the protection state of each drive. Events are touchdown and liftoff, stick to slip and back, joint-limit impact, wheel–leg deployment and electrical protection, and each is keyed by stable geometry and clock identity. Events that are simultaneous are resolved by one coupled solve, because forcing an order can change the outgoing velocity and a gait's basin. For an isolated event with transverse crossing, first-order perturbations cross it through the saltation matrix

    Ξ_e = D_x R + (f⁺ − D_x R·f⁻ − D_t R)·(D_x g) / (D_t g + D_x g·f⁻)
    

    where f⁻ and f⁺ are the flows before and after, D_x g is a row vector and the denominator is the transversality number. The event time moves by δt = −(D_x g·δx)/(D_t g + D_x g·f⁻). A periodic gait is a fixed point of the return map P on a Poincaré section placed at a repeatable transverse event. Its derivative is the product of flow tangent maps and saltation matrices over one cycle, restricted to the section, with phase and the group drift of a relative periodic orbit removed: for x(T) = h·x(0) the monodromy is D(h⁻¹)·DΦ_T. The Floquet multipliers are the eigenvalues of DP. On the throughput tiers contact is compliant, the step map is continuous and piecewise differentiable, and the monodromy is the product of step Jacobians with no saltation matrix. Every derivative that leaves a kernel or an analysis carries one label:

    Label Meaning Carries
    smooth No event in the interval; chart regular Chart identity
    saltation Isolated transverse events composed by Ξ Event identities, guard margins, transversality numbers
    discrete-step Derivative of the time-stepping map with the active set unchanged in each step Count of active-set changes
    fixed-mode Mode sequence held fixed by fiat; a conditional derivative The frozen sequence
    one-sided Directional derivative on one side of a guard Side and direction
    generalized One selection of a piecewise-smooth map Number of selections and which one
    smoothed Derivative of a declared smoothed surrogate Smoothing parameter
    finite-difference Central difference with events re-located on both sides Step size, events matched
    refused No derivative is returned Offending state and perturbation directions

    A query is refused (FROB-REF-263) when the transversality number, normalized by the guard's declared scale and the model's time scale, is below a threshold (grazing); when two events not tied by a symmetry of the nominal state fall within the event-time resolution of each other; when the active set changes under the requested perturbation; or at frictional degeneracy. Simultaneous events that are tied by a symmetry, as in a trot, are not refused: the derivative is ordinary on the symmetric subspace and generalized off it. A symmetry h is used across an event only where the relabeling of states, contacts and parameters satisfies the commuting identity D h(x⁺)·Ξ_e(x⁻) = Ξ_{h·e}(h·x⁻)·D h(x⁻).

  • Replaces. Gradients through contact taken on faith; gait stability judged by watching a rollout.

  • Payoff. Local orbital stability of a gait as numbers with intervals; design gradients of a periodic orbit by solving the adjoint equation (I − D_x P)ᵀλ = ∇_x J at the fixed point, which is the implicit-function theorem and costs one linear solve per objective; a derivative an optimizer can trust because it says when it cannot be trusted. A change in the symmetry of an event pattern can itself locate the decision boundary an engineer needs to inspect.

  • Honest limits. Multipliers probe local stability only: a stable orbit on a treadmill says nothing about recovery on a staircase, and the recovery basin is tested with finite disturbances. A non-normal monodromy can amplify a perturbation before it decays, so the transient growth is reported beside the spectral radius. A passing commuting check transports a local derivative to a corresponding event; reducing one nominal trajectory into symmetry blocks needs a symmetry that fixes its state, history, parameters and event. A sliding impact and its mirror can satisfy the identity while a normal-speed perturbation changes tangential speed; that cross term stays in the full derivative.

  • Foundations. fs-time has hybrid event location with a transverse, grazing or unresolved crossing classification (hybrid.rs) and event-time sensitivities for a transverse guard (hybrid_sensitivity.rs); fs-spectral::floquet analyses a supplied monodromy. No sibling composes them into a return map.

  • Test. Bouncing ball with restitution r: state (y, v), flow (v, −g), guard y = 0, reset (y, −r·v), impact speed v⁻ < 0. The formula gives Ξ = [[−r, 0], [−(1 + r)·g/v⁻, −r]], with determinant r². Counterexample: using the reset Jacobian diag(1, −r) as the event derivative gets the sign of the first entry wrong, omits the coupling in the second row, and for r = 1 has determinant −1 where the elastic bounce preserves area with determinant +1. Rimless wheel with spoke half-angle α on a slope γ: the return map on the post-impact rate is ω₊² ↦ cos²(2α)·(ω₊² + (4g/ℓ)·sin α·sin γ), so the multiplier is cos²(2α), exactly ½ for eight spokes. Commuting identity: two bouncing balls and the swap of their labels satisfy it when the restitutions are equal and violate it by terms proportional to r_L − r_R when they differ, which is the negative control. Grazing: a ball whose apex touches a ceiling returns refused, not a matrix. Bookkeeping: four feet with states open, stick and slip under the leg-permutation group C₂ × C₂ give (3⁴ + 3·3²)/4 = 27 strata and 648/4 = 162 one-foot transitions. Every saltation derivative is validated by perturbing the initial state and re-locating events on both sides.

  • Retired when. Event order under perturbation is wrong, or a guard is not transverse: the amortized tangent work is withdrawn for that orbit and a derivative-free search takes over.

  • Pilot and ceiling. Pilot: the two fixtures above and one planar biped on the referee, 100 cases of which 20 are grazing or unstable controls. Falsifier (TARGET): any control not refused, or fewer than 72 of the 80 regular cases with gradient cosine at least 0.95 against re-located central differences. Ceiling: one linear solve replaces 2·n finite-difference rollouts for n design parameters, on periodic gaits over regular ground only. Fallback: orbits serve as stability diagnostics and warm starts, and gradients come from finite differences.

  • Tier. F.

C-17 A mission is a quantified set of designs

  • Object. A mission query fixes a design domain D (a disjoint union of parameter spaces of typed assembly graphs, quotiented only by admitted interface-preserving isomorphisms); a nonempty world set W declared before any candidate is tested (geometry, physics, hidden parameters, initial-state uncertainty); an observation channel Y with its clock contract (C-19); the class Π_Y of causal policies on the history of Y; the set T(d, π, w) of maximal admitted executions; and a Boolean acceptance predicate A on executions (C-30). The robust design family is

    F = { d ∈ D : ∃π ∈ Π_Y  ∀w ∈ W,  T(d, π, w) ≠ ∅  ∧  ∀τ ∈ T(d, π, w), A(τ) }
    

    The public answer is a triple I ⊆ F ⊆ O with topology identifiers, coordinate charts, units, parameter boxes and assumptions. Each cell of I carries a witness: a controller and a certificate that it works on the whole cell. Each cell removed from O carries a refutation. Each cell of O ∖ I is unresolved and carries its competing explanations and the next test that would split it. Empty I means no certified witness so far; empty O excludes the family under the declared model. Rules attached to the definition:

    • An execution must progress to the horizon or to a declared terminal outcome. Deadlock, Zeno behaviour and undefined dynamics cannot earn success.
    • A numerical solver failure leaves the verdict unknown unless independent evidence establishes physical failure or impossibility.
    • Strict, non-strict and equality atoms are evaluated with their declared comparators. A uniform positive margin is a separate, stronger request.
    • Under set-valued contact, a stick or slip fork with any failing admissible branch invalidates a universal success certificate.
    • A design-dependent policy is indexed by the known nominal build. Hidden as-built tolerances stay in the world until a calibration observation reveals them; otherwise the answer certifies a choice nobody can make.
    • A rollout can refute a particular controller. Excluding a design under ∃π needs an argument covering every admitted controller, and a training run that failed does not supply one.
    • A chance constraint names its population, its event and its confidence level, and preserves the joint law across stages or allocates failure budgets that sum to the allowance.

    Four proof rules build the answer, and each is checked independently (§12).

    1. Necessary-condition exclusion. Relax controller and dynamics, for example to any contact force in an outer wrench cone and any torque under an upper envelope. Infeasibility of the relaxation eliminates every realization it covers, with the set inclusions and the dual separating vector recorded (C-32). Infeasible sample points do not eliminate their cell.
    2. Constructive inclusion. One causal controller, an admissible contact schedule, event guards, and a sound reachable tube or an exact witness for the whole cell; actuator bounds, material domains and the mission predicate are checked over the enclosure; uncertain mode boundaries branch conservatively or return unknown.
    3. Monotone inheritance or symmetry. A verdict moves across a cell only under the conditions for that verdict (C-18). Enlarging a convex set of contact forces admits more loads in a static model; broadening a physical sole may create a swing collision; the first cannot certify the second.
    4. Exact partition and composition. A union of proved inner cells is inner. A cell E leaves O only by a proof that E ∩ F = ∅; disjointness from known inner cells proves nothing. Two stage contracts compose only when the first's guaranteed end set lies in the second's entry set with matching clocks, uncertainty dependencies and state memory.
  • Replaces. Scoring one design at a time and reading a reward; reporting a search that found nothing as evidence that nothing exists.

  • Payoff. One query returns a family, so an agent chooses among wheels, legs, transmissions and sensors in one turn (mission.synthesize), learns that a policy search cannot succeed before paying for it (mission.refute), and receives the smallest change of body, sensor or world that relaxes the binding constraint. Unresolved cells direct the next experiment instead of hiding inside an average.

  • Honest limits. Constructive inclusion over a contact-rich cell needs a sound reachable tube; the planning pilots that exist are scalar or static. Region certificates bisect about six parameters per constraint and enclose the rest (C-32). On small exactly solvable plants a generic solver answers the same query: a lifted linear program tied the specialized projection, and a satisfiability solver derived the family answer of a pusher plant from the raw equations (FACT, planning pilots, to be re-run). The contribution claimed is the mapping from a causal mission and a morphology to sound small sub-problems, and the cross-check back; no speed is claimed for it.

  • Foundations. fs-sos (polynomial models, sum-of-squares programs, interval verification), fs-regime (dimensionless groups, scaling maps, model admission), fs-voi, fs-eproc, fs-ivl, and fs-checker (checks packages outside the stepping process) exist. None knows what a mission is.

  • Test. Quantifier order: in the docking fixture of C-19 with the packet arriving late, each world alone has a successful open-loop command and no single command succeeds in both; evidence consisting of one policy per world must be rejected. Strictness: at U = ¾ and ε = 5/16 the docking residual is exactly zero and the strict predicate fails; on 0 < w ≤ 1 every realization has w > 0 although the infimum is 0. Chance constraints: among 20 equally likely worlds two stages each pass in 19; the mission passes in 18 if the failing worlds differ and in 19 if they coincide, and only conditional success at every reached history justifies a product bound. Non-convexity: feet at (±1 − e, ±1) m each capped at 0.5 N carry a load W at the origin, and the positive-x pair must supply W·(1 + e)/2; the designs (e, W) = (0, 1.9) and (0.9, 1) each need 0.95 N and are feasible, and their midpoint needs 841/800 N from a pair capped at 1 N, so a convex hull through two witnesses admits an infeasible body. Every mapping from a mission to a sub-problem ships one deliberately invalid fixture that the checker must reject.

  • Pilot and ceiling. Pilot: the first mission slice of §25 on the CPU with one static family (C-32), one timing family (C-19) and one energy exclusion (C-31), each against its generic comparator. Falsifier: any false certificate, or no cell decided that the comparator leaves undecided at equal cost. Ceiling: the gain is in designs decided per agent turn and trainings avoided, measured by the ten-fold test of §39; a tie with the generic comparator is an acceptable outcome that ships the generic method. Fallback: KILL-FAMILYCERT (§12.6).

  • Tier. F.

C-18 Assumptions form a lattice, and verdicts have polarity

  • Object. Write F(W, Π, A) for the family of C-17. F is antitone in the world set W, monotone in the policy class Π (more information, earlier packets, more actuator authority), and monotone in the acceptance predicate A ordered by implication. Assumptions ordered by strength form a lattice, and every certificate has a polarity on each axis:

    Amendment Inner certificate (d ∈ I) Exclusion (d ∉ O)
    W shrinks survives must be rechecked
    W grows must be rechecked survives
    Π grows survives must be rechecked
    Π shrinks must be rechecked survives
    A weakens survives must be rechecked
    A strengthens must be rechecked survives

    A certificate records the assumption set it used and its polarity, so an amendment is answered by reading the table (result.revalidate): surviving certificates, invalidated regions, required reruns and their cost. The same relation read from the other side is the design–world duality. For closed loops c = (d, π) with a fixed controller, write c R w when every admitted execution of c in w is accepted. For a set X of closed loops let X↑ be the worlds all of X handle, and for a set V of worlds let V↓ be the closed loops that handle all of V. Then V ⊆ X↑ exactly when X ⊆ V↓, an antitone Galois connection whose closed pairs are the robust families and the world families they are robust on. For two closed loops the separating set is S(c_A, c_B) = { w : c_A R w differs from c_B R w }, and mission.separate returns the admitted world in S nearest to nominal, where nearest means fewest edits in authored units and then least normalized physical distance. That world is the dual of the minimal design repair. Priors over worlds stay distinct from admissibility of worlds.

  • Replaces. Recomputing everything after an amendment, or trusting a cache key to mean the verdict still holds.

  • Payoff. A motor, a tolerance or a requirement changes without redoing the part of the answer that an implication already covers. The smallest world change that reverses a preference between two designs ships as a regression fixture, and is often more informative than the maximum simulated reward.

  • Honest limits. For designs with an existential controller the per-world answers do not intersect to the joint answer: F(V) ⊆ ⋂_{w ∈ V} F({w}), and the gap is exactly what the controller cannot observe in time. Polarity is an evidence rule, not a speed lever: FACT (planning pilot, to be re-run) is that a semantic receipt and a correctly keyed dependency graph did identical work on a four-state edit sequence, and FACT (source register) that exact reuse of rollouts after a mass or geometry edit is at most about 10% of compute.

  • Foundations. fs-recompute and fs-ledger exist as crates; whether their dependency records can carry polarity is an admission question (§33).

  • Test. On the docking family ε < (U + ½)/4: an inclusion at (U, ε) = (¾, ¼) survives ε falling to 1/8 and U rising to 1; an exclusion at (¾, 3/8) survives ε rising and U falling; each of the four opposite moves demands a recheck. Enlarging W by one hidden gain 33/32 keeps every exclusion and forces a recheck of every inclusion; the inclusion at (U, ε) = (¾, 1/64) reverses, because the reading (65/64)·p is possible under gains 1 and 33/32 for every first command p, and the least worst-case terminal error becomes 1/65 m. Counterexample to intersecting per-world answers: the late packet of C-19. Stale-verdict control: a dependency graph with one edge omitted returns a promotion that fresh replay contradicts, and the check must catch it.

  • Pilot and ceiling. Pilot: polarity recorded on the certificates of the C-17 pilot and exercised by twelve scripted amendments. Falsifier: one survivor that fresh evaluation contradicts. Ceiling: the reuse share of compute named above; the benefit is fewer wrong reuses. Fallback: every amendment recomputes from its dependency closure.

  • Tier. F.

C-19 Information has a clock: causal policies and indistinguishability

  • Object. Every datum that crosses from physics to a controller passes seven distinct instants: sample, exposure, timestamp, arrival, decision, command and actuation (§11.8). A causal policy is a map from the history of arrived packets to commands: the command decided at an instant depends only on packets whose arrival is not later than that instant, and the content of a packet is the sensor's functional of the physical history over its exposure window. Π_Y is the set of such maps for channel Y. An indistinguishability witness is a pair of admitted worlds w₁, w₂ and a commitment deadline such that, under every admitted command prefix up to the deadline, the two worlds deliver identical packet histories, while the sets of commands that succeed from the deadline on are disjoint. A witness proves that no policy in Π_Y succeeds in both worlds, whatever its training. With stochastic packets and equal priors, a fixed experiment whose reading has law P in one world and Q in the other caps success at (1 + TV(P, Q))/2. Three engineering answers to a witness exist and are compared in one budget: extract the information (a better sensor), move to acquire it (a probing action or a mount change), or change the mechanics so that the information is unnecessary.

    The docking fixture gives the trade-off in closed form. A unit mass starts at rest and must reach position 1 with velocity 0 after three ticks of unit length. Its acceleration is g·u_k with |u_k| ≤ U, and the gain g ∈ {1, 2} is fixed and hidden. The only informative packet is the velocity after the first tick, read with additive error in [−ε, +ε]. Writing p = u₀, the terminal conditions force u₁ = 1/g − 2p and u₂ = p − 1/g, and the bounds for both gains hold exactly when 1 − U ≤ p ≤ (U + ½)/2 for U ∈ [½, 1]. The readings are centred at p and 2p, and they must be disjoint because the required next commands differ by ½. If the packet arrives before the second command, a robust policy exists exactly when

    ε < (U + ½) / 4          (equality excluded)
    

    and if it arrives after the third command is committed, none exists for any U and ε. The inequality says that tolerable sensor error is bought with actuator authority at a rate of one quarter, because the first command is also a probe: a larger probe separates the readings and needs more authority to recover from. Sensor, actuator and delivery time appear in one hardware design inequality.

    Two further objects use the same definitions. The label count is the least number of calibration labels a factory must attach so that one controller serves all admitted variants by a commitment deadline: with K_s the commands that work for variant s, variants can share a label exactly when their sets have a common point, and the count is the least number of colours of the hypergraph whose edges are the inclusion-minimal collections with empty intersection. Schedule classes are the orderings of capture, delivery, estimator read, watchdog expiry and actuator commit modulo commutation of independent events; a timing race is explored once per class and not once per ordering.

  • Replaces. Sensor models that are a noise level and a delay; the belief that more training can overcome any sensing limit.

  • Payoff. A studio that can say that training cannot help and what to change instead. Delay is priced: a late packet has zero value for a committed decision, and every held value exposes its age. A body can remove the need for a sensor, and the same query returns that alternative.

  • Honest limits. The closed form is a scalar model and no device timing follows from it. With bounded probes and positive read error, a nondegenerate interval of hidden gains always contains an indistinguishable pair, so an exact guarantee fails and a finite tolerance must be declared. For the label count, extracting the sets K_s from compliant contact is the open problem, and on the fixtures an off-the-shelf satisfiability solver answers the same question; nothing is claimed beyond stating the query correctly. Error dependence, not per-read accuracy, sets the value of redundancy.

  • Foundations. asupersync has a deterministic lab runtime (src/lab/runtime.rs, LabRuntime) on which schedule classes can be enumerated. FrankenSim has no packet model.

  • Test. Docking witness: with p = ¼ and an on-time exact reading, the command sequences (¼, ½, −¾) for g = 1 and (¼, 0, −¼) for g = 2 both reach (1, 0) exactly in rational arithmetic. At U = ¾ the probe p = ¼ tolerates ε < 1/8 and the probe p = 5/8 tolerates ε < 5/16; at equality both worlds can report 15/16 while needing −¼ and −¾. Repeated readings: a binary probe correct with probability ¾ gives 27/32 with three independent reads, 459/512 with five and 3807/4096 with seven, and stays at ¾ after any number of reads that share one fault bit. Label count: commands (x, y) ∈ [0, 1]² with variants requiring x ≥ 2/3, y ≥ 2/3 and x + y ≤ 1; every pair intersects and the triple does not, so two labels suffice and one is impossible. Counterexample: pairwise compatibility would have authorized one shared controller. Schedule classes: six events containing three mutually independent conflicting pairs have 720 orderings and 2³ = 8 classes.

  • Pilot and ceiling. Pilot: the docking family against an independently written scenario-tree linear program on a grid of bounds and error levels, and one planted stale-read race. Falsifier: one grid cell where the two disagree, or the planted race missed. Ceiling: a witness ends a futile policy search; it does not speed a search that can succeed. Fallback: witnesses are checked when supplied and not searched for.

  • Tier. S for the clock contract, causal typing and witness checking; F for witness search, the label count and schedule exploration.

C-20 Observability is a Gramian modulo a gauge

  • Object. Along a trajectory with error-state transition maps Φ_k (in Lie-algebra coordinates of the invariant error of C-13), measurement Jacobians H_k and noise covariances R_k, the local observability Gramian over a window is W = Σ_k Φ_kᵀ·H_kᵀ·R_k⁻¹·H_k·Φ_k. Its empirical form perturbs the initial state by ±δ along each basis direction and accumulates whitened output differences, so it needs no derivative program. Some directions are unobservable by construction: under proprioception and gravity, global position and yaw form a four-dimensional gauge subspace. The reported index is the smallest singular value of W restricted to the complement of the declared gauge, in whitened units. Fisher information on parameters is the same object with parameters in place of states. A Gramian is local: it says nothing about two distant states that produce the same readings, so every calibration and placement analysis also runs a global ambiguity search and reports the alternatives that would change a mission decision.
  • Replaces. Sensor placement by coverage geometry alone; calibration judged by residual size.
  • Payoff. A map of where a design is blind: feature-starved corridors and repetitive aisles show as a collapsing index before any estimator drifts. The index feeds sensor placement, the assumption monitors of C-31 and the probe design of C-39.
  • Honest limits. Full local rank does not imply distinguishability, as the fixture below shows. An estimator that reports small uncertainty while drifting is a failure the Gramian does not see; consistency is tested separately (C-13).
  • Foundations. None in the siblings beyond fs-ad duals for the Jacobians.
  • Test. Gauge: for a legged robot with joint encoders and an IMU the computed null space of W has dimension four and equals the span of translations and yaw, checked analytically and by finite perturbation. Global ambiguity: range anchors at (−1, 0) and (1, 0) both read √2 from (0, 1) and from (0, −1); with unit variances the information matrix is the identity at both points, yet a controller that must pick the side fails. A third anchor at (0, 2) reads 1 or 3, and closed reading intervals of half-width ε separate exactly when ε < 1.
  • Tier. S.

C-21 Designs are canonical up to the similarity group

  • Object. The similarity group is 𝕊 = (ℝ₊)³, acting by a change of the units of mass, length and time with factors (α_M, α_L, α_T). A quantity of dimension MᵃLᵇTᶜ scales by α_Mᵃ·α_Lᵇ·α_Tᶜ. Applied to a whole experiment (design, world, controller, clocks, thresholds, tolerances and gravity), an element of 𝕊 maps executions to executions. That is dynamic similarity, and it is exact because kernels are dimensionally homogeneous (T-09). The subgroup that fixes gravity is two-dimensional: α_L = λ and α_T = √λ with any α_M. A design is put in canonical form by dividing by its own scales: m₀ the total mass, ℓ₀ the radius of gyration of the whole robot about its centre of mass in the zero configuration, and t₀ = √(ℓ₀/g). The derived scales are force m₀·g, torque m₀·g·ℓ₀, power m₀·g·√(g·ℓ₀), stiffness m₀·g/ℓ₀, linear momentum m₀·√(g·ℓ₀) and angular momentum m₀·ℓ₀·√(g·ℓ₀). The canonical design is the list of its dimensionless groups, n quantities of dimensional rank r giving n − r of them: link ratios, mass fractions, the actuator groups τ_max/(m₀·g·ℓ₀) and ω_max·t₀, the delay group t_d/t₀ of every clock and latency, contact stiffness k·ℓ₀/(m₀·g), friction coefficients, and the Froude number v²/(g·ℓ₀) of each commanded speed.
  • Replaces. Raw SI features in cache keys and policy inputs; scaling rules of thumb.
  • Payoff. Two designs with equal groups share a canonical form, and a verdict moves between them by an implication in the sense of D-11. Policies observe and act in dimensionless variables, so a family policy (C-23) interpolates over groups instead of memorizing sizes. The group also gives an exact metamorphic test of the whole stack: choose the three factors as powers of two and scale every dimensional input by its dimension. A homogeneous kernel uses only +, −, ×, ÷, √ and comparisons, and the type checker admits a square root only on even exponent vectors, so every intermediate value is scaled by a power of two, which binary floating point represents exactly away from overflow and underflow. The scaled run must reproduce the original in every significand bit and every branch (HYPOTHESIS; the test is the gate), provided that representation constants with a dimension are scaled as inputs: the anchor cell side of §35.8 becomes 32 m when lengths are multiplied by 4, otherwise the offsets are not power-of-two images of each other. A kernel that hides a dimensional constant typed as a pure number fails on its first step.
  • Honest limits. Matching some groups is not similarity; every group must match. Material strength, motor technology, sensor noise and network latency do not scale with a robot, so two real robots of different size are rarely similar, and the canonical form reports this as named groups that differ.
  • Foundations. fs-regime has a dimensionless-group basis (pi::pi_groups), named standard groups, scaling maps (scaling::ScalingMap) and model admission by distance to a validity range.
  • Test. Count: a pendulum described by (T, ℓ, g, m) has one group, T·√(g/ℓ). Scaling counterexample: scaling a body by λ at constant density multiplies mass by λ³ and static joint torque by λ⁴; for a fixture motor whose torque is declared to scale as λ³, the group τ_max/(m₀·g·ℓ₀) falls as 1/λ, so a design that stands at one size fails at twice the size although every geometric ratio matches. Delay: a fixed latency has delay group proportional to λ^(−½), so it doubles at one quarter of the size. Exact test: lengths × 4, times × 2, masses × 2, gravity unchanged; rerun on each tier and compare bits.
  • Pilot and ceiling. For canonical policy inputs: an arm of the C-23 pilot with raw SI inputs. Falsifier: no gain in held-out return across a size sweep. Ceiling: it removes one nuisance dimension of a family, no more. Fallback: SI inputs with per-feature normalization.
  • Tier. S for the canonical form and the exact test; F for canonical inputs to learned policies.

C-22 A campaign is quotiented by symmetry orbits

  • Object. A design campaign enumerates assignments of module types to slots: legs to hips, wheels to corners, actuators to joints. The group that acts on the slots X is Γ_obs of the chassis and task (C-09), never Γ_mech alone, and two assignments in one orbit are the same closed loop. By the orbit-counting lemma (Burnside) the number of distinct designs with k types is |Γ|⁻¹·Σ_{g ∈ Γ} k^c(g), where c(g) is the number of cycles of g on X. The campaign generates one canonical representative per orbit, the lexicographically least assignment, and records for every member the group element that maps it to the representative, so results are transported back with the correct ρ(g). When a module has its own automorphism group K that preserves its attachment-port invariants and the hub group H preserves the decorated ports, the acting group is the wreath product K ≀ H = K^|X| ⋊ H of order |K|^|X|·|H|; both conditions are checked before it is used. A second and independent quotient is the mission-observable projection: a digest of the compiled model restricted to exactly what the mission's equations read (pseudo-inertia per body, collision hull, joint and actuator parameters, port coordinates, sensor visibility, bus state, objective terms). Two designs whose projections are equal over all active observables are evaluated once.
  • Replaces. One dispatch per enumerated design.
  • Payoff. Up to |Γ_obs| times fewer evaluations in a combinatorial sweep, exactly and before any simulation, and an honest small factor when a sensor breaks the symmetry. Algebra is spent at campaign time, where it deletes simulations, and not in the per-step loop.
  • Honest limits. The factor is at most the group order, between 2 and about 12 for the bodies of this plan. The projection's factor is a property of the fixture: independent material or compliance changes make every class a singleton. "Equal projections give identical trajectories" is a statement about the simulator that no proof checker decides; it is a structural rule with a bit-identical replay test (§12.3).
  • Foundations. None: fs-symmetry covers cyclic groups only.
  • Test. Ten leg types on the six slots of a hexapod with dihedral symmetry of order 12: (10⁶ + 2·10 + 2·10² + 10³ + 3·10⁴ + 3·10³)/12 = 86,185, a factor of 11.6. If a sensor leaves only the sagittal mirror, (10⁶ + 10³)/2 = 500,500, a factor of 2.0. With three types the formula gives 92, which brute-force enumeration confirms. Wreath product: two slots swapped by the hub, each holding one of k module types in one of two mounting orientations that the module's own half-turn symmetry identifies; the group C₂ ≀ C₂ has order 8 and the count is (4k² + 4k)/8 = (k² + k)/2, which is 6 for k = 3 against 36 raw assignments. Projection: eight equal ballast slugs in 24 collinear slots enter rigid-body dynamics only through their count, Σx and Σx², so C(24, 8) = 735,471 placements fall into 24,546 classes. Negative control: slots {1, 4} and {2, 3} have equal Σx = 5 and different Σx², 17 and 13, and must not merge. Counterexample: counting with Γ_mech when a front-only lidar is fitted merges designs that the closed loop distinguishes.
  • Pilot and ceiling. For the projection: the ballast fixture end to end with replay. Falsifier: one merged pair whose replays differ in any bit. Ceiling: fixture-dependent, and 1 in general. Fallback: orbit deduplication only.
  • Tier. S for orbit enumeration and counting; F for wreath products and the projection quotient.

C-23 A family policy is a section, and edits transport it

  • Object. Let 𝒟 be a design family in which the observation space Y_d and the action space U_d change with d. The policy spaces Π_d form a bundle over 𝒟, and a design-conditioned policy is a section σ: d ↦ π_d, realized by one set of weights θ acting on tokens, π_d = Φ_θ(tokens(d), ·). There is one link token per link, formed with its parent joint, and one token per contact site. Static features are dimensionless (C-21): the joint's screw basis in its own frame, the placement log(parent_from_joint), the scaled subtree pseudo-inertia, the actuator groups, tree depth and parent index, and the Γ_obs orbit label. Dynamic features are the unit-complex joint coordinate, scaled velocity, last action and contact flag. The network is permutation-equivariant in tokens, with attention or message passing informed by the tree, and weights are tied across orbit labels. A section must be natural under re-description: for every isomorphism φ: d → d′ of designs (a relabeling of links, a change of frame or of axis-sign convention, a similarity scaling), σ(d′) = φ·σ(d). An edit e: d → d′ is not an isomorphism. It declares a correspondence between parent and child frames, actuator roles, sensor channels, contact roles and phase clocks, and that correspondence defines a transport T_e: Π_d → Π_d′ that initializes the child: matched tokens keep their features and heads, references and errors move by Ad and its dual, new tokens start with zero-initialized heads, and unmatched recurrent state is reset. Transport composes on matched tokens, T_{e₂∘e₁} = T_{e₂}∘T_{e₁}, and on isomorphisms it equals the group action.
  • Replaces. One training run per design.
  • Payoff. Most designs in a campaign are scored without training, and the child of an edit starts from its parent. This is where trainings are avoided, the largest term in the thesis of §2.
  • Honest limits. FACT (source register; each figure to be re-read from its primary source). Within one morphology class a family policy reaches 70 to 85% of specialist return without adaptation and matches it after about 2 to 25% of a from-scratch run stopped at matched return. Across topology-diverse designs at affordable pretraining it reaches 10 to 40%, and fine-tuning gains a factor of 2 to 3. Inheritance from a class prior costs about 2 to 25% of such a run; the one published parent-to-child figure is about 50%; no source measures a small typed parameter edit; single-limb topology edits cost 33 to 100%. A published morphology-conditioned policy lost most of its return when the same robots were re-described in equivalent conventions. Shared control biases a population toward designs that are easy to steer. The consequences are design rules: one family policy per morphology class and never one universal policy; a cheap rung discards and does not select until rank agreement is measured (C-26); chained inheritance resets on a schedule against loss of plasticity; an edit that changes support discontinuously (a mirrored pair, a removed limb, a wheel exchanged for a foot) has its own gate.
  • Foundations. frankentorch has attention modules with autograd on the CPU. Its tensors are host memory and its device tags are metadata, so on-device network kernels and their backward passes are this project's to build (§21, §23).
  • Test. Re-description: for every design in the corpus, a random relabeling, frame change and power-of-two scaling leaves the actions unchanged after mapping back, to round-off; a policy that reads tokens in file order fails at the first exchange of two legs. Transport: an edit whose parameter change is zero gives a child whose first action equals the parent's. Composition: two commuting edits give the same initialization in either order.
  • Pilot and ceiling. Pilot 1, shared with C-26: one class, 40 designs, zero-shot and 5% fine-tune against specialists. Pilot 2: 12 parent–child edit pairs of which 4 are blind; falsifier (TARGET): transport fails to halve the median adaptation samples. Kill (TARGET): zero-shot return below 70% of specialist on more than half of the held-out set together with fine-tuning above 0.2 of specialist steps. Ceiling: the bound of D-10 with f the training share of a design loop; pretraining at 10⁹ to 10¹⁰ steps costs about 1 to 30 GPU-hours (FACT, source register) and amortizes only over a campaign. Fallback: per-design training, with inheritance kept for parameter edits.
  • Tier. F.

C-24 A geometric-algebra policy on the kinematic tree

  • Object. A variant of C-23 in which each link token carries multivector features in the projective geometric algebra of fs-ga: the link's motor, its joint line as a bivector, its momentum and its wrench. Layers are equivariant under relabeling and under the rigid motions that preserve gravity, which are rotations about the vertical, translations and reflections through vertical planes. Messages pass along the kinematic tree in the order of the recursions of C-04.
  • Replaces. Nothing on the critical path.
  • Payoff. If it works: invariance to heading and to description conventions by construction instead of by augmentation, and a smaller function class for the same behaviour.
  • Honest limits. FACT (source register, to be re-read): no published policy of this kind exists for multi-embodiment locomotion; a pure geometric-algebra network inside a control loop converged very slowly; such layers ran 1.4 to 7.5 times slower per epoch, so equal parameters is not equal compute; fixed tree message passing has lost to plain transformers; heading normalization with augmentation recovers most of the benefit. The expected gain is between none and 1.3×.
  • Foundations. fs-ga multivectors and motors.
  • Test. Equivariance of every layer to round-off under yaw, translation, vertical-plane reflection and relabeling. Gravity control: a rotation about a horizontal axis must not be a symmetry of the policy.
  • Pilot and ceiling. Three arms on one embodiment set at equal wall-clock budget with three seeds each. Arm A, the control: a plain link-token transformer with heading normalization and convention augmentation. Arm B: A with a geometric-algebra encoder and decoder only. Arm C: full geometric-algebra message passing on the tree. Measures: time to a return threshold, zero-shot return on held-out designs, retention under re-description. Kill (TARGET): neither B nor C is at least 1.3× faster than A to the threshold, nor higher in zero-shot return beyond seed spread. Cost: on the order of 90 GPU-hours (an estimate; it needs an owner-approved compute envelope). Ceiling: 1.3× on an amortized pretraining run, which is not a source of the ten-fold. Fallback: arm A.
  • Tier. M.

C-25 Fidelity tiers are coupled estimators

  • Object. The same world address run on two tiers gives a coupled pair (Y_lo, Y_hi) with correlation ρ. Three estimators of a high-tier mean, or of a high-tier difference between two designs, use the coupling.
    1. Control variate. θ̂ = Ȳ_hi(n) − β·(Ȳ_lo(n) − Ȳ_lo(N)) with N ≫ n cheap episodes. At the optimal β its variance is Var(Y_hi)/n·(1 − ρ²·(1 − n/N)).
    2. Multilevel. E[Y_L] = E[Y₀] + Σ_ℓ E[Y_ℓ − Y_ℓ₋₁] over the levels GPU f32, batch-cpu and referee, with N_ℓ ∝ √(V_ℓ/C_ℓ) for level variance V_ℓ and cost C_ℓ. The total cost for variance ε² is (Σ_ℓ √(V_ℓ·C_ℓ))²/ε².
    3. Doubly robust tier correction. For each fresh paired scenario i: choose a prediction mᵢ of the high-tier outcome from the cheap tier before any high-tier outcome exists; log an audit probability pᵢ ≥ p_min > 0; draw Aᵢ ~ Bernoulli(pᵢ); run the high tier only if Aᵢ = 1; form Zᵢ = mᵢ + Aᵢ·(Yᵢ − mᵢ)/pᵢ. Then E[Zᵢ | past] = E[Yᵢ | past] whatever mᵢ is, so a wrong cheap model inflates variance and never bias: Var(Zᵢ) = Var(Yᵢ) + E[(1 − pᵢ)/pᵢ·(Yᵢ − mᵢ)²]. The audit assignment is persisted before dispatch and survives retries. Stopping uses a predictable bounded-increment confidence sequence (C-15).
  • Replaces. Evaluating finalists on the referee alone, or trusting the fast tier alone.
  • Payoff. Referee-grade estimates for a fraction of the referee episodes where tiers agree, with a valid error rate where they do not.
  • Honest limits. The saving is 1/(1 − ρ²) at best: about 2 at ρ = 0.7; a factor of 5 needs ρ ≥ 0.894 and a factor of 10 needs ρ ≥ 0.949. Chaotic contact decorrelates paired worlds over long episodes, and re-simulating short segments from snapshots estimates a different quantity, which is named as such. Inverse weights can consume the budget; p_min bounds |Zᵢ − mᵢ| by |Yᵢ − mᵢ|/p_min.
  • Foundations. fs-uq has mlmc::{mlmc_estimate, coupled_mlmc_summary}, product_mlmc_allocation::allocate_mlmc and linear control variates (product_control_variate). Its importance sampling works on Gaussian germs only and its multilevel driver takes a per-call closure, so a batched entry point is an upstream work item (FD-FSIM-17, Appendix F).
  • Test. Unbiasedness by enumeration: for Y ∈ {0, 1} with mean θ, a constant m and p = 0.1, E[Z] = m + p·(θ − m)/p = θ for every m. Variance: with a perfect prediction the added variance is 0; with m wrong by a constant ½ and p = 0.1 it is 9 × ¼ = 2.25, worse than auditing everything. Planted reversal: a between-tier reversal planted in one stratum must not be accepted. Null: stopping error at or below α over 10⁴ simulated null studies.
  • Pilot and ceiling. Pilot: ρ on 200 world addresses, from paired data the fidelity gate already pays for. Kill (TARGET): ρ below 0.7, or failure to beat referee-only by a factor of 2 on high-agreement strata. Ceiling: 1/(1 − ρ²) on the referee share of a decision. Fallback: fixed escalation of finalists to the referee.
  • Tier. S for the estimators as mathematics; F for their use across contact-rich tiers and for the audited correction.

C-26 Rungs are trusted by rank agreement and conformal margins

  • Object. A ladder of rungs runs from a static check, through the baseline controller, a family policy without adaptation and a fine-tune fraction, to specialist training, and from the fast tier to the referee. A rung is trusted by measurement. Rank agreement between two rungs on n designs is Kendall's τ = (concordant − discordant pairs)/C(n, 2), reported with top-k recall and bootstrap intervals, per morphology class, task family and region of design space. Allocation uses a conformal margin. On an audit set of n designs that ran both rungs, drawn by keyed randomness before any score exists and run at fixed n, let q̂ be the ⌈(n + 1)·(1 − α)⌉-th smallest residual |y_hi − ĝ(y_lo)|. Every design whose cheap score is within 2·q̂ of the k-th best cheap score is promoted. For a design exchangeable with the audit set the residual is at most q̂ with probability at least 1 − α, so a pair separated by more than the margin is misordered with probability at most 2α.
  • Replaces. Successive halving on faith; a screening rung whose accuracy was tested once on a corpus.
  • Payoff. The number of designs that need the expensive rung becomes a measured quantity with a stated miss rate. Screening is audited: a sample of discarded strata goes up anyway, and a planted winner must survive.
  • Honest limits. FACT (source register, to be re-read): no published measurement of rank agreement between a shared policy and trained specialists was found; the nearest figures are rank correlations of 0.4 to 0.8, and cheap rungs are biased, not only noisy. Conformal coverage holds on average over calibration draws and moves by several points at twenty calibration designs. A rung cannot separate designs closer than twice its own error: if more than 3k designs survive, the rung is skipped for the top band or more episodes are bought.
  • Foundations. fs-surrogate has split-conformal bands; fs-race has racing.
  • Test. Arithmetic: n = 39 and α = 0.05 select the 38th smallest residual, and fewer than 19 audit designs cannot support α = 0.05 because ⌈(n + 1)·0.95⌉ then exceeds n. A planted over-scored design is caught at the next rung. Synthetic drift trips the exchangeability alarm. Counterexample: computing q̂ from promoted designs only under-covers on a fixture where the residual correlates with the cheap score.
  • Pilot and ceiling. The decisive early experiment of the program. Forty designs in one class, each scored by the shared policy on the fast tier, by a fine-tune at 5% of specialist budget, and by a specialist on the referee; τ, top-10 recall, and per-episode ρ on 256 paired episodes per design. Kill (TARGET, fixed before data): top-of-ranking τ below 0.5 or ρ below 0.7. Cost: about 45 GPU-hours, or about 5 if specialists are shared with the C-23 pilot (an estimate; it needs an owner-approved envelope). Ceiling: the share of designs that never train. Fallback: successive halving at η = 3 with the same audit lane.
  • Tier. F.

C-27 Rare failures: bounded weights certify, splitting explores

  • Object. The failure probability p of a design on a world distribution is handled in two lanes that never mix (D-16). Certification. n independent nominal episodes with zero failures give p ≤ 1 − δ^(1/n) ≤ ln(1/δ)/n at confidence 1 − δ, sequentially by an exact binomial bound. With a proposal law q and likelihood ratio w = dp/dq bounded by w_max on the support, the importance-sampling estimate n⁻¹·Σ wᵢ·1[fail] is unbiased with terms in [0, w_max], so bounded-variable confidence sequences apply; weights truncated at c give a valid lower bound, used to refute a claimed rate. Exploration. Multilevel splitting on a distress score with fixed levels forks a world that reaches a level into children whose random streams are keyed by child world addresses. The product of conditional fractions estimates p with squared coefficient of variation near L·(1 − p₀)/(p₀·N) for L levels of conditional probability p₀ and N trials per level. A catalogue of failure modes carries a Good–Turing estimate of the unseen mass (modes seen once divided by failures seen), which says when exploration has stopped finding new modes.
  • Replaces. Waiting for failures under domain randomization; a fitted tail extrapolated past the data.
  • Payoff. Failures near 10⁻⁴ to 10⁻⁵ are found and their rate estimated with 2 to 20 times fewer episodes in the published record (FACT, source register, to be re-read) and one to two orders of magnitude as a TARGET, when the score is informative.
  • Honest limits. No sampler discounts the price of certifying absence without assuming where failures live. With a defensive mixture q = β·p + (1 − β)·q′ the weights are at most 1/β, and zero observed failures certify only p ≤ ln(1/δ)/(β·n), never better than crude sampling on the nominal share. Splitting supplies discovery and Estimated rates only: its trials are dependent and its accuracy rests on the score. A fork without fresh randomness is an identical copy. A bound is scoped to its tier, and found failures are replayed one tier up. Extreme-value extrapolation is not used, because checking a fitted tail at 10⁻⁶ costs the nominal episodes that certify directly.
  • Foundations. fs-uq importance sampling on Gaussian germs; fs-rand keyed streams; fs-eproc.
  • Test. Arithmetic: δ = 0.05 gives n = ⌈ln 20/p*⌉, about 3·10⁴ episodes for p* = 10⁻⁴. Splitting with L = 6, p₀ = 0.1 and N = 10⁴ has a coefficient of variation of about 7%. Known-probability fixture: a random walk with a closed-form hitting probability, on which the two bounds bracket the truth in at least 1 − δ of 10⁴ repetitions. Fork control: children that share the parent's streams are detected as duplicates.
  • Pilot and ceiling. For splitting: the random-walk fixture and one planted trap of probability at most 3·10⁻⁵ in a scene. Falsifier (TARGET): the trap is not found at least three times sooner than by uniform sampling, or fewer than 1% of forks reach the next level. Ceiling: discovery speed only; the certification price is unchanged. Fallback: crude sampling alone.
  • Tier. S for crude and bounded-weight bounds; F for splitting and adaptive proposals.

C-28 A failure has a minimal counterexample world

  • Object. A failing world is written as a nominal passing world plus a set E of typed atomic edits: a friction patch, a threshold height, a light, a packet delay. Edits are partially ordered by dependency, so the admissible sub-worlds are the order ideals of E, which form a distributive lattice. Delta debugging searches that lattice for a 1-minimal failing ideal: one that fails and from which no single edit can be removed without the world passing or becoming inadmissible. Each test is a deterministic replay on a fixed set of paired seeds, and the result is stored as a .fmcw with its state-hash receipt. A counterexample is kept only with a solvability witness: evidence that the candidate's own body, actuators and mission constraints admit a success in that world. A witness that needs privileged state is tagged plant-feasible only. The shrunk world goes to the retrofit search of §19 and to the autopsy of C-29, together with the counterfactual edit that removes the effect.
  • Replaces. A failing seed and a video.
  • Payoff. The agent receives the smallest world that breaks the design, as a regression test. It is the dual of the minimal design repair (C-18).
  • Honest limits. 1-minimal is not minimum, and failure sets are not monotone, so no distance to a boundary is claimed: the result is 1-minimal under the tested edit relation. The worst-case cost is quadratic in |E|. A shrinking run whose failure mechanism changes is reported as a different failure with a new event classification. A world the body cannot solve is a useless trap, hence the witness.
  • Foundations. fs-bisect bisects a linear history with a monotonicity check; it does not search a subset lattice.
  • Test. Eight edits with failure exactly when edits 3 and 6 are both present: the search returns {3, 6}. Non-monotone control: a grease patch (edit 1) fails the design and a rug over the patch (edit 2) masks it, so {1} fails and {1, 2} passes; the tool returns {1} and does not describe it as a distance. Impossible-world control: a doorway narrower than the body is rejected for lack of a witness. Replay control: the stored world reproduces its state hash.
  • Pilot and ceiling. Planted traps in three scenes. Falsifier (TARGET): fewer than 70% of returned worlds carry a solvability witness, or one returned world from which a single edit can still be removed. Ceiling: a better artifact per failure, measured in agent repair iterations and not in steps. Fallback: the failing world unshrunk, with its edit list.
  • Tier. F.

C-29 A deterministic forkable simulator is a causal model

  • Object. With bitwise replay (§35) the simulator is a structural causal model whose exogenous variables are the keyed random streams and whose mechanisms are the model's components. The three steps of a counterfactual are then exact operations. Abduction is replay of the recorded world to a snapshot, bit for bit. Action is a typed intervention do(X := x) that changes one declared mechanism and is recorded as a model diff: torque limit off, friction set to nominal, estimator replaced by privileged state. Prediction is continuation on the same streams. A placebo fork applies an intervention with no mechanistic route to the outcome, a last-place perturbation of an unrelated state, and its flip rate ρ₀ measures how often chaos alone changes the outcome. For a candidate cause c the probability of necessity is PN(c) = P(no failure under do(¬c) | failure), estimated over the failing worlds, and c is named a cause only when PN(c) exceeds ρ₀ under a sequential test (C-15). Results are labeled but-for, joint (only a set of interventions prevents the failure) or chaotic: unattributable. Minimal repair sets are found by the search of C-28 over interventions. A budgeted Shapley summary over n interventions, φᵢ = Σ_S |S|!·(n − |S| − 1)!/n!·(v(S ∪ {i}) − v(S)) with v(S) the fraction of failures that S prevents, needs 2ⁿ coalitions and is computed only when no single intervention and no pair flips the outcome.
  • Replaces. Earliest-anomaly heuristics; attribution by reading logs.
  • Payoff. "Which repair edit ranks first?" is answered by experiment, with a stability figure beside each attribution.
  • Honest limits. An intervention at a snapshot answers a question about the continuation. For a design parameter (a gear ratio, a mass) the thermal state, the estimator state and the policy's history would all differ, so the intervention is re-run from the episode start on the same streams. The policy's reaction is part of the effect, and a fork is refused when the controller cannot adapt without retraining. Shapley values average over coalitions, can be negative, and do not identify necessary causes. Attribution runs in double precision on a CPU tier. A successful counterfactual is not a minimal repair, and a local rescue can disagree with the global outcome.
  • Foundations. fs-rand keyed streams. No sibling has an atomic full-world snapshot, so snapshots covering world, sensor, estimator, policy, solver and stream state are this project's (§29).
  • Test. Null: the empty intervention replays the failure bit for bit. Shapley counterexample: with two interventions, if either alone prevents the failure then v({A}) = v({B}) = v({A, B}) = 1, and if only both together prevent it then v({A}) = v({B}) = 0 and v({A, B}) = 1; both cases give φ = (½, ½), although the first has two but-for causes with PN = 1 and the second has none. Placebo: on a fixture where every nudge flips the outcome the report is chaotic: unattributable. Planted cause: recovered as first-ranked in at least 90% of planted cases (TARGET).
  • Tier. S for interventional contrasts with a placebo-referenced stability report; the Shapley summary is a budgeted mode.

C-30 Requirements are temporal logic over unit-normalized predicates

  • Object. A requirement is a formula of signal temporal logic over typed signals. An atom is ψ(x) ≥ 0, where ψ has a physical dimension and a declared positive scale s of the same dimension; its robustness is ρ = ψ/s, a pure number. Conjunction is min, disjunction is max and negation is −ρ. G_[a,b] (always) is the minimum over the window, F_[a,b] (eventually) is the maximum, and U is until. Soundness: ρ > 0 implies satisfaction, ρ < 0 implies violation, and ρ = 0 decides nothing, which is where the declared comparators of C-17 apply. The past-time operators H_[a,b] (historically), O_[a,b] (once) and S_[a,b] (since) depend only on the past and are evaluated online by a streaming monotonic deque, in amortized constant time with at most three comparisons per sample per node, so they may feed rewards and runtime monitors. Future-time operators yield verdicts offline over completed traces. A formula with future horizon b is decided at delay b, and a window the trace does not cover yields undetermined (§24.5), never a truncated minimum. A bounded-future formula is rewritten as a past-time formula evaluated at its horizon: G_[0,T] φ at time 0 equals H_[0,T] φ at time T.
  • Replaces. Success flags hand-coded per task; a reward standing in for a requirement.
  • Payoff. One artifact is the acceptance predicate of C-17, the falsification score of C-27 and a runtime monitor. Mission verdicts are separate from shaped rewards.
  • Honest limits. Requirements are the acceptance metric and a falsification score. They do not replace shaped rewards in training (FACT, source register). A 600 s future window at 50 Hz needs 30,000 samples of memory. Margins are comparable across atoms only through their declared scales, which are judgments recorded in the task file.
  • Foundations. None in the siblings.
  • Test. Unit counterexample: a clearance of 0.02 m and a thermal margin of 15 K have minimum 0.02 in metres and kelvin and minimum 15 in millimetres and kelvin, so an unnormalized minimum changes its binding atom with the unit system; with scales 0.10 m and 10 K the values are 0.2 and 1.5 and clearance binds in every unit system. Streaming: the deque equals the brute-force window minimum on random signals. Truncation control: an episode that ends at 30 s under G_[0, 45 s] returns undetermined.
  • Tier. S.

C-31 Safety is an energy budget first, a filter second

  • Object. Three tiers with strict domain separation.
    1. An energy budget at a guided boundary. Where a guide puts an absorber on every forward path (a stop, a bumper, a door, a drawer, a lift, a transient contact with a person), the energy that can reach the absorber is bounded by its sources, whatever the contact sequence:

      ½·m_cap·v² + ∫ max(P_elec, 0) dt + E_stored + E_gravity + E_other + E_reserve  ≤  W_abs,min
      

      m_cap is an upper bound on the effective moving mass, including the reflected inertia of rotors, gears and wheels (N²·J_r/r² at a wheel of radius r), and v a bound on its speed from the encoders; the integral covers the worst-case drive input until the cutoff acts; E_stored covers springs and compliance; E_gravity covers the weight over the absorber stroke and any drop on the path, and with E_other (every other actuator on the load path) it is the external work of §22.11; E_reserve is a declared margin, zero unless stated; W_abs,min is the lower work envelope of the absorber. Passive contact with any friction coefficient μ ≥ 0 only dissipates or redistributes energy, so the contact model drops out. The budget is a .fenergy artifact that binds integer unit scales, error bounds, the runtime admission predicate and the evidence for each term. Read as an exclusion, the same inequality removes a design family: if a mandatory crossing needs a potential rise greater than the initial energy plus all allowed external work, no controller succeeds, clairvoyant or not.

    2. Tube inclusion for small subsystems. For a guard-ambiguous subsystem of at most four reduced states (a threshold crossing, a tray, braking on mixed tiles, a door pinch zone), a table of mode-indexed cells K_m with one common safe action per cell satisfies the inclusion of §22.12.5 for every simultaneously enabled guard, with the sensing-error set, the disturbance set and the reset named there, and with inter-sample sweep, actuation latency and a backup domain accounted for. At run time the whole belief set is checked against the table, and the answer is covered or uncovered.

    3. Runtime filters for the whole body. A policy action u_π is projected onto barrier rows aᵢᵀu ≥ bᵢ + L·Δt inside the actuator box, where L·Δt is an inter-sample margin from a Lipschitz bound and the barrier lives on a reduced-order template (capture point, joint limits, capsule distances). The quantifier order is ∃u ∀(w, e): one action for all disturbances and estimation errors, never an action chosen after seeing them. Forces the controller commands are restricted to the inner cone 𝒦(μ_min); forces the environment may apply range over the outer cone 𝒦(μ_max). One row with a diagonal metric R is solved exactly: u(λ) = clip(u_π + λ·R⁻¹a, lo, hi) is piecewise linear in λ with at most 2n breakpoints, and the least λ ≥ 0 with aᵀu(λ) ≥ b is found by sorting them. Two to four rows take a fixed number of projected Newton steps followed by a mandatory KKT check, and a failed check invokes a passive braking controller. Assumption monitors run beside the filter, and the residual risk per episode is bounded by E[N_breach]·δ₁ + P(N_alarm ≥ 1)·δ₂ + δ₃, where δ₁ is the expected share of breaches on which every monitor stays silent, δ₂ the probability that an episode with at least one alarm ends in a violation, and δ₃ the probability of a violation with neither a breach nor an alarm (the gap between template and body).

  • Replaces. Online verification of every contact; an unfiltered policy during exploration.
  • Payoff. The budget of tier 1 contains no term that depends on the policy, so its evidence survives every retraining, and its monitor is one integrator and one comparison per tick. Tier 3 removes model-level barrier violations during exploration at a bounded cost per step.
  • Honest limits. Tier 1 needs the physical guide. It covers stops and guided contacts, not tip-over or loss of balance, where energy is conserved and redistributed. Its margin can be thin, as the test shows. Its inputs are measurements a simulator cannot make: in simulation the claim is exact arithmetic over Estimated inputs and therefore Estimated (D-5), and a claim about a physical robot is a Reality claim with a recorded no-claim until bench data are imported (§30). Tier 2 is abstraction-based reachability, and the reduction of a robot to four states is an assumption that is monitored, not proved. Tier 3 is Tested: no full-order certificate exists, sum-of-squares certificates are confined to reduced-order templates, δ₁ needs independent hidden-state labels because a monitor cannot label its own silent breaches, the bound does not survive a shift that moves δ₁, and passivity establishes neither collision avoidance nor fall avoidance.
  • Foundations. fs-sos and fs-ivl for templates and enclosures; the energy terms are those of the ledger of §29.
  • Test. Budget arithmetic, with the labels of §22.11: 8 kg at 0.4 m/s is 0.64 J; a 20 W drive over a 25 ms cutoff adds 0.50 J; the external work of gravity on an 8% slope over the 40 mm stroke is 8 × 9.81 × 0.040 × 0.08 = 0.25 J; a series spring stores 0.10 J; the total is 1.49 J against an absorber of 50 N over 40 mm, which is 2.00 J; the largest admissible cutoff delay is (2.00 − 0.64 − 0.25 − 0.10)/20 s = 50.5 ms, or 45.5 ms with a further 0.10 J of reserve. Exclusion: lifting 8 kg over a 12 mm sill needs 8 × 9.81 × 0.012 = 0.94176 J, above a 0.90 J budget for every wheel radius; 0.05 J of approach kinetic energy removes the exclusion, so approach energy is a term of the budget and not a footnote. Omitted-term control: a budget without the gravity term over the stroke is rejected by the checker. Filter: with R = I, u_π = (1, 0), box [0, 1]² and the row u₁ + u₂ ≥ 1.5, the breakpoint method gives (1, 0.5). Counterexample: the projection that ignores the box gives (1.25, 0.25), which leaves the box, and clipping it gives (1, 0.25), which violates the row. Quantifier control: a certificate proved in the order ∀w ∃u is rejected.
  • Pilot and ceiling. Pilot: the tray-cart stop fixture for tier 1, and one planar balance template with planted breaches for tier 3. Falsifier (TARGET): any accepted budget with an omitted source, or any filter output that fails its KKT check without invoking the fallback. Ceiling: safety evidence; no speed is claimed. Fallback: tier 3 drops to monitoring only, and tier 1 stands on its own.
  • Tier. F. The inequality of tier 1 is S mathematics. The tube tables of tier 2 are M, at M8 (§22.12.5).

C-32 Region certificates and dual witnesses of infeasibility

  • Object. A region certificate for one constraint c(θ) ≤ 0 on a box B of design parameters is an outward-rounded enclosure [c](B). If its upper end is at most 0 the box is feasible for that constraint; if its lower end is above 0 the box is infeasible; otherwise it is undecided and is bisected. Enclosures come from interval, affine or Taylor-model arithmetic, and where c is monotone in a parameter, evaluation at corners is exact. Certificates are issued per constraint, with bisection confined to a split set of about six parameters; a family answer is assembled from them by products, monotonicity and witnesses (rules 3 and 4 of C-17), not by paving the joint box. An infeasibility witness for a linear relaxation {x ≥ 0, M·x = r} is a dual vector y with Mᵀy ≥ 0 and rᵀy < 0 (Farkas), and checking it is two exact rational matrix–vector products. For a conic relaxation {x ∈ 𝒦, M·x = r} the witness is y with Mᵀy ∈ 𝒦* and rᵀy < 0; only a strict witness is accepted, and where none exists the verdict is unknown. The same dual object is the separating witness returned when a task wrench lies outside a body's attainable set, so a skill is refused before any training (C-13). For a planar contact template with points qᵢ mapped to feet pᵢ = A·qᵢ + d, load W and first moment P, write B = A⁻¹ and e = −B·d. Then Σfᵢ = W and Σqᵢ·fᵢ = B·P + e·W, which with 0 ≤ fᵢ ≤ cᵢ is linear in the inverse geometry (B, e), the ratings c and the forces. The feasible family is the projection of a polyhedron, equivalently at most 2·V·C(m, 2) support inequalities of a wrench zonotope for m contacts and V load vertices.
  • Replaces. A static margin computed for one design; dense sampling presented as a universal claim.
  • Payoff. A whole family of stance dimensions and force ratings from one solve, with a boundary design and its force witnesses, or the load vertex that defeats it. A refusal that cites a separating vector tells the agent which constraint binds.
  • Honest limits. Isotropic paving is out of reach: 10⁴ boxes are 13 bisections, less than one cut per axis in 20 dimensions, where a uniform box keeps 0.64 of each side (0.41 in 10 dimensions). Taylor models move that barrier very little. A static projection certifies neither run-up nor landing nor recovery. A typed result states its authority model, because an inclusion proved for independently commanded forces is false for a passive suspension. A support-polygon test with a total-capacity check is no substitute: FACT (planning pilot, to be re-run) is that it accepted 1,596 bodies the exact model rejects. A lifted linear program answers the stance family equally well (D-17).
  • Foundations. fs-ivl has outward-rounded intervals, affine forms, multivariate Taylor models with subdivision, and interval Newton and Krawczyk operators; it has no paving driver and no contractors. fs-sos exists. FrankenSymPy has exact rational linear algebra with certificates.
  • Test. Stance family: 400 N on four point feet at (±a, ±b) with a = 1/3 m; the centre of mass anywhere in a rectangle of half-sizes 150 mm and 75 mm; each foot commanding any force in [0, 160] N. At the positive corner the two moment equations give f₊₊ − f₋₋ = 90 + 15/b, so the minimum half-width is b = 3/14 m, with forces (160, 130, 110, 0) N in the order [++, +−, −+, −−]. Dual witness at b = 1/5 m: half the x-moment equation divided by a plus half the y-moment equation divided by b gives f₊₊ − f₋₋ = 165 N, against f₊₊ ≤ 160 N and f₋₋ ≥ 0. Authority counterexample: at b = ¼ m active allocation gives (155, 135, 105, 5) N and equal passive springs give (175, 115, 85, 25) N, above the cap. Sign control: with +z up the support torque is (P_y, −P_x, 0), so P = (60, 30) N·m with the forces above gives (30, −60, 0) N·m, and a packet that passes (60, 30) as the torque is rejected.
  • Pilot and ceiling. A 12-parameter quadruped box (three link lengths, two hip offsets, three masses, gear ratio, motor mass, body length and width) with static torque in three stances, reach and self-clearance, paved with 10⁴ boxes four ways: plain intervals, affine forms, contractors, per-constraint decomposition. Kill (TARGET): the best arm leaves more than 90% of the volume undecided, or more than 95% of the decided volume falls to a single monotone bound. Ceiling: evidence quality and robustness to tolerances; no speed is claimed. Fallback: pointwise checks at proposed designs.
  • Tier. F.

C-33 Clearance is certified from both sides

  • Object. For a planar base the free configuration space 𝒞_free is a subset of SE(2), with coordinates (x, y, ψ). For each fixture mode (a door open, a door closed) two cubical complexes are built on one grid. The inner complex 𝒞_in contains a cell only if every pose in the cell is collision-free for the envelope inflated by the cell's pose radius. The outer complex 𝒞_out omits a cell only if every pose in it collides for the envelope deflated by the same radius. Then 𝒞_in ⊆ 𝒞_free ⊆ 𝒞_out. A connected path from start to goal in 𝒞_in is a feasibility witness for every robot whose swept footprint fits the envelope. Disconnection of start and goal in 𝒞_out is an impossibility certificate. Over a family of envelope widths the complexes are nested, and one union–find pass over the width filtration finds the width at which start and goal first connect and names the bottleneck cell, a doorway or a corridor. For a width between the inner and outer critical widths the answer is unknown, and that band is the stated resolution of the certificate. An envelope extension carries overhead clearance and step-over height. The complexes are stored as .fclear.
  • Replaces. A route check for one nominal footprint; a clearance test by one scalar radius.
  • Payoff. A two-sided answer with a named bottleneck, reused across many width queries, and a refusal that says which doorway to change, which is the input of the retrofit search of §19.
  • Honest limits. The resolution band follows from cell size and heading bin and is reported, never assumed; 48 heading bins give a half-bin of 3.75°. The complexes certify geometry only: not steering, traction, reach or perception, which is why C-28 demands a witness from the candidate's own body. Clearance of a legged body in SE(3) is not covered.
  • Foundations. fs-topo (connectivity) and fs-motion (swept charts) exist.
  • Test. Ladder: a thin rod of length L turns a right-angle corner between corridors of width a exactly when L ≤ 2√2·a. Counterexample to a scalar radius: the circumscribed-disc test, L ≤ a, refuses every rod between a and 2.83·a although each passes, and the inscribed-disc test accepts rods longer than 2.83·a, which jam. Doorway: a rectangular body of width w crosses an opening of width D head-on; the inner certificate holds below D minus the band and the outer exclusion above D plus the band. Planted wall: closing a gap by one cell flips the outer verdict. On each reference interior: no false route and no false impossibility.
  • Pilot and ceiling. Pilot: the ladder and doorway fixtures and one home interior at two grid resolutions. Falsifier: one false route or one false impossibility. Ceiling: route questions answered without rollouts; the band, not the method, limits what is decided. Fallback: the route graph for a nominal footprint.
  • Tier. F.

C-34 Linkage synthesis: an exact bounded lane and a continuation lane

  • Object. Lane 1, exact and bounded. (a) Three-pose planar dyads: a moving pivot with positions P₁, P₂, P₃ in the three poses has its fixed pivot O at their circumcentre, the solution of the 2×2 rational system 2·(Pᵢ − P₁)·O = ‖Pᵢ‖² − ‖P₁‖² for i = 2, 3, with degenerate cases split by the rank of its determinant. (b) Five-pose Burmester problems and four- and five-bar templates: loop-closure or Study-quadric polynomials solved inside the caps of the real solver (C-11), with a saturation equation s·d(x) − 1 = 0 that excludes zero-length and collinear roots. (c) For every candidate a circuit and branch certificate: real roots isolated by interval contraction; one assembly circuit that traverses all target poses in order; a loop-Jacobian determinant of constant sign along the path, so no branch point is crossed; no self-collision. Lane 2, continuation, on the CPU in double precision. A generic member of a mechanism family is solved once, by monodromy with a trace test, and stored. A new task is a parameter homotopy H(z, t) = F(z; (1 − t)·p₀ + t·p₁) tracked from the stored solutions by a predictor–corrector with endgames. Each root is certified by Smale's α-test in exact rational arithmetic, α(f, z) < (13 − 3√17)/4 ≈ 0.157671, which proves that Newton's iteration from z converges quadratically to a root within twice the Newton step; distinctness follows from disjoint balls, non-reality from disjointness with the conjugate ball, and reality from the robust test α(f, z) < 0.03 with ‖z − Re z‖ < 1/(20·γ(f, z)), which shows that z and its conjugate converge to one root. A result is Complete only when the certified count equals an independent generic count with no lost path; otherwise it is Partial(certified, lost).
  • Replaces. Random mutation of link lengths; multistart numerical closure with no statement of branches.
  • Payoff. Constructive design of parallel legs, ankles and steering linkages. The certificate catches circuit and branch defects, which are a real class of error in linkage design.
  • Honest limits. Three-pose synthesis has textbook closed forms, so the value of lane 1 is the certificate and not the solve. Lane 1 lives inside 8 variables, 64 equations, degree 256, 4,096-bit coefficients and zero-dimensional ideals; unbounded elimination for a whole robot is not attempted. In lane 2 an α-test proves a nearby nonsingular root and nothing about completeness; no sibling has a homotopy solver; the generic solve for the nine-point problem is a very large one-time computation; path tracking needs double precision, so there is no GPU lane; and certificates are checked by an exact rational checker, never inside a proof kernel.
  • Foundations. FrankenSymPy fsym-polys, real_rur and CertifyRootBox; fs-ivl.
  • Test. Circumcentre: P = (1, 0), (0, 1), (−1, 0) give O = (0, 0) and radius 1; collinear positions are reported as degenerate. Grashof: links of length 4 (ground), 1 (crank), 3.5 (coupler) and 3 (rocker) satisfy 1 + 4 ≤ 3.5 + 3, so the crank turns fully and the two assembly circuits are disjoint; a candidate whose target poses lie on different circuits is rejected. Known counts for lane 2 (FACT, literature, source register): at most 4 Burmester point pairs for five poses, 16 solutions of general 6R inverse kinematics, 40 of the Stewart–Gough forward problem, and 4,326 four-bars through nine points.
  • Pilot and ceiling. Lane 1: 24 dyad and four-bar templates with planted circuit and branch defects; falsifier: one defect certified as valid. Lane 2: the Stewart–Gough forward problem on the CPU; kill (TARGET): more than 0.1% of paths lost, or a certified count below 40 on a generic instance. Ceiling: better proposals for one mechanism family at a time. Fallback: lane 1 with multistart recovery on the CPU, labeled Partial.
  • Tier. F for lane 1; M for lane 2.

C-35 Structure and life: topology, fatigue, tolerance

  • Object. Three computations turn simulated loads into a part.
    1. Topology optimization of a link. Densities ρ_e ∈ [ρ_min, 1] on a mesh give stiffness K(ρ) = Σ ρ_eᵖ·K_e with p = 3; minimize the compliance c = FᵀU subject to K(ρ)·U = F and Σ ρ_e·v_e ≤ V*. The sensitivity is ∂c/∂ρ_e = −p·ρ_eᵖ⁻¹·u_eᵀK_e·u_e, with no extra solve because the problem is self-adjoint, and a density filter fixes the length scale. Load cases are the envelope of interface wrenches recorded by the energy ledger over qualified missions, not an assumed static load.
    2. Cumulative fatigue damage. Stress histories at gauges are reduced to cycles by rainflow counting, and damage accumulates by the linear rule D = Σ nᵢ/N(Sᵢ), with N(S) from the material's S–N curve (Basquin: N = (S/S₀)⁻ᵐ). The residue of open half-cycles is carried between windows.
    3. Tolerance allocation. For a functional dimension f(x) with sensitivities aᵢ = ∂f/∂xᵢ from one adjoint pass over the kinematic chain, the worst-case stack is Σ|aᵢ|·tᵢ and the statistical stack is (Σ aᵢ²·tᵢ²)^½. Minimizing the cost Σ kᵢ/tᵢ under a stack limit gives tᵢ ∝ (kᵢ/aᵢ²)^⅓ for the statistical stack and tᵢ ∝ (kᵢ/|aᵢ|)^½ for the worst case.
  • Replaces. Links as boxes with a density; safety factors chosen by habit.
  • Payoff. A build packet whose parts are sized by the loads the robot met on its missions, with the life and the tolerance cost stated.
  • Honest limits. FACT (source register, to be re-read): topology optimization makes links 7 to 30% lighter than engineered parts, which is about 2 to 8% of robot mass on the one quadruped with a published mass breakdown; it improves the output and not the time to a decision. Fatigue and wear laws are empirical, so every life figure is Estimated, and the linear rule ignores load order. A structural result holds for the load envelope it was given; an edit that changes the envelope invalidates it (D-11).
  • Foundations. fs-topopt (about 69k lines) and fs-topols; the rainflow counter of fs-material (RainflowMiner, which fs-solid::fatigue imports), which retains rainflow residues across calls and warns that short windows do not prove stabilization; fs-toleralloc (about 9.6k lines).
  • Test. Two-bar truss: for a load at the apex of a symmetric two-bar truss the volume at fixed stress is proportional to 1/(sin θ·cos θ), least at 45°. Damage: with m = 3, 10⁶ cycles at an amplitude of life 2·10⁶ give D = 0.5; a further 10³ cycles at five times the amplitude, of life 16,000, add 0.0625, so 0.1% of the cycles carry 11% of the damage. Residue counterexample: the history 0, 10, 0 split into the windows [0, 10] and [10, 0] holds one full cycle of range 10, and a counter that drops residues at window ends counts none. Allocation: two dimensions of equal sensitivity with cost weights 1 and 8 under a statistical limit of 0.1 mm get tolerances in the ratio 1 : 2, namely 0.0447 mm and 0.0894 mm.
  • Pilot and ceiling. One link of a reference quadruped through all three computations. Falsifier (TARGET): a mass saving below 7% at equal stiffness and peak stress, or a damage figure that changes by more than 5% when the window length is halved. Ceiling: f_L·s ≤ 0.27 × 0.30 ≈ 8% of robot mass on that quadruped (§31.2). Fallback: catalog sections with a beam check.
  • Tier. F.

C-36 The trapezoidal variational step and the discrete nonholonomic step

  • Object. Variational step. For a rigid body with inertia 𝕄, potential V and applied wrench u, take the discrete Lagrangian L_d(g_k, g_k₊₁) = (h/2)·ξ_kᵀ𝕄ξ_k − (h/2)·(V(g_k) + V(g_k₊₁)) with g_k₊₁ = g_k·cay(h·ξ_k). Let Dcay_x be the left-trivialized differential of the Cayley map, cay(x)⁻¹·δcay(x) = Dcay_x(δx). For x = (ω, v) its inverse is

    (Dcay_x)⁻¹ = [[ I + ½·ω̂ + ¼·ω·ωᵀ ,  0        ],
                  [ ½·v̂ + ¼·ω̂·v̂      ,  I + ½·ω̂ ]]
    

    Write f(g) for the body-frame wrench of the potential. The discrete momentum at node k is μ_k = (Dcay_{−hξ_k})⁻ᵀ·𝕄ξ_k − (h/2)·f(g_k), and the discrete Euler–Poincaré equations are the map (g_k, μ_k) ↦ (g_k₊₁, μ_k₊₁) in four steps.

    1. Half kick: μ⁺ = μ_k + (h/2)·(f(g_k) + u_k).
    2. Implicit solve: find ξ_k with (Dcay_{−hξ_k})⁻ᵀ·𝕄ξ_k = μ⁺, by Newton's method started from the previous ξ, with the closed-form 6×6 Jacobian.
    3. Drift and transport: c = cay(h·ξ_k), g_k₊₁ = g_k·c, μ° = Ad_cᵀ·μ⁺.
    4. Half kick: μ_k₊₁ = μ° + (h/2)·(f(g_k₊₁) + u_k₊₁).

    Step 3 says that the spatial momentum Ad_g⁻ᵀ·μ is unchanged by the drift, which is the discrete Noether theorem. The map is a symmetric composition of kick, drift and kick, so it is time-reversible and of second order. Nonholonomic step. Rolling constraints are rows A(q)·v = b(q, t) in the velocity-level solve of C-06. With ideal rolling the step takes the unconstrained velocity v* to v⁺ = v* − M⁻¹Aᵀ·(A·M⁻¹·Aᵀ)⁻¹·(A·v* − b), the projection onto the constraint distribution that is orthogonal in the kinetic-energy metric; this is the discrete Lagrange–d'Alembert principle, in which constraint forces do no work on admissible velocities. With traction limits each row's multiplier is confined to the friction cone of its contact, so rolling passes into sliding when traction saturates. Wheel types differ only in their rows: zero lateral slip for a fixed or steered wheel; a free roller direction for an omnidirectional or mecanum wheel; a prescribed belt speed b = v_belt(u) on each grouser patch of a track.

  • Replaces. A midpoint step followed by a projection; lateral penalty springs standing in for rolling.

  • Payoff. For a body in a potential: no secular energy drift over long horizons, exact momentum along the symmetries the potential keeps, and a reversible map that an adjoint can run backwards. For wheels: exact stick, slip only when the cone says so, and the ideal-rolling oracle of C-07 as a limit of the same solve.

  • Honest limits. The four steps are derived for one rigid body. For an articulated tree the mass matrix depends on configuration, a kick–drift splitting is no longer the variational step, and no symplectic claim is made (C-05). Dissipative contact ends energy conservation by design. Step 2 is implicit, so the lane serves the referee, the strict CPU profile, adjoints and evaluation, and the throughput tiers keep the semi-implicit default. A nonholonomic system conserves energy and does not, in general, conserve the momentum of its symmetry group, so the momentum test of C-04 is not applied to it.

  • Foundations. fs-time has a discrete Euler–Poincaré step on SE(3); fs-mbd::planar_drive is kinematic only.

  • Test. Differential: the matrix above times a finite-difference left-trivialized differential is the identity, and its rotation block inverts to 2/(4 + ‖ω‖²)·(2I − ω̂). Free asymmetric body: spatial momentum constant to round-off, energy error bounded and divided by four when h is halved, and the map run backwards returns the initial state to round-off. With gravity: vertical angular momentum and horizontal linear momentum constant to round-off. Negative control: evaluating step 2 with the differential at +hξ_k leaves momentum exact, because step 3 conserves it for any ξ, and destroys the energy bound; the test therefore detects the error by energy and reversibility, never by momentum. Chaplygin sleigh with mass m, inertia I about the centre of mass and offset a from the blade: v̇ = a·ω² and ω̇ = −m·a·v·ω/(I + m·a²); the energy ½·m·v² + ½·(I + m·a²)·ω² is constant, since m·v·(a·ω²) − m·a·v·ω·ω = 0, while the direction of linear momentum turns. Projection: ‖v⁺‖_M ≤ ‖v*‖_M whenever b = 0. Skid-steer control: four fixed wheels as ideal rows return ω = 0 under any command, and with cone-bounded rows the base turns with its lateral multipliers on their cones.

  • Pilot and ceiling. For the variational step on the batch tiers: cost of step 2 against the semi-implicit step at matched energy error on one free body and one heavy top. Kill (TARGET): more than twice the cost at matched accuracy, in which case the step stays in the referee and the strict profile only. Ceiling: energy fidelity of long rollouts; no throughput is claimed.

  • Tier. F for the variational step; S for the nonholonomic rows.

C-37 The four-dimensional contact cone and joint-level rows

  • Object. A contact patch transmits a normal impulse λ_n, two tangential impulses λ_t and a spin moment impulse λ_s about the normal. With an effective patch radius r, the admissible set is the cone 𝒦 = {‖(λ_t1, λ_t2, λ_s/r)‖ ≤ μ·λ_n}, a linear image of the second-order cone in ℝ⁴ that drops into the Cone abstraction of C-06. Its dual is {μ·‖(v_t1, v_t2, r·ω_n)‖ ≤ v_n}. Maximal dissipation makes the friction impulse oppose the generalized sliding velocity (v_t, r·ω_n), which couples sliding and spinning: a spinning contact resists sliding less. The radius r is a property of the pressure distribution, 2R/3 for uniform pressure on a disc of radius R and 3πR/16 for a Hertzian distribution. Nonsmooth effects inside a joint are rows of the same solve. A hard stop is a unilateral row on the joint coordinate. Coulomb stiction is a row whose multiplier lies in [−τ_s, τ_s], with Stribeck dependence on speed as a parameter update between steps. Gear backlash is the pair of unilateral rows −β/2 ≤ q_out − q_motor/N ≤ β/2, each with a non-negative multiplier.
  • Replaces. Torsional friction with its own coefficient and no coupling; friction and backlash buried in an actuator card.
  • Payoff. One cone for sliding and spin. Drivetrain stiction and lost motion interact with ground contact in one solve, so backlash that grows with wear changes a gait in the model that found the gait.
  • Honest limits. The ellipsoidal cone approximates the exact sliding–spinning law of a finite patch, and r is a card parameter, Estimated unless calibrated. Rolling resistance and tactile micro-patches are separate rows and not part of this cone.
  • Foundations. fs-contact elliptic friction; fs-tribo friction laws.
  • Test. Coupling: at v_t = r·ω_n the tangential friction magnitude is μ·λ_n/√2, where an uncoupled model gives μ·λ_n. Pure spin: the limiting moment is μ·λ_n·r, which for uniform pressure is (2/3)·μ·N·R. The projection identities of T-07 hold for the four-dimensional cone. Stiction: under a torque ramp k·t a joint with stiction τ_s first moves at t = τ_s/k. Backlash: under a slow triangular motor motion of reflected amplitude A > β/2, with the output held by friction, the output amplitude is A − β/2 and the hysteresis loop has width β.
  • Tier. S.

C-38 Actuators are port-Hamiltonian with a thermal node

  • Object. A component with stored energy H(x) obeys ẋ = (J(x) − R(x))·∇H(x) + G(x)·u and y = G(x)ᵀ·∇H(x), with J skew and R positive semidefinite, so Ḣ = uᵀy − ∇HᵀR∇H: stored energy changes by port power minus dissipation. A motor axis has flux linkage φ = L·i and rotor momentum p = J_r·ω as states, energy H = φ²/(2L) + p²/(2J_r), a gyrator of modulus k between them (k_t = k_e = k in SI units), and dissipation R_w·i² + b·ω²: L·di/dt = V − R_w·i − k·ω and J_r·ω̇ = k·i − b·ω − τ_load. A gear is a transformer. A driver adds a current limit and a voltage ceiling; a battery adds an open-circuit voltage, an internal resistance and polarization states. Three electrical modes are distinguished, motoring, regenerative braking and dissipative braking, and the driver card says whether recovered energy reaches the battery, heats a shunt or is clipped. The thermal node has temperature T_w and heat capacity C, and its energy balance is the model:

    C·Ṫ_w = P_loss − G_th·(T_w − T_amb)
    

    where P_loss is the dissipation assigned to the node and includes the copper loss i²·R₀·(1 + α·(T_w − T₀)). Heat held in the node is stored energy, U = C·T_w, and H + U changes only by port power and by the heat G_th·(T_w − T_amb) that leaves to ambient. The entropy balance is derived from dU = T_w·dS and is not a second model: the node gains Ṡ = P_loss/T_w − G_th·(T_w − T_amb)/T_w, the ambient gains G_th·(T_w − T_amb)/T_amb, and the total production is

    σ = P_loss/T_w + G_th·(T_w − T_amb)² / (T_w·T_amb)   ≥ 0   whenever P_loss ≥ 0
    

    Temperature is the state and entropy is a reported quantity. At constant current the node is linear, Ṫ_w = a·T_w + c with a = (i²·R₀·α − G_th)/C: for a < 0 it settles, and for a > 0, which is i above √(G_th/(R₀·α)), the temperature runs away exponentially.

  • Replaces. A torque limit and an efficiency number.

  • Payoff. The energy ledger closes per mechanism, per episode and at the earliest offending event, so a wrong gear ratio or frame transform shows as energy appearing from nowhere even when the final return looks excellent. A thermal cliff is a predicted failure with a critical current.

  • Honest limits. The second-law check has content only as a check on the sign of each assigned loss: it catches a negative loss from a sign error in a braking mode, and it cannot fail for a correct model. Lumped thermal parameters are card values, Estimated unless calibrated. Interconnections with algebraic constraints are deferred in the foundation (C-12).

  • Foundations. fs-phs (interconnect_mapped), fs_ports, fs-control motor loops and fs-thermal exist.

  • Test. Electrical step: with R_w = 1 Ω and L = 10 mH the current of a locked rotor rises as (V/R_w)·(1 − e^(−t/τ)) with τ = 10 ms. Ledger: supplied = stored change + dissipated + exported, to tolerance, in all three modes. Double-count control: a ledger that books heat entering the node as both stored and lost shows a deficit equal to that heat and is flagged. Runaway: with R₀ = 0.1 Ω, α = 0.0039 K⁻¹ and G_th = 0.5 W/K the critical current is √(0.5/0.00039) ≈ 35.8 A; below it the simulated temperature follows the closed-form approach to T_amb + i²·R₀·(1 + α·(T_amb − T₀))/(G_th − i²·R₀·α), above it the closed-form growth, and the time to a limit temperature is computed from the fixture's own parameters at the gate. Sign control: a regenerative mode with a negated copper loss gives σ < 0 and is rejected.

  • Tier. S.

C-39 The value of an experiment, and the design of a probe

  • Object. An experiment (more episodes at a rung, an escalation to the referee, a bench measurement, a batch on a real robot) is valued by what it can change. For two finalists with posterior difference Δ ~ N(m, s²), an experiment that removes variance s̃² from Δ has expected value of sample information EVSI = s̃·[φ(z) − z·Φ(−z)] with z = |m|/s̃, in the units of the objective; with more finalists the same quantity is the expected reduction in the opportunity loss of the chosen design. Experiments are ranked by this value per unit cost, in GPU-second equivalents at a declared exchange rate, and a campaign stops when no ratio clears the budget price. The variance components come from the ledgers: sampling, tier bias and reality gap. Probe design applies the same idea to physical mechanisms. Keep the set ℳ of mechanisms compatible with what is known. Partition ℳ by the design decision each mechanism implies. Among realizable interventions (fixture compliance, pad radius, sensor position, command waveform, exposure time, preload) choose the least costly one whose sets of possible readings, over the admitted nuisance intervals, are disjoint between blocks. Where reading sets still overlap, return two witness mechanisms with opposing design margins. Where all of ℳ implies one decision, skip identification. Measuring the target directly at mission conditions is always an admitted probe. A probe is compiled through the same power, frame, observation and contact interfaces as a body and returns a simulated experiment, a bill of fixture parts and a measurement contract.
  • Replaces. A fixed order of check, simulate, train, referee; fitting a richer curve where a different experiment is needed.
  • Payoff. Cheap episodes are bought until only tier bias is left, which only the referee shrinks. A measurement is requested when, and only when, it can change a design decision (mission.distinguish).
  • Honest limits. The value model only ranks experiments. Verdicts come from C-15, C-25 and C-26, so a wrong variance model costs efficiency and never validity. FACT (source register, to be re-read): stopping and elimination gain a factor of 2 to 5 when candidates are separated and about 1 otherwise. A probe certificate is conditional on ℳ. FACT (planning pilot, to be re-run): a probe synthesized for three admitted material laws chose correctly in 675 of 675 in-class cases, a fourth law it had not been given reversed all 225 held-out decisions, direct measurement at mission dwell was right in 900 of 900, and a hand-written expert rule tied the generator.
  • Foundations. fs-voi has a ranking-flip probability and a knowledge gradient on a finite Gaussian menu; fs-uq has experimental-design routines. Neither models a probe.
  • Test. Zero value: the value is 0 when s̃ = 0, increases in s̃ and decreases in |m|, and a campaign in which no experiment's ratio clears the price stops and decides. Probe fixture: the friction laws μ₁(v) = 0.5 and μ₂(v) = 0.3 + 0.4·v, with v in m/s, agree at 0.5 m/s and imply opposite designs at the mission speed of 1.5 m/s (0.5 against 0.9). A probe at 1.0 m/s reads 0.5 or 0.7 and separates them exactly when the reading error is below 0.1; a probe at 0.5 m/s separates nothing at any precision. Omitted-mechanism control: a third law that follows μ₁ up to 1.0 m/s and departs later defeats the 1.0 m/s probe, and the tool must state that its certificate is conditional on the two laws it was given.
  • Pilot and ceiling. Pilot: thirty registered experiments on the first mission slice. Falsifier (TARGET): stated 80% intervals cover fewer than 65% or more than 92% of outcomes, or the direct-measurement comparator beats a synthesized probe at equal cost. Ceiling: the factor of 2 to 5 above, at the finalist stage only. Fallback: the fixed order of experiments.
  • Tier. S for the closed form and the ranking; F for probe synthesis.

C-40 Dominance is unreachability in a product system

  • Object. The question is whether replacing A by B can make a formerly successful mission fail. For two closed loops with fixed controllers, a regression is a shared world input in which A succeeds and B fails. The product system runs both plants on the same exogenous scene, payload and clock law, with a joint terminal monitor on the pair of outcomes. If the pair (success, failure) is unreachable over an enclosure of every admitted joint execution, with progress and nonempty executions, B dominates A on that cell. A concrete paired trace that reaches it is a counterexample. An outer enclosure that intersects it triggers a witness search or unknown. Only declared shared inputs are coupled, and every other branch choice varies independently inside the enclosure. Shared inputs are compiled at physical coordinates: one space-indexed material field read at each robot's actual contact point, and one latent lighting state seen by each camera from where it is. The answer carries the paired verdict and each design's absolute verdict.
  • Replaces. Computing two success sets and comparing them; pairing by seed and assuming the worlds match.
  • Payoff. A replacement is cleared without either design having a guarantee, by a relation that can be far cheaper to establish than either success set.
  • Honest limits. A relative verdict of no loss does not establish that either design meets the mission. One mislabeled branch invalidates the certificate. A conventional reachability tool applied to the same product model is the comparator (D-17), and the only advantage claimed is the lowering that keeps spatially coupled disturbances coupled. A controller retuned per body needs its own information and budget contract.
  • Foundations. fs-ivl for enclosures. Nothing builds the product.
  • Test. A surface parameter z ∈ [0, 1]; A succeeds when z ≥ 3/5 and B when z ≥ 2/5. Neither is guaranteed. Under the shared z the pair (success, failure) is unreachable, and B adds the interval [2/5, 3/5), a gain of 1/5 under a uniform law. Counterexample: enclosing the two outcomes separately admits all four pairs, including the impossible one. Coverage control: a product whose internal branches are wrongly tied reaches only (0, 0) and (1, 1), whose projections cover both marginal outcome sets, and so hides a reachable (1, 0); the checker must demand joint coverage. Coupling counterexample: two tires on different paths over a patterned floor meet different friction at the same tick, so a product coupled by tick and not by position reports a false regression or hides a true one.
  • Pilot and ceiling. Pilot: one contact transition, a sole exchange over a split-grip strip, against a reachability tool on the same product model. Falsifier: one mislabeled draw, or no cell closed that per-case replay would not close as cheaply. Ceiling: paired decisions on cells where the relation closes; elsewhere, per-case replay. Fallback: the paired statistical comparison of C-15 with position-indexed fields.
  • Tier. F.