FrankenRobotics

EV matrix and the killed-idea register

15,958 words17 subsections8 tablesPlan version 1.1

On this page17
C.1 The EV matrixC.1.1 Adopted, SolidC.1.2 Adopted or admitted, Frontier and MoonshotC.1.3 Parked, deferred or rejectedC.1.4 The Moonshot queueC.2 The killed-idea registerC.2.1 Arithmetic, precision and kernelsC.2.2 Memory, forks, telemetry and schedulingC.2.3 Worlds and physicsC.2.4 Control, learning and transferC.2.5 Search, statistics and decision rulesC.2.6 Algebra, synthesis, proofs and certificatesC.2.7 Reality, structure and the thesisC.2.8 Claims, wording and processC.2.9 Index by hypothesisC.2.10 Four further entriesC.3 Discrepancies found

This appendix has two jobs. C.1 scores every family of mechanism that was considered for the plan and records what was decided about it: adopted at a tier, parked, deferred or rejected. C.2 holds the strong form of every idea that was refuted or deflated, with the calculation or the evidence that did it and the narrower version that survives. §0.8 requires that a strong form appear once in the plan, and this is the place. C.3 lists figures, in the planning record and in other chapters, that do not follow exactly from their own formulas.

Labels in this appendix. A score is a DESIGN judgment. A figure quoted from a publication, from sibling code or from a planning pilot that ran outside this repository is FACT with an entry in the source register (Appendix H), and each is re-read from its primary source, or re-run here, before a gate cites it; that sentence is not repeated in every row. Arithmetic on stated assumptions is marked "DESIGN arithmetic": a reader can redo it by hand, and it is not a measurement. A range in a "survives" line, and a ceiling quoted in a decision column, is a HYPOTHESIS about this system until the named gate records a measurement, and every threshold is a TARGET. A number inside a "strong form" line is the proposal's own figure: it is quoted, not endorsed. Nothing here was measured on FrankenRobotics code, because none exists.

C.1 The EV matrix

Score = (Impact × Confidence) ÷ Effort, each from 1 to 5, printed to one decimal. Impact counts the effect on the goal of the program, the time and compute to an independently accepted design decision (§2), and for evidence mechanisms the effect on what may be trusted. Confidence is the judgment that the mechanism delivers that effect, taken after the evidence of §0.8. Effort is engineering cost, with 5 the largest. Scores are judgments, recorded so that they can be argued with.

Three rules govern the tables.

  1. A family that scores below 2.0 is rejected, parked or deferred unless something else needs it. The one exception is a Moonshot: under GOAL-43 an M item may be admitted below 2.0, behind a feature flag and off the critical path, and it then waits in the queue of C.1.4 until its pilot is funded.
  2. A row carried from version 0.2 keeps its scores unless a verdict of §0.8 changed them, and a changed score says so. Its "Where" column uses the final numbering.
  3. Every construction C-16 to C-40 has a row, and so does every major mechanism that is not a construction. Where a construction has a Solid part and a Frontier part, the row sits in the table of its larger part and the decision names both.

Within each table the rows are sorted by score, highest first.

C.1.1 Adopted, Solid

These are the spine and the mechanisms next to it. A kill gate in the decision column names what the plan falls back to; a row without one has no optional part.

Family Where Impact Confidence Effort Score Decision
Inertia on the positive-definite cone C-03; §11.5, §13, §14.5 4 5 1 20.0 Adopted S; Riemannian identification of inertial parameters is F in the calibration lane (§30.9)
Euler–Poincaré framing and the momentum map C-04; §11.2, §16 4 5 1 20.0 Adopted S
E-processes for paired comparison on common world addresses C-15; §24.12, §28.6 4 5 1 20.0 Adopted S; one of the two declared study types
Two declared study types, never mixed: anytime-valid, and fixed-n with a pre-analysis of reachable verdicts §24.12, §28.6; eval.preanalyze 4 5 1 20.0 Adopted S; GATE-ARENA-05, GATE-ATEL-06
Gym semantics: explicit reset with the final observation kept, termination apart from truncation, action likelihood, physical discounting §23.3 4 5 1 20.0 Adopted S; masked automatic reset is a labeled mode
Group-preserving Cayley updates C-05; §16.7 4 4 1 16.0 Adopted S
Screening audits: sampled discarded strata and a planted winner §26.10, §28.12 4 4 1 16.0 Adopted S; GATE-ATEL-09
Diagonal power-of-two scaling for single-precision contact solves §18.12, §35.10 3 5 1 15.0 Adopted S; the surviving alternative to half precision (C.2 entry 1)
Submodular coverage of scene sets by lazy greedy selection §26.11; DC-10 3 5 1 15.0 Adopted S
Lie-typed core on fs-ga C-01, C-02; §13 5 5 2 12.5 Adopted S; lattice-based mobility analysis is F
Trust ladder, fidelity ledger and the promotion rule §16.8; DC-01 5 5 2 12.5 Adopted S
Growth vector and maneuverability C-07; A-07, §28.4 3 4 1 12.0 Adopted S for the growth vector; the index and the bracket primitives are F
Invariant filtering C-13; §22.3 4 5 2 10.0 Adopted S
Static analyses in design check §14.11, §28.4; BET-05 5 4 2 10.0 Adopted S; KILL-STATIC downgrades verdicts to advisory lints
Clock contract: rational periods, phase accumulators, seven instants, packet queues inside every checkpoint C-19; §11.7, §11.8, §20.4 4 5 2 10.0 Adopted S; race enumeration falls back to the fixed total order under KILL-SCHED
Blinded qualification lane with the error budget α_i = α/[i·(i+1)] §24.13; GATE-QUAL-01 to -03 5 4 2 10.0 Adopted S
Exact-integer and guarded single-precision kernel classes §13.7, §21.8; GATE-SPARK-08 4 5 2 10.0 Adopted S; KILL-MARROW-GUARD
Energy ledger, and the audit for energy created by the simulator §16.10, §29.9 4 5 2 10.0 Adopted S
Deterministic integer log-bin histograms and a reservoir chosen by address §29.6, §29.7, §35.7 2 5 1 10.0 Adopted S; replaces order-dependent sketches (C.2 entry 11)
Finite symmetry groups, computed: the mechanical group and its observation-preserving subgroup C-09; §13.4, §20.13 4 4 2 8.0 Adopted S for detection of both groups, augmentation and metamorphic tests
Requirement language: bounded-time temporal logic over unit-normalized predicates C-30; §24.5, §24.6 4 4 2 8.0 Adopted S as acceptance metric and search score; as a reward term only through the pilot of KILL-SPEC-REWARD
Rare-failure bounds from bounded-weight importance sampling and crude sampling C-27; §26.9; DC-04 4 4 2 8.0 Adopted S; splitting and adaptive proposals are F and explore only; KILL-RARE
Interventional autopsy on forks, with a placebo fork and a flip rate C-29; §27.3 to §27.6; DC-06 4 4 2 8.0 Adopted S; KILL-AUTOPSY
Four-dimensional contact cone, and joint-level stiction, backlash and stop rows C-37; §15.6, §18.6, §18.7 4 4 2 8.0 Adopted S; KILL-SINEW-ROWS
Port-Hamiltonian actuators with a thermal node C-38; §15.5, §15.7 4 4 2 8.0 Adopted S
Memo graph past model identity, with dependency-directed revalidation of verdicts §28.13, §28.14 4 4 2 8.0 Adopted S for reuse grades 1 and 2; higher grades stand or fall with KILL-REUSE
Batch-composition invariance and decision-level equivalence under class D3 §35.4, §35.5; GATE-SPARK-15, -16 4 4 2 8.0 Adopted S; KILL-D1 demotes a device family to class D2
Offline auditor frob-verify and the claim product §8.2, §12.2, §12.4, §34.11 4 4 2 8.0 Adopted S; GATE-WS-03
MCP surface on fastmcp_rust, generated from the verb registry, in the core graph with verbs run in process §32.12 4 4 2 8.0 Adopted S; KILL-MCP falls back to a separate workspace over a local socket, then to the CLI
Symmetric-cone abstraction and one cone solver C-06; §22.5 3 5 2 7.5 Adopted S
Crash-consistent job protocol with atomic idempotency binding §32.7, §32.10 3 5 2 7.5 Adopted S
Convex compliant contact with a referee audit C-06; §16.8, §18.5 5 4 3 6.7 Adopted S as law CL-1; KILL-CONTACT
Per-world parameter variants within one topology §17.3, §21.11 5 4 3 6.7 Adopted S
Observability Gramian modulo a gauge C-20; §20.11; A-17 3 4 2 6.0 Adopted S
Canonical form of a design up to the similarity group C-21; §14, §17.11 3 4 2 6.0 Adopted S for the canonical form and the exact power-of-two test; canonical policy inputs are F
Film-friction law and rigid proxies §18.8, §19.10.2 3 4 2 6.0 Adopted S; KILL-FILM
Decision cores DC-01 to DC-11, each with a fixed-table fallback §28.19 3 4 2 6.0 Adopted; each core ships in shadow behind its fallback (GATE-ATEL-13, -14)
Placement planner with requested-versus-actual receipts and strict-backend errors §21.12; GATE-SPARK-09 3 4 2 6.0 Adopted S
Scene acceptance §19.5 3 4 2 6.0 Adopted S
Transactional, event-located referee step §16.5 4 4 3 5.3 Adopted S on the referee and the strict profile; throughput tiers keep the lockstep solve
Value of an experiment in closed form, used as a stop rule C-39; §28.16, §30.15; DC-05 3 3 2 4.5 Adopted S for the closed form and the ranking; probe synthesis is F; KILL-VOI, KILL-AUGUR-PROBE

C.1.2 Adopted or admitted, Frontier and Moonshot

Every row here has a paper-scale pilot, a falsifier and a ceiling in the section cited (D-10), and the decision column names its kill gate. "Adopted" means the work package is funded once the pilot has run; "admitted" means the item is in the catalogue and waits its turn under the cap of C.1.4.

