FrankenRobotics

Known-answer suite

50,586 words38 subsections38 tablesPlan version 1.1

On this page38
M.1 How to read the suiteM.2 Part 0. Document controlM.3 §1 What exists, what is missing, what this isM.4 §2 The ten-fold thesisM.5 §4 Bets, each with its falsifierM.6 §7 North-Star scenariosM.7 §8 The seven claims and the claim productM.8 §9 DoctrineM.9 §10 The constructionsM.10 §11 ConventionsM.11 §12 Lemma: proofs, certificates, the offline auditorM.12 §13 Marrow: the algebraic coreM.13 §14 Skeleton: design language, modules, archetypes, preflightM.14 §15 Sinew: actuators, transmissions, powerM.15 §16 Kinesis: dynamics on three tiersM.16 §17 Phylum: families of bodies in one batchM.17 §18 Traction: collision, contact, wheels, tracks, terrainM.18 §19 Habitat: scenes, living worlds, clearance, retrofitsM.19 §20 Sensorium: sensors, clocks, observabilityM.20 §21 Spark: GPU backends and the kernel toolchainM.21 §22 Reflex: estimation, control, gaits, skills, shieldsM.22 §23 Cortex: the gym, learning, family policies, inheritanceM.23 §24 Arena: tasks, requirements, fixtures, metrics, qualificationM.24 §25 Augur: mission queries and inverse designM.25 §26 Nemesis: adversarial worlds and rare failuresM.26 §27 Autopsy: counterfactual debuggingM.27 §28 Atelier: the studio loop, analyses, comparison, lineage, cascade, decision coresM.28 §29 Chronicle: telemetry, replay, evidenceM.29 §30 Ground: calibration against realityM.30 §31 Foundry: structure, manufacture, lifecycleM.31 §32 Tether: CLI, daemon, MCP, dashboard, viewerM.32 §33 Suite consumptionM.33 §34 Workspace, crates, formatsM.34 §35 Numerics and determinismM.35 §36 The performance programM.36 §37 Safety, security, privacyM.37 Coverage and gapsM.38 Values that could not be reconciled with their own formulas

This appendix is the printed form of the known-answer registry of frob-conformance (§38.6). It compiles every known answer that a chapter states: 835 rows, numbered KA-001 to KA-835, grouped by chapter in the order of the outline. A row is a case with a truth that a test can compare against, the tolerance of the comparison, the tier and site on which it runs, and the negative control that must make it fail. The registry is the authority; this table is generated from it and is never edited by hand (ADR-GAUNT-02).

M.1 How to read the suite

Columns.

Column Content
KA The row's number. Numbers are append-only: a row is never renumbered and a number is never reused (INV-GAUNT-07)
Where stated The subsection or construction that states the case, with the invariant, proof obligation or gate that owns it where the chapter names one. The mark "≡ KA-nnn" means the row uses the same fixture as an earlier row in another chapter (ADR-GAUNT-06): one tests the mathematics, the other the subsystem. Marks are printed where two rows share printed constants; the registry holds the complete map
The case The fixture: bodies, parameters, inputs
The truth The formula or value, with the derivation steps the chapter gives. Values are carried as the chapter prints them and are not improved in transit (§38.6, rule 5)
Tolerance exact for integers, rationals, Booleans, verdicts, labels and digests; a stated value, with the gate that states it; "to the printed digits" for half a unit in the last digit printed; to set where the chapter states none (OPEN-GAUNT-2)
Tier The Gauntlet tier and the execution site, as G<k> · <site>. Tiers are those of §38.2. Sites: host (exact or double-precision arithmetic in a test), auditor (frob-verify), referee, strict (batch-cpu under the strict profile), lockstep (the throughput tiers under the lockstep profile), cuda, metal, daemon, all tiers. "Synthetic" and "simulated" qualify a site that runs on planted data or under the simulation runtime
Negative control The mutation or planted failure that the row must catch, as the chapter states it; none stated where it states none (OPEN-GAUNT-3)

Labels. Fixture constants are DESIGN choices. A truth derived from them by hand is DESIGN arithmetic with a derivation file under docs/derivations/. A truth that quotes a planning pilot, a sibling's source or a publication is FACT, to be re-run or re-read from its primary source before a gate cites it; such rows say so. A threshold inside a row (a pass count, a percentage, a bound of a gate) is the TARGET of the gate named beside it. No row is a measurement of this project: nothing here has been run on FrankenRobotics code.

Rules.

  1. A row runs first on the weakest site that can decide it and then on every tier its gate names.
  2. A row whose tier is G3 is a relation with an exact expected equality; it is also registered in §38.7. A row whose tier is G4 or G5 has a truth of the form "zero violations" or "equal digests".
  3. A fixture stated by a construction of §10 and again by its owning chapter has a row in each place. The derivation file is shared.
  4. A row printed with to set or none stated is an obligation, not a test: it cannot support a gate until the missing part is registered (GATE-GAUNT-02).
  5. A row whose printed value disagrees with its own formula keeps the printed value and is listed in M.38.

M.2 Part 0. Document control

KA Where stated The case The truth Tolerance Tier Negative control
KA-001 §0.7 Ceiling pre-check on the recorded solver comparison: a composed solver took 1.345× the time of a specialized one warm and 1.088× cold, and 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) No solver could have shown more than about 1.46× (842.8 ÷ 575.7); a speed test whose claimed ratio exceeds its computed ceiling is refused before it is locked to set (the text prints 1.46) G1 · host A claimed ratio above the ceiling submitted for locking, which must be refused
KA-002 §0.7 Reachable verdicts of a frozen fixed-n rule with 64 pairs (the rule of C-15 and §24.10) Three of its four verdicts are reachable at n = 64; the fourth is first reachable at 86 pairs exact G0 · host A study that needs the fourth verdict at n = 64, which must be refused at admission

M.3 §1 What exists, what is missing, what this is

KA Where stated The case The truth Tolerance Tier Negative control
KA-003 §1.7 Admission test for fs-mbd planar_drive: heading 32 rad, wheel speeds that differ by 6 × 10⁻¹³ m/s, one second of travel The displacement is about (0.834, 0.551) m, checked against an independent SE(2) exponential to set G1 · host The reported defect: the routine returns zero translation; the admission test must fail on a commit that has it and pass after the upstream fix (BET-04)
KA-004 §1.7 Admission test for fs_g1_train::ppo_update: two independently reset one-step episodes are concatenated under a frozen policy The second probability ratio stays 1 to set G1 · host The reported defect: the ratio moves from 1 to 1.582459
KA-005 §1.7 Admission test for fs_g1_train::ppo_update: a negative advantage The clipped surrogate is applied on the correct side of the ratio exact (verdict) G1 · host The reported defect: the clip on the wrong side of the ratio
KA-006 §1.7 Admission test for fs_g1_train::ppo_update: the critic gradient into the shared bias Non-zero, equal to the gradient of the squared-error objective to set G1 · host The reported defect: a zero gradient
KA-007 §1.7 Stride convention between franken_numpy and frankentorch The converted stride reads 3 exact G1 · host An unconverted stride, which reads 12
KA-008 §1.7 Sustained articulated contact while rolling around a sharp lip The material witness and the contact frame both change, and the referee's transactional step migrates the witness (§16) exact (verdict) G1 · referee A step that assumes fixed material witnesses and a fixed frame

M.4 §2 The ten-fold thesis

KA Where stated The case The truth Tolerance Tier Negative control
KA-009 §2.1 Completion cap on the ratio of restricted mean times: the candidate misses a fraction q of deadlines R ≤ 1/q; with 12% unfinished the ratio cannot exceed 25/3 ≈ 8.33; with one mission in eight unresolved it cannot show ten-fold exact G1 · host none stated
KA-010 §2.3 Engine-speed ceiling at a fixed sample count: an infinitely fast environment step with share s of training time At most 1/(1 − s): about 7.7× at s = 87% (rough-terrain humanoid; 1/(1 − 0.87)), 6.7× at 85% (dexterous hand), 1.9× at 46% (cart-pole), and about 1.4× from physics at 29% of the full environment step on another stack exact as a rational; the text prints rounded values G1 · host none stated
KA-011 §2.3 Design-cycle ceiling: a cycle of 120 s with no training in it 3.0–3.5× against an incumbent quadruped cycle of 360–420 s; about 15× against a 30-minute humanoid run exact G1 · host none stated
KA-012 §2.3 One design per agent turn, with the same agent latency t in both arms At most (300 + t)/t against about 300 s of incumbent training: 3.5–6× for t between 60 and 120 s; against the one-card figure of 410 s the same cap is 4.4–7.8× exact as a rational; the text prints rounded values G1 · host none stated
KA-013 §2.3 Compute per decision: 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; a ratio of ten needs f ≤ 0.7%; no f reaches ten if the cheap rung costs more than 41 GPU-s exact as a rational; the text prints rounded values G1 · host none stated
KA-014 §2.3, D-10 General bound: a fraction f of the matched wall time improved by a factor r, with added overhead h Speedup at most 1/(1 − f + f/r + h); about 13.5× at f = 0.97, r = 40, h = 0.02; infinite acceleration of 85% of the time cannot reach ten exact as a rational; the text prints rounded values G1 · host A pruning ratio multiplied by a speedup measured on work the pruning already removed
KA-015 §2.2 Pruning trivial failures: 16% of trained candidates degenerate Trainings fall by at most 1.19× exact as a rational; the text prints a rounded value G1 · host none stated
KA-016 §2.4 Paired tier correction in the limit of free fast-tier samples, tier correlation ρ Gain 1/(1 − ρ²): 2× at ρ = 0.7, 3× at 0.82 and 10× at 0.95 exact as a rational; the text prints rounded values G1 · host none stated

M.5 §4 Bets, each with its falsifier

KA Where stated The case The truth Tolerance Tier Negative control
KA-017 §4 BET-28 Omitted-law fixture for calibration bands: a fixture with an omitted law passes every in-family residual check and reverses the decision (recorded pilot: 675 of 675 correct in class, 0 of 225 on the omitted law) The exchangeability alarm fires or a refusal is returned; no band is issued on the omitted-law cases exact (verdict) G1 · host A band issued on the omitted-law cases
KA-018 §4 BET-08 Boundary screen for strict predicates in single precision (the screen of D-18): 65,536 boundary cases Unguarded comparison gives 452 false admissions and 23,438 false exclusions; under the guard with the exact fallback the screen ends with zero errors exact G1 · all tiers The unguarded single-precision comparison, which must show the errors

M.6 §7 North-Star scenarios

KA Where stated The case The truth Tolerance Tier Negative control
KA-019 §7 NS-13 Stance family, inner set: 400 N on four point feet at (±a, ±b) with a = 1/3 m; centre of mass anywhere in a rectangle of half-dimensions 150 mm by 75 mm; each foot delivers a commanded normal force in [0, 160] N; b free Every b ≥ 3/14 m is in the inner set, with the corner allocation (160, 130, 110, 0) N as its witness; the boundary has zero reserve on two constraints; frob-verify re-checks the bundle offline in exact rational arithmetic exact G1 · auditor none stated in §7 (the bundle mutations are in §12.4)
KA-020 §7 NS-13 Stance family, exclusion Every b < 3/14 m is excluded with a dual vector as the impossibility witness; at b = 0.20 m one foot would have to carry 165 N exact G1 · auditor none stated in §7 (a perturbed multiplier is the mutation of §12.7)
KA-021 §7 NS-13 Stance family at b = ¼ m under commanded forces Admitted with the allocation (155, 135, 105, 5) N exact G1 · auditor none stated
KA-022 §7 NS-13 Stance family amended to a passive equal-spring suspension, at b = ¼ m The springs deliver (175, 115, 85, 25) N against the 160 N rating; result.revalidate withdraws the earlier inner set and says what must be re-solved exact G1 · host An inner set carried across the amendment
KA-023 §7 NS-22 Docking fixture, packet on time: a cart must reach position 1 at rest in three one-second ticks; acceleration g·u with g ∈ {1, 2}; commands bounded by U; the only informative packet is the first velocity reading With U = ¾ a first command of ¼ identifies the gain and both worlds dock exactly exact G1 · auditor none stated
KA-024 §7 NS-22 Docking fixture, tolerable sensor error Docking tolerates a sensor error ε exactly when ε < (U + ½)/4; choosing the probe and the feedback together raises the tolerable error from 1/8 to 5/16 on the same actuator exact G1 · auditor none stated in §7 (equality at the boundary is the control of C-17 and C-19)
KA-025 §7 NS-22 Docking fixture, packet late No causal controller docks in both worlds exact (verdict) G1 · auditor none stated
KA-026 §7 NS-22 Docking fixture with a third gain 33/32 admitted It aliases with gain 1 at an error radius of 1/64; exact docking becomes impossible; every label that was feasible reverses exact G1 · auditor none stated

M.7 §8 The seven claims and the claim product

KA Where stated The case The truth Tolerance Tier Negative control
KA-027 §8.2 Claim product of a design comparison that 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 determinism class D2 (Tested) A Design comparison of class Estimated; weakest input: the friction field of the card; tier: the GPU tier, so provisional until promoted; reality scope no-claim exact G0 · host A product reported at the class of its strongest input
KA-028 §8.2 Compile-fail tests on the claim-product type Three things do not exist and each is pinned by a compile-fail test: a conversion from ClaimProduct into a Proved value; a setter for class; a public constructor that takes a class as an argument exact (verdict) G0 · host A crate that adds any of the three, which must fail to compile
KA-029 §8.2 ClaimProduct::combine Class, tier and determinism take the weakest; scope takes the intersection; conditions take the union; a mismatch of quantifier order is a refusal exact G0 · host Parts with mismatched quantifier order, which must be refused
KA-030 §8.2 NoAuthorization on every exported artifact execution_authorized, hardware_safety_signoff and sim_to_real_certified each serialize as the JSON literal false; no constructor produces true exact G0 · auditor A bundle with a flag missing or true, which the auditor must reject
KA-031 §8.3 rule 6 A bundle whose assumptions are missing frob-verify refuses it exact (verdict) G0 · auditor The bundle with its assumption list removed
KA-032 §8.3 rule 8 Quantifier-order fixture: a plant in which every build has a command that works and no single command works for all builds "For every world, some controller works" and "one controller works for every world" receive different answers; evidence for the easier order is rejected, and the auditor rejects a changed quantifier even when every hash is consistent exact (verdict) G0 · auditor Evidence for the easier quantifier order; a bundle with the quantifier changed and consistent hashes

M.8 §9 Doctrine

KA Where stated The case The truth Tolerance Tier Negative control
KA-033 §9 D-17 Generic comparator on the static-stance family of C-32 (recorded pilot, to be re-run in this repository before a gate cites it) A lifted robust linear program and the specialized projection each reach the optimum in one solve, and return the same optimum exact G2 · host none stated
KA-034 §9 D-18 Strict decisions on a screen of 65,536 boundary cases (recorded pilot, same caveat) An unguarded f32 screen produces 452 false admissions and 23,438 false exclusions; a guarded or exact-integer kernel produces none exact G1 · all tiers The unguarded f32 comparison
KA-035 §9 D-19 Model assumption as a named input: one winding feed-forward term in a sampled wheel controller (recorded pilot, same caveat; the fixture is the wheel-loop row of §24.10) The one-tick spectral radius moves from 1.48 to 0.92 and 24 of 156 task labels change to set (spectral radii printed to two decimals); exact (label count) G1 · host The assumption left as prose and not as a field of the claim
KA-036 §9 D-19 One extra hidden gain admitted on the docking fixture of C-19 (recorded pilot, same caveat) Every feasible label on the pilot's grid reverses exact (verdict) G1 · host Inclusions carried across the enlarged world set

M.9 §10 The constructions

