FrankenRobotics

Counterexample catalogue

30,146 words35 subsections35 tablesPlan version 1.1

On this page35
N.1 How to read the catalogueN.2 Part 0. Document controlN.3 §2 The ten-fold thesisN.4 §4 Bets, each with its falsifierN.5 §8 The seven claims and the claim productN.6 §9 DoctrineN.7 §10 The constructionsN.8 §11 ConventionsN.9 §12 Lemma: proofs, certificates, the offline auditorN.10 §13 Marrow: the algebraic coreN.11 §14 Skeleton: design language, modules, archetypes, preflightN.12 §15 Sinew: actuators, transmissions, powerN.13 §16 Kinesis: dynamics on three tiersN.14 §17 Phylum: families of bodies in one batchN.15 §18 Traction: collision, contact, wheels, tracks, terrainN.16 §19 Habitat: scenes, living worlds, clearance, retrofitsN.17 §20 Sensorium: sensors, clocks, observabilityN.18 §21 Spark: GPU backends and the kernel toolchainN.19 §22 Reflex: estimation, control, gaits, skills, shieldsN.20 §23 Cortex: the gym, learning, family policies, inheritanceN.21 §24 Arena: tasks, requirements, fixtures, metrics, qualificationN.22 §25 Augur: mission queries and inverse designN.23 §26 Nemesis: adversarial worlds and rare failuresN.24 §27 Autopsy: counterfactual debuggingN.25 §28 Atelier: the studio loop, analyses, comparison, lineage, cascade, decision coresN.26 §29 Chronicle: telemetry, replay, evidenceN.27 §30 Ground: calibration against realityN.28 §31 Foundry: structure, manufacture, lifecycleN.29 §32 Tether: CLI, daemon, MCP, dashboard, viewerN.30 §33 Suite consumptionN.31 §34 Workspace, crates, formatsN.32 §35 Numerics and determinismN.33 §36 The performance programN.34 §37 Safety, security, privacyN.35 Seeding the negative-control registry

The plan's rule is that a plausible shortcut ships with the smallest hand-checkable case that breaks it (§3, §9). This appendix compiles every such case that a chapter states: 384 entries, numbered CX-001 to CX-384, grouped by chapter in the order of the outline. Each entry is the seed of at least one record in the negative-control registry (§38.11): the shortcut is planted as a mutation or as an input, and the gates of the rule it protects must catch it.

N.1 How to read the catalogue

Column Content
CX The entry's number, append-only (INV-GAUNT-07)
The tempting shortcut The argument or implementation choice that looks right
The smallest case that breaks it The case, with its numbers, as the chapter states it. "No numeric case is given in the chapter" marks an entry whose refutation is stated in words only
The rule it protects The invariant, decision, proof obligation, refusal code, gate or construction rule that exists because of the case
Defined in The subsection or construction that states it. The mark "≡ CX-nnn" means the entry uses the same fixture as an earlier entry in another chapter

Rules.

  1. The same case may appear in more than one chapter, each time protecting a different rule: the two-latch task protects a construction in §10, an analysis in the body chapters and the controller in §22. Each statement keeps its entry, because the registry holds one control per protected rule and each must be caught by that rule's gates.
  2. A case is carried with the chapter's numbers. Where a number is FACT from a planning pilot or from a sibling's source, the entry says so in its text or its chapter does; such a case is re-run in this repository before it is registered as a control.
  3. An entry with no numeric case is an obligation on its chapter: a control needs a concrete planted defect or input (N.35).
  4. A counterexample found in use (a false certificate, a false promotion, a withdrawn result) is appended here and becomes a permanent control (§25.5.5, §38.11).

N.2 Part 0. Document control

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-001 Run a speed comparison first and account for the shared work afterwards A composed solver took 1.345× the time of a specialized one (1.088× cold). The specialized batch held a residual of 575.7 µs that the solver does not touch (parsing, assembly, checking, serialization and harness, not separately timed), so no solver could have shown more than about 1.46× (842.8 ÷ 575.7): the test could not have confirmed the claim it was run to test The ceiling implied by the work both arms share is computed before a speed comparison is locked, and the test is refused if the ceiling is below the claimed ratio (D-10) §0.7; §2.3 item 6; §2.5
CX-002 Treat a closed bead as an accepted capability A sibling project (FrankenMining) recorded 87 beads closed within 12 seconds with one shared close reason, serving figures from a stand-in A bead closes with a typed reason that cites its own test, and gates require a live-dependency proof (§38) §0.7

N.3 §2 The ten-fold thesis

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-003 Declare ten-fold when the point estimate is at least 10 on every brief A draft rule of that form confirmed a true ratio of 10 in at most 18% of simulated campaigns The decision rule is specified in §39 on a pooled ratio of restricted mean times, and its power against a true ratio of 10 is computed before the sealed suite is opened; the result on the sealed suite is a finite-suite result, and a population claim needs at least 32 independent mission families (§39.20) §2.1
CX-004 Seek the ten-fold in a faster simulator step At a fixed sample count an infinitely fast environment step speeds training by at most 1/(1 − s): about 7.7× for a rough-terrain humanoid (s = 87%), 6.7× for a hand, 1.9× for a cart-pole, and about 1.4× from physics alone on another stack Engine throughput is a parity requirement and not the source of the ten-fold (§36) §2.3 item 1
CX-005 Decide one design per agent turn and rely on a fast cycle With the same agent latency t in both arms and about 300 s of incumbent training, one design per turn gives at most (300 + t)/t: 3.5–6× for t between 60 and 120 s, and 4.4–7.8× against the 410 s one-card figure, even if the candidate spent no compute at all. A 120 s cycle with no training is 3.0–3.5× an incumbent quadruped cycle of 360–420 s The unit of dispatch is a family: many designs are decided per turn (§17, §28) §2.3 items 2 and 3
CX-006 Rely on pruning bad designs to cut compute per decision Compute ratio C ÷ (c + c_T·f) with C = 410 GPU-s, c = 38 GPU-s, c_T = 410 GPU-s: about 10.8× at f = 0; ten needs f ≤ 0.7%; no f reaches ten if the cheap rung costs more than 41 GPU-s. If 16% of candidates fail trivially, pruning them cuts trainings by at most 1.19× A cheaper cheap rung, many designs per rung, or a cheaper training rung is required; static checks are valued for feedback in seconds, not for pruning §2.2; §2.3 item 4; §2.5
CX-007 Multiply a pruning ratio by a GPU speedup If a fraction f of the strong baseline's matched wall time is improved by a factor r with overhead h, the speedup is at most 1/(1 − f + f/r + h): about 13.5× at f = 0.97, r = 40, h = 0.02, and infinite acceleration of 85% of the time cannot reach ten The three terms are measured on the rival's critical path, and a pruning ratio is never multiplied by a speedup measured on work the pruning already removed (D-10) §2.3 item 5
CX-008 Report speed on the missions that finished If the candidate misses a fraction q of deadlines then R ≤ 1/q: with 12% unfinished the ratio cannot exceed 25/3 ≈ 8.33, and an arm that leaves one mission in eight unresolved cannot show ten-fold Restricted mean time charges the deadline H for an unresolved mission; a failure is a failed cell and never an excluded cell (§8.3 rule 2) §2.1; §2.3 item 7
CX-009 Use a sampling controller as the evaluator because it needs no training The most sample-efficient published controller costs about 4 × 10³ times a policy rollout per simulated second: a battery of 256 twenty-second episodes takes about 86 minutes of a device against about 1.3 s for a policy The sampling controller is a screening rung, a fallback and a source of demonstrations; it never stands in for a trained policy as acceptance evidence, and its own episodes are accepted only under the delivered-controller lane of §22.8 (BET-27) §2.5

N.4 §4 Bets, each with its falsifier

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-010 Midpoint counterexample: admit the midpoint of two feasible designs to an inner set §4 states the control: two feasible designs whose midpoint is infeasible must be excluded from every inner set. Numbers (same case as the C-17 row): (e, W) = (0, 1.9) and (0.9, 1) each need 0.95 N; the midpoint needs 841/800 N from a pair capped at 1 N Region certificates need a witness for the whole cell (BET-20) §4 BET-20; numbers in C-17
CX-011 Coupled-bus fixture: merge two modules because their local summaries are identical §4 states the control: two modules with identical local summaries share one current-limited bus and must not be merged. Numbers (same case as the C-12 row): on a unit-current bus no one-tick schedule is feasible and two two-tick schedules are Campaign quotienting makes no false equivalence; one false equivalence falsifies it (BET-31) §4 BET-31; numbers in C-12
CX-012 Pre-slip aliasing fixture: enforce a safety budget with a monitor alone §4 states the control: two friction regimes with identical histories before first slip, where a monitor alone cannot see the breach in time. §4 gives no numbers for it; the numeric instance is with the energy-budget tier (C-31, §22) The energy-budget claim is enforced by a shield, not only observed by a monitor (BET-25) §4 BET-25
CX-013 Omitted-law fixture: issue a calibration band because every in-family residual check passes A fixture with an omitted law passes every in-family residual check and reverses the decision; in the recorded pilot the probe was correct in 675 of 675 in-class cases and in 0 of 225 on the omitted law The exchangeability alarm or a refusal must fire; a band is issued only within a calibrated family (BET-28) §4 BET-28

N.5 §8 The seven claims and the claim product

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-014 Report a result at the class of its strongest input A design comparison consumes a kernel whose group-membership identity is Certified, a friction coefficient from an interface card field marked assumed (Estimated) and a paired anytime-valid study on the GPU tier under class D2 (Tested). The product is a Design comparison of class Estimated, its weakest input is the friction field, and its reality scope is no-claim The weakest input wins by construction of the claim-product type; no conversion into Proved, no setter for the class, no constructor that takes a class (§8.3 rule 5) §8.2
CX-015 Quantifier-order fixture: treat "for every world some controller works" as "one controller works for every world" A plant in which every build has a command that works and no single command works for all builds: the two queries must receive different answers (BET-19). Numbers (same case as the C-17 row): docking with a late packet, gains 1 and 2, whose required commands differ by ½ Quantifiers are part of the claim; evidence for the easier order is rejected, and the auditor rejects a changed quantifier even when every hash is consistent §8.3 rule 8; §4 BET-19; numbers in C-17, C-19

N.6 §9 Doctrine

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-016 Assume a specialized method beats the generic one On the static-stance family of C-32 a lifted robust linear program and the specialized projection each reached the optimum in one solve (recorded pilot, to be re-run in this repository before a gate cites it) A specialized method names the generic method it must beat; if the generic method ties, the plan says so and ships the generic method (D-17) §9 D-17
CX-017 Decide a strict predicate in unguarded single precision An unguarded f32 screen of 65,536 boundary cases produced 452 false admissions and 23,438 false exclusions; a guarded or exact-integer kernel produced none (recorded pilot, same caveat) Strict predicates, digests and certificate arithmetic run in the exact-integer kernel class, in exact rationals, or in guarded single precision with an exact fallback (D-18; BET-08; §35) §9 D-18; §4 BET-08
CX-018 Leave a model assumption in the prose around a claim Changing one winding feed-forward term in a sampled wheel controller moved a one-tick spectral radius from 1.48 to 0.92 and changed 24 of 156 task labels; admitting one extra hidden gain reversed every feasible label on the pilot's grid of the docking fixture (recorded pilots, same caveat) A model assumption is an input with a name: actuator authority, load-sharing law, hidden-parameter support, delivery deadline and controller information are fields of the claim (D-19) §9 D-19