Family Where Impact Confidence Effort Score Decision
Gymnasium-compatible adapter §23.18; GATE-CORTEX-16 3 4 1 12.0 Adopted F; KILL-GYMADAPT
Max-plus gait timing C-10; §22.9 3 4 1 12.0 Adopted F
Monotone co-design: closure analysis and catalog lane C-12; A-10, §28.4; §25.21.1 4 4 2 8.0 Adopted: the closure analysis A-10 runs in design check S; Pareto antichains over catalogs are F; KILL-SYNTH-CODESIGN
Composition over typed ports (the wiring diagram of version 0.2) as a thin data structure C-12; §14.6 3 4 2 6.0 Adopted F, kept thin: one data structure and five functors; KILL-SKEL-SUBST
Inheritance of a policy along design edits C-23; §23.12; GATE-CORTEX-13 4 3 2 6.0 Adopted F for parameter edits by default, with scheduled resets; KILL-INHERIT
Sampled background referee with a reported coverage figure §16.11; GATE-FID-07 3 4 2 6.0 Adopted F; KILL-SHADOW
Baseline controller synthesis per morphology class C-13; §22.4; BET-06 5 3 3 5.0 Adopted F across morphologies; KILL-BASELINE routes failing classes to training
Rank agreement between rungs, the ladder allocation and conformal survivor sets C-26; §16.9, §28.9, §28.10 5 3 3 5.0 Adopted F; the decisive early experiment; KILL-RANK, KILL-LADDER
Gait atlas from symmetry C-10; §22.9; A-04 3 3 2 4.5 Adopted F; KILL-GAIT
Assumption lattice and verdict polarity C-18; §25.8, §28.13 3 3 2 4.5 Adopted F; KILL-AUGUR-REUSE; fallback, recompute from the dependency closure
Campaign quotienting by symmetry orbits and mission observables C-22; §17.11, §28.15 3 3 2 4.5 S for orbit enumeration and counting; F for wreath products and the projection quotient; KILL-QUOTIENT, KILL-AUGUR-CUTS
Retrofit catalog: priced edits of the world as repairs §19.12; GATE-HAB-11 3 3 2 4.5 Adopted F; KILL-RETROFIT
Division of labour between the two machines, and the fleet scheduler §21.17; GATE-SPARK-13 3 3 2 4.5 Adopted F; KILL-FLEET
Coupled fidelity estimators: control variate, multilevel, doubly robust correction C-25; §16.8, §29.11 4 3 3 4.0 S as mathematics; F across contact-rich tiers; KILL-DR
Minimal counterexample worlds C-28; §26.7; .fmcw 4 3 3 4.0 Adopted F; KILL-MCW
Energy-budget safety tier and runtime shields C-31; §22.11, §22.12 4 3 3 4.0 Adopted F, class Tested; KILL-ENERGY, KILL-SHIELD
Clearance complexes certified from both sides C-33; §19.11; A-18 4 3 3 4.0 Adopted F; KILL-FCLEAR
Observation-alias impossibility witnesses, label counts and schedule classes C-19; §20.12, §25.10, §25.18 4 3 3 4.0 Adopted F; KILL-ALIAS, KILL-AUGUR-ALIAS, KILL-SKEL-ALIAS
Family certificates in the .frobcert bundle §12.2, §12.4, §25.5 4 3 3 4.0 Adopted F; KILL-FAMILYCERT, KILL-AUGUR-FALSECERT
Sampling controller as a fallback and a source of demonstrations §22.8; BET-27 3 4 3 4.0 Adopted F; never a stand-in evaluator for a trained policy; KILL-MPC
Mission queries with inner and outer design sets C-17; §25.3 to §25.5 5 3 4 3.8 Adopted F; first slice on the CPU at M1; KILL-AUGUR-TIE, KILL-FAMILYCERT
Family policies per morphology class C-23; §23.11; GATE-CORTEX-11 5 3 4 3.8 Adopted F; KILL-FAMILY; needs an owner-approved compute envelope
Mixed-topology model variants in padded size buckets §17.4, §17.5, §21.11; BET-18 5 3 4 3.8 Adopted F; KILL-PHYLUM, KILL-BUCKET
Slot-level episode dispatch in the daemon §21.11, §32.11; DC-09 5 3 4 3.8 Adopted; KILL-SLOT falls back to one environment per job
Equivariant networks under the observation-preserving subgroup C-09; §13.5, §23.13 3 3 3 3.0 Adopted F; KILL-EQUIV, KILL-MARROW-BLOCKS
Derived kernels with dimension typing C-14; §21.6, §21.7 4 3 4 3.0 Adopted F for correctness, derivatives and certificates; as throughput capped near 1.2; KILL-KIR
Instance certificates C-14; §12.4 3 3 3 3.0 Adopted F; KILL-LEMMA
Hybrid gait orbits: saltation, return maps, labeled derivatives, continuation in design parameters C-16; §16, §22.9; A-04 3 3 3 3.0 Adopted F, labeled screening; KILL-GAIT
Region certificates and dual witnesses of infeasibility C-32; §25.6 3 3 3 3.0 Adopted F on sub-boxes of about six parameters or fewer; KILL-AUGUR-REGION
Bounded exact linkage synthesis C-34, lane 1; §25.21.3 3 3 3 3.0 Adopted F; KILL-SYNTH-LINKAGE
Trajectory optimization with design variables, as local refinement §25.21.2; GATE-AUGUR-18 3 3 3 3.0 Adopted F; KILL-SYNTH-TRAJOPT
Calibration against reality, and conformal bands per calibrated cell §30.6 to §30.13; DC-07 4 3 4 3.0 Adopted F as an import lane that is mostly no-claim; KILL-GROUND, KILL-BAND
Paired finite-difference design gradients over short horizons §17.13, §28.8 3 2 2 3.0 Adopted F; KILL-FDGRAD
Design-family lanes under the bound 1/(1 − f + f/r + h) §17.6, §36.5 2 3 2 3.0 Adopted F, with a ceiling of 1.10 to 1.32 stated first; KILL-FAMILYLANE
Payload slosh by an equivalent mechanical model §19.10.4 2 3 2 3.0 Adopted F; KILL-SLOSH
Articulated cord and rug proxies §19.10.5 2 3 2 3.0 Adopted F; KILL-PROXY
Trapezoidal variational step (the variational articulated integrator of version 0.2) C-36, C-05; §16.7 3 3 4 2.3 Adopted F at M5 in the referee and the strict profile; KILL-VARIATIONAL; the nonholonomic rows of C-36 are S
Topology optimization, fatigue, tolerance allocation and the build packet C-35; §31.5 to §31.12 3 3 4 2.3 Adopted F for output quality, not counted in the thesis of §2; KILL-TOPOPT, KILL-LOADS, KILL-TOLERANCE, KILL-PACKET
Hard-contact batch law CL-H §18.5; GATE-TRAC-09 3 3 4 2.3 S as the referee's written specification; F as a batch law; KILL-HARDCONTACT
Connection-curvature oracle C-08; A-09, §28.4; §25.19 2 3 3 2.0 Adopted F, narrowed to kinematic locomotors and shape-changers; not a wheel-layout test (C.2 entry 21); among the first items to be cut; rescored from 3.0
Dominance as unreachability in a product system C-40; §25.16 3 2 3 2.0 Adopted F; KILL-AUGUR-DOMINANCE
Robot-advected film fields §19.10.3 3 2 3 2.0 Adopted F at M6; KILL-ADVECT
Rotor port for flight §14.10, §15.4 2 3 3 2.0 Admitted M; KILL-SINEW-ROTOR; queued (C.1.4)
Tree-operator route for mechanisms above 64 degrees of freedom §16.6 3 2 4 1.5 Adopted F because hybrids above 64 degrees of freedom need it; KILL-TREEOP keeps the dense factor and the cap
Skill transport: through a physical interface, and by a learned residual §22.10, §25.11; GATE-REFLEX-09, GATE-AUGUR-23 3 2 4 1.5 Admitted M; KILL-SKILL, KILL-AUGUR-TRANSPORT; queued
Symmetry at the instant of contact, amortized per family §25.20; GATE-AUGUR-21 2 2 3 1.3 F as a test; M as an amortization; KILL-AUGUR-SYMEVENT
Reachable-set tables for small subsystems §22.12.5; GATE-SHIELD-05 2 2 3 1.3 Admitted M; KILL-TUBE; queued
Kernel reflection §12.4; T-35; GATE-LEMMA-05 2 2 4 1.0 F pilot at M5, kept because it is the one route from an instance certificate to class Proved; KILL-REFLECT parks it in C.1.3
Geometric-algebra policy on the kinematic tree C-24; §23.14; GATE-CORTEX-17 2 2 4 1.0 Admitted M, with a ceiling of 1.3 stated first; KILL-GATREE; queued
Numerical continuation for linkage synthesis, on the CPU C-34, lane 2; §25.21.4 2 2 4 1.0 Admitted M; KILL-SYNTH-CONT; queued
Study-quadric mechanism synthesis C-11; piloted with C-34 2 2 4 1.0 Admitted M; queued behind the continuation lane
Tactile hands: micro-patch contact pads §14.10, §18.17 2 2 4 1.0 Admitted M; fallback, one patch per pad; queued
Firmware export of fixed-point controllers §31.13; GATE-FOUNDRY-11 2 2 4 1.0 Admitted M; KILL-FIRMWARE; queued
Lifecycle compression §31.14; GATE-FOUNDRY-12 2 2 4 1.0 Admitted M; KILL-LIFECYCLE; queued
Shape-space atlas for locomotion by geometric phase §25.19; GATE-AUGUR-20 2 2 4 1.0 F on kinematic fixtures; the atlas is M; KILL-AUGUR-PHASE
Label minimization from contact for a shared controller §25.18; GATE-AUGUR-19 2 2 4 1.0 F on supplied sets; M from contact; KILL-AUGUR-LABELS
Fused per-world step kernel §21.18 3 1 3 1.0 Admitted M; the sign of the benefit is unproven; KILL-MEGA; queued
Coupled multiphysics islands: free-surface fluid, implicit cloth, Cosserat rod, on the CPU referee for finalists §19.10.6, §19.10.7; GATE-HAB-09 2 2 5 0.8 Admitted M; funded only if the proxy-adequacy pilot shows that proxies miss failures; KILL-LIVING
Facility co-design and multi-robot handoff §25.17; GATE-AUGUR-24 3 1 5 0.6 Admitted M; KILL-AUGUR-FACILITY; queued

C.1.3 Parked, deferred or rejected

A parked row may be reopened by the evidence named in its decision. A rejected row is not built; where the rejection rests on a calculation, the decision points to its entry in C.2. Methods that were considered for one decision core and rejected are listed with their reasons in §28.19.4 and are scored here.