KA Where stated The case The truth Tolerance Tier Negative control
KA-037 C-01 Sarrus linkage: mobility by intersections and products in the subgroup lattice Mobility 1; the Grübler–Kutzbach count gives 0 exact G1 · host The count alone, which returns 0; pilot falsifier: one wrong mobility against the rank of the constraint Jacobian at exact rational sample points
KA-038 C-01 Bennett linkage: mobility by the same analysis Mobility 1; the Grübler–Kutzbach count gives −2 exact G1 · host The count alone, which returns −2
KA-039 C-01 Bracket-closure classification of a screw basis in exact rational arithmetic (T-11) A basis whose span is closed under the bracket is a connected subgroup in one of the twelve conjugacy classes; the six lower pairs classify as revolute, prismatic, helical, cylindrical, planar and spherical; a universal joint is not a subgroup and is a product of one-parameter subgroups exact G0 · host none stated
KA-040 C-02 Functor law of the adjoint (T-04) on a sample set with tiny angles, translations near the origin, rotations approaching π from both sides and sign-equivalent quaternions Ad(g·h) = Ad(g)·Ad(h) to set G0 · host A single reversed adjoint, which must fail at least three independent fixtures: the composition law, the pairing and the planar fixture of C-04
KA-041 C-02 Frame invariance of power (T-05) on the same sample set The pairing of a wrench with a twist is unchanged when the twist is moved by Ad_g and the wrench by Ad_g⁻ᵀ to set G0 · host A wrench moved by the twist map
KA-042 C-02 Loop of chart changes Returns to the identity inside its stated error budget; a chart pair that exceeds the budget is withdrawn from the derivative path and the query is refused the chart pair's stated error budget (value to set) G3 · host none stated
KA-043 C-03 Round trip between the pseudo-inertia P = [[Σ, h], [hᵀ, m]] and spatial inertia; physical consistency (T-19) The round trip is the identity; the parameters are physically consistent exactly when P is positive definite; triangle-inequality violations are detected to set G0 · host A seeded triangle-inequality violation, which must be detected
KA-044 C-03 Mass-support fixture: a centred 1 kg part with three principal moments of 0.008 kg·m² in a ball of radius 0.10 m It passes the positivity and triangle tests and fails the bound ‖c − o‖² + tr(I_C)/(2m) ≤ ρ²: it needs 0.012 m² where the ball allows 0.010 m² exact G1 · host A check that stops at positivity and the triangle inequalities
KA-045 C-03 Mass-support equality case: an isotropic thin shell of radius 0.10 m Moments 1/150 kg·m²; the bound is met with equality exact G1 · host none stated
KA-046 C-03 Shell fixture: an aluminium box of 0.4 × 0.3 × 0.2 m at 2,700 kg/m³ Mass 64.8 kg as a solid and 3.45 kg with a 2.5 mm wall, a ratio of 18.8 to set (values printed to three significant figures) G1 · host A solid fill of the enclosure that passes without a density warning
KA-047 C-04 Ballistic flight of an articulated body The centre of mass follows a parabola and angular momentum about it is constant; the change of angular momentum minus the external angular impulse about one fixed inertial origin is zero to set G1 · referee none stated
KA-048 C-04 Structure identities of the smooth equations M(q)·v̇ + h(q, v) = B(q)·u + J(q)ᵀ·f + f_ext Kinetic energy equals ½·q̇ᵀ·M·q̇; Ṁ − 2C is skew to set G0 · host none stated
KA-049 C-04 Planar 2R chain: link lengths 0.4 m and 0.3 m, joint angles 0 and π/2, axes along +z Tool point (0.4, 0.3) m; J = [[−0.3, −0.3], [0.4, 0.0]] m/rad; a tool force (10, 0) N gives both joint torques −3 N·m; joint rates (0.2, −0.1) rad/s give tool velocity (−0.03, 0.08) m/s; both power computations give −0.3 W; the symbolic expression, the CPU operator and the device kernel compiled from the same part graph all reproduce the fixture exact in rational arithmetic; to set on devices G1 · all tiers Taking the lower three rows of the space Jacobian as the point Jacobian
KA-050 C-04 Point-velocity column of a space screw column (ωᵢ, vᵢ) The column at p is vᵢ + ωᵢ × p; the space Jacobian pairs with the wrench (p × F, F) about the origin and the point Jacobian pairs with F exact G0 · host The lower-three-rows shortcut
KA-051 C-04 Limb summarized at its attachment port: elimination of a joint axis s by I − I·s·(sᵀ·I·s)⁻¹·sᵀ·I One direction is removed; for I the identity and s the first axis the result is diag(0, 1, 1, 1, 1, 1), positive semidefinite and not definite exact G1 · host A limb packet treated as positive definite
KA-052 C-05 Cayley retraction cay(x) = (I − x/2)⁻¹·(I + x/2) on SO(3) and SE(3) The result lies exactly on the group; on SE(3) the rotation is cay(ω̂) and the translation is (I − ω̂/2)⁻¹·v; the step rotates by 2·atan(‖ω‖·h/2) instead of ‖ω‖·h (GB-01); a substep with ‖ω‖·h above 0.2 is refused (FROB-REF-212) exact as a polynomial identity (T-01, T-02) G0 · host An additive quaternion increment followed by renormalization
KA-053 C-05 Group-membership residual over a long rollout Within four units in the last place over 10⁷ steps with the per-step normalization on; growth no faster than a random walk with it off four units in the last place G1 · all tiers none stated
KA-054 C-05 Free flight under the structure-preserving step Momentum is conserved; the energy error stays bounded; the measured order by step halving is two to set G1 · referee none stated
KA-055 C-06 Pyramid-cone exploit The box abs(γₜ₁) ≤ μ·γₙ, abs(γₜ₂) ≤ μ·γₙ admits (μ·γₙ, μ·γₙ), of norm √2·μ·γₙ: 41% of traction that does not exist along the diagonals; the planted exploit is caught by the model-form check exact G1 · lockstep The pyramid cone planted as the contact law
KA-056 C-06 Cone identities The projection identities of the friction cone hold (T-07); the Hessian of the convex compliant problem is positive semidefinite by construction (T-08) to set G0 · host none stated
KA-057 C-06 Factor reuse on a fixed active set Each reused column satisfies ‖x̂ − x*‖ ≤ ‖b − A·x̂‖/λ, with λ a lower bound on the smallest eigenvalue; a column that crosses a stick, slip or open boundary is rerouted to the full solve the stated bound G1 · lockstep A column that crosses a boundary and is not rerouted
KA-058 C-07 Growth vectors of rolling-constraint distributions Differential drive (2, 3); car-like with steering (2, 3, 4); car with one trailer (2, 3, 4, 5); ideal omnidirectional base (3) exact G1 · host none stated
KA-059 C-07 Constant-twist step: Δp = v·Δt·sinc(δ/2)·(cos(θ + δ/2), sin(θ + δ/2)), δ = ω·Δt, sinc(0) = 1 A unit-speed half turn through +π in one second gives the chord (0, 2/π) m to set G1 · host none stated
KA-060 C-07 Planar pose integration Exact straight travel, near-zero curvature, wrapped and unwrapped headings, and incremental against one-shot integration agree to set G3 · host The near-straight defect reported in fs-mbd planar_drive: 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
KA-061 C-07 Rolling disk and Chaplygin sleigh Trajectories of the ideal-rolling model, which is the known-answer oracle for the frictional wheel contact (C-07 names the cases and gives no values) to set G1 · referee none stated
KA-062 C-07 One-sided input: ẋ = u with u ∈ [0, 1] The bracket rank is one and negative x is unreachable from zero; a finite mission needs an integrated witness exact G1 · host Bracket rank read as reachability
KA-063 C-07 Four-wheel fixed-axis base with axles at ±a under lateral no-slip v_y + a·ω = 0 and v_y − a·ω = 0 force ω = 0; yaw exists only under a separately qualified slip model exact G1 · host Ideal rolling applied to a skid-steer base
KA-064 C-08 Elroy's beanie: two coaxial bodies with inertias I₁, I₂ and zero momentum A relative rotation Δψ rotates body 1 by −I₂/(I₁ + I₂)·Δψ to set G1 · host none stated
KA-065 C-08 Planar three-link floating body: holonomy of a shape loop Net rotation per cycle agrees with direct integration, with the loop doubled, reversed and sped up until the approximation breaks; the same physical gait reconstructed in another body frame predicts the same motion to set G1 · host The component formula with the bracket term's sign flipped, which must fail the same loop by an error of order one
KA-066 C-09 Step equivariance for every generator of Γ_mech (T-10) f(ρ_X(g)·x, ρ_U(g)·u) = ρ_X(g)·f(x, u) to round-off; ρ(g)·M(q)·ρ(g)ᵀ = M(ρ(g)·q) round-off (value to set) G3 · all tiers A mirror sign table that flips all three axes, or none
KA-067 C-09 Representation identities of the finite groups Characters are orthogonal; isotypic projectors are idempotent; the Reynolds operator W ↦ (order of Γ)⁻¹·Σ_g ρ_out(g)·W·ρ_in(g)⁻¹ projects onto the equivariant maps exactly; a complex-type pair parameterized by 2×2 blocks [[a, −b], [b, a]] equals the average exact G0 · host none stated
KA-068 C-09 Parity 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 exact G1 · host A table that flips all three, or none, which fails the step-equivariance test
KA-069 C-09 Two latches: two identical latches of which exactly one must close At a reflection-fixed observation a deterministic policy tied by the reflection issues equal commands, and both equal commands fail; either asymmetric choice succeeds; a policy that draws one of the two uniformly is equivariant in law; the studio reports the tied deterministic class as excluded and nothing more exact (verdict) G1 · host A report that the task itself is infeasible
KA-070 C-09 The two groups of a quadruped with a front-only lidar Γ_mech = C₂ × C₂ and Γ_obs = C₂ exact G1 · host Γ_mech used where Γ_obs is required
KA-071 C-09 Broken symmetry: a one-sided payload is added The reflection leaves Γ_obs, and the reduced calculation is replaced by the full one without an author's edit exact (verdict) G1 · host none stated
KA-072 C-10 Quadruped gait atlas The (H, K) pairs recover the primary gaits reported by Golubitsky et al. (1999); H/K is cyclic; the enumeration is decided exhaustively on the subgroup lattice (T-25) exact G1 · host none stated
KA-073 C-10 Max-plus timing of a trot schedule x(k+1) = A ⊗ x(k) The eigenvalue equals the stride period computed by hand; the eigenvector gives the steady phase offsets exact G1 · host none stated
KA-074 C-11 Spatial 3R positioning chain Up to four inverse-kinematics solutions; the certified solver finds exactly the solutions the closed form gives exact (solution set); to set (root values) G1 · host A missed or a spurious solution against the closed form
KA-075 C-12 Functor laws of the five design functors Each functor commutes with composition exact G0 · host none stated
KA-076 C-12 Energy balance of a composed design at every step Supplied = stored change + dissipated + exported; the port powers of a composition sum to zero; an algebraic loop is refused "to tolerance" (value to set) G1 · all tiers A reversed port sign, which must be refused
KA-077 C-12 Budget fixed point by Kleene iteration Matches the closed form of GB-03 to set G1 · host none stated
KA-078 C-12 Rational gear law (T-15) Holds as an identity exact G0 · host none stated
KA-079 C-12 Invalidation controls on a modular design A mirror swap of a leaf reuses its siblings' results; an edit to the shared bus invalidates every global result exact (verdict) G3 · host One stale result after an edit (the falsifier of the 64-edit pilot)
KA-080 C-12 Two-finger bus fixture: two fingers with identical local summaries on one unit-current bus No one-tick schedule is feasible and two two-tick schedules are; the task is not pruned exact G1 · host A port contract that adds peak demands and rejects the task
KA-081 C-13 Consistency of the invariant filter Normalized estimation error squared lies inside its χ² bounds the χ² bounds (level to set) G1 · referee none stated
KA-082 C-13 Geometric PD from attitude errors near π Converges to set G1 · referee none stated
KA-083 C-13 Control programs over the cones of C-06 KKT residuals of every program are inside tolerance to set G1 · host none stated
KA-084 C-13 Scoring gauge for a metric gravity-referenced estimate Aligned with one translation and one yaw per trajectory and never with a fitted scale exact (rule) G1 · host A scale-fitted score: a 2 m estimate of a 1 m motion has zero residual after a factor of ½
KA-085 C-14 Emitted kernels against their derivation Emitted Rust agrees with FrankenSymPy's own evaluation and with fs-ad dual numbers; emitted GPU source agrees with emitted Rust on each backend GATE-SPARK-02 G2 · all tiers none stated
KA-086 C-14 Adjoint duality for every derivative pair ⟨J·v, w⟩ = ⟨v, Jᵀ·w⟩ on random v and w to set G0 · all tiers none stated
KA-087 C-14 Rewrite control in f32 with a = 10⁸, b = −10⁸, c = 1 (a + b) + c is 1 and a + (b + c) is 0; a reassociation filed as class E is rejected by the trace checker (T-27) exact G0 · host The reassociation filed as class E
KA-088 C-15 Error rate of the betting e-process Eₙ = ∏ᵢ (1 + λᵢ·d̃ᵢ) under the null with optional stopping Empirical type-I error at or below α over 10⁴ simulated comparisons at or below α G0 · host none stated
KA-089 C-15 Integer promotion table at p₀ = 0.05, p₁ = 0.30, α = 0.01, with ln E = (n − k)·ln((1 − p₀)/(1 − p₁)) + k·ln(p₀/p₁) A clean pair multiplies the evidence by 0.95/0.70 and an exceedance divides it by 6; promotion needs 16 clean pairs, or 22 pairs with one exceedance exact G1 · host none stated
KA-090 C-15 Reachability under a two-sided exact Clopper–Pearson rule at n = 64 with a ±5 point indifference band (T-26) Perfect concordance gives the interval [−0.0662, +0.0662], so no outcome can return a tie; a study that needs that verdict is refused at admission exact (verdict); interval to four decimals G0 · host A request for a tie verdict at n = 64
KA-091 C-15 Level spending over repeated confirmation requests αᵢ = α/[i·(i + 1)] for the i-th request; the series sums to α exact G0 · host none stated
KA-092 C-16 Bouncing ball with restitution r: state (y, v), flow (v, −g), guard y = 0, reset (y, −r·v), impact speed v⁻ < 0 Ξ = [[−r, 0], [−(1 + r)·g/v⁻, −r]], with determinant r²; the event time moves by δt = −(D_x g·δx)/(D_t g + D_x g·f⁻) exact (symbolic) G1 · referee The reset Jacobian diag(1, −r) used as the event derivative: wrong sign of the first entry, no coupling in the second row, determinant −1 at r = 1 where the elastic bounce has +1
KA-093 C-16 Rimless wheel with spoke half-angle α on a slope γ The return map on the post-impact rate is ω₊² ↦ cos²(2α)·(ω₊² + (4g/ℓ)·sin α·sin γ); the multiplier is cos²(2α), exactly ½ for eight spokes exact G1 · referee none stated
KA-094 C-16 Commuting identity D h(x⁺)·Ξ_e(x⁻) = Ξ_{h·e}(h·x⁻)·D h(x⁻) on two bouncing balls and the swap of their labels Holds when the restitutions are equal to set G3 · referee Unequal restitutions: the identity is violated by terms proportional to r_L − r_R
KA-095 C-16 Grazing: a ball whose apex touches a ceiling The derivative query returns refused (FROB-REF-263), not a matrix exact (verdict) G1 · referee A matrix returned at the grazing state
KA-096 C-16 Stratum bookkeeping: four feet with states open, stick and slip under the leg-permutation group C₂ × C₂ (3⁴ + 3·3²)/4 = 27 strata and 648/4 = 162 one-foot transitions exact G1 · host none stated
KA-097 C-16 Validation of every saltation derivative Agrees with a perturbation of the initial state with events re-located on both sides pilot TARGET: gradient cosine at least 0.95 in at least 72 of 80 regular cases G3 · referee The 20 grazing or unstable controls of the pilot, each of which must be refused
KA-098 C-17 Quantifier order on the docking fixture of C-19 with the packet arriving late Each world alone has a successful open-loop command and no single command succeeds in both; evidence consisting of one policy per world is rejected exact (verdict) G1 · auditor One policy per world offered as evidence for ∃π ∀w
KA-099 C-17 Strictness At U = ¾ and ε = 5/16 the docking residual is exactly zero and the strict predicate fails; on 0 < w ≤ 1 every realization has w > 0 although the infimum is 0 exact G1 · host A non-strict comparator
KA-100 C-17 Chance constraint over two stages among 20 equally likely worlds, each stage passing in 19 The mission passes in 18 worlds if the failing worlds differ and in 19 if they coincide; only conditional success at every reached history justifies a product bound exact G1 · host Multiplying the stage rates
KA-101 C-17 Non-convexity: 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 needs 841/800 N from a pair capped at 1 N and is infeasible exact G1 · auditor A convex hull through the two witnesses, which admits the infeasible body
KA-102 C-17 Sub-problem mappings Every mapping from a mission to a sub-problem ships one deliberately invalid fixture, and the checker rejects it exact (verdict) G0 · auditor The invalid fixture itself
KA-103 C-18 Polarity on the docking family ε < (U + ½)/4 An inclusion at (U, ε) = (¾, ¼) survives ε falling to 1/8 and U rising to 1; an exclusion at (¾, 3/8) survives ε rising and U falling; each of the four opposite moves demands a recheck exact G1 · host none stated
KA-104 C-18 World set enlarged by one hidden gain 33/32 Every exclusion is kept and every inclusion is rechecked; 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 exact G1 · host An inclusion carried across the enlargement without a recheck
KA-105 C-18 Per-world answers against the joint answer F(V) ⊆ ⋂ over w ∈ V of F({w}); the late packet of C-19 makes the inclusion strict exact G1 · host Intersecting per-world answers
KA-106 C-18 Stale-verdict control A dependency graph with one edge omitted returns a promotion that fresh replay contradicts, and the check catches it exact (verdict) G0 · host The omitted edge
KA-107 C-18 Design–world duality V ⊆ X↑ exactly when X ⊆ V↓ (an antitone Galois connection) exact G0 · host none stated
KA-108 C-19 Docking witness with p = ¼ and an on-time exact reading The command sequences (¼, ½, −¾) for g = 1 and (¼, 0, −¼) for g = 2 both reach (1, 0) exactly in rational arithmetic exact G1 · host none stated
KA-109 C-19 Docking: terminal conditions and admissible probes With p = u₀ the terminal conditions force u₁ = 1/g − 2p and u₂ = p − 1/g; the bounds hold for both gains exactly when 1 − U ≤ p ≤ (U + ½)/2 for U ∈ [½, 1]; the readings are centred at p and 2p and the required next commands differ by ½ exact G1 · host none stated
KA-110 C-19 Docking: tolerable sensor error with the packet arriving before the second command A robust policy exists exactly when ε < (U + ½)/4, equality excluded; at U = ¾ the probe p = ¼ tolerates ε < 1/8 and the probe p = 5/8 tolerates ε < 5/16; at equality both worlds can report 15/16 while needing −¼ and −¾ exact G1 · host Equality at the boundary admitted
KA-111 C-19 Docking with the packet arriving after the third command is committed No robust policy exists for any U and ε exact (verdict) G1 · host none stated
KA-112 C-19 Stochastic packets with equal priors A fixed experiment whose reading has law P in one world and Q in the other caps success at (1 + TV(P, Q))/2 exact G0 · host none stated
KA-113 C-19 Repeated readings of a binary probe correct with probability ¾ 27/32 with three independent reads, 459/512 with five and 3807/4096 with seven; ¾ after any number of reads that share one fault bit exact G1 · host Reads that share a fault bit treated as independent
KA-114 C-19 Label count: commands (x, y) ∈ [0, 1]² with variants requiring x ≥ 2/3, y ≥ 2/3 and x + y ≤ 1 Every pair intersects and the triple does not; two labels suffice and one is impossible exact G1 · host Pairwise compatibility, which would have authorized one shared controller
KA-115 C-19 Schedule classes: six events containing three mutually independent conflicting pairs 720 orderings and 2³ = 8 classes exact G1 · host none stated (the pilot plants one stale-read race that must be found)
KA-116 C-20 Gauge of the observability Gramian for a legged robot with joint encoders and an IMU The computed null space of W has dimension four and equals the span of translations and yaw, analytically and by finite perturbation exact (dimension); to set (subspace) G1 · host none stated
KA-117 C-20 Global ambiguity: range anchors at (−1, 0) and (1, 0) Both read √2 from (0, 1) and from (0, −1); with unit variances the information matrix is the identity at both points; a controller that must pick the side fails exact G1 · host Full local rank read as distinguishability
KA-118 C-20 A third anchor at (0, 2) It reads 1 or 3; closed reading intervals of half-width ε separate exactly when ε < 1 exact G1 · host none stated
KA-119 C-21 Count of dimensionless groups for a pendulum described by (T, ℓ, g, m) Four quantities of dimensional rank three give one group, T·√(g/ℓ) exact G1 · host none stated
KA-120 C-21 Scaling a body by λ at constant density, with a fixture motor whose torque is declared to scale as λ³ Mass × λ³; static joint torque × λ⁴; the group τ_max/(m₀·g·ℓ₀) falls as 1/λ, so a design that stands at one size fails at twice the size although every geometric ratio matches exact (exponents) G1 · host A similarity verdict issued from geometric ratios alone must be refused: every group must match
KA-121 C-21 Delay group of a fixed latency under scaling t_d/t₀ with t₀ = √(ℓ₀/g) is proportional to λ^(−½); it doubles at one quarter of the size exact (exponents) G1 · host none stated
KA-122 C-21 Exact similarity test: lengths × 4, times × 2, masses × 2, gravity unchanged (α_L = λ, α_T = √λ), every dimensional input scaled by its dimension The scaled run reproduces the original in every significand bit and every branch, on each tier, away from overflow and underflow (HYPOTHESIS; the test is the gate) exact (bit equality) G3 · all tiers A kernel that hides a dimensional constant typed as a pure number fails on its first step
KA-123 C-22 Orbit count: ten leg types on the six slots of a hexapod with dihedral symmetry of order 12 (10⁶ + 2·10 + 2·10² + 10³ + 3·10⁴ + 3·10³)/12 = 86,185 distinct designs, a factor of 11.6 exact G1 · host Counting with Γ_mech when a front-only lidar is fitted merges designs that the closed loop distinguishes
KA-124 C-22 Orbit count when a sensor leaves only the sagittal mirror (10⁶ + 10³)/2 = 500,500, a factor of 2.0 exact G1 · host The order-12 count used in its place (see the row above)
KA-125 C-22 Orbit count with three types, formula against brute force The formula gives 92, and brute-force enumeration of 3⁶ assignments confirms it exact G1 · host none stated
KA-126 C-22 Wreath product: two slots swapped by the hub, each holding one of k module types in one of two mounting orientations that the module's half-turn symmetry identifies The group C₂ ≀ C₂ has order 8; the count is (4k² + 4k)/8 = (k² + k)/2, which is 6 for k = 3 against 36 raw assignments exact G1 · host none stated (both port-invariance conditions are checked before the group is used)
KA-127 C-22 Mission-observable projection: eight equal ballast slugs in 24 collinear slots, which enter rigid-body dynamics only through their count, Σx and Σx² C(24, 8) = 735,471 placements fall into 24,546 classes; merged members replay bit-identically exact (count); exact (digest equality on replay) G1 · host for the count; G5 · all tiers for the replay of merged pairs Slots {1, 4} and {2, 3} have equal Σx = 5 and different Σx², 17 and 13, and must not merge; one merged pair whose replays differ in any bit falsifies the projection
KA-128 C-23 Re-description of a design: a random relabeling, frame change and power-of-two scaling, for every design in the corpus The actions are unchanged after mapping back round-off, as stated; bound to set G3 · host A policy that reads tokens in file order fails at the first exchange of two legs
KA-129 C-23 Transport along an edit whose parameter change is zero The child's first action equals the parent's to set G3 · host none stated
KA-130 C-23 Composition of transport: two commuting edits applied in either order The same initialization in both orders; T_{e₂∘e₁} = T_{e₂}∘T_{e₁} on matched tokens to set G3 · host none stated
KA-131 C-24 Equivariance of every layer of the geometric-algebra policy Equivariant under yaw, translation, vertical-plane reflection and relabeling round-off, as stated; bound to set G3 · host Gravity control: a rotation about a horizontal axis must not be a symmetry of the policy
KA-132 C-25 Control variate with N ≫ n cheap episodes at the optimal β Variance Var(Y_hi)/n·(1 − ρ²·(1 − n/N)); the saving is 1/(1 − ρ²) at best: about 2 at ρ = 0.7; a factor of 5 needs ρ ≥ 0.894 and a factor of 10 needs ρ ≥ 0.949 exact (formula); the quoted ρ values to three digits G1 · host none stated
KA-133 C-25 Doubly robust tier correction, unbiasedness by enumeration: Y ∈ {0, 1} with mean θ, a constant prediction m, audit probability p = 0.1 E[Z] = m + p·(θ − m)/p = θ for every m exact G1 · host none stated here (the audit assignment must be persisted before dispatch)
KA-134 C-25 Doubly robust tier correction, added variance E[(1 − p)/p·(Y − m)²] 0 with a perfect prediction; 9 × ¼ = 2.25 with m wrong by a constant ½ and p = 0.1, worse than auditing everything exact G1 · host none stated
KA-135 C-25 Stopping rule of the audited correction under the null Stopping error at or below α over 10⁴ simulated null studies at or below α G0 · host A between-tier reversal planted in one stratum must not be accepted
KA-136 C-26 Conformal index on an audit set n = 39 and α = 0.05 select the 38th smallest residual, ⌈(n + 1)·(1 − α)⌉ = 38; fewer than 19 audit designs cannot support α = 0.05 because ⌈(n + 1)·0.95⌉ then exceeds n exact G1 · host Computing q̂ from promoted designs only under-covers on a fixture where the residual correlates with the cheap score
KA-137 C-26 Screening audit on a ladder of rungs A planted over-scored design is caught at the next rung; synthetic drift trips the exchangeability alarm exact (verdict) G0 · host The two plants are the controls: a ladder that passes either is rejected
KA-138 C-27 Zero-failure bound: n independent nominal episodes with zero failures p ≤ 1 − δ^(1/n) ≤ ln(1/δ)/n at confidence 1 − δ; δ = 0.05 gives n = ⌈ln 20/p*⌉, about 3·10⁴ episodes for p* = 10⁻⁴ exact (arithmetic) G1 · host none stated
KA-139 C-27 Defensive mixture q = β·p + (1 − β)·q′ with zero observed failures Weights are at most 1/β, and the certified bound is only p ≤ ln(1/δ)/(β·n), never better than crude sampling on the nominal share exact G1 · host none stated
KA-140 C-27 Multilevel splitting with L = 6 levels, p₀ = 0.1 and N = 10⁴ trials per level Squared coefficient of variation near L·(1 − p₀)/(p₀·N); coefficient of variation about 7% to set ("about") G1 · host none stated
KA-141 C-27 Known-probability fixture: a random walk with a closed-form hitting probability The crude and bounded-weight bounds bracket the truth in at least 1 − δ of 10⁴ repetitions coverage at least 1 − δ G0 · host Fork control: children that share the parent's streams are detected as duplicates
KA-142 C-28 Delta debugging on eight edits with failure exactly when edits 3 and 6 are both present The search returns {3, 6} exact G1 · host Non-monotone control: a grease patch (edit 1) fails the design and a rug over it (edit 2) masks it, so {1} fails and {1, 2} passes; the tool returns {1} and does not describe it as a distance
KA-143 C-28 Impossible-world control: a doorway narrower than the body Rejected as a counterexample for lack of a solvability witness exact (verdict) G1 · host none stated (the row is itself a control)
KA-144 C-28 Replay control of a stored .fmcw The stored world reproduces its state hash exact (digest) G5 · referee none stated
KA-145 C-29 Null intervention The empty intervention replays the recorded failure bit for bit exact (digest) G5 · referee none stated
KA-146 C-29 Shapley summary with two interventions, in two cases: either alone prevents the failure, v({A}) = v({B}) = v({A, B}) = 1; only both together prevent it, v({A}) = v({B}) = 0 and v({A, B}) = 1 Both cases give φ = (½, ½), although the first has two but-for causes with PN = 1 and the second has none; the report labels them but-for and joint exact G1 · host Reading the Shapley value as necessity: the two cases are indistinguishable by φ
KA-147 C-29 Placebo fork on a fixture where every nudge flips the outcome The report is chaotic: unattributable exact (verdict) G1 · referee none stated
KA-148 C-29 Planted cause Recovered as first-ranked in at least 90% of planted cases (TARGET) at least 90% (TARGET) G1 · referee none stated
KA-149 C-30 Unit normalization: a clearance of 0.02 m and a thermal margin of 15 K with scales 0.10 m and 10 K Normalized values 0.2 and 1.5; clearance binds in every unit system exact G1 · host The unnormalized minimum is 0.02 in metres and kelvin and 15 in millimetres and kelvin, so its binding atom changes with the unit system
KA-150 C-30 Streaming evaluation of a past-time window by the monotonic deque Equal to the brute-force window minimum on random signals exact G1 · host none stated
KA-151 C-30 Truncation: an episode that ends at 30 s under G_[0, 45 s] undetermined (§24.5) exact (verdict) G1 · host A monitor that returns the minimum over the truncated window
KA-152 C-30 Bounded-future rewrite G_[0,T] φ at time 0 equals H_[0,T] φ at time T exact G3 · host none stated
KA-153 C-31 Energy budget arithmetic at a guided stop 8 kg at 0.4 m/s is 0.64 J; a 20 W drive over a 25 ms cutoff adds 0.50 J; with 0.25 J of external work (gravity on an 8% slope over the stroke) and 0.10 J stored in a series spring the total is 1.49 J against an absorber of 50 N over 40 mm, 2.00 J; the largest admissible cutoff delay is (2.00 − 0.64 − 0.25 − 0.10)/20 s = 50.5 ms, or 45.5 ms with a further 0.10 J of reserve exact G1 · auditor Omitted-term control: a budget without the gravity term over the stroke is rejected by the checker
KA-154 C-31 Energy exclusion: lifting 8 kg over a 12 mm sill on a 0.90 J budget 8 × 9.81 × 0.012 = 0.94176 J is needed, above the budget for every wheel radius; 0.05 J of approach kinetic energy removes the exclusion exact G1 · auditor An exclusion issued with the approach-energy term omitted
KA-155 C-31 One-row runtime filter: R = I, u_π = (1, 0), box [0, 1]², row u₁ + u₂ ≥ 1.5 The breakpoint method gives (1, 0.5) exact G1 · host The projection that ignores the box gives (1.25, 0.25), which leaves the box, and clipping it gives (1, 0.25), which violates the row
KA-156 C-31 Quantifier control for a filter certificate A certificate proved in the order ∀w ∃u is rejected; the required order is ∃u ∀(w, e) exact (verdict) G0 · auditor The reordered certificate is the control
KA-157 C-32 Stance family: 400 N on four point feet at (±a, ±b) with a = 1/3 m; centre of mass anywhere in a rectangle of half-sizes 150 mm and 75 mm; each foot commanding any force in [0, 160] N At the positive corner the two moment equations give f₊₊ − f₋₋ = 90 + 15/b, so the minimum half-width is b = 3/14 m, with forces (160, 130, 110, 0) N in the order [++, +−, −+, −−] exact (rationals) G1 · auditor The four mutations of §12.4: a swapped foot order with unchanged forces; an unreported positive force floor; a passive-authority tag; (60, 30) passed as the torque
KA-158 C-32 Dual witness of infeasibility at b = 1/5 m Half the x-moment equation divided by a plus half the y-moment equation divided by b gives f₊₊ − f₋₋ = 165 N, against f₊₊ ≤ 160 N and f₋₋ ≥ 0 exact (rationals) G1 · auditor A perturbed multiplier is rejected (§12.7)
KA-159 C-32 Authority model at b = ¼ m Active allocation gives (155, 135, 105, 5) N; equal passive springs give (175, 115, 85, 25) N, above the 160 N cap exact G1 · host An inclusion proved for independently commanded forces and offered for a passive suspension is rejected
KA-160 C-32 Sign of the support torque 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 exact G1 · auditor A packet that passes (60, 30) as the torque is rejected
KA-161 C-33 Ladder: a thin rod of length L turning a right-angle corner between corridors of width a It turns exactly when L ≤ 2√2·a the reported resolution band of the complexes (cell size and heading bin; 48 bins give a half-bin of 3.75°) G1 · host Scalar radius: 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
KA-162 C-33 Doorway: a rectangular body of width w crossing an opening of width D head-on The inner certificate holds below D minus the band and the outer exclusion above D plus the band; between them the answer is unknown the reported band G1 · host Planted wall: closing a gap by one cell flips the outer verdict
KA-163 C-33 Clearance on each reference interior No false route and no false impossibility exact (zero of each) G1 · host One false route or one false impossibility falsifies the pilot
KA-164 C-34 Three-pose dyad, circumcentre: P = (1, 0), (0, 1), (−1, 0) O = (0, 0) and radius 1; collinear positions are reported as degenerate exact (rationals) G1 · host none stated
KA-165 C-34 Grashof four-bar: 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 exact G1 · host A candidate whose target poses lie on different circuits is rejected
KA-166 C-34 Root counts for the continuation lane (FACT, literature, source register) At most 4 Burmester point pairs for five poses; 16 solutions of general 6R inverse kinematics; 40 of the Stewart–Gough forward problem; 4,326 four-bars through nine points exact (counts) G1 · host (CPU, double precision) A result is Complete only when the certified count equals an independent generic count with no lost path, otherwise Partial(certified, lost); kill at more than 0.1% of paths lost or a certified count below 40
KA-167 C-34 Threshold of the α-test α(f, z) < (13 − 3√17)/4 ≈ 0.157671 proves that Newton's iteration from z converges quadratically to a root within twice the Newton step exact (rational arithmetic) G0 · auditor none stated
KA-168 C-35 Two-bar truss with a load at the apex The volume at fixed stress is proportional to 1/(sin θ·cos θ), least at 45° to set G1 · host none stated
KA-169 C-35 Linear damage with Basquin exponent m = 3 10⁶ cycles at an amplitude of life 2·10⁶ give D = 0.5; a further 10³ cycles at five times the amplitude, of life 16,000, add 0.0625, so 0.1% of the cycles carry 11% of the damage exact G1 · host none stated
KA-170 C-35 Rainflow residue: the history 0, 10, 0 split into the windows [0, 10] and [10, 0] One full cycle of range 10 exact G1 · host A counter that drops residues at window ends counts none
KA-171 C-35 Tolerance allocation: two dimensions of equal sensitivity with cost weights 1 and 8 under a statistical limit of 0.1 mm tᵢ ∝ (kᵢ/aᵢ²)^⅓ gives the ratio 1 : 2, namely 0.0447 mm and 0.0894 mm to set (values quoted to four decimals) G1 · host none stated
KA-172 C-36 Left-trivialized differential of the Cayley map The stated matrix (Dcay_x)⁻¹ times a finite-difference left-trivialized differential is the identity; its rotation block I + ½·ω̂ + ¼·ω·ωᵀ inverts to 2/(4 + ‖ω‖²)·(2I − ω̂) to set (finite-difference accuracy) G0 · host The differential taken at +hξ_k (see the next row)
KA-173 C-36 Four-step variational map on a free asymmetric body Spatial momentum constant to round-off; energy error bounded and divided by four when h is halved; the map run backwards returns the initial state to round-off round-off for momentum and reversal, bounds to set; order 2 for energy G1 · referee, strict Evaluating step 2 with the differential at +hξ_k leaves momentum exact, because step 3 conserves it for any ξ, and destroys the energy bound: detection is by energy and reversibility, never by momentum
KA-174 C-36 Four-step variational map with gravity Vertical angular momentum and horizontal linear momentum constant to round-off round-off, bound to set G1 · referee, strict none stated
KA-175 C-36 Chaplygin sleigh with mass m, inertia I about the centre of mass and offset a from the blade v̇ = a·ω² and ω̇ = −m·a·v·ω/(I + m·a²); the energy ½·m·v² + ½·(I + m·a²)·ω² is constant, since m·v·(a·ω²) − m·a·v·ω·ω = 0, while the direction of linear momentum turns to set G1 · referee Applying the momentum test of C-04 to this system fails a correct step
KA-176 C-36 Nonholonomic projection with b = 0 ‖v⁺‖_M ≤ ‖v*‖_M to set (inequality up to round-off) G0 · referee none stated
KA-177 C-36 Skid-steer control: four fixed wheels As ideal rows they return ω = 0 under any command; with cone-bounded rows the base turns with its lateral multipliers on their cones to set G1 · referee none stated (the ideal-row result ω = 0 is itself the control)
KA-178 C-37 Slide–spin coupling in the four-dimensional cone At v_t = r·ω_n the tangential friction magnitude is μ·λ_n/√2 to set G1 · referee An uncoupled model gives μ·λ_n
KA-179 C-37 Pure spin The limiting moment is μ·λ_n·r; r = 2R/3 for uniform pressure on a disc of radius R, giving (2/3)·μ·N·R, and r = 3πR/16 for a Hertzian distribution to set G1 · referee none stated
KA-180 C-37 Projection identities of T-07 on the four-dimensional cone P(x) ∈ 𝒦, P(x) − x ∈ 𝒦*, ⟨P(x), P(x) − x⟩ = 0 exact over ℚ (certificate); residual tolerance to set in floating point G0 · host none stated
KA-181 C-37 Stiction under a torque ramp k·t A joint with stiction τ_s first moves at t = τ_s/k to set G1 · referee none stated
KA-182 C-37 Backlash under a slow triangular motor motion of reflected amplitude A > β/2, output held by friction Output amplitude A − β/2; hysteresis loop of width β to set G1 · referee none stated
KA-183 C-38 Electrical step of a locked rotor with R_w = 1 Ω and L = 10 mH The current rises as (V/R_w)·(1 − e^(−t/τ)) with τ = 10 ms to set G1 · referee none stated
KA-184 C-38 Energy ledger of a motor axis in the three modes: motoring, regenerative braking, dissipative braking supplied = stored change + dissipated + exported "to tolerance", as stated; value to set G1 · referee Double-count control: a ledger that books heat entering the node as both stored and lost shows a deficit equal to that heat and is flagged
KA-185 C-38 Thermal runaway with R₀ = 0.1 Ω, α = 0.0039 K⁻¹ and G_th = 0.5 W/K Critical current √(0.5/0.00039) ≈ 35.8 A; below it the temperature follows the closed-form approach to T_amb + i²·R₀·(1 + α·(T_amb − T₀))/(G_th − i²·R₀·α); above it the closed-form exponential growth; the time to a limit temperature is computed from the fixture's own parameters at the gate to set G1 · referee none stated
KA-186 C-38 Entropy production of the thermal node σ = P_loss/T_w + G_th·(T_w − T_amb)²/(T_w·T_amb) ≥ 0 whenever P_loss ≥ 0 exact (sign) G0 · referee Sign control: a regenerative mode with a negated copper loss gives σ < 0 and is rejected
KA-187 C-39 Expected value of sample information, EVSI = s̃·[φ(z) − z·Φ(−z)] with z = abs(m)/s̃ 0 when s̃ = 0; increasing in s̃; decreasing in abs(m); a campaign in which no experiment's ratio clears the price stops and decides to set G1 · host none stated
KA-188 C-39 Probe fixture: friction laws μ₁(v) = 0.5 and μ₂(v) = 0.3 + 0.4·v, v in m/s They agree at 0.5 m/s and imply opposite designs at the mission speed of 1.5 m/s (0.5 against 0.9); a probe at 1.0 m/s reads 0.5 or 0.7 and separates them exactly when the reading error is below 0.1; a probe at 0.5 m/s separates nothing at any precision exact G1 · host Omitted-mechanism control: a third law that follows μ₁ up to 1.0 m/s and departs later defeats the 1.0 m/s probe, and the tool must state that its certificate is conditional on the two laws it was given
KA-189 C-40 Dominance on a product system: a surface parameter z ∈ [0, 1]; A succeeds when z ≥ 3/5 and B when z ≥ 2/5 Neither is guaranteed; under the shared z the pair (success, failure) is unreachable; B adds the interval [2/5, 3/5), a gain of 1/5 under a uniform law exact (rationals) G1 · auditor Enclosing the two outcomes separately admits all four pairs, including the impossible one
KA-190 C-40 Coverage control for a product enclosure A product whose internal branches are wrongly tied reaches only (0, 0) and (1, 1), whose projections cover both marginal outcome sets, and so hides a reachable (1, 0); the checker demands joint coverage and rejects it exact (verdict) G0 · auditor The wrongly tied product is the control

M.10 §11 Conventions

KA Where stated The case The truth Tolerance Tier Negative control
KA-191 §11.2 Euler–Poincaré sign for a free body with the frame origin at the centre of mass: π = I·ω and ℓ = m·v in μ̇ = ad*_ξ μ with ad*_ξ = ad_ξᵀ Euler's equation I·ω̇ = (I·ω) × ω and v̇ = v × ω; the world-frame velocity R·v of a force-free body is constant, because d(R·v)/dt = R·(ω × v + v̇) = 0 to set (residual) G0 · host With the opposite sign d(R·v)/dt would be 2R·(ω × v)
KA-192 §11.2 Coadjoint as the dual map (T-16) ⟨ad_ξᵀ μ, η⟩ = ⟨μ, [ξ, η]⟩, a polynomial identity in eighteen variables; ad*_ξ μ = (π × ω + ℓ × v, ℓ × ω) exact (polynomial identity over ℚ) G0 · host The map −ad_ξᵀ written as ad*
KA-193 §11.3 Wrench pushforward with R = I and p = (1, 0, 0) m applied to the wrench (0, (0, 0, 1) N) in b Torque p × f = (0, −1, 0) N·m and the same force exact G0 · host Moving the wrench with the twist map gives zero torque: the moment arm is lost, and the planar fixture of C-04 fails
KA-194 §11.3 Laws of the three typed frame maps Ad(gh) = Ad(g)·Ad(h); ⟨Ad_g⁻ᵀ w, Ad_g ξ⟩ = ⟨w, ξ⟩; the pullback Ad_gᵀ inverts the pushforward exact over ℚ (T-04, T-05); residual tolerance to set in floating point G0 · host A function that accepts one map type where another is expected must not compile
KA-195 §11.4 Reflection parity under the sagittal mirror P = diag(1, −1, 1) A pitch axis e_y maps to itself, a roll axis e_x to −e_x and a yaw axis e_z to −e_z; a wheel rolling forward keeps its angular momentum; a robot turning left becomes a robot turning right exact G0 · host Treating angular velocity as polar leaves the yaw rate unchanged, which the step-equivariance test of T-10 catches
KA-196 §11.4 Parity map of an improper isometry (T-16) T(P) = diag(det(P)·P, P) preserves the pairing, because det(P)² = 1, and the bracket exact (polynomial identity over ℚ) G0 · host none stated
KA-197 §11.5 Shell rule in the thin limit As t → 0 a spherical shell of radius r tends to I = (2/3)·m·r², against (2/5)·m·r² for the solid ball to set G1 · host A solid default for an enclosure (FROB-REF-168; C-03 gives a case with a factor of 18.8)
KA-198 §11.5 Pseudo-inertia round trip 𝖯 = [[Σ, h], [hᵀ, m]] with Ī = tr(Σ)·I − Σ and Σ = ½·tr(Ī)·I − Ī; the parameters are consistent exactly when 𝖯 ≻ 0 exact (rational LDLᵀ, T-19) G0 · host none stated
KA-199 §11.5 Mass-support bound for a body whose mass lies in a ball of centre o and radius ρ ‖c − o‖² + tr(I_C)/(2m) ≤ ρ², the left side being the mass-weighted mean squared distance from o, since ∫‖x − c‖² dm = tr(Σ_C) = ½·tr(I_C) exact (one rational inequality, T-19) G0 · host The bound applied to an unrelated collision proxy instead of the declared mass envelope
KA-200 §11.6 Curvature sign: the constant connection 𝔸₁ = e_x, 𝔸₂ = e_y on SO(3) The curl vanishes and (D𝔸)₁₂ = −e_z, so a small loop of area da rotates the body by +da about z; directly, exp(−a·e_x)·exp(−b·e_y)·exp(a·e_x)·exp(b·e_y) ≈ exp(a·b·e_z) to set (second order in the loop sides); exact in truncated rational series (T-20) G0 · host A formula with +[𝔸ᵢ, 𝔸ⱼ] predicts −da and is wrong by twice the answer
KA-201 §11.7 Rational clocks: physics at 400 Hz, an IMU at 100 Hz and a policy at 30 Hz L = 1,200 and periods of 3, 12 and 40 base units; the policy tick at unit 40 falls one unit after the physics boundary at 39 and two before the one at 42; the pattern repeats every 120 units, 0.1 s exact (integers) G1 · all tiers Rounding the policy to every thirteenth physics step
KA-202 §11.7 Firing count of a periodic process The number of firings of process i up to clock n is ⌊(n − φᵢ)/Nᵢ⌋ + 1 exactly exact G1 · all tiers none stated
KA-203 §11.7 Replay from a checkpoint taken just after a shutter opens, after a dropped packet, or just before a controller update The same packet history as the uninterrupted run exact (digest) G5 · all tiers none stated here (a checkpoint contains every accumulator, scheduled callback, pending packet and action queue)
KA-204 §11.8 Force sensor over a half-open exposure window (a, b] 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 exact G1 · all tiers none stated
KA-205 §11.8 Packet timing 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 exact (verdict) G1 · host none stated
KA-206 §11.8 Causality of observations A packet is never visible before its arrival; private truth behind a disconnected sensor cannot change an action; an out-of-order arrival never changes a past decision or the observation delivered at that decision exact (digest of actions) G3 · all tiers The two mutation tests of §38: a consumer that reads a packet before its arrival; a path from private truth to an action

M.11 §12 Lemma: proofs, certificates, the offline auditor

KA Where stated The case The truth Tolerance Tier Negative control
KA-207 §12.7 Stance bundle at b = 3/14 m (lp-primal, forces (160, 130, 110, 0) N at four load vertices) accept exact (verdict) G1 · auditor Each of the four mutations of §12.4 gives reject: a swapped foot order with unchanged forces; an unreported positive force floor; a passive-authority tag; (60, 30) passed as the torque
KA-208 §12.7 Dual witness at b = 1/5 m (lp-farkas) accept for the exclusion exact (verdict) G1 · auditor A perturbed multiplier gives reject
KA-209 §12.7 Docking cell (U, ε) = (¾, ¼), packet on time accept for the inclusion (T-23: ε < (U + ½)/4) exact (verdict) G1 · auditor The same bundle with the quantifiers reordered gives reject
KA-210 §12.7 Docking, packet late accept for the exclusion at every U and ε exact (verdict) G1 · auditor none stated
KA-211 §12.7 T-01 for the M0 Cayley kernel: cay(Ω)ᵀ·cay(Ω) = I and det cay(Ω) = 1 accept exact (verdict) G0 · auditor One changed coefficient gives reject
KA-212 §12.7 Rewrite trace with a reassociation filed as class E reject exact (verdict) G0 · auditor The row is itself the control
KA-213 §12.7 Energy budget of C-31 without its gravity term reject exact (verdict) G0 · auditor The row is itself the control
KA-214 §12.7 Bundle with execution_authorized set to true reject (FROB-REF-833) exact (verdict) G0 · auditor The row is itself the control
KA-215 §12.7 Bundle with an unknown proof kind and consistent hashes reject (FROB-REF-823) exact (verdict) G0 · auditor The row is itself the control
KA-216 §12.2 Artifact in which a no-authorization flag is missing reject (FROB-REF-833); every exported artifact carries the three flags, all false (INV-LEMMA-03) exact (verdict) G0 · auditor The row is itself the control
KA-217 §12.4 Bundle whose quantifier prefix or domain differs from the query while every hash is consistent reject (FROB-REF-826) exact (verdict) G0 · auditor The row is itself the control
KA-218 §12.6 Per-kind specimens (GATE-LEMMA-03) Every proof kind in use has one specimen that frob-verify accepts and at least three mutations that it rejects; rejection of the four stance mutations, an unknown kind with consistent hashes and a changed quantifier is 100%; the binary lists no dependency outside the standard library and runs in an empty environment exact (100%) G0 · auditor The mutations are the controls
KA-219 §12.6 Seeded-defect suite on the first mission slice (GATE-LEMMA-04) Zero accepted false certificates; a re-check on a second machine accepts every shipped bundle exact (zero; one accepted false certificate fails the gate) G0 · auditor The seeded defects are the controls
KA-220 §12.6 Instance certificates for the M0 kernels (GATE-LEMMA-00) T-01, T-03 (‖q·c‖² = ‖q‖²·‖c‖²) and T-04 (Ad(gh) = Ad(g)·Ad(h); the group coadjoint is the inverse transpose) are certified and replay offline exact (verdict) G0 · auditor One changed coefficient gives reject (§12.7)
KA-221 §12.2 Claim product and class order (GATE-LEMMA-06, INV-LEMMA-02) The class of a combined result is the minimum of its inputs' classes, so an exact argument over an Estimated material card is Estimated; compile-fail tests show no conversion from a claim product to a factor and no constructor of Proved evidence outside frob-lemma exact G0 · host A result presented above the class of its weakest input is refused (FROB-REF-834)
KA-222 §12.7 Bundle round trip (PO-LEMMA-01) Re-serializing a bundle with frob-verify gives identical bytes, on every specimen exact (bytes) G3 · auditor none stated
KA-223 §12.7 The auditor's own BLAKE3 (PO-LEMMA-02) Equal to the published vectors and to fs-blake3 on 10⁶ random inputs exact (digest) G2 · auditor none stated
KA-224 §12.7 Polarity table of C-18 on the docking and stance fixtures (PO-LEMMA-03) Each row gives the stated survival, by fresh evaluation of all twelve moves per fixture exact (verdict) G1 · auditor none stated
KA-225 §12.7 Rational and interval arithmetic of the auditor (PO-LEMMA-04) Agrees with FrankenSymPy's on a shared corpus, in a differential test at build time; FrankenSymPy is not linked into the auditor exact G2 · auditor none stated
KA-226 §12.3 Level series of the qualification lane (T-26) Σᵢ α/[i·(i + 1)] = α (telescoping); for a declared fixed-n rule and sample size the set of verdicts reachable over all outcome counts is as stated, by exhaustive enumeration in exact rationals exact G0 · host none stated
KA-227 §12.4 Reflection pilot specimens (GATE-LEMMA-05): the Farkas reflector on the stance specimen; the rational LDLᵀ reflector on one 4×4 pseudo-inertia with 64-bit numerators Each check x evaluates to true in the kernel, with no tactic at checking time and no compiled evaluator within 60 s per specimen (TARGET) G0 · host (Lean kernel, Linux) A closure that cannot avoid a blocked module, or a specimen not evaluated within 60 s, falsifies the pilot

