FrankenRobotics

The beads

17,283 words12 subsections11 tablesPlan version 1.1

On this page12
45.1 M0: spine and airlock45.2 M1: referee studio and first mission slice45.3 M2: batch, backends, families45.4 M3: places, tasks, adversaries, qualification45.5 M4: amortized control, co-design, mission queries at scale45.6 M5: proofs, reality, manufacture45.7 M6: frontier physics (epics)45.8 M7: the ten-fold tournament (epics)45.9 M8: frontier delivery (epics)45.10 Graph facts45.11 Conversion rules45.12 Subsections added by the audits, to be placed during conversion

These are the seed for conversion with br. Titles name the artifact. "Done when" is one observable, usually with a negative control: a planted failure the bead must catch. Beads of M0 to M5 are tasks. Beads of M6, M7 and M8 are epics, one per frontier item and one group for the ten-fold tournament; an epic is split into tasks when its milestone opens, and part of its done-condition is that a short plan exists and its pilot has run (§0.7). Each milestone ends with an exit review performed by a fresh-context session that did not implement the work. Every dependency points to a lower-numbered bead. Every bead inherits §0.2 and the false-progress guards of §38.

How to read a row (DESIGN):

  • A gate identifier in "Done when" means the gate's recorded value together with its caught negative control, as defined in the chapter that owns the gate and listed in §40. "Rows of", "on the referee" and "for the M2 verbs" restrict the bead to the part of the gate that can be measured when the bead closes. The gate's PASS is recorded when the last bead that cites it closes. Admission gates (INT-…) are read the same way, with the admission record of §33.6 as the value.
  • "Decided" after a kill gate means that its trigger was evaluated on measured values and that the outcome, either way, is recorded as an ADR. A kill gate that fires replaces the bead's capability by the fallback named in advance. The bead then closes on the fallback, and its dependents are re-read against it (§45.11).
  • Numbers in a done-condition are TARGET thresholds or exact known answers taken from the owning chapters. None is a measurement.
  • Placement. A bead sits in the milestone that §43 assigns to its mechanism. Where a gate table names a different earliest milestone than the bead that closes the gate, §45.10 lists the difference, and the value is recorded when the bead closes.
  • Upstream work is bead work. A change to a sibling is a bead of this graph with the label upstream, done in the sibling's repository under its own rules and mirrored as a bead in the sibling's tracker (§33.8). BD-037 opens the upstream work items of Appendix F, the two P0 items are part of BD-008 and BD-023, and every bead that stands on a sibling has an interim posture that holds until the upstream change lands.
  • Numbering. The list is numbered from BD-001 so that the numbering is a topological order. BD-001 to BD-024 keep the subjects they had in version 0.2, with corrected content, so that §46 reads against the same numbers. Numbers above BD-024 are new assignments.

45.1 M0: spine and airlock

M0 retires the risks that could invalidate the architecture, with the smallest amount of code. Beyond the workspace, the airlock and the one-kernel spike, it measures the rival before anything is built against it, re-runs the plan-time pilots so that their numbers are this repository's own, and admits the four reported foundation defects as tests. M0 also chooses the one toolchain T of the whole build graph, brings fastmcp_rust onto it and aligns the consumed siblings on one asupersync version, as upstream work in those repositories (§33.13). The MCP server is a member of the core graph and runs verbs in process. frob-cert also builds alone: it has no dependency and its own stable compiler.

Bead Title Depends on Done when
BD-001 Core workspace skeleton: Cargo.toml, one rust-toolchain.toml for the whole build graph naming candidate (a) of §33.13 as the provisional T, .cargo/config.toml with the build-identity variable, franken-stack.lock and its first resolution receipt, the asupersync patch entry, FrankenSQLite profile overrides — cargo check is green on the empty workspace through the offload shim, and the receipt hash recomputes from the lock
BD-002 Companion documents: AGENTS.md, README.md with a generated honest-status table, DEPENDENCY_ADMISSION.md, schema-valid registries (empty except formats.toml with its thirteen rows), the schemas for demo.yaml and contract.toml BD-001 The status table regenerates from registries/gates.toml; a gate with no measured value prints as open, never as passed
BD-003 xtask check-layers and check-deps BD-001 A deliberate upward edge, an intra-layer edge against rank and a forbidden dependency each fail
BD-004 xtask check-stack, check-contracts, check-unsafe, check-generated; the test that xtask has exactly six subcommands BD-003 GATE-WS-01: 7 of 7 plants caught, each by the check that owns it and by no other; GATE-WS-04: the six checks finish within 60 s on a warm tree
BD-005 frob-core: identities and hashing, evidence classes, the claim-product type, the no-authorization flags, the refusal type and registry loader, the qty re-export module BD-001 An unknown refusal code is a load-time error; converting a claim product to one of its factors fails to compile; a flag has no setter
BD-006 INT-FSIM-01 and the core row of INT-TOOLCHAIN-01: path dependencies on fs-ga, fs-mbd, fs-contact, fs-time, fs-query with the root patch, profile and build-identity settings, built on candidate (a) for T and, if FrankenSim cannot yet build there, on candidate (b) BD-001 An admission record with the command, its output, the commit, cold and warm check times, peak memory and package count, and the candidate on which FrankenSim builds; with the build-identity variable unset the build fails closed
BD-007 frob-fsim v0: RefereeDynamics over fs_mbd::articulated; the G1 digest test BD-006 The digest equals the one computed inside FrankenSim at the pinned commit; a perturbed input changes it
BD-008 INT-ASUP-01 wired into check-stack, and upstream work item FD-ASUP-01: FrankenSim's constellation, FrankenTorch and fastmcp_rust aligned on one published asupersync version by changes in those repositories BD-004, BD-006 cargo tree -d evidence recorded for each workspace, showing one package at the one published version; a seeded second asupersync version fails; each sibling change has landed through that sibling's own gates and has its mirrored bead
BD-009 INT-FSQL-01: ledger open, write, forced kill, recover BD-006 The forced-kill test passes 100 times
BD-010 frob-lie: traits; SO(3) and SE(3) over fs-ga; the PO-MARROW-01 fixture BD-006 Bit-equal on 1,000 transforms produced by fs-ga
BD-011 frob-lie: Cayley and exponential retractions with derivatives; laws for SO(3) and SE(3); the coadjoint convention of §11.2 BD-010 GATE-MARROW-01 rows for these groups; a planted reversed ad* fails the free-body known answer π̇ = (0, 0, −1)
BD-012 frob-lie: SO(2) as a unit complex number with a turn counter BD-011 PO-MARROW-03 over 10⁹ steps
BD-013 Shared dialect prelude v0 for CUDA and Metal; the dialect lint BD-001 The lint rejects a built-in transcendental, a floating-point atomic and a construct that permits fusing a multiply with an add
BD-014 KernelBackend trait, the kernel manifest with its stage signature, and the batch-cpu harness BD-005 A trivial kernel runs through the harness with a receipt; a manifest whose write footprint aliases an undeclared buffer is refused
BD-015 INT-CUDA-01 and spark/frob-spark-cuda v0: driver load, NVRTC compile, cache, launch BD-013, BD-014 A kernel runs on both GPUs of trj; the admission record states whether the pinned cudarc binds graph capture and stream-ordered pools
BD-016 INT-FT-01 and spark/frob-spark-metal v0 over the ft-kernel-metal gateway, with FrankenTorch's block patch repeated at the annex root BD-013, BD-014 A kernel runs on this Mac and matches a Rust loop bit for bit on 10⁶ quaternions; admission record
BD-017 spark.probe: the IEEE probe kernels and report BD-015, BD-016 GATE-SPARK-01 results stored as device evidence for both families; the contraction detector fires on a planted fused multiply-add
BD-018 frob-kir v0: straight-line programs, common-subexpression elimination, Rust and dialect emitters, the dimension checker BD-005 Emits K-cay-step; a seeded dimension violation is rejected
BD-019 INT-FSYM-01 and derive/frob-derive v0: derive K-cay-step and K-normalize BD-018 Regeneration reproduces the checked-in sources bit for bit
BD-020 GATE-SPARK-00 and INT-FSIM-11: one dialect source for K-cay-step on batch-cpu, CUDA and Metal BD-015, BD-016, BD-019 Agreement inside the class, recorded in the divergence ledger; a one-ulp change planted in one prelude is reported
BD-021 frob-lemma v0: claims and instance certificates for T-01, T-03 and T-04 on the M0 kernels, checked by FrankenSymPy BD-019 The three identities certify and a mutated coefficient is rejected; constructing Proved evidence outside frob-lemma fails to compile
BD-022 frob-verbs v0 and the frob skeleton: registry loader, the envelope with claim product and flags, exit codes including 8 (accepted and still running), doctor, capabilities, schema, robot-docs BD-005 GATE-TETHER-03 on these verbs
BD-023 INT-FMCP-01 and upstream work item FD-FMCP-01: fastmcp_rust brought onto T in its own repository (its toolchain file and, where T requires it, its declared rust-version changed; its test suite and MCP conformance checks passing on T); surface/frob-mcp as a member of the core workspace, built on fastmcp_rust, linking frob-verbs, generated from the registry for the M0 verbs and running them in process BD-022 fastmcp_rust's own suite and conformance checks are green on T at the pinned commit; frob-mcp builds in the core graph on T with exactly one asupersync package (cargo tree -d shows no duplicate), lists the tools generated from the verb registry, and passes the MCP protocol smoke test over stdio and HTTP
BD-024 sim.run --tier referee for the built-in G1; digest and T0 telemetry to the ledger BD-007, BD-009, BD-022 A fresh session reproduces the M0 artifact from the recorded command
BD-025 frob-conformance v0: tiers G0 to G5 and the negative-control registry BD-005 A gate registered without a negative control fails the registry check (GATE-GAUNT-01 for M0)
BD-026 frob-cert with an empty dependency table and its own stable toolchain file: canonical JSON reader, BLAKE3, exact integer and rational arithmetic, outward-rounded intervals; the frob-verify binary BD-001 GATE-WS-03: cargo tree -p frob-cert prints one line, the copied directory builds with no network access, and a system-call trace of an audit shows no socket and no child process; BLAKE3 matches the published vectors
BD-027 .frobcert bundles for instance certificates: the writer in frob-lemma against the schema, the poly-identity and rational-ldlt checkers in frob-cert, and prove.kernel, prove.verify, prove.list BD-021, BD-022, BD-026 GATE-LEMMA-00: the M0 certificates replay in frob-verify, which closes INT-FSYM-01; GATE-LEMMA-06: a bundle with a flag set to true is rejected
BD-028 INT-FT-02: resident buffers and device completion receipts through the Metal gateway BD-016 A buffer stays resident across two command buffers and the receipt comes from the device; a device tag alone earns zero operator coverage
BD-029 spark.fingerprint: the hardware fingerprint of both machines (frob.fingerprint/1) BD-015, BD-016 GATE-SPARK-07
BD-030 Exact-integer kernel class probe: K-x-pred and K-g-pred with exact fallback on the docking-boundary screen of 65,536 rows BD-015, BD-016, BD-018 GATE-SPARK-08: identical bytes on batch-cpu, both RTX 4090 and Metal; the unguarded single-precision kernel shows false admissions and is rejected as a strict predicate
BD-031 INT-TOOLCHAIN-01: the matrix of §33.12 over the four nightlies in play, the choice of T and its record in franken-stack.lock and rust-toolchain.toml, the fs-qty coupling test, and the decision on frob-units BD-003, BD-005, BD-006, BD-016, BD-019, BD-023, BD-026 Every cell of the matrix has a recorded result and every row passes on T; the choice of T is an ADR that names the sibling pins a toolchain train must move; a direct fs_qty import outside frob-core and frob-fsim fails check-deps; the frob-units decision is an ADR
BD-032 INT-FSIM-02 and INT-FSIM-03: first admission tests of the fs-ga Lie façades and of fs-mbd articulated dynamics BD-007 Power ⟨wrench, twist⟩ is frame-invariant to 10⁻¹² relative and a reversed adjoint fails at least three fixtures; a two-joint arm's accelerations match differentiated energy to 10⁻¹⁰
BD-033 Foundation-defect admission INT-FSIM-05: the planar_drive near-straight case, and the independent chord formula in frob-conformance BD-007, BD-025 The record states whether zero translation reproduces at the pin; the independent formula returns the chord (0, 2/π) m and one metre over 400 steps at heading 32 rad
BD-034 Foundation-defect admission INT-FSIM-06: three PPO probes (the clip branch for both advantage signs, the critic gradient from the current output, packed sequences across a reset) BD-025 Each probe has a recorded result against the sibling source at the pin, and an implementation carrying each planted defect fails its probe
BD-035 Foundation-defect admission INT-FSIM-04 and INT-FSIM-07 (refusal half): the fixed-witness sustained step and the contact capacity, through the airlock BD-007 The flat-to-edge-to-top transition returns the typed refusal at the pin; a set of 22 contacts returns the capacity refusal; a thin step between clear endpoint poses is detected on 1,000 of 1,000 sweeps
BD-036 Foundation-defect admission INT-FNP-01 and INT-FNP-02: the typed stride converter at the interchange boundary BD-005 An array file reads back identically; the 2×2 case reads element 3, and the verbatim stride copy that reads element 12 is refused
BD-037 The upstream work items of Appendix F opened as beads labelled upstream in this graph and mirrored in the sibling trackers (FD-FSIM-10 to -16, FD-FNP-01 and the others on file; the two P0 items are in BD-008 and BD-023) BD-016, BD-023, BD-033, BD-034, BD-035, BD-036 Each upstream work item has its fixture, its interim posture, its switch-over rule and an identifier in registries/upstream.toml, a bead here and a mirrored bead in its sibling's tracker
BD-038 INT-FSIM-18: the worker-process fallback exercised before it is needed (frob-fsim-worker, the remote mode of the airlock) BD-007 The G1 digest through the worker equals the in-process digest; a worker at a different pin is refused (FROB-REF-791)
BD-039 The incumbent harness as an out-of-process oracle: pinned revisions, the strongest warm configurations, the disclosure block BD-001, BD-029 The pinned incumbents run on trj from a recorded environment; a changed revision changes the harness identity
BD-040 Parity baseline on trj: the incumbent phase ledger for cold start, physics and full step on workloads Q and H, time to threshold on one and two cards, and edit to first step for a parameter edit and a topology edit BD-039 The trj rows of GATE-SPARK-21 are recorded under the disclosure block; each published figure of §36.3 is reproduced within 20% or the difference is explained in writing
BD-041 The plan-time pilot for the cart docking closed form, re-run from the reproduction bundle with two gains and with three BD-025 561 cells give 344 admitted, 217 excluded and nine on the boundary, and every late-packet cell is excluded; the gain 33/32 makes exact docking unsatisfiable with worst error at least 1/65 m
BD-042 The plan-time pilot for the static stance family, re-run from the reproduction bundle BD-025 11,520 of 11,520 states agree and the half-width is 3/14 m; the support-polygon-plus-capacity screen wrongly accepts 1,596 bodies; equal passive springs give (175, 115, 85, 25) N
BD-043 The remaining plan-time pilots of §25.22, re-run and recorded (probe, pad family, sensor aliasing, pusher and its timing ceiling, labels, decision reuse, shared bus, admission fixtures, sill) BD-041, BD-042 Every row reproduces its recorded result or the difference is written into the review log; the pusher ceiling of about 1.46 is recomputed before any speed figure is quoted
BD-044 M0 exit review by a fresh-context session that did not implement the work; KILL-FSIM and KILL-MCP decisions recorded as ADRs; the state of the two P0 upstream work items recorded BD-002, BD-008, BD-012, BD-017, BD-020, BD-024, BD-027, BD-028, BD-030, BD-031, BD-032, BD-037, BD-038, BD-040, BD-043 Every gate of M0 has a recorded value and a caught negative control (GATE-GAUNT-01)