N.7 §10 The constructions

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-019 Compute mobility from the Grübler–Kutzbach count Sarrus linkage: the count gives 0 and the mobility is 1. Bennett linkage: the count gives −2 and the mobility is 1 Mobility comes from intersections and products in the subgroup lattice, cross-checked by the rank of the constraint Jacobian at exact rational sample points (A-01) C-01
CX-020 Move every spatial quantity with one adjoint, so that a wrench is moved by the twist map A twist moves by Ad_g; a wrench is a covector and moves by Ad_g⁻ᵀ (pushforward) or Ad_gᵀ (pullback). A single reversed adjoint must fail three independent fixtures: Ad(g·h) = Ad(g)·Ad(h), frame invariance of the power pairing, and the planar 2R fixture of C-04 (torques −3 N·m, power −0.3 W) Three separately typed maps; a wrench cannot be moved by the twist map (T-04, T-05; §11.3) C-02 (numeric statement of the maps in §11.3)
CX-021 Accept an inertia because it passes the positivity and triangle tests A centred 1 kg part with three principal moments of 0.008 kg·m² passes both, yet tr(I_C)/(2m) = 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², is the equality case The mass-support bound ‖c − o‖² + tr(I_C)/(2m) ≤ ρ² for a declared envelope C-03
CX-022 Derive inertia from geometry by filling every enclosure solid An aluminium box of 0.4 × 0.3 × 0.2 m at 2,700 kg/m³ is 64.8 kg as a solid and 3.45 kg with a 2.5 mm wall, a ratio of 18.8 A declared wall thickness makes a body a shell by the difference rule; a solid fill of a large enclosure raises a density warning (§11.5, FROB-REF-168) C-03
CX-023 Take the lower three rows of the space Jacobian as the point Jacobian Planar 2R chain, links 0.4 m and 0.3 m, angles 0 and π/2, tool point (0.4, 0.3) m: the point Jacobian is [[−0.3, −0.3], [0.4, 0.0]] m/rad, a tool force (10, 0) N gives torques (−3, −3) N·m, and both power computations give −0.3 W. For a space column (ωᵢ, vᵢ) the point column is vᵢ + ωᵢ × p; the lower rows alone drop ωᵢ × p and fail the fixture The space Jacobian pairs with the wrench (p × F, F) about the origin and the point Jacobian pairs with F (D-9) C-04
CX-024 Treat a limb's articulated inertia at its attachment port as positive definite and solve the limbs independently Eliminating a joint axis s gives I − I·s·(sᵀ·I·s)⁻¹·sᵀ·I; for I the identity and s the first axis the result is diag(0, 1, 1, 1, 1, 1): one direction is removed, so the packet is semidefinite Multi-limb ground contact goes through the coupled base solve C-04
CX-025 Use the Cayley update as if it were the exponential at any step size The Cayley step rotates by 2·atan(‖ω‖·h/2) instead of ‖ω‖·h; it is second-order Use is bounded by ‖ω‖·h ≤ 0.2 per substep and refused beyond (FROB-REF-212; GB-01) C-05
CX-026 Approximate the friction cone by a pyramid The box abs(γₜ₁) ≤ μ·γₙ, abs(γₜ₂) ≤ μ·γₙ admits (μ·γₙ, μ·γₙ), of norm √2·μ·γₙ: 41% of traction that does not exist along the diagonals The second-order cone is used; the planted pyramid exploit must be caught by the model-form check C-06
CX-027 Read full bracket rank as reachability ẋ = u with u ∈ [0, 1]: the rank is one, and negative x is still unreachable from zero A bracket direction is infinitesimal and assumes reversible inputs; a finite mission needs an integrated witness C-07
CX-028 Apply ideal rolling to a four-wheel fixed-axis (skid-steer) base With axles at ±a, lateral no-slip requires v_y + a·ω = 0 and v_y − a·ω = 0, which forces ω = 0: under the shortcut the base cannot yaw at all Ideal rolling is a regime; yaw of such a base exists only under a separately qualified slip model C-07
CX-029 Use a sibling routine as an oracle because it exists fs-mbd planar_drive (reported, 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 A foundation is qualified against an independent formula at admission before it serves as an oracle; a reported defect becomes an admission test and an upstream work item (§33; BET-04) C-07; §1.7
CX-030 Write the curvature of the mechanical connection with +[𝔸ᵢ, 𝔸ⱼ] On the planar three-link floating body, the component formula with the bracket term's sign flipped fails the loop test against direct integration by an error of order one The component formula and its sign are fixed once (§11.6) and carry a sign control C-08 (formula in §11.6)
CX-031 Reduce by the mechanical symmetry group Γ_mech where the observation-preserving group Γ_obs is required A quadruped with a front-only lidar has Γ_mech = C₂ × C₂ and Γ_obs = C₂. Adding a one-sided payload removes the reflection from Γ_obs. A quadruped crossing a one-sided slippery patch must be allowed asymmetric actions Exact reduction uses only Γ_obs intersected with the stabilizers of payload, boundary conditions and contact mode (D-14) C-09
CX-032 Treat angular velocity and torque as polar vectors under a mirror Under the sagittal mirror P = diag(1, −1, 1) the axial image of a joint axis a is −P·a: 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 Polar vectors map by P and axial vectors by det(P)·P (§11.4; T-10) C-09
CX-033 Conclude that a task is infeasible because the search over symmetry-tied deterministic policies failed Two identical latches, exactly one must close. At a reflection-fixed observation a tied deterministic policy issues equal commands and both fail; either asymmetric choice succeeds, and a policy that draws one of the two uniformly is equivariant in law A failure of tied-policy search excludes only the tied policy class, and the report says so and nothing more C-09
CX-034 Find a gait orbit inside Fix(K) and judge its stability there An orbit computed inside Fix(K) can hide unstable multipliers transverse to it (C-10 states the rule; the smallest numeric case is given with the gait analysis of §22) The monodromy is always computed on the full space C-10
CX-035 Refuse simultaneous impacts, or impose an order on them Trot, bound and pronk have simultaneous touchdowns by construction; forcing an order can change the outgoing velocity and a gait's basin Simultaneous events are resolved by one coupled solve and are never a reason to refuse a gait C-10; C-16
CX-036 Summarize a port by its peak demand and add the peaks Two fingers on one unit-current bus have identical local summaries. A rule that adds their peak demands rejects a task that a two-tick schedule completes: no one-tick schedule is feasible and two two-tick schedules are A port contract carries time correlation; the two-finger bus fixture must not be pruned, and two modules with identical local summaries on one current-limited bus are not merged (BET-31) C-12
CX-037 Reuse a result after an edit because the sub-term's hash still matches Swapping a leaf keeps its siblings' local results, but 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. Controls: a mirror swap of a leaf reuses its siblings' results; an edit to the shared bus must invalidate A hash identifies; only a recorded implication licenses skipping a recheck (D-11; FROB-REF-835) C-12; D-11
CX-038 Score an estimator after fitting a scale A 2 m estimate of a 1 m motion has zero residual after a factor of ½ A metric gravity-referenced estimate is aligned with one translation and one yaw per trajectory and never with a fitted scale C-13
CX-039 File a reassociation as a bit-exact rewrite In f32 with a = 10⁸, b = −10⁸, c = 1: (a + b) + c is 1 and a + (b + c) is 0 Rewrite classes: class E changes no bit and ships a replayable trace; class R (reassociation, distribution, fused multiply-add) makes a different kernel with a new identity; the trace checker rejects the misfiled rewrite (T-27) C-14
CX-040 Freeze a fixed-n decision rule without listing the verdicts it can return Two-sided exact Clopper–Pearson rule at n = 64 with a ±5 point indifference band: perfect concordance gives [−0.0662, +0.0662], so no outcome can return a tie. The recorded rule with 64 pairs could return three of its four verdicts; the fourth was first reachable at 86 pairs A fixed-n study ships a pre-analysis of reachable verdicts (T-26); a study that needs an unreachable verdict is refused at admission C-15; §0.7
CX-041 Use the reset Jacobian as the derivative across an event Bouncing ball, state (y, v), reset (y, −r·v), impact speed v⁻ < 0: the saltation matrix is [[−r, 0], [−(1 + r)·g/v⁻, −r]] with determinant r². The reset Jacobian diag(1, −r) has the wrong sign in the first entry, omits the coupling in the second row, and for r = 1 has determinant −1 where the elastic bounce preserves area with determinant +1 Event derivatives use the saltation matrix and carry the label saltation (D-15) C-16
CX-042 Transport a derivative across an event by a symmetry without checking that the relabeling commutes with the event Two bouncing balls and the swap of their labels satisfy D h(x⁺)·Ξ_e(x⁻) = Ξ_{h·e}(h·x⁻)·D h(x⁻) when the restitutions are equal and violate it by terms proportional to r_L − r_R when they differ A symmetry is used across an event only where the commuting identity holds C-16
CX-043 Return a derivative at a grazing event A ball whose apex touches a ceiling: the guard is not crossed transversally, and the query returns refused, not a matrix Refusal near grazing, at an ambiguous event order, across an active-set change or at frictional degeneracy (FROB-REF-263) C-16
CX-044 Certify the convex hull of two feasible designs Feet at (±1 − e, ±1) m, each capped at 0.5 N, carry a load W at the origin; 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; their midpoint (0.45, 1.45) needs 841/800 N from a pair capped at 1 N An inner cell needs a witness for the whole cell; only a union of proved inner cells is inner; the midpoint must be excluded from every inner set (BET-20) C-17 ≡ CX-010
CX-045 Accept one policy per world as evidence that one policy works for all worlds (∀w ∃π offered for ∃π ∀w) Docking fixture with the packet arriving late, gains g ∈ {1, 2}: with first command p the remaining commands must be (1/g − 2p, p − 1/g), which differ by ½ between the gains. Each world alone has a successful open-loop command and no single command succeeds in both Quantifiers are part of the claim; evidence for an easier quantifier order is rejected by type and by the auditor (D-12; §8.3 rule 8; FROB-REF-826) C-17; C-19
CX-046 Evaluate a strict requirement with a non-strict comparator, or by an infimum At U = ¾ and ε = 5/16 the docking residual is exactly zero and the strict predicate fails: with p = 5/8 both worlds can report 15/16 while needing −¼ and −¾. On 0 < w ≤ 1 every realization has w > 0 although the infimum is 0 Strict, non-strict and equality atoms are evaluated with their declared comparators; a uniform positive margin is a separate, stronger request; strict decisions are computed exactly (D-18) C-17; C-19
CX-047 Multiply stage pass rates to get the mission pass rate Among 20 equally likely worlds two stages each pass in 19. The mission passes in 18 worlds if the failing worlds differ and in 19 if they coincide A chance constraint preserves the joint law across stages or allocates failure budgets that sum to the allowance; a product bound needs conditional success at every reached history C-17
CX-048 Intersect per-world answers to obtain the joint answer F(V) ⊆ ⋂ over w ∈ V of F({w}), and the gap is what the controller cannot observe in time: in the docking fixture with a late packet each of the worlds g = 1 and g = 2 is solvable alone and the joint query has no solution The joint query is answered as stated; per-world evidence is not combined by intersection (D-9, D-12) C-18
CX-049 Keep an inclusion when the world set grows Docking family: 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; the least worst-case terminal error becomes 1/65 m Verdicts have polarity: an inner certificate survives when W shrinks, Π grows or A weakens, and must be rechecked on the opposite moves; an exclusion is the reverse C-18
CX-050 Trust a cache key or a dependency record to mean the verdict still holds A dependency graph with one edge omitted returns a promotion that fresh replay contradicts Reuse needs a recorded implication; the stale-verdict control must be caught by the shadow recompute (D-11; BET-33) C-18
CX-051 Take pairwise compatibility as joint compatibility Commands (x, y) ∈ [0, 1]² with three variants requiring x ≥ 2/3, y ≥ 2/3 and x + y ≤ 1: every pair of sets intersects and the triple does not. Pairwise compatibility would have authorized one shared controller; two labels suffice and one is impossible The label count is a colouring of the hypergraph whose edges are the inclusion-minimal collections with empty intersection C-19
CX-052 Count repeated sensor reads as independent evidence 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 Error dependence, not per-read accuracy, sets the value of redundancy C-19
CX-053 Expect more training to overcome a sensing limit Docking fixture: if the only informative packet arrives after the third command is committed, no causal policy docks in both worlds for any U and ε; the two worlds deliver identical packet histories up to the commitment deadline and need disjoint commands An indistinguishability witness ends a policy search before it is paid for (mission.refute) C-19
CX-054 Specify sensor accuracy separately from actuator authority and the probing command Docking fixture at U = ¾: the probe p = ¼ tolerates ε < 1/8 and the probe p = 5/8 tolerates ε < 5/16 on the same actuator; in general ε < (U + ½)/4 Sensor, actuator and delivery time appear in one design inequality; the probe and the feedback are chosen together C-19
CX-055 Read a full-rank local observability Gramian as distinguishability 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 Every calibration and placement analysis also runs a global ambiguity search C-20
CX-056 Two designs whose geometric ratios match are dynamically similar, so a verdict moves between them Scale a body by λ at constant density: mass × λ³, static joint torque × λ⁴. With a motor whose torque scales as λ³ the group τ_max/(m₀·g·ℓ₀) falls as 1/λ, so a design that stands at one size fails at twice the size. A fixed latency has delay group ∝ λ^(−½): it doubles at one quarter of the size Every dimensionless group must match before a verdict is transported; differing groups are reported by name (C-21, D-11) C-21
CX-057 A physical constant may sit in a kernel as a pure number Scale lengths × 4, times × 2, masses × 2 with gravity unchanged. A homogeneous kernel reproduces every significand bit and branch; a kernel with a hidden dimensional constant differs on its first step Dimensional homogeneity of every kernel (T-09); the power-of-two similarity test C-21
CX-058 Quotient a campaign by the mechanical symmetry group Γ_mech of the chassis Ten leg types on a hexapod: dihedral symmetry of order 12 gives 86,185 classes. With a front-only lidar only the sagittal mirror survives and there are 500,500 classes; counting with Γ_mech merges designs that the closed loop distinguishes The acting group of a campaign is Γ_obs, never Γ_mech alone (C-22, C-09) C-22
CX-059 Designs that agree on some mission observables can be merged Eight ballast slugs enter the dynamics through count, Σx and Σx². Slots {1, 4} and {2, 3} have equal count and equal Σx = 5 but Σx² = 17 and 13: they are different rigid bodies A projection class requires equality over all active observables, and merged pairs must replay bit-identically (C-22) C-22
CX-060 A design-conditioned policy may read its tokens in file order Exchange two legs in the description of one robot: the robot is unchanged and the actions change. FACT (source register): a published morphology-conditioned policy lost most of its return when the same robots were re-described in equivalent conventions A family policy is natural under re-description, σ(d′) = φ·σ(d); permutation-equivariant tokens (C-23) C-23
CX-061 More equivariance is better: make the policy equivariant under all rotations A rotation about a horizontal axis does not preserve gravity. The rigid motions that do are rotations about the vertical, translations and reflections through vertical planes, and the layers are equivariant under those only The gravity control of C-24: a horizontal-axis rotation must not be a symmetry of the policy C-24
CX-062 Audit a small share of worlds on the high tier and correct by inverse weights; the cheap prediction only has to be roughly right With Y ∈ {0, 1}, a prediction wrong by a constant ½ and audit probability 0.1, the added variance is (1 − p)/p·(Y − m)² = 9 × ¼ = 2.25, worse than auditing everything. The estimate stays unbiased; the cost is variance Tier correction is funded only where the measured ρ supports it (kill below 0.7); p_min bounds the weights (C-25) C-25
CX-063 Calibrate the conformal margin on the designs that were promoted, since those are the ones that ran both rungs On a fixture where the residual abs(y_hi − ĝ(y_lo)) correlates with the cheap score, q̂ computed from promoted designs only under-covers The audit set is drawn by keyed randomness before any score exists and run at fixed n (C-26) C-26
CX-064 A dozen audit designs are enough for a 95% conformal margin The index is ⌈(n + 1)·(1 − α)⌉: n = 39 gives the 38th smallest residual; n = 18 gives 19, which exceeds n. Fewer than 19 audit designs cannot support α = 0.05 Minimum audit-set size for a declared α (C-26) C-26
CX-065 A defensive mixture proposal makes certifying the absence of failures cheaper With q = β·p + (1 − β)·q′ the weights are at most 1/β, and zero observed failures certify only p ≤ ln(1/δ)/(β·n). At δ = 0.05 and p* = 10⁻⁴ crude sampling needs about 3·10⁴ nominal episodes, and the mixture needs that many on its nominal share Certification and exploration are two lanes that never mix (D-16); no sampler discounts certified absence (C-27) C-27
CX-066 Forking a world at a splitting level multiplies the evidence A fork without fresh randomness is an identical copy: children that share the parent's streams reproduce the parent's trajectory bit for bit and add nothing Child streams are keyed by child world addresses; duplicate children are detected (C-27, §11.1) C-27
CX-067 The shrunk failing world is the smallest one, and its size measures distance to failure Edit 1 (a grease patch) fails the design; edit 2 (a rug over the patch) masks it. {1} fails and {1, 2} passes, so failure is not monotone in the edit set. With eight edits and failure exactly when 3 and 6 are present the search returns {3, 6}, which is 1-minimal by construction and nothing more A result is reported as 1-minimal under the tested edit relation; no distance to a boundary is claimed (C-28, §12.3) C-28
CX-068 Any world in which the design fails is a counterexample A doorway narrower than the body fails every controller: it is a useless trap and says nothing about the design A counterexample is kept only with a solvability witness from the candidate's own body, actuators and mission constraints (C-28) C-28
CX-069 A large Shapley value identifies a necessary cause Two interventions A and B. Case 1: either alone prevents the failure, v({A}) = v({B}) = v({A, B}) = 1. Case 2: only both together prevent it, v({A}) = v({B}) = 0, v({A, B}) = 1. Both give φ = (½, ½); case 1 has two but-for causes with PN = 1 and case 2 has none A cause is named by the probability of necessity against the placebo flip rate; Shapley is a budgeted summary (C-29) C-29
CX-070 An intervention that flips the outcome is a cause On a fixture where every last-place nudge of an unrelated state flips the outcome, any intervention appears to prevent the failure The placebo fork: c is a cause only when PN(c) exceeds the placebo flip rate ρ₀; otherwise the report is chaotic: unattributable (C-29) C-29
CX-071 A design-parameter change can be tested by forking at a snapshot just before the failure For a gear ratio or a mass, the thermal state, the estimator state and the policy's history at the snapshot would all differ under the changed design, and an intervention at a snapshot answers a question about the continuation only Design-parameter interventions re-run from the episode start on the same streams; a fork is refused when the controller cannot adapt without retraining (C-29) C-29
CX-072 The robustness of a conjunction is the minimum of the raw margins A clearance of 0.02 m and a thermal margin of 15 K: the minimum is 0.02 (clearance binds) in metres and kelvin, and 15 (the thermal margin binds) in millimetres and kelvin. With declared scales 0.10 m and 10 K the values are 0.2 and 1.5 and clearance binds in every unit system Every atom has a declared scale of its own dimension; robustness is ρ = ψ/s (C-30) C-30
CX-073 When an episode ends early, evaluate "always" over the samples that exist An episode that ends at 30 s under G_[0, 45 s]: the minimum over 30 s can be positive although the requirement was never tested on the last 15 s A window the trace does not cover yields undetermined, never a truncated minimum (C-30, §24.5) C-30
CX-074 Project the action onto the barrier row, then clip to the actuator box R = I, u_π = (1, 0), box [0, 1]², row u₁ + u₂ ≥ 1.5. Projection ignoring the box gives (1.25, 0.25), outside the box; clipping gives (1, 0.25), with u₁ + u₂ = 1.25 < 1.5. The breakpoint method gives (1, 0.5) The one-row filter is solved exactly inside the box; multi-row solves carry a mandatory KKT check with a passive fallback (C-31) C-31
CX-075 For every disturbance there is a safe action, so the filter is safe A certificate proved in the order ∀w ∃u lets the action be chosen after the disturbance and the estimation error are seen, which the controller cannot do The quantifier order is ∃u ∀(w, e); a certificate in the other order is rejected (C-31, FROB-REF-826) C-31
CX-076 An energy budget may leave out small sources Lifting 8 kg over a 12 mm sill needs 8 × 9.81 × 0.012 = 0.94176 J, above a 0.90 J budget, so the family is excluded; 0.05 J of approach kinetic energy (0.95 J) removes the exclusion. In the stop budget (0.64 + 0.50 + 0.25 + 0.10 = 1.49 J of 2.00 J) a missing gravity term over the stroke makes the checker reject A budget has a term for every source on the declared load path (T-28); the omitted-term control C-31
CX-077 The first moment of the load can be passed where the support torque is expected With +z up the support torque is (P_y, −P_x, 0). P = (60, 30) N·m with the stance forces gives (30, −60, 0) N·m; a packet that passes (60, 30) as the torque has the wrong components and sign Every field of a bundle is typed with frame, origin, sign and unit (§12.4, FROB-REF-829) C-32
CX-078 An inclusion proved for independently commanded foot forces holds for the same robot on a passive suspension Stance fixture at b = ¼ m with a 160 N cap: active allocation gives (155, 135, 105, 5) N, inside the cap; equal passive springs give (175, 115, 85, 25) N, above it A typed result states its authority model; the assumption authority travels with the certificate (C-32) C-32
CX-079 Centre of mass inside the support polygon and total foot capacity above the weight means the stance is feasible Stance fixture at b = 1/5 m: the centre of mass (150 mm, 75 mm) lies inside the feet at (±1/3, ±1/5) m and total capacity is 4 × 160 = 640 N against 400 N, yet the moment equations give f₊₊ − f₋₋ = 165 N with f₊₊ ≤ 160 N and f₋₋ ≥ 0. FACT (planning pilot, to be re-run): the test accepted 1,596 bodies the exact model rejects The stance family is decided by the exact model with per-foot bounds and a dual witness (C-32, T-22) C-32
CX-080 A region certificate can be had by paving the whole design box 10⁴ boxes are 13 bisections, less than one cut per axis in 20 dimensions: a uniform box keeps 0.64 of each side (0.41 in 10 dimensions) Certificates are issued per constraint on sub-boxes of about six parameters or fewer and assembled by products, monotonicity and witnesses (C-32, C-17) C-32
CX-081 Clearance can be tested with one scalar radius A thin rod of length L turns a right-angle corner between corridors of width a exactly when L ≤ 2√2·a. The circumscribed-disc test, L ≤ a, refuses every rod between a and 2.83·a although each passes; the inscribed-disc test accepts rods longer than 2.83·a, which jam Clearance is certified from both sides on complexes in SE(2), with a reported band (C-33) C-33
CX-082 A linkage that closes at every target pose reaches them all Links 4 (ground), 1 (crank), 3.5 (coupler), 3 (rocker): 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 satisfies closure at each pose and cannot move between them without disassembly The circuit and branch certificate of lane 1 (C-34) C-34
CX-083 Every tracked root passed the α-test, so the solution set is complete An α-test proves a nearby nonsingular root and nothing about completeness. The Stewart–Gough forward problem has 40 solutions: a run that certifies fewer, or loses a path, has not found them all A result is Complete only when the certified count equals an independent generic count with no lost path; otherwise Partial(certified, lost) (C-34) C-34
CX-084 Rainflow counting can be run window by window The history 0, 10, 0 split into the windows [0, 10] and [10, 0] holds one full cycle of range 10; a counter that drops residues at window ends counts none The residue of open half-cycles is carried between windows (C-35) C-35
CX-085 Rare overload cycles can be dropped from a fatigue history With m = 3, 10⁶ cycles at a life of 2·10⁶ give D = 0.5; 10³ cycles at five times the amplitude (life 16,000) add 0.0625: 0.1% of the cycles carry 11% of the damage Load cases are the recorded envelope over qualified missions; the damage sum keeps every cycle (C-35) C-35
CX-086 Momentum conservation is the test of a step for any system with a symmetry Chaplygin sleigh: v̇ = a·ω², ω̇ = −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 The momentum test of C-04 is not applied to nonholonomic systems; they are tested by energy (C-36) C-36
CX-087 If the variational step conserves momentum, its implicit solve is right Evaluate step 2 with the differential at +hξ_k instead of −hξ_k (the other trivialization). Momentum stays exact, because the transport of step 3 conserves it for any ξ; the energy bound and reversibility are lost The variational step is tested by bounded energy error (÷4 when h is halved) and by reversal, never by momentum alone (C-36) C-36
CX-088 Model every wheel as an ideal rolling constraint Four fixed wheels as ideal rows return ω = 0 under any command: a skid-steer base cannot turn. With cone-bounded rows it turns with its lateral multipliers on their cones Rolling rows carry traction limits; ideal rolling is a limit of the same solve (C-36, C-07) C-36
CX-089 Sliding friction and torsional friction are independent rows with their own coefficients At v_t = r·ω_n the coupled law gives a tangential friction magnitude of μ·λ_n/√2; the uncoupled model gives μ·λ_n. A spinning contact resists sliding less One four-dimensional cone for sliding and spin (C-37) C-37
CX-090 Heat entering the winding is a loss, and the node's temperature rise is stored energy A ledger that books the same heat as both stored and lost shows a deficit equal to that heat H + U changes only by port power and by the heat that leaves to ambient; ledger closure in all three modes (C-38) C-38
CX-091 A passing second-law check shows the thermal model is right The check has content only as a sign check on each assigned loss: it cannot fail for a correct model. Its one catch: a regenerative mode with a negated copper loss gives σ < 0 The entropy balance is a derived report, used as a sign control and not as validation (C-38) C-38
CX-092 Any measurement of the mechanism will identify it; fit a richer curve Laws μ₁(v) = 0.5 and μ₂(v) = 0.3 + 0.4·v 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 0.5 m/s separates nothing at any precision; 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 is chosen so that the reading sets of the decision blocks are disjoint over the nuisance intervals (C-39) C-39
CX-093 A probe that separates the admitted mechanisms settles the design decision A third law that follows μ₁ up to 1.0 m/s and departs later defeats the 1.0 m/s probe. FACT (planning pilot, to be re-run): a probe synthesized for three admitted laws chose correctly in 675 of 675 in-class cases; a fourth law reversed all 225 held-out decisions; direct measurement at mission dwell was right in 900 of 900 A probe certificate is conditional on the admitted set ℳ and says so; direct measurement at mission conditions is always an admitted probe (C-39) C-39
CX-094 Dominance can be checked by enclosing each design's outcomes separately and comparing z ∈ [0, 1]; A succeeds when z ≥ 3/5 and B when z ≥ 2/5. Separate enclosures give {0, 1} for each and admit all four pairs, including (success, failure), which no shared z produces Dominance is unreachability of (success, failure) in the product system on shared inputs (C-40) C-40
CX-095 A product enclosure that covers each design's outcome set covers the joint outcomes A product whose internal branches are wrongly tied reaches only (0, 0) and (1, 1). Its projections cover both marginal outcome sets, and it hides a reachable (1, 0) The checker demands joint coverage; one mislabeled branch invalidates the certificate (C-40) C-40
CX-096 Pair two designs by seed and tick, and the worlds match Two tyres on different paths over a patterned floor meet different friction at the same tick. A product coupled by tick and not by position reports a false regression or hides a true one Shared inputs are compiled at physical coordinates: one space-indexed field read at each robot's contact point (C-40) C-40
CX-097 "B never loses to A" means B meets the mission In the same fixture neither design is guaranteed: A fails for z < 3/5 and B for z < 2/5, while the paired verdict of no loss holds on the whole interval The answer carries the paired verdict and each design's absolute verdict separately (C-40) C-40

N.8 §11 Conventions

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-098 The coadjoint in the Euler–Poincaré equation carries a minus sign: μ̇ = −ad_ξᵀ μ Force-free body with the origin at the centre of mass. With ad*_ξ = ad_ξᵀ: v̇ = v × ω, so d(R·v)/dt = R·(ω × v + v̇) = 0 and the world-frame velocity is constant. With the opposite sign d(R·v)/dt = 2R·(ω × v): a free body changes its velocity with no force ad*_ξ = ad_ξᵀ with μ̇ = ad*_ξ μ + w; the map −ad_ξᵀ is never written ad* (§11.2, T-16, PO-MARROW-01) §11.2
CX-099 A wrench changes frame by the same matrix as a twist R = I, p = (1, 0, 0) m, wrench (0, (0, 0, 1) N) in b. The pushforward Ad_g⁻ᵀ gives torque p × f = (0, −1, 0) N·m and the same force. The twist map Ad_g gives zero torque: the moment arm is lost, and the planar fixture of C-04 fails Three typed frame maps, TwistMap, WrenchPushforward, WrenchPullback; no function accepts one where another is expected (§11.3) §11.3
CX-100 Angular velocity mirrors like any other vector Sagittal mirror P = diag(1, −1, 1). Axial vectors map by det(P)·P = −P: the yaw axis e_z goes to −e_z, so a robot turning left becomes a robot turning right, and the pitch axis e_y maps to itself. Treated as polar, the yaw rate is left unchanged Polar vectors map by P and axial vectors by det(P)·P; the step-equivariance test of T-10 (§11.4) §11.4
CX-101 A body with no declared wall thickness can default to a solid of its outer shape A thin spherical shell of radius r has I = (2/3)·m·r², a solid ball (2/5)·m·r²; for an enclosure the solid default is wrong in mass by an order of magnitude (C-03 gives a case with a factor of 18.8) The shell rule; a solid body above the plausibility bound of its part class is refused unless the fill is declared (FROB-REF-168, §11.5) §11.5
CX-102 The curvature of the connection is ∂ᵢ𝔸ⱼ − ∂ⱼ𝔸ᵢ + [𝔸ᵢ, 𝔸ⱼ] Constant connection 𝔸₁ = e_x, 𝔸₂ = e_y on SO(3): the curl vanishes, (D𝔸)₁₂ = −[e_x, e_y] = −e_z, and a small loop of area da rotates the body by +da about z, as exp(−a·e_x)·exp(−b·e_y)·exp(a·e_x)·exp(b·e_y) ≈ exp(a·b·e_z) confirms. The + formula predicts −da, wrong by twice the answer (D𝔸)ᵢⱼ = ∂ᵢ𝔸ⱼ − ∂ⱼ𝔸ᵢ − [𝔸ᵢ, 𝔸ⱼ] with ξ = −𝔸(s)·ṡ (§11.6, T-20; the wrong-sign control of C-08) §11.6
CX-103 A 30 Hz policy on 400 Hz physics can run every thirteenth physics step L = 1,200 base units per second; physics every 3 units, policy every 40. The policy tick at unit 40 falls one unit after the physics boundary at 39 and two before the one at 42; thirteen steps are 39 units, a period of 32.5 ms instead of 33⅓ ms Rational periods with integer phase accumulators; a process need not be a multiple of the physics step, and no period is rounded (§11.7) §11.7
CX-104 A force sensor reading is the force at the sample instant, and an impact on a window boundary can go to either window An impact of 0.2 N·s inside a 10 ms exposure contributes 20 N to that window's average and nothing to its neighbour; an impact at exactly instant b belongs to the window ending at b A reading is a functional of the history over the half-open window (a, b]; each impulse is added once and divided by the exposure (§11.8) §11.8
CX-105 A decision may use any packet whose timestamp is earlier than the decision The timestamp is a label written on the sensor's own clock and is unconstrained by causality. In the docking fixture of C-19 the same packet is on time when its arrival precedes the second decision and worthless when it follows the third command, whatever its timestamp A decision uses only packets whose arrival is not later than the decision; a packet is never visible before its arrival (§11.8) §11.8

N.9 §12 Lemma: proofs, certificates, the offline auditor

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-106 A bundle whose hashes are all consistent is a valid certificate A bundle with an unknown proof kind and consistent hashes: every digest matches and no checker implements the argument. The auditor returns reject The registry of proof kinds is closed and versioned (ADR-LEMMA-04, INV-LEMMA-04, FROB-REF-823) §12.4, §12.7
CX-107 A certificate that checks can be offered for any query about the same model The docking cell (U, ε) = (¾, ¼) with the packet on time is accepted for the inclusion; the same bundle with its quantifiers reordered is rejected, although every hash is still consistent The quantifier prefix, domain and assumption set of a certificate must match the query (FROB-REF-826) §12.4, §12.7
CX-108 A witness is valid if its numbers are right, whatever order they are listed in Stance specimen: forces (160, 130, 110, 0) N are typed to the port order [++, +−, −+, −−]. With the foot order swapped and the forces unchanged the total is still 400 N and the primitive moment equations no longer hold. Three further mutations must also be rejected: an unreported positive force floor; a passive-authority tag; (60, 30) passed as the torque Every field that enters the argument is typed with frame, origin, sign and units, and the primitive equations travel in the bundle (§12.4, FROB-REF-829, GATE-LEMMA-03) §12.4
CX-109 An exact argument yields a Certified result An exact rational argument over an Estimated material card is Estimated; an energy budget computed exactly in simulation over Estimated inputs is Estimated The class of a combined result is the minimum of its inputs' classes; nothing converts a claim product into a proof (INV-LEMMA-02, FROB-REF-834, GATE-LEMMA-06) §12.2, C-31
CX-110 A study receipt in a bundle proves the study's conclusion The auditor recomputes the arithmetic of a recorded study (counts, e-values, spent α); it cannot attest that the episodes ran sample-coverage is never a proof: class at most Tested (ADR-LEMMA-06) §12.4, §12.5
CX-111 A reassociation is a harmless rewrite and can be filed as bit-exact (class E) A rewrite trace that contains a reassociation filed under class E is replayed by the independent checker and rejected: reassociation is not in the closed table of class-E rules A class-E trace uses only rules of the closed table (T-27); equality over ℝ is the theorem, and bit-exactness in floating point is a test §12.7, §12.4
CX-112 A kernel certificate shows that the kernel's floating-point output satisfies the identity Certificates are about the straight-line program over ℚ with square roots; rounding is not modeled, and round-off breaks exact equivariance The floating-point gap is measured by residual tests with dimensioned tolerances and by the power-of-two test of C-21, not proved (§12.3, §12.5) §12.3, §12.5
CX-113 The articulated variational step is symplectic, like the free-body step False as stated for a configuration-dependent mass matrix: a kick–drift splitting is then no longer the variational step No symplectic claim beyond one rigid body; energy behaviour is measured (§12.3, C-36, C-05) §12.3
CX-114 The boundary value of a threshold can be reported as the attained optimum Docking family (T-23): for U ∈ [½, 1] a robust causal policy exists if and only if the packet is on time and ε < (U + ½)/4. At U = ¾ the bound is 5/16 and ε = 5/16 is not admitted: the supremum is not attained. The stance minimum b = 3/14 m is attained and carries a matching lower bound (the dual witness for every smaller b) A minimum is claimed only with the incumbent value and a checked matching lower bound; an infimum that is not attained is returned as an open threshold with a feasible candidate and its gap (§12.4) §12.4, §12.3
CX-115 An artifact with no authorization fields is neutral frob-verify rejects an artifact in which a flag is missing, exactly as it rejects one in which execution_authorized is true Every exported artifact carries the three flags, false, and no code path sets one (INV-LEMMA-03, FROB-REF-833) §12.2, §12.7

N.10 §13 Marrow: the algebraic core

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-116 A free-body integrator that conserves kinetic energy has the right coadjoint sign (equivalently: ad* is "the negative transpose" of ad) Inertia diag(1, 2, 3) kg·m², ω = (1, 1, 0) rad/s, π = (1, 2, 0). Correct law: π̇ = π × ω = (0, 0, −1). Reversed sign: (0, 0, +1). Both give ω·π̇ = 0, so kinetic energy is conserved either way. The body-frame rate of spatial angular momentum π̇ + ω × π is (0, 0, 0) with the correct sign and (0, 0, 2) with the wrong one ADR-MARROW-05 (two coadjoints, each with its own type and sign); the free-body and coadjoint-pair laws of §13.8; the mutation rule (each convention guarded by at least three fixtures); GATE-MARROW-04 §13.3, §13.10
CX-117 The lower three rows of a space screw Jacobian are the point Jacobian of the tool Planar 2R arm, links 0.4 m and 0.3 m, angles 0 and π/2, tool force (10, 0) N. The point Jacobian is [[−0.3, −0.3], [0.4, 0.0]] m/rad and gives joint torques (−3, −3) N·m; the lower rows of the space screw Jacobian give (0, 0) Frame-typed Jacobians and wrench maps (WrenchPushforward against WrenchPullback, §13.3); the planar 2R known answer §13.10
CX-118 A mechanically symmetric robot may tie policy weights, augment data or deduplicate designs under its mechanical group A quadruped built fore-aft and left-right symmetric has Γ_mech = C₂ × C₂ of order 4. One forward lidar on the torso is fixed by the left-right mirror and moved by the fore-aft mirror and the half-turn, so Γ_obs = C₂ of order 2. A policy tied under C₂ × C₂ must walk backwards as the mirror image of walking forwards while seeing only forwards ADR-MARROW-06; PO-MARROW-04; GATE-MARROW-03; FROB-REF-109 for a false declaration §13.4
CX-119 A failed search over symmetric (tied, deterministic) policies shows the task is infeasible Two identical latches, of which exactly one must be closed. At an observation fixed by the mirror a deterministic equivariant controller must issue an action fixed by the mirror, so it commands both latches alike, and both matching commands fail. A controller that draws one latch at random is equivariant in law and succeeds A failed search excludes only the policy class searched; frob-algebra exposes fixed subspaces so that A-03 lists the observations at which tying forces tied actions §13.4
CX-120 A task that is symmetric in law may be reduced by symmetry inside each world A quadruped crossing a patch that is slippery on one side only. The world distribution can be mirror-invariant in law, which licenses augmentation; no single world is mirror-invariant, which forbids reduction inside it Reduction inside one world uses Stab(context), not Γ_obs; the table of uses in §13.4 §13.4
CX-121 If the encoder permutation of a symmetry still exists, the symmetry still holds Changing one foot's sole material leaves the encoder permutation intact and breaks the transition symmetry: the representation exists and the group element does not Γ_mech preserves contact laws and interface cards; both facts are recorded by A-03; GATE-MARROW-03 lists a changed sole material among its planted asymmetries §13.4
CX-122 Every irreducible block of an equivariant layer takes one real scalar per pair of copies C₃ permuting three legs cyclically. The equivariant maps ℝ³ → ℝ³ are the circulants, three parameters: the trivial block plus one two-dimensional block of complex type, 1 + 2 = 3. Giving the two-dimensional block one scalar yields two parameters and only the symmetric circulants, which are the D₃-equivariant maps; x ↦ (x₂ − x₃, x₃ − x₁, x₁ − x₂) becomes unrepresentable ADR-MARROW-07 (real and complex blocks, Reynolds operator as oracle); PO-MARROW-05; the blocks law of §13.8 §13.5
CX-123 A strict inequality that selects a discrete outcome can be evaluated in plain single precision The single-precision numbers nearest 0.3, 0.4 and 0.5 in x² + y² ≤ z². In single precision the two sides are equal, so the plain test reports the point inside the cone. The exact value of x² + y² − z² for those stored numbers is +1.19 × 10⁻⁸: the point is outside. A fused multiply-add gives a third rounding sequence ADR-MARROW-08; the Guarded class with its exact integer fallback; the frob-kir lint against Plain predicates on selects whose arms differ; GATE-MARROW-05 §13.7
CX-124 A mirrored revolute joint can be written with the mirrored axis P·a and keep its coordinate For a reflection (det P = −1) an axis is an axial vector and maps to det(P)·P·a. A design that writes P·a instead must negate the coordinate, its limits, and its encoder and gear signs; hiding the sign inside a rigid transform is how mirrored encoders read backwards ADR-MARROW-09 (a reflection is an Isometry with an explicit determinant, not a Transform); the reflections law of §13.8; the planted mutation "a missing parity sign on a mirrored axis" §13.2, §13.3

N.11 §14 Skeleton: design language, modules, archetypes, preflight

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-125 A body with no stated fill can default to solid Torso box 0.42 × 0.20 × 0.10 m in an alloy at 2,700 kg/m³: solid it weighs 22.7 kg; as a 2.5 mm shell it weighs 1.92 kg. The solid reading is 11.8 times too heavy, and through the mass spiral (loop gain 0.59, 2.4 kg of robot per kilogram of structure) a 20.8 kg error becomes about 50 kg of robot, with every actuator sized for it ADR-SKEL-03 (no default fill); INV-SKEL-05; FROB-REF-105; the solid-fill advisory above one quarter of mass_max §14.5
CX-126 Rescaling the density to hit the right mass repairs the inertia The same box about its vertical axis: radius of gyration squared (0.42² + 0.20²)/12 = 0.0180 m² as a solid and 0.0236 m² as a shell, 31% larger, because a shell keeps its mass at the walls The fill rule (shell moments as the difference of two solids); PO-SKEL-02; GATE-SKEL-07 §14.5
CX-127 A declared inertia that passes pseudo-inertia positivity is physically possible for its part A 1 kg part with principal moments 0.008 kg·m² each, declared inside a sphere of radius 0.10 m: the mass-weighted mean squared distance tr(I_C)/(2m) is 0.012 m², above R² = 0.010 m². No body inside the sphere has that inertia; a thin shell of that radius meets the bound with equality The mass-support bound ‖c − o‖² + tr(I_C)/(2m) ≤ R² and tr(P·Q) ≥ 0 at stage 2; FROB-REF-106 §14.5, §13.10 ≡ CX-021
CX-128 A contract that carries peak demands can exclude a design (add the peaks and compare with the limit) Two fingers share a bus limited to one unit of current, each with peak demand one unit. Adding peaks gives two units and prunes the design; one finger draws at the first tick and the other at the second, so the schedule is feasible A bus_demand without a time-resolved profile is usable for admission only; the bus analysis of §15.10 runs in full before any electrical exclusion; GATE-SKEL-06 §14.6
CX-129 A limb's port inertia is positive definite, so it can be inverted at the port and can stand for a limb in contact Eliminating a joint with axis s gives I − I·s·(sᵀI·s)⁻¹·sᵀI, which sends s to zero; with I the identity and s the first basis vector the packet is diag(0, 1, 1, 1, 1, 1). A chain of massless parents is singular, and contact rows couple every limb through the base The SymPsd6 type of LimbPortPacket; PO-SKEL-04; the three consumer rules of §14.6; stage 2 refuses massless chains; KILL-SKEL-PORT §14.6
CX-130 Swapping one leaf module leaves the robot's verdicts and rollouts valid A leaf-local substitution reuses siblings' subtrees, kinematics kernels and local analyses, and still invalidates static stability, the baseline controller, every rollout, every verdict and every whole-robot certificate, because ground contact couples every limb through the base; an edit to the shared bus or sink is global The four conditions of leaf-local substitution; INV-SKEL-06, INV-SKEL-09; GATE-SKEL-06 (the mirror swap reuses, the shared-bus edit invalidates, a reversed port sign refuses) §14.6
CX-131 A connection-curvature (bracket) test decides whether a wheel layout can produce the required motions A mecanum base with all four roller axes parallel: the twist-to-wheel map drops from rank 3 to rank 2, the base slides freely along one direction, and the growth vector is (2, 3) where an omnidirectional base must have (3). The curvature test passes, as it passes a differential drive, because the missing direction is still reached by a bracket Stage 4 runs the growth vector on wheeled and tracked bases and curvature on shape-changers; FROB-REF-118 §14.11
CX-132 A full-rank local information matrix means the sensors can tell the admitted worlds apart Range beacons at (−1, 0) and (1, 0). A robot at (0, 1) and a robot at (0, −1) both read √2 from each, and the local information matrix is the identity at both points; a task that requires moving toward the positive side needs opposite actions in the two worlds. A third beacon at (0, 2) reads 1 and 3 and separates them when the range error is below 1 Stage 8 alias search (aliased-passive, aliased-all-probes); FROB-REF-120; the bound (1 + TV)/2; KILL-SKEL-ALIAS §14.11
CX-133 A symmetry the designer declares can be used by consumers quad-mammal with a forward lidar and assert_obs: C2xC2: the computed Γ_obs is C₂, and the design is refused (FROB-REF-109) with the lidar mount as breaker INV-SKEL-07 (a declared symmetry never replaces a computed one, and no consumer reads the declaration) §14.14
CX-134 A wheel edit can be judged by one of its two effects at a threshold At a 0.012 m lip, raising the wheel radius from 0.060 m to 0.075 m lengthens the lever arm √(2·r·h − h²) from 36.0 mm to 40.7 mm while the horizontal push over axle load falls from 0.750 to 0.646; the chapter states both figures and names "a wheel edit judged by one of its two effects" as what the row guards against The raised-threshold oracle of the diff-drive archetype; the known answers of §14.14 §14.10, §14.14

N.12 §15 Sinew: actuators, transmissions, power

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-135 One efficiency multiplier describes a gear in all four quadrants η = 0.8, N = 10, the load driving the joint with 10 N·m at 1 rad/s: 10 W in. The single-multiplier law τ_joint = η·N·τ_motor gives τ_motor = 1.25 N·m at 10 rad/s, so 12.5 W arrives at the motor and 2.5 W came from nowhere. The four-quadrant law gives 0.8 N·m and 8 W, with 2 W lost Four-quadrant loss with η_f and η_b; INV-SINEW-01; FROB-REF-130; GATE-SINEW-08 §15.9
CX-136 Copper resistance can be held constant in the thermal check Card with R₀ = 0.20 Ω, α = 0.00393 K⁻¹, G = 0.80 W/K, C = 120 J/K, ambient 25 °C, limit 155 °C, at a constant 20 A. Constant resistance: rise 80/0.80 = 100 K, 125 °C, inside the limit, which is never reached. With R(T): s = 0.314 W/K, rise 80/(0.80 − 0.314) = 164.7 K, 190 °C, outside the limit, reached at 385 s. The largest continuous current falls from 22.8 A to 18.6 A, and above I_crit = 31.9 A there is no equilibrium at all ADR-SINEW-04 (the static check uses the corrected law); FROB-REF-132; GATE-SINEW-05 §15.7
CX-137 Under torque holding the runaway threshold can be estimated from the slope of the loss curve at T₀, and the continuous rating leaves margin below it Same card with α_B = −0.0011 K⁻¹. The slope estimate √(G/(R₀·(α − 2·α_B))) gives 25.5 A; the loss curve is convex and the equilibrium vanishes at a tangency at 16.5 A cold-equivalent. The limit is reached at 15.9 A, so the continuous rating and the runaway threshold are four percent apart actuator.thermal solves the tangency and reports the margin to it; GATE-SINEW-05 (tangency within 1%) §15.7
CX-138 Episodes that start at ambient temperature test the thermal limits of a design In 20 s from cold at 20 A the winding of the card rises by 164.7·(1 − e^(−20/247)) = 12.8 K, against an equilibrium rise of 164.7 K. A policy trained and evaluated on such episodes never meets derating ADR-SINEW-08: thermal state is initialized from a declared duty history (cold, soaked(T), steady(task)); evaluation defaults to steady(task) §15.7
CX-139 A torque-speed envelope without the voltage ellipse is good enough above base speed Card with λ = 0.010 V·s, L = 100 µH, I_max = 40 A, V_bus = 48 V: base speed 3,151 rad/s, no-load speed 3,394 rad/s. At 1.5 times base speed the motor delivers 59% of peak torque with field weakening (i_d = −32.2 A, i_q = 23.7 A) and none without it, because that speed is above the no-load speed. A model without the ellipse errs in one direction or the other The dq voltage limit at L2; actuator.envelope; GATE-SINEW-06; the L1 flag when L_q·I_max exceeds one tenth of the flux linkage §15.8
CX-140 Reflected rotor inertia is diagonal in joint space Symmetric differential with q₁ = (θ₁ + θ₂)/2 and q₂ = (θ₁ − θ₂)/2: the reflected inertia T⁻ᵀ·diag(J_r)·T⁻¹ is [[J₁ + J₂, J₁ − J₂], [J₁ − J₂, J₁ + J₂]]. Unequal rotors couple the two joints Coupling transmissions as a matrix transformer; the known answer of §15.9 §15.9
CX-141 A bus under load can always deliver the commanded power at a lower voltage (or: bus feasibility is a current limit) Actuators under current control draw power. A bus with E = 48 V and R = 0.08 Ω can deliver at most E²/(4·R) = 7,200 W; at 1,800 W it sits at 44.8 V and 40.2 A. A demand above the ceiling has no operating point: the voltage collapses and the step records a brownout event; it never completes at the requested power FROB-REF-133 at stage 6; the brownout event; GATE-SINEW-07 (100 of 100 trials, never a completed step); INV-SINEW-04 and FROB-REF-135 for exhaustion, which no kernel clips §15.10
CX-142 Losses that flow into thermal nodes are also listed as energy that left the system Copper, iron, friction and gear losses are stored in thermal nodes; the energy that leaves is mechanical work at the joint and heat to ambient. Counting stored heat again as a loss produces a false defect in the balance The identity of §15.11 (decrease of chemical energy = work out + increase of stored energies + heat to ambient + residual); INV-SINEW-02; GATE-SINEW-02 §15.11
CX-143 Agreement between the referee and the fast tiers is evidence that the actuator card is right Every tier reads the same card. If the card is wrong, the referee, the CPU batch tier and both GPU tiers are wrong together, and their agreement says nothing about it Randomization over the card's stated uncertainty; the card-conditional label of A-16; refusal of verdicts on assumed fields under --strict-data; measurement in §30 as the only evidence about the card §15.12

N.13 §16 Kinesis: dynamics on three tiers

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-144 A rejected step may redraw its random inputs A fair sign as the input; a step is rejected whenever the sign is negative and then redrawn once. The accepted sign is positive with probability ½ + ½·½ = ¾: rejection that redraws biases the law INV-KIN-03 (a random input is a function of its address and interval and is never redrawn); the dyadic refinement law (PO-KIN-04); FROB-REF-223; GATE-KIN-04 §16.5
CX-145 Simultaneous events can be solved one at a time, with constraints imposed afterwards Two 1 kg sliders joined by a rigid tie reach a wall together at 1 m/s. Stopping both needs a wall impulse of 2 N·s. Solving the wall contact for the first slider alone gives 1 N·s; imposing the tie afterwards leaves 1 kg·m/s shared by 2 kg, so both move into the wall at 0.5 m/s Coupled impulses per island with W = J·P·Jᵀ (step T4.6); simultaneous touchdowns are ordinary inputs; GATE-KIN-04 (exact to 10⁻¹² N·s) §16.5
CX-146 A reduction over a padded axis may group its terms by the buffer's capacity In f32 with a = 10⁸, b = −10⁸, c = 1: (a + b) + c = 1 and a + (b + c) = 0, because the spacing near 10⁸ is 8. A grouping that depended on capacity would make a world's bits depend on its neighbours PO-KIN-03 (pairwise trees aligned to powers of two, real entries in a prefix, canonical zero +0); INV-KIN-04; GATE-KIN-05; GATE-PHYLUM-02 §16.6
CX-147 Penetration can be removed by a position-level correction at no cost in energy Removing a depth d in one step gives the body a velocity d/h from nothing. With m = 1 kg, d = 1 mm and h = 2 ms that is 0.5 m/s and 0.125 J per event. The compliant law on the same penetration at k = 10⁵ N/m stores 0.05 J and returns less. A hopping policy that finds the first behaviour gains height from the solver INV-KIN-06; the flag energy-created (created energy above 1% of the absolute work exchanged in any 0.5 s window on a fast tier, §29.9); the first planted exploit of GATE-FID-06 §16.10
CX-148 A four-sided friction pyramid with the same μ is equivalent to the cone for ranking designs A pyramid grants √2·μ along its diagonals, 41% more than the cone, so a preference can exploit diagonal traction; the cone gives μ·N in every direction The model-form rank check (cone arm) returning model-conditional; the second planted exploit of GATE-FID-05 and GATE-FID-06; GATE-TRAC-04 §16.9, §16.10, §18.16
CX-149 A state error inside the fidelity envelope means the two tiers agree The fidelity ledger also records task decisions: success, terminal class and the verdict of a comparison. A state error inside its envelope with a different decision is a disagreement (no numeric case is given in the chapter) Decision-level equivalence (§35) as a ledger quantity; the promotion rule §16.8
CX-150 A world whose solver gave up can be scored as a failed episode A world that exhausts its retry ladder ends Faulted with cause numerical-fault (FROB-REF-221) and publishes nothing from the failed interval; it is kept apart from fall, slip and collision, and summaries state how many worlds were excluded for this cause (no numeric case is given in the chapter) ADR-KIN-05; the failure taxonomy of §29; step T7 of the transaction §16.5
CX-151 The referee can adjudicate every scenario the fast tiers run FrankenSim's solve admits at most 21 contacts. A sole with eight samples per foot fits when standing (16) and overflows in a fall or a crawl; six feet down with four samples each need 24; a tracked robot with patch samples along two belts overflows in normal driving FROB-REF-721 (a named capacity refusal, never a truncated contact set); the referee's own coverage reported per class (GATE-FID-03); established names its adjudicator where coverage is below 80% §16.4, §16.6, §16.11
CX-152 A sampled CPU referee shadows most of a GPU run A humanoid batch at 1.7 M world-steps/s and h = 2 ms produces 3,400 world-seconds per second and a quadruped batch at 2 M produces 4,000; a referee at 0.2 to 1.0 times real time per core on 24 cores produces 4.8 to 24. The share is 0.14 to 0.71% and 0.12 to 0.6%. A five-point gap in success rate needs 576 to 1,600 episodes per tier, 8 minutes to 1.9 hours of background referee time The referee_coverage figure on every receipt; GATE-FID-07 (at least 0.1%, reported); the background referee is a correctness guard and removes no training §16.11

N.14 §17 Phylum: families of bodies in one batch

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-153 A design sweep may be quotiented under the robot's mechanical symmetry group Ten leg types on the six slots of a radial hexapod: 86,185 orbits under the dihedral group of order 12, a reduction of 11.6. With a front-only sensor only the sagittal mirror preserves observations, and the count is (10⁶ + 10³)/2 = 500,500, a reduction of 2.0. Quotienting under the larger group merges designs the closed loop can tell apart INV-PHYLUM-03 (quotients use Γ_obs only); FROB-REF-161; GATE-PHYLUM-01 (the lidar control) §17.11, §17.18
CX-154 Placements with the same first moment are the same experiment Ballast fixture: eight identical slugs in 24 collinear slots enter rigid-body dynamics through the count, Σx and Σx². Of C(24, 8) = 735,471 placements there are 24,546 distinct (Σx, Σx²) pairs. Two placements with equal Σx and different Σx² must fall in different classes (slots 1 and 4 against slots 2 and 3, beside six common slugs, give Σx = 5 twice and Σx² = 17 against 13) The mission-observable digest hashes exactly what the step plan and the task read; GATE-PHYLUM-01 (the equal-Σx control); KILL-QUOTIENT §17.11, §17.18
CX-155 A local summary that carries peak demand is a sound key for pruning or reuse Two fingers with identical local summaries on a bus limited to one unit of current have no feasible one-tick schedule and two feasible two-tick schedules. A contract that adds peak demands prunes a feasible design; a local summary without time correlation is not a sound key INV-PHYLUM-04; the negative controls of the invalidation contract; GATE-PHYLUM-05 §17.11
CX-156 Members of a symmetry orbit give equal outcomes at equal world addresses The design g·d in world w behaves as d does in world g⁻¹·w: orbit members have equal outcome distributions, not equal outcomes at equal addresses. Distributional results are shared; a per-address result is shared only after the address is mapped through the group action, and a comparison paired by address against a third design is re-run The orbit rule of §17.11; the negative control "an unmapped per-address result reused" §17.11
CX-157 Equal mission digests prove that two designs give identical traces The statement is about the simulator and cannot be discharged in a proof kernel. It holds by construction, because the kernels read nothing but the tables, and is checked by replay of sampled pairs inside a class (class Tested, D2) "Structural, not proved"; GATE-PHYLUM-01 (zero false quotients in 10⁴ sampled class pairs); KILL-QUOTIENT §17.11
CX-158 A memo key can be written by hand from the inputs the author remembers A dependency omitted from a key returned a stale promotion in an executed test Keys are derived from declared inputs; one hit in 64 is recomputed in shadow and one mismatch stops serving that node kind; FROB-REF-162; INV-PHYLUM-04 §17.11
CX-159 Exact reuse after an edit is a speed lever An edit that touches a shared battery bus, a shared thermal sink, a kinematic loop across branches or any mass or geometry of a robot in contact invalidates every episode-level result of the design, because the floating body couples all of it; exact reuse after a dynamics-affecting edit is at most about a tenth of compute (FACT, Appendix H) The invalidation contract is hygiene and an evidence rule; INV-PHYLUM-04 §17.11
CX-160 Padding a mixed batch to its largest robot costs about the mean-to-maximum ratio 89% at 18 degrees of freedom, 10% at 35 and 1% at 66: r = 0.31, and the overhead is 3.27 on linear stages, 9.59 on quadratic ones and 23.3 on cubic ones. One large hybrid in a hundred designs makes a single padded batch cost three to twenty-three times the unpadded work 1/r ≤ Ω_p ≤ r⁻ᵖ (PO-PHYLUM-02); size buckets with a cap of eight; FROB-REF-741 §17.5
CX-161 Finer buckets always pay Worked card (90% at 18, 10% at 35, τ = 0.5 µs, launch overhead 0.45 ms per plan): at 8,192 worlds two buckets cost 5.0 ms against 14.8 ms; at 512 worlds 1.16 ms against 1.35 ms; at 128 worlds the single padded bucket wins, 0.67 ms against 0.96 ms. The crossover is N = c_L/(τ·(Ω − Ω_b)) = 360 worlds The bucket rule N·τ·(Ω − Ω_b) > (B − 1)·c_L; the planner's dynamic program; phylum.plan §17.5
CX-162 Mixing many designs in one batch is a large speedup at any batch shape Against D = 512 designs run one after another with W worlds each, at Ω = 1.3: about 40 at W = 16, 11 at W = 64, 3.5 at W = 256, 1.4 at W = 1,024 and 1.1 at W = 2,048. The benefit is occupancy at few worlds per design and vanishes near a thousand worlds per design; a comparator that batches parameter variants, compiles in parallel or keeps one template per family closes most of the gap The ceiling stated before any speed test; the four arms of the head-to-head (§17.14); GATE-PHYLUM-03; KILL-PHYLUM §17.5
CX-163 A pruning ratio and a kernel speedup multiply; improving most of the work gives a large factor speedup ≤ 1/(1 − f + f/r + h). Improving 85% of the work without limit cannot reach ten (the bound is 6.7); with f = 0.97, r = 40 and h = 0.02 the bound is about 13.5; a pruning ratio is never multiplied by a speedup measured on work the pruning already removed. For the family lane f = 0.15 to 0.35 and r at most 4 give 1.10 to 1.32 The speedup bound of §17.6 with "matched" work on the strongest baseline's critical path; KILL-FAMILYLANE §17.6
CX-164 A kernel specialized to one design gives a large step speedup In a published humanoid step trace everything a design-specialized recursion could touch sums to 53 of 262 ns, 20% of the step. An infinitely fast specialized recursion gives 1.25 and one twice as fast gives 1.11; on a manipulation scene the share is 16% and the ceiling 1.19 Specialization is funded only if the M2 profile shows a specializable share of at least one third; KILL-SPECIALIZE (gain below 1.2 or compile above 60 s) §17.9
CX-165 A finite-difference design gradient can be taken of any metric over any horizon A binary outcome has zero gradient almost everywhere and a finite-difference variance that grows as 1/δ. In contact-rich simulation a perturbation of 5 × 10⁻⁴ degree has been reported to diverge after 50 steps; after the active contact sets of a pair differ, its difference is noise of variance about σ²/(2δ²) FROB-REF-540; the horizon cap of 50 control intervals; truncation at the divergence step with the truncated-horizon label; INV-PHYLUM-07; KILL-FDGRAD §17.13
CX-166 Splitting designs into training and held-out sets by seed keeps the test set unseen A mirrored copy of a training design is the same closed-loop system; split by seed alone it can appear in the test set (no numeric case is given in the chapter) DesignSplit keeps every orbit of the observation-preserving group on one side; GATE-PHYLUM-07 (no orbit straddles a split) §17.10

N.15 §18 Traction: collision, contact, wheels, tracks, terrain

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-167 A positive nominal gap is clearance A nominal gap of 6 mm with 4 mm of outward error on each side leaves the outer enclosures overlapping by 2 mm: the answer is unknown until an error term is reduced. With 10 mm nominal and the same errors the answer is clear with 2 mm to spare INV-TRAC-03 (clear from disjoint outer enclosures only, penetrates from intersecting inner enclosures only); GATE-TRAC-07; strict inequalities by outward rounding or exact-integer kernels §18.3, §18.16
CX-168 Two swept volumes that overlap in space collide The bodies can occupy the shared region at different times and never touch; the test is per time slab, never on whole-sweep volumes (no numeric case is given in the chapter) The per-slab enclosure test of §18.3; GATE-TRAC-07 §18.3
CX-169 If the gap is positive at both ends of a step, no contact occurred in it A sample sphere of radius 2 mm moves at 5 m/s with h = 2 ms, so it travels 10 mm. A 2 mm plate lies 1 mm ahead. Clearing the plate takes 1 + 4 + 2 = 7 mm, so at the end of the step the sphere is 3 mm beyond the far face: both endpoints are clear and the step encloses a collision Swept bounds and event location under transactional profiles; the speculative margin of at least v·h + ε_g on lockstep tiers; GATE-TRAC-06 (the endpoint-only mutation must miss); GATE-TRAC-03 §18.4
CX-170 A scene distance field at working resolution represents all the geometry A trilinear field on a 2 cm grid cannot hold a 2 mm plate: the plate vanishes or is thickened to the grid Features thinner than two fine voxels are routed to thin primitives (K-np-thin) or the mesh path; FROB-REF-320 for a thin feature with no route §18.3
CX-171 Sliding friction and torsional friction can be independent rows With sliding speed v and spin ω on the four-dimensional cone the tangential force is μ·N·v/√(v² + (r_eff·ω)²), which is μ·N/√2 at v = r_eff·ω. Independent rows grant μ·N of sliding friction and μ·N·r_eff of torsional friction at once, 41% more in magnitude than the surface can supply; a foot that pivots while it slides would hold where it should slip The four-dimensional cone (PO-TRAC-01); GATE-TRAC-04 (the independent-row mutation must fail) §18.6
CX-172 Backlash can be modeled as a dead zone on the torque command A dead zone produces no impact when the gap closes and no hunting in a position loop. The rows give both: a rotor of inertia 10⁻⁴ kg·m² at 5 rad/s behind a ratio of 10 crosses a 0.5° gap in β·N/ω₀ = 17.5 ms and, closing inelastically on an output of 0.05 kg·m², leaves it at J·N·ω₀/(J·N² + I_out) = 0.083 rad/s Backlash as two unilateral rows on the relative angle with the rotor as its own coordinate; FROB-REF-241; GATE-TRAC-04; GATE-SINEW-04 §18.7
CX-173 A tracked or skid-steer base can be modeled with rolling (no lateral slip) constraints Exact lateral no-slip at contact stations a ahead of and behind the centre requires v_y + a·ω = 0 and v_y − a·ω = 0, hence ω = 0. The base turns only by slipping, so its turning is a property of the friction law The belt law with an anisotropic friction ellipse and yaw scrub; the rejection fixture "turning in place at zero scrub work" (§14.13); the nonholonomic model of C-07 is a planning model and an oracle for rolling only §18.9
CX-174 Diagonal scaling makes the Cholesky factor more accurate Without pivoting, the computed factor of S·H·S for power-of-two S is S times the computed factor of H bit for bit, absent overflow and underflow: its rounding errors are already those of the scaled problem. What scaling repairs is everything around the factor: tolerances, stopping tests, line-search thresholds, iterative passes PO-TRAC-03; GATE-TRAC-10; ADR-TRAC-07 §18.12
CX-175 One tolerance on the unscaled Newton gradient serves every robot Degrees of freedom mix metres and radians, and their diagonal entries differ by orders of magnitude, so one tolerance on the unscaled gradient is a dimension error; in scaled variables the gradient norm is dimensionless (no numeric case is given in the chapter) Diagonal scaling in stage 8 (K-scale-diag); INV-TRAC-05 (impulses and forces typed apart; no tolerance applies to both) §18.12, §16.5
CX-176 A half-precision factor with single-precision refinement cheapens the contact solve Refinement contracts only if κ·u₁₆ < 1, with u₁₆ ≈ 4.9 × 10⁻⁴. A rank-one contact operator with proximal shift ρ = 10⁻²·tr(W)/48 for 16 contacts has κ = 1 + 48/0.01 = 4,801 and κ·u₁₆ = 2.34. Cost: k refinement steps cost 9k/n times the factor they replace: 2.3 at n = 27 with seven steps, 1.5 at n = 35 with six, 3.0 at n = 18 with six. Emulated on three reference models (FACT, Appendix H): κ·u₁₆ ≥ 1 in 37 to 64% of sampled contact states and failure in 9 to 18% ADR-TRAC-07; FROB-REF-245; single precision admitted only below the scaled κ·u bound (FROB-REF-244) §18.12
CX-177 A wet floor is a map of constant friction coefficients By the integrated Stefan law, a film thins to 10 µm in 0.038 s under a 2 cm patch carrying 100 N on water, in 2.3 s under the same patch on cooking oil, and in 0.76 s under a 6 cm patch carrying 400 N on water. Against a stance of 0.3 s a small foot on water reaches boundary friction almost at once, while oil and large flat feet ride a film for the whole stance The film law with per-contact film thickness in contact memory; GATE-TRAC-05; KILL-FILM (the law must change at least 10% of outcomes against a constant patch at μ_b) §18.8
CX-178 A foot that has squeezed the film out stands on a dry floor A squeezed film recovers to the boundary-lubricated coefficient μ_b, not to the dry coefficient μ_d; only h₀ = 0 returns μ_d exactly INV-TRAC-07 §18.8
CX-179 A wider sole gives more traction on a patchy floor Sole straddling a low-grip strip (μ 0.25 inside, 0.8 outside, uniform pressure) with the boundary at offset z: the high-grip share is clip(½ + z/w, 0, 1). At z = 0 the capacity is 0.525·N for any width; at z = 12 mm it is 0.690·N for w = 40 mm and 0.619·N for w = 70 mm. Area alone does not predict traction The sole-strip row of the known-answer battery; load-weighted quadrature of patches §18.16
CX-180 When a world exceeds its contact capacity the extra contacts can be dropped A comparison is honest only if both arms were simulated. A tracked design against a point-foot design under an artificially low cap must return capacity-biased and no winner; the label applies whenever the arms differ by more than one percentage point of worlds in Degraded or capacity-refused episodes INV-TRAC-04; INV-KIN-05; FROB-REF-721, FROB-REF-722, FROB-REF-822; GATE-TRAC-06 §18.11
CX-181 The convex (associated) friction model is Coulomb friction Dropping the term μ·‖u_T‖ from the cone complementarity gives the associated model, in which a sliding contact acquires a separation velocity μ·‖u_T‖. CL-1 has that artifact in compliant form CL-H as the written specification of the referee; the fidelity ledger measures the artifact; the contact-law arm of the model-form check; GATE-TRAC-09 (no separation velocity on a sliding block) §18.5
CX-182 A library integrator for a differential drive can serve as the rolling oracle Heading 32 rad, wheel speeds 1 and 1 + 6·10⁻¹³ m/s, track 0.5 m, 400 steps of 1/400 s: fs-mbd::planar_drive at the pinned commit is reported to return zero translation where about (0.8342, 0.5514) m is correct (FACT to recheck) The closed form Δp = v·Δt·sinc(δ/2)·(cos(θ + δ/2), sin(θ + δ/2)) with sinc(0) = 1 is the oracle; the admission test at INT-FSIM-01 and the upstream work item FD-FSIM-11 §18.9, §14.10 ≡ CX-029
CX-183 Friction memory can stay on a contact when its feature changes A wheel rolling over a sharp sill moves its witnesses from face to edge to face. Tangential memory kept on the changed feature produces a couple the contact forces do not explain; the fixture compares work, impulse and the feature sequence under step refinement (bounds: 1% at h/4 and 10⁻⁹ N·m in f64) INV-TRAC-06 (memory is transported or reset at every witness change, each reset an event); GATE-TRAC-06 §18.4

N.16 §19 Habitat: scenes, living worlds, clearance, retrofits

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-184 Three labelled landmarks and a known length establish the registration of an imported scene Landmarks A = (0, 0, 0), B = (1, 0, 0), C = (0, 1, 0). The reflection (x, y, z) ↦ (x, y, −z) fixes all three, so a mirrored room registers with zero residual. A fourth landmark D = (0, 0, 1) maps to (0, 0, −1) and shows a residual of 2 m Four non-coplanar correspondences, LᵀL = c²·I and det L > 0 for any import that admits a parity change or an affine map; FROB-REF-302; PO-HAB-07; GATE-HAB-04 §19.5.1
CX-185 A gravity witness can stand in for the fourth landmark If the three landmarks lie in a vertical plane, the reflection through that plane fixes the landmarks and preserves gravity, so the mirrored room still registers The fourth point must be non-coplanar, with a tetrahedron volume of at least 1% of the cube of the largest separation (TARGET); FROB-REF-302 §19.5.1
CX-186 A clearance verdict can be read from nominal surfaces A nominal 6 mm gap at a doorway with 4 mm of possible outward error on each side: the outer enclosures overlap by 2 mm, so clearance is not established; the inner enclosures are 14 mm apart, so penetration is not witnessed. The nominal test says "clear"; the verdict is unknown Clearance is established only by disjoint outer enclosures and penetration only by intersecting inner enclosures; anything else is unknown (§19.5.2, INV-HAB-06); GATE-HAB-04 §19.5.2
CX-187 Overlapping swept volumes show a collision, and one penetrating world shows that a body must hit The spatial sweeps of two bodies can overlap although the bodies are never in the same place at the same time; a universal penetration claim must cover every admitted world, not one (stated as two tested traps; no numeric case is given in this section) Inner enclosures must intersect at the same time and pose in one jointly admissible world §19.5.2
CX-188 Quantizing the distance field to 16 bits over the whole scene range is fine Sixteen bits over ±10 m resolve 20 m / 65,536 ≈ 0.31 mm, which at a contact stiffness of 10⁵ N/m is a force step of about 30 N. Over ±8 cm the step is about 2.4 µm and the ripple about 0.12 N per contact sample Stored values are clamp(φ, −T, +T) with T = 4 fine voxels; quantization ripple at most 1% of weight (GATE-HAB-01) §19.4, §35.7
CX-189 A wet floor is a patch with a constant low friction coefficient Time to thin a film to 10 µm, t = 3π·η·R⁴ / (4·F·h₁²): 0.038 s for a 20 mm foot at 100 N on water, 2.3 s for the same foot on cooking oil, 0.76 s for a 60 mm foot at 400 N on water. Against a stance of about 0.3 s the first reaches boundary contact and the other two do not, on the same patch Film friction depends on dwell time, load and pad size (the film-friction law, GATE-HAB-06) §19.10.2
CX-190 A fixed step is a sufficient proxy for a rug Pushing an undriven wheel over an edge takes W·tan α with tan α = √(h·(2r − h)) / (r − h). A castor with r = 25 mm at a 10 mm edge needs 4/3 of its load, 67 N for a 50 N castor; a 2 kg rug resists sliding with about 0.5 × 19.6 N ≈ 10 N. The rug slides and folds long before the castor climbs; a fixed step would be climbed or would block A rug is a thin free rigid slab with its own friction and an edge step (rigid proxies, GATE-HAB-08) §19.10.2
CX-191 Film transport under a contact can be written with the contact indicator outside the divergence, 1·∇·(h·v̄) Three cells with h = (0, 1, 0), the indicator on the middle cell only and v̄ = +1: the masked update removes Δt/Δx from the middle cell and adds it nowhere. The face-flux form moves the same amount into the right-hand cell Conservative face-flux update; INV-HAB-07, PO-HAB-05; the mass gate of GATE-HAB-07 §19.10.3
CX-192 Living matter means a resolved fluid, cloth or cable solver in every training world A D3Q19 lattice needs 152 bytes per cell: a 10 m × 10 m × 3 m room at 1 cm is 45.6 GB for one world and about 374 TB at 8,192 worlds; a film 0.1–1 mm thick needs 39 GB per square metre; at a 50 Hz step with u = 1 m/s the lattice Mach number is 3.5 at 1 cm against a limit of 0.3; τ − ½ = 6 × 10⁻⁶ for water at 10 cm and 20 ms; with coupled matter in 5% of worlds a coupled world may cost at most 181 rigid worlds ADR-HAB-07: three tiers, only the Solid tier on the critical path; KILL-LIVING §19.10.1
CX-193 A scalar disc test decides whether a body fits A rectangular base 0.60 m wide in a 0.90 m corridor with a right-angle turn. The inscribed disc (diameter 0.60 m) says every length fits; the circumscribed disc says a 1.30 m body (diagonal 1.43 m) cannot. By L ≤ 2√2·a − 2b = 1.346 m, the 1.30 m body passes and a 1.40 m body does not Clearance complexes on SE(2) with a witness, a cut or unresolved (ADR-HAB-08); GATE-HAB-10 §19.11
CX-194 The default clearance lattice alone answers doorway fits At Δ = 5 cm and 32 headings with ρ = 0.40 m the cell error is 74.6 mm, so a doorway fit with total margin under 2e ≈ 149 mm is unresolved; with doors drawn uniformly from 0.70–0.90 m and bases from 0.45–0.70 m, about 22% of pairs fall there, and they are the near fits Local refinement is part of the mechanism (e = 18.7 mm at 12.5 mm and 128 headings, 6.0 mm at 5 mm and 512); KILL-FCLEAR at more than 30% unresolved after refinement §19.11
CX-195 A static rejection settles whether a wheel can climb A wheel of r = 50 mm at a 20 mm edge needs a friction coefficient of 4/3, statically impossible; yet a body arriving at √(2·g·h) = 0.63 m/s has the energy to rise 20 mm before losses. In an executed planar sill study, 62 of 156 cases that a sampled static test rejected succeeded dynamically Static rejection and static admission are candidates for a dynamic test, not substitutes; the retrofit search reruns the full procedure (§19.12 step 3) §19.12, §19.11
CX-196 Splitting train and test scenes by SceneId prevents leakage A layout and its mirror image have different SceneIds and the same aisles; a policy trained on one and scored on the other has seen the test Splits are made over groups (base scene, mirrors, clutter and retrofit variants, shared brick pools, scans of one building); INV-HAB-09, FROB-REF-311; GATE-HAB-14 §19.14
CX-197 Each world can have its own scene 8,192 worlds each with its own 2 cm home is 8,192 × 75 MB = 614 GB, 26 times a 24 GB card and more than twice the working set of the large-memory machine; per-world state is only about 20–53 kB ADR-HAB-05: one scene serves many worlds through a shared brick pool §19.15
CX-198 A narrow band saves an order of magnitude of scene memory, and a 2 cm warehouse is 600 MB A 60 m × 40 m × 8 m warehouse at 2 cm is 4.8 GB dense; 600 MB belongs to 4 cm. The band keeps a fraction min(1, (A/V)·t·s): at 2 cm it saves a factor of one to five, at 1 cm 1.5 to 11, and a cluttered home gains least The memory table of §19.15; measured occupancy at GATE-HAB-13 §19.15
CX-199 Gloss and friction can share one material property A glossy tile can give a bad depth sample and low traction for unrelated reasons; the four-state tile (matte dry, glossy dry, matte wet, glossy wet) separates them: an optical change must leave physics digests unchanged and a contact change must leave ray outputs unchanged (no numeric case is given) ADR-HAB-03: two maps joined only by declared latents; GATE-HAB-05; control: a build that derives friction from r0 §19.2, §19.5.4

N.17 §20 Sensorium: sensors, clocks, observability

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-200 Run a 30 Hz policy every thirteenth step of 400 Hz physics (sub-schedules as integer ratios of the physics tick) 400/13 = 30.77 Hz. Over a 20 s episode, counted on the half-open window, that is 616 decisions instead of 600, and a reward counted per decision is overpaid by 2.7%. The exact schedule (Q = 1,200) realizes decisions at boundaries 0, 14, 27, 40 with lateness 0, 2, 1, 0 quanta and a long-run rate of exactly 30 Hz ADR-SENS-02: rational periods with integer phase accumulators; INV-SENS-04; GATE-SENS-04 §20.4.6
CX-201 An exposure window may be closed at both ends An impact of 0.2 N·s in one 10 ms exposure of a force sensor contributes 20 N to that window's average and nothing to the adjacent one; a closed-closed window counts an impulse on the shared instant in both One half-open window convention [open, close); an impulse exactly at t belongs to the window that opens at t (§20.4.3); GATE-SENS-04 §20.4.3, §20.20
CX-202 A camera exposure that straddles a step can blend the two end poses linearly Across a boundary at which an impact reset a velocity, a linear blend fabricates motion blur and an inertial acceleration that never occurred (no numeric case is given) Interpolation never crosses an impact boundary; the camera samples the segmented pose history (§20.4.4); GATE-SENS-06 §20.4.4
CX-203 Sensor dropout is an independent coin per sample, so repeated reads average it away A sensor reads a payload class correctly three times in four. With independent errors a majority of three reads is right 27/32 of the time, of five 459/512, of seven 3,807/4,096 (93%). With an error common to all reads (the same pane of glass, the same glare) the answer stays right three times in four however many reads are taken ADR-SENS-08: dropout is a function of geometry, the optical card and one latent per region and episode; GATE-SENS-07 §20.6 ≡ CX-052
CX-204 An active sensor in steam is attenuated once The two-way power fraction is exp(−2σ·ℓ): with σ = 2 m⁻¹ and a 5% threshold every return is lost behind more than ln(20)/4 = 0.75 m; the one-way law exp(−σ·ℓ) keeps returns the two-way law loses Optical volumes attenuate an active sensor over the round trip (§20.6); GATE-SENS-07 §20.6, §20.20
CX-205 A full-rank observability Gramian means the robot knows where it is Two aisles that are exact copies of each other give a full-rank local Gramian in each, yet nothing distinguishes one aisle from the other. In the corridor case W = (N/s²)·diag(0, 1) already has the null vector (1, 0), and one end wall restores rank; rank is a local statement The Gramian covers infinitesimal ambiguity; finite ambiguity needs the alias witness (§20.12); GATE-SENS-08, GATE-SENS-09 §20.11
CX-206 More training on the present sensors can satisfy any mission that is solvable world by world T-junction: a charging plate at the end of the left branch in world L and of the right branch in world R, branches 10 m, a planar lidar that cannot see the plate beyond 0.5 m, a battery good for 12 m. Each world alone is solvable; the transcripts are identical up to the turn; a wrong turn costs 9.5 + 9.5 + 10 = 29 m. No causal policy succeeds in both worlds, and with equal priors none succeeds more than half the time PO-SENS-07 (identical transcripts and disjoint success sets exclude every causal policy; bound (1 + TV)/2); FROB-REF-445; GATE-SENS-09 §20.12
CX-207 A sequential sensing rule that reaches 90% accuracy keeps it under a deadline Reads right with probability 3/4; a rule that stops when one class leads by two reads is right 90% of the time with 3.2 reads on average, but is still undecided after six reads with probability 27/512, and forcing a guess then yields 225/256, below 90% Every sensing policy is compared under the mission's deadline, with delay priced (§20.12) §20.12
CX-208 The right sensor exists, so the mission is solvable whatever the packet timing Docking fixture with the reading of v₁ arriving after the third command is committed: a causal controller issues one command vector in both worlds, and the final position g·(2p + u₁) cannot equal 1 for both g = 1 and g = 2. All 561 grid cells are excluded An alias witness whose cause is timing; the seven instants and the delivery deadline are part of the verdict (§20.16, ADR-SENS-03); GATE-SENS-09, GATE-SENS-13 §20.16, §20.12
CX-209 A policy may be made equivariant under the whole mechanical symmetry group Γ_mech A quadruped symmetric fore-aft and left-right has Γ_mech = C₂ × C₂ of order four. With a forward depth camera on the sagittal plane the fore-aft reflection and the half-turn are not symmetries of the closed loop: an obstacle ahead is seen, one behind is not. Γ_obs has order two; augmentation doubles the data, it does not quadruple it INV-SENS-08 and ADR-SENS-11: closed-loop consumers use Γ_obs only; FROB-REF-443; GATE-SENS-10 §20.13
CX-210 A sensor mounted on the plane of symmetry preserves the reflection A spinning lidar on the plane of symmetry: a reflection reverses the order in which beams fire, so with per-beam instants the mirrored robot would need a lidar that spins the other way; the reflection is broken at first order in the product of body rate and scan time. An IMU mounted off the plane breaks the reflection of raw observations too Γ_obs preserves each sensor's pattern including its timing (§20.13); the report states whether the scan was treated as instantaneous §20.13
CX-211 An inconsistent loop of pairwise calibrations identifies the bad measurement Scalar offsets, unit weights, one edge biased by β. Three sensors with three pairwise edges: the least-squares residual is β/3 on every edge, so the loop is known to be inconsistent and the bad edge is not identified. Four sensors with six edges: β/2 on the bad edge, β/4 on the four edges sharing a node with it, zero on the opposite edge Fault localization needs redundancy beyond one cycle; on a tree r_⊥ is identically zero and localization is refused (FROB-REF-446); PO-SENS-08; GATE-SENS-11 §20.14
CX-212 The consistency residual can be taken with the ordinary Euclidean projector Rotations in radians and translations in metres have different scales; the projector I − B·(Bᵀ·W·B)⁻¹·Bᵀ·W is orthogonal in the metric W, and the Euclidean projector gives a different and wrong decomposition whenever W is not a multiple of the identity (no numeric case is given) PO-SENS-08; the negative control of GATE-SENS-11 (anisotropic weights) §20.14
CX-213 A boundary may be tested with a non-strict comparison Docking at U = ¾ with the probe p = 5/8 and ε = 5/16 exactly: both worlds can report 15/16 while requiring u₁ = −¼ (g = 1) and u₁ = −¾ (g = 2). The boundary is ε < (U + ½)/4 with equality excluded; nine of the 561 grid cells lie exactly on it PO-SENS-06; strict predicates in exact arithmetic (class D0, §35); GATE-SENS-13 §20.16
CX-214 A verdict survives a small widening of the hypothesis set Admit a third gain 33/32 beside {1, 2}. At U = ¾ and ε = 1/64 the reading (65/64)·p is possible for g = 1 and for g = 33/32 under every first command; both worlds receive the same remaining commands; final positions are c and 33c/32 and the smallest achievable worst error is 1/65 m at c = 64/65. Every cell admitted under the two-gain mission is wrong for the three-gain mission A verdict is bound to the declared support of the hidden parameters, the delivery deadline, the error units and the target tolerance; a change to any of them invalidates it (§20.16); GATE-SENS-13 §20.16 ≡ CX-049
CX-215 A noise generator may hand out draws in call order Adding, removing or reordering a sensor that no controller consumes shifts the draws of every other sensor, so the first added sensor changes what the others read (no numeric case is given here; §35.9 gives the r₀, r₁, r₂ case) ADR-SENS-10: noise streams keyed by world address, sensor, sample index and component; INV-SENS-06; GATE-SENS-03 §20.17, §20.2

N.18 §21 Spark: GPU backends and the kernel toolchain

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-216 A strict inequality can be decided by a bare f32 comparison Is 16,777,216 less than 16,777,217? In integers, yes. In f32 the second number (2²⁴ + 1) is not representable and rounds to the first, so the strict comparison is false. In the recorded pilot on a 65,536-row grid dense near a boundary, the bare f32 sign gave 452 false inclusions and 23,438 false exclusions (36%), identically on every device; the exact integer kernel gave none ADR-SPARK-03: exact-integer and guarded kernels for strict predicates and digests; FROB-REF-252; PO-SPARK-02; GATE-SPARK-08 §21.8, §35.7, §20.16
CX-217 A kernel belongs on the GPU because it is a kernel The same boundary pilot end to end: the host integer loop took about 34 µs against about 290 µs on Metal (of which under 13 µs was device time) and over 1.2 ms on one RTX 4090; two-card sharding was slower than one card Representation before placement; a small host-resident job stays on the host; the planner's cost model (§21.8 rules 1 and 3, §21.12 rule 4) §21.8, §21.12
CX-218 Strides can be copied verbatim between array libraries A 2 × 2 contiguous f32 view has strides (8, 4) in signed bytes and (2, 1) in unsigned elements. Copying (8, 4) as element strides onto a 16-element buffer reads element 8 + 4 = 12 at index [1, 1], where element 3 belongs; both reads are in bounds, so nothing faults Views carry stride unit and signedness; FROB-REF-617; admission tests INT-FNP-01 and INT-FT-01 §21.5
CX-219 A mask can be applied as an arithmetic blend m·a + (1 − m)·b An infinity in the unselected arm becomes a NaN, since 0·∞ is NaN Dialect rule 8: a mask is a select; §35.5 condition 4 §21.6, §35.7
CX-220 A double-float accumulator works on any compiler The error-free sum of 1 and 2⁻³⁰ must return (1, 2⁻³⁰); a compiler that simplifies the error term algebraically returns (1, 0), and the accumulator silently loses its low word. The product canary: (1 + 2⁻¹²)² must return (1 + 2⁻¹¹, 2⁻²⁴) ADR-SPARK-10: split product, safe math mode, start-up canaries; FROB-REF-609 §21.14
CX-221 A persistent launch with a grid-wide barrier is a safe way to step a whole stretch In the suite's piano renderer such a barrier on Metal "very rarely" leaves one thread group unscheduled, "about once per few hundred launches", and the host reruns the stretch Dialect rule 6: no grid-wide barrier; a stage that needs every world to finish is two launches (ADR-SPARK-09) §21.6
CX-222 Padding a mixed batch to its largest member costs little Ω_p = L_max^p / E[L^p]: degrees of freedom 18 and 35 mixed evenly cost 1.3, 1.6 and 1.8 for p = 1, 2, 3; mixed 90 to 10 they cost 1.8, 3.0 and 4.5 Size buckets with capacities 12, 18, 24, 32, 48, 64 (Ω₁ ≤ 1.45, Ω₃ ≤ 3.1 inside a bucket); KILL-BUCKET §21.11
CX-223 Adding the second machine's GPU to training gives fleet speedup The Mac's GPU adds at most its share of the pair of cards: 0.125 at 25% of one RTX 4090, 0.30 at 60%. Gain can come only from moving non-training work off the training cards, at most 1/(1 − g); a factor of 1.5 needs g ≥ 1/3 The fleet scheduler is funded only if the phase-ledger pilot shows g ≥ 1/3; KILL-FLEET §21.17
CX-224 Per-design specialized kernels should be the default path On an incumbent's event trace of a humanoid, of 262 ns per world-step the stages a specialized recursion could touch sum to 53 ns (20%): an infinitely fast recursion gives 262/209 = 1.25, twice as fast 1.11; a manipulation scene gives 1.19; cold kernel compilation takes about 96 s ADR-SPARK-08: survivors only, only at a specializable share of at least one third, bit-identical to the generic kernel; KILL-SPECIALIZE §21.18, §21.20
CX-225 Factor the contact Hessian in half precision on tensor cores and refine in single precision Half precision has unit round-off 2⁻¹¹ ≈ 4.9·10⁻⁴ and refinement needs κ·u < 1. On contact states of three robots after unit-diagonal scaling, κ·u ≥ 1 in 37 to 64% of states and refinement fails outright in 9 to 18%. A rank-one worst case has κ = 1 + 48/0.01 = 4,801, so κ·u ≈ 2.3. Each refinement step costs about 3n² against n³/3, a ratio of 9k/n: 2.3 at n = 27 and k = 7 Single precision in scaled variables (§35.10); half precision is not used anywhere in the step (§21.14) §21.20
CX-226 Copy-on-write forks of device world state save copying State is write-dense: every step rewrites every world's configuration, velocity, contacts and warm starts, so a fork has copied everything after one step and paid for indirection in every read. The whole copy is small: 8,192 worlds at 30 kB are 0.25 GB, about half a millisecond at the bandwidth of §36.11 Fork by indexed copy of chosen rows into free slots (K-snapshot) §21.20
CX-227 Brick directories need minimal perfect hashing or succinct structures A dense directory with 4-byte slots is 63 × 63 × 19 = 75,411 slots, 0.3 MB, for a 10 × 10 × 3 m interior at 2 cm and 18.8 MB for a 60 × 40 × 8 m warehouse at 2 cm, under 1.5% of the scene it indexes; a hash adds a second, verifying read to every lookup A dense directory per scene variant over a shared brick pool (§19) §21.20
CX-228 A mergeable quantile sketch gives a statistic that does not depend on arrival A two-centroid sketch that merges its closest pair, fed {0, 3, 5, 9}: in the order 0, 3, 5, 9 it ends as (8/3 with weight 3; 9 with weight 1); in the order 0, 9, 5, 3 it ends as (1.5 with weight 2; 7 with weight 2) Integer log-bin histograms (K-x-hist), merged by addition; a quantile is reported as a bin interval (§35.7) §21.20
CX-229 On unified memory the CPU can read live GPU state with zero copy Shared storage must be quiescent before the other processor reads it; and the data are tiny: a humanoid's integration state is about 540 bytes, so shadowing 256 worlds at 50 Hz moves 6.9 MB/s Fenced snapshots under rule R1 and epoch leases (FROB-REF-614); INV-SPARK-06 §21.20, §21.10
CX-230 Unordered floating-point scatter is acceptable if 99.9% of windows replay bitwise 0.999¹⁰⁰⁰ = 0.37: a campaign of a thousand windows would replay exactly about one time in three Stable-key sort and segmented reduction; floating-point atomics banned (§35.6, §35.7) §21.20
CX-231 Tensor-core products for a 256-wide policy speed training The learner and inference together are about 13% of training wall-clock on one incumbent stack, so their removal gives at most 1.15; reduced precision also leaves class D2 Plain f32 products in the dialect; device matrix paths only inside the labeled D4 profile (§35.2) §21.20, §36.4
CX-232 Per-world adaptive time tiles between interactions save work Separate environments are already independent; policy and sensor frames at 50 to 100 Hz bound a tile to 5 to 20 steps; shapes become dynamic Fixed decimation in a static launch graph (INV-SPARK-05) §21.20
CX-233 Full-physics sampling control can be the default evaluator At the smallest published setting (30 samples, 3 iterations, 0.9 s horizon, 50 Hz) a simulated second costs 2.0 M world-steps against 500 for a policy, a factor of 4·10³: a battery of 256 twenty-second episodes takes about 86 minutes of a device at 2.0 M world-steps/s against 1.3 s A sampling controller for single worlds and as a fallback (§22); never a stand-in evaluator for a trained policy (§22.8) §21.20

N.19 §22 Reflex: estimation, control, gaits, skills, shields

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-234 Score an estimator after fitting a scale An estimate of 2 m for a true motion of 1 m has zero residual after a fitted factor of ½; aligned by one translation and one yaw only, it scores 1 m Scoring rule of §22.3; FROB-REF-464 §22.3
CX-235 Report "no solution" when the cone solver fails to converge A 50 N body pushed with 30 N at μ = 0.5 is infeasible, and the proof is the dual vector y = (0.5, −1) with yᵀb = −5 N; an unconverged run has no such vector and proves nothing Three outcomes of §22.6; PO-REFLEX-03 (rational re-check) §22.5
CX-236 Take the lower rows of a space-frame screw Jacobian as the tool-point Jacobian Two-link arm, links 0.4 m and 0.3 m at angles 0 and π/2, limit 2.5 N·m: the point Jacobian gives abs(F_x) ≤ 25/3 N from joint 2; the space-frame rows give a different bound Typed Jacobians (C-02); GATE-REFLEX-08 §22.10
CX-237 Compute gait stability on the symmetric subspace only ẋ = −x, ẏ = +y with symmetry y ↦ −y: on Fix(K) = {y = 0} the multiplier is e^(−T); the full-space multiplier in the antisymmetric block is e^(+T) > 1. The restricted answer says stable for a robot that falls sideways PO-GAIT-01 (full monodromy); GATE-GAIT-01 §22.9.2
CX-238 Resolve simultaneous impacts in a fixed order A uniform bar on supports at ±l/3 (β = 1/3) arriving at v: the coupled solve gives rest; one support first leaves the first end at v/4 with 1/16 of the kinetic energy. The sign of (1 − β)/m decides whether order matters Coupled solve of simultaneous events; no refusal for simultaneity alone (GATE-GAIT-02) §22.9
CX-239 Budget the payload's kinetic energy alone Rotor inertia 5 × 10⁻⁵ kg·m² behind 50:1 on a 0.05 m wheel is 50 kg of effective mass, against an 8 kg cart; T_ub must come from the full mass matrix shield.budget; GATE-SHIELD-01 §22.11
CX-240 Project onto the constraint row, then clip to the actuator box R = I, u_π = (1, 0), box [0, 1]², row u₁ + u₂ ≥ 1.5: the unboxed projection (1.25, 0.25) leaves the box; clipped it is (1, 0.25) and violates the row; the breakpoint solution is u = (1, 0.5) PO-SHIELD-02; GATE-SHIELD-02 §22.12
CX-241 Estimate a monitor's miss rate from the monitor's own log A monitor silent on every breach it cannot see reports δ₁ = 0 from its own output Independent hidden-state labels from the simulator (§22.12); GATE-SHIELD-04 §22.12
CX-242 A transported skill refines its specification if it can select the good branch A target with successors {stable, fall} cannot refine an abstract transition whose only successor is stable FROB-REF-444; GATE-REFLEX-08 §22.10
CX-243 Use the fixed-base pullback τ = JᵀF for a floating-base robot The map must come from the contact-consistent constrained solve (no numeric case is given in the chapter) Limits written into every .fskill artifact §22.10
CX-244 Tie a controller's weights under the mechanical symmetry group Two latches: the in-law controller succeeds and the tied deterministic one fails; on a one-sided patch tying under Γ_mech loses return Stabilizer intersection of §22.13; GATE-REFLEX-07 §22.13
CX-245 Use the sampling controller as an acceptance evaluator because one episode is cheap Bounding a 1% failure rate at 95% takes 299 episodes: about 99 and 299 GPU-minutes under sampling control against about 10 and 60 to train once Screen, not evaluator (§22.8); the planted acceptance request is refused §22.8

N.20 §23 Cortex: the gym, learning, family policies, inheritance

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-246 One done flag is enough for bootstrap targets A true 8 s deadline with terminal reward 0 needs target 0; an external cut on a continuing task with V = 10, γ = 0.99 needs 9.9. One flag gives 0 for both Termination and truncation are distinct (E-rules of §23.3; P-1); GATE-CORTEX-06 §23.3
CX-247 A per-step reward is the same reward at any control rate A penalty of 1 per control step over 10 s totals 500 at 50 Hz and 1,000 at 100 Hz for the same motion Time-aware rewards: rates integrated over simulated time; GATE-CORTEX-06 §23.3
CX-248 A per-step discount is the same discount at any control rate With γ = 0.99 per step, a constant reward rate is worth 2.0·r at 20 ms and 1.0·r at 10 ms; with γ(Δt) = exp(−0.5025·Δt) it is 2.000·r and 1.995·r Physical discounting (P-7) §23.3
CX-249 The density of the sampled Gaussian is the likelihood of the applied clipped action Unit-variance Gaussians clipped at +1 with means 0 and 1: the endpoint-mass ratio is 0.5/0.158655 = 3.15149; the latent densities give e^0.5 = 1.64872 P-3; a mixture of laws is refused (FROB-REF-527) §23.6
CX-250 The clipped surrogate's branch test is the same for both signs of the advantage Negative advantage, ε = 0.2, ratios 0.5, 1, 2: the correct finite differences are 0, −0.5, −1; the reversed branch gives −0.25, −0.5, 0 P-4; GATE-CORTEX-07 §23.6
CX-251 The value loss may use the value stored at collection Critic output 2, stored value and return 0: the gradient of c_V·(V − R)² is 4·c_V; the stored-value form gives 0 P-5; GATE-CORTEX-07 §23.6
CX-252 Concatenated episodes may be evaluated as one sequence Two independently reset one-step episodes: the frozen policy's ratios are 1 and 1; reading across the reset gives 1.582459 P-6; GATE-CORTEX-07 §23.6
CX-253 Average the shard means One sample with gradient 1 and three with gradient 0, shards of sizes 1 and 3: the global mean is 0.25; the mean of shard means is 0.5 Normalization rule of §23.9; P-10 §23.9
CX-254 Normalize with each shard's own variance Shards {0, 0} and {4}: global mean 4/3 and variance 32/9; each shard's own variance is 0 Normalization rule of §23.9; P-10 §23.9
CX-255 Copy stride numbers between array libraries A contiguous 2 × 2 f32 view has strides (8, 4) in signed bytes and (2, 1) in unsigned elements; copied verbatim onto a 16-element buffer, index [1, 1] reads element 12 where element 3 belongs, in bounds; strides (8, −4) have no unsigned form One conversion boundary (§23.4); GATE-CORTEX-09; admission test at INT-FNP-01 and INT-FT-01 §23.4
CX-256 Take the minimum of raw margins in mixed units min(0.05 m, 12 °C) is 0.05 in metres and 12 with the clearance in millimetres; with scales 0.10 m and 10 °C the margins are 0.5 and 1.2 and the clearance binds in every unit system Unit-normalized predicates (C-30); GATE-CORTEX-10 §23.5
CX-257 A learning gate passes when the pipeline runs An exported all-zero policy head passes a plumbing test; zero-weight, random and shuffled-label policies must fail the return threshold Behaviour, not plumbing (§38.11); GATE-CORTEX-01, -14 §23.16, §23.21
CX-258 A ranking found under a pyramidal (box) friction cone is a ranking A planted box-cone exploit flips a planted ranking; the result is typed model-conditional and an honest policy on the circular cone is not flagged Rank robustness of finalists (§23.16); GATE-CORTEX-15; FROB-REF-830 §23.16

N.21 §24 Arena: tasks, requirements, fixtures, metrics, qualification

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-259 Compose raw requirement margins with a minimum Clearance 0.02 m and thermal margin 3 K: the raw minimum is 0.02 (clearance binds); in millimetres it is 3 (thermal binds). With scales 0.10 m and 10 K the margins are 0.2 and 0.3 in either system Unit-normalized predicates (§24.5; C-30); the unit-scaling metamorphic relation of §38.7 §24.5
CX-260 Multiply stage pass rates to get the mission rate Twenty equally likely worlds, two stages each passing in 19: 18 of 20 if the failures differ, 19 of 20 if they coincide; 0.95² = 0.9025 is neither Stage pass rates are reported jointly (§24.5) §24.5
CX-261 Report energy per completed trial only Design A with one 10 J success and one 20 J failure against design B with two 12 J successes: 10 J against 12 J conditional on completion, 30 J against 12 J per completion; the two figures order the designs oppositely Both energy figures are published (§24.8) §24.8
CX-262 Integrate the current, then the wheel speed, explicitly The wheel-loop row has spectral radius 0.9207 with the specified feedforward R·i; at a 0.5 ms step explicit Euler that updates the current before the wheel speed gives 1.497 (and 1.854 for the R·i_ref case of 1.4820), turning the stable case unstable Actuator stage integration; GATE-ARENA-04 §24.10
CX-263 A static screen can settle the sill question In the creep limit design A docks in about one condition in ninety and B in fewer; in a planar pilot of 156 rows, 62 passed the dynamic scorer and failed the quasi-static screen, and none passed the static screen alone A static rejection is a candidate for a dynamic test; momentum, impact and drive transients are in scope §24.10
CX-264 A comparison may leave rotor inertia and controller rate unpinned In an exploratory planar sweep the two designs' success fractions were 0.093 and 0.780 at 100 Hz with zero rotor inertia and 1.000 and 1.000 at 1 kHz or with added inertia: the comparison measured loop stability Mechanism controls of fixture 1; pinned controller arm (§24.12) §24.10
CX-265 A fixed-n study can return any of its verdicts At n = 64 the rule of fixture 1 has 521, 521, 0 and 1,103 outcomes: no outcome is a practical tie, since perfect concordance gives [−0.0662, +0.0662]; a tie is first reachable at n = 86, for (0, 0) only Reachability pre-analysis (eval.preanalyze); FROB-REF-532 §24.10, §24.12
CX-266 Look at a fixed-n test after every pair and stop when it rejects An exact one-sided sign test at nominal 5% on null pairs: 13/256 = 5.08% after 8 looks, 8.76% after 16, 12.9% after 32, 17.4% after 64 Study types are never mixed (INV-ARENA-05); FROB-REF-552 §24.12
CX-267 Resubmit candidates to the same held-out scenes until one passes Independent attempts at 5% each: fourteen null submissions give a 51% chance of at least one false promotion Level α_i = α/[i·(i + 1)] on fresh sealed clusters (INV-QUAL-02, -03); GATE-QUAL-01 §24.13
CX-268 More contact area means more traction Limiting model on a split-grip boundary: at z = +12 mm the 40 mm sole has capacity 0.690 against 0.619 for the 70 mm sole; at z = −12 mm it has 0.360 against 0.431. The ranking reverses with the sign of the offset Fixture 2 decision rule; fidelity-dependent rankings are reported as such §24.11 ≡ CX-179
CX-269 Concatenate separately recorded stage episodes to show a mission The end state of one stage need not lie in the entry set of the next (no numeric case is given in the chapter) Missions are single episodes with until-clauses (§24.5) §24.5

N.22 §25 Augur: mission queries and inverse design

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-270 The midpoint of two feasible designs is feasible Feet at (±1 − e, ±1) m, each capped at 0.5 N, load W at the origin; the positive-x pair carries W·(1 + e)/2. (e, W) = (0, 1.9) and (0.9, 1) each need 0.95 N and pass; the midpoint (0.45, 1.45) needs 841/800 N from a pair capped at 1 N Convexity claimed only in a chart where the constraints are affine with design-independent mission vertices (§25.13) §25.4.7 ≡ CX-010
CX-271 Variants that are pairwise compatible can share a controller Commands (x, y) ∈ [0, 1]²; three variants need x ≥ 2/3, y ≥ 2/3 and x + y ≤ 1. Every pair has a common command; the triple needs x + y ≥ 4/3 and x + y ≤ 1 Minimal conflict sets, not pairs (§25.18) §25.4.7, §25.18
CX-272 A command exists for each design, so one exists for the family Pusher y = max(0, g·u − d), g ∈ [1/2, 2], d ∈ [0, 1/4], target [3/4, 5/4]: the per-build command set is all of [1/2, 2]; the shared command set is empty The quantifier prefix is explicit in the query and in the certificate (§25.4.2); FROB-REF-826 §25.4.2, §25.4.7
CX-273 A feasible allocation exists, so the body is admitted Stance at half-width 1/4 m: the active allocation (155, 135, 105, 5) N fits 160 N ratings; an equal-spring passive suspension produces (175, 115, 85, 25) N The authority that realizes the allocation, and the observations that arrive in time, are part of the certificate §25.4.7
CX-274 The support polygon contains the load and total capacity suffices Of 2,304 bodies in the stance grid, this screen accepts 1,596 that the exact model rejects Per-foot ratings and moment balance together §25.4.7, §25.22
CX-275 Sample points in a cell fail, so the cell is excluded Any cell that straddles a boundary: the 9 boundary cells of the 561-cell docking grid A certificate valid over the cell; otherwise the cell is unresolved §25.4.7
CX-276 Both stages succeed 95% of the time, so the mission succeeds 90.25% Twenty worlds, each stage failing in one: 18/20 if the failures differ, 19/20 if they coincide Joint law or additive budgets (§25.3.5) §25.4.7
CX-277 Each projection of a product covers its marginal outcomes, so the dominance check may enclose them separately Paired outcomes (0, 0) and (1, 1) project onto {0, 1} for both robots and hide the unreachable (1, 0) Enclose the joint outcome set (§25.16; C-40) §25.4.7, §25.16
CX-278 The per-component limits are met, so the assembly is feasible; and its converse, an additive peak rule Two fingers each need one powered tick and the bus powers one per tick: zero one-tick schedules, two two-tick schedules. Local motor limits are identical in both cases, and an additive peak rule prunes the feasible two-tick case The joint, time-dependent resource contract (§25.17) §25.4.7
CX-279 The probe separates every admitted mechanism, so its verdict is safe The three-law probe scores 675 of 675 in class; a fourth mechanism shares the probe's early trace and reverses all 225 held-out decisions Conditional witness; direct measurement of the target is always admitted (§25.14) §25.4.7, §25.14
CX-280 A root of the synthesis equations is a mechanism Crank-rocker 1, 4, 3 on ground 4: B = (11/5, ±12/5) at crank angle π lie on two assembly circuits Circuit and branch certificates (§25.21.3) §25.4.7, §25.21.3
CX-281 A Lie-bracket direction is reachable ẋ = u with u ∈ [0, 1]: rank one, and negative x is unreachable from zero The integrated finite witness §25.4.7
CX-282 A certificate that held for the declared worlds holds when a world is added Docking with gains {1, 2} admits ε < (U + 1/2)/4; adding gain 33/32 at ε = 1/64 leaves no exact docking, best worst-case error 1/65 m, and 34,590 positive labels on the grid reverse Certificates are bound to the declared hypothesis support; revalidation polarity (§25.8) §25.22
CX-283 A static rejection is a rejection Of 156 sill cases, 94 agree between sampled statics and a planar dynamic scorer and 62 static rejections succeed dynamically A static rejection is a candidate for a dynamic test, not a verdict §25.22
CX-284 Compare strict predicates in unguarded single precision On a 65,536-row docking-boundary screen: 452 false admissions and 23,438 false exclusions on the near grid; with the guard and exact fallback, zero final errors and identical bytes on every placement Exact-integer kernel class and guarded f32 (§35) §25.12, §25.22
CX-285 Run the speed test, then interpret it Pusher: composed over specialized median time 1.345 warm; a residual of 575.7 µs that the solver does not touch (parsing, assembly, checking, serialization and harness, not separately timed) bounds a zero-cost solver at about 1.46 (842.8 ÷ 575.7). The test could not have shown a large ratio Compute the ceiling before any speed test (§38.4) §25.22
CX-286 Repeated reads of a sensor always add information Majority vote at 3/4 gives 27/32, 459/512, 3807/4096 for 3, 5, 7 independent reads, and stays at 3/4 when the reads share one fault bit Error dependence is declared (§25.10) §25.10, §25.22 ≡ CX-052
CX-287 A memo keyed by a semantic receipt beats a dependency graph, or may omit an input Four edit states: both do 3 pair evaluations and 2 reductions and match fresh replay; omitting one dependency inherits a stale promotion Complete memo keys; no reuse claim over a correctly keyed graph (§28) §25.22

N.23 §26 Nemesis: adversarial worlds and rare failures

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-288 A world reduced by delta debugging is the smallest failing world The world fails when {a, b} or {c, d, e} is present. With edits listed (a, c, d, e, b), the halves {a, c} and {d, e, b} pass, the singletons and {e, b} pass, the complement {c, d, e, b} fails, and the result is {c, d, e}: 1-minimal with three edits, while {a, b} exists 1-minimal is the only claim; the one- and two-edit subset check (78 tests at most for 12 edits) labels a world minimum among pairs §26.7
CX-289 Any world that defeats the design is a counterexample A doorway narrower than the body defeats every controller; an oracle that checks a point robot calls it solvable ADR-NEMESIS-02, INV-NEMESIS-01: only worlds with a solvable-causal or plant-feasible witness count §26.5
CX-290 A good sampler discounts the price of proving absence At δ = 0.05 a bound of 10⁻⁴ needs 29,956 nominal failure-free episodes, 10⁻⁵ needs 299,572 and 10⁻⁶ needs 2,995,731, whatever the explorer does; inside the qualification lane the tenth request needs 76,959 for 10⁻⁴ Two lanes: exploration finds, nominal or bounded-weight sampling certifies (§26.9) §26.9
CX-291 Importance weights may be unbounded if the proposal is good A mixture without its nominal share on a mis-centred proposal misses the Gaussian tail P(z > 4) = 3.167 × 10⁻⁵; with q = ε·p + (1 − ε)·p_shifted every weight is at most 1/ε = 10 Defensive mixture with bounded weights (§26.9) §26.9
CX-292 Forks of a deterministic simulator give independent children A walk with no noise after the fork returns identical children; the splitting estimate is refused Fresh randomness after a fork (§26.9; C-27) §26.9, §26.14
CX-293 A comparison among survivors validates the screen An e-value between the eighth and ninth finalists is silent about a design the screen discarded at the first rung; no top-k design among 30 audited discards only bounds the false-discard rate at 9.5% Audit of discarded strata and planted winners (§26.10); label screen-biased §26.10
CX-294 A battery made of past failures is a good battery It overfits them; the hard-world set is refused as the only content of a battery, as a confirmation sample (FROB-REF-567) and as nominal draws for a bound (FROB-REF-560) §26.8; one slot in five of a covering battery is drawn from held-out scenes (§24.9) §26.8
CX-295 A failure found under one contact law is a failure of the design Planted box-cone traction and energy-pumping penetration recovery vanish under a law variant and are typed artifact-candidate; a genuine planted failure survives every variant The artifact guard (§26.6) §26.6

N.24 §27 Autopsy: counterfactual debugging

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-296 A Shapley summary tells joint causes from alternative causes Two factors that rescue only together (v of the pair 1, of each single 0) and two that each rescue alone (v = 1 for either single and the pair) both have Shapley values (½, ½); the repair sets are {1, 2} and {1} or {2} The coalition table is the result; the summary is a summary (§27.7) §27.7
CX-297 A positive Shapley value shows a factor is necessary, and values are nonnegative v(∅) = 0, v({1}) = 1, v({2}) = 0, v({1, 2}) = 0 gives (½, −½): a single-factor repair exists and factor 2 is negative because applying it cancels the rescue §27.7; labels but-for, joint, alternative come from the table §27.7
CX-298 Apply a design edit at a mid-episode fork to see whether it prevents the failure Thermal node, time constant 60 s, ambient 25 °C, trip at 115 °C. Ratio 12 trips at 60·ln(192/102) = 37.95 s. Ratio 16 from the start peaks at 82.0 °C and passes; ratio 16 applied at 36.95 s finds the winding at 113.3 °C and trips at 42.4 s Design parameters re-run from the episode start (§27.8); GATE-AUTOPSY-06 §27.8
CX-299 Bisect for the first tick at which two traces differ Two traces of eight ticks differ at ticks 1 and 5: a midpoint search on the pointwise predicate probes tick 3 or 4, sees agreement and reports tick 5; the chained digest reports tick 1 Bisection only on a monotone, decided predicate (§27.10); the same rule for design.bisect over a lineage §27.10
CX-300 Any flip under an intervention is attribution Doubling map with failure on the fortieth iterate: a 10⁻¹² placebo is amplified by 2⁴⁰ ≈ 1.1 × 10¹² and about half of placebo forks flip Placebo forks and the label chaotic: unattributable (§27.5) §27.5
CX-301 A contrast between forks is a proof of cause A contrast is a replayable experiment of class Tested on its tier (no numeric case is given in the chapter) §27.13 §27.13

N.25 §28 Atelier: the studio loop, analyses, comparison, lineage, cascade, decision cores

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-302 Support polygon plus total actuator capacity is a stance screen (A-08) In an exhaustive stance enumeration of 11,520 body and load cases the screen accepts 1,596 bodies that the exact classifier rejects Per-contact force limits enter the cone program; the result names its load-sharing model §28.4
CX-303 Add peak currents on a shared bus (A-23) Two fingers each need one powered tick and the bus powers one per tick: no joint schedule at a one-tick deadline, exactly two at two ticks. A rule that adds both peaks rejects the feasible two-tick design The joint time-indexed contract; a prune is rejected if any discarded design is feasible under the same mission (§28.12) §28.4
CX-304 Connection curvature tests for a misaligned mecanum roller (A-09) A base with misaligned rollers still has spanning curvature, as a differential drive does; the defect is a rank drop in the connection, reported by the growth vector of A-07 A-07 and A-09 are separate analyses §28.4
CX-305 The mechanical symmetry group is the policy's symmetry (A-03) A quadruped with one forward lidar has a four-element group mechanically and a two-element group in closed loop Only the observation-preserving subgroup is used for tying, augmentation and deduplication §28.4
CX-306 A quasi-static energy exclusion needs no approach energy (A-20) 8 kg on a 12 mm rise needs 0.94176 J; a 0.90 J budget excludes the passive crossing; 0.05 J of approach kinetic energy removes the exclusion The budget includes kinetic energy at the start of the segment; the result is outer only for the enclosed model §28.4 ≡ CX-076
CX-307 Per-reading accuracy is the value of sensor redundancy (A-17) Seven independent readings at 0.75 give 3807/4096 ≈ 0.929; seven with a perfectly shared error stay at 0.75 The alias analysis reads the declared error dependence of the cards §28.4 ≡ CX-052
CX-308 An instantaneous-current model of the drive loop is adequate (A-22) 75 mm wheel, total reflected inertia 0.00107890625 kg·m², target held for 10 ms: spectral radius 1.4820 with target-current feedforward and 0.9207 with measured-current feedforward; the instantaneous model gives 2.6917 for both The hold is modelled exactly over the control period §28.4 ≡ CX-262
CX-309 Identify friction from a convenient run (A-25) F = min(k_t·I/r, μ·N), k_t = 0.2 N·m/A, r = 0.06 m: runs at 1 A and 2 A under 30 N and 40 N give 3.33 N and 6.67 N for μ = 0.4 and for μ = 0.8; at 3 A under 10 N they give 4 N and 8 N Zero sensitivity is reported and an excitation in the traction-limited regime is requested §28.4
CX-310 A late observation with the right content serves the decision (A-21) A packet arriving at tick 1 serves decisions committing at ticks 2 and 4; delayed to tick 3 it serves the second and no longer the first Arrival instants are compared with decision instants per decision, in rational time §28.4
CX-311 Key paired seeds by (world, epoch) On a 64-wide batch such seeds pair only morphologies whose indices agree modulo 64 Pair by (world, replicate); a counter that depends on training progress is not part of an address (§28.6) §28.6
CX-312 Pair exogenous draws by event order Two tires on different paths need not receive equal friction samples at corresponding ticks; pairing "the k-th friction draw" pairs nothing (no numeric case is given in the chapter) Exogenous fields are indexed by physical coordinate (§28.6) §28.6
CX-313 Binary search finds the first edit that changed the outcome Outcomes along six versions are pass, fail, pass, pass, pass, fail: the midpoint passes, the search goes right and reports the last edit, while the first edit changed the outcome and the second changed it back design.bisect returns an a-change; first-change only after the prefix is scanned or monotonicity is declared §28.7
CX-314 Enlarging the hypothesis support slightly leaves inclusions valid Docking with gains {1, 2}: adding gain 33/32, indistinguishable from gain 1 at an error radius of 1/64, makes every one of the 34,590 positive decisions on each test grid wrong Revalidation polarity: "hypothesis support enlarged: recheck inclusions" (§28.13) §28.13 ≡ CX-282
CX-315 A memo key may omit delivery time Four-state camera fixture: with the complete key the evaluations are 2, 0, 0, 1 and the recomputations 1, 0, 0, 1; the key without delivery time keeps a stale promotion when delivery is delayed to tick 3 Complete memo keys (§28.13, §28.14) §28.13
CX-316 An optimum survives any change that keeps it feasible Widening the doorway keeps the cost-9 cart feasible and admits a cheaper rival: feasibility is kept, optimality is revoked Revalidation treats feasibility and optimality separately (§28.13) §28.13
CX-317 An in-class-perfect probe is safe to act on A probe synthesized for three admitted material laws is right in 675 of 675 in-class cases; a fourth, delayed law follows the same early trace and reverses all 225 held-out decisions; direct measurement at mission dwell is right in 900 of 900 Measuring the target directly is always on the list (§28.16) §28.16
CX-318 Rank agreement near the top can be assumed Published neighbours report rank correlations of 0.40 overall and 0.50, 0.60, 0.83 on three robots over 17 designs, and sparse Kendall τ of 0.236, 0.740 and 0.159: agreement of 0.7 or better is not supported The rank-agreement ledger; an unmeasured stratum is uninformative (§28.10) §28.10

N.26 §29 Chronicle: telemetry, replay, evidence

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-319 A mergeable quantile sketch is fine on the evidence path A compactor of capacity two that keeps the lower of each sorted pair summarizes 1, 2, 3 as {1 with weight 2, 3} and 3, 2, 1 as {2 with weight 2, 1}: medians 1 and 2. Integer bin counts are 1, 1, 1 in both orders Deterministic integer histograms (§29.7) §29.7
CX-320 Bisect on the pointwise predicate "the states differ at tick t" Two traces differ at ticks 1 and 5 and agree elsewhere: the midpoint search reports tick 5; the chained digest reports tick 1 Never bisect on an undecided or pointwise predicate (§29.8) §29.8
CX-321 Graft a warm start across a design edit in a fork The 60 mm wheel's warm start grafted onto the 75 mm wheel is refused (FROB-REF-582) Fork rules of §29.8; design parameters re-run from the start (§27.8) §29.8, §29.19
CX-322 Downsample an impulse channel by averaging An impulse train averaged over a window loses the momentum transfer that the sum conserves (no numeric case is given in the chapter) Channel kinds declare their downsampling rule (§29.5) §29.5, §29.19
CX-323 Order paginated telemetry by timestamp During concurrent appends a query ordered by timestamp alone repeats or skips equal-time samples; pinned to a committed frontier each of 10⁴ rows appears once Pagination pinned to a committed frontier (§29.12; §32) §29.19
CX-324 Choose which fast-tier episodes to audit after seeing them Audit bits chosen after seeing fast-tier failures, without recorded probabilities, bias the tier correction; with pᵢ recorded before the draw the estimator is unbiased even when the prediction is off by a constant Tier-correction ledger (§29.11) §29.11, §29.19
CX-325 Sample traced worlds by arrival order Arrival-order reservoir sampling gives different traced sets under different slot assignments and shard counts; sampling keyed by world address gives the same set under 100 of each Reservoir by address (§29.6) §29.6, §29.19

N.27 §30 Ground: calibration against reality

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-326 Fit the clock offset to the event being scored The prediction says the wheel crosses the sill at 4.212 s and the log shows 4.180 s. The offset that aligns them reports a crossing-time error of zero and an offset of 32 ms: the whole error has moved into the clock Clock fitting rule 2 (§30.7); GATE-GROUND-02 §30.7
CX-327 Cross-correlating command and response fits the clock A delay of 8 ms with an offset of −8 ms produces the same logs as no delay and no offset; without a shared hardware mark only "delay plus offset" is identified and the card's delay is not updated Clock fitting rule 3 (§30.7); structural alias 5 §30.7
CX-328 A good local fit identifies its parameters Eight structural aliases: armature N²·J_r with link inertia (only I_link + N²·J_r appears when a joint moves alone); Coulomb friction with a constant bias in one direction; viscous friction with back-EMF damping b + k_t·k_e/R under voltage drive; torque constant with the scale of inertia and friction; delay with clock offset; friction coefficient with the torque limit; static friction when the run never dwells at zero velocity; contact stiffness with damping from one drop height Identifiability checks before any fit (§30.8); GATE-GROUND-03 §30.8
CX-329 Friction can be identified from any traction run F = min(k_t·I/r, μ·N), k_t = 0.2 N·m/A, r = 0.06 m: at 1 A and 2 A under 30 N and 40 N the drawbar force is 3.33 N and 6.67 N for μ = 0.4 and for μ = 0.8; at 3 A under 10 N it is 4 N and 8 N Excitation design: the traction-limited regime must be excited (§30.8) §30.8
CX-330 Pool calibration data across regimes to get more points Pooled conformal calibration at a 90% target covers 20 of 20 episodes in one regime and 16 of 20 in a shifted one: 36 of 40, nominal overall and 80% where it matters The cell is the bucket (§30.12) §30.12
CX-331 Score a fit on its own calibration data A fit class without the truth's Stribeck term passes on its calibration data and is rejected on sealed data Frozen predictions and sealed trials (§30.11) §30.21
CX-332 Matching the observed speed validates the model Speed matched by a compensating error in k_t and friction; the energy cross-check marks wrong-reason Energy cross-check in identification (§30.9) §30.21
CX-333 Twenty clean real trials support "under 5%" Zero failures in 20 trials give an upper bound of 13.9% Reachability pre-analysis at registration (§30.11) §30.21
CX-334 Recovering planted parameters from a simulator is a Reality result The truth simulator is the referee with planted parameters; everything it emits is origin = "synthetic" and the claim stays no-claim INV-GROUND-06: synthetic is never promoted §30.21
CX-335 Agreement between tiers shows the model is right Every tier consumes the same actuator card, so Fidelity and Parity results say nothing about whether the card describes a real motor §30.2; the report line giving the share of generic and assumed card fields §30.2

N.28 §31 Foundry: structure, manufacture, lifecycle

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-336 Assemble the peak of every load channel into one design case A simply supported span L carries P at L/3 at one instant and at 2L/3 at another: the mid-span moment is P·L/6 each time; the assembled case gives P·L/3, a twofold over-design. With the second load of opposite sign the assembled case gives zero while each real case gives ±P·L/6: unsafe Time-coherent cases only (ADR-FOUNDRY-03) §31.6
CX-337 Symmetric limbs carry equal loads A payload offset sideways breaks equal loading (no numeric case is given in the chapter) Limb histories are transformed to the canonical limb frame and unioned (§31.6) §31.6
CX-338 Count rainflow cycles per episode and add the results Sequence −2, 1, −3, 5, −1, 3, −4, 4, −2 in units of 40 MPa: ranges 3, 4, 6, 8, 9 with counts 0.5, 1.5, 0.5, 1.0, 0.5 and damage 8.752 × 10⁻⁶. Splitting after the fifth point and finishing each window loses the range-9 half cycle: 7.816 × 10⁻⁶, 10.7% low Residues are carried between episodes and finish is called once (§31.8) §31.8, §31.18
CX-339 Feed unsigned von Mises stress to a cycle counter Unsigned stress changes the cycle count and is refused (no numeric case is given in the chapter) Signed stress only (§31.8) §31.8
CX-340 A zero first-order sensitivity means the feature may be loosened q(x) = x² at nominal zero: the sensitivity is zero and a first-order allocator loosens without limit, while the deviation at tolerance t is t² FROB-REF-165; the band-extreme check (§31.11) §31.11
CX-341 Prune a design whose component peaks add past the bus limit Two gripper fingers each need one powered tick and the bus powers one per tick: no schedule at a one-tick deadline, exactly two at two ticks, with identical motor limits. Adding both peaks prunes a feasible design A prune is rejected if any discarded design is independently feasible under the same mission (§31.12) §31.12
CX-342 Q15 multiplication cannot overflow (−1)·(−1) is 0x8000·0x8000 = 0x40000000, which shifts to 0x8000 and reads as −1; the negation of −32768 overflows Fixed-point obligations (§31.13); FROB-REF-827 §31.13
CX-343 An integrator without a clamp is safe if each step is small Adding 400 counts per tick from zero overflows sixteen bits at tick 82; without a clamp the one-step query returns the state 32,400 at once Fixed-point obligations (§31.13) §31.13
CX-344 Evaluate a life law at the average condition Insulation life halving per 10 K, half the time at T_ref and half at T_ref + 20 K: life is consumed at 2.5/τ_ref; the law at the mean temperature gives 2.0/τ_ref and overstates service duration by 25% Micro windows average the rate, never the input (§31.14) §31.14

N.29 §32 Tether: CLI, daemon, MCP, dashboard, viewer

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-345 Check idempotency by looking up the key, then inserting, in two statements Requests A and B carry the same key and payload. A looks up and misses; B looks up and misses; A inserts; B inserts. Two jobs run and the budget is charged twice One transaction with a unique index on (principal, verb, key) binds key, digest, reservation and job (§32.7) §32.7
CX-346 Paginate by offset Rows at t = 1, 2, 3, 4, page size 2. Page one returns {1, 2}. A chunk from a slower world commits a row at t = 1.5. Offset 2 now returns {2, 3}: row 2 is repeated Pagination pinned to a committed frontier (§32.8.1); FROB-REF-806, -807 §32.8.1
CX-347 Use a cursor on time alone Two worlds each have a sample at t = 2 and the page ends on the first; "after t = 2" skips the second Total-order key (instant, world address, channel, sample index) (§32.8.1) §32.8.1
CX-348 Send 64-bit integers as JSON numbers 2⁵³ + 1 = 9,007,199,254,740,993 decodes to 9,007,199,254,740,992 in a client that reads doubles int53 and u64str / i64str schema types; FROB-REF-808 (§32.8.2) §32.8.2
CX-349 Key telemetry chunks by tick range A retry splits a shard, and ranges [0, 100) and [50, 150) both cover ticks 50 to 99; with range keys both commit Fixed logical chunk partition per (world, episode); FROB-REF-810 (§32.10) §32.10
CX-350 Key telemetry by (world, tick) A reset reuses tick zero, and the second episode overwrites the first The episode index is part of the key (§32.10) §32.10
CX-351 Priority without preemption protects interactive jobs One device, 90% of jobs 10 s and 10% of jobs 30 min (ES = 189 s, E[S²] = 324,090 s²), M/G/1 at utilization 0.7: a short job waits 2,001 s first-come-first-served, 621 s under non-preemptive priority and 0.17 s plus one quantum under preempt-resume. The wait under priority is the remainder of the long job already on the device Slot dispatch with preemption at kernel-batch boundaries (§32.11.2; DC-09) §32.11.2

N.30 §33 Suite consumption

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-352 A branch on abs(ω) ≤ 10⁻¹² rad/s separates straight from curved motion θ = 32 rad, wheel speeds 1 and 1 + 6·10⁻¹³ m/s, track 0.5 m, Δt = 1/400 s: ω = 1.2·10⁻¹² rad/s takes the curved branch, ω·Δt = 3·10⁻¹⁵ rad is below half the spacing of doubles at 32 (2⁻⁴⁸ ≈ 3.55·10⁻¹⁵), θ′ rounds to θ and both differences are exactly zero. Over 400 steps the true displacement is one metre, about (0.83422336, 0.55142668) m The half-angle chord form Δp = v·Δt·sinc(δ/2)·(cos(θ + δ/2), sin(θ + δ/2)); INT-FSIM-05 §33.11 row 2
CX-353 A stride tuple means the same thing in every array library A contiguous 2×2 single-precision view has strides (8, 4) in bytes and (2, 1) in elements; (8, 4) copied into an element-stride view over a 16-element buffer addresses element 12 at [1, 1], where element 3 belongs, in bounds. Byte origin 4 with strides (8, −4) addresses (1, 0, 3, 2), which unsigned strides cannot express A typed converter at the export boundary; no bare stride tuple crosses it; INT-FNP-02 §33.11 row 3
CX-354 A dimension vector is all the typing a quantity needs A torque and an energy have the same vector (kilogram 1, metre 2, second −2); dimension checking alone cannot separate them Distinct aliases over one dimension; the compile-fail test adds a torque to an energy (§33.12) §33.12
CX-355 Import the mesh and trust it A corridor whose far half was never observed appears as empty space in a naive import, and a traversal certificate over it would be false; with the coverage mask the same query returns unknown Unscanned space is unknown, never free (§33.15; §19) §33.15
CX-356 A fallback that exists on paper is a fallback The worker-process fallback is exercised at M0 although inactive: a 2,000-step rollout through the worker must return bit-equal chunk digests, also after the worker is killed mid-job INT-FSIM-18 §33.14
CX-357 A sibling's training code can serve as an oracle or a baseline The suite's only PPO update reverses the clip branch for negative advantage (finite differences −0.25, −0.5, 0 where 0, −0.5, −1 are correct), forms the critic gradient from the stored value (0 where 2 is correct) and forwards two reset episodes as one sequence (ratio 1.582459 where 1 is correct) Not linked, not an oracle, not a baseline; INT-FSIM-06; the same three probes test this project's PPO §33.11 row 1 ≡ CX-252

N.31 §34 Workspace, crates, formats

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-358 Hash the file as written Two files that differ in key order or whitespace, such as {"b":1,"a":2} and {"a":2,"b":1}, would be two designs, and every memoized analysis of the first would miss on the second Canonical serialization before hashing (§34.9); GATE-WS-02 §34.9
CX-359 Hash the in-memory value A hash of a debug rendering or of a struct's layout changes with the compiler, so the same design would change identity at a pin move and every cached result would be orphaned Identity is the hash of the canonical bytes (§34.9) §34.9
CX-360 The view is lossless, so hash either form The S-expression and the JSON of one design are different bytes; a cache keyed on whichever arrived first holds two entries for one design and two verdicts a reader could cite as independent Only the canonical JSON is hashed (§34.9) §34.9
CX-361 Tolerate unknown fields A reader that ignores an unknown required field such as a contact-law selector simulates a different robot from the one described and reports it under the same identity Unknown required fields are refused (§34.9) §34.9
CX-362 Reuse frob-core's hashing in the checker A canonicalization defect in frob-core that drops a field before hashing would be reproduced by the checker, and a bundle whose statement differs from the one the proposer evaluated would pass; with two implementations the hashes disagree INV-LEMMA-05: frob-cert depends on the standard library only; GATE-WS-03 §34.11
CX-363 Crates inside one layer need no order frob-arena could depend on frob-opt for comparison while frob-opt depends on frob-arena for batteries; Cargo rejects the cycle only after both are written Rule L-1's intra-layer rank; check-layers; GATE-WS-01 §34.3

N.32 §35 Numerics and determinism

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-364 A state tolerance implies agreement on the verdict A success predicate x ≥ 1 m, one placement ending at 1.0000001 m and the other at 0.9999999 m: the state error is 2·10⁻⁷ m, inside any envelope, and the verdicts differ. Conversely two placements may end a metre apart and agree that the robot fell ADR-NUM-03: under class D3 task decisions are tested beside states (§35.4); GATE-SPARK-16 §35.4
CX-365 Zero discordant decisions on a small ensemble shows decision equivalence With zero discordant worlds the one-sided 95% upper bound on the discordant rate is about 3/n, so fewer than 300 worlds cannot show 1% at all Decision-equivalence thresholds on a frozen ensemble of at least 4,096 worlds (GATE-SPARK-16) §35.4
CX-366 Seeding the generator makes two arms a replayable pair Seeding fixes the draws, not the order of a reduction. A difference of one unit in the last place grows like e^(λt) and reaches order one after about ln(2²⁴)/λ ≈ 16.6/λ seconds; if uncontrolled arithmetic lowers the pair correlation from 0.95 to 0.50, a comparison needs (1 − 0.50)/(1 − 0.95) = 10 times the episodes (illustrative values) Minimum classes of §35.3: paired statistics refused with an arm of class D4 (FROB-REF-561), attribution refused below D2 (FROB-REF-562); GATE-SPARK-17 §35.3
CX-367 Padding lanes with +0.0 is neutral for a sum The sum of the single active element −0.0 is −0.0 alone and +0.0 when one +0.0 lane is appended, because (−0.0) + (+0.0) = +0.0; the values compare equal, the bits differ, and a digest over bits changes with capacity INV-NUM-02: padding holds the neutral element of its consumer (−0.0 for sums, 1.0 for products, ±∞ for minimum and maximum); GATE-SPARK-15 §35.5
CX-368 A batch-wide observation normalizer is harmless Two worlds observing 1 and 3 and normalized by their batch mean see −1 and +1; the first world alone sees 0, takes a different action and follows a different trajectory INV-NUM-03: statistics across worlds never feed state; normalizers are frozen within a collection segment; GATE-SPARK-15 §35.5
CX-369 Anchored offsets can be kept in [0, 8) A body that drifts to −2⁻²⁵ m must add 8. The number 8 − 2⁻²⁵ is not an f32 (the spacing just below 8 is 2⁻²¹), so the sum rounds to 8.0: the position has moved and has left the cell's range ADR-NUM-06: offsets centred in [−4, 4); PO-NUM-01 (re-anchoring exact for magnitudes 4 to 16); FROB-REF-249 §35.8
CX-370 Absolute positions can be held in single precision Single precision resolves about 7.6 µm at 100 m from the origin and worse beyond, too coarse for contact; a cell-relative offset in [−4, 4) m resolves at worst 2⁻²² m, about 0.24 µm Anchored positions: an integer cell index plus an f32 offset (§35.8); GATE-SPARK-05 at distances up to 1 km §35.8
CX-371 Equal seeds give two designs the same disturbances A sequential stream r₀, r₁, r₂. Design A draws a push (r₀) and a friction (r₁). Design B has one more leg and draws a per-leg value first, so its push is r₁ and its friction r₂. The seeds are equal and the two designs were pushed differently Counter-based streams keyed by address and by the physical entity perturbed (§35.9); INV-NUM-04 §35.9
CX-372 Scale the matrix to make the Cholesky solve accurate Cholesky without pivoting is invariant under two-sided scaling by powers of two: the computed factor of D·H·D is exactly D times the computed factor of H, so scaling does not change one bit of the solve. What scaling changes is the meaning of tolerances and regularization around it ADR-NUM-04; PO-NUM-02 (bitwise metamorphic test); the conditioning figure κ̂ is reported, not improved (§35.10) §35.10
CX-373 One absolute residual tolerance means the same for every row H = diag(1, 10⁻⁸) and a residual (0, 10⁻⁷): its norm passes an absolute tolerance of 10⁻⁶ while the error in the second unknown is 10⁻⁷/10⁻⁸ = 10. In scaled variables with D = diag(1, 10⁴) the residual is (0, 10⁻³) and the test fails, as it should Tolerances and regularization are stated in scaled variables (§35.10 item 2); GATE-SPARK-18 §35.10

N.33 §36 The performance program

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-374 Env-steps and world-steps can be quoted side by side without a decimation 400 k env-steps/s of training at d = 10 is 4.0 M world-steps/s inside training, and cannot stand beside a physics-only figure of 2.0 M world-steps/s on the same card. Incumbents do not share a decimation either: one publishes d = 5, another reports 1.20 M env-steps/s of physics as 4.8 M physics steps per second (d = 4) ADR-PERF-02 and INV-PERF-01: two units, each written with its decimation, with the ordering checked on every report; GATE-SPARK-19 §36.2
CX-375 A faster environment step delivers the ten-fold On one incumbent stack the environment step is 87% of training wall-clock, so removing it entirely gives at most 1/(1 − 0.87), about 7.7; on another physics is about 29% of the environment step, so a faster physics kernel alone gives at most 1.4; removing inference and learning gives at most 1.15. On quadruped briefs no single phase reaches ten-fold Engine throughput is a parity requirement (§36.1); ADR-PERF-05, ceiling first; FROB-REF-866 §36.4
CX-376 A pruning ratio multiplies with a device speedup 100 candidates of 10 s each; pruning removes 90; the ten survivors are the hard ones and accelerate by 2, not by the 5 measured on the full set. The result is 1,000/50 = 20, not 10 × 5 = 50 Rule 2 of the speedup bound: a pruning ratio is never multiplied by a speedup measured on work already removed (§36.5) §36.5
CX-377 Family batching gives a large speedup by itself A generation of 256 designs at 16 worlds and 10 s each is about 10 s of simulation; a mixed batch removes switching and adds padding (30%). If a switch costs 1 s, f = 256/266 = 0.96 and the bound is 266/13 ≈ 20; if a switch costs 0.1 s, f = 0.72 and the bound is 35.6/13 ≈ 2.7. The gain depends almost entirely on the incumbent's cost of switching designs speedup ≤ 1 / (1 − f + f/r + h), with f, r and h measured on the strong baseline's critical path; the switch cost is measured at GATE-SPARK-21 before the experiment of §17 is funded §36.5
CX-378 Optimize the component first and measure the gain afterwards A specialized solver missed its speed gate at 1.345 warm and 1.088 cold; a later measurement showed a residual of 575.7 µs in the specialized batch that the solver does not touch (parsing, assembly, checking, serialization and harness, not separately timed), so a solver of zero cost would have reached about 1.46 (842.8 ÷ 575.7). The ceiling was computable before the experiment ran Ceiling first: an experiment whose ceiling is below its goal is refused (FROB-REF-866) §36.5
CX-379 Two cards train twice as fast An incumbent's own two-card run takes about 325 s against about 410 s on one card, a gain of 1.26: about 45 s of the 410 s is compilation, the learner runs on one stream, and sample efficiency falls as the batch grows Weak and strong scaling are measured separately (rows 5 and 6 of §36.3); KILL-SHARD below a paired lower bound of 1.6 §36.6, §36.3
CX-380 Gradients from shards can be combined as the mean of shard means One sample with gradient 1 and three with gradient 0 give 0.25. Split as {1} and {0, 0, 0}, the mean of shard means gives (1 + 0)/2 = 0.5; with an empty shard it divides by zero or halves the answer The distributed normalization rule: a sum of sums in device order divided by the global valid count (§36.13); GATE-SPARK-20 §36.13, §35.7
CX-381 Device memory limits the number of worlds By the byte model a world is about 35 kB (quadruped) or 97 kB (humanoid): 8,192 worlds are 0.28 GB and 0.79 GB, 1 to 3% of a 24 GB card. Memory limits distinct scenes and camera frames, not worlds: two 640 × 480 cameras on 8,192 worlds are 37.5 GiB Memory arithmetic of §36.10 and §36.12; camera resolution and cadence are part of the task identity, not a performance knob §36.10, §36.12
CX-382 A derived bandwidth ceiling can be used as a planning figure With assumed traffic of 0.2 to 1.5 MB per humanoid world-step the estimate's central ceiling is 0.7 to 1.1 M world-steps/s, below the 2.55 M an incumbent measures on the same class of card: either a step touches fewer bytes than assumed or the efficiency is higher Bytes touched per world-step is measured per launch and reported in the disclosure block (GATE-SPARK-22) §36.11
CX-383 The referee can check every device world A device produces T·h world-seconds per second: for the humanoid row 1.7 M × 2 ms = 3,400. Twenty-four cores at a real-time factor of 0.2 to 1.0 cover 4.8 to 24 of them, 0.14 to 0.7% The referee is a sampler; its share is reported (row 17 of §36.3); batch-cpu shadows more (550 world-seconds per second, 16%) §36.9

N.34 §37 Safety, security, privacy

CX The tempting shortcut The smallest case that breaks it The rule it protects Defined in
CX-384 Let eval.qualify say which worlds failed An agent could run nemesis.search near those worlds, patch for them and resubmit; the α_i schedule would then bound an error rate for a procedure that is no longer the one being run. The receipt carries only the decision, the index, the level spent, the units used and a hash INV-QUAL-01; FROB-REF-840; GATE-SAFE-03 §37.5

N.35 Seeding the negative-control registry

Counts at plan time (FACT, computed from the entries above): 384 entries; 17 state their refutation in words only; 13 share a fixture with an earlier entry in another chapter and are marked "≡".

How an entry becomes a control (DESIGN; the record format is in §38.11):

Kind of shortcut Kind of control Example
A wrong formula or implementation choice mutation: a test build in which the shortcut replaces the rule Explicit Euler that updates the current before the wheel speed (CX of §24.10); a pyramidal friction cone; a two-statement idempotency check
A wrong inference from a right computation planted-input: a request that asks for the unsound conclusion and must be refused A tie verdict at n = 64; a certificate offered with its quantifiers reordered; a scale-fitted estimator score
A wrong screen or prune planted-design: a design the shortcut would accept or discard wrongly A body the support-polygon screen accepts and the exact classifier rejects; the two-tick bus schedule that an additive peak rule prunes
A wrong assumption about worlds planted-world: a world or world pair that separates the shortcut from the rule The T-junction alias; the third docking gain 33/32; the doorway narrower than the body
A wrong experimental procedure a-a or a scripted adversary Peeking at a fixed-n test; resubmission to reused clusters; audit bits chosen after the outcomes

The five fixtures that the thesis chapters require of this catalogue are present: the quantifier-order fixture, the midpoint counterexample, the coupled-bus fixture, the pre-slip aliasing fixture and the omitted-law fixture. The pre-slip aliasing fixture is stated without numbers in every chapter that names it; its numeric instance is owed by the energy-budget tier (§22.11) before it can be registered.

Entries are registered against the gates of the rule they protect. An entry whose rule has no gate is a finding about the plan, reported at the next milestone exit: either the rule gains a gate or the entry is withdrawn with a recorded reason (PO-GAUNT-03).