M.12 §13 Marrow: the algebraic core

KA Where stated The case The truth Tolerance Tier Negative control
KA-228 §13.10 Planar 2R arm: links 0.4 m and 0.3 m, angles 0 and π/2, tool force (10, 0) N, joint rates (0.2, −0.1) rad/s Point Jacobian J = [[−0.3, −0.3], [0.4, 0.0]] m/rad; joint torques Jᵀ·f = (−3, −3) N·m; tool velocity J·q̇ = (−0.03, 0.08) m/s; power −0.3 W by both routes (f·v and τ·q̇) exact in rationals on the host; floating tolerance to set G1 · host The lower three rows of a space screw Jacobian taken as a point Jacobian, which gives torques (0, 0)
KA-229 §13.3, §13.10 Free body, rotational inertia diag(1, 2, 3) kg·m², ω = (1, 1, 0) rad/s, so π = (1, 2, 0) π̇ = π × ω = (0, 0, −1); body-frame rate of spatial angular momentum π̇ + ω × π = (0, 0, 0) exact (integers) G1 · host A reversed ad*: π̇ = (0, 0, +1) and spatial rate (0, 0, 2). Both signs give ω·π̇ = 0, so an energy-only test passes the mutation
KA-230 §13.4, §13.10 Fore-aft and left-right symmetric quadruped with one forward lidar on the torso Γ_mech = C₂ × C₂ (order 4); Γ_obs = C₂ (order 2); the breaker of the fore-aft mirror and of the half-turn is the lidar mount exact G1 · host Weights tied under the mechanical group
KA-231 §13.5, §13.10 C₃ acting on ℝ³ by cyclic permutation of three legs Commutant dimension 3 = 1 (trivial) + 2 (one complex-type real irreducible); the maps are the circulants; the antisymmetric circulant x ↦ (x₂ − x₃, x₃ − x₁, x₁ − x₂) is representable exact G1 · host The complex-type block parameterized as real: two parameters, symmetric circulants only, which are the D₃-equivariant maps
KA-232 §13.10 Regular representation of C₂ × C₂, 64 copies in and 64 copies out 16,384 free weights (GB-02), from dim Hom = Σᵢ cᵢ·mᵢ^out·mᵢ^in with four real-type irreducibles of multiplicity 64 exact G1 · host A miscounted commutant
KA-233 §13.6, §13.10 Ten module types on the six slots of a radial hexapod under D₆ (10⁶ + 2·10 + 2·10² + 10³ + 3·10⁴ + 3·10³)/12 = 86,185 orbits out of 10⁶ assignments exact G1 · host A wrong cycle index
KA-234 §13.6, §13.10 The same sweep when the sensors leave only the sagittal mirror (10⁶ + 10³)/2 = 500,500 orbits exact G1 · host A wrong cycle index
KA-235 §13.6, §13.10 Contact strata: four feet, each open, sticking or slipping, under C₂ × C₂ (3⁴ + 3·3²)/4 = 27 strata exact G1 · host A wrong cycle index
KA-236 §13.7, §13.10 Guarded predicate x² + y² ≤ z² on the single-precision numbers nearest 0.3, 0.4 and 0.5 The exact value of x² + y² − z² on the stored inputs is +1.19 × 10⁻⁸: the point is outside the cone; the guarded predicate returns that sign exact (sign) G1 · all tiers A plain single-precision predicate, which finds the two sides equal and reports the point inside
KA-237 §13.10 Rotation angle of one Cayley step at body rate ω and step h 2·atan(ω·h/2) (GB-01) to set (GATE-MARROW-01 bounds the retraction laws at 64 ulp in f64, 16 ulp in f32) G1 · host A mislabelled retraction
KA-238 §13.10, §14.5 ≡ KA-044 A 1 kg part with principal moments 0.008 kg·m² each, declared inside a sphere of radius 0.10 m Refused by the mass-support predicate (FROB-REF-106): ‖c − o‖² + tr(I_C)/(2m) = 0.012 m² needed against R² = 0.010 m² available; a thin spherical shell of that radius meets the bound with equality exact G1 · host An inertia that passes pseudo-inertia positivity and that no body in the envelope could have
KA-239 §13.8 Law: group axioms Associativity, identity and inverse for every group GATE-MARROW-01: 10⁶ cases, at most 64 ulp in f64 and 16 ulp in f32 for single operations G0 · host The eight planted mutations of §13.8, each caught by at least three fixtures (GATE-MARROW-04)
KA-240 §13.8 Law: retraction τ(0) = identity; dτ(0) = identity; τ(x)·τ(−x) = identity, for cay and exp GATE-MARROW-01, as above G0 · host none stated
KA-241 §13.8 Law: round trip log(exp(x)) = x inside the injectivity radius; cay⁻¹(cay(x)) = x GATE-MARROW-01, as above G0 · host none stated
KA-242 §13.8 Law: adjoint Ad(gh) = Ad(g)·Ad(h); Ad(exp x) = exp(ad x) to tolerance; the group coadjoint Ad* is the inverse transpose of Ad GATE-MARROW-01, as above G0 · host Ad* and its inverse exchanged
KA-243 §13.8, §13.3 Law: coadjoint pair ad*ξ = (ad_ξ)ᵀ; d/dt Ad*{exp(tξ)} at t = 0 equals −ad*_ξ; push-forward composed with pull-back is the identity GATE-MARROW-01, as above G0 · host A reversed ad*; a pull-back in place of a push-forward
KA-244 §13.8 Law: pairing ⟨Ad*_g w, Ad_g ξ⟩ = ⟨w, ξ⟩ under a change of frame GATE-MARROW-01, as above G0 · host A pull-back in place of a push-forward; linear and angular parts exchanged in a twist
KA-245 §13.8 Law: free body With μ̇ = ad*_ξ μ the spatial momentum Ad*_g μ is constant GATE-MARROW-01, as above G0 · host A reversed ad*
KA-246 §13.8 Law: Jacobians of the retractions dexp and dcay match fs-ad dual-number derivatives GATE-MARROW-01, as above G0 · host none stated
KA-247 §13.8 Law: subgroups A classified screw basis is bracket-closed; the generated joint map composes like its subgroup exact for closure; GATE-MARROW-01 for composition G0 · host The bracket's arguments exchanged
KA-248 §13.8, §13.3 Law: reflections A mirror applied twice is the identity on twists, wrenches and pseudo-inertias; the pairing is invariant under every isometry, proper or not; a mirrored revolute joint written with the axial image det(P)·P·a of its axis keeps its coordinate GATE-MARROW-01, as above G0 · host A missing parity sign on a mirrored axis
KA-249 §13.8 Law: representations ρ(gh) = ρ(g)·ρ(h); characters orthonormal; projectors idempotent and summing to the identity exact (field elements) G0 · host A conjugate missing in the projector
KA-250 §13.8 Law: nested groups Γ_obs is a subgroup of Γ_mech; every element of Γ_obs has a representation on every task term; removing every sensor, payload and task term gives Γ_obs = Γ_mech exact G0 · host none stated
KA-251 §13.8, §13.5 Law: blocks The block-parameterized maps and the image of the Reynolds operator are the same subspace, of dimension Σ cᵢ·mᵢ^out·mᵢ^in (cᵢ = 1 real type, 2 complex type) exact (PO-MARROW-05; GATE-MARROW-04: 100 random pairs of channel spaces per group) G0 · host A complex-type block parameterized as real (the C₃ case)
KA-252 §13.8 Law: orbits The cycle-index count equals a brute-force count for every case with at most 10⁶ assignments exact G0 · host A wrong cycle index
KA-253 §13.8, §13.7 Law: predicates A Guarded predicate returns the sign of its exact evaluation on the stored inputs, for every input exact (sign) G0 · all tiers A Plain predicate on a select whose arms differ at the boundary (the 0.3, 0.4, 0.5 fixture)
KA-254 §13.8 Law: curvature sign With body velocities and reconstruction ξ = −𝔸(s)·ṡ the curvature is (D𝔸)ᵢⱼ = ∂ᵢ𝔸ⱼ − ∂ⱼ𝔸ᵢ − [𝔸ᵢ, 𝔸ⱼ], and a small loop moves the body by about exp(−∬ D𝔸) to set (holonomy fixture of A-09) G0 · host The curvature bracket sign reversed, which fails the holonomy fixture of A-09
KA-255 §13.8 Law: cones P(P(x)) = P(x); Moreau decomposition x = P_𝒦(x) + P_𝒦°(x) with the parts orthogonal; the four-dimensional contact cone is the image of the second-order cone under its stated linear map GATE-MARROW-01, as above G0 · host none stated
KA-256 §13.10 (PO-MARROW-01) Convention parity with fs-ga: quaternion order, sign rule, twist order, adjoint direction, bracket, group coadjoint A fixture of 1,000 transforms produced by fs-ga and consumed by frob-lie compares bit for bit, covering the first four rows of the table of §13.3 exact (bits) G2 · host The eight planted mutations of §13.8
KA-257 §13.10 (PO-MARROW-03) Turn counter of the unit-complex revolute coordinate (ADR-MARROW-03) Never disagrees with an angle integrated in f64, over 10⁹ random steps exact (integer turn count) G0 · host none stated
KA-258 §13.10 (GATE-MARROW-02) Character tables and isotypic projectors Correct for Cₙ and Dₙ with n ≤ 12, their products with C₂, and S₄, against the tables on file exact G1 · host A conjugate missing in the projector
KA-259 §13.10 (GATE-MARROW-03) Γ_mech and Γ_obs for the eighteen archetypes and for 24 planted asymmetries (a moved sensor, a one-sided payload, a changed sole material, a reversed gear) The groups on file, with the correct breaker named in every case; zero disagreements exact G1 · host The 24 planted asymmetries are the controls: each must change the group and name its breaker
KA-260 §13.10 (GATE-MARROW-05) Guarded predicates against exact rational evaluation on 10⁹ adversarial inputs placed within 4 ulp of the zero set Zero sign errors on batch-cpu, CUDA and Metal; fallback rate on the standard contact battery recorded, TARGET below 10⁻³ of evaluations exact (sign) G1 · all tiers A Plain strict predicate; KILL-MARROW-GUARD fires above a 10⁻² fallback rate

M.13 §14 Skeleton: design language, modules, archetypes, preflight