45.2 M1: referee studio and first mission slice

Everything in M1 runs on the CPU. A gate that also has device rows is closed here on the referee only, and its device rows close at M2. The mission slice (BD-126 to BD-136) exercises the mission query, the clock contract, the certificate bundle and the offline auditor before any GPU work exists.

Bead Title Depends on Done when
BD-045 frob-lie: SE(2), SE₂(3), SE₂₊ₖ(3), product groups BD-011, BD-012 GATE-MARROW-01 complete: laws pass on 10⁶ cases each inside the ulp bounds; a planted error in the SE(2) exponential's Jacobian is caught
BD-046 frob-lie: joint subgroups, Hervé classification (T-11), generated joint maps BD-011 Each of the twelve classes is recognized from a basis; a non-closed basis is reported as a product
BD-047 Frame-typed transforms, twists and wrenches; the three typed maps between frames (§11.3) BD-010 Mismatched frames fail to compile; the planar 2R fixture gives torques (−3, −3) N·m and −0.3 W by both routes, and the lower-three-rows shortcut, which gives (0, 0), is caught
BD-048 frob-algebra: finite groups from generators, classes, characters, projectors (algebra.irreps) BD-005 GATE-MARROW-02
BD-049 frob-algebra: orbits, Burnside counts, subgroup lattices, wreath products (algebra.orbits) BD-048 The counts 86,185, 500,500 and 27 are exact; a wrong cycle index is caught
BD-050 frob-algebra: the Cone trait; orthant, second-order and semidefinite cones BD-005 Cone laws pass; a planted non-idempotent projection is caught
BD-051 frob-algebra: the inertia cone and the mass-support predicate BD-050 Round trip; a matrix one eigenvalue below zero is rejected; the 1 kg part declared inside a 0.10 m sphere is refused (FROB-REF-106)
BD-052 frob-algebra: posets, antichains, Kleene iteration BD-005 GB-03's closed form is reproduced; a divergent loop is reported infeasible
BD-053 Exact predicates and guarded single precision as kernel classes: predicate typing, the select lint and error-bound derivation in frob-kir BD-030 Single-precision 0.3, 0.4, 0.5 in x² + y² ≤ z² returns the exact sign; PO-MARROW-06 holds for each guarded predicate; an unguarded strict predicate fails the lint
BD-054 frob-design: the term model, schema frob.design/1, the seven canonical-form rules, DesignId BD-005, BD-031 Canonicalization is idempotent; the hash is equal on Linux and macOS; a duplicate key refuses
BD-055 .fbot fields: fills with shell thickness and no default fill, budgets, levers, locks, the power bus, sensors, payloads, symmetry assertions BD-054 A body with no fill refuses; a shell thicker than half the Region's smallest dimension refuses (FROB-REF-105); a lever outside its bounds refuses (FROB-REF-111)
BD-056 Constructors: attach, chain, serial, mirror, radial, scale, replace, closure BD-054 mirror equals its hand-expanded form; constructor terms stay unexpanded in the canonical bytes
BD-057 The S-expression view and design.view BD-055, BD-056 GATE-SKEL-05; KILL-SKEL-SEXPR decided
BD-058 Typed edits with preconditions, inverses and declared symmetry effects (design.edit) BD-056 An edit and its inverse return the same DesignId
BD-059 Design patches and versioning: design.patch, schema frob.design.patch/1, expected parent, idempotency key, schema migration BD-058 GATE-SKEL-08
BD-060 .fmodule: the module format and its port contract (mechanical, electrical, thermal, signal and contact ports; parameters); module.list, module.show, module.check BD-055, BD-056 A reversed port sign refuses; a module digest mismatch refuses; a contract check that adds peak currents fails the shared-bus fixture
BD-061 frob-model: the kinematic functor, RobotModel, the referee lowering BD-007, BD-032, BD-046, BD-047, BD-056 A template quadruped's forward kinematics runs on the referee
BD-062 Geometry and inertia functor: Regions, materials, the fill rule with shell moments as a difference of solids, primitive fitting with recorded error BD-051, BD-055, BD-061 The worked torso weighs 22.7 kg read as solid and 1.92 kg as a 2.5 mm shell; PO-SKEL-02 holds exactly; INV-SKEL-03 on every archetype shipped
BD-063 Memoized incremental compilation, with the invalidation set returned by an edit BD-058, BD-061 GATE-SKEL-02
BD-064 Design lints with ranked repairs as typed edits BD-058 Each lint has a fixture that triggers it and one that does not
BD-065 frob-io: the in-house XML reader; URDF import with a loss report BD-061 Reference robots import; a planted dropped field appears in the report with its file and line
BD-066 MJCF import with a loss report; URDF and MJCF export with the reverse loss report BD-062, BD-065 GATE-SKEL-01
BD-067 Oracle capture scripts; fixtures for reference robots with pin and date BD-039, BD-066 Fixtures are on disk with their pins; the regeneration-from-candidate path does not exist
BD-068 INT-FSIM-09: admission of fs-phs interconnection, fs-tribo friction-law selection and fs-matdb material data BD-007 Power across an interconnection sums to zero to 10⁻¹² relative; a missing material pair is a refusal
BD-069 Actuator, battery and transmission cards: the .fcard schema, per-field provenance, the generic catalog; actuator.list, actuator.show, actuator.check BD-005, BD-068 A card without provenance is refused; every card in the catalog passes actuator.check
BD-070 Actuator levels L0 and L1 on the referee BD-061, BD-069 L1 rows of GATE-SINEW-01
BD-071 Actuator level L2: winding current, the thermal network, the battery BD-070 Remaining rows of GATE-SINEW-01
BD-072 Winding temperature with temperature-dependent resistance, and thermal runaway (actuator.thermal) BD-071 GATE-SINEW-05: the worked card's 20 A point is admitted by the constant-resistance check and refused by the corrected one
BD-073 The voltage limit and field weakening (actuator.envelope) BD-071 GATE-SINEW-06
BD-074 Transmissions: gear, belt, screw, linkage, cable and coupling matrices with loss laws BD-070 GATE-SINEW-08: every loss and entropy production is nonnegative over 10⁶ operating points; the single-multiplier gear fixture refuses
BD-075 The power bus and the battery, with brownout events (actuator.bus) BD-071 GATE-SINEW-07
BD-076 Port energy-balance check on the referee BD-070 GATE-SINEW-02 on the referee; a planted unaccounted loss is caught
BD-077 module.substitute and the invalidation contract of C-12 BD-060, BD-063, BD-075 GATE-SKEL-06; KILL-SKEL-SUBST decided
BD-078 The clock contract: rational periods, phase accumulators, the seven instants and the boundary ordering rule (sense.schedule) BD-005 CPU rows of GATE-SENS-04: the 400/30 schedule exactly and zero drift over 10⁹ ticks; an every-thirteenth-step schedule, which runs a 30 Hz policy at 30.77 Hz, is caught
BD-079 frob-contact: collision primitives; contact sets from fs-query; INT-FSIM-08 BD-061 GATE-TRAC-02
BD-080 The referee step: FrankenSim's contact step on generated contact sets; compliant feet BD-070, BD-079 Stand and drop tests pass; a contact set above the capacity returns the typed refusal, never a truncated solve
BD-081 The transactional referee step: the restore set and the commit fence with commit_epoch BD-080 Zero uncommitted reads observed in 10⁵ injected faults (row of GATE-KIN-04)
BD-082 Event location on rational base intervals, with coupled impulses per island BD-078, BD-081 Impact time within 10⁻⁹ s and tied sliders exact to 10⁻¹² N·s (rows of GATE-KIN-04); simultaneous impacts are solved together and none is refused for simultaneity
BD-083 The retry ladder that changes numerical parameters only, and the refinement law for random inputs BD-082 GATE-KIN-04 on the referee: forced-retry digests equal, refinement statistics inside 3σ at 10⁶ draws, the redraw mutation caught
BD-084 Joint-level stiction, backlash and hard stops as rows in the referee solve BD-070, BD-082 GATE-SINEW-04 on the referee; GATE-SINEW-09; backlash modelled as a torque dead zone fails the closure-speed case
BD-085 The contact known-answer battery on the referee BD-082 Referee rows of GATE-TRAC-01, with the list of rows FrankenSim's solve can express recorded beside the gate
BD-086 Thin-barrier and sill fixtures under the transactional step BD-082 Referee rows of GATE-TRAC-06: zero missed hits in 10⁶ thin-barrier crossings; the endpoint-only mutation is caught
BD-087 The free-body variational step as an oracle S BD-011 Free-flight momentum is conserved to 10⁻¹² relative over 10⁶ steps; a right-trivialized differential in the solve fails the four-step test
BD-088 The dynamics known-answer battery BD-080, BD-087 GATE-KIN-01
BD-089 Contact-free dynamics parity against the pinned oracle BD-067, BD-080 GATE-KIN-02
BD-090 frob-chronicle: the ledger schema, .frun episodes, telemetry levels T0 to T2 with streams and channel kinds BD-009, BD-080 Round-trip tests pass; a chunk with one changed byte fails its digest
BD-091 The chunk protocol on the CPU: leases, ranges, the committed frontier BD-090 CPU rows of GATE-CHRON-04
BD-092 The energy ledger on the referee, with stored heat, separate braking modes and the first offending event BD-071, BD-076, BD-090 GATE-CHRON-03 on the referee; a damped pendulum's ledger matches the hand calculation
BD-093 Witness migration in the transactional step BD-035, BD-082, BD-092 INT-FSIM-07 in full: the flat-to-edge-to-top transition completes with the energy ledger closed to its stated residual
BD-094 Failure taxonomy with outcome kinds, first-cause ordering and budgeted summaries (telemetry.summary, telemetry.failures, telemetry.energy, telemetry.query) BD-090 A fixture per failure class fires its monitor; a numerical fault is never counted as a physical failure or dropped from a denominator
BD-095 The artifact graph (evidence.trace) and the per-bead log frob.beadlog/1 BD-004, BD-090 GATE-CHRON-10
BD-096 Simulation testing of the ledger and the submit path under asupersync's lab runtime BD-091 INT-ASUP-02; CPU part of GATE-CHRON-11
BD-097 artifact.read, artifact.list, artifact.export, run.show, run.list BD-022, BD-090 A byte-range read returns bytes whose digest matches the record; a traversal path is refused
BD-098 Packet queues and delivered observations, with the queues inside every checkpoint BD-078, BD-081, BD-090 Referee rows of GATE-SENS-05: restore at the three adversarial instants gives byte-equal delivered observations
BD-099 Proprioception on the referee: IMU with lever arm, encoders, sensor cards (sense.profile) BD-078, BD-080 The three IMU cases and the turntable case of GATE-SENS-01 on the referee
BD-100 A-02 mass roll-up and A-08 static stability BD-050, BD-062 Known answers; a planted top-heavy design is flagged; a point-foot biped is reported, not refused
BD-101 A-01 mobility BD-046, BD-061 Sarrus 1, Bennett 1, planar four-bar 1
BD-102 A-03 symmetry: Γ_mech and Γ_obs with breakers and near-symmetry repairs (analyze.symmetry) BD-048, BD-061 A symmetric quadruped with one forward lidar reports C₂ × C₂, C₂ and the lidar mount as breaker; a planted 0.4% asymmetry is found with its repair
BD-103 A-10 co-design closure and A-11 actuator envelope with the temperature-dependent steady state BD-052, BD-072, BD-073, BD-075 A planted undersized actuator is found; a mass spiral that does not close is reported infeasible
BD-104 A-13 self-collision and clearance BD-079 A planted limb interference is found
BD-105 A-05 workspace, A-06 singularities, and the derived leg IK kernel; INT-FSYM-02 BD-019, BD-061 A 3R leg has four solutions and the singular locus matches the closed form; INT-FSYM-02
BD-106 A-07 growth vector and maneuverability BD-061 The growth vectors of C-07; a mecanum base with parallel rollers reports (2, 3) where (3) is required
BD-107 A-12 modes with symmetry block-diagonalization BD-102 Modes of a symmetric two-mass model
BD-108 A-20 energy-budget feasibility, A-21 deadline and latency closure, A-22 sampled-loop stability, A-23 shared-bus schedule BD-075, BD-078, BD-103 GATE-ATEL-05 rows for A-20 to A-23; the additive peak rule, which falsely prunes the two-finger bus, is caught
BD-109 The first archetypes: quad-mammal, humanoid, diff-drive, mecanum (design.templates) BD-062, BD-064, BD-074, BD-075 Each compiles and passes its lints; the humanoid's mass lies within 15% of the mass on file for the G1 (row of GATE-SKEL-07)
BD-110 design.check stages 1 to 6: aggregation, ranked repairs as typed edits, per-stage timing BD-060, BD-100, BD-101, BD-102, BD-103, BD-104, BD-105, BD-106, BD-109 GATE-ATEL-02 for the included analyses; GATE-SKEL-04 for stages 1 to 6
BD-111 The memo graph in front of analyses, with shadow recompute; INT-FSIM-16 BD-090, BD-110 Analysis part of GATE-ATEL-12: a shadow mismatch stops serving within one hit; INT-FSIM-16
BD-112 explain.run and explain.design BD-094, BD-110 The explanation of a planted knee-thermal failure names the first cause and cites the telemetry channel that shows it
BD-113 Lineage basics: the lineage graph over patches, design.diff, design.blame BD-059, BD-090 Blame on a three-edit lineage names the edit that changed a chosen field
BD-114 The invariant filter (control.estimate) BD-045 GATE-REFLEX-03 on a synthetic IMU; the overconfident flag fires on a planted bias
BD-115 The small dense cone-program solver, with end states and dual certificates BD-050 KKT residuals; agreement with a reference optimizer on 10³ programs; a planted infeasible program returns a certificate that checks exactly
BD-116 Legged baseline controller BD-080, BD-105, BD-115 A quadruped stands and walks 5 m on the referee
BD-117 Wheeled baseline controller BD-080, BD-106 Differential and mecanum archetypes traverse 5 m; the wheel loops saturate at the card's current limit
BD-118 control.synth with three-outcome reporting, and control.show BD-109, BD-116, BD-117 GATE-REFLEX-01 on the referee and the standing rows of GATE-SKEL-03, for the first archetypes
BD-119 The causal-policy test (sense.causal-test) BD-098, BD-118 Referee rows of GATE-SENS-12: every baseline controller passes and each of the five planted leaks fails
BD-120 A-17 observability: the linearized Gramian modulo gauge on the CPU (sense.observability) BD-099, BD-114 Linearized rows of GATE-SENS-08: the corridor case and the four-dimensional gauge; two identical aisles are reported ambiguous despite full local rank
BD-121 frob-spec: the requirement language core, with unit-normalized predicates, temporal operators and three evaluators BD-005, BD-078 Monitor rows of GATE-ARENA-03: the three evaluators agree bit for bit on 10⁶ random traces per operator
BD-122 The task file .ftask: terms, requirements, randomization; task.new, task.show, task.list, task.check, task.verdict BD-121 Refusal rows of GATE-ARENA-03: each refusal 520 to 528 is triggered by its planted task file
BD-123 Fixture 1, fixture:cart-sill-dock: bodies, motor, sill, the analytic layer and the creep rigs (task.fixture) BD-075, BD-083, BD-084, BD-086, BD-092, BD-122 GATE-ARENA-04 on the referee: both negative controls are caught
BD-124 The two study types on the CPU: the anytime-valid e-process and the fixed-n exact study with its reachability pre-analysis (study.plan, study.submit, study.status, eval.preanalyze, eval.compare); INT-FSIM-14 BD-090, BD-122 GATE-ARENA-05; GATE-ATEL-06; INT-FSIM-14; a study that declares both types is refused
BD-125 Task families of M1: stand and recover, threshold delivery, timed docking, each with a requirement, labelled traces and a reference scorecard (eval.run, eval.scorecard) BD-118, BD-123, BD-124 Each task is reproducible on the referee from its TaskId, ModelId and seed; a changed seed changes the episode digest
BD-126 .fmission: the mission schema and its admission (mission.new, mission.check), with the quantifier order echoed BD-121 An empty or inconsistent domain is refused; a query written ∀w ∃u where ∃u ∀(w, e) is meant is echoed in the order written and fails the quantifier-order fixture
BD-127 Admission of the second linear-program solver (fsci-opt linprog) and of the airlock entries fs-ivl and fs-sos for mission work BD-007 The two solvers agree on the 51 docking programs of the pilot; a planted infeasible program is reported infeasible by both with a dual that checks
BD-128 frob-mission core: inner and outer design sets, cells, polarity, the proof rules on finite and polyhedral fragments, plain proof objects BD-052, BD-115, BD-126, BD-127 On the quantifier-order fixture the inner set lies inside the exact set and the outer set contains it; an answer formed by intersecting per-world answers is rejected
BD-129 The docking family: the finite game over causal histories with one velocity packet, and its scenario-tree comparator BD-041, BD-098, BD-128 GATE-AUGUR-03
BD-130 The stance family: body–load feasibility with vertex witnesses and dual exclusions, in lifted and projected form BD-042, BD-128 GATE-AUGUR-02
BD-131 The pusher battery: per-build and shared queries on one plant BD-043, BD-128 GATE-AUGUR-04
BD-132 frob-cert checkers for the mission proof kinds (lp-primal, lp-farkas, finite-game, alias-pair, partition, interval-box, trace-witness) BD-027 GATE-LEMMA-03
BD-133 Mission bundles: the writer in frob-lemma for inner cells and exclusions; prove.bundle, prove.verify, prove.list; frob-verbs runs the checker before an answer returns BD-129, BD-130, BD-131, BD-132 GATE-AUGUR-05; GATE-LEMMA-04: one accepted false certificate fails the gate
BD-134 The late-packet alias witness for the docking mission (sense.alias on enumerated worlds) BD-119, BD-129 The late-packet docking witness of GATE-SENS-09 is found and passes the checker; a pair of worlds with different transcripts is not reported as an alias
BD-135 mission.synthesize, mission.refute, mission.distinguish, mission.show, with budget stops BD-133, BD-134 A budget stop returns the certified cells and the unresolved remainder, each cell complete in itself; no unresolved cell is printed as a verdict
BD-136 The mission mutation corpus and the checker-independence campaign BD-135 GATE-AUGUR-01; GATE-AUGUR-06: zero false accepts over at least 200 mutated witnesses per proof kind
BD-137 The M1 verbs with schemas, examples and refusal lists BD-022, BD-024, BD-057, BD-059, BD-066, BD-077, BD-097, BD-107, BD-108, BD-110, BD-112, BD-113, BD-118, BD-120, BD-125, BD-135 GATE-TETHER-02 for the M1 verbs
BD-138 MCP tools generated for the M1 verbs in task clusters of at most seven, with session.open, session.show, session.focus, session.close BD-023, BD-137 The parity diff is empty and the served tools/list equals the registry under the name map; after session.focus the list holds at most seven tools plus the base three
BD-139 The reality: line on every report, and its negative battery BD-137 GATE-GROUND-01
BD-140 The first mission slice driven by a fresh agent through the CLI and MCP BD-136, BD-138 GATE-AUGUR-07
BD-141 The format registry rows and round trips for the formats that exist at M1 (.fbot, .fmodule, .fcard, .ftask, .fmission, .frun, .frobcert) BD-004, BD-057, BD-060, BD-069, BD-090, BD-122, BD-126, BD-133 GATE-WS-02 for these formats; a second parser for a registered extension fails check-contracts
BD-142 Parity baseline completed: incumbents on this Mac (CPU MuJoCo at 1, 24 and 36 threads; an incumbent with a Metal path) and native settings on trj BD-040 GATE-SPARK-21
BD-143 The incumbent design-loop phase ledger on trj: one agent-driven round timed by phase, cold and warm separated, with the ceilings of §2 recomputed from the measured shares BD-040 The ledger is on record under the disclosure block before any ratio against an incumbent is written; a repeat of the round reproduces each phase's share inside its stated interval
BD-144 Phylum pilot with no GPU code: padding overhead and bucket count of the first archetypes and of 1,000 generated designs under the bucket set BD-109 The pilot's numbers and its falsifier outcome are filed; the padding known answers 1.32, 1.58 and 1.76 for p = 1, 2, 3 reproduce
BD-145 Pre-registration of the rank-agreement experiment: design set, strata, the τ thresholds 0.7 and 0.5 fixed before data, and the compute request under OPEN-SPARK-2 BD-039, BD-124 The registration is committed before any paired training runs; a threshold edited after the first result is refused by the study record
BD-146 frob-conformance for M1: known answers against pinned oracles, the counterexample catalogue seeds, the smoke and fixtures batteries BD-025, BD-067, BD-088, BD-089, BD-123 GATE-GAUNT-01 for M1: every M1 gate has a registered negative control that it catches
BD-147 M1 exit review by a fresh-context session that did not implement the work; the schedule gate (BET-12, §40.5) BD-044, BD-049, BD-053, BD-085, BD-093, BD-095, BD-096, BD-111, BD-139, BD-140, BD-141, BD-142, BD-143, BD-144, BD-145, BD-146 Every gate of M1 has a recorded value and a caught negative control; NS-01, NS-07 and NS-22 are demonstrated; the schedule gate is evaluated; GATE-TENFOLD-02 and -09 are recorded

