# S2 R2-G24 / N / E synthetic code acceptance ## Scope and decisions This implements Claude's [22:18:01 ruling](https://arcticnimbus.slack.com/archives/C0C78UFKGRM/p1794665881295239), the v0.5 Gre24 mapping and v0.6 process-conditioned target, with the [22:37:54 correction](https://arcticnimbus.slack.com/archives/C0C78UFKGRM/p1794667074550589). Claude's [22:47:07 full-code main review](https://arcticnimbus.slack.com/archives/C0C78UFKGRM/p1794667627081159) approved `bb09e8e` with one required fix: log/standardise encoder base inputs. That fix is implemented below; R2 and the direct prediction target are unchanged. This remains a synthetic-only code delivery, not a fitted model, real-corpus preprocessing receipt, or approval of predictive accuracy. No real geometry, LOG or simulation field is loaded by these modules/tests. The existing registration queue and its pinned sources are untouched. Test execution has empty CUDA visibility, one numerical thread and CPU tensors. No estimator `.fit`, backward pass, optimiser or parameter update is executed. Model initialisation is random, fixed by test seeds. **The latest target ruling replaces v0.3's transform entirely:** predict `t* = T/t_set` directly, loss on `t*`, seconds = prediction × `t_set`. There is no log transform, tau, fitted scale, oracle end-of-fill time or fallback. The initial pre-ruling tests were superseded; the receipt in this delivery tests the corrected implementation. `t_set` must be a finite positive process setting supplied equally to all arms. `B0 = V*_f` in normalised units; multiply by `t_set` for seconds. Predictions are not silently clipped. ## R2-G24 computational contract `tools/s2_models/features.py` takes in-memory arrays; it has no data-loading entrypoint. - Coordinates are physical 3D positions; tetrahedra index all tet nodes in ascending original-ID order. Invalid indices, unused nodes, degenerate cells and nonfinite inputs fail closed. Exact `D_w=d(x)` is supplied by the existing distance preparation, not recomputed or inferred here. - Tet edges are unique unordered pairs. Gate source is the nearest node to the supplied gate, with exact-distance ties going to the first/smaller original ID. - Both R2 `D_i` and `D_f` exclude edges whose endpoints both have `D_w=0`. Remaining costs are length and length/mean(endpoint `D_w`), respectively. Unreachable nodes fail the part; no epsilon speed or imputation. This is a graph approximation of the eikonal, not tetFIM. - Lumped volume is `Σ incident tet volume/4`. `V*_f(i)` is the strict weighted CDF `Σ_{D_f(j)