KA Where stated The case The truth Tolerance Tier Negative control
KA-261 §14.5, §14.14 Torso box 0.42 × 0.20 × 0.10 m at 2,700 kg/m³, read as solid and as a 2.5 mm shell Solid: 0.0084 m³ × 2,700 = 22.68 kg. Shell: the inner box 0.415 × 0.195 × 0.095 m removes 0.007688 m³, leaving 1.923 kg. Vertical-axis radius of gyration squared: (0.42² + 0.20²)/12 = 0.01803 m² solid, 0.02357 m² shell (31% larger); the solid reading is 11.8 times too heavy exact rational comparison (PO-SKEL-02; GATE-SKEL-07) G1 · host A solid default fill; density rescaled to the right mass in place of a shell, which leaves the inertia wrong
KA-262 §14.5 Mass spiral applied to the fill error (GB-03) With loop gain 0.59 each kilogram of structure costs 2.4 kg of robot, so a 20.8 kg error in one body becomes about 50 kg of robot to set (illustrative) G1 · host none stated
KA-263 §14.5 A shell thicker than half the Region's smallest dimension Refused as a solid written as a shell (FROB-REF-105) exact (verdict) G1 · host none stated
KA-264 §14.6, §14.14 (PO-SKEL-04) Limb port packet after eliminating a joint with axis s from an articulated inertia I I − I·s·(sᵀI·s)⁻¹·sᵀI sends s to zero; with I the identity and s the first basis vector the result is diag(0, 1, 1, 1, 1, 1): symmetric positive semidefinite, 27 scalars (21 inertia entries and 6 bias entries, 108 bytes in single precision), equal to the limb's reaction from the full articulated recursion exact for the fixture; round-off comparison on random limbs, to set G1 · host A packet typed or treated as positive definite, or inverted at the port
KA-265 §14.10, §14.14 Raised threshold: wheel radius 0.060 m and 0.075 m at a 0.012 m lip Lever arm √(2·r·h − h²) = 36.0 mm and 40.7 mm; horizontal push over axle load 0.750 and 0.646 to set G1 · host A wheel edit judged by one of its two effects
KA-266 §14.10, §14.14 Ackermann base with wheelbase L and steer angle δ Turning radius L/tan δ; growth vector (2, 3, 4) to set for the radius; exact for the growth vector G1 · host A steering linkage with the wrong closure
KA-267 §14.10 Differential drive over one step with δ = ω·Δt Δp = v·Δt·sinc(δ/2)·(cos(θ + δ/2), sin(θ + δ/2)); growth vector (2, 3) and the sideways cost of GB-05 to set G1 · host fs-mbd::planar_drive used as the oracle (reported defect near straight-line motion; the admission test is in §33)
KA-268 §14.10, §14.11, §14.14 Mecanum base assembled with all four roller axes parallel Twist-to-wheel map of rank 2 instead of 3; growth vector (2, 3) where an omnidirectional base must have (3); stage 4 refuses against the declared class (FROB-REF-118); a curvature test on the same base passes exact G1 · host Curvature used as the wheel-layout test
KA-269 §14.10 balancer-2w: two-wheeled inverted pendulum The open-loop pole equals its closed form (the expression is not stated in the chapter; it belongs to the derivation file) to set G1 · referee none stated
KA-270 §14.10 (GATE-SKEL-03, GATE-MARROW-03) Γ_mech as built for the eighteen archetypes, before any sensor is mounted quad-mammal, quad-sprawl, mecanum, tracked-flipper, wheel-leg: C₂ × C₂; hexapod-radial: D₆ (C₆ with handed legs); octopod: D₈ radial, C₂ in a spider layout; biped-point, humanoid, diff-drive, ackermann, rocker-bogie, balancer-2w: C₂; omni-3: D₃; swerve-4: D₄; tri-wheel-stair: C₂ with C₃ or D₃ in each cluster; mobile-manipulator: trivial with the arm off-centre; snake-crawler: C₂ under head-to-tail reversal exact G1 · host The 24 planted asymmetries of GATE-MARROW-03
KA-271 §14.6, §14.14 Two fingers on a bus limited to one unit of current, each with peak demand one unit, drawing at different ticks The schedule is feasible; the peak-adding rule concludes two units and excludes it exact (verdict) G1 · host Exclusion from peak-only contracts
KA-272 §14.6, §14.14 (GATE-SKEL-06) Mirror swap of a leg module (a leaf-local substitution) Every sibling product is reused and is bit-identical to its recompiled value exact (bits) G3 · host An invalidation rule that is too wide; a reversed port sign must refuse
KA-273 §14.6, §14.14 (GATE-SKEL-06) Edit of the shared bus (a global substitution) Every electrical and thermal product is invalidated exact (verdict) G1 · host An invalidation rule that is too narrow
KA-274 §14.11, §14.14 Two range beacons at (−1, 0) and (1, 0); robots at (0, 1) and (0, −1); the task requires moving toward the positive side Both robots read √2 from each beacon and the local information matrix is the identity at both points, so a local observability test passes; the two worlds need opposite actions: an alias. A third beacon at (0, 2) reads 1 and 3 and separates them whenever the range error is below 1 exact (verdict) G1 · host Local observability taken for global
KA-275 §14.11 Stage 8 bound for two equally likely aliased worlds with noisy sensors No policy succeeds with probability above (1 + TV)/2, TV being the total-variation distance between the two transcript distributions exact (bound) G1 · host A returned witness that a hand-built policy defeats in both worlds (KILL-SKEL-ALIAS)
KA-276 §14.14 Forward lidar on quad-mammal with assert_obs: C2xC2 Refused (FROB-REF-109) with the lidar mount as breaker exact (verdict) G1 · host A trusted symmetry declaration
KA-277 §14.13 Rejection fixture, rigid link: principal moments that violate the triangle inequalities Refused at stage 2 (FROB-REF-104) exact (verdict) G1 · host The fixture is the planted failure; a check that lets it through is broken
KA-278 §14.13 Rejection fixture, joint: a prismatic travel in millimetres read as radians Refused at stage 1 (FROB-REF-102) exact (verdict) G1 · host As above
KA-279 §14.13, §15.9 Rejection fixture, transmission: reverse drive that produces free electrical energy Refused by the card check (FROB-REF-130) exact (verdict) G1 · host As above
KA-280 §14.13 Rejection fixture, actuator: stall torque available indefinitely at high speed Refused at stage 6 (FROB-REF-131) exact (verdict) G1 · host As above
KA-281 §14.13 Rejection fixture, drive wheel: a changed wheel that intersects the body at its nominal mount pose Refused at stage 3 (FROB-REF-123) exact (verdict) G1 · host As above
KA-282 §14.13, §18.16 Rejection fixture, track: turning in place at zero scrub work on a frictional floor Caught by the belt-law known answer of §18 exact (verdict) G1 · strict As above
KA-283 §14.13 Rejection fixture, foot: a point foot that silently acquires torsional support (a torsion radius above the foot's own contact radius) Refused at stage 1 (FROB-REF-121) exact (verdict) G1 · host As above
KA-284 §14.13 Rejection fixture, sensor: measurements with no timestamp or an unknown frame Refused at stage 1 (FROB-REF-126) exact (verdict) G1 · host As above
KA-285 §14.13, §15.10 Rejection fixture, power source: an empty battery that keeps supplying commanded power Run-time refusal (FROB-REF-135) exact (verdict) G1 · all tiers As above
KA-286 §14.13 Rejection fixture, passive part: swapping a payload that leaves the assembly inertia unchanged Caught by INV-SKEL-06 (the invalidation set contains every product that differs after a full recompile) exact (verdict) G1 · host As above
KA-287 §14.14 (INV-SKEL-02, GATE-SKEL-02) Incremental compilation of a design after an edit Equal to full compilation bit for bit, on 10⁴ random designs and edits exact (bits) G3 · host none stated
KA-288 §14.14 (INV-SKEL-04, PO-SKEL-01, GATE-SKEL-05) JSON and S-expression views of a design The same DesignId; conversion is the identity on canonical forms; canonicalization is idempotent, on 10⁴ random designs and the eighteen archetypes exact (hash) G3 · host none stated; KILL-SKEL-SEXPR removes the second view if the invariant cannot be held
KA-289 §14.14 (PO-SKEL-03, INV-SKEL-06) Influence record of a compiled product Mutation of every field outside a product's record leaves the product bit-identical; the invalidation set of an edit contains every product that differs after a full recompile, on 10⁴ random edits exact (bits) G3 · host A reused product that differs from its recompiled value (KILL-SKEL-SUBST)
KA-290 §14.15 (GATE-SKEL-01) Import of each reference robot Forward-kinematics parity against the oracle within 10⁻⁹ m and 10⁻⁹ rad over 10⁴ configurations; the loss report lists every dropped field found by a field-coverage diff 10⁻⁹ m, 10⁻⁹ rad (GATE-SKEL-01) G2 · host none stated
KA-291 §14.15 (GATE-SKEL-04) 100 seeded defects for stages 1 to 6, at least two per refusal code; 40 planted cases for stages 7 and 8 All 100 refused, at least 95 by the stage and code that own them; zero refusals on the eighteen archetypes and on 10³ random valid designs; at least 36 of 40 decided correctly within budget and none decided wrongly exact (counts) G1 · host The seeded defects are the controls
KA-292 §14.15 (GATE-SKEL-08) Design patches A stale parent refuses in 100 of 100 trials (FROB-REF-112); a repeated idempotency key returns the same DesignId; a schema migration leaves forward kinematics and mass properties bit-identical and old runs replayable exact G4 · host none stated

M.14 §15 Sinew: actuators, transmissions, power

KA Where stated The case The truth Tolerance Tier Negative control
KA-293 §15.5 Brushed or q-axis motor in port-Hamiltonian form: x = (φ, p), H = φ²/(2L) + p²/(2J_r), J = [[0, −k], [k, 0]], R = diag(R_w, b), u = (v, −τ_load) L·di/dt = v − R_w·i − k·ω; J_r·dω/dt = k·i − b·ω − τ_load; Ḣ = v·i − τ_load·ω − R_w·i² − b·ω² exact (polynomial identity) G0 · host none stated
KA-294 §15.5 (INV-SINEW-01, INV-SINEW-03, GATE-SINEW-08) Passivity and second law over 10⁶ random operating points in all four quadrants Every loss is nonnegative; the entropy production P_loss/T_w + G·(T_w − T_amb)²/(T_w·T_amb) is nonnegative each step; every card in the catalog passes actuator.check exact (sign) G0 · all tiers The single-multiplier gear fixture, which must refuse
KA-295 §15.11, §15.14 (GATE-SINEW-02) Port energy balance of an actuator: electrical energy in against mechanical work out, copper, friction and gear loss and the change in stored magnetic and thermal energy The balance closes each step to a recorded residual 10⁻⁹ relative on the referee; 10⁻⁴ relative per episode on single-precision tiers (GATE-SINEW-02) G1 · all tiers Stored heat also counted as a loss, which produces a false defect
KA-296 §15.14 (GATE-SINEW-03) Batched L1 and L2 kernels against the referee components on a 10⁴-case battery Agreement 10⁻⁴ relative (GATE-SINEW-03) G2 · lockstep none stated
KA-297 §15.6 A torque ramp r·t on a joint at rest with breakaway τ_s Motion begins at t = τ_s/r within one step (GATE-SINEW-04) G1 · all tiers (referee exact) none stated
KA-298 §15.6 A mass on a spring of stiffness k with Coulomb friction τ_c, released from rest The amplitude falls by 4·τ_c/k per cycle, and the motion ends inside the band of half-width τ_s/k amplitude loss per cycle within 2% (GATE-SINEW-04) G1 · all tiers (referee exact) none stated
KA-299 §15.6 A held load τ below the stiction bound on a convex tier Creep at ε·τ/τ_b, so drift of at most ε·t over a time t bound (GATE-SINEW-04) G1 · lockstep none stated
KA-300 §15.6 A motor reversal smaller than the backlash gap Zero output motion exact on the referee; batched tiers within their stated regularization (GATE-SINEW-04) G1 · all tiers (referee exact) Backlash modeled as a dead zone on the torque command (§18.7)
KA-301 §15.6 A slow sinusoid through a gap β An input-output loop of width β within 1% (GATE-SINEW-04) G1 · all tiers (referee exact) Backlash modeled as a dead zone on the torque command (§18.7)
KA-302 §15.6 A rotor of reflected inertia J₁ = N²·J_r closing the gap at relative speed Δω onto a link of inertia J₂ at rest, no restitution Common speed J₁·Δω/(J₁ + J₂); energy lost ½·J₁·J₂/(J₁ + J₂)·Δω². With N = 9, J_r = 10⁻⁴ kg·m², J₂ = 0.02 kg·m², Δω = 2 rad/s (illustrative): 0.577 rad/s and 0.0115 J within 1% (GATE-SINEW-04) G1 · all tiers (referee exact) Backlash modeled as a dead zone on the torque command, which produces no impact
KA-303 §15.6, §15.13 (PO-SINEW-02, GATE-SINEW-09) Rotor elimination with twelve backlash joints on a quadruped The rotor-eliminated solve equals the full solve; the dense factorization has the size it has with no backlash joints (18 velocities, not 30) exact rational comparison on small cases; round-off comparison on 10⁴ random cases, to set G1 · host none stated
KA-304 §15.7 Winding with one thermal node at constant current, s = I²·R₀·α below G Stable equilibrium T = T_amb + P_amb/(G − s), time constant C/(G − s); both exceed the constant-resistance values P_amb/G and C/G by the factor 1/(1 − s/G) within 0.5% (GATE-SINEW-05) G1 · all tiers The constant-resistance model
KA-305 §15.7 Worked card (R₀ = 0.20 Ω at 25 °C, α = 0.00393 K⁻¹, G = 0.80 W/K, C = 120 J/K, ambient 25 °C, limit 155 °C) at a constant 20 A 80 W of loss when cold; s = 0.314 W/K; rise 80/(0.80 − 0.314) = 164.7 K, so 190 °C, outside the limit; loss at equilibrium 132 W; time constant 247 s. Constant-resistance model: rise 100 K, 125 °C, 150 s within 0.5% (GATE-SINEW-05) G1 · all tiers The constant-resistance model, which puts the point inside the limit
KA-306 §15.7 The same card: time from cold to the 155 °C limit at 20 A 385 s (constant-resistance model: never) within 0.5% (GATE-SINEW-05) G1 · all tiers The constant-resistance model
KA-307 §15.7 The same card: largest continuous current for the limit Constant resistance: √(0.80·130/0.20) = 22.8 A; temperature-dependent: 22.8/√(1 + 0.00393·130) = 18.6 A, which is 19% lower within 0.5% (GATE-SINEW-05) G1 · host The constant-resistance model
KA-308 §15.7 Thermal runaway threshold No equilibrium for s ≥ G; I_crit = √(G/(R₀·α)) = √(0.80/(0.20·0.00393)) = 31.9 A for the card within 0.5% (GATE-SINEW-05) G1 · host The constant-resistance model, which has no such current
KA-309 §15.7 The same card at 35 A No equilibrium; growth rate (s − G)/C = 0.00136 s⁻¹; the limit is reached at 61 s. Constant-resistance model: an equilibrium 306 K above ambient, limit reached at 83 s within 0.5% (GATE-SINEW-05) G1 · all tiers The constant-resistance model
KA-310 §15.7 Holding torque with flux coefficient α_B = −0.0011 K⁻¹: loss P(T) = I₀²·R₀·[1 + α·(T − T₀)]/[1 + α_B·(T − T₀)]² Limit reached at 15.9 A cold-equivalent, 30% below 22.8 A; no equilibrium above 16.5 A (the tangency), where the slope estimate √(G/(R₀·(α − 2·α_B))) says 25.5 A tangency within 1% (GATE-SINEW-05) G1 · host The slope estimate at T₀ used in place of the tangency
KA-311 §15.7 Winding and housing in series (two-node network) A stable equilibrium exists if and only if s < G_wh·G_ha/(G_wh + G_ha): the conductance matrix with s subtracted from the winding's diagonal entry stays positive definite exact (condition; GATE-SINEW-05) G1 · host none stated
KA-312 §15.7 The same card: 20 s from cold at 20 A Rise 164.7·(1 − e^(−20/247)) = 12.8 K to set G1 · all tiers An evaluation that starts every episode at ambient and so never meets derating
KA-313 §15.7 (GATE-SINEW-05) Static check of a design sized to hold 20 A on the card Admitted by the constant-resistance check; refused by the corrected one (FROB-REF-132) exact (verdict) G1 · host The constant-resistance check
KA-314 §15.8 Voltage limit of a three-phase bridge in power-invariant dq coordinates V_lim = V_bus/√2: 33.9 V at V_bus = 48 V within 0.5% (GATE-SINEW-06) G1 · host none stated
KA-315 §15.8 Base speed, non-salient lossless case (card: λ = 0.010 V·s, L = 100 µH, I_max = 40 A, V_bus = 48 V) V_lim/√(λ² + (L·I_max)²) = 3,151 rad/s electrical within 0.5% (GATE-SINEW-06) G1 · host none stated
KA-316 §15.8 No-load speed without field weakening, same card V_lim/λ = 3,394 rad/s within 0.5% (GATE-SINEW-06) G1 · host none stated
KA-317 §15.8 Currents on the limit above base speed, same card, at 1.5 times base speed i_d = [(V_lim/ω_e)² − λ² − (L·I_max)²]/(2·λ·L) = −32.2 A; i_q = √(I_max² − i_d²) = 23.7 A; 59% of peak torque with field weakening and none without it within 0.5% (GATE-SINEW-06) G1 · host A model without the voltage ellipse
KA-318 §15.8 Top speed with field weakening, same card V_lim/(λ − L·I_max) = 5,657 rad/s when λ > L·I_max; otherwise unbounded in this model within 0.5% (GATE-SINEW-06) G1 · host none stated
KA-319 §15.8 (GATE-SINEW-06) Inscribed-circle voltage envelope against the exact hexagon over 10⁴ random operating points The circle envelope never exceeds the hexagon envelope; it is conservative by at most 1 − √3/2 = 13.4% of voltage at a hexagon vertex exact (inequality) G0 · all tiers none stated
KA-320 §15.9 Back-driven gear, η = 0.8, N = 10, load driving the joint with 10 N·m at 1 rad/s (10 W in) Four-quadrant law: τ_motor = η_b·τ_joint/N = 0.8 N·m at 10 rad/s, 8 W, with 2 W lost exact G1 · host One multiplier in all quadrants, τ_joint = η·N·τ_motor: τ_motor = 1.25 N·m, 12.5 W at the motor, 2.5 W from nowhere; the fixture refuses under FROB-REF-130 (GATE-SINEW-08)
KA-321 §15.9 Screw with lead angle a and friction angle φ η_f = tan a/tan(a + φ); η_b = tan(a − φ)/tan a; the screw locks exactly when φ ≥ a to set G1 · host none stated
KA-322 §15.9 Symmetric differential, q₁ = (θ₁ + θ₂)/2, q₂ = (θ₁ − θ₂)/2, rotor inertias J₁ and J₂ Reflected inertia T⁻ᵀ·diag(J_r)·T⁻¹ = [[J₁ + J₂, J₁ − J₂], [J₁ − J₂, J₁ + J₂]]: equal rotors decouple, unequal ones do not; q̇ = T·θ̇ with τ_actuator = Tᵀ·τ_joint conserves power exact G1 · host Reflected rotor inertia taken as diagonal in joint space
KA-323 §15.13 (PO-SINEW-03) Ideal gear law f₂ = r·f₁ and e₁ = −r·e₂ imply e₁·f₁ + e₂·f₂ = 0 exact (polynomial identity) G0 · host none stated
KA-324 §15.10 Bus with source voltage E and series resistance R under a power demand P Deliverable only if P ≤ E²/(4·R); then V = [E + √(E² − 4·R·P)]/2. With E = 48 V and R = 0.08 Ω: ceiling 7,200 W; at 1,800 W the bus sits at 44.8 V and carries 40.2 A within 0.1% (GATE-SINEW-07) G1 · all tiers A step that completes at the requested power above the ceiling
KA-325 §15.10 (GATE-SINEW-07) A demand above the bus ceiling A brownout event in 100 of 100 trials and never a completed step; stage 6 refuses the design with FROB-REF-133 exact (counts, verdict) G4 · all tiers A kernel that clips the demand
KA-326 §15.10 (INV-SINEW-04, GATE-SINEW-07) Power requested from an exhausted battery Exhaustion is an event; the request refuses (FROB-REF-135); state of charge is never clipped exact (verdict) G4 · all tiers An empty battery that keeps supplying commanded power
KA-327 §15.10, §15.13 Current step on the two-RC battery, V = OCV(z) − R₀·I − V₁ − V₂ An immediate drop I·R₀ followed by two exponentials with time constants R₁·C₁ and R₂·C₂ drop and both time constants within 1% (GATE-SINEW-07) G1 · all tiers none stated
KA-328 §15.13 Constant-current discharge of capacity Q at current I Discharge time Q/I to set G1 · all tiers none stated
KA-329 §15.13 DC motor stall torque η·N·k_t·min(I_max, V_lim/R) within 1% (GATE-SINEW-01) G1 · all tiers none stated
KA-330 §15.13 DC motor no-load speed V_lim/(k_e·N) within 1% (GATE-SINEW-01) G1 · all tiers none stated
KA-331 §15.13 Electrical time constant of a DC motor step L/R within 1% (GATE-SINEW-01) G1 · all tiers none stated
KA-332 §15.13 Mechanical time constant of a DC motor step J·R/(k_t·k_e) within 1% (GATE-SINEW-01) G1 · all tiers none stated
KA-333 §15.13 Constant-resistance thermal steady state Rise P/G (ΔT = P·R_th) within 1% (GATE-SINEW-01) G1 · all tiers none stated
KA-334 §15.13, §15.14 Hover of the rotor port M Thrust equals weight; ideal induced power T^(3/2)/√(2·ρ·A); the energy ledger closes for the hovering body to set (KILL-SINEW-ROTOR fires if the answer or the port balance fails) G1 · referee none stated
KA-335 §15.14 Two-mass resonance of a series-elastic drive F Frequency √(k·(J₁ + J₂)/(J₁·J₂)) within 1% at the referee step (pilot falsifier) G1 · referee none stated
KA-336 §15.14 A single hydraulic cylinder through an orifice M Steady speed equals its closed form (the expression is not stated in the chapter); the port balance closes to set G1 · referee none stated
KA-337 §15.14 Battery ageing law F against one published capacity-fade curve, from that publication's own coefficients The curve is reproduced error at most 10% of the fade (pilot falsifier) G2 · host none stated

M.15 §16 Kinesis: dynamics on three tiers

KA Where stated The case The truth Tolerance Tier Negative control
KA-338 §16.16 Ballistic drop from height z₀ onto a plane under a transactional profile Impact time √(2·z₀/g); outgoing velocity from the law's restitution; remaining flight by the same formula impact time within 10⁻⁹ s (GATE-KIN-04) G1 · referee, strict An endpoint-only gap check
KA-339 §16.5, §16.16 Two 1 kg sliders joined by a rigid tie reach a wall together at 1 m/s Wall impulse 2 N·s; both at rest afterwards exact to 10⁻¹² N·s (GATE-KIN-04) G1 · referee, strict Solve the wall contact for one slider (1 N·s), then impose the tie: 1 kg·m/s shared by 2 kg, both move into the wall at 0.5 m/s
KA-340 §16.5, §16.16 (PO-KIN-04) Dyadic refinement of a Brownian driver: root increment S = √ℓ₀·Z₀; a node with increment S over length ℓ gives its left child S/2 + √(ℓ/4)·Z and its right child the remainder Each half-interval increment has variance ℓ/2; the halves are uncorrelated; their sum equals the parent inside 3σ at 10⁶ draws (GATE-KIN-04) G1 · referee, strict Redraw on rejection: with a fair sign rejected when negative and redrawn once, P(positive) = ½ + ½·½ = ¾
KA-341 §16.5, §16.16 (INV-KIN-02) Forced retry: a transaction that commits on attempt k from checkpoint S Its digest equals that of a clean run started from S with plan k, on 10⁴ random intervals exact (digest) G5 · referee, strict Packet queues or warm starts omitted from the restore set
KA-342 §16.5 (INV-KIN-01, GATE-KIN-04) Faults injected between the checks (T5) and the commit (T6) of a transaction Zero observed uncommitted reads in 10⁵ injected faults: every read names a commit_epoch exact (count) G4 · referee, strict A reader that sees a candidate interval
KA-343 §16.5 Resolution of the dyadic event grid at L_max = 16 and ℓ₀ = 2 ms 2 ms/2¹⁶ = 31 ns, so an approach at 3 m/s is located to within 0.1 µm to set (DESIGN constants, OPEN-KIN-5) G1 · host none stated
KA-344 §16.6, §16.16 (INV-KIN-04, GATE-KIN-05) Padding and co-tenancy: one world at buffer capacities 32, 64 and 128, solo and in 100 random co-tenancies, capacities and slot assignments Identical digests, over 1,000 episodes per back end; the path-table Jacobian gives the same digests as the dense one exact (digest) G5 · lockstep, cuda, metal A reduction tree shaped by capacity
KA-345 §16.6 (PO-KIN-02) Cholesky factor of a system padded with identity rows and a zero right-hand side The leading block of the padded factor equals the unpadded factor bit for bit exact (bits) G0 · all tiers none stated
KA-346 §16.6 (PO-KIN-03) Pairwise sum aligned to powers of two with the real entries in a prefix and trailing −0.0 entries Equals the sum over the real prefix, for every capacity (with +0 entries it fails when the prefix sums to −0.0) exact (bits) G0 · all tiers A grouping that depends on 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
KA-347 §16.6, §16.16 (GATE-KIN-06) A batch of P parameter variants of one tree (256 per reference robot at the gate) Equal to P homogeneous runs bit for bit on batch-cpu and on each GPU back end exact (bits) G5 · lockstep, cuda, metal The parameter row read after its first use in the step
KA-348 §16.6 Bytes per world in f32 with a dense Jacobian: 4·(61·n_b + 17·n_v + 3·n_v² + 24·C + R·n_v + 12·R + 10·n_v) Quadruped (n_v 18, n_b 13, C 24, R 128): 27 kB; hexapod (24, 19, 32, 168): 41 kB; humanoid (35, 30, 40, 224): 72 kB; wheeled base (10, 7, 16, 72): 12 kB; wheel-leg (22, 17, 32, 160): 37 kB; tracked skid-steer (12, 8, 64, 264): 37 kB exact arithmetic, printed to the kilobyte G1 · host none stated
KA-349 §16.6 (GATE-KIN-07, INV-KIN-05) Forced contact or row overflow at every capacity Every overflow is flagged Degraded or refused (FROB-REF-722); no contact is dropped silently; Degraded world-steps are at most 10⁻⁴ of world-steps per class on the standard battery exact for the flag; 10⁻⁴ (GATE-KIN-07) G4 · lockstep, cuda, metal A silent truncation of the contact set
KA-350 §16.8, §16.16 Promotion table at p₀ = 0.05, p₁ = 0.30, α⁺ = 0.01, from ln E⁺ = (n − k)·ln((1 − p₀)/(1 − p₁)) + k·ln(p₀/p₁) A clean pair multiplies the evidence by 1.36 and an exceedance divides it by 6; promotion takes 16 clean pairs, or 22 with one exceedance; at α⁻ = 0.05 two exceedances in the first three pairs reject exact (integer table, regenerated and compared in CI) G1 · host An envelope chosen after the outcomes
KA-351 §16.8, §16.16 (PO-KIN-05, GATE-FID-08) Doubly robust tier correction Zᵢ = mᵢ + Aᵢ·(Y¹ᵢ − mᵢ)/pᵢ With pᵢ = 1 it equals the plain paired mean; with mᵢ = 0 it is the inverse-probability mean; with a constant tier offset it recovers the offset; type-I error at most α over 10⁴ null comparisons with optional stopping; a planted between-tier reversal is not established exact for the identities; α for the error rate (GATE-FID-08) G1 · host Audit probabilities logged after the draw
KA-352 §16.8 Higher-tier episodes saved by the tier correction, 1/(1 − ρ²) 1.3 times fewer at ρ = 0.5, 2.0 at 0.7, 5.3 at 0.9, 10.3 at 0.95 exact arithmetic, printed to two figures G1 · host none stated
KA-353 §16.9, §16.17 (GATE-FID-05) Model-form rank check on planted winners The planted pyramid-cone winner (a pyramid grants √2·μ along its diagonals, 41% more than the cone) and the planted penetration-recovery winner return model-conditional; a genuine winner returns model-robust; cost at most 10% of the campaign's compute exact (verdict) G1 · lockstep, strict The two planted winners are the controls
KA-354 §16.10, §16.16 (INV-KIN-06, GATE-FID-06) Energy audit of a position-level penetration correction that removes depth d in one step, at m = 1 kg, d = 1 mm, h = 2 ms The body gains d/h = 0.5 m/s, 0.125 J per event, from nothing, and raises the flag energy-created (§29.9) within one episode; CL-1 on the same penetration at k = 10⁵ N/m stores 0.05 J, returns less and creates none; an honest policy under CL-1 is unflagged to set for the energy; exact for the flag G1 · lockstep, strict The residual folded into contact dissipation
KA-355 §16.7, §16.16 Free-body variational step (kick, drift, kick with the Cayley retraction) Order 2 by step halving (the energy error falls by a factor between 3.6 and 4.4 per halving of h); reversal to round-off; discrete momentum map conserved without potential or input free-flight momentum to 10⁻¹² relative over 10⁶ steps (GATE-KIN-01); Legendre solve to 10⁻¹³ relative (TARGET) G1 · referee, strict An additive quaternion update
KA-356 §16.16, §16.17 (GATE-KIN-01) Pendulum period at h = 1 ms The closed-form period (carried from the earlier gate; the expression is in the derivation file) within 10⁻⁶ relative G1 · referee none stated
KA-357 §16.16, §16.17 (GATE-KIN-01) Symmetric-top precession The closed-form precession rate (carried from the earlier gate) within 10⁻⁴ G1 · referee none stated
KA-358 §16.16, §16.17 (GATE-KIN-01) Ballistic invariants of C-04 As stated in C-04 (§10) as GATE-KIN-01 G1 · referee none stated
KA-359 §16.17 (GATE-KIN-02) Contact-free forward dynamics of each reference robot against the pinned oracle Joint accelerations agree within 10⁻⁹ relative in f64 G2 · referee none stated
KA-360 §16.17 (GATE-KIN-03) batch-cpu in f64 against fs-mbd: kinematics, inverse dynamics, forward dynamics, mass matrix, on 10⁴ states per reference robot Agreement within 10⁻¹⁰ relative G2 · lockstep none stated
KA-361 §16.11 Referee coverage arithmetic: GPU world-seconds per second are T·h A humanoid batch at 1.7 M world-steps/s (the tolerance of §36.3 row 7) and h = 2 ms produces 3,400 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 about 0.14 to 0.71% (humanoid) and 0.12 to 0.6% (quadruped), and 2.4% where a device produces only 1,000 world-seconds per second exact arithmetic on the TARGETs of §36 G1 · host none stated
KA-362 §16.11 Episodes per tier to detect a five-point gap in success rate, 16·p·(1 − p)/δ² 576 at p = 0.9 and 1,600 at p = 0.5; 11,520 to 32,000 world-seconds at 20 s per episode; 8 minutes to 1.9 hours of background referee time exact arithmetic G1 · host none stated
KA-363 §16.11, §16.17 (GATE-FID-07) Background referee on planted defects A planted single-kernel defect is localized to its stage from one-step defects; a planted tier-sensitive policy is detected within twice the time §16.11 predicts; coverage at least 0.1% of GPU world-seconds; GPU throughput loss at most 5% as GATE-FID-07 G1 · cuda, metal The two planted defects are the controls; KILL-SHADOW fires if neither is detected
KA-364 §16.8, §16.17 (GATE-FID-02) Promotion rule end to end on a planted tier-sensitive policy (NS-09) The policy is caught and labeled provisional: tier-sensitive with both numbers exact (verdict) G1 · lockstep, referee The planted policy is the control

M.16 §17 Phylum: families of bodies in one batch

KA Where stated The case The truth Tolerance Tier Negative control
KA-365 §17.11, §17.18 (PO-PHYLUM-01) Hexapod sweep: ten leg types on six slots under the dihedral group of order 12 (10⁶ + 2·10 + 2·10² + 10³ + 3·10⁴ + 3·10³)/12 = 86,185 canonical representatives, a reduction of 11.6; the number enumerated equals the cycle-index count exact (GATE-PHYLUM-01) G1 · host Counting under the rotation subgroup only
KA-366 §17.11, §17.18 The same sweep when sensors or the task leave only the sagittal mirror (10⁶ + 10³)/2 = 500,500 representatives, a reduction of 2.0 exact (GATE-PHYLUM-01) G1 · host Quotienting under the mechanical group when a front-only sensor is mounted; the request must refuse (FROB-REF-161)
KA-367 §17.11, §17.18 ≡ KA-127 Ballast fixture: eight identical slugs in 24 collinear slots, entering rigid-body dynamics only through the count, Σx and Σx² C(24, 8) = 735,471 placements; 24,546 distinct (Σx, Σx²) pairs, so 24,546 mission-digest classes, a reduction of 30.0 exact (GATE-PHYLUM-01) G1 · host Two placements with equal Σx and different Σx² merged into one class
KA-368 §17.5, §17.18 Padding overhead Ω_p = L_maxᵖ/E[Lᵖ] for three populations, with r = E[L]/L_max Half 18, half 35: r = 0.76, Ω₁ = 1.32, Ω₂ = 1.58, Ω₃ = 1.76, bounds 1.32 and 2.30. 90% at 18, 10% at 35: r = 0.56, 1.78, 2.96, 4.50, bounds 1.78 and 5.61. 89% at 18, 10% at 35, 1% at 66: r = 0.31, 3.27, 9.59, 23.3, bounds 3.27 and 35.0 exact arithmetic, printed to three figures G1 · host none stated
KA-369 §17.5 (PO-PHYLUM-02) Padding bound for 1 ≤ p ≤ 3 1/r ≤ Ω_p ≤ r⁻ᵖ ≤ r⁻³: the lower bound from Lᵖ ≤ L_maxᵖ⁻¹·L, the upper from Jensen's inequality E[Lᵖ] ≥ E[L]ᵖ; property-tested on random populations exact (inequality) G0 · host none stated
KA-370 §17.5 Bucket set with ratio q between successive sizes Overhead inside a bucket is at most q on linear stages and q³ on cubic ones: 1.25 and 1.95 at q = 1.25, which takes eight buckets to span 12 to 66 degrees of freedom exact arithmetic G1 · host none stated
KA-371 §17.5 Worked card: 8,192 worlds, 90% at 18 and 10% at 35 degrees of freedom, stage shares one half cubic, three tenths quadratic, one fifth linear, τ = 0.5 µs, launch overhead 0.45 ms per plan (illustrative) Ω ≈ 0.5·4.50 + 0.3·2.96 + 0.2·1.78 = 3.5. One bucket: 14.8 ms; two buckets: 5.0 ms. At 512 worlds: 1.35 ms against 1.16 ms. At 128 worlds: 0.67 ms against 0.96 ms. Crossover N = c_L/(τ·(Ω − Ω_b)) = 360 worlds; a launch overhead ten times smaller moves it to 36 exact arithmetic on illustrative inputs G1 · host none stated
KA-372 §17.5 Per-step ratio of a mixed cohort against D designs run one after another with W worlds each: D·(c_L + W·τ)/(c_L + Ω·D·W·τ), at D = 512, Ω = 1.3 and the figures of the worked card 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 exact arithmetic on illustrative inputs G1 · host none stated
KA-373 §17.6 Speedup bound when a fraction f of matched wall time is improved by a factor r with relative overhead h speedup ≤ 1/(1 − f + f/r + h): 6.7 for f = 0.85 improved without limit; about 13.5 for f = 0.97, r = 40, h = 0.02; 1.10 to 1.32 for the family lane at f = 0.15 to 0.35, r = 4, h = 0.02 exact arithmetic G1 · host A pruning ratio multiplied by a speedup measured on work the pruning already removed
KA-374 §17.9 Ceiling of per-design kernel specialization from a published step trace (53 of 262 ns, 20% of the step) 1.25 for an infinitely fast specialized recursion; 1.11 for one twice as fast; 1.19 on a manipulation scene with a 16% share exact arithmetic on a FACT to be re-read at its primary source G1 · host none stated
KA-375 §17.4, §17.18 (INV-PHYLUM-02, GATE-PHYLUM-02) Each of 512 designs in a mixed cohort against the same world in a homogeneous batch of its own model, at three bucket sizes and under slot dispatch with 100 random co-tenancies Identical digests per world, on batch-cpu and per GPU back end exact (digest) G5 · lockstep, cuda, metal A reduction tree shaped by capacity
KA-376 §17.17 (INV-PHYLUM-01) Slots and co-tenants of a cohort permuted Envelopes compare equal after sorting by world address; slot, cohort and arrival order appear in no result exact G3 · lockstep, cuda, metal none stated
KA-377 §17.11, §17.18 Mirror swap of a design under an element of Γ_obs Every distributional result is reused; per-address results are reused after the address is mapped through the group action (the design g·d in world w behaves as d does in world g⁻¹·w) exact G3 · host A shared-bus edit reused; an unmapped per-address result reused
KA-378 §17.11, §17.18 Coupled bus: two fingers with identical local summaries on a bus limited to one unit of current Zero feasible one-tick schedules and two feasible two-tick schedules; the design is feasible exact (counts) G1 · host Pruning by summed peak demand
KA-379 §17.11, §17.19 (GATE-PHYLUM-05) Invalidation contract under 10⁴ random edit sequences Results equal full recomputation; the positive control reuses; a shared-bus edit invalidates; a reversed port sign is refused exact G3 · host The three negative controls of §17.11
KA-380 §17.11, §17.19 (GATE-PHYLUM-01, INV-PHYLUM-03) 10⁴ sampled pairs of designs inside one mission-digest class, replayed Identical digests in every pair: zero false quotients exact (digest) G5 · lockstep The lidar and equal-Σx controls; one false quotient surviving a repair cycle fires KILL-QUOTIENT
KA-381 §17.13, §17.18 Paired finite-difference gradient on a ballistic body with range R = v²·sin 2α/g ∂R/∂v = 2·v·sin 2α/g, recovered to O(δ²) within 1% (GATE-PHYLUM-06) G1 · lockstep A binary success metric admitted; it must refuse (FROB-REF-540)
KA-382 §17.13, §17.18 Paired stencil on a bouncing body near grazing Each pair is flagged at the first step where the active contact sets of its two worlds differ, and truncated there (truncated-horizon) exact (flag) G1 · lockstep Divergence ignored and the full horizon averaged
KA-383 §17.13 Stencil size for 20 parameters and 64 seeds (2·20 + 1) × 64 = 41 × 64 = 2,624 worlds exact G1 · host none stated
KA-384 §17.17 (INV-PHYLUM-07) Worlds of one stencil seed Every world shares every random draw: stream addresses compare equal exact G5 · lockstep A planted unshared stream
KA-385 §17.10, §17.18 (INV-PHYLUM-06, GATE-PHYLUM-07) Morphology generator The same (GeneratorId, seed, index) gives the same DesignId on Linux and macOS; log-probabilities are exact and sum to one on enumerable sub-grammars; no orbit straddles a DesignSplit exact G5 · host A generator that reads the wall clock or a hash-map order
KA-386 §17.12, §17.17 (PO-PHYLUM-03) Merge of quality-diversity maps, each cell keeping the maximum under the total order (score, then DesignId) Commutative, associative and idempotent exact G0 · host none stated

M.17 §18 Traction: collision, contact, wheels, tracks, terrain

KA Where stated The case The truth Tolerance Tier Negative control
KA-387 §18.16 Block on an incline of angle α with friction μ Stays if tan α < μ and slides if tan α > μ; creep below the threshold is at most the stated stiction speed (zero under CL-H, GATE-TRAC-09) measured threshold within 1% of μ G1 · strict, lockstep, referee none stated
KA-388 §18.16 Sphere rolling down an incline without slip Acceleration (5/7)·g·sin α to set (GATE-TRAC-01) G1 · strict, lockstep, referee none stated
KA-389 §18.9, §18.16 Disk rolling on a plane v = ω·r; the nonholonomic trajectory of C-07 equals Δp = v·Δt·sinc(δ/2)·(cos(θ + δ/2), sin(θ + δ/2)) with δ = ω·Δt and sinc(0) = 1 v = ω·r within 0.1% G1 · strict, lockstep, referee none stated
KA-390 §18.9 Near-straight differential drive, the admission test of the rolling oracle (INT-FSIM-01): heading 32 rad, wheel speeds 1 and 1 + 6·10⁻¹³ m/s, track 0.5 m, 400 steps of 1/400 s Translation about (0.8342, 0.5514) m, from the closed form to set G2 · host fs-mbd::planar_drive at the pinned commit, reported to return zero translation (FACT to recheck); it is not used as an oracle until it passes
KA-391 §18.16 Box stack, ten high At rest for 10 s with drift below 1 mm 1 mm G1 · strict, lockstep none stated
KA-392 §18.16 Dropped body under an inelastic law Total mechanical energy never increases exact (sign) G1 · strict, lockstep, referee none stated
KA-393 §18.16 Capsule against a spherical distance field Gap error at most the interpolation bound of the brick the stated interpolation bound G1 · strict, lockstep none stated
KA-394 §18.16 Mecanum base commanded sideways Moves sideways with yaw below 1° 1° G1 · strict, lockstep none stated
KA-395 §18.16 Ring on a cone Slides if and only if tan α > μ to set (GATE-TRAC-01) G1 · strict, lockstep, referee none stated
KA-396 §16.5, §18.16 Painlevé rod The referee reports the indeterminate configuration (FROB-REF-224) and returns no number exact (verdict) G1 · referee A solver that returns one of several distinct motions
KA-397 §18.16 Disk of radius a spinning in place under uniform pressure Stops at t = 3·a·ω₀/(4·μ·g): 0.153 s for a = 0.05 m, ω₀ = 20 rad/s, μ = 0.5 within 1% (GATE-TRAC-04) G1 · strict, lockstep none stated
KA-398 §18.6 (PO-TRAC-04) Effective patch radius of the spin row Uniform pressure on a disk of radius a: torsional capacity (2/3)·μ·N·a, so r_eff = 2a/3; Hertzian pressure: r_eff = 3π·a/16, about 0.59·a exact (derivation on file) G0 · host none stated
KA-399 §18.6, §18.16 Sliding at speed v while spinning at ω on the four-dimensional cone Tangential force μ·N·v/√(v² + (r_eff·ω)²); at v = r_eff·ω it is μ·N/√2 within 0.5% of μ·N/√2 (GATE-TRAC-04) G1 · strict, lockstep Independent slide and spin rows, which grant μ·N of sliding friction and μ·N·r_eff of torsional friction at once, 41% more in magnitude
KA-400 §18.16 Thin ring sliding and spinning (r_eff = a, I = m·a²) v/(a·ω) stays constant and both stop at t = √(v₀² + a²·ω₀²)/(μ·g): 0.288 s for v₀ = a·ω₀ = 1 m/s, μ = 0.5 within 1% (GATE-TRAC-04) G1 · strict, lockstep Independent slide and spin rows
KA-401 §18.16 Traction along a diagonal of the tangent plane Maximum friction is μ·N in every direction within 0.5% of μ·N (GATE-TRAC-04) G1 · strict, lockstep The pyramid cone, which gives √2·μ·N
KA-402 §18.7, §18.16 Joint stiction under a torque ramp τ = k·t A stuck joint breaks away at t = τ_s/k within 1% (GATE-TRAC-04) G1 · strict, lockstep none stated
KA-403 §18.7, §18.16 Backlash crossing and closure: rotor inertia J = 10⁻⁴ kg·m² at 5 rad/s behind a ratio N = 10, gap β = 0.5°, output inertia 0.05 kg·m², inelastic closure Crossing time β·N/ω₀ = 17.5 ms; output speed after closure J·N·ω₀/(J·N² + I_out) = 0.083 rad/s within 1% (GATE-TRAC-04) G1 · strict, lockstep Backlash as a dead zone on the torque command: no impact at closure, no hunting in a position loop
KA-404 §18.8, §18.16 (PO-TRAC-02) Stefan squeeze of a film to 10 µm from a thick film: dh/dt = −2·N·h³/(3π·η·a⁴), integrated to 1/h² − 1/h₀² = 4·N·t/(3π·η·a⁴) Water (1 mPa·s), patch radius 2 cm, 100 N: 0.038 s. Cooking oil (60 mPa·s), same patch: 2.3 s. Water, patch radius 6 cm, 400 N: 0.76 s within 2% (GATE-TRAC-05) G1 · strict, lockstep A constant coefficient per floor texel
KA-405 §18.8, §18.16 Sled on a full film (h ≥ 3σ) Couette shear F = η·v·A/h within 10⁻⁶ relative in f64 (GATE-TRAC-05) G1 · strict, lockstep none stated
KA-406 §18.8, §18.16 (INV-TRAC-07) Film law with no film (h₀ = 0) The dry card μ_d, bit for bit exact (bits) G1 · all tiers none stated
KA-407 §18.8 (INV-TRAC-07, GATE-TRAC-05) Limits of the film law on 10⁴ random states μ_b for h ≤ σ; pure Couette shear for h ≥ 3σ; continuous in h between; a squeezed film recovers to μ_b, not to μ_d to set G1 · strict, lockstep none stated
KA-408 §18.4, §18.16 Thin barrier: a sample sphere of radius 2 mm at 5 m/s with h = 2 ms travels 10 mm; a 2 mm plate lies 1 mm ahead; clearing it takes 1 + 4 + 2 = 7 mm The step encloses a collision although both endpoints are clear (the sphere ends 3 mm beyond the far face); zero missed hits in 10⁶ randomized crossings under transactional profiles exact (count; GATE-TRAC-06) G1 · referee, strict The endpoint-only query, which misses
KA-409 §18.4, §18.16 (INV-TRAC-06) Torque-driven wheel over a sharp sill Feature sequence flat, edge, top; work and impulse converge under step halving; no couple that the contact forces do not explain work and impulse within 1% of their refined values at h/4; no couple above 10⁻⁹ N·m in f64 (GATE-TRAC-06) G1 · referee, strict Tangential memory kept on a changed feature
KA-410 §18.3, §18.16 (INV-TRAC-03) Clearance with registration errors 6 mm nominal gap with 4 mm outward error per side: the outer enclosures overlap by 2 mm, answer unknown. 10 mm nominal with 4 mm per side: clear with 2 mm to spare exact (verdict) G1 · host The nominal gap taken as clearance
KA-411 §18.3, §18.17 (GATE-TRAC-07) Enclosure answers on 10⁴ generated pairs with known truth No false clear and no false penetrates; every certificate re-checked offline (§12) exact (counts) G1 · host, auditor none stated
KA-412 §18.3 Two swept volumes that overlap in space while the bodies occupy the shared region at different times Not a contact: the test is per time slab exact (verdict) G1 · host A test on whole-sweep volumes
KA-413 §18.16 Sole straddling a low-grip strip (μ 0.25 inside, 0.8 outside, uniform pressure), boundary at offset z from the centre of a sole of width w High-grip share clip(½ + z/w, 0, 1): capacity 0.525·N at z = 0 for any width; at z = 12 mm, 0.690·N for w = 40 mm and 0.619·N for w = 70 mm to set G1 · strict, lockstep Contact area taken as the predictor of traction
KA-414 §18.16 Load-weighted slip metric Duplicating a quadrature point and halving its weights changes nothing to set G3 · all tiers none stated
KA-415 §18.10, §18.16 Plate sinkage on soft soil, p = (k_c/b + k_φ)·zⁿ z = (p/(k_c/b + k_φ))^(1/n); with b = 0.1 m, k_c = 1 kPa/mⁿ⁻¹, k_φ = 1,500 kPa/mⁿ, n = 1.1 and p = 20 kPa: z = 19.6 mm (illustrative) law evaluation within 10⁻⁶ in f64; simulated sinkage within 2% (GATE-TRAC-08) G1 · strict, lockstep none stated
KA-416 §18.10, §18.16 Track thrust at slip i, with shear law τ = (c + σ·tan φ)·(1 − exp(−j/K)) and j = i·x F = (A·c + W·tan φ)·(1 − (K/(i·L))·(1 − exp(−i·L/K))); two tracks of 0.5 m by 0.1 m under 500 N with c = 1 kPa, φ = 30°, K = 25 mm: limit 389 N, and 293 N at 20% slip (illustrative) law evaluation within 10⁻⁶ in f64; simulated drawbar pull within 2% (GATE-TRAC-08) G1 · strict, lockstep none stated
KA-417 §18.9, §18.16 Lateral brush tyre force, ‖F_y‖ = μ·N·(3ζ − 3ζ² + ζ³) for ζ = C_α·‖tan α‖/(3·μ·N) ≤ 1 and μ·N beyond Slope C_α at zero slip; saturation μ·N at tan α = 3·μ·N/C_α within 10⁻⁶ in f64 (GATE-TRAC-08) G1 · host none stated
KA-418 §18.9, §18.16 Skid-steer under exact lateral no-slip at contact stations a ahead of and behind the centre v_y + a·ω = 0 and v_y − a·ω = 0 force ω = 0: yaw rate zero; a tracked base turns only by slipping exact G1 · host A tracked base treated as a rolling constraint that still turns
KA-419 §18.10, §18.16 Rut isolation A rut made in one episode is absent from every other; leak zero over 10³ resets (GATE-TRAC-08) exact G4 · lockstep none stated
KA-420 §18.11, §18.17 (INV-TRAC-04, GATE-TRAC-06) Capacity-bias fixture: a tracked design against a point-foot design under an artificially low contact cap The comparison returns capacity-biased and no winner; citing it as a verdict refuses (FROB-REF-822) exact (verdict) G1 · lockstep Contacts removed to fit the capacity
KA-421 §18.5, §18.17 (GATE-TRAC-09) CL-H on batch-cpu No separation velocity on a sliding block (the associated model gives μ·‖u_T‖); zero creep on the incline below threshold; residual at most 10⁻⁴ within eight passes on at least 95% of battery contact states and 10⁻⁶ under strict; agreement with the referee on the Solid rows of §18.16 as GATE-TRAC-09 G1 · strict, lockstep The associated model with the μ·‖u_T‖ term dropped
KA-422 §18.12 (PO-TRAC-03, GATE-TRAC-10) Power-of-two diagonal scaling Ĥ = S·H·S The computed Cholesky factor of S·H·S equals S times the computed factor of H bit for bit, absent overflow and underflow; solutions are bit-identical with and without S on 10⁵ sampled systems; f32 against f64 Newton-step error at most 0.5% at default cards and 5% at near-rigid cards; cards over the bound refuse (FROB-REF-244) exact (bits) for the identity; 0.5% and 5% (GATE-TRAC-10) G3 · all tiers none stated
KA-423 §18.12 Half-precision refuting calculation: rank-one contact operator W with proximal shift ρ = 10⁻²·tr(W)/48 for 16 contacts κ = 1 + 48/0.01 = 4,801 and κ·u₁₆ = 2.34 with u₁₆ ≈ 4.9 × 10⁻⁴, so refinement does not contract; k refinement steps cost 9k/n times the factor: 2.3 at n = 27 with seven steps, 1.5 at n = 35 with six, 3.0 at n = 18 with six; a half-precision request refuses (FROB-REF-245) exact arithmetic; exact (verdict) G1 · host none stated
KA-424 §18.15 (PO-TRAC-01) Four-dimensional contact cone √(λ_t1² + λ_t2² + (λ_s/r_eff)²) ≤ μ·λₙ A linear image of the second-order cone in ℝ⁴; projection and Moreau identities hold; with r_eff = 0 the spin row is masked and the cone is the three-dimensional one exact (polynomial identity); G0 property tests G0 · host none stated
KA-425 §18.17 (GATE-TRAC-02) Primitive pair distances and normals against fs-query on 10⁶ random pairs Agreement within 10⁻⁹ m in f64 G2 · host none stated

M.18 §19 Habitat: scenes, living worlds, clearance, retrofits

KA Where stated The case The truth Tolerance Tier Negative control
KA-426 §19.18, §19.4 Compiled scene field against its source geometry, sampled at 10⁶ surface points Error at most the recorded brick bound (the source-chart enclosure, plus the trilinear interpolation error on the brick lattice, plus half a quantization step) and at most half a fine voxel; analytic shapes compiled to bricks exact to the interpolation bound; analytic overlays exact to round-off The brick bound; half a fine voxel (GATE-HAB-01) G1 · all tiers A brick with its bound halved fails
KA-427 §19.4, §19.5.6 Quantization ripple: a 10 kg block at rest on a brick floor with no overlay Stored values are clamp(φ, −T, +T) in 16 bits with T = 8 cm at 2 cm spacing: step 0.16 m / 65,535 ≈ 2.4 µm, a ripple of at most half a step, about 0.12 N per contact sample at 10⁵ N/m; normal-force ripple at most 1% of weight 1% of weight on every tier (TARGET, GATE-HAB-01) G1 · all tiers none stated (the withdrawn quantization over ±10 m, 20 m / 65,536 ≈ 0.31 mm and about 30 N per step, is the defect this row guards)
KA-428 §19.4 Brick byte layout 8³ fine samples of 16 bits are 1,024 bytes; a palette of at most four region identifiers with a two-bit selector per sample is 128 bytes, 12.5% over the distance samples exact G1 · host none stated
KA-429 §19.5.1, §19.18 Reflected asymmetric room at registration Landmarks A = (0, 0, 0), B = (1, 0, 0), C = (0, 1, 0); the map (x, y, z) ↦ (x, y, −z) fixes all three; the fourth landmark D = (0, 0, 1) maps to (0, 0, −1), residual 2 m; four-point registration rejects the import (LᵀL = c²·I and det L > 0 fail), FROB-REF-302 exact (verdict and residual); GATE-HAB-04 G1 · host The three-point check accepts the reflection with zero residual
KA-430 §19.5.2, §19.18 Doorway with a nominal 6 mm gap and 4 mm of possible outward error on each side Outer enclosures overlap by 2 mm, so clearance is not established; inner enclosures are 14 mm apart, so penetration is not witnessed; verdict unknown exact; GATE-HAB-04 G1 · host A nominal-surface test says "clear"
KA-431 §19.5.6, §19.18 Door-clearance gauges at every door of clear width w with field bound b The go gauge of width w − 2b passes and the no-go gauge of width w + 2b is blocked exact (verdicts) on 100 scenes per archetype (GATE-HAB-04) G1 · all tiers A door narrowed by 3 bounds blocks the go gauge
KA-432 §19.5.6 Metric calibration board measured by ray kernels Measured lengths equal the board's known dimensions The brick bound (GATE-HAB-04) G1 · all tiers none stated
KA-433 §19.5.6 Normal-direction probe on each tagged surface ∇φ points out of solids; floor normals are +z to set ("within tolerance", GATE-HAB-04) G1 · all tiers none stated
KA-434 §19.5.6 Support test: a unit block released above each support surface The block comes to rest on the surface exact (verdict); GATE-HAB-04 G1 · referee A floor that exists only in the renderer fails
KA-435 §19.5.6 Tile continuity: rays and swept wheels crossing brick and tile boundaries No gap or step at a boundary to set (GATE-HAB-04) G1 · all tiers none stated
KA-436 §19.5.4, §19.18 One floor tile in four states (matte dry, glossy dry, matte wet, glossy wet) Changing the optical card leaves every physics digest unchanged in a run whose controller does not consume exteroception; changing the interface card leaves every ray-kernel output unchanged; changing the shared latent changes both in the recorded direction exact, bit for bit within the determinism class (GATE-HAB-05) G3 · all tiers A build that derives friction from r0 fails
KA-437 §19.10.2 Film-thickness update under a constant load d(h⁻²)/dt = 4·F / (3π·η·R⁴), so h⁻²(t + Δt) = h⁻²(t) + 4·F·Δt / (3π·η·R⁴) is exact for a load constant over the step (PO-HAB-04, symbolic identity) exact (symbolic) G0 · host none stated
KA-438 §19.10.2, §19.18 Squeeze-film time for a thick film to thin to h₁ = 10 µm t = 3π·η·R⁴ / (4·F·h₁²): 0.038 s (R = 20 mm, F = 100 N, water at 1.0 mPa·s); 2.3 s (same pad, cooking oil at 60 mPa·s); 0.76 s (R = 60 mm, F = 400 N, water). Against a 0.3 s stance only the first reaches boundary contact within 1% (GATE-HAB-06) G1 · all tiers Doubling R must multiply the time by 16
KA-439 §19.10.2 Film-friction limits μ = w(Λ)·μ_b + (1 − w(Λ))·μ_v with Λ = h/σ and w(Λ) = clamp((3 − Λ)/2, 0, 1): at Λ ≤ 1 (dry limit) μ = μ_b; at Λ ≥ 3 (thick film) μ = μ_v = min(μ_b, η·abs(v_t)·πR² / (h·F)); both limits recover the card coefficients to set (GATE-HAB-06 states recovery, no number) G1 · all tiers none stated
KA-440 §19.10.2, §19.18 Castor at a rug edge Horizontal force W·tan α with tan α = √(h·(2r − h)) / (r − h); r = 25 mm, h = 10 mm gives 4/3 of the load, 67 N for a 50 N castor; a 2 kg free slab resists with about 0.5 × 19.6 N ≈ 10 N and slides first to set for the force; exact for the verdict (GATE-HAB-08: the free slab slides) G1 · referee A fixed step is climbed or blocks
KA-441 §19.10.3, §19.18 Three-cell film transport, h = (0, 1, 0), contact indicator on the middle cell, v̄ = +1 The face-flux form moves Δt/Δx from the middle cell into the right-hand cell; total volume is conserved (PO-HAB-05, telescoping identity) exact in exact arithmetic; compensated-sum audit per run G1 · all tiers The masked non-conservative form 1·∇·(h·v̄) removes Δt/Δx from the middle cell and adds it nowhere
KA-442 §19.10.3, §19.19 Advected film with pickup and redeposition Total volume, cells plus reservoirs, is constant (INV-HAB-07); no trace in another world Relative volume residual at most 10⁻⁶ over 10⁵ steps; no cross-world leak in 10⁶ world-episodes (GATE-HAB-07) G1 · all tiers The non-conservative control fails the mass gate
KA-443 §19.10.3, §19.18 Viscous spreading of a constant volume on a flat floor Radius ∝ t^(1/8) in the axisymmetric case; front position ∝ t^(1/5) in the planar case Exponent within 2% of 1/8 (GATE-HAB-07) G1 · all tiers Removing the h³ factor changes the exponent
KA-444 §19.10.3, §19.18 Film thickness limit of the explicit update h_max = (3ν·Δx² / (4·g·Δt))^(1/3): 2.5 mm for water at Δx = 2 cm and Δt = 2 ms; 10 mm for a 65 mm²/s oil to set G1 · host A 4 mm film of water is refused or sub-cycled at admission (FROB-REF-307)
KA-445 §19.10.3 Film tile storage A tile of 16 × 16 cells is 1,024 bytes of thickness; a 6 m × 6 m floor fully wet at 2 cm is 352 tiles, about 360 kB per world; a 1 m² spill is about 16 kB to set G1 · host none stated
KA-446 §19.10.4, §19.18 Slosh, first antisymmetric mode of a rectangular container ω_n² = ((2n − 1)·π·g / L)·tanh((2n − 1)·π·h / L); for L = 0.30 m and h = 0.10 m, ω₁ = 8.96 rad/s (1.43 Hz) within 3% at three fill depths (GATE-HAB-08) G1 · all tiers Halving the fill must lower the frequency
KA-447 §19.10.5, §19.18 Hanging chain, 1.2 m between supports 1.0 m apart Sag 0.292 m (the catenary, with parameter a solving 1.2 = 2a·sinh(0.5/a)); 20 links reproduce it within 2% at 20 links (TARGET, GATE-HAB-08) G1 · referee A chain with no bending limit and one link fails
KA-448 §19.11, §19.18 Right-angle corridor: a rectangle of width b and length L between corridors of width a (b < a) Passes if and only if L ≤ 2√2·a − 2b; derivation: with the outer long side touching both outer walls at inclination θ, L ≤ (a·sin θ + a·cos θ − b) / (sin θ·cos θ), smallest at θ = 45°; 1.346 m at a = 0.90 m, b = 0.60 m (a 1.30 m body passes, a 1.40 m body does not). The complex returns a witness below the limit minus its band and a cut above the limit plus its band Bracketed by witness and cut within the refined band on 100 (a, b) pairs (GATE-HAB-10) G1 · host Inscribed and circumscribed disc tests are both wrong
KA-449 §19.11, §19.18 Clearance error term of a cell e = (Δ/2)·√2 + ρ·(δ/2) + ε_field + u_reg; at Δ = 5 cm, 32 headings and ρ = 0.40 m the first two terms are 35.4 mm + 39.3 mm = 74.6 mm; 18.7 mm at Δ = 12.5 mm and 128 headings; 6.0 mm at Δ = 5 mm and 512 headings to set G1 · host none stated
KA-450 §19.11 Size of the default clearance lattice A 12 m × 8 m floor at Δ = 5 cm with 32 headings is 240 × 160 × 32 = 1,228,800 cells, 4.69 MiB at four bytes per cell exact G1 · host none stated
KA-451 §19.11 Doorway fit at the default lattice A body centred in a doorway has clearance equal to half the total margin and a witness needs c_lo > 0, so a fit with total margin under 2e ≈ 149 mm is unresolved before local refinement exact (verdict) G1 · host none stated
KA-452 §19.11, §19.19 Clearance witnesses and cuts against a brute-force grid at four times the resolution Zero false witnesses and zero false cuts on the seven archetype fixtures (INV-HAB-06, PO-HAB-03); the checker accepts every emitted certificate and rejects six mutated ones exact (GATE-HAB-10; one false witness or cut trips KILL-FCLEAR) G0 · auditor Six mutated certificates must be rejected
KA-453 §19.12, §19.18 Driven wheel at a 20 mm threshold, quasi-static, no help from another axle Friction needed tan α = √(h·(2r − h)) / (r − h): 4/3 at r = 50 mm (statically impossible on any floor card), 0.75 at r = 100 mm, 1/12 on a wedge whose run is twelve times its rise; a body arriving at √(2·g·h) = 0.63 m/s has the energy to rise 20 mm before losses. The retrofit search returns the ramp, the design search returns the wheel, the report shows both to set for the coefficients; both arms reproduce the closed form (GATE-HAB-11) G1 · referee none stated
KA-454 §19.12 Unfiltered retrofit kit count for forty catalog entries and kits of at most three 40 + 780 + 9,880 = 10,700 exact G1 · host none stated
KA-455 §19.12, §19.19 Three planted building bottlenecks (a 20 mm threshold, a door closer above push capability, an unmarked glass door) Each is repaired by the expected kit with the policy identity unchanged (INV-HAB-08) exact (verdicts) (GATE-HAB-11) G1 · lockstep none stated
KA-456 §19.14, §19.18 A layout and its mirror image, and a retrofit variant, planted across a train and test split Refused: a group never straddles a split (INV-HAB-09, FROB-REF-311) exact (GATE-HAB-14) G1 · host Splitting by SceneId alone accepts it
KA-457 §19.5.5, §19.19 Feasibility counts in split manifests Counts of witnessed, impossible and unresolved scenes equal a recount; no scene resampled (INV-HAB-05) exact (GATE-HAB-14) G1 · host none stated
KA-458 §19.5.6, §19.18 Mutable-state leak: wet a tile in world i, reset, read world j and the next episode of world i No trace outside the declared persistence (INV-HAB-03) exact G5 · all tiers A pool indexed without the world address fails
KA-459 §19.15, §19.18 Dense scene memory, samples = volume / spacing³ and bytes = 2 × samples Home (300 m³): 9 MB at 4 cm, 75 MB at 2 cm, 0.6 GB at 1 cm. Warehouse (19,200 m³): 0.6 GB, 4.8 GB, 38 GB. Building (57,600 m³): 1.8 GB, 14.4 GB, 115 GB. Band fraction min(1, (A/V)·t·s) for t = 8 to 20 voxels; 2 cm band bricks with labels 45–84 MB, 1.6–3.9 GB, 2.9–7.3 GB. Checked from a recount of compiled bricks exact for dense figures; band figures are hypotheses measured at GATE-HAB-13 G1 · host none stated
KA-460 §19.15 Resident scene counts from the dense figures (12–16 GB of a 24 GB card; 85% of the measured working-set limit on the M5 Ultra, about 189 GiB) Home at 2 cm: 160–210 and about 2,500; home at 1 cm: 20–27 and about 320; warehouse at 4 cm: 20–27 and about 320; warehouse at 2 cm: 2–3 and about 40; warehouse at 1 cm: none and 4; building at 2 cm: at most 1 and 13; building at 1 cm: none and 1 exact arithmetic; measured counts are recorded against the table (GATE-HAB-12) G1 · host none stated
KA-461 §19.15 One scene per world 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 exact G1 · host none stated
KA-462 §19.15 Variant directory size One 32-bit slot and one 16-bit coarse sample per coarse cell, 6 bytes per cell: 0.44 MB for the home and 28 MB for the warehouse at the default spacings to set G1 · host none stated
KA-463 §19.15, §19.19 Brick pool against the dense field The pooled field equals the dense field bit for bit at 10⁶ points per scene exact (GATE-HAB-13) G1 · all tiers none stated
KA-464 §19.19, §19.17 Scene identity across platforms, 1,000 seeds per archetype The same family, parameters, seed and compiler version give the same SceneId on Linux and macOS (INV-HAB-10); every scene is tagged witnessed, impossible or unresolved; at most 5% unresolved; the share of impossible: intended within one percentage point of the family's quota; no scene resampled exact for identity; counts as stated (GATE-HAB-02) G5 · host none stated

M.19 §20 Sensorium: sensors, clocks, observability

KA Where stated The case The truth Tolerance Tier Negative control
KA-465 §20.20 Depth camera against analytic scenes Reported range equals the analytic ray distance within 1 mm plus the brick bound (GATE-SENS-01) G1 · all tiers Ray distance swapped for optical depth
KA-466 §20.5, §20.20 IMU at rest f = R_WSᵀ·(a_P − g) reads (0, 0, +g) with zero rate; gravity enters exactly once for prescribed and for floating bases to set (GATE-SENS-01) G1 · all tiers Gravity applied twice
KA-467 §20.5, §20.20 IMU in free fall without rotation Specific force zero to set (GATE-SENS-01) G1 · all tiers Gravity applied twice
KA-468 §20.5, §20.20 IMU in free fall spinning at 5 rad/s with a 0.10 m perpendicular mount offset a_P = a_O + α × r + ω × (ω × r) gives 2.5 m/s² toward the axis to set (GATE-SENS-01) G1 · all tiers Gravity applied twice (the one control the source row states for its three cases)
KA-469 §20.20 IMU on a turntable Reads the table rate to set (GATE-SENS-01) G1 · all tiers none stated
KA-470 §20.20 Lidar pattern Beam geometry and per-beam instants match the pattern definition exact (GATE-SENS-01) G1 · all tiers none stated
KA-471 §20.4.6, §20.20 Physics at 400 Hz and a policy at 30 Hz under hold h = 1/400 s, T = 1/30 s, Q = 1,200; a step is 3 quanta and a policy period 40; nominal decisions at 0, 40, 80, 120 quanta are realized at boundaries 0, 14, 27, 40 (42, 81, 120 quanta) with lateness 0, 2, 1, 0 quanta (0, 1.67, 0.83, 0 ms); decision intervals 14, 13, 13 steps repeating every 0.1 s; exactly 600 decisions in 20 s exact; identical schedules on every tier (GATE-SENS-04) G1 · all tiers Every-thirteenth-step scheduling gives 616 decisions on the same half-open window (400/13 = 30.77 Hz)
KA-472 §20.4.1, §20.19 Integer event schedule against exact rational arithmetic The k-th nominal event of every clock is at phase + k·period exactly (INV-SENS-04, PO-SENS-01); lateness is zero under split and less than h under hold exact; zero drift over 10⁹ ticks (GATE-SENS-04) G0 · host A floating-point accumulator drifts
KA-473 §20.4.1, §20.20 Drifting clock A rate error of 50 parts per million is the rational 1/20,000; two sensors 50 parts per million apart separate by 1 ms after 20 s, exactly exact G1 · all tiers A floating-point accumulator drifts from this
KA-474 §20.4.1 Admission of the clock lattice A lattice with common denominator Q above 2⁴⁰ is refused (FROB-REF-440); at the limit a run of 10⁶ s stays below 2⁶⁰ quanta exact G1 · host none stated
KA-475 §20.4.3, §20.20 Impulse inside one exposure of a force sensor An impact of 0.2 N·s inside one 10 ms half-open window reads 20 N in that window's average and 0 in the adjacent one; an impulse exactly at t belongs to the window that opens at t exact (GATE-SENS-04) G1 · all tiers A closed-closed window counts it twice
KA-476 §20.4.3, §20.20 Packet arrival at the decision instant A packet arriving at t is visible to the decision at t (a zero-latency loop is legal); a packet arriving one quantum after t cannot influence the command decided at t exact (GATE-SENS-04) G1 · all tiers Evaluating the controller before delivery
KA-477 §20.4.5, §20.20 Checkpoint and restore at three adversarial instants (just after a shutter opens, just after a packet is dropped, just before a controller tick) Byte-equal delivered observations and physics digests after restore (INV-SENS-03) exact over the next 10⁴ ticks on every tier (GATE-SENS-05) G5 · all tiers A checkpoint without packet queues
KA-478 §20.4.7 Schedule races: six events with three independent conflicting pairs 720 orderings fall in 2³ = 8 equivalence classes; one representative per class is replayed and digests are compared exact G3 · host One planted stale read and one planted watchdog-against-latch race must both be found (KILL-SCHED)
KA-479 §20.7, §20.20 Rolling shutter: focal length 600 pixels, 16 ms readout, yaw 2 rad/s, vertical edge near the optical axis Skew 600 × 2 × 0.016 = 19.2 pixels from the first row to the last within 0.5 pixel (GATE-SENS-06) G1 · all tiers A global-shutter build shows none
KA-480 §20.7, §20.20 Lidar motion distortion: 10 Hz spin on a robot yawing at 1 rad/s, wall at 5 m The robot turns 0.1 rad during a scan; the wall is displaced by 0.5 m across the scan seam within 1 cm (GATE-SENS-06) G1 · all tiers none stated
KA-481 §20.4.4, §20.20 Camera exposure across an impact No blur beyond the segmented pose history; interpolation never crosses a boundary at which an impact reset a velocity to set (GATE-SENS-06: no fabricated blur) G1 · all tiers A linear pose blend across the reset
KA-482 §20.6, §20.20 One-bounce mirror return The reported point is the reflection of the true hit point through the mirror plane (PO-SENS-04): a target at (1, 2, 0) and a mirror plane x = 3 give a phantom at (5, 2, 0) to set (GATE-SENS-07) G1 · all tiers none stated
KA-483 §20.6, §20.20 Glass pane R(θ) = r₀ + (1 − r₀)·(1 − cos θ)⁵; a direct return only within the card's acceptance angle of normal incidence; otherwise the surface behind, or the mirror direction, whichever return is stronger to set (GATE-SENS-07) G1 · all tiers Treating glass as diffuse
KA-484 §20.6, §20.20 Steam slab in front of an active sensor Power fraction exp(−2σ·ℓ); with σ = 2 m⁻¹ and a 5% threshold every return is lost behind more than ln(20)/4 = 0.75 m to set (GATE-SENS-07) G1 · all tiers One-way attenuation exp(−σ·ℓ) for an active sensor
KA-485 §20.6, §20.21 Pattern-projecting depth camera dropout A pixel is valid only if the projector ray and the camera ray reach the same diffuse point with contrast above ambient; it drops out on glass, mirrors and polished metal, absorbers, floors lit above the pattern's irradiance, beyond range, at grazing incidence and in the projector shadow, each with its own mask reason; a masked value never appears as a number (INV-SENS-05) exact (mask reasons) (GATE-SENS-07) G1 · all tiers none stated
KA-486 §20.6, §20.20 ≡ KA-113 Majority vote over repeated reads, each right three times in four Independent errors: 27/32 with three reads, 459/512 with five, 3,807/4,096 (93%) with seven. A common fault (the same pane, the same glare): 3/4 after any number; repeated reads through one pane fail together (ADR-SENS-08) exact G1 · host Independent coins through one pane
KA-487 §20.11, §20.20 Corridor Gramian: walls at y = ±a, one beam measuring a − y with variance s², N samples at rest H = (0, −1); W = (N/s²)·diag(0, 1); null vector (1, 0). A second beam at 45° reads (a − y)·√2 and adds nothing along x; a beam reaching an end wall at x = b reads b − x and makes W full rank Linearized and empirical forms agree within 5% in the non-zero eigenvalues (GATE-SENS-08) G1 · all tiers none stated
KA-488 §20.11, §20.20 Gauge of IMU, encoders, contact switches and gravity The unobservable subspace has dimension four: global position and yaw (PO-SENS-09), found analytically and by finite perturbation exact (dimension); 5% agreement of the two forms (GATE-SENS-08) G1 · all tiers none stated (a smaller null space is a defect in a sensor model)
KA-489 §20.12, §20.20 T-junction alias: charging plate at the end of the left branch in world L and of the right branch in world R, branches 10 m, plate detected only by contact or within 0.5 m, battery 12 m of travel Transcripts are identical up to the turn; a wrong turn is discovered after 9.5 m and costs 9.5 + 9.5 + 10 = 29 m; the witness is accepted; no causal policy succeeds in both worlds and with equal priors success is at most 1/2 exact (GATE-SENS-09) G1 · referee With a 29 m budget the witness is rejected
KA-490 §20.12, §20.19 Alias theorem (PO-SENS-07) Identical delivered transcripts and disjoint success sets exclude every causal policy; with equal priors and observation laws P and Q the probability of choosing correctly is at most (1 + TV(P, Q))/2 exact (theorem card) G0 · host none stated
KA-491 §20.12, §20.20 Sequential reads (each right with probability 3/4) under a deadline No read: 1/2. A rule that stops when one class leads by two reads is right 90% of the time with 3.2 reads on average; it is still undecided after six reads with probability 27/512; forcing a guess then yields 225/256, below 90% exact (exhaustive enumeration) G1 · host none stated
KA-492 §20.12, §20.21 Planted alias suite of 64 layouts Every planted alias is found and no witness is reported on the rest; the T-junction and late-packet docking witnesses pass the checker exact (GATE-SENS-09; one false witness trips KILL-ALIAS) G1 · referee none stated
KA-493 §20.13, §20.20 Quadruped symmetric fore-aft and left-right with a forward depth camera on the sagittal plane Γ_mech = C₂ × C₂ of order four; Γ_obs has order two (the left-right reflection survives if rows are read out top to bottom; the fore-aft reflection and the half-turn do not); augmentation doubles the data exact on every template (GATE-SENS-10) G1 · host The fore-aft reflection fails the equivariance test
KA-494 §20.13, §20.20 Spinning lidar on the plane of symmetry under reflection Broken with per-beam instants, at first order in the product of body rate and scan time; restored only if the scan is treated as instantaneous, and the report says which was assumed exact (membership) (GATE-SENS-10) G1 · host none stated
KA-495 §20.14, §20.20 Pose graph with scalar offsets, unit weights and one edge biased by β Three sensors, three edges: residual β/3 on every edge. Four sensors, six edges: β/2 on the bad edge, β/4 on the four edges that share a node with it, zero on the opposite edge to set (GATE-SENS-11 requires the patterns) G1 · host The Euclidean projector with anisotropic weights
KA-496 §20.14, §20.20 Pose graph, bumped sensor: four-sensor rig with all six pairwise measurements, planted lidar bump of 2° and 15 mm Recovered and attributed to the lidar node with r_⊥ at noise level; on a tree r_⊥ is identically zero (PO-SENS-08) within 0.1° and 1 mm, right node in 100 of 100 seeds (TARGET, GATE-SENS-11) G1 · referee A tree refuses localization (FROB-REF-446)
KA-497 §20.15, §20.20 Causal-policy test on the reference actor and every baseline controller Wherever the delivered-observation digests of a world and its twin agree, the command digests agree exact (GATE-SENS-12) G3 · all tiers Each of five planted leaks fails: a privileged state channel wired into the actor; a reset mask that lets history cross an episode boundary; a sensor read at its current value instead of its delivered packet; a curriculum parameter passed as an observation; a noise stream keyed so that a hidden parameter shifts the draws of a visible sensor
KA-498 §20.16, §20.20 Docking boundary, packet on time: three one-second ticks, x₀ = v₀ = 0, acceleration g·u_k, hidden gain g ∈ {1, 2}, abs(u_k) ≤ U with U in [½, 1], mission (x₃, v₃) = (1, 0), a reading of v₁ with error in [−ε, +ε] With p = u₀: u₁ = 1/g − 2p and u₂ = p − 1/g (from v₃ = g·(p + u₁ + u₂) and x₃ = g·(2p + u₁)); the limits leave 1 − U ≤ p ≤ (U + ½)/2; the readings [p − ε, p + ε] and [2p − ε, 2p + ε] must be disjoint, ε < p/2; at the largest p the boundary is ε < (U + ½)/4, equality excluded (PO-SENS-06) exact (rational arithmetic) G1 · host Unguarded single precision misclassifies near the boundary
KA-499 §20.16 Docking, worked commands at U = ¾ With p = ¼ the commands are (¼, ½, −¾) for g = 1 and (¼, 0, −¼) for g = 2, both reaching (1, 0), tolerable error below 1/8; with p = 5/8 it is below 5/16 exact G1 · host none stated
KA-500 §20.16 Docking at equality, U = ¾ and ε = 5/16 Both worlds can report 15/16 while requiring u₁ = −¼ and u₁ = −¾; the strict predicate fails exact G1 · host none stated in §20.16 (§24.16 names the non-strict comparator, which admits the equality case)
KA-501 §20.16, §20.20 Docking grid, U = ½ + i/32 for i = 0…16 and ε = j/64 for j = 0…32 A cell is admitted exactly when 2j < 32 + i: 344 of 561 admitted, 217 excluded, nine exactly on the boundary (the even i) exact; identical bytes on batch-cpu, CUDA and Metal (GATE-SENS-13) G1 · all tiers Unguarded single precision misclassifies near the boundary
KA-502 §20.16, §20.20 Docking, packet arrives after the third command is committed A causal controller issues one command vector in both worlds; the final position g·(2p + u₁) cannot equal 1 for both gains; all 561 cells are excluded exact G1 · all tiers none stated
KA-503 §20.16, §20.20 ≡ KA-104 Docking with a third admitted gain 33/32, at U = ¾ and ε = 1/64 The reading (65/64)·p is possible for g = 1 and for g = 33/32 under every first command, so both worlds receive the same remaining commands; final positions c and 33c/32; the smallest achievable worst error is 1/65 m at c = 64/65; every cell admitted under the two-gain mission is reversed exact (GATE-SENS-13) G1 · host none stated
KA-504 §20.16, §20.21 Docking boundary screen of 65,536 cases in three arithmetics The exact integer kernel gives no error and identical bytes on every device; a guard band with exact fallback gives no final error exact, zero final errors (GATE-SENS-13) G1 · all tiers Unguarded single precision: 452 false admissions and 23,438 false exclusions
KA-505 §20.17, §20.20 Noninterference, presentation: turn the viewer, stills or the telemetry level on or off Every physics digest and every delivered observation unchanged (INV-SENS-01) exact on the standard battery (GATE-SENS-03) G3 · all tiers none stated for this property
KA-506 §20.17, §20.20 Noninterference, truth: change simulator truth behind a sensor that is disconnected, masked or not yet delivered The actor's inputs and commands unchanged exact (GATE-SENS-03) G3 · all tiers none stated for this property (the planted leaks of §20.15 apply)
KA-507 §20.17, §20.20 Noninterference, sensor set: add, remove or reorder sensors that no controller consumes The outputs of every other sensor, and physics, unchanged (INV-SENS-06) exact (GATE-SENS-03) G3 · all tiers A sensor added to a draw-order generator
KA-508 §20.17, §20.20 Noninterference, batch: the same world address alone, in a batch of 8,192, and beside worlds with different sensor suites That world's delivered observations unchanged (INV-SENS-09) exact (GATE-SENS-03) G5 · all tiers none stated for this property
KA-509 §20.17, §20.20 Noninterference, optics against contact: change an optical card, or an interface card Physics digests, or ray outputs, respectively unchanged exact (GATE-SENS-03) G3 · all tiers none stated for this property (§19.5.4: a build that derives friction from r0)
KA-510 §20.5, §20.8 Joint encoder over a prescribed rotation The tick count equals the count implied by the card's resolution, with index offset and wraparound exact (GATE-SENS-14) G1 · all tiers none stated
KA-511 §20.8 Encoder behind a transmission with backlash: reversal test Load-side motion inside the dead zone of the transmission card is hidden to set (GATE-SENS-14) G1 · all tiers none stated
KA-512 §20.8 IMU bias random walk The Allan-deviation slope of the simulated stream matches the declared correlated-noise process to set (GATE-SENS-14) G1 · all tiers none stated
KA-513 §20.8 IMU saturation: a drop test that exceeds the card range The reading clips at the card range and carries the flag saturated exact (GATE-SENS-14) G1 · all tiers none stated
KA-514 §20.5, §20.8 Current, temperature and voltage readout The step response of a resistor-inductor circuit and a thermal cool-down (§15), through a first-order readout with limits to set (GATE-SENS-14) G1 · all tiers none stated
KA-515 §20.8 Contact switch under a slow load ramp Switches at the threshold pair, with hysteresis to set (GATE-SENS-14) G1 · all tiers none stated
KA-516 §20.5 Force-torque sensor: dead weight and a known offset torque The reading is the wrench moved to the sensor frame and reference point by the coadjoint action of §11 to set (GATE-SENS-14) G1 · all tiers none stated
KA-517 §20.5 Wheel odometry on a circular arc on a dry floor Encoder displacement equals travel while the wheel rolls to set (GATE-SENS-14) G1 · all tiers none stated
KA-518 §20.5, §20.8 Wheel odometry with a deliberate slip on a film patch The odometry error equals the slip distance in the contact telemetry to set (GATE-SENS-14) G1 · all tiers none stated
KA-519 §20.8 Depth near-plane blind zone: a plane swept through the near limit Samples inside the blind zone are masked by the range mask exact (masks) (GATE-SENS-14) G1 · all tiers none stated
KA-520 §20.8 Lidar range quantization and blind zone against an analytic sphere Ranges equal the analytic sphere distances quantized by the card fields to set (GATE-SENS-14) G1 · all tiers none stated
KA-521 §20.8, §20.19 Link model: latency, jitter, loss, duplication, reordering A packet is never delivered before its latency (INV-SENS-02) exact (GATE-SENS-14) G1 · all tiers none stated
KA-522 §20.8 Stuck value or dead sensor injected as a fault The causal-policy harness sees the mask exact (GATE-SENS-14) G4 · all tiers none stated
KA-523 §20.5 Tactile array F The resultant load equals the sum over taxels to set G1 · all tiers none stated
KA-524 §20.21 Sensor outputs across backends Sensor outputs, masks and delivered-observation digests agree across backends inside their determinism class the determinism class (GATE-SENS-02) G5 · all tiers none stated

M.20 §21 Spark: GPU backends and the kernel toolchain

KA Where stated The case The truth Tolerance Tier Negative control
KA-525 §21.23, §21.24 One dialect source for K-cay-step compiled for batch-cpu, CUDA and Metal Matches the Rust reference inside its determinism class on all three backends the determinism class: bit-equal for D1; at most 4 ulp per kernel output for D3 (GATE-SPARK-00, GATE-SPARK-02) G1 · cuda, metal A prelude with contraction switched on
KA-526 §21.23 Contraction detector in f32: (1 + 2⁻¹²)·(1 + 2⁻¹²) − (1 + 2⁻¹¹) 0 without contraction; 2⁻²⁴ with exact (GATE-SPARK-01) G0 · cuda, metal The fused form itself
KA-527 §21.14, §21.23 Double-float canary, sum (K-canary) The error-free sum of 1 and 2⁻³⁰ returns the pair (1, 2⁻³⁰); a compiler that simplifies the error term algebraically returns (1, 0); a failed canary refuses the device for double-float kernels (FROB-REF-609) exact G0 · cuda, metal A build with fast math on
KA-528 §21.14, §21.23 Double-float canary, product by the split product (splitter 4097 = 2¹² + 1) The error-free product of 1 + 2⁻¹² with itself returns (1 + 2⁻¹¹, 2⁻²⁴), since the exact product 1 + 2⁻¹¹ + 2⁻²⁴ is a tie that rounds to even exact G0 · cuda, metal A build with fast math on
KA-529 §21.8, §21.23 Strict predicate 2²⁴ < 2²⁴ + 1 (16,777,216 < 16,777,217) True in the exact and guarded kernels exact; identical bytes on batch-cpu, both RTX 4090 and Metal (GATE-SPARK-08) G0 · all tiers The bare f32 kernel answers false, since 16,777,217 rounds to 16,777,216
KA-530 §21.8, §21.23 Boundary corpus of 2 × 65,536 rows with exact ties Exact kernel: zero errors, identical bytes on every backend. Guarded kernel: zero errors after fallback, with its fallback fraction reported (in the recorded pilot the guard deferred whenever the absolute residual was at most 2⁻²¹, decided none of the dense grid on the device and 58,254 of 65,536 rows of the wider grid) exact (GATE-SPARK-08) G0 · all tiers The bare f32 kernel must mislabel at least one row (the pilot: 452 false inclusions and 23,438 false exclusions)
KA-531 §21.8, §21.22 Guard of a guarded predicate (PO-SPARK-02) If abs(r̂) > ε the sign of the computed residual r̂ is the sign of the exact residual r; for the pilot's conversion and addition sequence the rounding error is bounded by 5·2⁻²⁵, below the deferral threshold 2⁻²¹ exact (certified bound; exhaustive check on the boundary corpus) G0 · host none stated
KA-532 §21.5, §21.23 Stride conventions on a 2 × 2 contiguous f32 view: byte strides (8, 4) against element strides (2, 1) Index [1, 1] reads element 3; a view crossing the boundary carries its stride unit and signedness, is materialized with the copy charged to the receipt, or is refused under a zero-copy contract (FROB-REF-617) exact G1 · host A verbatim stride copy onto a 16-element buffer reads element 8 + 4 = 12, in bounds
KA-533 §21.6, §35.7 Mask with an infinity in the unselected arm select(pred, a, b) returns the selected arm unchanged exact G0 · all tiers The arithmetic blend m·a + (1 − m)·b returns NaN, since 0·∞ is NaN
KA-534 §21.12, §21.23 Strict placement with one device kernel withheld, for every stage Refusal by the planner (FROB-REF-604) before any world is stepped; zero episodes; receipt counters for transfers and synchronizations match an instrumented shim exact for the refusal; within one count for the counters (GATE-SPARK-09) G1 · cuda, metal The same request under mixed-allowed must show actual ≠ requested
KA-535 §21.8, §21.23 Run digest under slot permutation Unchanged: the run digest is the wrapping sum of per-world digests keyed by address exact G5 · all tiers A digest that chains in slot order
KA-536 §21.10, §21.23 Binary kernel cache A one-byte change of source, options, compiler or driver identity is a miss; a warm start loads every kernel with zero compiler invocations exact (GATE-SPARK-11) G1 · cuda, metal A corrupted entry must be rejected by digest
KA-537 §21.9, §21.23 Commit fence under injected command-buffer faults (rule R2) Final digests equal those of the unfaulted run; at most four attempts with growing waits, then FROB-REF-607; every retry counted in the receipt exact under 10³ injected faults (GATE-SPARK-12) G4 · metal With the fence disabled the mismatch must be detected
KA-538 §21.18, §21.23 Specialized kernel against its generic kernel on 10⁶ states Bit-identical (INV-SPARK-09) exact (GATE-SPARK-14) G5 · cuda, metal A reassociated variant must be refused (FROB-REF-613)
KA-539 §21.17, §21.23 Scene regenerated on the other machine from its seed Same SceneId exact G5 · host A generator with one changed constant
KA-540 §21.24 IEEE probe per device family f32 square root and reciprocal agree bit for bit with the correctly rounded reference over all 2³² inputs; +, −, ×, ÷ over 10⁹ sampled operand pairs including subnormal and overflow edges; subnormal and NaN behaviour recorded; the outcome sets the device's best attainable determinism class exact (GATE-SPARK-01) G0 · cuda, metal none stated
KA-541 §21.24 Precision battery over 10⁶ steps at distances up to 1 km from the origin Group-membership error within 4 ulp; closure and contact violations inside their envelopes; energy-ledger residual under 10⁻⁴ relative as stated (GATE-SPARK-05) G1 · cuda, metal none stated
KA-542 §21.24 Cancellation and fault injection on a device Every injected fault yields its typed refusal; no leaked device memory after 10³ cancel cycles; the drain report is executor-minted exact (GATE-SPARK-06) G4 · cuda, metal none stated
KA-543 §21.10, §21.22 Device allocation after environment creation Allocated device bytes are flat over 10⁶ steps (INV-SPARK-03) exact (GATE-SPARK-11) G1 · cuda, metal none stated
KA-544 §21.24 Launch graphs, pools and snapshot reads Zero graph captures after warm-up; zero synchronizations inside a chunk; no pool memory leaked after 10³ cancel cycles; 10⁵ snapshot reads each match the digest emitted for their epoch exact (GATE-SPARK-12) G4 · cuda, metal none stated
KA-545 §21.11, §21.24 Admission of a model variant into a free slot; 256 topology variants of one bucket No other world's digest changes; one captured graph with zero compiles after warm-up exact (GATE-SPARK-10) G5 · cuda, metal none stated
KA-546 §21.16, §21.24 Hardware fingerprint of both machines Reproduces the starting values: 36 CPU cores, an 80-core GPU and 256 GB of unified memory; a Metal working-set limit of about 222.7 GiB and a largest single buffer of about 167.0 GiB; two RTX 4090 of 24 GB with no link. Every field measured or unavailable with a reason Two runs agree on every discrete field and within 5% on every rate (GATE-SPARK-07) G1 · cuda, metal none stated
KA-547 §21.11 Padding overhead Ω_p = L_max^p / E[L^p], with 1/r ≤ Ω_p ≤ r⁻ᵖ for r the mean size over the maximum Degrees of freedom 18 and 35 mixed 90 to 10 give 1.8, 3.0 and 4.5 for p = 1, 2, 3; the worst member of the 48 bucket (33) gives Ω₁ ≤ 1.45 and Ω₃ ≤ 3.1 to set G1 · host none stated
KA-548 §21.11 Break-even for an extra bucket: splitting N worlds off pays when N·(1 − 1/Ω)·t > L With about 60 launches of 5 to 10 µs each, t = 0.5 µs and Ω = 1.3, the break-even is 2,600 to 5,200 worlds (inputs are a HYPOTHESIS; the launch cost is measured by the fingerprint) to set G1 · host none stated
KA-549 §21.18 Specialization ceiling from a step trace Of 262 ns per world-step the specializable stages sum to 53 ns (20%): an infinitely fast recursion gives 262/209 = 1.25, a recursion twice as fast 1.11; a share of 16% gives 1.19; a ceiling of 1.5 needs a share of one third to set G1 · host none stated
KA-550 §21.17 Fleet ceiling Adding the Mac's GPU to training adds at most its share of the pair of cards: 0.125 at 25% of one RTX 4090, 0.30 at 60%; removing a fraction g of the work on the critical machine speeds a campaign by at most 1/(1 − g), so 1.5 needs g ≥ 1/3 exact G1 · host none stated
KA-551 §21.20 Dense brick directory size with 8³-voxel bricks and 4-byte slots 63 × 63 × 19 = 75,411 slots, 0.3 MB, for a 10 × 10 × 3 m interior at 2 cm; 587,500 slots, 2.3 MB, for a 60 × 40 × 8 m warehouse at 4 cm; 18.8 MB for that warehouse at 2 cm; under 1.5% of the scene it indexes exact G1 · host none stated
KA-552 §21.20 Cholesky operation count n³/3 1,944 operations at n = 18 and 14,292 at n = 35; a refinement step costs about 3n² against n³/3, a ratio of 9k/n for k steps: 2.3 at n = 27 and k = 7, 1.5 at n = 35 and k = 6 exact G1 · host none stated

M.21 §22 Reflex: estimation, control, gaits, skills, shields

KA Where stated The case The truth Tolerance Tier Negative control
KA-553 §22.3, §22.16 Observability of the invariant filter on the simulated IMU and leg odometry The unobservable subspace has dimension four (PO-REFLEX-01) exact (rank) G1 · referee A filter linearized at a moving estimate in the conventional way gains a spurious yaw direction; the rank test must see it
KA-554 §22.3, §22.16 Gauge scoring: an estimate of 2 m for a true motion of 1 m, scored after one translation and one yaw alignment and no scale The score is 1 m exact G1 · host Scale-fitted scoring reports zero residual after a fitted factor of ½ and is refused (FROB-REF-464)
KA-555 §22.3 (GATE-REFLEX-03) Filter consistency on a flat trot Normalized innovations inside χ² bounds; position drift under 2% of distance, scored by the gauge rule 2% of distance (GATE-REFLEX-03) G1 · referee A planted bias must raise the comparator's overconfident flag
KA-556 §22.5, §22.16 Friction certificate: a 50 N body pushed with 30 N through one contact with μ = 0.5; unknown x = (fₙ, fₜ), task x = (50, 30) y = (0.5, −1) lies in the dual cone {(a, c): a ≥ μ·abs(c)} and yᵀb = 25 − 30 = −5 N < 0, so the program is infeasible, class Certified exact (rational re-check, PO-REFLEX-03) G1 · host A certificate nudged outside the dual cone fails the exact check
KA-557 §22.7, §22.16 Baseline plus residual with a zero residual Digests equal the baseline's exact (digest) G5 · referee, strict A residual with a nonzero bias changes the digest
KA-558 §22.8, §22.16 Sampling-controller cost rows, steps per tick N_s·H·N_it 2,048·16·2 = 65,536; 2,048·25·4 = 204,800; 30·450·3 = 40,500 exact G1 · host A planted request to use the sampling controller as an acceptance evaluator is refused
KA-559 §22.8, §22.16 Episodes needed to bound a failure rate at 1% with zero failures at 95% confidence ⌈ln 0.05 / ln 0.99⌉ = 299 exact G1 · host none stated
KA-560 §22.9, §22.16 Rimless wheel on a slope γ with spoke half-angle α; c = cos 2α, b = (4g/l)·sin α·sin γ Fixed point ω*² = c²·b/(1 − c²); multiplier c² 10⁻⁶ (GATE-GAIT-01) G1 · referee An uphill slope (b < 0) has no fixed point
KA-561 §22.9 (GATE-GAIT-01) Compass-gait Floquet multipliers Agreement with an independent high-precision computation 10⁻⁶ (GATE-GAIT-01) G2 · referee none stated
KA-562 §22.9.2, §22.16 Planted transverse instability: ẋ = −x, ẏ = +y with symmetry y ↦ −y, period T On Fix(K) = {y = 0} the multiplier is e^(−T); the full-space multiplier in the antisymmetric block is e^(+T) > 1 to set G1 · host The restricted computation says stable and must be marked incomplete
KA-563 §22.9, §22.16 Bar of mass m on two supports arriving at speed v, coupling β; uniform bar of half-length l on supports at ±l/3 has β = 1/3 Coupled solve: impulses m·v/2 at each support, rest. One support first: first impulse m·v/(1 + β); the first end leaves at 2β·(1 − β)·v/(1 + β)² = v/4 for β = 1/3 and 1/16 of the kinetic energy survives. For β ≥ 1 every ordering gives rest. Off-diagonal term J₁·M⁻¹·J₂ᵀ = (1 − β)/m to set G1 · referee, strict A solver that forces an order reports rocking for the coupled case
KA-564 §22.9 (GATE-GAIT-02) Orbit gradients on a 100-case suite (80 regular, 20 grazing and fold controls) Cosine against central differences at least 0.95 in at least 72 of 80 regular cases; all 20 controls labeled or refused; no case refused for simultaneity alone as stated (GATE-GAIT-02) G1 · referee The grazing and fold controls are the planted cases
KA-565 §22.10, §22.16 Two-link arm witness: links 0.4 m and 0.3 m, angles 0 and π/2; tool point (0.4, 0.3) m; J = [[−0.3, −0.3], [0.4, 0.0]] m/rad; actuator limit 2.5 N·m τ = JᵀF = (−0.3·F_x + 0.4·F_y, −0.3·F_x); a tool force (10, 0) N needs (−3, −3) N·m; joint 2 gives abs(F_x) ≤ 2.5/0.3 = 25/3 N; witness direction c = (1, 0), support value 25/3 N against a requirement of 10 N exact (rational) G1 · host The lower rows of a space-frame screw Jacobian give a different bound
KA-566 §22.10, §22.16 Skill refinement: a target whose successors are {stable, fall} against an abstract transition whose only successor is stable Refused (FROB-REF-444) with the uncovered successor named exact (verdict) G1 · host Selecting the stable branch is the mutation that must be refused
KA-567 §22.10 (GATE-REFLEX-08) Skill exact layer on the hand fixtures 4 of 4 infeasible bodies refused with certificates that check exactly; feasible witnesses replay exact G1 · host, auditor none stated
KA-568 §22.11, §22.16 Energy drop-stop card: cart of 8 kg effective mass at 0.4 m/s; drive 20 W for a 25 ms cutoff delay; slope at most 8% over a 40 mm stroke; series spring 0.10 J; absorber 50 N over 40 mm T_ub = ½·8·0.4² = 0.64 J; drive 0.50 J; gravity 8·9.81·0.040·0.08 = 0.25 J; total 1.49 J ≤ W_abs = 2.00 J; longest cutoff delay (2.00 − 0.99)/20 = 50.5 ms, or 45.5 ms with a further 0.10 J of reserve exact to the printed digits G1 · host, auditor A payload-only budget omits 50 kg of reflected mass; a budget with a planted unlisted spring is refused
KA-569 §22.11 Reflected rotor mass: rotor inertia 5 × 10⁻⁵ kg·m², reduction 50:1, wheel radius 0.05 m Effective mass 50²·(5 × 10⁻⁵)/0.05² = 50 kg exact G1 · host none stated
KA-570 §22.11 (GATE-SHIELD-01) Energy tier on the referee with μ in [0, 5], restitution in [0, 1] and every contact law No exceedance over 10⁴ randomized contact sequences exact (count zero) G1 · referee A budget with a planted unlisted spring; a payload-only budget
KA-571 §22.12, §22.16 Shield projection: R = I, u_π = (1, 0), box [0, 1]², row u₁ + u₂ ≥ 1.5 Breakpoint solution λ = 0.5, u = (1, 0.5) exact G1 · host The unboxed closed form gives (1.25, 0.25), outside the box; clipping it gives (1, 0.25), which violates the row
KA-572 §22.12, §22.16 Damping-injection backup, gain inside the sampled bound 2·M̄ − h·K_d ⪰ 0 Stored energy is non-increasing in the ledger at every tick ledger residual bound (§29) G1 · referee A negative damping gain breaks monotonicity and is caught; a gain above the bound adds energy and is caught (300 N·s/m held 10 ms on a free 1 kg slider: +1.5 J)
KA-573 §22.12 (GATE-SHIELD-04) Measured-margin shield on 10⁴ held-out episodes of the calibrated family Empirical coverage at least 1 − α − 0.01 as stated (GATE-SHIELD-04) G1 · lockstep A planted change of policy trips FROB-REF-457; a planted drift trips the alarm
KA-574 §22.13, §22.16 Two latches The in-law controller succeeds; the tied deterministic one fails exact (verdict) G1 · referee The tied controller is the control
KA-575 §22.13, §22.16 Planted asymmetries: side slope, off-centre payload, front-only sensor, one-sided patch Exactly the expected generators are removed: a side slope removes the left-right mirror; a front lidar leaves C₂ exact (group) G1 · host Tying under Γ_mech loses return on the one-sided patch

M.22 §23 Cortex: the gym, learning, family policies, inheritance

KA Where stated The case The truth Tolerance Tier Negative control
KA-576 §23.3, §23.21 Bootstrap target: a true 8 s deadline with terminal reward 0; an external cut at the same instant on a continuing task with V = 10 and γ = 0.99 0 for the deadline; 9.9 for the cut; termination wins when both flags are set exact G1 · host A single done flag gives 0 for both
KA-577 §23.3, §23.21 Final observation under explicit reset and under masked automatic reset The same values in explicit mode and in final_obs exact G1 · all tiers A mode that returns only post-reset observations fails the truncation fixture
KA-578 §23.3, §23.21 Reward rate: a rate term over a 10 s episode at 50 Hz and at 100 Hz The same total at both rates to set G3 · all tiers A penalty of 1 per control step totals 500 and 1,000
KA-579 §23.3, §23.21 Physical discount γ(Δt) = exp(−β·Δt) with β = 0.5025 /s γ = 0.99 at 20 ms and 0.99499 at 10 ms; a constant reward rate r is worth r·Δt/(1 − e^(−β·Δt)): 2.000·r at 20 ms and 1.995·r at 10 ms, near r/β = 1.990·r to the printed digits G1 · host One per-step γ = 0.99 at both rates gives 2.0·r and 1.0·r
KA-580 §23.4, §23.21 Stride conversion: a contiguous 2 × 2 f32 view has strides (8, 4) in signed bytes and (2, 1) in unsigned elements; a view with byte origin 4 and strides (8, −4) Index [1, 1] reads element 3; the negative-stride view indexes elements (1, 0, 3, 2) and is materialized or refused exact G1 · host A verbatim copy of the stride numbers into a view on a 16-element buffer reads element 12, in bounds
KA-581 §23.5, §23.21 Mixed-unit requirement: clearance 0.05 m with scale 0.10 m and thermal margin 12 °C with scale 10 °C Margins 0.5 and 1.2; the clearance binds in every unit system exact G1 · host The unscaled minimum is 0.05 in metres and 12 with the clearance written as 50 mm
KA-582 §23.6, §23.21 Action law (P-3): unit-variance Gaussians clipped at +1 with means 0 and 1 Endpoint ratio 0.5/0.158655 = 3.15149 for the clipped law; e^0.5 = 1.64872 for the latent law to the printed digits G1 · host A mixture of the two laws is refused (FROB-REF-527)
KA-583 §23.6, §23.21 Clipped surrogate (P-4) with ε = 0.2 and a negative advantage, finite differences in log σ at ratios 0.5, 1 and 2 0, −0.5 and −1 to set G1 · host The reversed branch gives −0.25, −0.5 and 0
KA-584 §23.6, §23.21 Critic gradient (P-5): critic output 2, stored value and return 0, loss c_V·(V − R)² Gradient into the value head 4·c_V exact G1 · host The stored-value form gives 0
KA-585 §23.6, §23.21 Packed episodes (P-6): two independently reset one-step episodes packed together, frozen policy Likelihood ratios 1 and 1 to set G1 · host Reading across the reset gives 1.582459
KA-586 §23.6 PPO rules P-2, P-8, P-9, P-10, P-11 Two collections from one snapshot are identical; with the clock, the value at the deadline equals the terminal reward; a planted Faulted world changes no gradient and appears in the failure count; the normalizer round-trips; the entropy of the clipped law at a bound matches a quadrature reference and differs from the Gaussian's exact for P-2, P-9, P-10; to set for P-8, P-11 G1 · host, lockstep Three planted defects that reproduce the reversed branch, the stored-value gradient and the packed-sequence read each fail the battery (GATE-CORTEX-07)
KA-587 §23.9, §23.21 Shard gradient: one sample with gradient 1 and three with gradient 0, on one device and on shards of sizes 1 and 3 0.25 exact G1 · host, cuda The mean of shard means gives 0.5
KA-588 §23.9, §23.21 Shard statistics: shards {0, 0} and {4} Global mean 4/3, variance 32/9 exact (rational) G1 · host, cuda Per-shard variance is 0
KA-589 §23.11, §23.21 Family break-even N > P/(s·(1 − f)) at P = 60 GPU-hours, f = 0.1, s = 410 s About 590 quadruped designs; about 70 to 130 humanoid designs at s = 0.5 to 1 GPU-hour; ceiling on the training phase 1/f arithmetic; inputs are FACT to re-read G1 · host none stated
KA-590 §23.16, §23.21 Training gate controls Zero-weight, random and shuffled-label policies fail the return threshold exact (verdict) G1 · lockstep An exported all-zero policy head passes a plumbing test and fails this one
KA-591 §23.16, §23.21 Box-cone exploit Flagged law-sensitive; the ranking is typed model-conditional; a genuine winner stays model-robust exact (label) G1 · lockstep, referee An honest policy on the circular cone is not flagged
KA-592 §23.16 (GATE-CORTEX-04) Exploitation detectors Each detector flags its planted exploit and passes an honest policy exact (verdict) G1 · lockstep The honest policy is the control
KA-593 §23.5 (GATE-CORTEX-10) Streaming past-time robustness against offline evaluation on 10⁴ random traces Equal exact G1 · host A future-time online reward is refused

M.23 §24 Arena: tasks, requirements, fixtures, metrics, qualification

KA Where stated The case The truth Tolerance Tier Negative control
KA-594 §24.5, §24.16 Normalization: clearance margin 0.02 m and thermal margin 3 K with scales 0.10 m and 10 K Margins 0.2 and 0.3 in either unit system; the clearance binds in metres and in millimetres exact G1 · host Composition of raw margins: the raw minimum is 0.02 in metres (clearance binds) and 3 with the clearance in millimetres (thermal binds)
KA-595 §24.5, §24.16 Joint stage accounting: 20 equally likely worlds, two stages each passing in 19 18 of 20 if the failing worlds differ, 19 of 20 if they coincide; never 0.95² = 0.9025 exact G1 · host Multiplying stage rates
KA-596 §24.5, §24.16 Online and offline agreement: a past-time signal sampled at the end of the trace Equal to the offline evaluation of the same formula exact G1 · host A monitor that pads a short window
KA-597 §24.5 (GATE-ARENA-03) The three requirement evaluators on 10⁶ random traces per operator, including multi-rate signals and windows with rounding Agreement bit for bit; every requirement-language refusal of §24.14 (FROB-REF-520, -535, -536, -523, -538, -525, -526, -539 and -528) is triggered by its planted task file exact G5 · host The planted task files
KA-598 §24.8, §24.16 Energy accounting: design A with one 10 J success and one 20 J failure; design B with two 12 J successes 10 J against 12 J conditional on completion; 30 J against 12 J per completion; both are published exact G1 · host Dropping failed attempts from the total
KA-599 §24.8, §24.16 Slip metric under duplication of a quadrature point with halved weights Unchanged 10⁻¹² relative in double precision (GATE-ARENA-06) G3 · referee A metric that sums unweighted point speeds
KA-600 §24.8 (GATE-ARENA-07) Scorecard accounting on 100 random batteries A planted infeasible scenario appears in its column and in the all-scenario denominator; columns sum to the battery size exact G1 · host A silently shortened battery must change identity
KA-601 §24.7 (GATE-ARENA-08) Settled-pose reset cache on all 64 states for each reference robot Penetration at most 0.5 mm; first impulse within 5% of static support as stated (GATE-ARENA-08) G1 · lockstep A design edit must invalidate the cache
KA-602 §24.10 Fixture 1, mass roll-up: design A (60 mm front wheels, 0.2 kg) and design B (75 mm, same density and width) Total mass 8.000 kg and 8.225 kg; front-wheel mass ratio 1.5625 (0.3125 kg each); spin-inertia ratio (75/60)⁴ = 625/256 (3.6 × 10⁻⁴ and 8.7890625 × 10⁻⁴ kg·m²); B pitches up by asin(15/320) = 2.69° exact to the printed digits G1 · host none stated
KA-603 §24.10 Fixture 1, tread force cap: two wheels at the current limit, 2·k_t·I_max/r with k_t = 0.2 N·m/A, I_max = 6 A 40 N for A, 32 N for B GATE-ARENA-04 G1 · referee none stated
KA-604 §24.10 Fixture 1, force slope: unsaturated flat rolling at settled current, 2·k_t·K_ω/r² per unit speed error 222.22 and 142.22 N/(m/s); a gain of 3.125 A·s/rad for B matches the slopes GATE-ARENA-04 G1 · referee none stated
KA-605 §24.10 Fixture 1, lip lever x = √(2rh − h²) for a sharp lip of h = 12 mm 36.000 mm at r = 60 mm; 40.694 mm at r = 75 mm exact to the printed digits G1 · host none stated
KA-606 §24.10 Fixture 1, front lift-off in the creep limit: driven axle at the lip, trailing axle free; friction demand μ ≥ tan θ with tan θ = x/(r − h); total drive torque F₀·x/(1 + x/L) μ ≥ 0.7500 for A and μ ≥ 0.6459 for B; with 2 mm fillets 0.7332 and 0.6351; torque for A at δ = 0: 1.270 N·m of 2.4 N·m available the outcome flips between friction grid points of spacing 0.01 that bracket the threshold, excluding points within 0.005 on the referee and 0.01 on the fast tiers (TARGET) G1 · referee, lockstep A run exactly at the threshold must carry the boundary flag
KA-607 §24.10 Fixture 1, rear pull-over in the creep limit: free axle at the lip, driven axle on the floor; V = W·d/(L − x − h·tan θ) For A, V/W = 32/55 − δ and the friction demand is ¾·(32/55 − δ)/(23/55 + δ): 24/23 = 1.043 at δ = 0, 0.887 at δ = +0.04 m. For B at δ = 0 the demand of 34.2 N exceeds the 32 N force cap GATE-ARENA-04 G1 · referee, lockstep A creep rig with the rear lip removed
KA-608 §24.10 Fixture 1, creep-feasible set for A μ ≥ ¾·(32/55 − δ)/(23/55 + δ) lies inside the admitted friction range only for δ ≥ 23.0 mm: 1.13% of the development distribution to the printed digits G1 · host none stated
KA-609 §24.10 Fixture 1, energy: raising the front axle of A by h takes F₀·h; kinetic energy at 0.30 m/s is ½·m·v² plus wheel spin 0.471 J against 0.360 J + 0.018 J: momentum alone does not carry one axle over to the printed digits G1 · host, referee none stated
KA-610 §24.10, §24.16 Fixture 1, wheel-loop stability: the 75 mm wheel with 0.0002 kg·m² added rotor inertia (0.00107890625 kg·m² in all), slipping against a constant torque, rate sampled and current target held for 10 ms; spectral radius of the one-tick map 1.4820 with the feedforward term R·i_ref; 0.9207 with R·i; an instantaneous-current approximation gives 2.6917 for both (2.7075 if the shaft damping is left out) to the printed digits G1 · host, referee At a 0.5 ms step, explicit Euler that updates the current before the wheel speed gives 1.854 and 1.497, turning the stable case unstable
KA-611 §24.10 Fixture 1, power ledger: a blocked winding at 3 A and 3 V; a drive at 50 rad/s and −2 A 9 W dissipated, 0.375 A from the 24 V bus; terminal voltage 8 V, 16 W returned, 20 W from the shaft, 4 W in copper exact G1 · host, referee none stated
KA-612 §24.10, §24.16 Fixture 1, rule enumeration at n = 64, 86, 128, 256: count pairs (a, b) with a + b ≤ n classified as prefer B, B inferior, practical tie, inconclusive 2,145: 521, 521, 0, 1,103. 3,828: 1,031, 1,031, 1, 1,765. 8,385: 2,517, 2,517, 4, 3,347. 33,153: 11,384, 11,384, 39, 10,346. Perfect concordance at n = 64 gives [−0.0662, +0.0662]; a tie is first reachable at n = 86 and only for (0, 0), with chance 0.9⁸⁶ = 0.0116% at 5% discordance each way; with no A-only pair a preference needs 15 B-only pairs of 64, and 17, 19, 21, 23 with one to four A-only pairs exact (GATE-ARENA-05) G1 · host A request for a tie verdict at n = 64 is refused (FROB-REF-532)
KA-613 §24.10 Fixture 1, power of the rule: P(prefer B) at discordance (0.17, 0), (0.25, 0.02), (0.40, 0.02); P(tie) at (0.02, 0.02) and (0, 0) n = 64: 0.117, 0.406, 0.962, 0, 0. n = 128: 0.775, 0.906, above 0.999, 0.072, 1. n = 256: 0.998, above 0.999, above 0.999, 0.427, 1 exact to the printed digits (GATE-ARENA-05) G1 · host none stated
KA-614 §24.10 Standalone equivalence test: zero discordant pairs in 64 Exact one-sided 95% bound 1 − 0.05^(1/64) = 0.0457 exact to the printed digits G1 · host none stated
KA-615 §24.10, §24.16 Boundary comparator on the docking requirement at U = 3/4, ε = 5/16 The strict requirement fails; the 65,536-case screen has no final error with the guard exact G1 · host, cuda, metal A non-strict comparator admits the equality case; unguarded single-precision comparison misclassifies the screen
KA-616 §24.11, §24.16 ≡ KA-413 Fixture 2, limiting model on the plate-drag rig: capacity c(z, w) = 0.525 + 0.55·clip(z/w, −½, ½); yaw moment 0.275·N·(w/4 − z²/w) z = 0: 0.525 and 0.525; 2.75 mm and 4.81 mm per newton. z = +12 mm: 0.690 (40 mm sole) and 0.619 (70 mm sole); 1.76 mm and 4.25 mm. z = −12 mm: 0.360 and 0.431; 1.76 mm and 4.25 mm 1% on the referee (GATE-ARENA-06) G1 · referee A pyramidal friction cone; a sole with one quadrature point
KA-617 §24.11 Fixture 2, reflected cases The mirrored robot on the mirrored course returns the mirrored result inside the determinism class (GATE-ARENA-06) G3 · referee, lockstep none stated
KA-618 §24.12, §24.16 Peeking: an exact one-sided sign test at nominal 5% on null pairs, looked at after every pair False-rejection chance 13/256 = 5.08% after 8 looks, 8.76% after 16, 12.9% after 32, 17.4% after 64 exact for 13/256; printed digits otherwise G0 · host The same data under a confidence sequence stay below their level
KA-619 §24.13, §24.16 Level series α_i = α/[i·(i + 1)] Exact partial sums α·m/(m + 1) for m up to 500; limit α (PO-ARENA-02) exact (rational) G0 · host, auditor A constant level per request
KA-620 §24.13 Independent retries at a constant 5% level Fourteen null submissions give a 51% chance of at least one false promotion to the printed digits G0 · host The same adversary against reused clusters at a constant level obtains a false promotion in more than 99% of campaigns (GATE-QUAL-01)
KA-621 §24.13 Cost of a retry relative to one test at α = 0.05 About 1.23, 2.57, 4.08 and 5.15 times the units at requests 1, 10, 100 and 500; for the rule of fixture 1 a tie is first reachable at n = 99, 178 and 328 for requests 1, 10 and 500; at 64 pairs request 1 has 478 preferring outcomes of 2,145 exact for the counts; printed digits for the ratios G1 · host none stated
KA-622 §24.13 (GATE-QUAL-01) 2,000 simulated campaigns on no-signal worlds at α = 0.05, each with 500 adaptive retries by a scripted adversary that sees every receipt and all discovery data A false promotion in at most 123 campaigns (an exact one-sided test of a rate at or below 0.05 rejects at the 1% level from 124); a planted true gain of the declared size is promoted within 10 requests in at least 80% of campaigns as stated (GATE-QUAL-01) G0 · daemon Reused clusters at a constant level: false promotion in more than 99% of campaigns
KA-623 §24.13 (GATE-QUAL-02, -03) Firewall and replay of a campaign 10⁴ fuzzed read attempts across every verb return no sealed field; frob-verify replays the levels, the commitments and, after close, the cluster derivation exact G4 · daemon, auditor A planted leak path is found by the audit; a reordered index, a changed request and a reused cluster are each rejected

M.24 §25 Augur: mission queries and inverse design

KA Where stated The case The truth Tolerance Tier Negative control
KA-624 §25.13, §25.26 Stance family: load 400 N, feet at (±1/3, ±b) m, 160 N ratings, centre-of-mass rectangle 150 mm × 75 mm Admitted iff b ≥ 3/14 m; forces (160, 130, 110, 0) N at the (60, 30) N·m vertex; 165 N needed at b = 1/5 m exact (rational) G1 · host, auditor The support-polygon-plus-total-capacity screen; a perturbed dual multiplier at b = 1/5 m
KA-625 §25.22, §25.26 Stance grid: u, v ∈ {2, 3, 4}, ratings ∈ {0, 80, 160, 240}⁴, four vertices and centroid 2,254 of 11,520 states feasible; 114 of 2,304 bodies cover the mission exact (count) G1 · host The weak screen falsely accepts 1,596 bodies
KA-626 §25.4.7, §25.26 Passive equal springs at b = 1/4 m (175, 115, 85, 25) N against the active allocation (155, 135, 105, 5) N and a 160 N rating exact G1 · host A certificate that omits the authority realizing the allocation admits the body
KA-627 §25.4.7, §25.26 ≡ KA-101 Design-dependent load: feet (±1 − e, ±1) m, 0.5 N ratings, 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 exact (rational) G1 · host A convexity claim outside an affine chart admits the midpoint
KA-628 §25.4.2, §25.26 Pusher y = max(0, g·u − d), g ∈ [1/2, 2], u ∈ [0, 2], d ∈ [0, 1/4], target y ∈ [3/4, 5/4] Per-build command set: all of [1/2, 2]; shared command set: empty exact G1 · host, auditor The prefix ∀g ∃u offered for the query ∃u ∀g is rejected (FROB-REF-826)
KA-629 §25.26 Pusher battery, ten frozen cases Twenty intervals, including shared-tight: shared set {1}; both-ends: [2/3, 5/4]; branch-crossing: shared [0, 3/8] exact (closed ends, singletons) G1 · host, auditor Six corrupted certificates, six of six rejected
KA-630 §25.26 Persistent gain: out-and-back with g ∈ {1, 2} Net 0 with a fixed gain; {−1, 0, 1} when the gain is resampled exact G1 · host Resampling a declared-persistent parameter (world.persistence)
KA-631 §25.3.5, §25.26 Twenty worlds, two stages each passing 19 of 20 18/20 if the failures differ, 19/20 if they coincide; 0.9025 only under independence exact G1 · host Multiplying stage rates
KA-632 §25.4.5, §25.26 ≡ KA-154 Mandatory work: lift 8 kg over 12 mm against a 0.90 J store 8·9.81·0.012 = 0.94176 J > 0.90 J, excluded; 0.05 J of approach energy removes the exclusion exact to the printed digits G1 · host, auditor An energy budget with an omitted source
KA-633 §25.10, §25.26 ≡ KA-113 Binary sensor correct with probability 3/4, majority vote 27/32, 459/512 and 3807/4096 for 3, 5 and 7 reads; 3/4 with a common fault bit; a sequential stop-at-gap-two rule reaches 9/10 in 16/5 expected reads; 225/256 when forced at six exact (rational) G1 · host Independent coins assumed for a shared error bit
KA-634 §25.11, §25.26 Passive jaw: k = 1 and 4 N/mm, force bands [2, 4] and [7, 9] N, stroke 6 mm Feasible iff max{2(c + 1), 7(c + 1/4)} ≤ x ≤ min{4(c + 1), 9(c + 1/4), 6}; K ≥ 28/17 N/mm; K ≥ 4/3 N/mm without the stroke cap exact (rational) G1 · host, auditor Dropping the stroke cap
KA-635 §25.15, §25.26 Docking, g ∈ {1, 2}, packet on time Command sequences (1/4, 1/2, −3/4) and (1/4, 0, −1/4) reach (1, 0) exact G1 · host, auditor The same bundle with quantifiers reordered
KA-636 §25.15, §25.26 Docking, packet late No common command vector; all 561 late-packet cells excluded exact G1 · host, auditor none stated
KA-637 §25.15, §25.26 Docking family Admitted iff ε < (U + 1/2)/4 on U ∈ [1/2, 1]; of 561 cells 344 admitted, 217 excluded, 9 on the boundary; at U = 3/4, ε = 5/16 both worlds can read 15/16 exact; strict comparator G1 · host, auditor A non-strict comparator admits the equality case
KA-638 §25.22, §25.26 Docking with a third gain 33/32 at ε = 1/64 No exact docking; best worst-case error 1/65 m exact (rational) G1 · host A certificate reused outside its declared hypothesis support
KA-639 §25.14, §25.26 Pad probe, four laws, 900 deterministic cases 29.66 N compact; 24.72 N and 41.15 N broad; three-law probe 675 of 675 in class and 0 of 225 on the withheld law; direct measurement 900 of 900 exact (counts); forces to the printed digits G1 · host A fourth mechanism that shares the probe's early trace reverses all 225 held-out decisions
KA-640 §25.14, §25.26 Pad family, 75 N pull 300 g under law V, 240 g under law P at centred readings; an eccentric pull needs 43.125 N at e/s = 0.15; an admitted reading drops the three-compact bound to 73.79 N to the printed digits G1 · host A certificate applied outside its reading set
KA-641 §25.16, §25.26 Coupled A/B on z ∈ [0, 1]: A succeeds iff z ≥ 3/5, B iff z ≥ 2/5 Outcome (1, 0) is unreachable; B gains on [2/5, 3/5) exact G1 · host, auditor Outcomes enclosed separately: (0, 0) and (1, 1) project onto {0, 1} for both and hide (1, 0)
KA-642 §25.17, §25.26 Handoff bit Pooled history wins both cases; every local deterministic choice loses one; a timely bit restores both exact (verdict) G1 · host A late bit
KA-643 §25.17, §25.26 Shared bus: two fingers each need one powered tick; the bus powers one finger per tick Zero one-tick schedules; two two-tick schedules exact (count) G1 · host An additive peak rule prunes the feasible two-tick case; local motor limits are identical in both cases
KA-644 §25.18, §25.26 Three variants on commands (x, y) ∈ [0, 1]²: x ≥ 2/3, y ≥ 2/3, x + y ≤ 1 Every pair intersects; the triple does not (x + y ≥ 4/3 against x + y ≤ 1). Two labels suffice, (2/3, 2/3) and (0, 0); one is impossible exact G1 · host, auditor Pairwise compatibility taken as joint
KA-645 §25.18, §25.26 Three variants, three readings Two labels per reading; three for a fixed label map across histories exact G1 · host none stated
KA-646 §25.18, §25.26 Station records {left, shared} and {shared, right} No tag count suffices exact (verdict) G1 · host An encoder premise assumed without a witness
KA-647 §25.18, §25.26 Label deadline: error e = u − bᵢ − q − δ, bᵢ ∈ {−1/4, 0, 1/4} mm, q ∈ [−1/32, 1/32] mm, δ ∈ [−w, w] mm, success abs(e) ≤ 3/8 mm Largest w is 3/32, 7/32 and 11/32 mm with one, two and three labels before commitment; 3/32 mm for any number delivered late exact (rational) G1 · host, auditor Labels counted without their delivery instants
KA-648 §25.7, §25.26 ≡ KA-127 Ballast quotient 735,471 placements fall into 24,546 classes; {0, 3} and {1, 2} must split exact (count) G1 · host A quotient by the mechanical group that merges {0, 3} with {1, 2}
KA-649 §25.19, §25.26 Differential-drive loop, half-track w, wheel radius ρ, wheel angle δ Sideways displacement 4w·(1 − cos(ρδ/2w)); zero net yaw and advance; the reversed loop gives the opposite to set G1 · host, referee none stated
KA-650 §25.19, §25.26 Skid-steer base under a no-slip connection ω = 0 exact G1 · host Admitting the connection for a skid-steer base
KA-651 §25.4.7, §25.26 ẋ = u, u ∈ [0, 1] Bracket rank one; negative x is unreachable from zero exact G1 · host Bracket rank read as reachability
KA-652 §25.21, §25.26 Mass placement: 1 kg inside a ball of radius 1/10 m with principal moments 1/125 kg·m² No placement: mean squared radius 3/250 m² is needed and at most 1/100 m² is available exact (rational) G1 · host, auditor none stated
KA-653 §25.21.3, §25.26 Three-pose dyad through (0, 0), (2, 0), (0, 2) Pivot (1, 1), radius² = 2 exact G1 · host none stated
KA-654 §25.21.3, §25.26 Crank-rocker 1, 4, 3 on ground 4 B = (11/5, ±12/5) at crank angle π; the two signs are different circuits exact (rational) G1 · host, auditor A root accepted without a circuit certificate
KA-655 §25.21.4, §25.26 Stewart–Gough forward kinematics; 6R inverse kinematics 40 and 16 solutions (FACT, to be re-read from the primary source) exact (count) G2 · host none stated
KA-656 §25.12, §25.26 Guarded strict predicate on 65,536 rows of the docking boundary 34,590 admitted and 30,946 excluded, of which 1,820 are exact ties; no error after exact fallback; identical bytes on all placements exact (count, digest) G5 · host, cuda, metal Unguarded single precision: 452 false admissions and 23,438 false exclusions on the near grid
KA-657 §25.22 Docking family against a scenario-tree program 51 linear programs agree with the exact answer exact (verdicts) G2 · host none stated
KA-658 §25.22 Stance classifiers against a conventional solver 11,520 of 11,520 states agree between two exact classifiers; 102 of 102 spot checks agree exact (verdicts) G2 · host none stated

M.25 §26 Nemesis: adversarial worlds and rare failures

KA Where stated The case The truth Tolerance Tier Negative control
KA-659 §26.3, §26.14 Planted illegal edit Refused with FROB-REF-360 and the bound named; 100 of 100 planted illegal edits refused (GATE-NEMESIS-01) exact G1 · host A profile with the bound removed admits it
KA-660 §26.5, §26.14 Planted impossible trap: a doorway narrower than the body infeasible-for-candidate with the bottleneck; never a counterexample; 0 of 100 planted impossible traps counted (GATE-NEMESIS-01) exact G1 · host, referee An oracle that checks a point robot calls it solvable
KA-661 §26.5, §26.14 Planted solvable trap of known nominal probability Found, with a causal witness attached; at least 95 of 100 planted solvable traps receive a witness (GATE-NEMESIS-01) as stated (GATE-NEMESIS-01) G1 · referee Card-uniform randomization at the same budget, as the baseline
KA-662 §26.6, §26.14 Planted artifacts: box-cone traction; energy-pumping penetration recovery artifact-candidate, with the variant that removed each exact (label) G1 · lockstep, referee A genuine planted failure survives every variant
KA-663 §26.7, §26.14 Shrinking planted causes of size 1, 2 and 3 among 8 to 32 edits The planted set exactly exact G1 · referee The order-dependence example: with edits listed (a, c, d, e, b) and failure when {a, b} or {c, d, e} is present, delta debugging ends at {c, d, e} before the pair check and at {a, b} after it (at most 78 tests of one- and two-edit subsets for 12 edits)
KA-664 §26.9, §26.14 Zero-failure rule at δ = 0.05 for p⋆ = 10⁻⁴, 10⁻⁵, 10⁻⁶ 29,956, 299,572 and 2,995,731 nominal episodes with no failure; the tenth qualification request needs 76,959 for 10⁻⁴ exact (count) G0 · host An episode count from ln(1/δ)/p⋆ rounded down
KA-665 §26.9, §26.14 Gaussian tail by defensive mixture q = ε·p + (1 − ε)·p_shifted, shift 4, ε = 0.1 P(z > 4) = 3.167 × 10⁻⁵ recovered inside the confidence sequence; every weight at most 1/ε = 10 inside the confidence sequence G0 · host A mixture without its nominal share on a mis-centred proposal
KA-666 §26.9, §26.14 Splitting on a biased random walk: up-probability 0.4, start at level 1 Probability of reaching level 20 before level 0 is 0.5/(1.5²⁰ − 1) = 1.504 × 10⁻⁴ inside the estimator's interval G0 · host A walk with no noise after the fork returns identical children and is refused
KA-667 §26.9, §26.14 Good–Turing monitor on a synthetic catalogue with known mode probabilities Unseen mass inside its interval inside the interval G0 · host A monitor that counts distinct modes instead of modes seen once
KA-668 §26.10, §26.14 Screening audit A planted winner removed by a deliberately biased screen is reported; no top-k design among 30 audited discards bounds the false-discard rate at 9.5% with 95% confidence, and 59 bound it at 5.0% exact (verdict); printed digits for the bounds G0 · host A screen with no bias passes
KA-669 §26.11, §26.14 Coverage certificate, worked instance: 40 modes of total weight 100; greedy gains 31, 22, 14, 9, 6, 4; the six largest remaining gains sum to 12 86 covered; OPT₆ ≤ 98; the selection is within 88% of the best six-scene battery, against a worst-case guarantee of 63% exact G1 · host A selection that double-counts a mode

M.26 §27 Autopsy: counterfactual debugging

KA Where stated The case The truth Tolerance Tier Negative control
KA-670 §27.6, §27.16 Planted single causes: 200 failures in five classes (friction drop, torque cap, payload shift, latency, terrain step), ten candidate factors each The planted factor ranks first with label but-for; accuracy at least 90% (KILL-AUTOPSY trigger below that) as stated (GATE-AUTOPSY-03) G1 · referee A failure planted through a factor outside the list names no factor
KA-671 §27.3, §27.16 Null fork Identical digests exact (digest) G5 · all tiers A checkpoint with its packet queue stripped does not replay and is refused
KA-672 §27.5, §27.16 Chaotic placebo: a doubling map with failure defined on its fortieth iterate A 10⁻¹² placebo is amplified by 2⁴⁰ ≈ 1.1 × 10¹²; about half of placebo forks flip; the label is chaotic: unattributable exact (label) G1 · host The same map over five iterates attributes normally
KA-673 §27.7, §27.16 Joint and alternative pairs: v of the pair 1 and of each single 0; v equal to 1 for either single and for the pair Labels joint and alternative; Shapley values (½, ½) in both; repair sets {1, 2}, and {1} or {2} exact (rational) G1 · host A summary that reports only Shapley values cannot tell them apart
KA-674 §27.7, §27.16 Negative Shapley value: v(∅) = 0, v({1}) = 1, v({2}) = 0, v({1, 2}) = 0 Values (½, −½); they sum to v(N) − v(∅) = 0 exactly; a single-factor repair exists exact (rational) G1 · host none stated
KA-675 §27.8, §27.16 Thermal re-run: one thermal node, time constant 60 s, ambient 25 °C, trip at 115 °C; steady-state rise 192 K at gear ratio 12 and 108 K at 16; 45 s task Trip at 60·ln(192/102) = 37.95 s; ratio 16 from the start peaks at 25 + 108·(1 − e^(−0.75)) = 82.0 °C; ratio 16 applied at 36.95 s finds the winding at 113.3 °C and trips at 42.4 s 0.1 s and 0.1 K (GATE-AUTOPSY-06) G1 · referee A tool that reports the forced fork's result as the answer to the design question
KA-676 §27.8, §27.16 Warm-start graft across a design edit Refused with FROB-REF-582 exact (verdict) G1 · host none stated
KA-677 §27.10, §27.16 First divergence: two traces of eight ticks that differ at ticks 1 and 5 Tick 1, by the chained digest exact G1 · host The pointwise midpoint search probes tick 3 or 4, sees agreement and reports tick 5
KA-678 §27.10, §27.16 Tolerance mode with a coverage gap The earliest possible interval and the coverage gap exact G1 · host A tool that skips the gap reports a later tick
KA-679 §27.9, §27.16 Precision: a marginal failure built to flip under a 10⁻⁷ perturbation and not under 10⁻¹², taken from a single-precision run Labelled precision-sensitive exact (label) G1 · referee, lockstep The same failure with a wide margin attributes normally

M.27 §28 Atelier: the studio loop, analyses, comparison, lineage, cascade, decision cores

KA Where stated The case The truth Tolerance Tier Negative control
KA-680 §28.4, §28.22 A-03: a quadruped with one forward lidar Four-element mechanical group; two-element observation-preserving subgroup exact (group) G1 · host A policy tied under the mechanical group is refused
KA-681 §28.4, §28.22 A-07, A-09: a mecanum base with misaligned rollers Full-rank (spanning) curvature; a rank drop in the growth vector exact (rank) G1 · host A curvature-only check passes the defective base
KA-682 §28.4, §28.22 A-08: the stance enumeration 11,520 of 11,520 classifications agree with the exact classifier; equal-spring forces (175, 115, 85, 25) N exact G1 · host The polygon-and-total-capacity screen accepts 1,596 rejected bodies
KA-683 §28.4, §28.22 ≡ KA-113 A-17: seven readings, each right with probability 0.75 Majority success 3807/4096 ≈ 0.929 when independent; 0.75 with a fully shared error exact (rational) G1 · host A redundancy score computed from per-reading accuracy
KA-684 §28.4, §28.22 ≡ KA-154 A-20: an 8 kg body on a 12 mm rise against a 0.90 J budget 8 × 9.81 × 0.012 = 0.94176 J excludes the passive crossing; 0.05 J of approach kinetic energy removes the exclusion exact to the printed digits G1 · host An exclusion issued with approach energy unbound
KA-685 §28.4, §28.22 A-21: a packet at tick 1 serving decisions that commit at ticks 2 and 4; delays to ticks 2 and 3 The answer changes only at the second delay and only for the first decision exact G1 · host A check that compares content and ignores arrival
KA-686 §28.4, §28.22 ≡ KA-610 A-22: 75 mm wheel, total reflected inertia 0.00107890625 kg·m², current target held for 10 ms One-tick spectral radii 1.4820 with target-current feedforward and 0.9207 with measured-current feedforward to the printed digits G1 · host The instantaneous-current model gives 2.6917 for both and misses the stable case
KA-687 §28.4, §28.22 A-23: two fingers on one bus Zero schedules at a one-tick deadline; exactly two at two ticks exact (count) G1 · host The additive-peak rule rejects the feasible two-tick design
KA-688 §28.4, §28.22 A-25: drawbar force F = min(k_t·I/r, μ·N) with 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: zero sensitivity to μ; at 3 A under 10 N they give 4 N against 8 N to the printed digits G1 · host A fit that reports μ from the first two runs
KA-689 §28.4, §28.22 A-18: a doorway narrower than every orientation of the footprint; the same doorway widened past the footprint An impossibility cut that names the doorway; a witness path when widened exact (verdict) G1 · host A clearance test on a bounding ball for a rectangular footprint
KA-690 §28.4, §28.22 A-24: a task wrench outside the attainable set A dual vector that separates it from every admissible actuation exact (rational re-check) G1 · host, auditor An infeasible wrench reported as not-synthesizable with no witness
KA-691 §28.4, §28.22 A-26: a run with one planted mode switch Two regions, with the boundary at the switch tick exact G1 · referee A gradient reported as trustworthy across the switch
KA-692 §28.4, §28.22 A-19: a finalist whose advantage comes from diagonal traction on a pyramidal cone (up to √2·μ) Typed model-conditional exact (label) G1 · lockstep, referee The same campaign with stage 5 skipped reports it as the winner
KA-693 §28.6, §28.22 ≡ KA-612 Fixed-n rule at n = 64 2,145 count pairs: 521 prefer, 521 inferior, 1,103 inconclusive, 0 ties; the first tie at n = 86 exact G0 · host A study that declares "tie" reachable at n = 64
KA-694 §28.6, §28.22 Zero discordances in 64 pairs One-sided 95% bound 1 − 0.05^(1/64) = 0.04573 to the printed digits G0 · host none stated
KA-695 §28.19, §28.22 DC-01 promotion table at p₀ = 0.05, p₁ = 0.30, α⁺ = 0.01 16 clean pairs promote, or 22 with one exceedance exact G0 · host An envelope changed after the first outcome
KA-696 §28.9, §28.22 Conformal margin at n = 39, α = 0.05 The 38th ordered residual exact (index) G0 · host Calibration from survivors only
KA-697 §28.11, §28.22 Stage 1 orbit representatives 86,185 and 500,500 representatives exact (count) G1 · host Deduplication under the mechanical group when a sensor breaks it
KA-698 §28.15, §28.22 ≡ KA-127 Deduplication digest on the ballast family 735,471 placements give 24,546 classes exact (count) G1 · host Two placements with equal first moment and different second moment merged
KA-699 §28.13, §28.22 Revalidation, four-state camera fixture: decisions commit at ticks 2 and 4, packet at tick 1; states: initial, a display label renamed, delivery delayed to tick 2, delivery delayed to tick 3 2, 0, 0, 1 scene-pair evaluations and 1, 0, 0, 1 verdict recomputations, each verdict equal to a fresh replay exact G1 · host The key without delivery time keeps a stale promotion
KA-700 §28.13, §28.22 Revalidation, widening the doorway The cost-9 cart stays feasible; its optimality is revoked exact (verdict) G1 · host An optimum kept after a cheaper rival became feasible
KA-701 §28.13 Revalidation, widening the hypothesis support of the docking fixture by gain 33/32 Indistinguishable from gain 1 at error radius 1/64; every one of the 34,590 positive decisions on each test grid is withdrawn exact (count) G1 · host A hash match taken as verdict transfer
KA-702 §28.7, §28.22 Bisect: outcomes along six versions are pass, fail, pass, pass, pass, fail An a-change at the last edit; no first-change without a scan of the prefix exact (label) G1 · host first-change reported at the last edit
KA-703 §28.19, §28.22 DC-09 worked queue Waits of about 2,000 s, 621 s and 0.2 s to the printed digits G1 · host none stated
KA-704 §28.19, §28.22 DC-10 coverage certificate Six gains cover 86 of 100; bound 98 exact G1 · host A certificate computed from stale gains
KA-705 §28.19, §28.22 DC-11, the f32 regrouping example The two groupings give 1 and 0 exact G0 · host A reassociation admitted in class E
KA-706 §28.12 Screening audit bounds No top-k design among 30 audited discards bounds the false-discard rate at 9.5% with 95% confidence; 59 bound it at 5.0% to the printed digits G0 · host none stated

M.28 §29 Chronicle: telemetry, replay, evidence

KA Where stated The case The truth Tolerance Tier Negative control
KA-707 §29.9, §29.19 Energy ledger of a damped pendulum Equal to the hand calculation; residual below 10⁻⁹ relative on the referee (GATE-CHRON-03) 10⁻⁹ relative G1 · referee A sign error seeded at one port is localized to that port
KA-708 §29.9, §29.19 Energy per task: a 10 J success and a 20 J failure against two 12 J successes 10 and 30 against 12 and 12 exact G1 · host A report that prints only the conditional mean
KA-709 §29.9, §29.19 Created energy: the stiff penalty bounce; the convex law at the default step The bounce raises energy-created and contact-active; the convex law raises neither exact (flags) G1 · referee, lockstep The audit switched off: the bouncing policy wins the comparison
KA-710 §29.9, §29.19 Cone excess: a push along the diagonal of a pyramidal cone Utilization √2 to set G1 · lockstep A circular-cone run must not be flagged
KA-711 §29.4, §29.19 Chunk protocol Two identical publishes yield one row and one receipt; a crash after commit returns the original receipt exact G4 · daemon A late lease that writes; overlapping ranges that commit; a reset at tick zero that collides
KA-712 §29.12, §29.19 Pagination: 10⁴ rows read in pages during concurrent appends Each row visible at the pin appears exactly once exact G4 · daemon A query ordered by timestamp alone repeats or skips equal-time samples
KA-713 §29.6, §29.19 Sampling of traced worlds by address The traced set is identical under 100 slot assignments and shard counts exact G5 · all tiers Arrival-order reservoir sampling gives different sets
KA-714 §29.7, §29.19 Integer histogram Counts identical under 100 permutations and shard splits, on every backend; integer bin counts 1, 1, 1 for the streams 1, 2, 3 and 3, 2, 1 exact G5 · all tiers An order-dependent sketch: a compactor of capacity two that keeps the lower of each sorted pair gives medians 1 and 2 for the two orders
KA-715 §29.5, §29.19 Downsampling: an impulse train summed over a window Momentum transfer is conserved to set G1 · host The same train averaged
KA-716 §29.8, §29.19 Fork The empty intervention replays bit for bit; a setpoint change at tick t reuses the prefix to the snapshot before t exact (digest) G5 · all tiers The 60 mm warm start grafted onto the 75 mm wheel
KA-717 §29.8, §29.19 First divergence: traces that differ at ticks 1 and 5 Tick 1 exact G1 · host Midpoint search on a pointwise predicate reports tick 5
KA-718 §29.8, §29.19 Teleport A planted single-kernel divergence is named by step and stage exact G1 · all tiers none stated
KA-719 §29.11, §29.19 Tier correction With every address audited it equals the plain mean exactly; with a prediction off by a constant it is still unbiased exact for the first; inside the interval for the second G0 · host Audit bits chosen after seeing fast-tier failures, without recorded probabilities
KA-720 §29.13, §29.19 Artifact graph Every gate row resolves to evidence and traces exact G1 · host A claim printed after its evidence was collected

M.29 §30 Ground: calibration against reality

KA Where stated The case The truth Tolerance Tier Negative control
KA-721 §30.7, §30.21 Clock recovery: planted skew 100 ppm, offset 3.7 ms, mark jitter 50 µs, marks 10 s apart Skew within 3·σ_s = 21 ppm; aligned instants cover the truth, in at least 99% of 1,000 resamples (GATE-GROUND-02) as stated (GATE-GROUND-02) G1 · referee (synthetic) One pulse only: refused. An offset fitted to the scored event: detected
KA-722 §30.8, §30.21 Structural aliases: the eight planted cases of §30.8 Each flagged, 8 of 8, with the identified combination named (GATE-GROUND-03) exact G1 · host A fit request on each aliased set is refused
KA-723 §30.8, §30.21 Friction against torque limit: F = min(k_t·I/r, μ·N), k_t = 0.2 N·m/A, r = 0.06 m, μ ∈ {0.4, 0.8} 3.33 N and 6.67 N at 1 A and 2 A under 30 N and 40 N are indistinguishable between the two μ; 4 N and 8 N are separated at 3 A under 10 N to the printed digits G1 · host The torque-limited data alone yields no μ
KA-724 §30.9, §30.21 Actuator recovery of J_a, b, τ_c, τ_s, v_s and d on a single-joint rig Each within 10% of the planted truth; delay within one grid step 10% G1 · referee (synthetic) Unidirectional data: τ_c is refused
KA-725 §30.7, §30.21 Delay against offset: delay 8 ms, offset −8 ms, no shared hardware mark Reported as "delay plus offset = 0" exact G1 · host A card delay update is refused
KA-726 §30.11, §30.21 Omitted law: the truth has a Stribeck term the fit class lacks The candidate is rejected at validation on sealed data exact (verdict) G1 · referee (synthetic) The same fit scored on its own calibration data passes
KA-727 §30.9, §30.21 Wrong reason: speed matched by a compensating error in k_t and friction The energy cross-check marks wrong-reason exact (label) G1 · referee (synthetic) none stated
KA-728 §30.12, §30.21 Band coverage: exchangeable residuals, n = 20, target 0.90, 1,000 resamples Mean coverage 19/21 = 0.905; fraction of resamples below 0.80 about 0.069 mean within 0.01 of 19/21 (pilot falsifier, §30.22) G0 · host Pooled shifted regime: 16 of 20
KA-729 §30.12, §30.21 Band refusal: an unbuilt design; a cell with 8 points; a new unit with 3 units calibrated Refused in each case exact (verdict) G1 · host none stated
KA-730 §30.13, §30.21 Drift: friction raised by 30% after episode k The calibration is retired within 20 further episodes as stated G0 · referee (synthetic) Null runs: false retirement at most 5%
KA-731 §30.13, §30.21 Miss-monitor arithmetic at n = 20, p₀ = 0.22, p₁ = 0.5 Four straight misses give 26.7; three give 11.7 to the printed digits G0 · host none stated
KA-732 §30.11, §30.21 Reachability: zero failures in 20 real trials Upper bound 13.9%; a claim of "under 5%" is unreachable to the printed digits G0 · host A registered claim of "under 5%" at n = 20 is refused at registration
KA-733 §30.14, §30.21 As-built registration: a planted rotation and translation; a 0.3 mm wall deviation Recovered inside the stated uncertainty inside stated uncertainty G1 · host Two fiducials: refused. Scale 25.4: unit suspicion raised
KA-734 §30.11, §30.21 Protocol: read before freeze; refit without a new version; holdout reuse Each refused exact (verdict) G1 · daemon none stated
KA-735 §30.2 (GATE-GROUND-01) The reality: line Printed on every report; no-claim with no dataset; a negative battery of 50 planted misuses is refused in full exact G1 · host The 50 planted misuses
KA-736 §30.12 Pooled conformal calibration at a 90% target across two regimes 20 of 20 in one regime and 16 of 20 in the shifted one: 36 of 40, nominal overall and 80% where it matters exact (count) G0 · host Pooling across cells

M.30 §31 Foundry: structure, manufacture, lifecycle

KA Where stated The case The truth Tolerance Tier Negative control
KA-737 §31.8, §31.18 Cantilever: L = 0.20 m, section 20 × 10 mm, E = 69 GPa, tip load 50 N Tip deflection P·L³/(3·E·I) = 1.159 mm; root stress 6·P·L/(b·h²) = 30 MPa; shear adds about 0.2% to the printed digits G1 · host Halving the load halves both; a millimetre-for-metre unit error is caught by dimension typing
KA-738 §31.8, §31.18 Planted overstressed link: the same beam with a root section 4 mm deep, 80 N, yield 240 MPa Stress 300 MPa, utilization 1.25, located at the root to the printed digits G1 · host The unthinned beam passes
KA-739 §31.7, §31.18 Two-bar optimum: load P at distance L from a wall, domain height 2L Bars at 45°; compliance 4·P²·L²/(E·V); minimum volume 2·P·L/σ_allow to set G1 · host Swapping the support and the load port is caught
KA-740 §31.6, §31.18 Assembled peaks: simply supported span L, P at L/3 at one instant and at 2L/3 at another Mid-span moment P·L/6 per instant; the assembled case gives P·L/3, or 0 with opposite signs exact G1 · host The assembling mutation is refused
KA-741 §31.8, §31.18 Fatigue block: N(S) = 10⁶·(100 MPa/S)³, fully reversed; 2,000 cycles at 200 MPa, 50,000 at 100 MPa, 400,000 at 50 MPa Damage 0.016 + 0.050 + 0.050 = 0.116 per block; 8.62 blocks to a sum of 1 exact to the printed digits G1 · host Feeding unsigned stress changes the count and is refused
KA-742 §31.8, §31.18 Rainflow sequence −2, 1, −3, 5, −1, 3, −4, 4, −2 in units of 40 MPa, no mean-stress correction Ranges 3, 4, 6, 8, 9 with counts 0.5, 1.5, 0.5, 1.0, 0.5; damage 8.752 × 10⁻⁶ exact (counts); printed digits for damage G1 · host Splitting after the fifth point and finishing each window loses the range-9 half cycle and gives 7.816 × 10⁻⁶, 10.7% low
KA-743 §31.9, §31.18 Loads–mass loop: M₀ = 12 kg, A = 0.6 kg, λ = 0.15, start 4.0 kg Iterates 3.0, 2.85, 2.8275, 2.8241, 2.8236; fixed point 2.8235 kg; λ̂ = 0.15 to the printed digits G1 · host λ = 1.1 is refused as divergent within three iterations; a planted two-size cycle is detected
KA-744 §31.9, §31.18 Mass properties of a tube: ρ = 2,700 kg/m³, radii 15 and 13 mm, length 0.20 m Mass 0.0950 kg; axial inertia 1.87 × 10⁻⁵ kg·m²; transverse inertia 3.26 × 10⁻⁴ kg·m² to the printed digits G1 · host The volume enclosure must contain the exact volume
KA-745 §31.11, §31.18 Tolerance allocation, worked case of §31.11 16.0 µm and 6.35 µm; 19.9% cheaper than equal tolerances under the 1/t cost model to the printed digits G1 · host q = x² at nominal zero: refused (FROB-REF-165), then fails the band-extreme check
KA-746 §31.12, §31.18 Voltage drop: copper, 1 m each way, 0.5 mm², 10 A, 24 V bus 0.0688 Ω; 0.688 V (2.9%); 6.9 W; 20 A/mm² to the printed digits G1 · host Halving the area doubles the drop
KA-747 §31.12, §31.18 Cable slack: offset 15 mm, joint range 2.4 rad 36 mm exact G1 · host none stated
KA-748 §31.12, §31.18 STEP round trip of a tetrahedron 18 instances; bit-exact replay exact G5 · host An open shell is refused; a part above the bound is refused with the bound stated
KA-749 §31.13, §31.18 Fixed point, Q15: (−1)·(−1); negation of −32768; an integrator adding 400 counts per tick from zero 0x8000·0x8000 = 0x40000000 shifts to 0x8000 and reads as −1; the negation overflows; the integrator overflows sixteen bits at tick 82, and without a clamp the one-step query returns the state 32,400 at once. Each counterexample is found; the clamped controller is certified exact G1 · host A widened input range breaks a certificate
KA-750 §31.14, §31.18 Averaged growth: ż = ε·a·x², x = sin ωt z(T) = ε·a·T/2 over whole periods 5% at a compression of 50 in steps (pilot falsifier, §31.19) G1 · host none stated
KA-751 §31.14, §31.18 Wear feedback: β̇ = ε·(c₀ + c₁·β) β(t) = (β₀ + c₀/c₁)·exp(ε·c₁·t) − c₀/c₁ to set G1 · host A planted gait collapse at β* must force full resolution before β*
KA-752 §31.14, §31.18 Rate averaging: insulation life halves per 10 K; half the time at T_ref and half at T_ref + 20 K Life is consumed at 2.5/τ_ref, not 2.0/τ_ref exact G1 · host Averaging the input (evaluating the law at the mean temperature) is caught
KA-753 §31.14, §31.18 Cell fade: 1% per √month calendar, 0.5% per 100 cycles; 9 months, 300 cycles 3% + 1.5% = 4.5% exact G1 · host none stated
KA-754 §31.6 Quasi-static superposition limit With the first natural frequency at least five times the highest loaded frequency, the dynamic amplification 1/(1 − (f/f₁)²) is at most 1.042 to the printed digits G1 · host none stated

M.31 §32 Tether: CLI, daemon, MCP, dashboard, viewer

KA Where stated The case The truth Tolerance Tier Negative control
KA-755 §32.4, §32.20 Exit-code table on a fixture of malformed, unknown, over-budget, unscoped and conflicting inputs The exit code and refusal code of §32.4 and §32.18 for each exact G1 · host none stated
KA-756 §32.8.2, §32.20 2⁵³ + 1 = 9,007,199,254,740,993 through a double-decoding client, as int53 and as u64str Refused as int53 (FROB-REF-808); preserved exactly as u64str. As a bare JSON number it decodes to 9,007,199,254,740,992 exact G1 · host A schema with a bare integer type fails the schema lint
KA-757 §32.20 Pair accounting on a planted comparison a_only + b_only + both + neither + unscored = planned exact G1 · host none stated
KA-758 §32.11.2, §32.20 The M/G/1 table of §32.11.2 against a discrete-event simulation of the dispatcher With 90% of jobs 10 s and 10% of jobs 30 min (ES = 189 s, E[S²] = 324,090 s²): first-come waits 857, 2,001, 3,430 and 7,716 s at utilization 0.5, 0.7, 0.8 and 0.9; short-class waits 439, 621, 713 and 806 s under priority only, and 0.12, 0.17, 0.20 and 0.22 s plus one quantum under preempt-resume; slowdown of long jobs 2.4%, 3.4%, 4.0% and 4.5%. Each cell within 5% at 10⁶ simulated jobs (TARGET) 5% G1 · daemon (simulated) Priority without preemption
KA-759 §32.20 Conformal index at n = 19, α = 0.05 The 19th smallest residual, that is, the largest exact (index) G0 · host none stated
KA-760 §32.20 Error budget of the blinded lane Σ_{i=1..n} α/[i·(i + 1)] = α·n/(n + 1) < α exact (rational) G0 · host none stated
KA-761 §32.20 Slot share of a 96-pair comparison in 8,192 worlds 192 ÷ 8,192 = 2.34% exact G1 · host none stated
KA-762 §32.20 Exact binomial bound, 200 worlds, α = 0.025 Upper bounds 0.0183, 0.0275, 0.0357, 0.0432, 0.0504 for 0 to 4 failures to the printed digits G0 · host none stated
KA-763 §32.7 Idempotency: requests A and B with the same key and payload, interleaved One job and one budget charge; the retry returns the stored receipt with idempotent_replay: true; the same key with a different digest is refused (FROB-REF-803, exit 7) exact G4 · daemon (simulated) Look up, then insert, in two statements: two jobs run and the budget is charged twice
KA-764 §32.8.1 Pagination: rows at t = 1, 2, 3, 4, page size 2; a row at t = 1.5 commits after page one; two worlds each with a sample at t = 2 Pinned to the committed frontier with order key (instant, world address, channel, sample index), page two returns {3, 4} and no row is repeated or skipped exact G4 · daemon (simulated) Offset pagination returns {2, 3}, repeating row 2; a time-only cursor skips the second sample at t = 2
KA-765 §32.10 Chunk partition: a retry splits a shard into tick ranges [0, 100) and [50, 150); a reset reuses tick zero With the fixed partition [k·C, (k + 1)·C) per (world, episode), the second extent is a duplicate (original receipt) or a conflict (FROB-REF-810); the second episode does not overwrite the first exact G4 · daemon (simulated) Range-keyed chunks: both ranges commit. A (world, tick) key: the second episode overwrites the first
KA-766 §32.10 Terminal receipt of a job Completed, failed, refused and unstarted trial counts sum to the planned number exact G1 · daemon none stated

M.32 §33 Suite consumption

KA Where stated The case The truth Tolerance Tier Negative control
KA-767 §33.5 Stack receipt computed twice on an unchanged tree Byte-identical exact G5 · host Touching one tracked file in a sibling flips dirty, changes tree_hash, and check-stack fails
KA-768 §33.9 (INT-FSIM-13) Floquet multipliers of the monodromy of ẍ + x = 0 over one period, through the airlock Both equal 1 10⁻¹² G1 · host A monodromy with a multiplier of modulus 1.01 is reported unstable
KA-769 §33.9 (INT-FSIM-14) Two-design comparison with mean gap Δ and standard deviations s₁, s₂; a multilevel estimate of E[x²] under a standard normal Ranking-flip probability Φ(−Δ/√(s₁² + s₂²)); the estimate is 1 within its own stated interval 10⁻¹² for the closed form G1 · host Importance weights on a proposal that misses the failure region trip the effective-sample-size floor and the estimate is refused
KA-770 §33.9 (INT-FSIM-15) Tolerance allocation on a two-term stack; a mesh written through fs-io The hand-computed variance split; the mesh reads back with the same hash exact (hash); to set for the split G1 · host A STEP file above the stated bound is quarantined with a receipt, not parsed
KA-771 §33.9 (INT-FSIM-16) Incremental recomputation on 10⁴ random edit sequences Equal to full recomputation exact G3 · host An input missing from a key is caught by the shadow recompute within 64 hits
KA-772 §33.9 (INT-FSIM-17) Poiseuille flow between plates; film mass over 10⁴ steps The parabola, to the crate's own stated tolerance; total film mass conserved 10⁻¹² relative for mass G1 · referee (evaluation tier) The bridge refuses when the feature is off and refuses a throughput-tier request
KA-773 §33.11 row 1 (INT-FSIM-06) Clipped surrogate min(ρ·Â, clip(ρ, 1 − ε, 1 + ε)·Â) with  = −1, ε = 0.2 At ρ = 0.5 the terms are −0.5 and −0.8: the clipped term is the minimum and the gradient is zero. At ρ = 2 they are −2 and −1.2: the unclipped term is the minimum. Finite differences in log σ at ratios 0.5, 1, 2: 0, −0.5, −1 10⁻³ relative in single precision G1 · host The reported code path gives −0.25, −0.5 and 0
KA-774 §33.11 row 1 (INT-FSIM-06) Critic output 2 with stored value and return 0; two independently reset one-step episodes, packed The squared-error objective gives gradient 2 into the critic bias; the frozen policy's ratio is 1 on both episodes ratio 1 to 10⁻⁶ G1 · host The reported code path gives gradient 0 and a second ratio of 1.582459
KA-775 §33.11 row 2 (INT-FSIM-05) Planar drive near zero curvature: θ = 32 rad, wheel speeds 1 and 1 + 6·10⁻¹³ m/s, track 0.5 m, Δt = 1/400 s, 400 steps ω = 1.2·10⁻¹² rad/s and ω·Δt = 3·10⁻¹⁵ rad, below half the spacing of doubles at 32 (2⁻⁴⁸ ≈ 3.55·10⁻¹⁵); the true displacement is one metre along the heading, about (0.83422336, 0.55142668) m 10⁻¹² G1 · host, referee The reported branch returns exactly zero translation
KA-776 §33.11 row 2 Independent chord formula Δp = v·Δt·sinc(δ/2)·(cos(θ + δ/2), sin(θ + δ/2)), δ = ω·Δt: unit speed through a half turn from θ = 0 The chord (0, 2/π) m 10⁻¹² G1 · host none stated
KA-777 §33.11 row 3 (INT-FNP-02) A contiguous 2×2 single-precision view: strides (8, 4) in bytes, (2, 1) in elements; a view with byte origin 4 and strides (8, −4) Index [1, 1] is element 3; the negative-stride view addresses elements (1, 0, 3, 2) and is materialized or refused exact G1 · host Copying (8, 4) verbatim addresses element 8 + 4 = 12, in bounds
KA-778 §33.11 row 4 (INT-FSIM-07) Flat-to-edge-to-top transition of a wheel over a sharp lip The sustained step returns its typed refusal through the airlock at the pin; the same transition completes under witness migration with the energy ledger closed to its stated residual ledger residual bound (§29) G1 · referee Over capacity (21 contacts) refuses
KA-779 §33.12 frob-units aliases against fs-qty Every alias product agrees in a differential test while both exist; a round trip through the airlock conversion preserves the value bits; a pressure added to a time fails to compile exact G0 · host A torque added to an energy must fail to compile although both have dimension vector (kilogram 1, metre 2, second −2)
KA-780 §33.14 (INT-FSIM-18) A 2,000-step G1 referee rollout submitted through the worker process Chunk digests equal, bit for bit, to the same job run in process; the same after killing the worker mid-job and resubmitting; fixed overhead at most 50 ms per job and at most 5% of wall time on jobs of one second or more exact (digest); overhead as stated G5 · referee A worker built at a different commit refuses the job

M.33 §34 Workspace, crates, formats

KA Where stated The case The truth Tolerance Tier Negative control
KA-781 §34.9 Canonical identity of the objects {"b":1,"a":2} and {"a":2,"b":1} One identity exact G0 · host A reader built with key-order canonicalization disabled must fail (GATE-WS-02)
KA-782 §34.9 (GATE-WS-02) For each of the thirteen formats: 10,000 seeded round trips canonical → value → canonical; where a view exists, 10,000 round trips view → canonical → view; 10,000 single-byte mutations Zero byte differences in both directions; every mutation either fails to parse or changes the identity; each reader survives 10⁷ fuzz executions with zero panics exact G3 · host Key-order canonicalization disabled
KA-783 §34.11 (GATE-WS-03) The independent auditor cargo tree -p frob-cert prints one line; the copied directory builds on its stable compiler with no network access; the standalone binary and the in-daemon verb return identical verdicts on the whole conformance corpus; a system-call trace of an audit shows no network and no process creation exact G0 · auditor A checker that reuses frob-core's hashing reproduces a canonicalization defect and passes a bundle whose statement differs
KA-784 §34.3 (GATE-WS-01) Workspace checks A deliberate upward edge, a deliberate intra-layer edge against rank, a second asupersync package, an unregistered capsule, an edited generated file and a contract missing a section are each caught exact G0 · host The planted violations are the controls

M.34 §35 Numerics and determinism

KA Where stated The case The truth Tolerance Tier Negative control
KA-785 §35.5, §35.14 One world run alone, in 100 random co-tenancies, under slot permutation, at two bucket capacities and on one and two shards Identical per-world digests: given a policy, a world's trajectory is a function of its address, design, scene and task alone (INV-NUM-03) exact, for 1,000 episodes of each reference workload on batch-cpu and each device family (GATE-SPARK-15) G5 · all tiers A kernel with a batch-wide floating reduction feeding state
KA-786 §35.5, §35.14 Sum of the one active element −0.0 at two capacities −0.0 both times, bit for bit: padding trails the active lanes and holds −0.0 for sums (INV-NUM-02) exact (GATE-SPARK-15) G5 · all tiers Padding with +0.0, since (−0.0) + (+0.0) = +0.0
KA-787 §35.5, §35.14 Two worlds observing 1 and 3 Each world's actions equal those of its isolated run: normalizers are frozen within a collection segment exact (GATE-SPARK-15) G5 · all tiers A normalizer updated inside the segment (the batch mean gives −1 and +1; the first world alone sees 0)
KA-788 §35.4, §35.14 Success predicate x ≥ 1 m with one placement ending at 1.0000001 m and the other at 0.9999999 m State error 2·10⁻⁷ m, inside any envelope; the verdicts differ; the pair is reported as discordant and boundary-sensitive on both placements exact (verdict) G1 · all tiers A check that compares states only
KA-789 §35.4 Decision-equivalence bound The one-sided 95% exact binomial upper bound on the discordant rate must be at most 1%: with zero discordant worlds the bound is about 3/n, so at least 300 worlds are needed; 4,096 worlds admit roughly thirty discordant worlds; the net one-sided rate at most 0.5% as stated (TARGET, GATE-SPARK-16; OPEN-NUM-2) G1 · host A planted bias of one decision in fifty must fail
KA-790 §35.8, §35.14 Offset −2⁻²⁵ m in a cell The centred convention (offset in [−4, 4)) never adds the cell side to a small number and shifts exactly exact G0 · all tiers The uncentred [0, 8) shift returns 8.0: 8 − 2⁻²⁵ is not an f32, the spacing just below 8 being 2⁻²¹
KA-791 §35.8, §35.13 Re-anchoring (PO-NUM-01) For 4 ≤ abs(x) ≤ 16 subtracting or adding 8.0 is exact by Sterbenz's lemma exact, exhaustive over the 2²⁵ values of two binades and two signs on each backend G0 · all tiers none stated
KA-792 §35.8 Resolution of anchored positions Single precision resolves about 7.6 µm at 100 m from the origin; an offset in [−4, 4) m resolves at worst 2⁻²² m, about 0.24 µm exact G1 · host none stated
KA-793 §35.9, §35.14 Sequential draws with one extra leg Addressed streams give both designs the same push exact G5 · all tiers A sequential stream r₀, r₁, r₂: design A draws its push as r₀ and design B, with one more per-leg draw first, as r₁
KA-794 §35.9, §35.13 Integer-to-uniform conversion (PO-NUM-03) u = (x ≫ 8)·2⁻²⁴ is exact and lies in [0, 1) exact, exhaustive over 2²⁴ values G0 · all tiers none stated
KA-795 §35.9, §35.13 Draw tables across slots, buckets, shards and backends A random draw is a function of (address, step, stream) alone (INV-NUM-04); adding a stream changes no draw of any other stream exact (GATE-SPARK-15) G5 · all tiers none stated
KA-796 §35.10, §35.14 Computed Cholesky factor of D·H·D against D times the computed factor of H, D a diagonal of powers of two (PO-NUM-02) Bit-identical, absent overflow and underflow exact, on 10⁴ matrices per backend (GATE-SPARK-18) G3 · all tiers A scaling by 10 instead of a power of two
KA-797 §35.10 Exact diagonal scaling by K-scale D_ii = 2^(−⌈e_i/2⌉) with e_i the binary exponent of H_ii; the scaled diagonal lies in [½, 2); no rounding is introduced exact G0 · all tiers none stated
KA-798 §35.10, §35.14 H = diag(1, 10⁻⁸) with residual (0, 10⁻⁷) 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 tolerance test fails exact (verdict) G1 · host The unscaled absolute test at 10⁻⁶ passes
KA-799 §35.10, §35.15 Conditioning figure κ̂ = (max L̂_ii / min L̂_ii)² A lower bound on κ₂ of the scaled matrix: κ̂ never exceeds the κ₂ computed in f64; the relative error of the f32 Newton step against f64 is bounded at most 10·κ₂·u on 10⁴ contact states per reference robot; at most 10⁻³ on near-rigid states under the stiff profile (GATE-SPARK-18) G1 · all tiers none stated
KA-800 §35.7, §35.14 The set {0, 3, 5, 9} histogrammed in two orders Identical histograms: bins are the sign, the exponent and the top five mantissa bits of the f32 pattern (a bin at most 3.2% wide), counts are integers, merging is addition exact G5 · all tiers A closest-pair two-centroid sketch (§21.20)
KA-801 §35.2, §35.14 A policy trained under fast-training evaluated twice under device-replay Identical digests exact (GATE-SPARK-17) G5 · all tiers Citing its training return is refused (FROB-REF-861)
KA-802 §35.3, §35.15 Licence refusals on planted cases A class D4 arm in a paired comparison and a cross-family pair demanded as paired without class D1 are refused (FROB-REF-561); attribution below class D2 is refused (FROB-REF-562); a cited training return is refused (FROB-REF-861) exact (GATE-SPARK-17) G1 · daemon none stated
KA-803 §35.3 Pairing arithmetic (illustrative values) The variance of a paired difference scales with 1 − ρ: a fall in pair correlation from 0.95 to 0.50 needs (1 − 0.50)/(1 − 0.95) = 10 times the episodes; a difference of one unit in the last place reaches order one after about ln(2²⁴)/λ ≈ 16.6/λ seconds exact G1 · host none stated
KA-804 §35.1, §35.13 Class of a combined result The weakest class among the kernels, placements, profile and inputs that produced it (INV-NUM-06); no conversion upward compiles exact (compile-fail test) G0 · host none stated
KA-805 §35.6 Lint over dialect sources and the Rust of frob-kernels mul_add, sin, cos, exp, ln, powf and their kin are rejected at build time (FROB-REF-251); sqrt is correctly rounded and allowed exact G0 · host none stated

M.35 §36 The performance program

KA Where stated The case The truth Tolerance Tier Negative control
KA-806 §36.2, §36.16 A report with 400 k env-steps/s of training at d = 10 beside 2.0 M world-steps/s of physics on the same card Rejected by the ordering check (INV-PERF-01): 400 k env-steps/s at d = 10 is 4.0 M world-steps/s inside training, and training is at most the full environment step, which is at most physics only exact (GATE-SPARK-19) G1 · host The same report with the decimation omitted must also be rejected
KA-807 §36.6, §36.16 Paired lower bound on ten pairs, each with ratio exactly 1.5 With ℓᵢ = ln(aᵢ/bᵢ) the bound is exp(ℓ̄ − t·s/√n), t = 1.833 for n = 10; here s = 0 and the bound is 1.5 exact G1 · host An A/A campaign must not clear 1.02 (of 100 A/A campaigns at most 9 clear it, GATE-SPARK-19)
KA-808 §21.11, §36.16 Padding overhead Ω_p for degrees of freedom 18 and 35 mixed evenly 1.32, 1.58, 1.76 for p = 1, 2, 3 to set (stated to two decimals) G1 · host none stated
KA-809 §36.5, §36.16 Family-batch bound: speedup ≤ 1 / (1 − f + f/r + h) f = 0.97, r = 40 and h = 0.02 give about 13.5; infinite acceleration of 85% of the time gives at most 6.7; with h = 0.02 no r reaches ten-fold unless f ≥ 0.92 to set (stated to three figures) G1 · host A pruning ratio multiplied by a full-set speedup must be flagged
KA-810 §36.5 The bound applied to a generation of 256 designs at 16 worlds and 10 s each 20.5 M world-steps, about 10 s of simulation at 2.0 M world-steps/s; padding taken as 30% of simulation time. Switch cost 1 s: f = 256/266 = 0.96 and the bound is 266/13 ≈ 20. Switch cost 0.1 s: f = 0.72 and the bound is 35.6/13 ≈ 2.7 to set G1 · host none stated
KA-811 §36.5 Pruning ratio and device speedup 100 candidates of 10 s each; pruning removes 90; the ten survivors accelerate by 2, not by the 5 measured on the full set: 1,000/50 = 20 exact G1 · host The product 10 × 5 = 50
KA-812 §36.5, §35.11 Ceiling-first rule A speed experiment requested without its computed ceiling, or with a ceiling below its goal, is refused (FROB-REF-866); recorded pilot (FACT, Appendix K): composed over specialized 1.345 warm and 1.088 cold; a residual of 575.7 µs 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) exact (refusal); to set (ceiling) G1 · host none stated
KA-813 §36.13, §36.16 Gradient of one sample at 1 and three at 0 on synchronous shards 0.25 on one shard and on two, however the four are split, and with an empty shard: sums are added in device order and divided by the global valid count exact (GATE-SPARK-20) G5 · cuda The mean of shard means: split as {1} and {0, 0, 0} it gives (1 + 0)/2 = 0.5; with an empty shard it divides by zero or halves the answer
KA-814 §36.10, §36.16 Per-world byte model in f32 for Q (18 degrees of freedom, 13 bodies, C = 32, R = 160) and H (35, 30, C = 64, R = 320) Cache 4·(61·bodies + 17·n): 4,396 and 9,700. Mass matrix, Hessian and factor 12·n²: 3,888 and 14,700. Dense Jacobian 4·R·n: 11,520 and 44,800. Row records 48·R: 7,680 and 15,360. Contact records 96·C: 3,072 and 6,144. State and solver vectors about 4,000 and 6,000. Totals 34.6 kB and 96.7 kB before rounding (about 35 kB and 97 kB) exact for the formula terms; sim.estimate within 5% of measured high-water marks (GATE-SPARK-22) G1 · host A capacity change must change the estimate by 4·n + 48 bytes per row
KA-815 §36.3 Row capacity of the reference workloads Four rows per contact plus one limit row and one stiction or backlash row per actuated joint, rounded up: 128 + 12 + 12 gives 160 for Q; 256 + 29 + 29 gives 320 for H exact G1 · host none stated
KA-816 §36.10 Consequences of the byte model 8,192 worlds of Q are 0.28 GB and of H 0.79 GB; PPO rollout storage 4·T·(observations + privileged observations + actions + 4) bytes per world is 24 kB at T = 24 with 48 observations, a 187-ray height scan and 12 actions; the hard-contact R × R operator is 102 kB per world of Q and 410 kB of H; 16 to 19 GB hold about 0.46 to 0.55 M worlds of Q or 0.17 to 0.20 M of H to set G1 · host none stated
KA-817 §36.12, §36.16 Camera frame memory A 640 × 480 frame with 4 bytes of colour and 4 of depth is 2,457,600 bytes; two cameras on 256 worlds are 1,258,291,200 bytes (1.17 GiB); on 8,192 worlds 37.5 GiB; 16 GB hold at most about 3,200 two-camera worlds; a 64 × 64 depth image in f32 is 16,384 bytes, two per world on 8,192 worlds are 0.27 GB exact G1 · host none stated
KA-818 §36.4 Amdahl limits on incumbent stacks Environment step at 87% of training wall-clock (94 k, 88 k and 82 k env-steps/s nested): at most 1/(1 − 0.87), about 7.7. Physics at about 29% of the environment step (347 k against 1.20 M env-steps/s): at most 1.4. Inference and learning at about 13%: at most 1.15. A step 1.5 times slower lengthens training by 1.15 to 1.44 for a step share of 0.29 to 0.87 to set G1 · host none stated
KA-819 §36.4 Compute per decision Ratio 410/(c_s + f·c_t); ten-fold needs c_s + f·c_t ≤ 41 device-seconds; at c_t = 410: f ≤ 7.6% if c_s = 10, f ≤ 0.7% if c_s = 38, impossible if c_s ≥ 41 to set G1 · host none stated
KA-820 §36.4 Design cycle and agent latency A 120 s cycle against 360 to 420 s is 3.0 to 3.5, and against a 30-minute run about 15; with agent latency L of 60 to 120 s and 300 s of incumbent training per turn the gain is at most (300 + L)/L, between 3.5 and 6; deleting training and compilation from a cycle of about 5.9 minutes gives 6.6 to set G1 · host none stated
KA-821 §36.9 Referee coverage A device produces T·h world-seconds per second and a referee on c cores at real-time factor ρ covers c·ρ: for H, 1.7 M × 2 ms = 3,400, and 24 cores at 0.2 to 1.0 cover 4.8 to 24, that is 0.14 to 0.7%; for Q at the floor 0.12 to 0.6%; batch-cpu at 275 k world-steps/s is 550 world-seconds per second, 16% of 3,400 to set G1 · host none stated
KA-822 §36.11 Bandwidth budget arithmetic (inputs are a HYPOTHESIS until measured) A batch outgrows a 72 MB L2 cache above about 2,100 worlds of Q or 750 of H; 4.0 M world-steps/s allows at most 126 to 202 kB per world-step at an efficiency of 0.5 to 0.8 on 1,008 GB/s; three passes over an 11.5 kB Jacobian in each of four Newton iterations are 138 kB; a quarter of 2.0 M world-steps/s at 240 kB per step needs 120 GB/s to set; bytes touched per world-step are measured per launch (GATE-SPARK-22) G1 · host none stated
KA-823 §36.14 Compute envelope arithmetic One device-hour at 50 to 500 k env-steps/s is 0.18 to 1.8·10⁹ env-steps; 1.6·10⁹ steps are 0.9 to 9 device-hours, 5·10⁹ are 2.8 to 28, 2·10¹² are 1,100 to 11,000, which is 23 to 230 days on two cards; a job above the class in force is refused before it starts (FROB-REF-761) to set G1 · host none stated
KA-824 §36.15 Designs screened per device-second, derived from rows 1 and 10 At 16 worlds and 10 s per design (80,000 world-steps): 17 at the tolerances (2.0 M × 0.70) and 43 at the ambitions (4.0 M × 0.86) to set G1 · host none stated
KA-825 §36.7, §36.16 Disclosure and admission refusals A Performance figure without the complete disclosure block is refused (FROB-REF-862); a ratio without a paired lower bound is refused (FROB-REF-863) exact (GATE-SPARK-19) G1 · host none stated
KA-826 §36.10, §36.16 Memory and time estimator sim.estimate memory within 5% of measured high-water marks at 1, 8, 64 and 256 worlds and at capacity for Q and H on each device; a job that does not fit is refused before allocation (FROB-REF-602); time estimates fall inside their intervals on at least 90% of held-out runs as stated (GATE-SPARK-22) G1 · cuda, metal none stated