45.3 M2: batch, backends, families

M2 puts the batched step on batch-cpu, CUDA and Metal and decides by measurement the four questions the architecture leaves open: whether the derivation toolchain carries the kernel arithmetic, whether the contact law is adequate, whether Metal is a rollout tier, and whether mixed cohorts are the engine. The strict profile lands here (BD-161) because it runs on the batched kernels; the strict rows of the M1 gates close with it.

Bead Title Depends on Done when
BD-148 Packed lowering of RobotModel: depth levels, path tables, capacities, ShapeClassId BD-018, BD-061 The layout digest is stable across platforms
BD-149 Derive and emit K-fk-level and K-twist-level BD-019, BD-148 Parity with fs-mbd forward kinematics
BD-150 Derive and emit K-crba-level and K-rnea-level BD-149 Rows of GATE-KIN-03
BD-151 K-act-l1, K-act-l2, K-passive, and the shared-bus reduction K-act-bus BD-071, BD-075, BD-148 GATE-SINEW-03
BD-152 Utility kernels: K-scan, K-sort, K-reduce, K-seg-reduce, K-compact BD-014 Bitwise equal across worker counts; padding a reduction with −0.0 as the neutral element is caught
BD-153 K-jac-rows, K-cone-setup, K-cone-eval for CL-1 BD-050, BD-150 KKT and projection tests
BD-154 The four-dimensional contact cone (normal, two tangential, spin) in the Cone trait and the cone kernels BD-153 Cone rows of GATE-TRAC-04: coupled and diagonal forces within 0.5% of μ·N/√2 and μ·N; the pyramid and independent-row mutations fail
BD-155 K-joint-rows: stiction, backlash and hard stops on the batched tiers BD-084, BD-153 Joint rows of GATE-TRAC-04; GATE-SINEW-04 on batched tiers within the stated regularization; KILL-SINEW-ROWS decided
BD-156 K-scale-diag, K-hess, batched dense K-chol, exact K-linesearch, K-refine BD-154 Convergence on the battery with the gradient-norm certificate recorded; GATE-TRAC-10
BD-157 Articulated K-cay-step, K-normalize, K-anchor BD-149 Group-membership test over 10⁶ steps
BD-158 K-geom-pose, K-np-prim, K-bp-sort, K-bp-pairs: poses of primitives, primitive pairs, the deterministic broad phase BD-079, BD-148, BD-152 Primitive pair distances match the CPU primitives of GATE-TRAC-02 on its 10⁶ pairs, inside the class; the broad-phase pair order is identical across worker counts
BD-159 The batched step on batch-cpu in f64 and f32, with lockstep masks and capacity flags BD-151, BD-152, BD-155, BD-156, BD-157, BD-158 A quadruped drops, stands and walks under the baseline controller; GATE-KIN-03; a forced contact overflow is flagged Degraded, never dropped silently
BD-160 The tile program on fs-exec with fixed-slot reductions BD-159 Bitwise equal across worker counts
BD-161 The strict profile of batch-cpu: the transactional, event-located step in f64 on our own kernels BD-083, BD-093, BD-159 The strict rows of GATE-KIN-04, GATE-TRAC-01 and GATE-TRAC-06; the rate is printed with every strict result
BD-162 frob-scene: the .fscene scene-pack format, bricks, interpolation bounds, truncated fields with a stated range BD-005 Schema and round trip; a field value outside its stated range is refused, not clipped
BD-163 The scene compiler through the airlock, with analytic overlays (scene.compile, scene.show, scene.list) BD-007, BD-162 GATE-HAB-01
BD-164 The brick pool with one dense directory per scene variant BD-163 GATE-HAB-13; KILL-POOL decided
BD-165 Terrain generators with a difficulty parameter (scene.gen) BD-163 The same seed gives the same SceneId on Linux and macOS
BD-166 K-np-sdf with overlays and the pooled directory; K-np-thin BD-158, BD-164 The sphere-against-field known answer; a thin barrier between two clear endpoint poses is detected
BD-167 Rolling and torsional rows; interface cards by material pair and condition (contact.laws, contact.probe) BD-068, BD-154 Incline, rolling and mecanum known answers; a missing material pair is refused
BD-168 The contact battery on batched tiers; the tunneling audit; the capacity audit (contact.audit, contact.capacity) BD-085, BD-159, BD-161, BD-166, BD-167 GATE-TRAC-01 and GATE-TRAC-06 on batched tiers; GATE-TRAC-03; a verdict shaped by capacity is labelled capacity-biased
BD-169 Per-world parameter variants (level P-A): model, scene and task slots with a parameter row BD-159 batch-cpu rows of GATE-KIN-06: 256 parameter variants equal 256 homogeneous runs bit for bit
BD-170 Model variants inside padded capacities (level P-B): one model table per slot, masks, K-variant-gather BD-169 batch-cpu rows of GATE-PHYLUM-02; a padded link changes no digest of a real link
BD-171 Size buckets and phylum.plan BD-144, BD-170 Bucket plans reproduce the padding known answers; a population that needs more than eight buckets is reported against KILL-BUCKET
BD-172 CUDA backend: buffers, the step plan (frob.stepplan/1), launch-graph capture, stream-ordered pools, receipts BD-015, BD-159 The full step runs on one RTX 4090; GATE-SPARK-12
BD-173 The device arena, leases and the binary kernel cache (spark.cache, spark.precompile) BD-172 GATE-SPARK-11
BD-174 Metal backend: packed arguments, batch chains, snapshot blits, receipts BD-016, BD-028, BD-159 The full step runs on this Mac
BD-175 Device faults and cancellation BD-172, BD-174 GATE-SPARK-06
BD-176 spark.check and the divergence ledger BD-017, BD-020, BD-172, BD-174 GATE-SPARK-02; KILL-D1 decided per device family
BD-177 The decision-level equivalence test under class D3 BD-176 GATE-SPARK-16: a planted bias of one decision in fifty fails
BD-178 The placement planner with requested-versus-actual receipts per stage, and strict backends (spark.place, frob.placement/1) BD-172, BD-174 GATE-SPARK-09
BD-179 Anchored positions (cell side 8 m, offset in [−4, 4) m), the precision battery and the conditioning certificate BD-156, BD-172, BD-174 GATE-SPARK-05; GATE-SPARK-18; the uncentred [0, 8) shift fails the battery
BD-180 Randomness by address: K-x-philox and addressed draws BD-152 Draws depend on address alone; an implementation that draws sequentially is caught
BD-181 The batch-composition invariance test: co-tenancy, slot permutation, bucket capacity, shards BD-170, BD-172, BD-174, BD-180 GATE-SPARK-15; GATE-KIN-05
BD-182 Guarded predicates on devices over the contact battery BD-053, BD-168, BD-172, BD-174 GATE-MARROW-05; KILL-MARROW-GUARD decided
BD-183 Variants on devices: parameter variants, topology variants on one captured graph, a mixed batch of three body plans, admission of a variant into a free slot BD-170, BD-171, BD-172, BD-174 GATE-SPARK-10; device rows of GATE-KIN-06 and GATE-PHYLUM-02
BD-184 Admission and edit-to-first-step latency on the warm, cool and cold paths (phylum.sweep) BD-040, BD-173, BD-183 GATE-PHYLUM-04
BD-185 The control arm of the head-to-head: nine padded per-family templates with lockable joints and per-design parameter tables BD-169 Each template family of §14 runs as a homogeneous environment; the share of the mutation corpus the arm can express is recorded
BD-186 The mixed-batch head-to-head experiment with arms A, B, C and D, as a fixed-n study BD-039, BD-124, BD-181, BD-183, BD-184, BD-185 GATE-PHYLUM-03 published with all four arms; KILL-PHYLUM and KILL-BUCKET decided by the pre-declared outcomes
BD-187 Ray kernels; height scan, depth, lidar; proprioception with noise on batched tiers BD-099, BD-166, BD-172, BD-174 GATE-SENS-01; GATE-SENS-02
BD-188 Camera timing: exposure integration, rolling shutter and lidar beam instants BD-078, BD-187 GATE-SENS-06; KILL-EXPOSURE decided
BD-189 The clock contract and checkpointed packet queues on every tier BD-078, BD-098, BD-172, BD-174 GATE-SENS-04 and GATE-SENS-05 on every tier; KILL-SCHED decided
BD-190 The docking fixture in exact arithmetic on every backend BD-030, BD-129, BD-189 GATE-SENS-13
BD-191 Stills and pixel inspection (telemetry.stills, telemetry.inspect-pixel, telemetry.export-html) BD-187 A pixel maps to the right link in fixtures
BD-192 VecEnv with the corrected semantics E-1 to E-9: explicit reset, the preserved final observation, termination against truncation, typed spaces, access classes, snapshots, and masked automatic reset as a labeled mode BD-098, BD-159 GATE-CORTEX-06
BD-193 Device-resident tensor views with the stride converter and ownership epochs BD-036, BD-172, BD-174, BD-192 GATE-CORTEX-09
BD-194 Declarative task specifications with requirement terms, time-aware rewards, physical discounting and the likelihood of the applied action BD-122, BD-192 The 500 against 1,000 reward fixture is invariant under rate terms; the 2.000 and 1.995 discount fixture holds across control rates
BD-195 The settled-pose reset cache BD-192 GATE-ARENA-08
BD-196 On-device networks and optimizer (K-gemm, K-act-fn, K-adam); gradient parity with FrankenTorch BD-172, BD-174 GATE-CORTEX-02; KILL-LEARNKERN decided
BD-197 PPO under rules P-1 to P-11 BD-034, BD-194, BD-196 GATE-CORTEX-07: the battery passes, and three planted defects that reproduce the sibling's errors each fail it
BD-198 PPO training of the reference quadruped's flat velocity task, with negative controls; train.start, train.status, train.stop, train.export BD-193, BD-195, BD-197 GATE-CORTEX-01 on batch-cpu and on each GPU backend
BD-199 Sharding across both RTX 4090, and multi-device PPO under the global normalization rule BD-198 GATE-CORTEX-08; GATE-SPARK-20; KILL-SHARD decided
BD-200 Randomization from cards, drawn by address BD-069, BD-180, BD-192 A card field with no interval refuses randomization; two runs at one address draw the same value in any batch
BD-201 Task families of M2: velocity tracking and terrain traversal, with reference-robot scorecards BD-165, BD-194, BD-200 GATE-ARENA-01
BD-202 Fixture 2, fixture:quad-split-grip BD-167, BD-201 GATE-ARENA-06
BD-203 In-kernel digests (K-x-digest), per-stage digests, snapshots at the fence (K-commit, K-snapshot), replay (sim.replay) BD-090, BD-159, BD-172, BD-174 GATE-CHRON-01
BD-204 Teleport with step and stage localization (sim.replay --tier) BD-176, BD-203 GATE-CHRON-02
BD-205 Forks from snapshots by indexed copy, and their classification into the five classes of §27.4 (run.fork) BD-203 GATE-CHRON-05; GATE-AUTOPSY-01; GATE-AUTOPSY-02
BD-206 The first-divergence search over the digest chain, in exact and tolerance modes (telemetry.divergence) BD-203 GATE-CHRON-06; GATE-AUTOPSY-07
BD-207 Telemetry on devices: the reservoir by address, deterministic integer histograms (K-x-hist, telemetry.histogram), the cost of T0 to T2 BD-180, BD-203 GATE-CHRON-07; GATE-CHRON-13
BD-208 The energy ledger on batched tiers (K-ledger-step) and the audit for energy created by the simulator (fidelity.energy) BD-092, BD-159, BD-172, BD-174 Single-precision rows of GATE-CHRON-03 and GATE-SINEW-02; GATE-CHRON-08; GATE-FID-06
BD-209 Retention and collection with tombstones (store.status, store.collect) BD-095 GATE-CHRON-12
BD-210 The crash-consistent job protocol on devices: chunk publish, leases, cancel, restart; job.list, job.status, job.wait, job.find, job.cancel BD-091, BD-096, BD-172, BD-174 Device rows of GATE-CHRON-04 and GATE-CHRON-11; GATE-TETHER-08
BD-211 Atomic idempotency binding, pagination pinned to a committed frontier, integers above 2⁵³ as strings BD-059, BD-210 GATE-TETHER-05; GATE-TETHER-06; GATE-TETHER-07
BD-212 The standard battery, frozen; the fidelity ledger with its frozen envelopes (fidelity.ledger) BD-123, BD-168, BD-202, BD-208 GATE-FID-01, with the one permitted re-baseline written down; GATE-KIN-07; GATE-ARENA-04 on the batch tiers; KILL-CONTACT decided
BD-213 The referee's own coverage report per robot class (fidelity.coverage) BD-161, BD-212 GATE-FID-03
BD-214 The sampled background referee (fidelity.shadow): address-hashed sampling, snapshots, one-step defects, the coverage figure on every receipt BD-161, BD-203, BD-212 GATE-FID-07 at the M2 exit: the share of device world-seconds shadowed is reported with a throughput loss of at most 5% (row 17 of §36.3); a run with no sampler prints a share of zero
BD-215 The noninterference test, and the causal-policy test on every tier BD-119, BD-191, BD-203, BD-207 GATE-SENS-03; GATE-SENS-12
BD-216 The performance harness: unit ordering, the paired lower bound, the disclosure block BD-025, BD-029 GATE-SPARK-19
BD-217 Profile, optimize one lever at a time, measure, disclose: the throughput parity rows BD-142, BD-160, BD-183, BD-198, BD-216 GATE-SPARK-03 and GATE-SPARK-04 recorded as measured, pass or fail; KILL-PARITY and KILL-METAL decided
BD-218 Training-time parity on one RTX 4090 BD-217 GATE-CORTEX-05
BD-219 The sim.estimate cost and memory model BD-217 GATE-SPARK-22
BD-220 Memoized episodes under class D2 on one fingerprint; INT-FSQL-02 BD-111, BD-203 Episode part of GATE-ATEL-12; INT-FSQL-02; an episode recorded on another fingerprint is not served
BD-221 The derivation toolchain measured against KILL-KIR; INT-FJAX-01 only if the profile asks for rewrite rules BD-150, BD-156, BD-217 The share of kernel arithmetic the toolchain expresses and emits, and the emitted kernels' speed against BET-01's bound, are recorded; KILL-KIR decided
BD-222 The M2 verbs with schemas, examples and refusal lists BD-137, BD-173, BD-178, BD-186, BD-188, BD-191, BD-198, BD-204, BD-205, BD-206, BD-209, BD-211, BD-213, BD-214, BD-219 GATE-TETHER-02 for the M2 verbs
BD-223 frob-conformance for M2: the standard battery wiring, metamorphic relations, chaos tests on devices BD-146, BD-175, BD-179, BD-212, BD-215 GATE-GAUNT-01 for M2
BD-224 M2 exit review by a fresh-context session that did not implement the work; kill decisions as ADRs BD-147, BD-177, BD-182, BD-190, BD-199, BD-218, BD-220, BD-221, BD-222, BD-223 Every gate of M2 has a recorded value and a caught negative control; the kill decisions for the kernel toolchain, contact, Metal and mixed batches are recorded as ADRs