Family Where Impact Confidence Effort Score Decision
Bandit allocation for the ladder or the queue DC-02, DC-09; §28.19.4 3 3 3 3.0 Rejected: regret is the wrong objective for identifying the best design (C.2 entry 45)
Expected information gain as the selection rule DC-05; §28.19.4 2 3 2 3.0 Rejected: it buys knowledge that cannot change the choice
A second in-house geometric-algebra layer — 2 4 3 2.7 Rejected as duplication: fs-ga already provides it
Coalition-value attribution as the primary output of an autopsy DC-06; §27.7 2 4 3 2.7 Kept as a budgeted summary only
Defensive-mixture importance sampling as the certified bound DC-04; §26.9 2 4 3 2.7 Rejected as a certificate; kept as a lower bound for refutation (C.2 entry 37)
Pressure-field (hydroelastic) contact C-06 3 3 4 2.3 Deferred F; none of the laws of §18.5 implements it
Contact-mode enumeration by hyperplane arrangements — 2 3 3 2.0 Parked; mode strata are counted only up to symmetry orbits (§13.6, C-16)
Gradients through contact D-8; §17.13, §28.8 4 2 4 2.0 Deferred to M6; regime-local and return-map derivatives with validity labels arrive earlier (C-16)
Extreme-value extrapolation of failure tails DC-04 3 2 3 2.0 Rejected (C.2 entry 37)
Feedback control of solver effort on wall-clock DC-08 2 3 3 2.0 Rejected: it breaks replay (C.2 entry 15)
Kernel two-sample and optimal-transport drift tests DC-07 2 3 3 2.0 Rejected: no power at twenty scalar residuals
Barrier contact for articulated bodies C-06; §18.5 3 3 5 1.8 Left to FrankenSim's own lane; not built here
E-graph saturation over real-arithmetic rewrites DC-11 4 2 5 1.6 Rejected; reopened only on the profile condition of DC-11 (C.2 entry 4)
A category-theoretic framework beyond five functors C-12 2 3 4 1.5 Rejected under D-2
Gaussian-process surrogates over designs DC-02, DC-05 3 2 4 1.5 Rejected: no validated kernel on typed designs of varying topology
Exact reuse of rollouts after a mass or geometry edit §28.13 3 1 2 1.5 Rejected (H-09; C.2 entry 33)
Tensor-core products for a 256-wide policy §21.20 1 3 2 1.5 Rejected on the deterministic profiles (C.2 entry 2)
Specialized kernels for tournament survivors §17.9, §21.18; GATE-SPARK-14 2 2 3 1.3 Parked F behind its profile gate: built only if the M2 profile shows a specializable share of at least one third; KILL-SPECIALIZE
Sampling control as a stand-in evaluator for a trained policy §21.20, §22.8 4 1 3 1.3 Rejected (H-01; C.2 entry 26)
Operator-theoretic (Koopman) locomotion models — 2 2 3 1.3 Parked (C.2 entry 22)
Path signatures as telemetry features — 2 2 3 1.3 Parked
Copy-on-write device state for forks §21.20 1 4 3 1.3 Rejected: wrong bottleneck (C.2 entry 10)
Minimal perfect hashing or succinct structures for brick directories §21.20 1 4 3 1.3 Rejected: wrong bottleneck (C.2 entry 12)
Half precision on matrix accelerators for the contact solve §18.12, §21.20 3 1 3 1.0 Rejected (H-15; C.2 entry 1); refused by FROB-REF-245
One universal policy across topologies §23.11 5 1 5 1.0 Rejected at an affordable pretraining budget (H-02; C.2 entry 27)
A learned correction of the fast tier, or a learned step surrogate as a screen DC-01, DC-02 3 1 3 1.0 Rejected: it hides the artifacts the trust ladder exists to expose
Order-dependent mergeable quantile sketches §21.20, §29.7 2 1 2 1.0 Rejected (C.2 entry 11)
Connection curvature as a wheel-layout test A-09 2 1 2 1.0 Rejected: the growth vector of A-07 is the test (C.2 entry 21)
Live zero-copy reads of device state by the CPU §21.20 1 2 2 1.0 Rejected (C.2 entry 13)
Sheaf-theoretic sensor fusion — 2 2 4 1.0 Parked; the invariant filter and the least-squares pose graph of §20.14 cover the need
Topological complexity of configuration spaces — 1 3 3 1.0 Rejected: it changes no decision an agent makes
Per-world adaptive time tiles and time-parallel integration §21.20 2 2 4 1.0 Rejected (C.2 entry 9)
Polyhedral loop optimization of kernels — 2 2 4 1.0 Rejected: loops of at most 60 iterations unroll under staging
Mechanism design for the job queue DC-09 2 2 4 1.0 Rejected: estimates come from the system, not from agents
General Lean theorems on Lie groups T-13 2 2 5 0.8 Deferred M; the modules are blocked today (§12.1)
Joint paving of a 10- to 20-dimensional design box §25.6 3 1 4 0.8 Rejected (H-06; C.2 entry 35)
Replicated consensus, gossip membership and escrow counters for the daemon DC-09 1 3 4 0.8 Rejected: one daemon per host; nothing is replicated
Full-room fluid, cloth or granular matter in every training world §19.10.1 3 1 5 0.6 Rejected (H-16; C.2 entry 17)
Persistent homology of configuration spaces — 1 2 4 0.5 Rejected
General 6R inverse kinematics by Gröbner bases C-11 2 1 4 0.5 Rejected at current tool limits; inside the caps, certified inverse kinematics is F
Quaternionic-type irreducible blocks §13.5 1 1 2 0.5 Rejected: no group in scope has one; FROB-REF-214 (C.2 entry 48)
Stochastic superoptimization and counterexample-guided synthesis of kernels DC-11 2 1 4 0.5 Rejected: no sound equivalence check exists for floating-point code
Continuation on the GPU with root certificates checked inside a proof kernel §25.21.4 2 1 5 0.4 Rejected (C.2 entry 47); the CPU lane is M

C.1.4 The Moonshot queue

D-6 caps the Moonshot budget: at most four M items are active at once, and an item is active from the funding of its pilot until its expiry gate. The catalogue of admitted M items is longer than four, so the rest wait here. Nothing in this table is on the critical path of §43, every item sits behind a feature flag, and none is funded before its paper-scale pilot has run and its ceiling has been stated (D-10).

The order of entry into a free slot is a DESIGN default, and §43 governs where it differs. (1) An item whose consumers land at an earlier milestone goes first. (2) Within a milestone the item with the cheaper pilot goes first, because a cheap pilot that fails frees its slot soonest. (3) An item that depends on another waits for it. A slot is freed when the item passes its gate, when its kill gate fires and the fallback is recorded, or when the falsifier of its pilot holds.

Order Item Where Pilot before funding Kill gate or fallback Milestone
1 Fused per-world step kernel §21.18 Fuse kinematics, dynamics terms and one Newton iteration for the reference quadruped; compare with the staged kernels at 8,192 worlds with digests unchanged; one week KILL-MEGA; the staged step plan After the M2 profile
2 Coupled multiphysics islands: free-surface fluid, implicit cloth, Cosserat rod §19.10.6, §19.10.7 Proxy adequacy on an incumbent engine: three scenes, 200 episodes each, proxies against full models (GATE-HAB-09) KILL-LIVING; the Solid tier and the Frontier proxies After M6; the pilot needs no new solver and may run from M3
3 Rotor port for flight, with the aerial-terrestrial hybrid variant §14.10, §15.4 Hover by hand: thrust equals weight, ideal induced power T^(3/2)/√(2·ρ·A), and the energy ledger closes KILL-SINEW-ROTOR; port and variant withdrawn M6
4 Tactile hands: micro-patch contact pads §14.10, §18.17 A fingertip pad as 2 × 2 and 4 × 4 four-dimensional contacts on the strict profile, against one patch One patch per pad M6
5 Persistent ruts and footprints §18.10, §18.17 The leak fixture on batch-cpu: a rut made in one episode has no effect on another Off; terrain resets each episode M6
6 Link-chain tracks §18.9, §18.17 A chain of 40 links on the referee; falsifier, a contact count beyond every admitted capacity The belt model M6
7 Hydraulic actuation (actuator level L4) §15.4, §15.14 A single cylinder through an orifice: steady speed against the closed form, with the port balance closed Electric levels L1 to L3 only M6 at the earliest
8 Continuum arm: a rod as a generalized joint §14.10 Waits for the rod of item 2 Not built without item 2 After item 2
9 Shape-space atlas for locomotion by geometric phase §25.19 Differential-drive and crawler fixtures (GATE-AUGUR-20); funded only after one proposed gait is admitted by a full referee rollout KILL-AUGUR-PHASE; A-09 stays a forward diagnostic M6
10 Symmetry at the instant of contact, amortized per family §25.20 The mirrored landing and its four asymmetric mutations (GATE-AUGUR-21) KILL-AUGUR-SYMEVENT; per-event finite differences M6
11 Label minimization from contact for a shared controller §25.18 A three-variant gripper fixture: inner and outer command sets derived from contact KILL-AUGUR-LABELS; supplied sets through a conventional solver After M4
12 Lifecycle compression §31.14 A 100-hour reference of 1.8 × 10⁸ steps compressed at least 50-fold with at most 5% error on every slow state (GATE-FOUNDRY-12) KILL-LIFECYCLE; aged variants at hand-specified wear states Work lands with M6; the gate is recorded at M8
13 Firmware export of fixed-point controllers, with the reserved fixed-point kernel types and theorem card T-14 §21.7, §31.13 The fixed-point cases of §31.18, 10⁶ vectors bit-equal (GATE-FOUNDRY-11) KILL-FIRMWARE; parameters, Q formats and the test-vector manifest only M8
14 Numerical continuation for linkage synthesis, on the CPU C-34; §25.21.4 Stewart–Gough forward kinematics: 40 certified roots on ten generic parameter sets (GATE-AUGUR-22) KILL-SYNTH-CONT; the exact lane with multistart recovery, labeled Partial M8
15 Study-quadric mechanism synthesis C-11 Piloted with item 14 Numerical inverse kinematics with multistart, labeled incomplete After item 14
16 Skill transport through a physical interface §25.11 The tray interface, three treatments, pre-registered (GATE-AUGUR-23) KILL-AUGUR-TRANSPORT; family policies and inheritance of §23 M8
17 Skill transport by a learned residual §22.10 24 target bodies of one class, three treatments at equal compute, about 40 GPU-hours (GATE-REFLEX-09) KILL-SKILL; the exact layer and its witnesses M8
18 Reachable-set tables for small subsystems §22.12.5 Braking across two floor materials: two states and a mode (GATE-SHIELD-05) KILL-TUBE; reduced-order barriers M8
19 Geometric-algebra policy on the kinematic tree C-24; §23.14 Three arms with three seeds each, about 90 GPU-hours in an owner-approved envelope (GATE-CORTEX-17) KILL-GATREE; the plain morphology transformer M8
20 Facility co-design and multi-robot handoff §25.17 The acceptance fixture: two strategies discriminated and four seeded failures recovered (GATE-AUGUR-24) KILL-AUGUR-FACILITY; single-robot missions with priced world edits M8
21 General Lean theorems on Lie groups (T-13) §12.3 None possible while the modules are blocked (§12.1) Stays deferred Not scheduled

Four notes. Pilot sizes and costs in the table are TARGETs and estimates taken from the cited sections. Kernel reflection is tiered F in §12.4 and is not counted against the cap; if KILL-REFLECT fires it moves to C.1.3. Payload slosh by an equivalent mechanical model, robot-advected films and articulated cord and rug proxies are F (§19.10.3 to §19.10.5) and are likewise outside the cap; resolved free-surface fluid, cloth and rods exist only inside item 2. For items 9, 10 and 11 the M part is funded only after the F part of the same section has passed its own gate.

C.2 The killed-idea register

Each entry gives the strong form as it was proposed, the refutation with its numbers, and what survives with the section, gate and kill gate that hold it. An entry that corresponds to a hypothesis of §0.8 carries its identifier and state. The reversal condition of an entry is the measurement named in its "survives" line: a verdict changes only on new evidence of the kind that produced it. Entries are numbered through the whole register and are cited as "C.2 entry n". Shortcuts that are wrong for a hand-checkable reason, as distinct from mechanisms that were proposed and then deflated, are in Appendix N.

C.2.1 Arithmetic, precision and kernels

1. Half precision on tensor cores for the contact solve (H-15, REFUTED)

  • Strong form. Factor the contact Hessian H = M + JᵀDJ in half precision on matrix accelerators, refine in single precision, and gain a factor of four or more on the solve.
  • Refutation. DESIGN arithmetic: half precision has unit round-off u₁₆ = 2⁻¹¹ ≈ 4.9 × 10⁻⁴, and refinement contracts only if κ·u₁₆ < 1. A rank-one contact operator with the proposed shift ρ = 10⁻²·tr(W)/48 has κ = 1 + 48/0.01 = 4,801, so κ·u₁₆ = 2.34. FACT (software emulation on three reference models): after unit-diagonal scaling, κ·u₁₆ ≥ 1 in 37 to 64% of sampled contact states and the refined solve fails outright in 9 to 18%. Cost: k refinement steps at about 3n² operations against a factor of n³/3 is a ratio of 9k/n, which is 2.3 at n = 27 and k = 7, 1.5 at n = 35 and k = 6, and 3.0 at n = 18 and k = 6. Refinement alone costs more than the factorization it was meant to cheapen. FACT: the published four- to five-fold gain is against double precision at 22,000 unknowns, and against a single-precision baseline the theory promises at most two.
  • Survives. Nothing about contact solves. Single precision in power-of-two scaled variables (§18.12, §35.10; BET-08). A request for a half-precision solve or state is refused (FROB-REF-245).