M.36 §37 Safety, security, privacy

KA Where stated The case The truth Tolerance Tier Negative control
KA-827 §37.6, §37.14 Join over a three-step derivation: a private, research-only scene; a replay of it; a still of the replay Private and research-only at every step exact G1 · host An export without the flag is refused; after scene.purge no digest of the closure remains (GATE-SAFE-04)
KA-828 §37.9, §37.14 An artifact with one no-authorization flag set to true Refused by the importer and by frob-verify exact (verdict) G0 · host, auditor An artifact with the fields removed is also refused (GATE-SAFE-01)
KA-829 §37.10, §37.14 Claim product of {Tested on the referee, Tested and provisional on a fast tier} Provisional; over random sets of input evidence the envelope's class equals the meet (GATE-SAFE-08) exact G0 · host A public function that returns a stronger class than its inputs
KA-830 §37.3 (GATE-SAFE-02) At least 200 hostile strings through every verb that echoes imported text None appears outside an untrusted-marked field, in a tool description, in a prompt or in a next_actions command exact (count zero) G4 · host, daemon none stated
KA-831 §37.5 (GATE-SAFE-03) A session holding every discovery scope attempts at least 25 enumerated read paths against a confirmation run All return FROB-REF-840 exact G4 · daemon A test build that leaks per-world outcomes is detected by the adaptive-retry gate of §24
KA-832 §37.7 (GATE-SAFE-05) Licences over random derivation graphs The licence set equals the join of the inputs; a research-only asset cannot enter an exported report or pack exact G1 · host none stated
KA-833 §37.8 (GATE-SAFE-06) Supply chain One asupersync package per workspace; all lockfiles committed; frob-verify builds with no dependency outside the standard library exact G1 · host A kernel cache entry with one flipped byte is refused
KA-834 §37.11 (GATE-SAFE-09) A result produced under the nondeterministic training profile (D4) Refused on each of the five paths of INV-SAFE-07; the same policy re-evaluated under D2 is accepted exact (verdict) G5 · host The D4 result offered unlabeled
KA-835 §37.3 (GATE-SAFE-10) Path jail: a corpus of traversal, absolute-path and swapped-link attempts Refused on every path-taking argument of every verb exact G4 · host none stated