45.4 M3: places, tasks, adversaries, qualification

M3 adds the seven interior archetypes, the task families, Nemesis, Autopsy, the qualification lane and the full agent surface, and ends with the partial ten-fold gate on legged and wheeled briefs. The partial gate is GATE-TENFOLD-06 and the tournament is GATE-TENFOLD-07 (§39.18, §40.5); BD-314 to BD-317 cite the gates they close.

Bead Title Depends on Done when
BD-225 The interior grammar mechanism and the structural proxies of the warehouse and the commercial kitchen, with doors, ramps, thresholds, stairs, glass and mirror regions BD-165 1,000 seeds per archetype satisfy every dimensional constraint of the grammar; the same seed gives the same SceneId on Linux and macOS
BD-226 Structural proxies of the home, apartment, office, manufacturing plant and retail store BD-225 1,000 seeds per archetype satisfy every constraint; repeated modules land on the coarse lattice and their bricks are stored once
BD-227 Hazard lists: registries/hazards/<archetype>.toml with dimension ranges, mechanisms, provoked failures and provenance (scene.hazards) BD-226 A pack counts the assumed dimensions it used; a report that claims a scene is representative while that count is non-zero is refused (FROB-REF-312)
BD-228 Scene acceptance (scene.accept) BD-225 GATE-HAB-04
BD-229 Optical and friction properties as separate maps; fixtures and movable objects BD-225 GATE-HAB-05
BD-230 The film-friction law: Habitat's thickness state and Traction's cone row (K-film) BD-154, BD-167, BD-229 GATE-HAB-06; GATE-TRAC-05; KILL-FILM decided
BD-231 Rigid proxies: a rug as a free slab, a cord as a fixed ridge or a free rod, clutter as rigid bodies BD-225 The free-slab rug slides in the castor case, where a fixed step would not
BD-232 The mesh path with enclosures and a bounding-volume hierarchy; thin-feature detection BD-166 A feature thinner than the brick bound is routed to thin primitives or refused (FROB-REF-320); KILL-MESHGPU decided
BD-233 Clearance complexes .fclear: two-sided cells, path witnesses and component cuts; enclosure tests (contact.clearance); A-18 BD-053, BD-132, BD-163, BD-232 GATE-HAB-10; GATE-TRAC-07; KILL-FCLEAR decided
BD-234 Feasibility tags for generated scenes, from the clearance complex BD-226, BD-233 GATE-HAB-02
BD-235 Train and test hygiene: scene.split, building-level holdouts, mirrored layouts and edited variants BD-226 GATE-HAB-14; GATE-ARENA-02
BD-236 The world bank (scene.bank): resident scenes under the admission cap, a change of scene at reset BD-164, BD-183, BD-226 GATE-HAB-12; KILL-BANK-BREADTH decided
BD-237 Optical failure modes: mirror, glass, steam, pattern dropout, with a reason on every masked sample BD-187, BD-229 GATE-SENS-07
BD-238 Sensor cards with failure modes and per-field provenance BD-237 GATE-SENS-14
BD-239 The empirical observability Gramian on batched tiers BD-120, BD-187 GATE-SENS-08
BD-240 The alias-witness search over admitted world families (sense.alias) BD-134, BD-225 GATE-SENS-09; KILL-ALIAS decided
BD-241 Γ_obs per robot and task, with the equivariance test (sense.symmetry) BD-102, BD-187 GATE-SENS-10
BD-242 Sensor calibration as a least-squares pose graph (sense.calibrate) BD-187 GATE-SENS-11
BD-243 A-09 connection curvature, A-14 sensor coverage, A-16 sensitivity; INT-FSIM-10 BD-007, BD-106, BD-187 The connection curvature on the snake crawler has the sign fixed in §13.8, and a planted sign flip of the bracket term is caught; INT-FSIM-10
BD-244 Preflight stages 7 (place) and 8 (information) BD-110, BD-233, BD-240, BD-243 GATE-SKEL-04 for stages 7 and 8; KILL-SKEL-ALIAS decided
BD-245 Contact laws for the remaining archetypes on all tiers: belt, skid, pad, roller-wheel, wheel-rolling BD-167 Skid turning in place costs the scrub work of the belt-law known answer; a no-slip model of the same base is caught
BD-246 The remaining fourteen archetypes BD-060, BD-102, BD-109, BD-245 Each compiles and passes stages 1 to 6 with no refusal; GATE-SKEL-07; GATE-MARROW-03
BD-247 Baseline controllers for every archetype: multi-legged, biped balance, steered, omnidirectional, tracked, hybrid, arm on a base BD-118, BD-159, BD-246 GATE-SKEL-03; GATE-REFLEX-01 on referee and batch-cpu
BD-248 The design corpus: about 200 designs with frozen labels, planted defects, planted winners and planted single causes BD-246 The hash of the label file is committed before any analysis is tuned; a relabel changes the corpus identity
BD-249 Validation of baseline synthesis on the corpus BD-110, BD-247, BD-248 GATE-REFLEX-02; KILL-BASELINE decided
BD-250 Validation of static analysis on the corpus BD-110, BD-124, BD-248 GATE-ATEL-01; KILL-STATIC decided
BD-251 Control programs with layer records, infeasibility certificates and fallback events BD-115, BD-132, BD-247 GATE-REFLEX-05
BD-252 The sampling-based predictive controller as a fallback (control.mpc; K-fork, K-cost, K-weight) BD-205, BD-247 The controlled world's digest does not change with the fork count; FROB-REF-817 fires on a planted acceptance request
BD-253 Task families of M3: interior navigation, payload transport, low-friction crossing, tight-space maneuvering BD-201, BD-230, BD-231, BD-234, BD-247 GATE-ARENA-01 for these families, with reference-robot scorecards on the warehouse and kitchen proxies
BD-254 Metrics, scorecard accounting and the batteries standard, full, hard, covering BD-253 GATE-ARENA-07
BD-255 Requirement verdicts on batched tiers: streaming past-time monitors, task.verdict, task.settle, frob.verdict/1 BD-194, BD-253 GATE-CORTEX-10
BD-256 The requirement-writing test with a fresh agent BD-138, BD-255 GATE-ARENA-09
BD-257 The requirement reward-term pilot under three arms BD-198, BD-255 KILL-SPEC-REWARD decided from five seeds per arm
BD-258 Capabilities, namespaces and many agents: scopes, session budgets, the path jail BD-210, BD-211 GATE-SAFE-10; a session without the scope receives the refusal and no partial data
BD-259 The blinded qualification lane: sealed world clusters, pre-committed requests, receipts, the error budget α_i = α / [i·(i+1)] (eval.qualify, eval.ledger) BD-124, BD-235, BD-255 A planted true gain of the declared size is promoted within 10 requests in at least 80% of campaigns; the same adversary against reused clusters at a constant level is caught
BD-260 The 500-retry gate on no-signal worlds BD-259 GATE-QUAL-01
BD-261 The confirmation firewall: capability scopes qual:admin and qual:run, the sealed-field audit BD-258, BD-259 GATE-QUAL-02; GATE-SAFE-03
BD-262 Anytime-valid paired comparison on devices (eval.compare, study.compare, explain.compare) BD-124, BD-181, BD-192 Type-I error at or below α under optional stopping over 10⁴ null comparisons (row of GATE-ATEL-04); a D4 arm in a paired comparison is refused
BD-263 The trust ladder and the promotion rule with the DC-01 table (eval.promote) BD-212, BD-262 GATE-FID-02: a planted tier-sensitive policy is caught (NS-09)
BD-264 The tier-correction ledger: control variate and doubly robust correction BD-263 GATE-CHRON-09; GATE-FID-08; KILL-DR decided
BD-265 Rank agreement between tiers on the 40-design set (eval.rank-agreement on a tier pair) BD-248, BD-263 GATE-FID-04; KILL-RANK decided for tier pairs
BD-266 The model-form rank check (fidelity.modelform) BD-208, BD-263 GATE-FID-05; GATE-CORTEX-15
BD-267 Exploitation detectors (eval.detect) BD-208, BD-263 GATE-CORTEX-04
BD-268 The background referee at its gate BD-214, BD-264 GATE-FID-07 repeated with the tier-correction ledger; KILL-SHADOW decided
BD-269 Determinism-class licences and the labeled D4 training profile BD-177, BD-198, BD-262 GATE-SPARK-17; GATE-SAFE-09
BD-270 The Nemesis search space and the legality set (frob.legality/1), with the hazard registries as the scene-edit vocabulary BD-227 100 of 100 planted illegal edits are refused (row of GATE-NEMESIS-01)
BD-271 The solvability oracle (nemesis.oracle) BD-233, BD-252, BD-270 GATE-NEMESIS-01
BD-272 The artifact guard BD-263, BD-270 GATE-NEMESIS-06
BD-273 The falsification score and the search (nemesis.search) BD-255, BD-271, BD-272 GATE-NEMESIS-02; KILL-NEMESIS decided
BD-274 Shrinking to a minimal counterexample world .fmcw (nemesis.shrink) BD-273 GATE-NEMESIS-03; KILL-MCW decided
BD-275 The hard-world set (nemesis.hardset, frob.hardset/1) BD-254, BD-274 A hard world offered as a confirmation sample is refused; adopting one into a regression battery changes the battery's identity
BD-276 Rare failures, certification lane: bounded-weight estimation with the defensive mixture (nemesis.bound) BD-273 GATE-NEMESIS-04
BD-277 Rare failures, exploration lane: splitting BD-276 GATE-NEMESIS-05; KILL-RARE decided
BD-278 Scene-set coverage by submodular selection (nemesis.cover) BD-226, BD-254 GATE-NEMESIS-08
BD-279 Interventions and the placebo fork (autopsy.intervene) BD-205 A placebo fork equals replay on 1,000 worlds; a mid-episode gear change is refused with the right fields
BD-280 Interventional contrasts with flip rates, in double precision (autopsy.attribute) BD-248, BD-279 GATE-AUTOPSY-03; KILL-AUTOPSY decided
BD-281 Coalitions and budgeted Shapley summaries BD-280 GATE-AUTOPSY-04
BD-282 The decision model for attribution, with abstention (DC-06) BD-280 GATE-AUTOPSY-05
BD-283 Design parameters re-run from the episode start (autopsy.rerun) BD-072, BD-279 GATE-AUTOPSY-06
BD-284 Time-travel debugging as an agent workflow (autopsy.repair, autopsy.show) BD-206, BD-281, BD-282, BD-283 A recorded transcript replays to the same repair; citing an attribution as established is refused (FROB-REF-880)
BD-285 Campaign quotienting: the similarity canonical form, orbit representatives, the mission-observable digest (phylum.quotient) BD-049, BD-170, BD-241 GATE-PHYLUM-01; KILL-QUOTIENT decided
BD-286 The invalidation contract for reuse across designs (phylum.reuse) BD-220, BD-285 GATE-PHYLUM-05
BD-287 The morphology generator with GeneratorId and DesignSplit (phylum.generate) BD-246, BD-285 GATE-PHYLUM-07
BD-288 Monotone transport of verdicts, with its falsification harness BD-135 GATE-AUGUR-08
BD-289 The region-certificate pilot of §25.6 on the 12-parameter box BD-135 The undecided share of the best arm and the largest share from one monotone bound are on file; KILL-AUGUR-REGION decided before the work package is funded
BD-290 Alias and jaw fixtures; mission.refute on the blind payload task BD-135, BD-240 GATE-AUGUR-10; KILL-AUGUR-ALIAS decided
BD-291 Probe and instrument design (mission.distinguish, scene.probe-request) BD-135 The pilot of GATE-AUGUR-11; KILL-AUGUR-PROBE decided
BD-292 The revalidation engine behind result.revalidate and mission.revalidate: dependency grades 1 and 2, polarity BD-135, BD-220, BD-288 GATE-AUGUR-12; dependency-grade rows of GATE-ATEL-11; KILL-AUGUR-REUSE decided
BD-293 Separation of two designs by a minimized world pair (mission.separate) BD-135, BD-202, BD-274 GATE-AUGUR-13; KILL-AUGUR-SEPARATE decided
BD-294 Checker independence repeated over every proof kind in use at M3 BD-136, BD-233, BD-251, BD-290 GATE-AUGUR-06 at M3
BD-295 The daemon: persistent environments with slot-level episode dispatch BD-181, BD-183, BD-210 GATE-TETHER-09; KILL-SLOT decided
BD-296 Size classes, shortest estimated work and preempt-resume, with the DC-09 table BD-219, BD-295 GATE-TETHER-10; KILL-PREEMPT decided
BD-297 Estimates and budgets: calibrated intervals per stratum BD-296 GATE-TETHER-11
BD-298 The full MCP surface: seventeen task clusters, the bounded synchronous wait, progress and cancellation, resources, prompts BD-138, BD-258, BD-295 GATE-TETHER-12; KILL-MCPTASKS decided
BD-299 The three failure classes on both surfaces BD-298 GATE-TETHER-04
BD-300 The dashboard frob-tui (INT-FTUI-01) and the viewer overlays (INT-F3D-01) BD-191, BD-295 GATE-TETHER-14; INT-FTUI-01; INT-F3D-01; KILL-TUI decided
BD-301 The Gymnasium-compatible adapter bindings/frob-gymnasium BD-192, BD-198 GATE-CORTEX-16; KILL-GYMADAPT decided
BD-302 report.design, report.run, report.campaign, report.mission BD-095, BD-135, BD-254, BD-263 Every number in a report resolves to its evidence through evidence.trace; a model-conditional result printed without its condition is refused
BD-303 The no-authorization flags on every exporting verb BD-027, BD-222 GATE-SAFE-01
BD-304 Imported text as data: the x-frob-untrusted mark through every verb that echoes imported text BD-298 GATE-SAFE-02
BD-305 Private places and licences: the private mark, licence joins, scene.purge BD-209, BD-225 GATE-SAFE-04; GATE-SAFE-05
BD-306 Supply-chain checks: one asupersync package per workspace, committed lockfiles, kernel-cache integrity BD-008, BD-173 GATE-SAFE-06
BD-307 Importer fuzz targets and limits BD-066, BD-163 GATE-SAFE-07
BD-308 The claim product at the boundary BD-222 GATE-SAFE-08
BD-309 Decision-core tables DC-01, DC-09 and DC-10 in registries/cores/ (cores.show) BD-263, BD-278, BD-296 Rows of GATE-ATEL-13 for these cores: each table regenerates bit-identically and each fallback is demonstrated by forcing its trigger
BD-310 The rank-agreement and ladder pilots on an incumbent engine or on batch-cpu BD-145, BD-248, BD-265 The pilot record of GATE-CORTEX-12 exists with τ, top-10 recall and intervals per class; pilot rows of GATE-ATEL-07 and GATE-ATEL-08
BD-311 The published-anchor comparison under the Parity label BD-139, BD-212 A report prints reality: published-anchor with its source and issues no band
BD-312 The M3 verbs with schemas, examples and refusal lists BD-222, BD-228, BD-234, BD-235, BD-236, BD-238, BD-239, BD-242, BD-244, BD-251, BD-259, BD-266, BD-267, BD-269, BD-275, BD-277, BD-284, BD-286, BD-287, BD-291, BD-292, BD-293, BD-297, BD-302 GATE-TETHER-02 for the M3 verbs
BD-313 robot-docs, the skill file and the two worked sessions; the fresh-agent test BD-298, BD-299, BD-312 GATE-TETHER-01
BD-314 The partial ten-fold gate, protocol: sealed legged and wheeled briefs, strata, the decision rule with its reachable verdicts, the ceilings, the adjudicating evaluator BD-124, BD-143, BD-218, BD-260 GATE-TENFOLD-03, -04, -05, -10, -11: the protocol is committed before either arm runs; a stratum whose computed ceiling is below its claimed ratio is refused
BD-315 The partial ten-fold gate, incumbent arm: the strongest composed rival at pinned versions, warm, driven through its own tools and the adapter BD-039, BD-301, BD-314 Restricted mean times to an independently accepted answer are recorded per brief with the phase ledger, cold and warm runs separated
BD-316 The partial ten-fold gate, our arm: fresh agents on the full MCP surface BD-249, BD-261, BD-273, BD-280, BD-294, BD-302, BD-313, BD-314 Restricted mean times are recorded per brief with the phase ledger; one false certificate disqualifies the arm (KILL-AUGUR-FALSECERT)
BD-317 The partial ten-fold gate, adjudication and record BD-315, BD-316 GATE-TENFOLD-06 and GATE-TENFOLD-13: the ratio and the recovery ratios are recorded whatever they are, under the rule of BET-13; KILL-FAMILYCERT and KILL-AUGUR-TIE decided
BD-318 frob-conformance for M3: the hard and covering batteries, the planted-defect registries of Nemesis and Autopsy, the hostile-input corpora of §37 BD-223, BD-275, BD-278, BD-284, BD-304, BD-306, BD-307, BD-308 GATE-GAUNT-01 for M3
BD-319 M3 exit review by a fresh-context session that did not implement the work BD-224, BD-250, BD-256, BD-257, BD-268, BD-289, BD-300, BD-303, BD-305, BD-309, BD-310, BD-311, BD-317, BD-318 Every gate of M3 has a recorded value and a caught negative control; the partial ten-fold gate is recorded, whatever the ratio