2. Tensor-core products for a 256-wide policy

  • Strong form. Run policy inference and the learner's matrix products on matrix accelerators at reduced precision.
  • Refutation. FACT: the learner and inference together are about 13% of training wall-clock on one incumbent stack, so removing them entirely gives at most 1/(1 − 0.13) = 1.15; and reduced precision leaves determinism class D2.
  • Survives. Plain f32 products in the kernel dialect. Device matrix paths only inside the labeled D4 training profile, whose results are re-evaluated on a stricter profile (§35.2, §37.11).

3. Supercompiled per-design kernels as a throughput lever (H-04, REFUTED for recursion-only specialization)

  • Strong form. Partial evaluation of the recursions on one fixed design, with equality saturation, gives at least 1.5 times the throughput of the universal kernel at no more than 60 s of compilation per design.
  • Refutation. FACT (an incumbent's event trace, humanoid, 8,192 worlds): of 262 ns per world-step, the stages a design-specialized recursion could touch sum to 53 ns, 20%; the solve is 124 ns and constraint construction 38 ns. DESIGN arithmetic: an infinitely fast recursion gives 262/209 = 1.25 and one twice as fast gives 1.11; a manipulation scene has a share of 16% and a ceiling of 1.19; a ceiling of 1.5 needs a share of one third. FACT: the incumbent's cold kernel compilation takes about 96 s.
  • Survives. Specialization for tournament survivors only, and only if our own M2 profile shows a specializable share of at least one third (§21.18; GATE-SPARK-14; KILL-SPECIALIZE). Derivation stays for correctness, certificates and the derivative kernels of CPU solvers (C-14). Topology is data, so a new design recompiles nothing (§21.11). Structure-exploiting constraint assembly and solve is a separate and open question (H-04b, ACTIVE): its sparsity is carried as data, it is measured at M2, and it is not counted in the thesis until then (§16.23).

4. Equality saturation and superoptimization of kernel arithmetic

  • Strong form. An e-graph with a solver over real-arithmetic rewrites, or a stochastic superoptimizer, extracts faster kernel bodies than common-subexpression elimination.
  • Refutation. Every accepted rewrite changes bits, so each needs an error bound, a battery run and a new kernel identity. No sound equivalence check exists for floating-point code. On the trace of entry 3 the solve alone is 124 of 262 ns, 47% of the step, which rewrites of the recursions do not touch.
  • Survives. Common-subexpression elimination, and rule-trace rewrite certificates in the exact class E and the bounded class R (§21.7; DC-11). The method is reopened only on the profile condition of DC-11.

5. Fast-math switches in the kernel pipeline

  • Strong form. Contraction of multiply-adds, an approximate arithmetic mode and built-in sine and cosine in batched kernels, beside a three-way parity gate.
  • Refutation. Each switch lets a compiler or a device choose the rounding, so the CPU, CUDA and Metal kernels of one source no longer agree bit for bit and the parity gates (GATE-SPARK-01, GATE-SPARK-02) cannot pass. The two requirements exclude each other.
  • Survives. The bans of §35.6 (ADR-SPARK-02): no fast-math, no fused multiply-add, no built-in transcendentals in batched kernels, no floating-point atomics. An explicit, declared fused multiply-add is OPEN-NUM-1.

6. Unordered floating-point scatter, accepted if 99.9% of windows replay bitwise

  • Strong form. Drop the ordered scatter for unordered atomics if the two agree on 99.9% of windows.
  • Refutation. DESIGN arithmetic: 0.999¹⁰⁰⁰ = 0.37. A campaign of a thousand windows would replay exactly about one time in three, and a replay that is bitwise most of the time is not bitwise.
  • Survives. A stable-key sort and a segmented reduction (K-seg-reduce; §35.7). Integer atomics only for maximum, minimum, or and wrapping add.

7. A derived launch-cost advantage, and a megakernel at high occupancy

  • Strong form. An 8- to 20-fold launch-cost advantage from fewer graph nodes; one fused megakernel at 75% occupancy or more, with a lossless 27-float summary of each limb.
  • Refutation. FACT: a warm launch-graph replay has near-constant host cost, so cost per node does not accumulate. DESIGN arithmetic on the proposals' own figures: 2 warps of 48 per multiprocessor is 4.2% occupancy, and 12 of 48 is 25%, not 75%. The limb summary is exact only without base-coupled contact, and its Schur update is only positive semidefinite.
  • Survives. The latency from an edit to the first GPU step, as a measured number (§17.8). Limb port packets as an intermediate tier (KILL-SKEL-PORT). The fused per-world step kernel as an M pilot whose benefit is unproven in sign (§21.18; KILL-MEGA).

8. Staged erasure of algebra as a source of runtime speed

  • Strong form. Erasing algebraic structure at compile time makes the runtime strictly faster than a conventional engine.
  • Refutation. It restates the plan's own compile-time position and names no new mechanism. Its figure, 1.875 in floating-point operations, is counted on a step that is bound by memory traffic (§36.11) and not by arithmetic.
  • Survives. A compiler rule: proofs, tags and types are erased before runtime (§21.7).

9. Per-world adaptive time tiles and time-parallel integration

  • Strong form. Advance each world through tiles of up to 64 steps between interactions, or integrate in parallel in time with coarse and fine propagators.
  • Refutation. Separate worlds are already independent. DESIGN arithmetic: policy and sensor frames at 50 to 100 Hz are observation fences, and at physics steps of 1 to 2 ms they bound a tile to 5 to 20 steps. Contact makes coarse and fine propagators disagree, and tiles make shapes dynamic.
  • Survives. Fixed decimation in a static launch graph (§21.11).

C.2.2 Memory, forks, telemetry and scheduling

10. Copy-on-write forks on device

  • Strong form. Fork device world state by copy-on-write, so that a fork costs nothing until it diverges.
  • Refutation. State is write-dense: every step rewrites every world's configuration, velocity, contacts and warm starts, so a fork has copied everything after one step and pays an indirection on every read. DESIGN arithmetic: the whole copy is small. 8,192 worlds × 30 kB = 0.25 GB, at most about a millisecond at the memory bandwidth of an RTX 4090, and so at most a quarter of one 4.1 ms batch step at 2.0 M world-steps/s.
  • Survives. Fork by indexed copy of the chosen rows into free slots (K-snapshot), with warm template environments kept resident (§27.3, §29.8).

11. Order-dependent quantile sketches

  • Strong form. Mergeable quantile sketches for telemetry quantiles across shards and devices.
  • Refutation. Hand-checkable: a two-centroid sketch that merges its closest pair, fed {0, 3, 5, 9}. In the order 0, 3, 5, 9 it ends as (8/3 with weight 3; 9 with weight 1). In the order 0, 9, 5, 3 it ends as (1.5 with weight 2; 7 with weight 2). The same data give different sketches, so the statistic depends on shard count and arrival order, which the batch-composition invariance of §35.5 forbids.
  • Survives. Integer log-bin histograms (K-x-hist): bins from the bit pattern, integer counts, merge by addition (§29.7, §35.7).

12. Minimal perfect hashing or succinct structures for brick directories

  • Strong form. Compress the directory of scene bricks with a minimal perfect hash or a succinct structure.
  • Refutation. DESIGN arithmetic: a dense directory of 8³-voxel bricks with 4-byte slots is 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; and 18.8 MB for that warehouse at 2 cm. That is about 0.4% of the dense 16-bit field it indexes, and a hash adds a second, verifying read to every lookup.
  • Survives. A dense directory per scene variant over a shared brick pool (§19.15; KILL-POOL).

13. Live zero-copy reads of device state by the CPU

  • Strong form. On unified memory the CPU reads live GPU state in under a microsecond with no copy.
  • Refutation. FACT (vendor documentation): shared storage must be quiescent before the other processor reads it, and device writes are visible only when a command buffer completes. DESIGN arithmetic: the data are tiny. A humanoid's integration state is about 540 bytes, so shadowing 256 worlds at 50 Hz moves 6.9 MB/s.
  • Survives. Fenced snapshots on any backend (rule R1 of §21.9; K-snapshot), which also serve the two-card machine by explicit read-back.

14. An always-on referee at zero copy cost (H-11, NARROWED)

  • Strong form. Idle CPU cores shadow GPU worlds with the referee at zero copy cost and catch tier-sensitive behaviour during training at no more than 5% of throughput.
  • Refutation. Coverage is the ratio of referee rate to device rate: about 0.1 to 2.4% of GPU world-seconds on any backend if the referee runs at 0.2 to 1.0 times real time per core on 24 cores, and more if it is faster (HYPOTHESIS, §0.8; measured at M2); unified memory is not the lever (entry 13). DESIGN arithmetic: detecting a five-point gap in success rate needs n ≈ 16·p·(1 − p)/δ² episodes per tier, 576 at p = 0.9 and 1,600 at p = 0.5. The mechanism adds cost and removes no training or search.
  • Survives. A sampled background referee with a reported coverage figure, as a correctness guard (§16.11; GATE-FID-07 at coverage of at least 0.1% and a throughput loss of at most 5%; KILL-SHADOW; BET-34).

15. Feedback control of solver effort on wall-clock

  • Strong form. A proportional-integral-derivative or model-predictive controller reads measured step time and adjusts solver iterations and effort profiles.
  • Refutation. Wall-clock feedback into iteration counts makes a result depend on machine load. The same world address run on a loaded and on an idle machine executes different iteration counts and yields different digests, so replay under classes D1 and D2 breaks and paired statistics are refused. No calculation is needed: one such pair is the counterexample.
  • Survives. Effort profiles are model identities, chosen by a guard table with hysteresis that reads solver residuals and never time (DC-08; §28.19). The lockstep iteration count is a constant of the shape class (§16.6).

16. Causal tile reuse across replays

  • Strong form. Reuse the unchanged tiles of a replay, for a factor near 12.7 if 95% of the replay is reusable.
  • Refutation. The robot's neighbourhood dominates the compute and is always dirty. The 95% premise holds for far-field state that costs almost nothing to recompute.
  • Survives. Sharing of static far-field fields through the brick pool (§19.15).

C.2.3 Worlds and physics

17. Full-room fluid, cloth or granular matter in every training world (H-16, REFUTED as stated)

  • Strong form. Fluid films, cables and cloth coupled to rigid robots inside training worlds, at 10% or more of rigid-only throughput when active in 5% of worlds.
  • Refutation. DESIGN arithmetic: a D3Q19 lattice in single precision with two population buffers needs 19 × 4 × 2 = 152 bytes per cell. A 10 × 10 × 3 m room at 1 cm is 3.0 × 10⁸ cells, 45.6 GB for one world and about 374 TB at 8,192 worlds; at 5 mm one world needs 365 GB, above the working-set limit of the large-memory machine. A spill film of 0.1 to 1 mm needs cells of 0.25 mm: 2.56 × 10⁸ cells, 39 GB per square metre of floor. Throughput: 0.95 + 0.05·c ≤ 10 gives c ≤ 181 rigid worlds per coupled world, and the sibling cloth solver takes tens of CPU seconds per drape (FACT).
  • Survives. A contact-level film-friction law and rigid proxies S (§18.8, §19.10.2); whether they reproduce the failures of coupled models is untested and is decided by the pilot of §19.10.7. Advected films, slosh and articulated proxies F. Coupled islands M on the CPU referee for finalists only (§19.10.6; KILL-LIVING; BET-36).

18. Lattice fluid at control rate

  • Strong form. Advance fluid tiles once per 50 Hz control tick inside the training batch.
  • Refutation. DESIGN arithmetic: the lattice Mach number is Ma = √3·u·Δt/Δx. At u = 1 m/s and Δt = 20 ms it is 0.35 at 10 cm cells, 3.5 at 1 cm and 6.9 at 5 mm, against a low-Mach limit of 0.3 (FACT: fs-lbm). Holding Ma = 0.1 at 5 mm needs Δt ≤ 0.29 ms, 70 fluid steps per control tick. The relaxation time is τ = 3·ν·Δt/Δx² + ½; for water at 10 cm cells and 20 ms steps τ − ½ = 6 × 10⁻⁶, where a single-relaxation scheme is not stable.
  • Survives. Payload slosh as one to three sprung masses per axis F (§19.10.4; KILL-SLOSH). A 2.5-dimensional advected film field F (§19.10.3; KILL-ADVECT). A lattice fluid only inside an M island, as an offline oracle.

19. Symplectic claims beyond a free rigid body

  • Strong form. The variational integrator is symplectic for the articulated robot, and its energy figures carry over.
  • Refutation. The four steps of the trapezoidal scheme are derived for one rigid body. On an articulated tree the mass matrix depends on configuration and a kick–drift splitting is no longer the variational step. Dissipative contact impulses end energy conservation by design. The published energy figures are for one body.
  • Survives. C-36 F in the referee and the strict profile, with the free body and the heavy top as oracles and no symplectic claim for a tree (§16.7; KILL-VARIATIONAL). Energy is audited by the ledger, not assumed (§16.10, §29.9).

20. Refusing simultaneous multi-foot impacts

  • Strong form. Treat simultaneous impacts as ill-posed and refuse them.
  • Refutation. Trot, bound and pronk put two or four feet down at one instant by symmetry. A refusal removes the gaits that the gait analysis exists to find.
  • Survives. One coupled impulse solve per island, never an imposed order (§16.5). For orbit derivatives a simultaneous group is split by ±δ and the one-sided Jacobians are compared (§22.9.4; ADR-REFLEX-05).

21. Curvature as a roller-misalignment test

  • Strong form. Spanning curvature of the mechanical connection certifies, at preflight, that an omnidirectional base is correctly assembled.
  • Refutation. Hand-checkable: a mecanum base assembled with all four roller axes parallel. The map from body twist to wheel rates drops from rank 3 to rank 2, and the growth vector is (2, 3) where an omnidirectional base has (3). The missing direction is still reached by a bracket, exactly as on a differential drive, so the curvature test passes the defective base.
  • Survives. The growth vector of A-07 at preflight stage 4 for wheeled and tracked bases. Curvature (A-09, C-08) only for shape-changing kinematic locomotors (§14.11, §28.4).

22. A global lifted linear model for contact-rich predictive control

  • Strong form. One Koopman-style linear model in a lifted space replaces the simulator inside predictive control.
  • Refutation. No finite invariant subspace survives contact switching. DESIGN arithmetic: a quadratic lift of 60 states has C(62, 2) = 1,891 monomials, and a linear operator on them has 1,891² ≈ 3.58 × 10⁶ coefficients to identify.
  • Survives. Parked (C.1.3). At most one bounded experiment on a single soil regime.

23. Gradients through everything

  • Strong form. Differentiate scenes and whole rollouts end to end and search by gradient, for a factor of 150.
  • Refutation. The gradient of a binary failure outcome is zero almost everywhere. The proposal's own step counts give a factor of 2.54, not 150. Incumbents already differentiate, with bias through contact.
  • Survives. Derivatives with validity labels on regular segments and return maps (C-16). Paired finite differences over short horizons (§17.13; KILL-FDGRAD). Gradients through contact are deferred to M6 (D-8).

24. Runtime composition wrappers around the step

  • Strong form. Compose robot modules at run time through higher-categorical wrappers.
  • Refutation. Contacts on different limbs couple through the base in one contact operator, so a simultaneous multi-foot solve does not factor along module boundaries. A run-time wrapper also breaks the fixed data layout that batched kernels need.
  • Survives. Composition over typed ports, lowered at compile time and kept to one data structure and five functors (C-12; §14.6, §14.9).

25. The entropy balance as printed, with entropy as the state of a lumped thermal node

  • Strong form. Carry entropy as the state of each thermal node and add a separate irreversible production term.
  • Refutation. The terms already present are the irreversible production, so the added term counts it twice.
  • Survives. One thermal node with temperature as its state. Stored heat is a store and not a loss on the ledger (C-38; §15.5, §15.11).

C.2.4 Control, learning and transfer

26. Sampling control as a stand-in evaluator for a trained policy (H-01, NARROWED)

  • Strong form. Sampling-based predictive control, with the batched simulator as its model, completes tasks for at least 80% of well-formed designs with no training and serves as the acceptance evaluator.
  • Refutation. DESIGN arithmetic on the smallest published setting (30 samples, 3 iterations, a 0.9 s horizon at 2 ms, 50 Hz): one simulated second costs 30 × 3 × 450 × 50 = 2.0 M world-steps against 500 for a policy, a factor of 4 × 10³. A battery of 256 twenty-second episodes takes about 86 minutes of a device at 2.0 M world-steps/s, against 1.3 s. As acceptance evidence, bounding a failure rate at 1% with 95% confidence needs 299 clean episodes: about 99 GPU-minutes per quadruped design at 0.33 GPU-minute each, against under 10 for training once.
  • Survives. A screening rung of three episodes per design by default (a paired screening comparison may use up to the break-even count, about 30 for the quadruped setting and 60 for the humanoid at a 20 ms planning step), an out-of-distribution fallback and a source of demonstrations (§22.8; GATE-REFLEX-06; KILL-MPC; BET-27). The cost is about 0.33 and 1 GPU-minutes per 20 s episode at a 20 ms planning step and about 1.7 and 5.2 at 4 ms. A request to cite it as acceptance evidence for a trained policy is refused (FROB-REF-817); where it is the delivered controller, its own episodes are admitted under a frozen planner record.

27. One universal policy (H-02, NARROWED)

  • Strong form. One pretrained, design-conditioned policy walks any unseen design with no adaptation at 70% of specialist return, and reaches specialist return in 10% of from-scratch steps.
  • Refutation. FACT (published results): across topology-diverse designs, held-out robots score 1,489.6 against 4,030.6 on familiar ones, 37%; one test morphology scores 136.82 with no adaptation against 1,406.58 from scratch, about 10%; fine-tuning gains two to three times. The results that reach 85 to 97% used about 5 days on 160 GPUs, 19,200 GPU-hours, which is 400 days on two RTX 4090.
  • Survives. Family policies per morphology class, on flat or mildly varied ground with fixed actuation: 70 to 85% of specialist return with no adaptation, and fine-tuning at about 2 to 25% of a from-scratch run stopped at matched return. On interior terrain within a class there is no published figure. Out-of-class designs are declined (§23.11; GATE-CORTEX-11; KILL-FAMILY; BET-15).

28. Policy inheritance for any edit (H-21, NARROWED)

  • Strong form. A child design reaches specialist return from its parent's policy in at most 20% of from-scratch steps for parameter edits and 50% for single-limb topology edits, along chains of any length.
  • Refutation. FACT (published transfer results): single-limb topology edits cost 33 to 100% of from-scratch steps and show no gain on flat terrain, and chained inheritance loses plasticity.
  • Survives. Inheritance for parameter edits, as the default once it has beaten an early-stopped from-scratch control for the edit class. Transfer from a class prior costs about 2 to 25% of such a run; the one published parent-to-child figure is about 50%; no source measures a small typed parameter edit. Resets follow a measured regression of an audit twin, with a depth schedule as fallback (§23.12; GATE-CORTEX-13; KILL-INHERIT; BET-16).

29. A geometric-algebra tree policy as a source of sample efficiency (H-24, NARROWED)

  • Strong form. Link tokens with multivector features and message passing on the kinematic tree beat a plain morphology transformer by at least 1.3 in sample efficiency at equal parameters.
  • Refutation. FACT: geometric-algebra layers ran 1.4 to 7.5 times slower per epoch in published work, so equal parameters is not equal compute. No locomotion evidence exists, and the expected gain is 0 to 1.3. A factor of 1.3 on an amortized pretraining run is not a source of the ten-fold.
  • Survives. Invariance to heading and to description conventions through canonical inputs and augmentation (C-21; §23.11). The tree policy as an M three-arm experiment with the plain transformer as control (§23.14; KILL-GATREE).

30. Gait continuation at one percent of a training run (H-05, NARROWED)

  • Strong form. Continuation of a hybrid periodic orbit carries a stable gait across design changes at no more than 1% of a training run per design point, and yields a controller.
  • Refutation. FACT: published full-order orbit solves take about 4 to 260 s of CPU at 20 to 68 states. DESIGN arithmetic: that is 2% to 108% of a four-minute training run, and 1% to 63% of the 410 s figure. The result is a nominal orbit on regular ground, not a controller the referee accepts.
  • Survives. A gait-orbit analysis with continuation in design parameters, labeled screening (§22.9; GATE-GAIT-03; KILL-GAIT; BET-26).

31. Proof-guided control for full-order legged robots (H-20, NARROWED)

  • Strong form. Sum-of-squares funnels, hybrid-zero-dynamics gaits and barrier shields with checked certificates yield deployable safety filters for real designs.
  • Refutation. FACT (sibling code): the semidefinite solver costs O(N⁴) for an N × N Gram block, and its largest region-of-attraction example has two states. Certificates exist for templates of about 4 to 12 states, and a template proof is not a fact about a robot.
  • Survives. An energy-budget tier and reduced-order barrier filters whose margin is measured statistically, class Tested (§22.11, §22.12; KILL-ENERGY, KILL-SHIELD; BET-25). The word "deployable" is not used, and every export carries the no-authorization flags.

32. The clairvoyant barrier condition, and two closed forms for shields

  • Strong form. (a) Robust invariance from "for every disturbance w there is an input u". (b) The smallest friction cone suffices for every force. (c) A closed-form projection for a single-row filter.
  • Refutation. (a) If safety needs u = d with d ∈ {−1, +1}, each pointwise problem is feasible and no one input serves both. (b) An infimum over a smaller set is larger, so the cone at μ_min is optimistic for forces the environment applies. (c) With u_π = (1, 0), the box [0, 1]² and the row u₁ + u₂ ≥ 1.5, the formula returns (1.25, 0.25), outside the box; clipping gives (1, 0.25), which violates the row; the optimum is (1, 0.5).
  • Survives. The order ∃u ∀(w, e) over the belief set (C-31). Split cones: the inner cone at μ_min for forces the robot commands, the outer cone for forces the environment may apply. The breakpoint method for one row, and projected Newton with a KKT check after the fact otherwise (§22.12; GATE-SHIELD-02).

C.2.5 Search, statistics and decision rules

33. Exact reuse after a geometry edit (H-09, REFUTED for exact reuse)

  • Strong form. Dependency tracking lets a typical single-parameter edit reuse at least 70% of prior evaluation work.
  • Refutation. At least 90% of per-design compute is rollouts and training (FACT: training takes 4 to 20 minutes per design; a cold kernel compile is about 96 s once per machine and under 1 s cached). The mass matrix, bias forces and contact Jacobians enter every step, so no rollout is reusable bit for bit after a mass or geometry edit. Exact reuse weighted by compute is at most about 10%, below the hypothesis's own falsifier of 30%.
  • Survives. A memo graph for analyses, step plans, kernels and scene compiles (§28.14). Dependency-directed revalidation, which says which verdicts survive an edit (§28.13; result.revalidate; GATE-ATEL-11; KILL-REUSE; BET-33). Training avoided by a warm start is a different quantity: it belongs to inheritance (H-21) and is counted once, in its own column of the reuse ledger (§28.26).

34. Verdict reuse by sensitivity margin

  • Strong form. Inherit a verdict across an edit when a sensitivity estimate says the metric moved less than the decision margin, for savings beyond a cache.
  • Refutation. FACT (executed pilot): a correctly keyed dependency graph matched the semantic rule saving for saving, three pair evaluations and two reductions each, and omitting one dependency returned a stale promotion. No certificate bounds how an edit moves a rollout statistic through contact.
  • Survives. Reuse keyed by dependency, with polarity where a proof rule supplies it (C-18; §25.8). One false reuse removes the rule (KILL-AUGUR-REUSE).

35. Joint paving of high-dimensional design boxes (H-06, NARROWED)

  • Strong form. Interval and Taylor-model evaluation decides at least half the volume of a 10- to 20-dimensional design box without simulation, within 10⁴ boxes.
  • Refutation. DESIGN arithmetic: 10⁴ boxes are log₂ 10⁴ = 13.3 bisections, less than one cut per axis in 20 dimensions. Uniform boxes keep a side of 2^(−13.3/20) = 0.63 of the domain, and 0.40 in 10 dimensions, so a constraint surface that depends on most parameters crosses nearly every box. FACT: a published three-dimensional workspace paving ran about five hours and left an error bound of up to a third of the certified volume.
  • Survives. Certificates per constraint, with bisection confined to a split set of about six parameters and the rest enclosed at full range, combined by products, monotonicity and witnesses (C-32; §25.6, §25.34; KILL-AUGUR-REGION; BET-20).

36. A rare-event engine with bounds from splitting (H-07, NARROWED)

  • Strong form. Multilevel splitting or adaptive importance sampling estimates a failure probability of 10⁻⁵ with a hundredth of the episodes and valid confidence bounds.
  • Refutation. DESIGN arithmetic: a zero-failure 95% bound at 10⁻⁵ needs ln(20)/10⁻⁵ ≈ 3.0 × 10⁵ nominal episodes. FACT: the measured gains in the sources read are 2 to 20 times in one driving study and about 5 times in mean-square error on one policy-in-the-loop task; 10 to 100 times at 10⁻⁴ to 10⁻⁵ is a TARGET. A splitting estimate with adaptive levels, though unbiased, carries no finite-sample confidence bound.
  • Survives. Crude sampling certifies absence. Bounded-weight importance sampling refutes a target and tightens an estimate once failures are observed, and never certifies absence more cheaply than crude sampling. Splitting and tilting explore (C-27; §26.9; KILL-RARE; BET-32).

37. Extreme-value extrapolation, and a defensive mixture as the certified bound

  • Strong form. Certify a 10⁻⁶ tail by fitting an extreme-value law, or by importance sampling from a defensive mixture.
  • Refutation. DESIGN arithmetic: checking a fitted tail at 10⁻⁶ takes the same ln(20)/10⁻⁶ ≈ 3 × 10⁶ nominal episodes that certify directly. A defensive mixture with nominal share β has a floor of ln(1/δ)/(β·n), never below crude sampling on that share.
  • Survives. Crude and bounded-weight bounds. The defensive mixture as a lower bound for refutation only (DC-04).

38. A single top cause from forks taken just before the failure (H-08, NARROWED)

  • Strong form. Restoring a snapshot just before a failure and applying single-factor interventions, design parameters included, names the cause with at least 90% accuracy.
  • Refutation. Contact dynamics amplify small differences (FACT: a published perturbation of 5 × 10⁻⁴ degree diverges within 50 steps), so a top factor can change under a perturbation at round-off scale. A design parameter changed a moment before failure leaves the history unchanged (winding temperature, the policy's own training), which is a different question from whether that design would have failed. A coalition value can be negative and cannot establish necessity.
  • Survives. Interventional contrasts with a flip rate and a placebo fork. Design-parameter interventions re-run from the episode start. Double precision is the default for one failure; single precision on the originating tier is admitted by a measured rule for fork windows up to about 1 s (§27.5 to §27.9, §27.19; GATE-AUTOPSY-03; KILL-AUTOPSY; BET-23).

39. Value of information as a selection lever (H-10, NARROWED)

  • Strong form. Choosing each experiment by expected information gain cuts the simulations to a decision by at least three, against experiments an agent chooses.
  • Refutation. FACT (best-arm identification results): stopping and elimination save 2 to 5 when candidates are separated and about nothing otherwise. Selection by information gain against a capable agent is unsupported and plausibly below 1.5.
  • Survives. Value of information as a stop rule and a budget allocator at the finalist stage, and for choosing measurements (C-39; §28.16; GATE-ATEL-15; KILL-VOI).

40. Rank fidelity assumed between rungs (H-22a and H-22b, both ACTIVE and unmeasured)

  • Strong form. A shared policy on the fast tier ranks designs as trained specialists on the referee do, at Kendall τ ≥ 0.7 near the top, so under one design in twenty needs training; and paired evaluation needs at most a fifth of the expensive samples.
  • Refutation. FACT: no published rank agreement of this kind was found; the nearest figures are rank correlations of 0.40 overall and 0.4 to 0.8. DESIGN arithmetic: a control variate saves 1/(1 − ρ²), which is 2.0 at ρ = 0.7, 5.3 at 0.9 and 10.3 at 0.95, so a fifth of the samples needs ρ ≥ 0.89.
  • Survives. The rank-agreement experiment decides, and it reports containment and regret beside τ. A cheap rung selects at τ ≥ 0.7 with the winner check passed, discards only between 0.5 and 0.7, and may do neither below 0.5 or with no record (C-26; §16.9, §23.28, §28.10; GATE-ATEL-07; KILL-RANK; BET-17).

41. A family per dispatch, with long-horizon finite-difference gradients (H-23, NARROWED)

  • Strong form. Evaluating a neighbourhood of designs in one batch under a shared policy cuts agent rounds by at least five, and paired finite differences give usable design gradients over whole episodes.
  • Refutation. FACT: measured compute gains of published population methods are about 3 to 4. Paired differences lose their pairing once trajectories diverge through contact (entry 38), so the gradient is unproven beyond short horizons and smooth metrics.
  • Survives. Families per dispatch, and short-horizon paired differences as a sensitivity report (§17.12, §17.13; KILL-FDGRAD).

42. Topology as data, as a capability claim (H-03, NARROWED)

  • Strong form. One compiled kernel simulates different trees in one batch at no more than twice the per-world cost of a specialized kernel, as a capability no incumbent has.
  • Refutation. FACT: one incumbent solver publishes a mixed batch of three body plans at 0.86 of the harmonic mean of its homogeneous rates (about 86 thousand samples per second against about 100 thousand). DESIGN arithmetic: one batch padded to 64 degrees of freedom costs an 18-degree quadruped 64/18 = 3.6 on linear stages, 12.6 on quadratic ones and 45 on a dense cubic factor; and 256 designs × 2,048 rollouts at about 60 kB per padded world is 31 GB, above a 24 GB card.
  • Survives. Per-world model variants inside padded capacities and size buckets, claimed only as two measured numbers and one property (run-to-run replay and forks inside the mixed batch) from a head-to-head with a per-family-template control arm (§17.5, §17.14; GATE-PHYLUM-03; KILL-PHYLUM; BET-18).

43. Requirements replace rewards (H-13, NARROWED)

  • Strong form. Temporal-logic requirements with a smoothed robustness score serve as the training signal with no loss, and cut reward exploitation to 0.1% or less.
  • Refutation. FACT: the published successes need subgoal decomposition or added terms, and the 0.1% figure was unsupported and withdrawn. A minimum over predicates in mixed units is not a margin until each is normalized.
  • Survives. Bounded-time requirements over unit-normalized predicates as the acceptance metric and the falsification score; training keeps reward terms (C-30; §24.5, §24.6; KILL-SPEC-REWARD; BET-24).

44. A fixed-n rule with an unreachable verdict, and a speed test with no power

  • Strong form. A frozen four-verdict comparison rule at 64 pairs; a speed test read as evidence against a ten-fold.
  • Refutation. FACT (executed enumeration): of the 2,145 count pairs reachable at n = 64, 521 promote, 521 are inferior, 1,103 are inconclusive and none is a practical tie; the first tie appears at n = 86. FACT (executed pilot): shared overhead bounded the speed test near 1.46, so a failure to show ten was guaranteed.
  • Survives. A pre-analysis of which verdicts are reachable at the declared n (eval.preanalyze; §24.12; GATE-ARENA-05, GATE-ATEL-06). The ceiling 1/(1 − f + f/r + h) is recorded before any speed comparison, and a comparison whose ceiling is below its claim is refused (GATE-AUGUR-14).

45. Methods considered for one decision core and rejected. Each was weighed against a named core of §28.19 and is not built; §28.19.4 holds the full list.

Method Core Why it is not built Used instead
Bandit allocation (upper confidence bounds, posterior sampling) DC-02, DC-09 Regret is the wrong objective for identifying the best design; on dispatch it is a second controller on shared telemetry The fixed halving table, and the conformal ladder where rank agreement licenses it
Expected information gain DC-05 It buys knowledge that cannot change the choice Value of information per cost, as a stop rule
Gaussian-process surrogates over designs DC-02, DC-05 No validated kernel exists on typed designs of varying topology fs-bo on continuous sub-problems only
Kernel two-sample and optimal-transport drift tests DC-07 No power at twenty scalar residuals A conformal band with an exchangeability alarm
Mechanism design for the queue DC-09 Estimates come from the system, not from agents Size classes with preemption and resume
Replicated consensus, gossip membership, escrow counters DC-09 One daemon per host; nothing is replicated A single-writer job ledger
A learned correction of the fast tier, or a learned step surrogate as a screen DC-01, DC-02 It hides the artifacts the trust ladder exists to expose Paired tier correction on referee episodes that were run
Adaptive-fidelity stopping as the decision DC-01, DC-02 Stopping a pair early on cheap labels does not compute the sealed fixed-n decision Kept as a scheduling heuristic that orders work
Coalition-value attribution as the primary output DC-06 Values can be negative and cannot establish necessity Interventional contrasts, with a budgeted summary

46. Unconstrained zero-sum adversarial worlds

  • Strong form. Search or train an adversary over worlds with no constraint beyond the robot's failure.
  • Refutation. The adversary wins with worlds no robot could solve, which says nothing about the design.
  • Survives. Search inside a legality set, with a solvability oracle and a witness for every reported world (§26.3, §26.5; GATE-NEMESIS-02).

C.2.6 Algebra, synthesis, proofs and certificates

47. Continuation on the GPU, with root certificates checked inside a proof kernel

  • Strong form. Track homotopy paths on the GPU and certify thousands of roots by α-theory inside a proof kernel in half a second.
  • Refutation. Path tracking needs double precision and Metal has none. FACT (literature): the nine-point four-bar problem has 1,442 cognate triples, 3 × 1,442 = 4,326 solutions, found among 286,720 paths of the best multihomogeneous homotopy, and that one-time solve was priced at zero. Exact arithmetic on thousands of roots inside a proof kernel in half a second has no basis, and an α-test proves a nearby nonsingular root and nothing about completeness.
  • Survives. The CPU lane M: double precision, a monodromy start with a trace test, and the α-test α(f, z) < (13 − 3√17)/4 ≈ 0.157671 evaluated by the exact rational checker outside any proof kernel, with the labels Complete and Partial (C-34; §25.21.4; GATE-AUGUR-22; KILL-SYNTH-CONT).

48. Quaternionic irreducibles

  • Strong form. Equivariant layers must implement the real, complex and quaternionic types of irreducible representation.
  • Refutation. The type is read from the Frobenius–Schur indicator ι(χ) = |Γ|⁻¹·Σ_g χ(g²), and quaternionic type means ι = −1. The smallest group with such a representation is the quaternion group of order 8, whose two-dimensional character gives (2 + 2 + 6·(−2))/8 = −1; it is not a point group. Every irreducible of C₂, C₂ × C₂, the dihedral groups and S₄ is of real type, and Cₙ with n ≥ 3 adds complex type only: for C₃, (1 + ω² + ω)/3 = 0.
  • Survives. Real and complex blocks only (§13.5; ADR-MARROW-07). A quaternionic constituent is refused (FROB-REF-214), because meeting one means the group computation is wrong.

49. "Reynolds averaging mishandles complex irreducibles"

  • Strong form. Typed irreducible blocks correct an error that Reynolds averaging makes on complex-type representations.
  • Refutation. The Reynolds operator W ↦ |Γ|⁻¹·Σ_g ρ_out(g)·W·ρ_in(g)⁻¹ is the exact projector onto the equivariant maps for any real representation. It is more expensive, not wrong.
  • Survives. The blocks as a parameterization, with the Reynolds operator kept as their test oracle (§13.5; GATE-MARROW-04; KILL-MARROW-BLOCKS).

50. Ornamental labels

  • Strong form. Mechanisms named as decorated cospans, a sub-PROP, Futamura projections, Pearl-causal models, Wasserstein robustness, cellular sheaves or conformal geometric algebra; max-plus cycle means to balance two machines.
  • Refutation. D-2 binds vocabulary: a term from a richer theory is used only where a theorem of that theory is used. In each case no such theorem was invoked, and the mechanism underneath is an ordinary one.
  • Survives. Each mechanism under its plain name: composition over typed ports (C-12), build-time partial evaluation (C-14), interventions on a forkable simulator (C-29), a worst case over a bounded set (C-17), a least-squares pose graph (§20.14), primitive intersection tests (§18.3), a role table for two machines (§21.17).

51. "Proved once at M1"

  • Strong form. The soundness theorems of the proof layer are proved once at M1 and reused. The obligations include identical trajectories under a quotient, equivalence of fixed-point firmware, and a quantified barrier condition for high-dimensional dynamics.
  • Refutation. FACT (sibling code): the proof tool implements a decision-tree tactic and linear integer arithmetic; its other tactics are type stubs, and the library modules on Lie groups, matrix exponentials and representation theory are blocked. The listed obligations are not statements those checkers can decide, and no route to the theorems without tactics was given.
  • Survives. Four evidence classes, with instance certificates checked in exact arithmetic (§12.2, §12.4). Reflection as an F pilot at M5 (GATE-LEMMA-05; KILL-REFLECT). The limits stated in §12.5. The word "verified" is not used for results.

52. From mission to design by solving, at whole-robot scale (H-17, NARROWED)

  • Strong form. Polynomial synthesis returns all real branches of a whole-robot design problem, and three solvers produce candidate designs for a mission in minutes.
  • Refutation. FACT (sibling code): the exact real solver is capped at 8 variables, 64 equations, degree 256 and 4,096-bit coefficients, on zero-dimensional ideals only, and no sibling has a homotopy solver. The nine-point problem of entry 47 alone has 4,326 solutions.
  • Survives. A bounded exact lane F (KILL-SYNTH-LINKAGE). Trajectory optimization with design variables as local refinement: about 12 degrees of freedom, up to 17 parameters, 4 to 10 minutes (KILL-SYNTH-TRAJOPT). Monotone co-design for actuator, battery and compute selection, with no measured timing. Continuation M on the CPU (§25.21). The pass rate of synthesized designs under independent closed-loop evaluation is unknown, so every synthesized candidate passes the ordinary ladder.

53. Posynomial feasibility by integer-linear arithmetic, and sampling only inside a certified inner ellipsoid

  • Strong form. The substitution y = ln θ makes posynomial constraints linear, so an integer-linear decision procedure settles feasibility; and candidates are sampled only inside a certified inner ellipsoid, for a seventy-fold yield.
  • Refutation. The logarithm of a posynomial is a log-sum-exp, which is convex and not linear, and the procedure is integer-linear. An inner ellipsoid cuts off the feasibility boundary, where optima sit, and misses disconnected components.
  • Survives. Monomial screens and proved interval exclusion boxes; certificate-backed local boxes, with the unresolved remainder reported (§25.6, §25.7).

54. Topological and exact reachability proofs over contact modes

  • Strong form. A Conley-index or cylindrical-decomposition argument proves reachability across all contact modes.
  • Refutation. DESIGN arithmetic: k contacts with three states have 3ᵏ strata, 81 for four feet, and cylindrical decomposition is doubly exponential beyond four or five variables.
  • Survives. Mode strata counted up to symmetry: (3⁴ + 3·3²)/4 = 27 for four feet under C₂ × C₂ (§13.6). Max-plus timing for schedules (C-10).

55. A probability bound for runtime monitors, "valid under shift"

  • Strong form. Breach probability is bounded by r_breach·δ₁ + r_alarm·δ₂ + δ₃ over 14 strata, and the bound survives distribution shift.
  • Refutation. The first term counts breaches twice. A monitor cannot label its own silent breaches. The strata number 27 (entry 54), not 14. A shift moves δ₁.
  • Survives. A conditional bound with breach labels that are independent of the monitor, and shifted worlds reported separately (§22.12; GATE-SHIELD-03).

56. A new family query as a capability, and a faster solver as the lever

  • Strong form. Family certificates and minimum-tag queries are a capability no existing tool has, and a specialized solver for them gives a ten-fold decision.
  • Refutation. FACT (executed pilots): standard exact methods (projection, Fourier–Motzkin elimination, satisfiability modulo theories, belief-game elimination) returned the same complete answers on every fixture. A specialized solver measured 1.345 warm and 1.088 cold against a composed one, and its batch held a residual of 575.7 µs that the solver does not touch (parsing, assembly, checking, serialization and harness, not separately timed), so no solver could have shown more than about 1.46 (842.8 ÷ 575.7).
  • Survives. The query is kept where deriving the abstraction from a rich plant is cheaper than an expert doing it by hand. A tie with the generic comparator ships the generic method behind the same verbs (§25.22; KILL-AUGUR-TIE, KILL-FAMILYCERT; BET-14, BET-19).

C.2.7 Reality, structure and the thesis

57. Conformal reality bands for designs that were never built (H-14, NARROWED)

  • Strong form. With 20 paired real episodes, split-conformal bands reach nominal coverage on held-out real episodes for a robot class.
  • Refutation. Coverage is marginal and holds only inside the exchangeable set that was calibrated. DESIGN arithmetic: at n = 20 and 90% nominal, realized coverage is distributed as Beta(19, 2), with a standard deviation of 6.3 points; at n = 200 it is Beta(181, 20), with 2.1 points. Nothing follows for a design with no calibration data.
  • Survives. Bands per calibrated cell, one robot and one task family, and a refusal elsewhere (§30.12; GATE-GROUND-06, GATE-GROUND-07; KILL-BAND; BET-28).

58. Generative structure as a decision-time lever (H-12, DEFERRED)

  • Strong form. Topology optimization on telemetry load spectra yields links at least 15% lighter and counts toward the ten-fold.
  • Refutation. FACT (published results): links 7 to 30% lighter than engineered baselines, which is 2 to 8% of robot mass on the one quadruped with a published mass breakdown, at CPU-hours for 12 to 20 links. It improves the built object and shortens no decision.
  • Survives. Foundry as an output-quality subsystem, outside the thesis of §2; its beam rung also runs inside screening as a validity check on declared link walls (§31.2, §31.7, §31.23; KILL-TOPOPT; BET-29).

59. Engine speed alone, and information alone (H-18, ACTIVE)

  • Strong form. Either a faster step delivers the ten-fold, or the engine does not matter and information is the whole lever.
  • Refutation. DESIGN arithmetic on published shares: an infinitely fast step speeds training by at most 1/(1 − s), which is 7.7 at a step share of 87% and 1.4 at 29%. With one design per agent turn and 300 s of training the ratio is at most (300 + t)/t, 3.5 to 6 for t between 120 and 60 s. No instrumented design session exists. Where every candidate is trained, training is about 96% of an illustrative campaign, so the engine must hold parity; once controller acquisition is amortized, agent turns are about two thirds of elapsed time. Which regime a mission is in is a measurement.
  • Survives. Throughput as a parity requirement (§36.3; KILL-PARITY). The levers of §2.4. A ten-fold test that measures decisions, with a phase ledger (§39).

C.2.8 Claims, wording and process

60. Headline multipliers

  • Strong form. Campaign ratios of 10, 16, 12 and 10; "90 to 99% of futile simulations deleted"; a quotient factor of 29.96; a lifecycle factor of 1,800; an orbit search 3,000 times faster than training.
  • Refutation. FACT (recomputation in the planning record): the four ratios are 9.79, 6.41, 11.6 and 5 on their own fixtures, and the 11.6 falls to 2.0 with a mirror symmetry only. DESIGN arithmetic: 29.96 = 735,471/24,546 is a property of one ballast fixture, and the factor is 1 in general; the 1,800 counts substeps, not wall time or field life; the orbit figure omitted the per-step Jacobians and was about 65 times optimistic, 37 ms against about 2.4 s for 256 orbits. None is a measurement.
  • Survives. The mechanisms, each with its ceiling stated before any speed test (D-10). No multiplier is printed as a result.

61. Withdrawn differentiators. §1.3 lists sixteen statements of version 0.2 that are withdrawn. The reason in each case is FACT: incumbent documentation at pinned versions (§1.1, §1.2).

Withdrawn claim What contradicts it What is claimed instead
Deterministic GPU replay as such; mixed topologies, determinism and articulated contact together as an incumbent gap Two incumbents document opt-in bitwise run-to-run determinism; one experimental solver documents all three Replay of one world alone on the CPU from its address, bit for bit where class D1 is reached (N6); batch-composition invariance (§35.5)
"The CPU version is a different code base"; one kernel source for several backends, and several tiers, as novelties One kernel compiler emits CPU and CUDA code from one source A CPU twin per kernel with a recorded divergence ledger (§21.13)
Different robot topologies in one GPU batch, as a capability One environment suite and two solvers of one engine document it Two measured numbers from the head-to-head (N11; §17.14)
Electrical and thermal actuator modelling as a novelty Incumbents ship both Cards with provenance, and the thermal-runaway check (§15.7)
"No training needed" for baseline control Published sampling controllers run on incumbent engines, with cost weights chosen per task and robot A baseline synthesized per morphology class, conditional on BET-06 (N7)
Anytime-valid comparison as a novelty of the field Published sequential tests compare policies Those tests applied to paired design comparison on common world addresses (N4)
Apple-GPU support as a first; interior scenes as a novelty; an agent interface to a simulator as such One incumbent lowers to Metal; interior generators and simulator-facing agent servers exist A Metal tier measured against that incumbent (N10); verbs with budgets, provenance and typed refusals (N9)
"Morphology is fixed before the simulator starts"; an impossible inertia "loads without complaint" everywhere State-preserving recompilation exists on the CPU; one incumbent's compiler rejects impossible inertias The latency from an edit to the first GPU step, measured (§17.8)
Any ten-fold that rests on per-step throughput, on sampling control as the evaluator, or on a published ten-fold None is supported (entries 26 and 59) The thesis of §2 as a conjunction, tested in §39

62. Corrected targets and narrative figures

  • Strong form (version 0.2). A quadruped training gate of 15 minutes; a humanoid throughput target presented as parity; 400 k env-steps/s beside a target of 2.0 M world-steps/s; an incumbent loop that teaches an agent its mistake "six hours later".
  • Refutation. FACT: a quadruped joystick policy trains in about 410 s on one RTX 4090, so the 15-minute gate was slower than the incumbent, and incumbents publish about 2.55 M humanoid world-steps/s, about five times the old target. DESIGN arithmetic: 400 k env-steps/s at decimation 10 is 4.0 M world-steps/s, twice the stated 2.0 M. Published loops take about seven minutes for a flat-ground quadruped and under 30 minutes for humanoids.
  • Survives. GATE-CORTEX-05 at no more than 1.25 times the incumbent re-measured on the same card. Throughput parity at 0.67 of the incumbent or better, with KILL-PARITY below 0.33. World-steps and env-steps defined with decimation in §36.2.

63. Posture and process. Items that were proposed as ways of working and are not adopted.

Item Evidence against What the plan does instead
Copying the foundations wholesale FACT: the closure of the multibody crate is 42 crates and about 1.57 million lines of library source; the M1 set is 65 crates and about 2.06 million Consume by path behind the airlock; a worker process as the first fallback; a minimal lifted referee set last (§33.2, §33.14; KILL-FSIM)
Numbers called verified by scripts that are not in the repository FACT: one re-derivation gave 21.1 s where 33.5 s was printed for a thermal limit time Known answers are derived on file in this repository before a gate pins them (§38; Appendix M)
Gates that need hardware a simulator lacks: a real-board timing receipt, bench validation, review panels, real building scans A simulator cannot produce the evidence Import lanes with a recorded no-claim (§30.2, §30.17)
Latency slogans: a zero-millisecond topology stall, sub-millisecond compiles, a preflight budget summed from invented stage budgets None was measured Percentiles at gates: design check under 2 s at the 95th percentile (GATE-ATEL-02); the edit-to-first-step latency measured (§17.8)
Third-party tools used without admission They bypass the admission gates of §33.6 Admission by an INT gate, or not used; the portable GPU layer is recorded as not admitted (§21.19)
A local patch or fork of a sibling in place of a change in its own repository Every sibling is the owner's; a local patch diverges from the sibling's head and does not survive a pin move (§33.8) Upstream work items with fixtures, done in the sibling's repository under its own rules (Appendix F)
Absolute statements about incumbents, and a legality bound with no cited source Documentation at pinned versions contradicts several (§1.2) Quoted documentation only; dimensional norms from cited sources (OPEN-HAB-1)
Hardware and memory figures asserted as fact: compressed buildings, resident-world counts, bandwidths, matrix rates Unmeasured The hardware fingerprint and world-bank gates (GATE-SPARK-07, GATE-HAB-12)
A score given to an idea during ideation, used as evidence A score is not a calculation, a pilot or a measurement Verdicts change only on evidence of those three kinds (§0.8)
Simulated humans as validated agents; markets over designs Unvalidatable; no baseline exists Scripted humans as scene dressing (§19.7; KILL-DRESSING)
Automated generation of bare-metal board support Outside the safety boundary of §37.9 Firmware export M compiles only against interfaces the caller supplies (§31.13)

C.2.9 Index by hypothesis

H-19, that a thin layer over an incumbent engine would do, is ACTIVE and therefore has no entry: it is the composed-incumbent arm of the ten-fold test, and BET-14 and KILL-AUGUR-TIE state what ships if that arm ties. The states below are those of the register as §0.8 prints it. H-04b, H-12b and H-25 to H-29 are ACTIVE and have no entry either; entries 40 and 59 stay as records of what was assumed, although their hypotheses are ACTIVE.

Hypothesis State Entries Hypothesis State Entries
H-01 NARROWED 26 H-13 NARROWED 43
H-02 NARROWED 27 H-14 NARROWED 57
H-03 NARROWED 42 H-15 REFUTED 1
H-04 REFUTED for recursion-only specialization 3 H-16 REFUTED as stated 17, 18
H-05 NARROWED 30 H-17 NARROWED 47, 52
H-06 NARROWED 35 H-18 ACTIVE 59
H-07 NARROWED 36, 37 H-19 ACTIVE none
H-08 NARROWED 38 H-20 NARROWED 31, 32
H-09 REFUTED for exact reuse 33, 34 H-21 NARROWED 28
H-10 NARROWED 39 H-22a, H-22b ACTIVE 40
H-11 NARROWED 13, 14 H-23 NARROWED 41
H-12 DEFERRED 58 H-24 NARROWED 29

C.2.10 Four further entries

These four were proposed late and are recorded so that they are not proposed again. Entries 64 to 66 restate, from a different starting point, mechanisms that entries 24, 22 and 54, and 9 already deflate; entry 67 is new.

64. A module algebra interpreted at run time around the step

  • Strong form. Wrap the running step in a composition layer that is evaluated every step.
  • Refutation. Composition is a compile-time fact about ports. At run time it adds an indirection to every read of a write-dense state, and it cannot express contact coupled through the base (entry 24).
  • Survives. Modules compose at compile time into flat tables (§14.6, C-12).

65. A safety certificate per contact stratum of the full robot, or one lifted-linear predictive model for the whole hybrid system

  • Strong form. Certify safety stratum by stratum, or plan with one lifted linear model across every contact mode.
  • Refutation. DESIGN arithmetic: strata grow as 3ᵏ in the number of contacts k, 81 at four and 531,441 at twelve. A lifted linear model has no representation of an impact jump, and its parameter count grows quadratically in the lifted dimension (entry 22: 1,891² ≈ 3.58 × 10⁶).
  • Survives. The energy budget, reduced-order filters with a measured margin, and small reachable-set tables (§22.11, §22.12).

66. Time-parallel rollouts, and an asynchronous event calendar as the core stepping model

  • Strong form. Integrate in parallel in time with coarse and fine propagators, or advance each world on its own event calendar.
  • Refutation. Contact breaks the agreement between coarse and fine propagators that time-parallel schemes need. Policy and sensor ticks at 50 to 100 Hz bound the lookahead of any calendar in a cluttered interior to 5 to 20 physics steps (entry 9).
  • Survives. The lockstep batched step and the transactional referee (§16.5, §16.6).

67. 64-bit sums accumulated with device atomics on every backend

  • Strong form. Accumulate counts and integer sums on the device with 64-bit atomic adds.
  • Refutation. FACT to recheck (§21.26, re-run by the fingerprint): 64-bit integer atomic add and compare-and-swap are reported absent on Metal, and one backend without them forbids them in a mixed run (§21.6, rule 7). DESIGN arithmetic: a 32-bit count wraps after 2³² increments, which a run at 4 M world-steps/s reaches in 18 minutes if one bin receives every sample.
  • Survives. 32-bit counts with a no-wrap bound checked at plan time and host drains into 64-bit totals; a two-limb reduction in a fixed order for wider sums (§21.26; GATE-SPARK-23).

C.3 Discrepancies found

Every refuting calculation above was recomputed for this appendix. Six figures in the planning record or in other chapters did not follow exactly from their own formulas, and two assignments differed between chapters. None changes a conclusion. Items 2, 3, 4, 6 and 8 have since been corrected in the chapters, as each item now says.

  1. Refinement cost at n = 18 (entry 1). The planning record gives 2.75 for the ratio of refinement cost to factorization cost at n = 18. With k = 6 steps, 9k/n = 3.0. §18.12 prints 3.0 and is correct; §21.20 omits the case.
  2. Step share and its ceiling (entry 59). §2.2 prints a step share of 87%, and §2.3 printed a ceiling of about 7.8. 1/(1 − 0.87) = 7.69; the two agreed only at a share of 87.2%. Corrected: the ceiling is printed as about 7.7 (1/(1 − 0.87)), and the share is re-read from its primary source before §39 cites it.
  3. Overhead share and ceiling of the solver pilot (entries 44 and 56). §2.3 and §2.5 printed an unremovable share of 94%, a measured ratio of 1.345 and a ceiling of 1.46, and 1.345/0.94 is 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 of about 1.46 is 842.8 ÷ 575.7.
  4. Orbit cost as a share of training (entry 30). §0.8 printed "2% to over 100% of the cost of a training run" for solves of 4 to 260 s. That range is against a four-minute run (1.7% to 108%). Corrected: against the 410 s figure used elsewhere in the plan it is about 1% to 63%.
  5. Lattice Mach number (entry 18). The planning record lists 5.2 at 2 mm cells beside 0.35 at 10 cm. At one flow speed of 1 m/s the value at 2 mm is 17.3; 5.2 corresponds to 0.3 m/s. §19.10.1 prints 0.35, 3.5 and 6.9 at one speed and is consistent.
  6. Copy cost of a fork (entry 10). §21.20 printed "about a millisecond" and "a quarter of one batch step" for a copy of 0.25 GB. At the 1,008 GB/s of §36.11, read plus write is 0.49 GB of traffic, about 0.5 ms, an eighth of a 4.1 ms batch step. Corrected to about 0.5 ms.
  7. Milestone of lifecycle compression (C.1.4, item 12). The milestone skeleton lands lifecycle compression with frontier physics at M6; §31.19 records GATE-FOUNDRY-12 and KILL-LIFECYCLE at M8. The register places both at M6 (§40.7), and §43.9 agrees.
  8. Tier of kernel reflection (C.1.2). §12.4 tiers kernel reflection F with a pilot at M5; the foundation rows of §33 marked the same dependency M. Corrected: §33 now carries F, as §12.4 does.