M.37 Coverage and gaps

Counts at plan time (FACT, computed from the rows above).

Chapter KA rows Numbers No stated control Tolerance to set CX entries Numbers
Part 0. Document control 2 KA-001 to KA-002 0 1 2 CX-001 to CX-002
§1 What exists, what is missing, what this is 6 KA-003 to KA-008 0 3 0 —
§2 The ten-fold thesis 8 KA-009 to KA-016 7 0 7 CX-003 to CX-009
§4 Bets, each with its falsifier 2 KA-017 to KA-018 0 0 4 CX-010 to CX-013
§7 North-Star scenarios 8 KA-019 to KA-026 7 0 0 —
§8 The seven claims and the claim product 6 KA-027 to KA-032 0 0 2 CX-014 to CX-015
§9 Doctrine 4 KA-033 to KA-036 1 1 3 CX-016 to CX-018
§10 The constructions 154 KA-037 to KA-190 72 47 79 CX-019 to CX-097
§11 Conventions 16 KA-191 to KA-206 6 4 8 CX-098 to CX-105
§12 Lemma: proofs, certificates, the offline auditor 21 KA-207 to KA-227 6 0 10 CX-106 to CX-115
§13 Marrow: the algebraic core 33 KA-228 to KA-260 6 3 9 CX-116 to CX-124
§14 Skeleton: design language, modules, archetypes, preflight 32 KA-261 to KA-292 7 6 10 CX-125 to CX-134
§15 Sinew: actuators, transmissions, power 45 KA-293 to KA-337 25 6 9 CX-135 to CX-143
§16 Kinesis: dynamics on three tiers 27 KA-338 to KA-364 11 2 9 CX-144 to CX-152
§17 Phylum: families of bodies in one batch 22 KA-365 to KA-386 9 0 14 CX-153 to CX-166
§18 Traction: collision, contact, wheels, tracks, terrain 39 KA-387 to KA-425 24 6 17 CX-167 to CX-183
§19 Habitat: scenes, living worlds, clearance, retrofits 39 KA-426 to KA-464 21 9 16 CX-184 to CX-199
§20 Sensorium: sensors, clocks, observability 60 KA-465 to KA-524 35 18 16 CX-200 to CX-215
§21 Spark: GPU backends and the kernel toolchain 28 KA-525 to KA-552 14 3 18 CX-216 to CX-233
§22 Reflex: estimation, control, gaits, skills, shields 23 KA-553 to KA-575 4 2 12 CX-234 to CX-245
§23 Cortex: the gym, learning, family policies, inheritance 18 KA-576 to KA-593 1 4 13 CX-246 to CX-258
§24 Arena: tasks, requirements, fixtures, metrics, qualification 30 KA-594 to KA-623 11 0 11 CX-259 to CX-269
§25 Augur: mission queries and inverse design 35 KA-624 to KA-658 8 1 18 CX-270 to CX-287
§26 Nemesis: adversarial worlds and rare failures 11 KA-659 to KA-669 0 0 8 CX-288 to CX-295
§27 Autopsy: counterfactual debugging 10 KA-670 to KA-679 2 0 6 CX-296 to CX-301
§28 Atelier: the studio loop, analyses, comparison, lineage, cascade, decision cores 27 KA-680 to KA-706 3 0 17 CX-302 to CX-318
§29 Chronicle: telemetry, replay, evidence 14 KA-707 to KA-720 1 2 7 CX-319 to CX-325
§30 Ground: calibration against reality 16 KA-721 to KA-736 4 0 10 CX-326 to CX-335
§31 Foundry: structure, manufacture, lifecycle 18 KA-737 to KA-754 4 2 9 CX-336 to CX-344
§32 Tether: CLI, daemon, MCP, dashboard, viewer 12 KA-755 to KA-766 7 0 7 CX-345 to CX-351
§33 Suite consumption 14 KA-767 to KA-780 1 1 6 CX-352 to CX-357
§34 Workspace, crates, formats 4 KA-781 to KA-784 0 0 6 CX-358 to CX-363
§35 Numerics and determinism 21 KA-785 to KA-805 10 0 10 CX-364 to CX-373
§36 The performance program 21 KA-806 to KA-826 15 12 10 CX-374 to CX-383
§37 Safety, security, privacy 9 KA-827 to KA-835 3 0 1 CX-384 to CX-384
Total 835 KA-001 to KA-835 325 133 384 CX-001 to CX-384