45.5 M4: amortized control, co-design, mission queries at scale

Most mechanisms of M4 are Frontier. Each of their beads closes with its kill gate decided, and a bead whose pilot has no recorded result is not ready (§45.11).

Bead Title Depends on Done when
BD-320 Family policies per morphology class: link tokens, the mapping table (frob.policy/1), pretraining on a GeneratorId with a DesignSplit (train.family) BD-183, BD-198, BD-287 The pilot of §23.22 has run and its falsifier outcome is on file; a design outside the class is declined, not scored
BD-321 The family-policy experiment on held-out parametric designs, with the fine-tuning rungs BD-320 GATE-CORTEX-11; KILL-FAMILY decided
BD-322 Inheritance along design edits (train.inherit, policy.apply) BD-058, BD-320 GATE-CORTEX-13; KILL-INHERIT decided
BD-323 Distillation from baseline, specialist and sampling-controller teachers (train.distill) BD-198, BD-247, BD-252 GATE-CORTEX-14; KILL-DISTILL decided
BD-324 Pilots of the other learning algorithms of §23.22 against PPO at equal wall-clock BD-039, BD-198 Each pilot's result is on file; KILL-ALTALGO decided per algorithm, and no algorithm is built without a passed pilot
BD-325 Equivariant linear maps by irreducible blocks under Γ_obs BD-048, BD-241 GATE-MARROW-04; KILL-MARROW-BLOCKS decided
BD-326 The three-arm equivariance experiment BD-198, BD-325 GATE-CORTEX-03; KILL-EQUIV decided
BD-327 Symmetric controllers under stabilizer intersection (control.symmetry) BD-241, BD-247 GATE-REFLEX-07
BD-328 The rank-agreement experiment on our engine, per morphology class and task family (eval.rank-agreement; the model-form check is fidelity.modelform) BD-249, BD-310, BD-321 GATE-CORTEX-12; GATE-ATEL-07; GATE-REFLEX-04; KILL-RANK decided for rungs
BD-329 The ladder of rungs R0 to R5: the fixed halving table and the calibrated layer with DC-02 and DC-03 BD-250, BD-263, BD-276, BD-328 GATE-ATEL-08; KILL-LADDER decided
BD-330 An inspectable baseline plus a learned residual (control.ladder) BD-198, BD-247 The residual rung's steps against a specialist's are recorded on the corpus; KILL-RESIDUAL decided
BD-331 The sampling controller at its gate BD-252, BD-328 GATE-REFLEX-06; KILL-MPC decided
BD-332 The gait atlas and max-plus timing; A-04 (gait.atlas) BD-048, BD-110, BD-247 Trot, pace and bound appear as (H, K) pairs for the quadruped and the tripod gait for the hexapod; GATE-ATEL-02 complete for A-01 to A-14
BD-333 Gaits as hybrid orbits: return maps, saltation, Floquet multipliers (gait.orbit); INT-FSIM-13 BD-161, BD-332 GATE-GAIT-01; INT-FSIM-13
BD-334 Labeled derivatives through events (gait.gradient) BD-333 GATE-GAIT-02
BD-335 Continuation of orbits in morphology, and orbit screening (gait.continue) BD-328, BD-333 GATE-GAIT-03; KILL-GAIT decided
BD-336 Skill artifacts .fskill, the exact layer (skill.compile, skill.check, skill.show) BD-251 GATE-REFLEX-08
BD-337 The energy-budget safety tier .fenergy, with the exact-integer monitor K-energy-monitor and its proof kind (shield.budget) BD-053, BD-132, BD-208 GATE-SHIELD-01; KILL-ENERGY decided
BD-338 Runtime shields with a backup controller (shield.fit, shield.check) BD-251, BD-337 GATE-SHIELD-02
BD-339 Shields on in-envelope and shifted worlds BD-198, BD-338 GATE-SHIELD-03; KILL-SHIELD decided
BD-340 The measured shield margin with its drift alarm (shield.report) BD-339 GATE-SHIELD-04
BD-341 Optimization and racing (opt.start, opt.status) BD-183, BD-262 A null race keeps the best design with probability at least 1 − α; a race with a planted winner returns it
BD-342 The quality-diversity archive and maps per dispatch (opt.archive, phylum.map) BD-287, BD-341 GATE-PHYLUM-08; merging two agents' archives in both orders gives identical bytes
BD-343 Lineage bisect and merge (design.bisect) BD-113, BD-262 Bisect row of GATE-ATEL-04: the planted edit is found in at least 95 of 100 trials; bisect on a non-monotone predicate is refused
BD-344 Registered predictions (predict.register, predict.report) BD-341 A prediction registered after its outcome exists is refused; a report scores every registered prediction, the failed ones included
BD-345 Screening audits: sampled discarded strata and the planted winner (nemesis.audit, applied by the cascade) BD-248, BD-329 GATE-ATEL-09; GATE-NEMESIS-07
BD-346 Rank robustness of finalists inside the cascade (A-19) BD-266, BD-329 GATE-ATEL-10
BD-347 Revalidation grades 3 and 4 BD-292 GATE-ATEL-11; KILL-REUSE decided
BD-348 The remaining analyses: A-24 task-wrench attainability, A-25 identifiability, A-26 regime atlas BD-233, BD-265, BD-336 GATE-ATEL-05; KILL-ATLAS decided
BD-349 Decision-core tables DC-02 to DC-08 and DC-11 BD-276, BD-282, BD-309, BD-329, BD-341 GATE-ATEL-13
BD-350 Composition of decision cores: the nine interference tests BD-349 GATE-ATEL-14
BD-351 Experiment suggestion by value of information (experiment.suggest) BD-291, BD-341 GATE-ATEL-15; GATE-AUGUR-11; KILL-VOI decided
BD-352 The six-stage co-design cascade (opt.cascade, report.campaign) BD-260, BD-285, BD-329, BD-335, BD-342, BD-345, BD-346, BD-347 GATE-ATEL-16; NS-06 demonstrated
BD-353 Paired finite-difference design gradients (phylum.gradient) BD-183, BD-341 GATE-PHYLUM-06; KILL-FDGRAD decided
BD-354 The ceiling-before-speed check on every registered speed comparison BD-135, BD-216 GATE-AUGUR-14
BD-355 Mission queries over families on the GPU: the 65,536-row screen and a 1,024-design family batch under the exact-integer or guarded class BD-135, BD-182, BD-183, BD-190 GATE-AUGUR-15
BD-356 Design-family lanes (level P-C) with the speedup bound 1/(1 − f + f/r + h) BD-354, BD-355 Measured f, r and h are recorded on the strong baseline before any ratio is quoted; KILL-FAMILYLANE decided
BD-357 Quotients, cuts and cell refinement in family search BD-285, BD-355 False cuts on the frozen catalog and the evaluation cost saved are recorded; KILL-AUGUR-CUTS decided
BD-358 Region certificates on small sub-boxes BD-289, BD-355 GATE-AUGUR-09
BD-359 Product-system dominance BD-135, BD-161 GATE-AUGUR-16; KILL-AUGUR-DOMINANCE decided
BD-360 The co-design fixed-point lane of frob-synth (mission.synthesize with strategy codesign) BD-103, BD-135 Co-design rows of GATE-AUGUR-17; KILL-SYNTH-CODESIGN decided
BD-361 Bounded exact linkage synthesis through the derivation subprocess, emitting a .fmodule (strategy linkage) BD-060, BD-101, BD-135 Linkage rows of GATE-AUGUR-17; KILL-SYNTH-LINKAGE decided
BD-362 Trajectory optimization with design variables (strategy refine) BD-135, BD-334 GATE-AUGUR-18; KILL-SYNTH-TRAJOPT decided
BD-363 Label queries on supplied command sets BD-135 GATE-AUGUR-19; KILL-AUGUR-LABELS decided
BD-364 Mission bundles for family answers, re-checked on a second machine BD-355, BD-358 GATE-LEMMA-04 at M4
BD-365 Tyre laws, tracks and hybrids on all tiers BD-245 Known answers of §18.16 for these laws; NS-08 demonstrated
BD-366 Soil mechanics: plate sinkage, drawbar pull, ruts as per-world mutable state (contact.soil) BD-365 GATE-TRAC-08; KILL-SOIL decided
BD-367 The contact response batch with per-column bounds and reroutes (contact.response) BD-168 The share of columns the guard reroutes on battery states is recorded; KILL-RESPONSE decided
BD-368 Moving surfaces and the task families of M4: conveyors, stair and curb climbing for wheels and tracks, reach and carry BD-253, BD-365 GATE-ARENA-01 for these families; a belt whose boundary work is left off the energy ledger is caught
BD-369 The retrofit catalog registries/retrofits.toml with priced kits, and scene.retrofit on a .fmcw BD-227, BD-233, BD-274 GATE-HAB-11; KILL-RETROFIT decided; NS-18 demonstrated
BD-370 The fleet scheduler across the two machines (fleet.status, fleet.plan) BD-199, BD-296 GATE-SPARK-13; KILL-FLEET decided
BD-371 Specialized kernels for survivors BD-217, BD-352 GATE-SPARK-14; KILL-SPECIALIZE decided
BD-372 The one-call pipeline solve.run, which calls opt.cascade BD-298, BD-352 Second arm of GATE-TETHER-13, the same A/B as GATE-ATEL-03; KILL-SOLVE decided
BD-373 The mission session with a fresh agent BD-298, BD-355 GATE-TETHER-13
BD-374 The agent-surface A/B on the design benchmark BD-298, BD-352 GATE-ATEL-03
BD-375 Autopsy against logs and explain alone, with agents on the planted-defect designs BD-248, BD-284, BD-298 GATE-AUTOPSY-08
BD-376 The M4 verbs with schemas, examples and refusal lists BD-312, BD-322, BD-323, BD-327, BD-330, BD-331, BD-334, BD-335, BD-340, BD-343, BD-344, BD-348, BD-351, BD-352, BD-353, BD-360, BD-361, BD-362, BD-363, BD-366, BD-367, BD-369, BD-370, BD-372 GATE-TETHER-02 for the M4 verbs
BD-377 frob-conformance for M4: the calibration sets, the frozen 30-amendment campaign, the seeded cascade population BD-318, BD-350, BD-352, BD-364 GATE-GAUNT-01 for M4
BD-378 M4 exit review by a fresh-context session that did not implement the work BD-319, BD-324, BD-326, BD-356, BD-357, BD-359, BD-368, BD-371, BD-373, BD-374, BD-375, BD-376, BD-377 Every gate of M4 has a recorded value and a caught negative control; rank agreement is measured and the family-policy bets are decided

