The first implementation session
1,316 words1 tablePlan version 1.1
Before anything else, in this order. Each step produces an observation, not a scaffold. Steps 1 to 5 and step 8 are carried from version 0.2 with the settings §33 found necessary; steps 6 and 7 are new and exist because this version's thesis rests on a measured rival and on exact known answers. Bead numbers are those of §45. Labels: the expected values in step 7 are known answers (Appendix M); the incumbent figure quoted in step 6 is a FACT from Appendix H; nothing in this chapter is a measurement until the session records it.
Working rules for the session (§34.7): every build goes through the offload shim; every run stays inside the default envelope of 16 GiB, 8 cores, one hour and one device; a sibling repository is changed only as an upstream work item, in that repository, under its own rules and with its files reserved (§33.8); a failing result is recorded as failing, and no step is repeated until it happens to pass.
-
Create the core workspace with one
rust-toolchain.tomlthat names candidate (a) of §33.13 as the provisional T, andfranken-stack.lock(BD-001). Repeat at the workspace root the three things Cargo does not propagate from a path dependency: the asupersync patch entry, the FrankenSQLite profile overrides, and the build-identity setting in.cargo/config.tomlthat FrankenSim's linear-algebra crate requires outside its own tree (§33.2, hazard 5). Runcargo checkthrough the offload shim. Record the output and write the first resolution receipt, with the drift class of every sibling. -
Consume FrankenSim once. Add one crate with path dependencies on
fs-gaandfs-mbd. Build the built-in G1 model, run forward dynamics at one state, and print a digest. Compute the same digest from a test inside FrankenSim at the same commit. Record whether they match (BD-006, BD-007), together with the cold and warm check times, peak memory and package count that INT-FSIM-01 asks for. This is the measurement BET-04 stands on. Perturb one input and confirm that the digest changes. Then step the model for two seconds on the referee and record the final digest. -
Count runtimes and compilers, and build fastmcp_rust on T. Run
cargo tree -dand record how many asupersync packages the build contains (BD-008). Record which of the nightlies in play compilefs-qtyalone: the first cells of the matrix of INT-TOOLCHAIN-01. If step 2 showed that FrankenSim does not build on candidate (a), T is candidate (b) from here on. Then, in fastmcp_rust's repository and under its own rules, set its toolchain file to T and, where T requires it, its declaredrust-version; build it, run its test suite and its MCP conformance checks, and record the result, passing or failing (FD-FMCP-01, BD-023). -
One kernel on Metal. On this Mac, open
ft_kernel_metal::compute::Gateway, compile a twenty-line Cayley step in Metal Shading Language withMathMode::Safe, run it on a million quaternions, and compare with a Rust loop bit for bit (BD-016). Then run the exhaustive square-root comparison over all 2³² inputs (the first half of BD-017). -
The same kernel on CUDA. On
trj, compile the same kernel text with the CUDA prelude throughcudarcand NVRTC, run it on both GPUs, and compare with the same Rust loop (BD-015). -
Measure one incumbent phase on
trj. With one incumbent stack at a pinned revision, driven out of process by a script intools/oracle, measure on one RTX 4090: cold start to the first step; a parameter edit to the first step; a topology edit to the first step; and wall-clock to the return threshold of its flat-ground quadruped velocity task. Record each with a disclosure block: revision, driver, card, host load, whether caches were warm, and the repetition count. The published context for the last figure is about 410 s, of which about 45 s is compilation, so the run fits the default envelope. This is the first row of GATE-SPARK-21 and the first measured entry in the ledger of §2.2 (BD-039, BD-040). No FrankenRobotics code is compared with it yet; the point is to know the denominator before building against it. -
Re-run the cart docking fixtures' closed-form checks on the CPU. Two fixtures put a cart at a dock, and both have answers that need no simulator. The program uses the standard library alone.
- The docking family of §25.15, in exact rational arithmetic. Enumerate the grid: 17 actuator bounds at spacing 1/32 on [1/2, 1] and 33 error levels at spacing 1/64. Classify each of the 561 cells by ε < (U + 1/2)/4. The expected answer is 344 admitted and 217 excluded, nine of the excluded cells lying exactly on the boundary. Check the two witness sequences (1/4, 1/2, −3/4) and (1/4, 0, −1/4) by integrating the cart exactly; check that at U = 3/4 and ε = 5/16 both worlds can read 15/16; check that every late-packet cell is excluded; and check the three-gain amendment's value of 1/65 m. Then plant the negative control: replace the strict comparator by a non-strict one and confirm that exactly nine cells change (BD-041).
- The analytic layer of
fixture:cart-sill-dock(§24.10). Recompute the rows that are pure arithmetic on the fixture's constants: total masses of 8.000 kg and 8.225 kg; tread force caps of 40 N and 32 N; lip levers of 36.000 mm and 40.694 mm at a 12 mm sill; and friction demands of 0.7500 and 0.6459 at front lift-off. A constant changed after this point changes the fixture's identity (ADR-ARENA-10).
This program is the seed of the checking code in
frob-certand of the fixture's derivation file, and it holds the first known answers reproduced in this repository. -
Write every result, passing or failing, into
DEPENDENCY_ADMISSION.mdwith commands and outputs: the admission records of steps 1 to 5, the incumbent measurement of step 6 with its disclosure block, and the fixture counts of step 7 with the hash of the program that produced them.
What each observation decides:
| Step | Observation | Decides or informs |
|---|---|---|
| 1 | Whether an out-of-tree workspace builds with the three repeated settings | The HYPOTHESIS of §33.2 that patches and build environment behave as profiles do; the first receipt |
| 2 | Digest equality with FrankenSim; build times and memory | INT-FSIM-01; BET-04; whether KILL-FSIM's worker process is needed at once |
| 3 | The number of asupersync packages; which nightlies build fs-qty; whether fastmcp_rust builds and passes its own checks on T |
INT-ASUP-01 and FD-ASUP-01; the choice of T and the frob-units decision rule of §33.12; FD-FMCP-01, and with it whether INT-FMCP-01 can pass in the core graph |
| 4, 5 | Bit agreement of one algebraic kernel on three backends; the square-root probe | GATE-SPARK-00; the first half of GATE-SPARK-01; each family's best attainable determinism class (KILL-D1) |
| 6 | The incumbent's cold start, edit latency and training time on our card | The denominator of BET-13; the ceilings of §2.3 for the quadruped class; the planning value of GATE-CORTEX-05 |
| 7 | An exact family answer reproduced with a caught negative control; the analytic rows of fixture 1 | The fixtures of GATE-AUGUR-03 and GATE-ARENA-04; D-18, that a strict decision is computed exactly; the shape of the auditor |
The session ends with four honest measurements (does FrankenSim consume cleanly; does fastmcp_rust build and pass its own checks on T; do the three backends agree on one algebraic kernel; what does the rival's loop cost on our card), two sets of exact known answers reproduced with a negative control caught, and a two-second humanoid rollout on the referee. It does not end with a forest of empty crates. If step 2 fails, the session still completes steps 3 to 8, because none of them depends on it, and the failure is the session's most important result.