By tier: G0 135 rows, G1 591, G2 16, G3 36, G4 19, G5 38. Rows that share a fixture with an earlier row in another chapter and are marked "≡": 14.

Gaps, each an obligation on the owning chapter and none a defect of the suite's arithmetic:

  • Controls. 325 rows state no negative control. A further handful state a boundary behaviour where a mutation is needed: "a 4 mm film is refused" (§19.18), "with a 29 m budget the witness is rejected" and "a tree refuses localization" (§20.20). OPEN-GAUNT-3.
  • Tolerances. 133 rows state no tolerance, or only part of one, for a real-valued truth. OPEN-GAUNT-2.
  • Truths named and not written. §14 to §16 name closed forms for the pendulum period, the precession of a top, the pole of the two-wheeled balancer and the hydraulic cylinder, and do not write them; the rows that cite them carry no value until the derivation files exist. §14.13 sends the track rejection fixture to a belt-law known answer of §18 that §18.16 does not list under that name; the nearest row is the skid-steer base under exact no-slip, with yaw rate zero.
  • Chapters without rows. §3, §5 and §6 state no known answers.
  • Illustrative cards. Two rows of §15 and §18 serve one formula with different illustrative cards (a backlash gap closing at 0.577 rad/s with 0.0115 J against 17.5 ms and 0.083 rad/s; a critical current of 31.9 A against 35.8 A in C-38, where G = 0.5 W/K). Both are internally consistent; the registry keeps both fixtures under separate identities.