45.6 M5: proofs, reality, manufacture

The Reality lane is an import lane. BD-397 closes on a record or on a recorded no-claim, and no bead waits for bench data (§30.17).

Bead Title Depends on Done when
BD-379 Certificate coverage for derived kernels BD-027, BD-221 GATE-LEMMA-01; KILL-LEMMA decided; NS-11 demonstrated
BD-380 INT-FLN-01 and INT-FLN-02: the Lean project under lean/ and the fln checker on a Linux host BD-001 INT-FLN-01; INT-FLN-02: a true port identity is admitted and its sign-mutated twin is rejected
BD-381 Lean theorem cards as sealed capsules (proof kind lean-capsule) BD-027, BD-380 GATE-LEMMA-02
BD-382 The reflection pilot: Farkas and rational LDLᵀ reflectors (prove.reflect) BD-132, BD-381 GATE-LEMMA-05; KILL-REFLECT decided
BD-383 Qualification campaigns replayed by frob-verify BD-132, BD-260 GATE-QUAL-03
BD-384 The articulated variational integrator on the referee and the strict profile BD-087, BD-161 Momentum and energy known answers of §16.16; cost at matched accuracy recorded against the factor-two limit; KILL-VARIATIONAL decided
BD-385 The tree-operator route for larger mechanisms and limb port packets, as a pilot BD-060, BD-159 The pilot's result is on file with PO-SKEL-04; KILL-TREEOP and KILL-SKEL-PORT decided
BD-386 The hard-contact law CL-H as a batch law on batch-cpu BD-154, BD-161, BD-266 GATE-TRAC-09 on batch-cpu; KILL-HARDCONTACT decided
BD-387 Ground data admission: the dataset manifest (frob.ground.dataset/1), cells, sealed validation and holdout splits (ground.ingest) BD-007, BD-090, BD-305 A dataset with no declared cell is refused; a read of a sealed split before its prediction is frozen is refused
BD-388 The synthetic rehearsal: a synthetic dataset generated with planted parameters BD-187, BD-208, BD-387 The known answers of §30.21 reproduce; every output of the rehearsal prints synthetic in its evidence
BD-389 Clock fitting BD-078, BD-388 GATE-GROUND-02; KILL-CLOCK decided
BD-390 Identifiability analysis and excitation design (ground.excite) BD-348, BD-388 GATE-GROUND-03
BD-391 Identification, actuators first, and card updates from logs (ground.identify) BD-069, BD-389, BD-390 GATE-GROUND-04; KILL-GROUND decided
BD-392 Frozen predictions, sealed trials and holdout retirement (ground.predict, ground.score) BD-344, BD-387 GATE-GROUND-05
BD-393 Conformal reality bands per calibrated cell, with the DC-07 table (ground.band) BD-391, BD-392 GATE-GROUND-06
BD-394 Drift detection that retires a calibration BD-393 GATE-GROUND-07; KILL-BAND decided
BD-395 As-built ingestion BD-062, BD-387 GATE-GROUND-08; KILL-ASBUILT decided
BD-396 The replication kit (ground.kit) BD-305, BD-392 GATE-GROUND-09; KILL-KIT decided
BD-397 The Reality lane's first record BD-393, BD-394 GATE-GROUND-10: a frozen prediction scored on sealed data with a band issued, or a recorded no-claim with its reason
BD-398 Real-place ingestion (scene.import, scene.fit); INT-FDGR-01 BD-228, BD-291, BD-305 GATE-HAB-03; INT-FDGR-01; KILL-INGEST decided
BD-399 Asset-populated interiors with their licences BD-226, BD-305 A populated scene keeps the launch shape and the determinism class of its batch; KILL-DRESSING decided
BD-400 Load cases and spectra extracted from T2 telemetry (foundry.loads) BD-207, BD-260 GATE-FOUNDRY-02; KILL-LOADS decided
BD-401 The beam-rung sizing check and A-15 structural margin (foundry.size); INT-FSIM-15 BD-400 GATE-FOUNDRY-01; INT-FSIM-15
BD-402 Stress, buckling, modes and cumulative fatigue damage BD-401 GATE-FOUNDRY-03
BD-403 Topology optimization of links (foundry.optimize) BD-401 GATE-FOUNDRY-04; GATE-FOUNDRY-05; KILL-TOPOPT decided
BD-404 Inertia fed back into the model as a typed edit, with the convergence test BD-058, BD-403 GATE-FOUNDRY-06
BD-405 Manufacturability checks (foundry.check) BD-403 GATE-FOUNDRY-07; KILL-FAB decided
BD-406 Tolerance allocation driven by sensitivities (foundry.tolerance) BD-401 GATE-FOUNDRY-08; KILL-TOLERANCE decided
BD-407 Bounded geometry export BD-405 GATE-FOUNDRY-09
BD-408 The build packet .fbuild with its four flags (foundry.export) BD-303, BD-346, BD-402, BD-404, BD-406, BD-407 GATE-FOUNDRY-10; KILL-PACKET decided; NS-20 demonstrated
BD-409 The M5 verbs with schemas, examples and refusal lists BD-376, BD-379, BD-382, BD-395, BD-396, BD-397, BD-398, BD-408 GATE-TETHER-02 for the M5 verbs
BD-410 The format registry complete for all thirteen formats BD-141, BD-162, BD-233, BD-274, BD-336, BD-337, BD-408 GATE-WS-02
BD-411 frob-conformance for M5: the certificate mutation corpora, the synthetic rehearsal, the structure fixtures BD-377, BD-382, BD-397, BD-408 GATE-GAUNT-01 for M5
BD-412 M5 exit review by a fresh-context session that did not implement the work BD-378, BD-383, BD-384, BD-385, BD-386, BD-399, BD-409, BD-410, BD-411 Every gate of M5 has a recorded value and a caught negative control; the Reality lane has a record or a recorded no-claim

