Idea passes
11,119 words8 subsections17 tablesPlan version 1.1
On this page8
This appendix records how the ideas in the plan were generated and winnowed, and where each surviving idea now lives. It adds no design. Section numbers are those of this version. Row numbers in the tables are local to this appendix and are not stable identifiers. Every ratio that a pass claimed for an idea was paper arithmetic and is a HYPOTHESIS as proposed unless the text marks it FACT. Every threshold quoted from a gate or a kill gate is a TARGET owned by the cited section; where this appendix and the gate register (§40) differ, the register governs. Ideas that were refuted or deflated are named in §B.7 and treated, with the refuting calculation, in Appendix C. How the passes were run and in what order is process provenance and is kept in Appendix K.
B.1 The first pass: thirty ideas, five, fifteen
The first pass generated 30 ideas against the brief, thought each through (how it works, how an agent would experience it, how it is built, how it fails), and winnowed them. The ranking criterion was obviously accretive and pragmatic for an agent designing a robot, not mathematical interest. Every survivor is designed into the body of the plan; this section says where. Where a later pass or the verdict register of §0.8 narrowed an idea, the narrowed form is the one stated.
The 30. (1) a trust ladder with promotion and exploitation detectors; (2) a check-before-simulate static analysis suite; (3) a synthesized baseline controller for every design; (4) single-source derived kernels on three backends; (5) teleporting a GPU world to the CPU by address; (6) an energy ledger read from the port structure; (7) anytime-valid design comparison on common random numbers; (8) morphology symmetry detection with equivariant learning; (9) typed edits with lineage diff, blame and bisect; (10) scene splits enforced mechanically; (11) actuator cards with provenance and a co-design closure check; (12) registered predictions with per-agent calibration; (13) a quality-diversity archive of designs; (14) deterministic ray-kernel sensors and stills with pixel inspection; (15) scorecards normalized against a reference robot per class; (16) a structural margin loop from telemetry loads; (17) a gait atlas from symmetry with max-plus timing; (18) a maneuverability index from Lie brackets; (19) a connection-curvature design oracle; (20) import loss reports with physical-consistency repair; (21) a budget estimate before every expensive verb; (22) one verb registry that generates the CLI, the MCP tools and the documentation; (23) a failure taxonomy with first-cause ordering; (24) token-budgeted telemetry summaries; (25) self-contained HTML replays; (26) randomization derived from card uncertainty; (27) certificates bound to kernel hashes; (28) racing optimizers that cancel losers; (29) a behaviour-cloning warm start from the baseline controller; (30) a negative-control registry for every gate.
The best five, best first.
- The trust ladder (§16.8, §23.16; BD-104, BD-112). Fast-tier results are provisional until a sample is
re-run on a higher tier, and policies are re-tested under perturbations that should not matter. Why it wins:
the most damaging failure of a learned-control simulator is a result that is an artifact of the simulator. It
is also the cheapest to guard against, because the referee already exists in FrankenSim and the sample size is
set by a sequential test. Confidence: high. The mechanism is simple, and FrankenSim already states the same
pattern for its surrogates. Since the first pass: promotion compares task decisions as well as state errors
(§35.4); finalists are re-ranked under other contact laws, cones, stiffnesses and steps, and a ranking that
flips is typed
model-conditional(§16.9, A-19); a paired tier correction reports a referee-level estimate (C-25, §29.11); a sampled background referee is F (§16.11). - Check before you simulate (§14.11, §28.4; BD-053 to BD-061). The analyses A-01 to A-26, of which those
marked for
design checkrun inside eight preflight stages in under two seconds (TARGET, GATE-ATEL-02 and GATE-ATEL-05), with repairs as typed edits. Why it wins: it moves the first feedback from the minutes of a training run (FACT, §1.1: about 410 s for a quadruped policy on one RTX 4090 in an incumbent) to seconds, it runs on a CPU with exact arithmetic where possible, it ships at M1 before any GPU work, and it is where the Lie theory visibly earns its place. Confidence: high for sizing, stability, symmetry and collision; medium for how well verdicts predict simulated failure, which BET-05 tests (GATE-ATEL-01, KILL-STATIC). - A baseline controller for every design (§22.3, §22.4; BD-062 to BD-066, BD-113). An estimator and a controller synthesized from the model. Why it wins: without it every design iteration contains a training run, and the loop of NS-06 is impossible. It also supplies demonstrations for warm starts (§23.6, §23.10). Confidence: medium-high for standard layouts, medium for novel ones; BET-06 and KILL-BASELINE handle the miss. Since the first pass: where the baseline is not synthesizable, a sampling controller gives a first behaviour as a screening rung (§22.8), and a family policy per morphology class is F (§23.11).
- Teleport, on single-source kernels (§21.6, §21.7, §29.8; BD-018 to BD-020, BD-102, BD-103). Any GPU world can be re-run on the CPU from its address, and the first differing stage is named. Why it wins: a batched GPU simulator that cannot be debugged cannot be trusted, and counter-based addressing plus a CPU twin make this nearly free once designed in. Confidence: high for teleport; medium for the speed of derived arithmetic, which BET-01 tests and KILL-KIR covers. Narrowed: one kernel source lowered to several backends is prior art in incumbents (FACT, §1.1), so the differentiator claimed is the recorded cross-backend disagreement per kernel; and a teleported world is a bit-exact replay only where class D1 is attained, a tolerance replay otherwise (KILL-D1).
- The energy ledger (§15.11, §29.9; BD-046, BD-068). Every joule attributed to a loss or a store, with the numerical residual on its own line. Why it wins: energy per metre is the figure of merit for a mobile robot, and knowing where the energy went tells an agent what to change. It falls out of the port structure instead of being bolted on. Confidence: high. Since the first pass: the same ledger drives the audit for energy created by the simulator (§16.10).
The next ten.
- Anytime-valid comparison on common random numbers (§28.6; C-15; GB-06; BD-112): an agent can stop as soon as the answer is clear, and pairing by world address does more for sample size than the test itself. It is now one of two declared study types; the other is a fixed-n exact study with a pre-analysis of which verdicts are reachable at that n (§24.12).
- Symmetry as a computed property (C-09; A-03; §13.4; BD-055, BD-117): the group is found, not declared; it gives augmentation, equivariant policies and a metamorphic test of the whole simulator per group element. Narrowed: a morphology has two groups. Closed-loop consumers (augmentation, equivariant policies of §23.13, symmetric controllers of §22.13) use only the observation-preserving subgroup, intersected with the stabilizers of the current payload, terrain and task (D-14). KILL-EQUIV keeps symmetry for augmentation and metamorphic tests if GATE-CORTEX-03 fails.
- Lineage with diff, blame and bisect (§28.7; BD-116): version control for robots, so "which edit broke stairs" has an answer.
- Scene splits enforced mechanically (§19.14; GATE-ARENA-02, GATE-HAB-14): a policy cannot be scored on a scene it trained on, by construction; a mirrored layout or a retrofit variant planted across a split is refused.
- Actuator cards and the closure check (§15.3, A-10, A-11; GB-03; BD-043, BD-056): the mass spiral is decided before simulation, and no actuator constant is invented.
- Registered predictions (§28.17; BD-116): a calibration record per agent, at almost no cost.
- A quality-diversity archive (§28.8, §17.12; BD-116): a map of different good designs instead of one optimum.
- Deterministic ray-kernel sensing and stills (§20.6, §20.9; BD-097, BD-098): depth, lidar and height scans share the physics determinism class, and a vision-capable agent can look and then ask about a pixel.
- Reference-robot scorecards (§24.8; BD-111): every number has a familiar baseline beside it.
- A negative-control registry (§38; GATE-GAUNT-01; BD-072): a gate that nothing can fail is not a gate.
Ideas 16 to 29 are also in the plan, at lower priority or as Frontier items.
| # in the list | Idea | Where it lives now | State |
|---|---|---|---|
| 16 | Structural margin loop from telemetry loads | A-15 (§28.4); Foundry §31.5 to §31.9 | F. It grew into the structure loop of §31, with KILL-LOADS and KILL-TOPOPT |
| 17 | Gait atlas from symmetry with max-plus timing | C-10; A-04; Reflex §22.9 | F. The atlas supplies clocks and seeds; an orbit ranks designs only if GATE-GAIT-03 passes (KILL-GAIT) |
| 18 | Maneuverability index from Lie brackets | C-07; A-07 (§28.4); GB-05 | S |
| 19 | Connection-curvature design oracle | C-08; A-09; Augur §25.19 | F, kinematic locomotors only. Its inverse use is F on kinematic fixtures and M as an atlas, under KILL-AUGUR-PHASE. Its use as a roller-misalignment test is withdrawn (Appendix C) |
| 20 | Import loss reports with physical-consistency repair | Skeleton §14.12; §11.5; NS-07 | S; GATE-SKEL-01 |
| 21 | A budget estimate before every expensive verb | Tether §32.9; sim.estimate (§16.13) |
S; GATE-TETHER-11 |
| 22 | One verb registry that generates CLI, MCP tools and documentation | Tether §32.6, §32.12; Appendix J | S; GATE-TETHER-02 |
| 23 | Failure taxonomy with first-cause ordering | Chronicle §29.10 | S. The ordering is Estimated; a causal statement comes only from a fork (§27) |
| 24 | Token-budgeted telemetry summaries | Chronicle §29.12 | S |
| 25 | Self-contained HTML replays | Sensorium §20.10; Tether §32.15 (telemetry.export-html) |
S; GATE-TETHER-14 |
| 26 | Randomization derived from card uncertainty | Cortex §23.15 | S |
| 27 | Certificates bound to kernel hashes | C-14; Lemma §12.4; Spark §21.5 | F; KILL-LEMMA |
| 28 | Racing optimizers that cancel losers | Atelier §28.8; C-15 | S. Expected saving: two to five times fewer evaluations when candidates are separated and none otherwise (HYPOTHESIS, §28.8) |
| 29 | Behaviour-cloning warm start from the baseline controller | Cortex §23.6, §23.10 | F; KILL-DISTILL, KILL-RESIDUAL |
Of these, (19) remains the most likely to be cut. (16), which the first pass also expected to cut, was instead taken up by four later passes and is now Foundry.
B.2 The wider passes, and how to read them
After the first pass, three further rounds were run, each against a different draft of the plan. In each round several independent passes generated about thirty ideas apiece under one question: what would make this program an order of magnitude better than existing systems at its stated purpose. Each pass winnowed its own list and then examined the others' lists: every idea received its strongest technical objection, and its proposer answered or conceded. Audited reasoning passes checked claims against sibling source code, and the last round executed small exact experiments on a CPU and on both GPU back ends. FACT (Appendix K): nine proposal passes produced about 225 raw entries, which merge into 112 distinct ideas.
Four rules govern how this material is read.
- Convergence is evidence about a problem, not about a mechanism. An idea counts as converged when two or more of the nine passes proposed essentially the same mechanism without sight of each other; the count is the "Passes" column of §B.3. Several converged ideas were cut by every pass that proposed them, and several were refuted by calculation (§B.7).
- No claimed ratio is a result. Outside the executed checks listed in Appendix K, every ratio in the passes was derived on paper. The plan carries such a ratio only as a HYPOTHESIS with its test, and states the ceiling of the benefit before any speed test (§36.5).
- Every idea has one of three dispositions. Placed in the plan at a tier, with a gate and, for F and M, a kill gate with its fallback (§B.3, §B.4); refuted or declined, with what survives (§B.7 and Appendix C); or not yet placed (§B.8).
- The cited section governs. A row here is a pointer. The design, the thresholds and the fallback are in the section it names.
Tally of the 112 (FACT, by count against the chapters): 90 are placed in full or in a narrowed form, some rows below merging several catalogued variants; 13 are refuted or declined outright; 9 are not yet placed.
B.3 Ideas on which independent passes converged
"Passes" is the number of the nine proposal passes that proposed the mechanism. Rows are grouped by theme.
Design language and reuse
| # | Idea | Passes | Mechanism in one line | Where it lives | Tier | Gates, kill gates, bets |
|---|---|---|---|---|---|---|
| 1 | Module substitution contracts | 4 | A robot is a wiring of typed open modules; a compiled module carries its port equations, an assume-and-guarantee summary and a dependency digest, so replacing a limb or an actuator invalidates only what depends on it | Skeleton §14.6 (.fmodule); C-12; Augur §25.21.1 |
S modules and substitution; F reuse of certificates and analyses | GATE-SKEL-06; KILL-SKEL-SUBST. Negative control: two fingers on one bus, where a contract without time correlation prunes a feasible schedule |
| 2 | Canonical design forms and symmetry deduplication | 5 | Put a design in canonical form modulo the group that preserves the whole closed loop, and evaluate one representative per orbit | Marrow §13.6; Phylum §17.11; C-21, C-22; Atelier §28.15 | S orbit representatives; F digest classes | GATE-PHYLUM-01; KILL-QUOTIENT; BET-31 |
Control without per-design training
| # | Idea | Passes | Mechanism in one line | Where it lives | Tier | Gates, kill gates, bets |
|---|---|---|---|---|---|---|
| 3 | Sampling-based predictive control with no training | 2 | At each control tick, sample perturbed command sequences, roll each out on the design's own model inside the batch, and apply the weighted first command | Reflex §22.8 (control.mpc) |
F | GATE-REFLEX-06; KILL-MPC; BET-27. Contested, §B.5 |
| 4 | Family policy conditioned on morphology | 4 | One set of weights per morphology class, with tokens built from the typed design term, so a new design in the class needs little or no training | Cortex §23.11; C-23 | F | GATE-CORTEX-11, -12; KILL-FAMILY; BET-15. Contested, §B.5 |
| 5 | Skill transport through a task-space interface | 2 | A skill commands a task-space wrench or acceleration; per body and contact mode an exact allocation program returns a feasible actuation or a separating infeasibility witness before any training | Reflex §22.10 (.fskill); Augur §25.11; A-24 |
S exact layer; M learned residual | GATE-REFLEX-08, -09; KILL-SKILL, KILL-AUGUR-TRANSPORT |
| 6 | Controller inheritance along typed edits | 3 | Each typed edit declares how frames, actuator roles, sensors and contact roles of the child correspond to the parent's, and the child's policy starts from the parent's through a checked mapping table | Cortex §23.7, §23.12; C-23 | F | GATE-CORTEX-13; KILL-INHERIT; BET-16 |
| 7 | Gait atlas and periodic orbits | 2 | Enumerate the admissible symmetric gait patterns from the group, seed a shooting problem for each, follow the orbit under design changes, and read stability from the full monodromy | Reflex §22.9 (frob-gait); C-10, C-16; A-04 |
F | GATE-GAIT-01, -03; KILL-GAIT; BET-26 |
| 8 | Return-map sensitivities through impacts | 5 | Differentiate a settled periodic gait as a fixed point of its return map, with a saltation matrix at each isolated transverse event, instead of unrolling a rollout | C-16; Reflex §22.9 (gait.gradient) |
F | GATE-GAIT-02: 100 locked cases, with every grazing and fold control labelled or refused |
| 9 | Symmetry-aware control under broken symmetry | 2 | Use only the generators that the current payload, terrain and sensors leave intact, found by intersecting stabilizers, and report each breaker | Marrow §13.4; Reflex §22.13; Cortex §23.13; D-14 | S | GATE-MARROW-03; GATE-REFLEX-07; KILL-EQUIV |
| 10 | Contact-mode graphs | 2 | A small explicit graph of drive, stand and step modes with readiness guards, searched instead of a flat action space | Reflex §22.4 (hybrid class); attainable-wrench cone A-24 | F | GATE-REFLEX-02. Enumeration of modes beyond a small explicit graph is not built |
| 11 | Lie-bracket and geometric-phase motion primitives | 3 | Read reachable directions and displacement per shape cycle from brackets and connection curvature before simulating | C-07, C-08; A-07, A-09 (§28.4); Augur §25.19 | S maneuverability; F curvature on kinematic fixtures; M as an atlas | GATE-AUGUR-20; KILL-AUGUR-PHASE |
Many bodies in one batch, and the two machines
| # | Idea | Passes | Mechanism in one line | Where it lives | Tier | Gates, kill gates, bets |
|---|---|---|---|---|---|---|
| 12 | Many different robots in one launch | 6 | Morphology becomes table data read per world, so a population of different trees steps in one batch with no compile per design. Five designs of the batch unit were proposed: a table-driven interpreter, precompiled limb kernels, ragged operation queues, signature buckets and per-world parameter rows | Phylum §17.3 to §17.8; Spark §21.11; Kinesis §16.6 | S parameter variants; F model variants and design families | GATE-KIN-06; GATE-PHYLUM-02, -03, -04; GATE-SPARK-10; KILL-PHYLUM, KILL-BUCKET, KILL-FAMILYLANE; BET-18. Contested on the unit, §B.5 |
| 13 | Fused per-world step kernel | 3 | One persistent kernel keeps a world's working set in thread-group memory for a whole control interval | Spark §21.18 | M | KILL-MEGA. Contested, §B.5 |
| 14 | The large-memory machine as scene bank, the two cards as trainers | 5 | Hold many resident scenes on the 256 GB machine, train on the two RTX 4090, and move only seeds, weights and receipts | §1.8; Habitat §19.15; Spark §21.17 | S division of labour; F fleet scheduler | GATE-HAB-12; GATE-SPARK-13; KILL-BANK-BREADTH, KILL-FLEET; BET-35 |
| 15 | The two cards as one pipeline | 2 | Split collection and learning, or search and training, across two cards with no link | Spark §21.17; §36.6; Cortex §23.9 | S normalization rule; F sharding | GATE-SPARK-20; GATE-CORTEX-08; KILL-SHARD |
Derivatives and actuator physics
| # | Idea | Passes | Mechanism in one line | Where it lives | Tier | Gates, kill gates, bets |
|---|---|---|---|---|---|---|
| 16 | Derivatives through the contact solve | 3 | Differentiate the converged convex solve by one back-substitution instead of through its iterations | D-8; Kinesis §16.12; Phylum §17.13 (paired differences); NONGOAL-15 | Deferred to M6; paired finite differences F | GATE-PHYLUM-06; KILL-FDGRAD. Contested, §B.5 |
| 17 | Port-Hamiltonian actuator and compliance lane | 2 | Model each actuator element by its energy ports, so passivity and the energy ledger hold by construction | Sinew §15.5, §15.11; C-38 | S | GATE-SINEW-02, -08 |
Worlds and sensing
| # | Idea | Passes | Mechanism in one line | Where it lives | Tier | Gates, kill gates, bets |
|---|---|---|---|---|---|---|
| 18 | Clearance complexes and route-feasibility evidence | 4 | Cells over position and heading with one-sided clearances: a path in the surely-free complex is a witness of fit, a cut of the possibly-free complex is a witness of no fit, and the band between is unresolved |
Habitat §19.11 (.fclear); C-33; A-18; enclosures of §18.3 |
F | GATE-HAB-10; GATE-TRAC-07; KILL-FCLEAR. Contested, §B.5 |
| 19 | Scan or video to a simulation twin | 4 | Ingest a captured place as geometry with a scale label and unknown regions; friction and compliance are never inferred from appearance | Habitat §19.13; Ground §30.14 | F | GATE-HAB-03; GATE-GROUND-08; KILL-INGEST, KILL-ASBUILT |
| 20 | Simulated human co-inhabitants | 2 | Moving people as scripted kinematic actors on route graphs | Habitat §19.3, §19.7; NONGOAL-16 | F, scenario dressing only | No claim rests on them. The claim-bearing form is in Appendix C |
| 21 | Observation-alias impossibility witness | 2 | Two admitted worlds give the same observation transcript up to the decision and require disjoint actions, so every policy on that interface fails; the cheapest separating sensor or rate is returned | Sensorium §20.12; preflight stage 8 (§14.11); Augur §25.10, §25.18; C-19 | S structural and enumerated; F searched | GATE-SENS-09; GATE-AUGUR-10, -19; KILL-ALIAS, KILL-SKEL-ALIAS, KILL-AUGUR-ALIAS, KILL-AUGUR-LABELS. Contested, §B.5 |
| 22 | Sensor placement by task observability | 2 | Score a sensor suite by the observability Gramian of the states the task needs, modulo the gauge, at the declared rates and delays | Sensorium §20.11; C-20; A-17 | S | GATE-SENS-08 |
Safety and proof
| # | Idea | Passes | Mechanism in one line | Where it lives | Tier | Gates, kill gates, bets |
|---|---|---|---|---|---|---|
| 23 | Energy budget at a physical boundary | 2 | Bound the kinetic, drive, external and stored energy that can reach an absorber and compare it with the absorber's measured lower work envelope; the inequality holds for every contact sequence and friction coefficient | Reflex §22.11 (.fenergy); C-31; A-20 |
F | GATE-SHIELD-01; KILL-ENERGY; BET-25 |
| 24 | Reachable-set tables for small hybrid subsystems | 3 | Mode-indexed invariant cells with checked guard and reset inclusions, looked up at run time, with uncovered outside the table |
Reflex §22.12; proof kind tube-inclusion (§12.4) |
M, subsystems of at most four dimensions | GATE-SHIELD-05; KILL-TUBE |
| 25 | Runtime shields | 2 | A minimal-deviation filter on the commanded action under reduced-order barrier rows and box limits, with a verified backup | Reflex §22.12 (frob-shield) |
F | GATE-SHIELD-02, -03, -04; KILL-SHIELD. Contested, §B.5 |
| 26 | Typed product of evidence classes | 2 | A result that rests on a proof and on a test has a product type with no conversion to either factor, so the weakest input governs | §8.2; Lemma §12.2; §37.10 | S | GATE-LEMMA-06; GATE-SAFE-08. Contested on its probability bound, §B.5 |
| 27 | Certificates over families of designs | 3 | Decide a box of designs at once, by a witness that every member satisfies a constraint or a dual witness that none can, in a bundle an independent checker accepts | Augur §25.5, §25.6; C-17, C-32; Lemma §12.4 | F, on small sub-boxes | GATE-AUGUR-05, -09; GATE-LEMMA-04; KILL-AUGUR-REGION, KILL-FAMILYCERT, KILL-AUGUR-FALSECERT; BET-19, BET-20 |
| 28 | Interval and monotone carving of design space | 3 | Evaluate preflight constraints over parameter boxes; monotone maps make corner evaluation exact; bisect into inner, excluded and unresolved boxes | Augur §25.4.6, §25.6, §25.7 | F, per constraint | GATE-AUGUR-08, -09; KILL-AUGUR-REGION. Joint paving of a high-dimensional box is refused (FROB-REF-856, NONGOAL-11) |
| 29 | Model-form robustness and created-energy audit | 3 | Re-evaluate finalists under admissible physics variants and audit per-step work against energy; a ranking that flips is model-conditional and cannot spend build budget |
Kinesis §16.9, §16.10; Cortex §23.16; A-19 (§28.4); Chronicle §29.9 | S | GATE-FID-05, -06; GATE-ATEL-10; GATE-CORTEX-15; GATE-CHRON-08 |
| 30 | Exact linkage synthesis inside the solver's caps | 2 | Solve precision-pose synthesis in exact arithmetic for small zero-dimensional systems and certify circuit, branch and clearance by enclosure | Augur §25.21.3 (frob-synth); C-34 |
F | GATE-AUGUR-17; KILL-SYNTH-LINKAGE |
Search, statistics and failure analysis
| # | Idea | Passes | Mechanism in one line | Where it lives | Tier | Gates, kill gates, bets |
|---|---|---|---|---|---|---|
| 31 | Rare-failure search over worlds with a solvability witness | 6 | Search a legal scene space for failures instead of sampling it, and count a failure only if the candidate's own body could have completed the task | Nemesis §26.3 to §26.9; C-27 | S legality, oracle, guard and bounds; F search | GATE-NEMESIS-01, -02, -04, -05, -06; KILL-NEMESIS, KILL-RARE; BET-32 |
| 32 | Minimal counterexample world | 2 | Shrink a failing world's edit list by delta debugging to a world of few edits that replays bit for bit, labelled 1-minimal under the tested edit relation | Nemesis §26.7 (.fmcw); C-28; Augur §25.9 |
F | GATE-NEMESIS-03; KILL-MCW; BET-22 |
| 33 | Counterfactual branching from a failure snapshot | 7 | Rewind failing worlds to before the first cause, fork a batch of typed interventions on identical random streams, and rank what would have prevented the failure | Autopsy §27; C-29; forks of §29.8 | S | GATE-AUTOPSY-01 to -08; KILL-AUTOPSY; BET-23. Narrowed under cross-examination, §B.5 |
| 34 | Value-of-information fidelity ladder | 4 | Spend the next episode, or the next rung, where it could change a ranking | Atelier §28.9, §28.10, §28.16; C-26, C-39 | S fixed table; F conformal survivors and value of information | GATE-ATEL-07, -08, -15; KILL-RANK, KILL-LADDER, KILL-VOI; BET-17. Its use as a decision procedure is in Appendix C |
| 35 | Cheap referee promotion | 2, on the problem, with two estimators | Report a referee-level estimate from many paired fast-tier episodes and a few referee episodes at the same world addresses | C-25; Kinesis §16.8; Chronicle §29.11 | S | GATE-FID-08; GATE-CHRON-09; KILL-DR. Contested on the estimator, §B.5 |
Outputs and reality
| # | Idea | Passes | Mechanism in one line | Where it lives | Tier | Gates, kill gates, bets |
|---|---|---|---|---|---|---|
| 36 | Build packet | 3 | From a qualified design, export a parts list, geometry, nets, budgets and test vectors, with every hash and the no-authorization flags | Foundry §31.12 (.fbuild) |
F | GATE-FOUNDRY-09, -10; KILL-PACKET |
| 37 | Link topology optimization closed into the loop, with tolerance allocation | 4 | Extract load cases from telemetry, size or optimize each link, write its mass and inertia back into the model, and allocate tolerances by sensitivity | Foundry §31.5 to §31.11; C-35; A-15 | F | GATE-FOUNDRY-01 to -08; KILL-LOADS, KILL-TOPOPT, KILL-FAB, KILL-TOLERANCE; BET-29. Contested, §B.5 |
| 38 | Firmware export for a controller | 3 | Emit a fixed-point controller behind a caller-owned hardware interface, with range proofs and test vectors | Foundry §31.13 | M | GATE-FOUNDRY-11; KILL-FIRMWARE |
| 39 | Lifecycle compression | 3 | Advance slow damage states by averaged macro-steps estimated from short windows on the current gait, keeping rainflow residues between windows | Foundry §31.14 (frob-lifecycle) |
M | GATE-FOUNDRY-12; KILL-LIFECYCLE, KILL-SINEW-AGE |
| 40 | Self-contained replay | 3 | One offline HTML file that replays an episode with its overlays | Sensorium §20.10; Tether §32.15 (telemetry.export-html) |
S | GATE-TETHER-14 |
| 41 | Actuator identification from logs | 4 | Fit actuator parameters and delay from logged commands and encoder traces, actuators first, and store the result as card fields with their joint covariance | Ground §30.9, §30.10 | F | GATE-GROUND-04; KILL-GROUND; BET-28 |
| 42 | Experiments chosen by the decision they could change | 2 | Rank a probe, an excitation or a measurement by the expected change in a decision per unit cost | Ground §30.8; Atelier §28.16; Augur §25.14; C-39 | F | GATE-GROUND-03; GATE-ATEL-15; GATE-AUGUR-11; KILL-VOI, KILL-AUGUR-PROBE |
Studio and measurement
| # | Idea | Passes | Mechanism in one line | Where it lives | Tier | Gates, kill gates, bets |
|---|---|---|---|---|---|---|
| 43 | Requirements as a typed temporal specification | 2 | A mission is temporal logic over unit-normalized signals; its robustness margin is the acceptance metric and may be a reward term | Arena §24.5, §24.6; C-30; Cortex §23.5 | S | GATE-ARENA-03, -09; GATE-CORTEX-10; KILL-SPEC-REWARD; BET-24 |
| 44 | One verb from a specification to a ranked result set | 2 | Compile task, constraints and budget into check, sweep, race and promote, and return typed verdicts | Tether §32.6.2 (solve.run); Atelier §28.11 (opt.cascade) |
F | GATE-ATEL-16; GATE-TETHER-13; KILL-SOLVE |
| 45 | Content-addressed evaluation cache with dependency invalidation | 4 | Cache every result under the identities it read, and recheck only what an edit touches | Atelier §28.13, §28.14; Phylum §17.11; Augur §25.8 | S memo graph and reuse grades 1 and 2; F grade 3 | GATE-ATEL-11, -12; GATE-PHYLUM-05; GATE-AUGUR-12; KILL-REUSE, KILL-AUGUR-REUSE; BET-33. Contested, §B.5 |
| 46 | Ten-fold defined as the cost of an accepted design decision | 5 or more | Measure restricted mean time to an independently accepted answer against the strongest composed rival, with every cost in the denominator | §2.1; §39; the design benchmark of §24.9 | Program rule | BET-13, BET-14; the gates of §39 |
| 47 | Rival audit before any ratio | 2 | Pin incumbent versions and record their strongest warm configuration on this hardware before a denominator is used | §0.7; §36.3; §39 | Program rule | GATE-SPARK-21 |
| 48 | CPU shadow referee | 2 | Idle CPU cores re-run sampled GPU worlds on the referee from snapshots and feed the fidelity ledger | Kinesis §16.11 | F | GATE-FID-07; KILL-SHADOW; BET-34 |
B.4 Ideas placed on the strength of a single pass
Each of these was proposed by one pass, or arose in an audited reasoning pass, and is in the plan because the mechanism is sound at the stated tier. Rows continue the numbering of §B.3.
| # | Idea | Mechanism in one line | Where it lives | Tier | Gates, kill gates, bets |
|---|---|---|---|---|---|
| 49 | Mission-observable quotient | Project a design onto exactly what a mission experiment can observe; designs with equal projections and equal reduced inputs share one run | Phylum §17.11 (the digest); C-22; Atelier §28.15 | F | GATE-PHYLUM-01, on the ballast fixture (FACT by enumeration, §17.18: 735,471 designs fall into 24,546 classes); KILL-QUOTIENT |
| 50 | Algebra applied at campaign time | Use algebra to remove simulations from a campaign (orbits, enumeration, screens with audits), not to shave the step | §2.4; Phylum §17.11; Atelier §28.11, §28.12; C-22 | S audits; F screens | GATE-ATEL-09 (planted winner); GATE-NEMESIS-07; BET-31 |
| 51 | Incremental compilation keyed to typed edits | An edit recompiles only the subterms it touches, and the result equals full compilation bit for bit | Skeleton §14.7 to §14.9 | S | INV-SKEL-02; GATE-SKEL-02. The scene-side half is in §B.8 |
| 52 | Trajectory optimization with design variables | Direct transcription for one motion and a fixed contact schedule, with continuous design parameters among the unknowns; the output is a labelled candidate and never a score | Augur §25.21.2 | F | GATE-AUGUR-18; KILL-SYNTH-TRAJOPT |
| 53 | Limb port interface | A limb acts on its parent through its articulated inertia and bias wrench at the port; the inertia is positive semidefinite, not definite | Skeleton §14.6; Kinesis §16.6 (tree-operator route) | F | PO-SKEL-04; KILL-SKEL-PORT |
| 54 | Contact compaction with a capacity rule | Count, scan and write compaction at fixed capacity per world; an overflow is flagged and never silently clamped | Kinesis §16.6 (K-compact); Traction §18.11 |
S | GATE-KIN-07 |
| 55 | Factor-once response batches | At a converged step, reuse the factor to solve many impulse or wrench interventions on a fixed active set, each column confirmed against residual and mode predicates | Traction §18.5 (contact.response) |
F | KILL-RESPONSE |
| 56 | Tree-structured factorization | Let limbs eliminate independently and couple through the base, with a dense fallback where contact couples them | Kinesis §16.6 (tree-operator route) | F | KILL-TREEOP |
| 57 | Specialized kernels for survivors | Fold one design's constants into the generic kernel only for tournament survivors, bit-identical to the generic kernel | Phylum §17.9; Spark §21.18 | F | GATE-SPARK-14; KILL-SPECIALIZE; NONGOAL-13 |
| 58 | Determinism engineered instead of asserted | Stable-key sort and segmented reduction, per-tick digests, a determinism class on every receipt, and refusal of paired statistics under an uncontrolled class | §35.1 to §35.7; Spark §21.8, §21.15 | S | GATE-SPARK-08, -15, -16, -17; KILL-D1 |
| 59 | Multirate thermal state at power ports | Thermal nodes advance on a slower rational clock and receive the heat accumulated since their last tick | Sinew §15.5, §15.7 | S | GATE-SINEW-05 |
| 60 | Checks at compile time, none at run time | Frames, units and proofs are checked when the model compiles; batched kernels carry no tags and no proof objects | C-02, C-14; Spark §21.7 | S | Its claim as a throughput lever is in Appendix C |
| 61 | Film-friction law and robot-advected films | Friction on a wetted region depends on dwell time, load and pad size; a conservative film field is carried and spread by the robot | Traction §18.8; Habitat §19.10 | S law; F advection | GATE-TRAC-05; GATE-HAB-06, -07; KILL-FILM; BET-36 |
| 62 | Slosh, cords and rugs by reduced models, with coupled islands for finalists | Sprung masses for slosh, chains and hinged plates for cords and rugs; resolved fluid, cloth and rods only beside one world on the CPU referee | Habitat §19.10 | F proxies and slosh; M islands | GATE-HAB-08, -09; KILL-SLOSH, KILL-PROXY, KILL-LIVING |
| 63 | Robot and building retrofit co-design | A priced catalog of scene amendments; find the smallest kit that flips a verdict, checked by the same solvability oracle | Habitat §19.12; NS-18 | F | GATE-HAB-11; KILL-RETROFIT; BET-37 |
| 64 | Sparse brick fields with analytic sharp-edge overlays | A shared pool of distance bricks under a dense directory per scene, with exact overlays for nosings, kerbs and thresholds | Habitat §19.3, §19.4, §19.15 | S | GATE-HAB-01, -13; KILL-POOL |
| 65 | Articulated interior fixtures | Doors, drawers, gates, lifts and carts as articulated models in the scene | Habitat §19.3, §19.7 | S | GATE-HAB-02. Whether idle fixtures sleep is OPEN-KIN-2 |
| 66 | Sustained-duty thermal limits | Winding temperature, resistance rise and the runaway condition decide whether a duty holds for a shift | Sinew §15.7; A-11 | S | GATE-SINEW-05; GATE-AUTOPSY-06 |
| 67 | Discriminating-instrument design | Return the cheapest realizable experiment that separates design decisions, or two indistinguishable worlds that demand different designs; every verdict is conditional on the stated law family | Augur §25.14; C-39 | F | GATE-AUGUR-11; KILL-AUGUR-PROBE |
| 68 | Calibration diagnosis on the sensor graph | A least-squares pose graph over overlapping sensor views; the residual pattern localizes a bad node where the graph permits | Sensorium §20.14 | S | GATE-SENS-11 |
| 69 | Tactile micro-patches | A fingertip pad as a small array of four-dimensional contacts feeding the sensor models | C-37; Traction §18.17 (pilot table) | M | The pilot falsifier of §18.17 |
| 70 | Joint paired-outcome certification | Compile a fixed-controller comparison of two designs into one product system with shared, space-indexed inputs, and close parameter boxes where every compatible branch pair has the same joint outcome | Augur §25.16; C-40 | F | GATE-AUGUR-16; KILL-AUGUR-DOMINANCE. Contested, §B.5 |
| 71 | Schedule and timing-race check | Enumerate orderings of sensor capture, packet arrival, estimator update, watchdog and actuator commit up to commutation, and test the daemon under seeded schedules | Sensorium §20.4.7; Chronicle §29.15 | F | GATE-CHRON-11; KILL-SCHED |
| 72 | Kernel reflection for proof obligations | Checkers proved sound inside the proof kernel discharge instance certificates by evaluation | Lemma §12.1, §12.4 (prove.reflect) |
F | GATE-LEMMA-05; KILL-REFLECT |
| 73 | Max-plus timing | A footfall or task schedule as a max-plus linear system whose eigenvalue is the cycle time | C-10; Marrow §13.1; A-04 | F | The test of C-10: the eigenvalue of a trot schedule equals the stride period computed by hand. The exact-reachability half is in Appendix C |
| 74 | Requirements-to-morphology search with checked cuts | Fill typed holes in a design term by branch and bound, pruning only with a bound that holds for every completion of a node | Augur §25.7 | F | KILL-AUGUR-CUTS: one false cut on the frozen catalog, or under 70% of evaluation cost saved |
| 75 | Monotone co-design over part catalogs | Component selection as a least fixed point over antichains of resources | Augur §25.21.1; C-12; A-10 | S catalog closure; F antichains | GATE-AUGUR-17; KILL-SYNTH-CODESIGN. Contested, §B.5 |
| 76 | Numerical continuation with certified roots | Solve one generic instance, track parameter homotopies, certify each root, and label the result Complete only when a trace test agrees |
Augur §25.21.4; C-34 | M, on the CPU | GATE-AUGUR-22; KILL-SYNTH-CONT |
| 77 | Inverse static-stance family | Return the whole family of allowable stance dimensions and foot ratings for a load hull and a declared actuator authority, typed exact, inner or outer | Augur §25.13; A-08 | S | GATE-AUGUR-02 |
| 78 | Minimal conflicting requirement set | When the predicates conflict with the world family for every design, return a minimal conflicting subset, with its dual certificate where linear | Augur §25.24 (FROB-REF-877) | S | GATE-AUGUR-01 |
| 79 | Mass placement inside a chassis volume | Realize a target pseudo-inertia by nonnegative masses on admissible sites, or return an exclusion | Augur §25.21; §11.5 | F | The known answer of §25.21 |
| 80 | Single-actuator-loss robustness | A rank screen on the remaining wrench map, then a bounded allocation program, for each catalogued removal | Augur §25.21 | F | Static half only; dynamic recovery stays Tested |
| 81 | Symmetry-breaking bifurcations | During continuation, a multiplier that leaves the unit circle in a non-trivial symmetry block is labelled with the broken generator, and the lower-symmetry branch is offered as a seed | Reflex §22.9 | F | GATE-GAIT-01 |
| 82 | Blinded qualification with an error budget across retries | Discovery cannot read confirmation worlds; the i-th confirmation request runs on fresh sealed clusters at level αᵢ = α/[i·(i + 1)] | Arena §24.13; §37.5 | S | GATE-QUAL-01, -02, -03; GATE-SAFE-03; BET-21 |
| 83 | Quality-diversity maps per dispatch | One generation of typed edits, limb additions included, is one mixed batch under the class's family policy | Phylum §17.12; Atelier §28.8 | F | GATE-PHYLUM-08 |
| 84 | Regime-wise comparison report | Cluster paired-episode differences by contact signature and scene region, and name the regimes where a candidate gained or regressed | Atelier §28.5 (explain.compare); A-26 |
S report; F atlas | GATE-ATEL-16; KILL-ATLAS |
| 85 | Gait report by symmetry mode | Project joint trajectories onto the isotypic components of the observation-preserving subgroup and report energy per component | Atelier §28.5 | S | GATE-ATEL-16 |
| 86 | Correlated tolerance stacks | Low-dimensional correlated tolerances on datums and mounts, propagated to clearance and backlash | Foundry §31.11 | F | GATE-FOUNDRY-08; KILL-TOLERANCE |
| 87 | Forecast feedback | The calibration of registered predictions decides when an agent is told to buy evidence before its next edit | Atelier §28.17 | S | GATE-ATEL-16 |
| 88 | Ceiling before a speed test; reachability before a fixed-n study | Compute the ratio a test could show from its shared fixed work and refuse the test if that is below the claim; enumerate the verdicts a frozen rule can reach at its n | §36.5; Arena §24.12 (eval.preanalyze); Tether §32.6.1 |
S | GATE-AUGUR-14; GATE-ARENA-05; GATE-ATEL-06 |
B.5 Contested ideas
An idea is contested when independent examiners reached opposite conclusions about it, or when the passes that proposed it disagreed about its form. Each row gives the strongest argument on each side and what the plan did. The resolution is never a vote: it is a tier, a pre-declared test and a fallback.
| Idea | Strongest argument for | Strongest argument against | How the plan resolved it |
|---|---|---|---|
| The batch unit for many different robots (row 12) | Stepping many topologies in one launch removes a compile per design, and with few worlds per design it is the only way to fill a device | Homogeneity by morphology is not homogeneity by work: contact counts diverge inside a cohort; padding and bucket fragmentation eat the gain; a warm incumbent with per-family templates may win the early rounds | A four-arm head-to-head with outcomes declared in advance (§17.14): cohorts, nine per-family templates, an incumbent's mixed batch, and the leading incumbent design by design. KILL-PHYLUM makes the templates the engine if they win. The unit of measure is edit to first accepted result (§17.8) |
| Sampling-based control as the default controller (row 3) | It removes training from the design loop, and against per-design training it is the clearest large factor any pass found | A fixed-budget planner ranks bodies that are easy to plan for above better bodies; incumbents already run it; and it costs thousands of times as many model steps per simulated second as a policy rollout (DESIGN arithmetic on published FACTs, §22.8) | F, as a screening rung of three episodes per design by default and as a demonstration source. It never stands in for a trained policy as the evaluator of record (FROB-REF-817, NONGOAL-14); the delivered-controller lane of §22.8 is the one exception. Its results carry model-privileged unless the planning model was drawn independently. GATE-REFLEX-06; KILL-MPC |
| Family policy across bodies (row 4) | One training is amortized over a class, which is where breadth per GPU-hour comes from | The pretraining budget is unowned; published transfer across morphologies is partial; novel hybrids are out of distribution; one proposer cut its own version and another demoted it after cross-examination | F, per morphology class only (NONGOAL-10), above the exact skill layer of §22.10. GATE-CORTEX-11 and KILL-FAMILY decide it; a rung may discard designs only after rank agreement is measured (GATE-CORTEX-12; top-weighted Kendall τ thresholds 0.7 and 0.5) |
| Derivatives through the contact solve (row 16) | At a converged convex solve the adjoint is one back-substitution, and local margin sensitivities are a sound first consumer | The derivative is biased at make and break; the sibling's event-sensitivity code refuses simultaneous events, which a trot produces by design; a closed-loop design gradient also needs the controller's sensitivity | Not in the rigid core before M6 (NONGOAL-15). Fixed-mode derivatives on smooth kernels only, each with a validity label (D-8, C-16, §16.12). Return-map gradients under GATE-GAIT-02. Paired finite differences over short horizons are F under KILL-FDGRAD |
| Fused per-world step kernel (row 13) | Memory traffic is the lever, and once a sampling controller is in the loop stepping speed multiplies into every decision | The step is bound by latency and occupancy, not by operation count; one world's working set fills a block, so occupancy falls to a few percent of lanes; the proposed throughput was conceded | M, behind a flag. KILL-MEGA is a one-week pilot with a paired lower bound of 2.0 on the whole step; the staged step plan is the design of record |
| Staged algebraic erasure as a throughput lever (row 60) | Doing the algebra at compile time makes the run-time step strictly cheaper | It restates a position the plan already held; the operation count falls by 18,000/9,600 = 1.875 on a step that is not bound by operation count; its falsifier bundled four treatments | Kept as a rule and not counted as a lever: checks at model compile time, no tags in kernels (C-02, C-14). Per-design specialization is for survivors only (KILL-SPECIALIZE) |
| Runtime shields from barrier conditions (row 25) | No model-level violation during exploration, and the same filter lowers to firmware | Three demonstrated defects: a "for every disturbance there is a control" condition admits a clairvoyant controller; an infimum over the smaller friction cone is optimistic for forces the environment chooses; a closed-form projection that ignores the box returns (1.25, 0.25) where the optimum is (1, 0.5) (FACT, hand-checkable; Appendix N) | F, rewritten: one control for all disturbances and estimation errors; separate cones for controlled and environment forces; sort-and-clip for one row, a projected solve with a checked KKT certificate and a verified backup otherwise. Evidence class Tested. GATE-SHIELD-02, -03; KILL-SHIELD. The energy budget (row 23) comes first |
| A probability bound from assumption monitors (row 26) | Splitting a guarantee at assume-and-guarantee interfaces keeps the proof part honest about what it assumes | The bound cannot validate itself: a monitor cannot label its own silent breaches; distribution shift moves the miss rate; four independent feet with three states each give 27 strata and 162 transitions under the symmetry group, not 14 (FACT by count, C-16) | The typed product is S and is in every output envelope. The bound is reported only with breach labels drawn from hidden state independently of the monitor, with shifted worlds reported separately (GATE-SHIELD-03) |
| Observation-alias witness as a new capability (row 21) | It shows before any training that every policy on an interface must fail, and names the cheapest fix | Deriving the admissible action sets from a contact-rich plant is most of the work; given the same sets, an ordinary exact solver recovers every frontier (FACT, Appendix K) | Adopted as a checked witness, with no claim of a new algorithm. Structural and enumerated witnesses are S; searched witnesses are F and labelled experiment-specific. One false witness triggers KILL-ALIAS |
| Joint paired-outcome certification (row 70) | It closes whole parameter boxes of a design comparison at once | A conventional reachability tool handles the same product model, and one mislabelled draw voids the certificate | F, on one contact transition. KILL-AUGUR-DOMINANCE falls back to paired replay; the rule that shared inputs are indexed by position and not by tick is kept in either case |
| Verdict reuse beyond a keyed cache (row 45) | Four passes proposed it; repeated work in a campaign is real | Executed check: a correctly keyed dependency graph skipped exactly the work the richer receipt skipped, and omitting one dependency inherited a false promotion (FACT, Appendix K) | The memo graph is S with a shadow recompute. Reuse by implication is F under KILL-REUSE and KILL-AUGUR-REUSE: one unsafe reuse removes the rule. Reuse by sensitivity margin is withdrawn (Appendix C) |
| Recomputing only what an intervention touches | A fork that recomputes only the descendants of its dirty frontier would make interventions cheap: a factor of 1/(0.05 + 0.019 + 0.01) = 12.7 if 95% of replay is addressable and 2% is dirty (HYPOTHESIS as proposed) | In a robot-centric scene the robot and its contact neighbourhood dominate compute and are always dirty; the dependency surface is large; full replay is simpler and exact | Not built. Forks copy full state by index, and a prefix is reused only when identical by construction (§29.8). A far-field lane is listed in §B.8 |
| Counterfactual branching: what a fork may claim (row 33) | Seven passes proposed it; it tells an agent which experiment to try next | Carrying state across a geometry, inertia or gearing edit is invalid; a mid-run rescue is conditional on a state the edited robot might never reach; coalition values can be negative and cannot establish necessity | S, narrowed: diagnostic interventions fork from the snapshot; design-parameter edits re-run from the episode start (§27.8); forks are classified and the invalid ones refused (GATE-AUTOPSY-02); placebo forks and the flip rate bound instability (§27.5, §27.6); attributions are labelled and are never cited as established (FROB-REF-880) |
| Structure and manufacture inside the loop (row 37) | Distal link inertia changes dynamic rankings, the sibling structural crates exist, and a design that cannot be built is not a result | It adds scope and not decision speed; loads taken from compliant contact are artifacts of contact stiffness; sibling readiness was overstated and conceded | F, declared an output-quality subsystem and not a speed lever (§31.2). Load cases are time-coherent and come from referee-tier telemetry (§31.6). Each stage has a kill gate with a simpler fallback |
| Catalog co-design by monotone bounds (rows 74, 75) | Discrete component selection is largely monotone, cheap to test on a CPU, and a sound cut on a partial assignment saves point checks multiplicatively | Monotonicity breaks under dynamics; a quasi-static filter can mis-rank; a shared resource is joint and time-dependent | S for catalog closure, F for antichains and cuts. KILL-SYNTH-CODESIGN fires on one falsely pruned design or on more than 20% of top designs mis-ranked; KILL-AUGUR-CUTS on one false cut |
| The estimator for cheap referee promotion (row 35) | Coupled estimation reuses an existing sibling estimator and gains (1 − ρ²); randomized audits stay unbiased when promotion targets are chosen after seeing fast-tier results | A unit-coefficient correction does not have the quoted variance; ρ falls on long contact episodes; inverse-propensity weights can exhaust the budget | Both, as one estimator: a fitted, frozen control-variate coefficient with a doubly robust audit correction on logged propensities (C-25). KILL-DR at ρ below 0.7 on 200 addresses falls back to the plain paired promotion |
| Sharing test cases across symmetry orbits (row 2) | An exact saving with no approximation | Interiors are asymmetric; floating point and unmirrored noise break exact invariance; the saving is on work one would not create | Orbits are taken only under the group that preserves robot, sensors, task and scene, and members have equal outcome distributions, not equal outcomes at equal addresses (§17.11). The known answers bound the lever: 86,185 orbits of 10⁶ labelings under the full dihedral group, 500,500 under a mirror alone. KILL-QUOTIENT below 5% of dispatches saved |
| Clearance complexes (row 18) | Fits, cannot fit or unresolved before any dynamics, reusable across a footprint family | It covers wheeled or rigidly folded bodies only; a conventional planning library could hold the same index; its share of design time is small and disputed | F, two-sided with a reported band; a nonholonomic base without a steering primitive is labelled geometric only. KILL-FCLEAR falls back to a route-graph check labelled heuristic |
| Where the ten-fold comes from | Kernel throughput multiplies into every other mechanism | An infinitely fast environment step speeds training by at most about 7.7 times (1/(1 − 0.87)) on one incumbent stack and about 1.4 on another (FACT, §2.3) | Engine throughput is a parity requirement (KILL-PARITY); the ten-fold is sought in avoided trainings, family answers and fewer agent rounds (§2.4), and is measured, not argued (§39) |
Four disagreements did not move under cross-examination: whether kernel speed is undervalued, whether closed-loop design gradients can work, whether randomized audits have a regime in which they beat coupled estimation, and whether orbit sharing saves real work. The plan settles none of them by argument. Each has a measurement in the rows above.
B.6 Blind spots that surfaced only under cross-examination
B.6.1 Named when the passes were asked what no list contained.
| Gap | Why no list had it | Where it now lives |
|---|---|---|
| No one proved when every policy must fail because of sensor aliasing | Training compute was spent before the question was asked | Row 21: §20.12, preflight stage 8, §25.10 |
| No one checked the orderings of capture, packet, estimator, watchdog and commit | Timing was treated as a rate, not as a schedule | Row 71: §20.4.7; the seven instants of §11.8; §29.15 |
| Agents that retry against held-out worlds spend the benchmark | Confirmation data was not treated as a consumable | Row 82: the blinded qualification lane of §24.13 |
| Replay determinism was asserted in several proposals and engineered in none | Seeding the random numbers does not fix the arithmetic or the reduction order | Row 58: §35; batch-composition invariance (GATE-SPARK-15) |
| Every list ranked designs under one contact formulation | Rank stability across model forms was not a concept in any list | Row 29: §16.9, §16.10, A-19 |
| Every repair considered lived in the robot | The building was not a design variable | Row 63: the retrofit catalog of §19.12; BET-37 |
B.6.2 Surfaced by review, audit or execution.
| Gap | Evidence | Where it now lives |
|---|---|---|
| A speed test can be powerless | A pilot's shared overhead capped the measurable ratio at 1.46 before the test ran (FACT, Appendix K) | The ceiling-first rule of §36.5; the anti-goal of §6.3; GATE-AUGUR-14 |
| A frozen decision rule may be unable to return some verdicts | At 64 pairs one of four verdicts was unreachable; it is first reachable at 86 (FACT, Appendix K) | eval.preanalyze and study.plan (§24.12, §32.6.1); GATE-ARENA-05, GATE-ATEL-06 |
| Local contracts hide time correlation | Two fingers on one bus have identical local summaries, and a rule that adds peaks prunes a feasible schedule | C-12; §14.6; the negative control of §25.21.1 |
| In-family checks cannot expose a structural error | A probe that was right on every case inside its law family was wrong on every case of an omitted law (FACT, Appendix K) | §25.14: verdicts conditional on the law family; the direct measurement always offered; GATE-AUGUR-11 |
| The actuator authority model changes the hardware decision | Independent forces and equal passive springs give different foot loads on the same body | §25.13; authority is part of the claim (FROB-REF-851); A-08 names its load sharing |
| Widening a hypothesis set by a hair invalidates certificates wholesale | Adding one nearby gain to a docking family reversed every admitted cell | C-18 (assumption lattice and polarity); §20.16; result.revalidate |
| Controller rate and rotor inertia flip benchmark outcomes | In an executed planar study two success fractions both became 1 with a faster loop or added inertia (FACT, §23.16) | A-22; the rate-sensitive detector of §23.16; reflected rotor inertia on actuator cards (§15) |
| Contact counts diverge inside a cohort of one morphology | Homogeneous structure does not give homogeneous work | §18.11 and the capacity-biased label; contact capacity in the bucket signature (§17.5) |
| A screen can discard the winner | A stopping test between two survivors says nothing about discarded designs | Blinded stratified audits of discards and a planted winner (§26.10, §28.12); GATE-ATEL-09, GATE-NEMESIS-07 |
| A monitor cannot see a breach until it is too late | Two friction regimes give identical histories until the first slip | Independent breach labels (GATE-SHIELD-03); the pre-slip aliasing fixture of Appendix N |
| Once the engine is fast, the agent's turn dominates | The agent's serial rounds become the largest term of the loop (§2.2) | Population verbs and maps per dispatch (§17.12); the cascade (§28.11); solve.run (§32.6.2); GATE-PHYLUM-08 |
| The earlier draft measured itself where it trailed | Targets sat below published incumbent figures | Targets restated as ratios to the incumbent measured on this hardware (§36.3); GATE-SPARK-21; GATE-CORTEX-05 |
| Additions proposed by examiners | A constrained allocator that reports refusals under any learned policy; a shield fixture with a verified backup; a native paired-intervention replay harness before any browser bundle; edit to first accepted result as the unit for batching claims | §22.10 and §22.6; GATE-SHIELD-02; §27 and §29.8 ahead of §32.15; §17.8 and GATE-PHYLUM-04 |
B.6.3 Named after the last cross-examination, and not yet examined by a second pass. Each rests on its proposer alone, so none is adopted on this evidence. Two of them answer the strongest standing objection to sampling-based control, that a fast evaluation scores body and controller together.
| Idea | Mechanism in one line | Standing in the plan |
|---|---|---|
| Rank designs by achievable performance | Run each design at several controller budgets on the same world addresses, fit a saturation curve, and escalate only the contenders | Not yet placed (§B.8). The flag controller-sensitive exists in §8.2 with no procedure that sets it |
| Bracket what the embodiment can achieve | A sound optimistic bound over all admissible controllers beside an achieved result from a rollout | Placed in a narrowed form: inner and outer design sets (§25.4), and exclusions that hold for every controller (C-31, §22.11; mission.refute) |
| Attack the task specification first | Run deliberately capable or degenerate bodies against the task's own predicate to find loopholes | Not yet placed (§B.8). task.check runs labelled examples and a mutation check (§24.5) |
| A calibrated item bank for the test battery | A response model over battery items, so uninformative scenes are skipped | Not yet placed (§B.8). Battery selection by weighted coverage is §26.11 |
| Common randomness compiled from the task | Key disturbances by place, time and mission event, so pairing survives edits and rate changes | Placed: space-indexed fields and (world, replicate) addresses (C-40, §25.16, §35.9); a pairing keyed by event order is refused (FROB-REF-556) |
| Convex synthesis from inverse dynamics | Inverse dynamics is affine in the inertial parameters, so mass placement, gearing and actuator sizing along nominal trajectories form one cone program | Not yet placed (§B.8). Neighbours: mass placement (row 79) and trajectory optimization with design variables (row 52) |
| Pre-characterized sub-assembly models | Characterize limbs and modules once at their ports and screen assemblies by composition | Placed in a narrowed form: the limb port interface (row 53) and module contracts that carry time correlation (row 1) |
| Sensor co-design from estimator observability and self-occlusion | Observability bounds from the invariant filter, with occlusion by the robot's own body, optimized with the morphology | Partly placed: §20.11, A-17, and an estimated-state twin of every return (§23.17). The self-occlusion term is in §B.8 |
B.7 Refuted, deflated or declined
Each of the following is treated in the killed-idea register of Appendix C, with the calculation or evidence that refuted it. This list gives only the name and what survives.
| Idea or strong form | What survives, and where |
|---|---|
| Half-precision factorization of the contact Hessian on tensor cores | Single precision in scaled variables (§35.10); response batches (row 55) |
| Lattice fluid tiles at control rate inside training | Slosh by sprung masses, the film law, and resolved fluid as a referee-side island (rows 61, 62) |
| Full-room fluid, granular or cloth physics in every world | Reduced laws and offline challenges (NONGOAL-02) |
| Global lifted-linear control of contact dynamics | Nothing on the critical path |
| Topological stratification of contact modes, and exact algebraic reachability | Symmetry-orbit mode strata as a counted known answer (C-16); max-plus timing (row 73) |
| Per-world time tiles between interactions, and time-parallel rollouts | Fixed decimation in a static graph (§21.20) |
| End-to-end differentiation through every contact change | Labelled fixed-mode and return-map derivatives (rows 8, 16) |
| Live zero-copy CPU reads of GPU state | Fenced snapshots; the shadow referee (row 48) |
| Copy-on-write forks of device state | Forks by indexed copy (§21.20, §29.8) |
| Learned step surrogates and learned corrections between tiers | None; an anti-goal (§6.3) |
| Search over kernel rewrites with proofs of equivalence | Rewrite classes with an error bound and a new kernel identity per changed bit (§21.7, DC-11) |
| Multi-agent design markets and debates as a product lever | Namespaces and capabilities for many agents (§32.13) |
| Custom stator and gearbox co-design | Actuator cards from existing parts (§15.3) |
| Live editing in the viewer | Typed edits and patches (§14.7, §14.8) |
| Simulated humans as validated agents | Scripted actors as dressing (row 20) |
| One universal policy across all morphologies | Family policies per class (row 4; NONGOAL-10) |
| Sampling control as a stand-in evaluator for a trained policy | A screening rung, and the delivered-controller lane of §22.8 (row 3; NONGOAL-14) |
| Per-design kernels as the default path, and the launch-cost advantage of per-morphology dispatch | Model variants as data; specialization for survivors (rows 12, 57) |
| One megakernel of precompiled limbs at near-homogeneous speed, with a lossless limb summary | The limb port interface, semidefinite and exact only without base-coupled contact (row 53) |
| Staged erasure as a throughput lever | A compile-time rule (row 60) |
| The clairvoyant barrier condition, the smallest-cone rule and the closed-form projection | The rewritten shield (row 25) |
| A stratified probability bound that validates itself and holds under shift | The typed product and a conditional bound with independent labels (row 26) |
| Sampling only inside a certified inner ellipsoid; feasibility by a logarithmic change of variables | Per-constraint boxes behind proved exclusions (row 28) |
| Unbounded whole-robot synthesis by elimination | Bounded exact synthesis, then continuation (rows 30, 76) |
| Family queries and minimum-label queries as capabilities no existing method has | The queries, their checked answers, and the tie rule of KILL-AUGUR-TIE and KILL-FAMILYCERT |
| Adaptive-fidelity stopping as a decision procedure | A scheduling heuristic that orders work without touching validity (§28.19.4) |
| Verdict reuse by sensitivity margin | Dependency-keyed reuse (row 45) |
| Requirement rewards that remove reward hacking; a lifecycle step-count ratio read as a speedup | Unit-normalized margins (row 43); lifecycle results classed Estimated (row 39) |
| The headline ratios of campaign quotienting, rare-failure search, symmetry deduplication and the scene bank | The mechanisms with recomputed ranges (rows 2, 14, 31, 50) |
| Unconstrained zero-sum adversarial worlds; automated board-support generation | Search with a solvability witness (row 31); controller code behind a caller-owned interface (row 38) |
| Faster numerics alone as the source of the ten-fold | Engine throughput as parity (§2.3, §2.5) |
B.8 Not yet placed
No chapter of the plan contains these. Each is listed so that it can be placed, parked in Appendix C with a reason, or declined. None was refuted. "Passes" is as in §B.3; "review" marks an idea named only after the last cross-examination.
| Idea | Passes | Mechanism in one line | Why it is not placed | Suggested home |
|---|---|---|---|---|
| Inverted index of contact-compatible modules | 1 | Postings from required screw, wrench, geometry and actuator envelopes to module records, so a catalog is not scanned per edit | Catalogs hold hundreds of entries and a linear scan takes microseconds | Decline, or a note under module.list (§14.6) |
| Proof-driven time stepping in quiet windows | 1 | Per-world error budgets admit a coarser step class where separation and truncation error are certified | Dynamic shapes conflict with the static step plan; §21.20 rejects per-world time tiles for a related reason | Park in Appendix C; if revived, an effort profile under DC-08 on the strict profile only |
| Symbolic elimination of kinematic loop closures | 1 | Eliminate four-bar and parallel-knee closures per limb into exact reduced-coordinate kernels | §16.12 keeps closures as compliant rows on lockstep tiers and bilateral rows on transactional profiles; exact closure waits on an upstream work item (FD-FSIM-04) | §16.12 as an F option for templates with closed-form closures; §25.21.3 holds the algebra |
| Far-field recomputation of only what an intervention touches | 2 | Content-addressed spacetime tiles for slow far-field state, so a fork recomputes only descendants of its dirty frontier | Contested (§B.5); the robot's neighbourhood is always dirty | Park in Appendix C; a candidate only for multi-room film or steam fields in §19.10 |
| Correlated contact-material grids | 1 | Condition-indexed friction cards with correlated uncertainty factors and sparse regional overrides | Interface cards and static condition cards exist; correlation across regions is not modelled | §18.6 or §19.5, with the randomization of §23.15 as consumer |
| Coherent sensor ray bundles | 3, each cut by its proposer | Share conservative candidate lists across nearby rays, with a per-ray fallback near thin geometry | It speeds one stage, and coherence vanishes in clutter | §20.6, only if the ray stage exceeds its share in the M2 profile |
| Continuous interpolation between topologies | 1 | Blend discrete topologies through continuous coupling weights so a gradient crosses a topology change | Ill-conditioned as a weight tends to zero, where a limb becomes massless | Park in Appendix C |
| Saddle-point robust co-design | 1 | Differentiate design parameters at the worst-case friction and payload | Subsumed by adversarial search with design gradients; depends on row 16 | Park in Appendix C until NONGOAL-15 is revisited |
| Missing-contact diagnosis | 1 | Infer feasible reaction envelopes from momentum residuals over a dictionary of candidate contact surfaces | Ambiguity grows quickly with the number of plausible surfaces | An explain view in §28.5, or Ground §30 for real logs |
| Scene-side incremental geometry rebuilds | 1 | A dependency map from typed scene edits to bricks, so an edit rebuilds only the geometry it touches | Scenes are immutable per SceneId; a retrofit is a new scene variant over a shared brick pool |
§19.4, measured against the pooled variant path of §19.15 |
| Micro-slip precursors for tactile sensing | 1 | Couple vibration modes with tangential micro-slip so a policy senses slip before it happens | Cannot be validated without tactile-array data | With tactile micro-patches (row 69), behind the import lane of §30 |
| Ranking designs by achievable performance | review | Controller-budget sweeps with a fitted saturation curve | Not examined by a second pass | §28.9 as a rung rule, setting controller-sensitive; pilot: 20 variants at three budgets on a CPU |
| Task-specification audit by ghost bodies | review | Run degenerate or deliberately capable bodies against the task predicate | Not examined by a second pass | §24.5 beside task.check; compare with the detectors of §23.16 |
| Calibrated item bank for batteries | review | A response model over battery items, sampled by importance | Not examined by a second pass | §26.11 and DC-10 |
| Convex synthesis from inverse dynamics | review | One cone program over inertial parameters, gearing and actuator sizing along nominal trajectories | Not examined by a second pass | §25.21, beside mass placement |
| Self-occlusion in sensor coverage | review | Include occlusion by the robot's own links in coverage and observability analyses | Not stated in A-14 or §20.11 | A-14 (§28.4) and §20.11 |