M.38 Values that could not be reconciled with their own formulas

Every hand-checkable value in the suite was recomputed while it was compiled. The values below did not reconcile at that time. Rows 1, 2, 3, 5, 6, 7 and 9 have since been corrected in the chapters, and the rows of this appendix carry the corrected values; the "Printed" column records what was first printed. Rows 4, 8, 10 and 11 stand as remarks, and the gate that cites each reads the derivation file once OPEN-GAUNT-6 is closed. None changes a verdict of a fixture.

# Where Printed Recomputed Remark
1 §0.7, §2.5, §25.22, §36.5 A zero-cost solver would reach "about 1.46" warm, from a ratio of 1.345 and a shared share of 94% of the specialized batch 1.345 ÷ 0.94 = 1.43 Corrected. The share attribution is withdrawn: the specialized batch holds a residual of 575.7 µs that the solver does not touch and that was not separately timed, and the ceiling is 842.8 ÷ 575.7 = 1.46. The conclusion (the test had no power) is unchanged
2 §2.3, §36.4 "About 7.8×" at a step share of 87% 1/(1 − 0.87) = 7.69 Corrected to "about 7.7 (1/(1 − 0.87))". 7.8 followed from the unrounded share 82/94 (94/12 = 7.83)
3 §36.3, row 4 515 s as 1.25 times the published 410 s 1.25 × 410 = 512.5 s Corrected to 513 s. It is a planning value; the binding gate is the ratio 1.25 against a re-measured incumbent (GATE-CORTEX-05)
4 §19.10.3 352 film tiles for a 6 m × 6 m floor, and 16 tiles (about 16 kB) for 1 m² Area over tile area gives 351.6 and 9.8 tiles; tile-aligned counts give 361 and 16 Two rounding rules in one paragraph
5 §19.15 "About 190 GB … a little under 85%" of about 222 GiB 85% of 222 GiB is 188.7 GiB, or 202.6 GB; 190 GB is 79.7% of 222 GiB Corrected. Gigabytes and gibibytes were mixed; the device budget is 85% of the measured working-set limit in §19.15 and in §36.10
6 §20.4.6 Every-thirteenth-step scheduling is "2.6%" fast 615/600 is 2.5%; 30.77/30 is 2.6% Corrected. The count of decision instants in a half-open 20 s window is 616 against 600; the rate error is 2.6% and on counts the overpayment is 2.7%
7 §26.9 The tenth qualification request needs 76,963 failure-free episodes for 10⁻⁴ The exact rule ⌈ln α₁₀ / ln(1 − p⋆)⌉ that gives 29,956 in the same table gives 76,959; ln(1/α₁₀)/p⋆ = 76,962.1 gives 76,963 Corrected to 76,959, the exact rule used in the rest of the table
8 §26.14 Negative control "an episode count from ln(1/δ)/p⋆ rounded down" At p⋆ = 10⁻⁴ that count is 29,957, which exceeds the exact 29,956 The planted defect errs on the safe side at these values and cannot make the row fail; a control that undercounts is needed
9 §1.8 8,192 quadruped or 4,096 humanoid worlds use "about 1 to 1.5%" of a 24 GB card 8,192 × 20–53 kB is 0.7–1.8%; 4,096 × 56–180 kB is 1.0–3.1% Corrected to "about 1 to 3%", which the per-world sizes of §36.10 give
10 C-15 Perfect concordance at n = 64 gives [−0.0662, +0.0662]; first tie at n = 86 Reconciles only with two-sided 97.5% intervals (1 − 0.0125^(1/64) = 0.0662); at 95% the bound is 0.0560 and the first tie is at n = 72 Not an error: C-15 omits the level that §24.10 states
11 C-32 "0.64 of each side" after 10⁴ boxes 13 bisections give 2^(−13/20) = 0.637; 10⁴ boxes exactly give 0.631 Rounding