45.7 M6: frontier physics (epics)

Each row is an epic, split into tasks when M6 opens. None is on a critical path. An epic whose mechanism has no gate in §40 writes its kill gate and its fallback as part of its plan. The cap of four active Moonshot items (D-6) applies to the M epics here and in §45.9.

Bead Title Depends on Done when
BD-413 Epic: robot-advected films; INT-FSIM-17 BD-230 A short plan exists and its pilot has run; GATE-HAB-07; INT-FSIM-17
BD-414 Epic: payload slosh by an equivalent mechanical model BD-231 A short plan exists and its pilot has run; slosh rows of GATE-HAB-08; KILL-SLOSH decided
BD-415 Epic: articulated proxies, a cord as a chain of links and a rug as hinged plates BD-231 A short plan exists and its pilot has run; proxy rows of GATE-HAB-08; GATE-HAB-09 reported; KILL-PROXY decided
BD-416 Epic: Cosserat rods, cloth and coupled multiphysics islands on the CPU referee, for finalists only; INT-FTX-01 BD-413, BD-415 A short plan exists and its pilot has run; INT-FTX-01; KILL-LIVING decided
BD-417 Epic: soft soil at scale BD-366 A short plan exists and its pilot has run; rut state stays per-world with zero leak over 10³ resets at batch scale
BD-418 Epic: tactile sensing and compliant pads BD-167, BD-187 A short plan exists and its pilot has run; a kill gate and its fallback are written before any work package is funded
BD-419 Epic: the rotor port for flight BD-071, BD-159 A short plan exists and its pilot has run; the hover known answer and the port balance; KILL-SINEW-ROTOR decided
BD-420 Epic: RGB and splat scenes BD-187, BD-398 A short plan exists and its pilot has run; a kill gate and its fallback are written before any work package is funded
BD-421 Epic: moving people as kinematic actors on route graphs BD-399 A short plan exists and its pilot has run; no claim about human behaviour is issued from an actor
BD-422 Epic: gradients through contact BD-334, BD-353 A short plan exists and its pilot has run; every derivative carries its validity label, and a gradient at a grazing event is labeled or refused
BD-423 Epic: lifecycle compression (foundry.lifecycle) BD-391, BD-402 A short plan exists and its pilot has run; GATE-FOUNDRY-12; KILL-LIFECYCLE and KILL-SINEW-AGE decided
BD-424 Epic: the hard-contact law on GPU tiers BD-172, BD-174, BD-386 A short plan exists and its pilot has run; GPU rows of GATE-TRAC-09
BD-425 Epic: geometric phase for locomotion BD-243, BD-332 A short plan exists and its pilot has run; GATE-AUGUR-20; KILL-AUGUR-PHASE decided
BD-426 Epic: symmetry at the instant of contact BD-327, BD-334 A short plan exists and its pilot has run; GATE-AUGUR-21; KILL-AUGUR-SYMEVENT decided
BD-427 M6 exit review by a fresh-context session that did not implement the work BD-412, BD-414, BD-416, BD-417, BD-418, BD-419, BD-420, BD-421, BD-422, BD-423, BD-424, BD-425, BD-426 Every epic of M6 has its plan, its pilot result and its kill-gate decision on record; every gate reached has a recorded value and a caught negative control

45.8 M7: the ten-fold tournament (epics)

One group of epics for the test of §39. The suite is sealed before either arm runs, and the result is published whatever the ratio.

Bead Title Depends on Done when
BD-428 Epic: the sealed suite: missions in named strata, sealed worlds including externally authored ones, the crossover reuse count BD-317, BD-378 A short plan exists and its pilot has run; the suite's commitment hash is published before either arm sees it
BD-429 Epic: the tournament decision rule: the pooled ratio of restricted mean times, 24 mission families per cell for a finite-suite result and at least 32 for a population result (§39.20), the power analysis against a true ratio of 10, the written kill rules BD-124, BD-317 A short plan exists and its pilot has run; the reachable verdicts are enumerated before sampling, and a rule that cannot return one of its verdicts at the planned n is rejected
BD-430 Epic: the incumbent arms: the strongest composed rival at pinned versions, cold and warm, including a short robust program over an incumbent engine BD-039, BD-301, BD-428 A short plan exists and its pilot has run; the rival's phase ledger is recorded on trj under the disclosure block
BD-431 Epic: our arm: fresh agents on the released surface, cold and warm runs separated BD-412, BD-428 A short plan exists and its pilot has run; every phase of every campaign is in the phase ledger, and one false certificate disqualifies the arm
BD-432 Epic: neutral adjudication of accepted answers BD-383, BD-429, BD-430, BD-431 A short plan exists and its pilot has run; an answer is accepted only by the adjudicator, and a planted false acceptance in a dry run is caught
BD-433 Epic: publication of the result BD-432 A short plan exists and its pilot has run; the measured ratio is published with its phase ledger whatever it is, and a tie with a short robust program over an incumbent is reported as a tie (BET-14)
BD-434 M7 exit review by a fresh-context session that did not implement the work BD-427, BD-433 Every gate of the ten-fold test due at M7 (GATE-TENFOLD-03 to -05 repeated, -07, -08, -11, -12, -13) has a recorded value and a caught negative control; the measured ratio is published with its phase ledger

45.9 M8: frontier delivery (epics)

Each row is an epic with its stop rule. The M items wait their turn under the cap of four, and a kill gate that fires ends its epic with the fallback and no further work.

Bead Title Depends on Done when
BD-435 Epic: facility co-design and multi-robot handoff BD-352, BD-363, BD-369 A short plan exists and its pilot has run; GATE-AUGUR-24; KILL-AUGUR-FACILITY decided
BD-436 Epic: skill transport. skill.transport moves a skill artifact with a learned residual M; mission.transport moves a certified claim through an interface map with a bounded error F BD-321, BD-336 A short plan exists and its pilot has run; GATE-AUGUR-23; GATE-REFLEX-09; KILL-SKILL and KILL-AUGUR-TRANSPORT decided
BD-437 Epic: continuation-based synthesis (strategy continuation) BD-361 A short plan exists and its pilot has run; GATE-AUGUR-22; KILL-SYNTH-CONT decided
BD-438 Epic: firmware export BD-338, BD-408 A short plan exists and its pilot has run; GATE-FOUNDRY-11; KILL-FIRMWARE decided
BD-439 Epic: geometric-algebra tree policies at scale BD-321, BD-325 A short plan exists and its pilot has run; GATE-CORTEX-17; KILL-GATREE decided
BD-440 Epic: reachable-set tables for shields BD-338 A short plan exists and its pilot has run; GATE-SHIELD-05; KILL-TUBE decided
BD-441 Epic: the fused per-world step kernel BD-217 A short plan exists and its pilot has run; the paired lower bound on the whole step is recorded with digests unchanged; KILL-MEGA decided
BD-442 M8 exit review by a fresh-context session that did not implement the work BD-434, BD-435, BD-436, BD-437, BD-438, BD-439, BD-440, BD-441 Every epic of M8 has its plan, its pilot result and its stop rule applied; every gate reached has a recorded value and a caught negative control

45.10 Graph facts

FACT, checked mechanically on the tables as printed:

  • Size. 442 beads: 406 tasks, 27 epics and 9 exit reviews. By milestone: M0 44, M1 103, M2 77, M3 95, M4 59, M5 34, M6 15, M7 7, M8 8. The graph has 1,091 dependency edges and one root, BD-001.
  • No cycles. Every dependency points to a lower-numbered bead. The numbering is therefore a topological order, and the graph has no cycles.
  • Exit reviews. Every bead of a milestone is an ancestor of that milestone's exit review, and each exit review depends on the one before it: BD-044 → BD-147 → BD-224 → BD-319 → BD-378 → BD-412 → BD-427 → BD-434 → BD-442. BD-442 therefore has every other bead as an ancestor.
  • Beads with no consumer other than exit reviews. 44 beads. M0: BD-002, BD-037, BD-038; M1: BD-140; M2: none; M3: BD-256, BD-257, BD-268, BD-300, BD-311; M4: BD-324, BD-326, BD-356, BD-357, BD-359, BD-368, BD-371, BD-373, BD-374, BD-375; M5: BD-384, BD-385, BD-409, BD-410, BD-411; M6: BD-414, BD-416, BD-417, BD-418, BD-419, BD-420, BD-421, BD-422, BD-423, BD-424, BD-425, BD-426; M7: BD-433; M8: BD-435, BD-436, BD-437, BD-438, BD-439, BD-440, BD-441. These are gate-closing measurements, agent tests and frontier epics. Nothing later is built on them, so only the exit review of their milestone waits for them, and it does.
  • Longest chain. 37 beads: BD-001 → 005 → 014 → 016 → 031 → 054 → 056 → 061 → 070 → 080 → 081 → 082 → 084 → 155 → 159 → 192 → 194 → 201 → 202 → 212 → 263 → 272 → 273 → 274 → 275 → 312 → 313 → 316 → 317 → 319 → 378 → 428 → 430 → 432 → 433 → 434 → 442. In words: workspace, core types, kernel backend, Metal admission, the toolchain matrix, the design term and its model, actuators, the transactional referee step with joint rows, the batched step, the environment and its tasks, the frozen battery and the promotion rule, Nemesis from its guard to the hard-world set, the M3 verbs and the agent documentation, the partial ten-fold gate, the exit reviews of M3 and M4, the tournament, and the last two exit reviews.
  • Longest chain that uses no exit review. 33 beads: the same chain to BD-317, then BD-428 → BD-430 → BD-432 → BD-433.
  • Widest beads. BD-312 and BD-376, the verbs of M3 and M4, with 24 dependencies each. Exit reviews have between 2 and 16 dependencies.
  • Gate coverage. Each of the 421 identifiers of the gate inventory (278 convergence gates, 111 kill gates, 32 admission gates) is cited by at least one bead, as are the five sibling admission gates of §33.15 and GATE-GAUNT-01. 118 beads cite no gate, kill gate or admission gate: they are building blocks, pilots, reports and exit reviews whose observable is stated in full in the row.

Gates that close in parts, or at a milestone other than the earliest one their chapter names:

Gate Earliest in its chapter Closed by
GATE-SPARK-21 M1 The trj rows at M0 (BD-040); complete at M1 (BD-142)
GATE-KIN-04, GATE-TRAC-01, GATE-TRAC-06 M1, strict included Referee rows at M1 (BD-083, BD-085, BD-086); strict rows at M2 (BD-161); batched rows at M2 (BD-168)
GATE-SENS-04, GATE-SENS-05, GATE-SENS-12 M2 CPU and referee rows at M1 (BD-078, BD-098, BD-119), because the mission slice needs them; every tier at M2 (BD-189, BD-215)
GATE-SENS-08, GATE-SENS-09 M3 Linearized and docking rows at M1 (BD-120, BD-134); complete at M3 (BD-239, BD-240)
GATE-MARROW-03, GATE-SKEL-03, GATE-SKEL-07 None stated Rows for the first four archetypes at M1 (BD-109, BD-118); complete at M3, when all eighteen exist (BD-246, BD-247)
GATE-ATEL-02 M1 The included analyses at M1 (BD-110); complete at M4 with A-04 (BD-332)
GATE-ATEL-04 M3 The comparison row at M3 (BD-262); the bisect row at M4 (BD-343)
GATE-FID-07 M2 Recorded at the M2 exit from the sampler's run (BD-214); repeated at M3 with the tier-correction ledger, where KILL-SHADOW is decided (BD-268)
GATE-AUGUR-11 M4 The probe pilot and KILL-AUGUR-PROBE at M3 (BD-291); the gate is recorded at M4 with experiment suggestion (BD-351)
GATE-ATEL-11 M1 for mission cells, M3, M4 Dependency grades 1 and 2 on mission cells at M1, inside the amendment fixtures of the mission slice (BD-135, BD-136); the engine and its dependency-grade rows at M3 (BD-292); grades 3 and 4 at M4 (BD-347)
GATE-ARENA-04 M1 on the referee, M2 on the batch tiers Referee rows at M1 (BD-123); batch-tier rows at M2 (BD-212)
GATE-REFLEX-01 M1, M2, M3, M4 The first archetypes on the referee at M1 (BD-118); the same set on batch-cpu at M2; every archetype except tracked and hybrid at M3 (BD-247); tracked and hybrid at M4 with their contact laws
GATE-CORTEX-12, GATE-ATEL-07, GATE-ATEL-08 M3 as a pilot, M4 The pilot at M3 (BD-310); on our engine at M4 (BD-328, BD-329)
GATE-REFLEX-06 M4 The controller lands at M3 as a fallback (BD-252); the gate closes at M4 (BD-331)
GATE-AUGUR-09 M3 The pilot and the kill decision at M3 (BD-289); the gate closes at M4 (BD-358)
GATE-HAB-11 M3 M4 (BD-369), with the retrofit catalog
GATE-SHIELD-01 M3 M4 (BD-337), with the energy-budget tier
GATE-TRAC-09 M3 on batch-cpu M5 (BD-386), with the hard-contact batch law; GPU rows in the M6 epic BD-424
GATE-FOUNDRY-01, -02, -03; GATE-GROUND-03 M4 M5 (BD-401, BD-400, BD-402, BD-390), with Foundry and Ground
GATE-FOUNDRY-12 M8 The M6 epic BD-423

45.11 Conversion rules

Each row becomes one br issue: a task for M0 to M5 and for every exit review, an epic for the other rows of M6 to M8. The BD number is kept as the issue's reference, "Depends on" becomes its blocking dependencies, and labels carry the milestone, the owning crate of §34.2, the tier and the work package. bv --robot-* triages the result (§34.7). The rules below are DESIGN.

  • What a bead inherits. Every bead inherits the definition of "implemented" (§0.2) for the capability it delivers, and the false-progress guards of §38: typed close reasons, negative controls, live-dependency proofs, the synthetic label, behaviour and not plumbing, no self-certification. A bead that delivers part of a capability states which clauses of §0.2 stay open, and the capability is described as partial until the bead that closes its gate is closed.
  • How a bead closes. With a typed reason that cites its own test and that test's output: a line in its log docs/delivery/logs/<bead>.ndjson (frob.beadlog/1, §29.14) whose verdict is pass, whose claim identifiers resolve in the artifact graph, and whose recording session is not the session that implemented the bead. A close reason shared by several beads is a failure signal, and the exit review rejects it. A closed bead is not acceptance (§0.7); acceptance is the gate's row in registries/gates.toml.
  • Kill gates. A bead whose kill gate fires closes with the reason fallback and the name of the fallback. Its dependents are then re-read: one that needs the killed capability closes with the reason superseded and the identifier of the ADR; one that can stand on the fallback keeps its dependency.
  • Work packages. Work packages (§44) group beads by crate and milestone. A bead belongs to exactly one: the package that owns its crate at its milestone or, where a bead touches several crates, the package that owns the crate in which its gate is measured. Exit reviews belong to none.
  • Pilots and compute. A bead for an F or M mechanism is not ready until the pilot of its chapter has a recorded result (§0.7). A bead whose run exceeds the machine envelope of §34.7 (the parity baselines, training, the head-to-head, the rank-agreement experiment, the partial gate, the tournament) names its budget and is not ready until the owner's approval under OPEN-SPARK-2 is recorded.
  • Splitting and adding. A bead too large for one session is split into children that carry its number with a suffix (BD-nnn.1, BD-nnn.2). The children inherit its dependencies, and the parent closes when its last child closes. A bead discovered during implementation takes the next free number and depends only on existing beads, and the exit review of its milestone gains it as a dependency. That is the one case in which a dependency may point to a higher number. After conversion the guarantee against cycles is br's cycle check, not the numbering.
  • Exit reviews. An exit review implements nothing. It closes when every gate of its milestone has a recorded value and a caught negative control in registries/gates.toml (GATE-GAUNT-01), every kill gate due at the milestone has its ADR, and the honest-status table regenerates from the logs.

45.12 Subsections added by the audits, to be placed during conversion

The subsections below were added by the completeness audits after the bead tables were compiled. During conversion each becomes one or more beads in the milestone of its gate, with the same done-condition form: its gate records a value and its negative control is caught. Until then they are not counted in the graph facts above.

Subsection Title Gates it names
§23.25 The joint law of sampled actions GATE-CORTEX-18
§23.26 The actor's information contract covers every field it can read GATE-CORTEX-19
§23.27 A threshold crossing is not attainment GATE-CORTEX-05, GATE-CORTEX-20
§39.20 Estimating the ratio, and the smallest suite that can certify GATE-TENFOLD-10
§39.21 Rival arms, protocol controls and the sealed suite GATE-TENFOLD-11, GATE-TENFOLD-12
§25.29 Chance claims transport only through a coupling GATE-AUGUR-25, KILL-COUPLING
§25.30 No monotone fill without a proof of monotonicity GATE-AUGUR-26
§24.19 Traction capacity is a slice of the wrench set at the commanded wrench GATE-ARENA-10
§29.22 The solver's kinetic-energy correction is not heat GATE-CHRON-14
§20.23 Force sensors act on a force history: filter, clip and integrate in a declared order GATE-SENS-15
§13.11 A circle-valued joint needs periodic laws, or its turn count GATE-MARROW-06
§34.14 The canonical reader and writer, and JSON features that unify across the build GATE-WS-05
§33.17 Further foundation facts and their admission tests GATE-WS-06
§21.26 Counts beyond 2³² without 64-bit atomics GATE-SPARK-23
§41.5 Four risks that follow from late foundation facts GATE-WS-07
§47.4 The order in which evidence is procured, and complete dispositions GATE-WS-08
§38.17 Known answers adopted from corrected fixtures GATE-FID-09
§32.23 The agent diagnosis battery GATE-TETHER-01, GATE-TETHER-13, GATE-TETHER-15
§14.16 Module capability tables and the composed quasi-static screen GATE-SKEL-09, GATE-SKEL-10, KILL-SKEL-CELL
§16.19 Row-class solve queues GATE-KIN-08, KILL-ROWQUEUE
§16.20 Decoupled stepping of separated robots in one world GATE-KIN-09, KILL-INTERACT
§16.21 Step adjoints through the converged contact solve GATE-KIN-10, KILL-STEPADJOINT
§16.22 Closed-form elimination of single-loop planar closures GATE-KIN-11, KILL-LOOPELIM
§16.23 Ancestor-sparse assembly and the solve-stage ledger GATE-KIN-12, KILL-ANCESTOR, KILL-TREEOP
§17.21 Limb-archetype kernels GATE-PHYLUM-09, KILL-LIMBKERNEL
§18.19 Response batches: anchor, acceptance, known answers, gate GATE-TRAC-11, KILL-RESPONSE
§19.21 Far-field field reuse across forks GATE-HAB-15, KILL-FARFIELD
§20.24 Visibility under self-occlusion, and sensor mounts as design variables GATE-SENS-16, GATE-SENS-17, KILL-VISIBILITY
§22.20 A lifted linear planning model for one soft-soil regime GATE-REFLEX-10, KILL-SOILLIFT
§22.21 The pre-slip aliasing fixture and the sampled-data backup domain GATE-SHIELD-06
§22.22 The sampling controller as the delivered controller GATE-REFLEX-11, KILL-MPCRECORD
§23.28 The winner check for a selecting rung GATE-CORTEX-21
§23.29 Short-horizon gradient training with design parameters GATE-CORTEX-22, KILL-SHORTGRAD
§24.20 Auditing a task before any design runs on it: foil bodies and intent invariants GATE-ARENA-11, KILL-FOIL
§24.21 The item bank: importance sampling of battery items for close comparisons GATE-ARENA-12, GATE-ARENA-13, KILL-ITEMBANK
§24.22 Exposure domains and the coupling test GATE-ARENA-14, KILL-COUPLING
§25.31 Monomial screens in exponent coordinates GATE-AUGUR-27
§25.32 Utility brackets and the dominance stop GATE-AUGUR-28, KILL-AUGUR-BRACKET
§25.33 Placement and sizing along a prescribed motion GATE-AUGUR-29, KILL-SYNTH-REGRESSOR
§25.34 Weak-variable enclosure and the split set GATE-AUGUR-30, KILL-WEAKVAR
§27.19 Attribution in single precision on the originating tier GATE-AUTOPSY-03, GATE-AUTOPSY-09, KILL-ENSEMBLE
§28.25 Controller-budget curves and the controller-limited label GATE-ATEL-17, GATE-ATEL-18, KILL-BUDGETCURVE
§28.26 The reuse ledger: three columns, never summed GATE-ATEL-19
§31.21 Packet review as an imported record GATE-FOUNDRY-13, KILL-PACKET
§31.22 Referee re-extraction of load cases that enter a build packet GATE-FOUNDRY-14
§31.23 Member sizing as a validity check in screening GATE-FOUNDRY-15
§32.24 The offline replay packet GATE-TETHER-16, KILL-REPLAYPACK
§39.22 Three arms, the recovery ratio and the phase ablations GATE-TENFOLD-13
§25.35 The controller class is part of a family answer GATE-AUGUR-31
§25.36 Docking to a finite tolerance over a continuous gain interval GATE-AUGUR-32
§25.37 Channel laws: the joint error law of repeated reads, and the code that carries a label GATE-AUGUR-33
§25.38 Shared nuisance parameters, and the probe for four admitted laws GATE-AUGUR-34, KILL-AUGUR-PROBE
§25.39 Sizing witnesses for fixed points, and Pareto coverage of a catalog GATE-AUGUR-35
§14.17 Folding fixed joints, and reduced models GATE-SKEL-11
§15.15 Coupled transmissions: the torque set, the rotor energy and the direction witness GATE-SINEW-10
§16.24 A held command and the step that integrates it GATE-KIN-13
§18.20 Swept bounds enclose arcs GATE-TRAC-12
§19.22 Scaled instances: distances, normals and ray parameters in world metres GATE-HAB-16
§20.25 Sampled readings: impacts in an exposure, encoder unwrapping, the load-cell cut GATE-SENS-18
§22.23 Orbits of a loop with no clock: the free period and the trivial multiplier GATE-GAIT-01, GATE-GAIT-04, KILL-FREEPERIOD
§22.24 Stability over admitted sequences of strides GATE-GAIT-05, KILL-STRIDESEQ
§22.25 Sampled damping, and the work of a held command GATE-SHIELD-07
§24.23 The idle arm of the task audit GATE-ARENA-15
§30.24 Exposure delay and mount translation on a straight pass GATE-GROUND-03, GATE-GROUND-11
§33.18 Six later foundation facts and their admission tests GATE-WS-09
§38.18 Known answers adopted from late fixtures GATE-GAUNT-11