FrankenRobotics

Ground: calibration against reality

9,527 words24 subsections18 tables4 listingsPlan version 1.1

On this page24
30.1 What Ground owns30.2 The Reality claim, and why it is mostly no-claim30.3 Decisions30.4 What the siblings provide today30.5 Data admitted, and the cell30.6 The procedure30.7 Clock fitting30.8 Identifiability and excitation design30.9 Identification: actuators first30.10 Card updates from logs30.11 Frozen predictions, sealed trials, holdout retirement30.12 Conformal bands per calibrated cell30.13 Drift detection that retires a calibration30.14 As-built ingestion30.15 The decision model for reality calibration30.16 Verbs30.17 Bench work packages (optional, outside the critical path)30.18 The replication kit30.19 Refusals30.20 Invariants and proof obligations30.21 Known answers: the synthetic rehearsal30.22 Pilots, gates and kill gates30.23 Open questions30.24 Exposure delay and mount translation on a straight pass

Crate frob-ground (layer 5). Cluster ground. The admission lane and the reality: report line are S. Identification, card updates, bands, drift detection and as-built ingestion are F. Nothing in this chapter is on the critical path of a milestone before M5, and no gate in it needs hardware.

30.1 What Ground owns

  • The Reality claim of §8: its statuses, its scope key, the line every report prints, and the refusals that stop a simulated number from being read as a measured one.
  • Admission of real data: logs from a robot or a bench rig, single bench measurements, and scans of built parts, each with its licence, provenance, measurement uncertainty and privacy mark.
  • A sim-to-real procedure in ten steps (§30.6): clock fitting, identifiability analysis and excitation design, identification in a fixed order, Bayesian card updates, frozen predictions, sealed trials, holdout retirement, conformal bands per calibrated cell, drift monitoring, and the feedback of discrepancy into later studies.
  • The replication kit (§30.18) and the synthetic rehearsal on which every gate of this chapter is decided (§30.21).

Ground does not own hardware. It reads files and writes files (INV-GROUND-07). It has no driver, no bus, no real-time loop and no hardware-in-the-loop mode, and the non-goal on deployment stacks in §6 stands. Scans of real places are Habitat's lane (§19). Ground handles robots, parts and rigs.

30.2 The Reality claim, and why it is mostly no-claim

Reality is the one claim the first release mostly cannot make. The lane exists so that the first admitted dataset has somewhere to land: a dataset of real-robot measurements enters with its license, its provenance and its measurement uncertainty, and a comparison is recorded as a Reality result with its scope. Until then every report prints reality: no-claim. FrankenTextiles recorded the same limit about its own domain: "More numerical permutations cannot supply those observations" (FACT).

Four reasons make no-claim the normal state. They are stated here so that no later chapter argues around them.

  1. No data exists. Nothing in this plan has been compared with a physical robot (FACT, Appendix H). A measurement that has not been taken cannot be replaced by a larger batch.
  2. Agreement between tiers cannot reveal a wrong card. Every tier consumes the same actuator card (§15), so Fidelity and Parity results say nothing about whether the card describes a real motor. Through M4 the catalogue holds generic classes only (OPEN-SINEW-1). A report that supports a benchmark claim therefore prints the share of card fields whose provenance is generic or assumed (DESIGN: it is the one number that tells a reader how much of the model was guessed).
  3. A Reality result has a scope and no meaning outside it. The scope is a cell (§30.5): which physical units, which controller and firmware, which surface, which task family, inside which envelope of conditions.
  4. A design that was never built has no reality band. Band coverage is a statement about draws exchangeable with the calibration draws (§30.12). An unbuilt design is not such a draw, and the distance between it and the calibrated ones cannot be measured.
Status Meaning Rule
no-claim Nothing measured supports the number. The default. A legitimate terminal state, not a failure.
synthetic The comparison ran against data generated by a simulator standing in for reality. Never promoted (INV-GROUND-06).
published-anchor A simulated quantity was compared with a figure published for the same robot. A Parity result (§8), never Reality: published test conditions are loose. Scheduled by the Gauntlet (§38).
candidate(cell) A posterior was fitted in this cell and has not been scored on sealed data. Changes no randomization width (INV-GROUND-05).
calibrated(cell, n, level) A frozen prediction was scored on sealed data and a band is issued. Valid only inside the cell.
retired(cell, reason) A drift monitor fired, the scope changed, or the calibration expired. Reverts to no-claim with the reason.

Every report carries one line of the form reality: <status> [cell=<id> n=<n> level=<1−α> band=<q̂ with unit> dataset=<hash prefix>].

30.3 Decisions

ADR Decision Reason
ADR-GROUND-01 Ground is file-in, file-out. It never commands or reads a device. Scope and safety. A simulator's gate cannot depend on hardware the project does not have.
ADR-GROUND-02 The unit of calibration is the cell. A band belongs to exactly one cell. Coverage holds for exchangeable draws only, and pooling hides a failing regime (§30.12).
ADR-GROUND-03 Identification order is fixed: clocks, actuators, contact and surface, inertia and geometry, sensors. The literature places the gap in the actuator (§30.9), and each stage's error aliases into the next.
ADR-GROUND-04 Identifiability is analysed before any fit. A fit on an unidentifiable combination is refused, never regularized quietly. A regularized fit returns the prior and labels it a measurement.
ADR-GROUND-05 A prediction is frozen before its trial data is readable. A refit opens a new prediction version. A scored holdout is retired. Otherwise the comparison is a fit, and its error rate is unknown.
ADR-GROUND-06 A posterior is a new card version with provenance measured. Cards are never mutated. A new card version is a new ModelId, and evidence attached to the old identity does not carry over. INV-SKEL-01, and the model-identity rule of the decision cores (§28).
ADR-GROUND-07 Randomization width derived from a card narrows only after validation, never from a fit alone. Shrinking a card without evidence overstates what is known.
ADR-GROUND-08 Sibling estimators are reached through the airlock (§33) as whole jobs. Every Ground output has evidence class Estimated (§12). The siblings expose estimated candidates only and require an external authenticated authority for more (§30.4).
ADR-GROUND-09 Drift is tested on ranks and misses, not on raw distributions by kernel discrepancy or optimal transport. Those tests have no power at about twenty scalar residuals.
ADR-GROUND-10 Bench work is optional, is packaged separately (§30.17) and blocks no milestone. Reality is an import lane.

30.4 What the siblings provide today

FACT throughout, read at FrankenSim commit 483d09c682; paths are under frankensim/crates/. Line counts are source lines and approximate.

Crate Provides today Missing for Ground
fs-assimilate (13,000 lines, layer L4, depends on fs-qty) A Gaussian Belief and linear Observation with sequential Kalman fusion (assimilate, assimilate_all; dense state at most 256, at most 4,096 observations per call). assimilate_colored returns an estimated candidate tied to a validity regime with misfit before and after. A UD-factor update with an interval-checked contraction receipt (factor). Linear and finite-difference extended-Kalman prediction (factor::forecast). Nonlinear scalar observations by receipted finite differences with a standardized-innovation gate (nonlinear). An iterated Gauss–Newton Kalman update with Armijo line search, a correlated-noise variant and a Huber-loss fit (nonlinear::iterated; at most 256 rows, 256 iterations, 65,536 evaluations). A deterministic serial ensemble square-root filter with forecast, correlated blocks and a fixed-lag smoother (nonlinear::ensemble, behind feature ensemble). Correlated and censored observation batches with audit receipts (robust). Shared calibration error as a declared common-mode source, so repeated samples cannot push uncertainty below the common-mode floor (groups; groups::jacobian with at most 64 shared parameters; groups::stream with at most 4,096 rows). Outcome-free probe scoring and a greedy cost-budgeted measurement plan (groups::stream::design). A dimensionally typed front door (dimensioned). No notion of joints, actuators or trajectories. No regressor construction, no delay estimation, no identifiability analysis. Gaussian or ensemble posteriors only. Stick–slip likelihoods are handled only as far as an ensemble approximates them. The row and state caps force long traces to be windowed. The ensemble lane is feature-gated and claims no cross-ISA determinism. There is no promotion to a validated state: the crate calls that "a separate admission act requiring calibrated data and an external authenticated authority".
fs-asbuilt (10,800 lines, L2, depends on fs-qty) Closed-form two-dimensional rigid registration from at least three non-collinear fiducials (register), with the residual kept as a fit diagnostic only and a signal-versus-noise screen (well_posed). as_built_diff up to 10⁶ points, emitting an estimated candidate. Three-dimensional weighted rigid and similarity registration with known correspondences, a scale estimate with standard error and a unit-suspicion diagnostic, and a calibrated six-parameter pose covariance (rigid3). Datum-priority 3-2-1 registration (datum). Deviation, thickness, form and roughness fields from supplied correspondences (field). Pose covariance carried into correlated quantities of interest, at most 64, with a sigma-point check that downgrades to unknown (propagate). Simultaneous decision bounds that need no Gaussian assumption (uncertainty). Correspondences are supplied, never discovered: there is no closest-point matching. No reading of density or porosity. No mass properties. No promotion beyond an estimated candidate (NoEvidenceVerifier).
fs-uq (15,900 lines, L4) Greedy block D-optimal selection of whole experiments, maximizing log det(I + Σ J_gᵀ·J_g/ridge) (experimental_design). Sobol indices by pick-freeze (product_sensitivity), Shapley effects (product_shapley), replicated Latin hypercubes, Gaussian-copula sampling of correlated inputs (product_copula), multilevel Monte Carlo with audited telescoping, polynomial chaos, defensive Gaussian importance sampling, chance constraints with anytime-valid estimates, worst-case propagation over epistemic boxes (product_epistemic). No Fisher-information rank test and no profile likelihood. Importance sampling works on independent normal germs only. The multilevel driver is a per-call closure. No conformal prediction.
fs-eproc (1,400 lines; feature conformal-hardening, tagged Frontier upstream) MondrianConformal: split-conformal calibration per bucket, refusing a bucket below its minimum count and returning an infinite band when ⌈(n+1)·(1−α)⌉ exceeds n. DriftMonitor: a two-sided betting e-process on the rank of each new value in a frozen sample, with slack δ = max(1/√n, 0.02). False-coverage budgets over many claims (fcr_flag, admission_alpha). Betting e-processes and a mixture confidence sequence in the crate root. Buckets are opaque strings: the cell key, the scope-change rules and the cluster structure are ours. The slack makes the monitor insensitive at small n.
fs-voi (1,000 lines, L4) Ranking-flip probability, multi-alternative expected opportunity loss, value of an action per unit cost, and recommend with a stop gate. A finite Gaussian menu. Real-trial costs and the exchange rate between operator time and compute are ours.

Three consequences. First, the siblings give Ground its estimators, receipts and refusals, and none of its robotics: frob-ground owns the measurement models, the regressors, the identifiability analysis, delay profiling, the cell, the sealing protocol and the kit. Second, fs-assimilate and fs-asbuilt depend on fs-qty, whose nightly coupling is the named risk tested at INT-TOOLCHAIN-01 (§33); Ground's jobs are whole jobs of seconds to minutes, so the worker-process fallback of §33 costs them nothing. Third, upstream work items, numbered in Appendix F (FD-FSIM-23 to -25): a windowed or streaming entry to the iterated update beyond 256 rows; a cross-ISA statement for the ensemble lane; a correspondence-search lane in fs-asbuilt.

30.5 Data admitted, and the cell

A real dataset is a .frun bundle whose manifest declares origin = "real". No new file extension is introduced; the manifest schema is frob.ground.dataset/1.

# frob.ground.dataset/1 (DESIGN)
[dataset]
id       = "blake3:…"            # over the canonical manifest and every chunk hash
origin   = "real"                 # "real" | "synthetic"; a synthetic set can never be relabelled
kind     = "robot-log"            # "robot-log" | "bench" | "scan"
license  = "CC-BY-4.0"            # or "private"; private data never enters a kit (§30.18)
acquired = { by = "operator-id", on = "2027-03-14", rights = "owner" }
[rig]
units       = ["unit-07"]         # serial-level identity; one unit is one cluster (§30.12)
controller  = "blake3:…"          # controller identity; firmware as reported by the device
firmware    = "2.4.1"
surface     = "sealed-concrete/dry"
envelope    = { temperature_C = [18, 24], payload_kg = [0, 2], speed_m_s = [0, 1.2] }
[[instrument]]
name = "encoder-knee-L"; quantity = "angle"; unit = "rad"; sigma = 1.5e-4; bias_bound = 3.0e-4
instant = "sample"; clock = "mcu"; calibration = "cal-2027-02"
[[clock]]
name = "mcu"; nominal_hz = 1000; marks = ["pulse-0", "pulse-1"]   # raw source timestamps are retained
[split]
by          = "day"               # "hardware" | "condition" | "day"; never a random split of rows
calibration = ["2027-03-14"]; validation = ["2027-03-15"]; holdout = ["2027-03-21"]
sealed      = ["validation", "holdout"]                           # readable only through ground.score
attempts    = "all"               # every attempted trial is a row, including aborted ones

Admission rules (DESIGN, each with its reason):

  • Licence, provenance, uncertainty and rights are required fields. A dataset without them is refused (FROB-REF-873), because a Reality result must be able to name what it rests on.
  • Splits follow hardware, condition or day. Rows inside one episode are dependent, so a random split of rows leaks the validation set into the fit.
  • The full denominator is recorded. A log that contains only the trials that completed calibrates a band on survivors. attempts = "all" is checked against the operator's trial counter.
  • Sealed chunks are hash-committed at admission and are read only by ground.score, once, with a ledger event (INV-GROUND-03).
  • Synthetic stays synthetic. Nominal parts and simulated logs carry origin = "synthetic" for life.
  • Privacy is inherited. A dataset recorded in a private place carries the private mark of §37.

The cell is the scope key of every Reality result:

CellKey = ( design: DesignId, units: set of unit ids, controller: ControllerId, firmware: text,
            surface: class, task_family: TaskFamilyId, envelope: box over the recorded conditions )

A change to any component is a scope change (§30.13). Two cells are never pooled (FROB-REF-814).

30.6 The procedure

Step What happens Verb Output Fails closed to
0 Admit data, assign the split, seal validation and holdout ground.ingest Dataset id Refusal
1 Fit clocks (§30.7) ground.ingest Affine maps with uncertainty Refusal; no time-based score
2 Analyse identifiability, design excitation (§30.8) ground.excite Experiment plan, aliased combinations No fit
3 Identify actuators (§30.9) ground.identify --stage actuators Candidate posterior Prior card
4 Identify contact and surface, then inertia and geometry, then sensors ground.identify --stage … Candidate posterior Prior card
5 Write candidate card versions (§30.10) ground.identify .fcard versions —
6 Freeze a prediction for a planned trial (§30.11) ground.predict Prediction record —
7 Score on sealed data, retire the holdout, admit or reject the posterior ground.score Score, coverage, admitted cards Candidate stays candidate
8 Issue or refuse a band for the cell (§30.12) ground.band Band or refusal no-claim
9 Monitor drift, retire (§30.13) Automatic on ingest Monitor state retired
10 Feed discrepancy back Automatic Reality-gap variance per cell; regression cases —

If real traces are unavailable, the release ships simulation and known-answer results with the Reality field open. That is the expected state of the first release.

30.7 Clock fitting F

Each source clock is mapped to the reference clock by t_ref = a + (1 + s)·t_src, with offset a and skew s. There are two unknowns, so one shared pulse fixes only one combination of them. At a skew of 100 ppm, two clocks that coincide at the start differ by 0.8 ms after 8 s (FACT, arithmetic), which is most of a tick at 1 kHz and enough to move a packet across a decision instant (§20).

The fit is weighted least squares over m ≥ 2 independent marks that bracket the trial. For two marks at t₁ < t₂ with independent timing error σ_m each (PO-GROUND-02):

  • skew uncertainty σ_s = √2·σ_m/(t₂ − t₁);
  • uncertainty of an aligned instant σ_t(t)² = σ_m²·[(t₂ − t)² + (t − t₁)²]/(t₂ − t₁)², which is at most σ_m² inside the bracket and grows quadratically outside it.

With σ_m = 50 µs and marks 10 s apart, σ_s is 7.1 ppm (FACT, arithmetic). If skew can change during the trial, the fit is piecewise affine over more marks and reports its largest residual; a trial with fewer marks than the model needs is refused (FROB-REF-876).

Rules:

  1. Scored instants lie inside the bracket, or the score is refused.
  2. The clock is never fitted to the event being scored. Counterexample: the prediction says the wheel crosses the sill at 4.212 s and the log shows 4.180 s. Choosing the offset that aligns the two reports a crossing-time error of zero and an offset of 32 ms. The whole error has been moved into the clock.
  3. Cross-correlating command and response is not a clock fit. It estimates offset plus actuator delay: a delay of 8 ms with an offset of −8 ms produces the same logs as no delay and no offset. Without a shared hardware mark the identified quantity is reported as "delay plus offset" and the card's delay is not updated.
  4. Raw timestamps are kept. Aligned times are derived data carrying the fit's uncertainty. A test of whether a packet arrived before a decision uses the interval and answers undecided when it straddles.
  5. Each instrument names which of the seven instants of §20 its timestamp denotes. A timestamp with no declared instant is refused.

30.8 Identifiability and excitation design F

Analysis. For a planned experiment with predicted measurements y(θ), Ground forms the Fisher information F = Jᵀ·R⁻¹·J, where J = ∂y/∂θ is computed on the referee in double precision at the prior mean and at eight prior draws (TARGET), and R is the instrument covariance including shared calibration error. Parameters are scaled by their prior standard deviations, so F is dimensionless. Four checks follow.

Check Rule (thresholds are TARGETs) Outcome
Rank A singular direction of the scaled J with σ_min/σ_max below 10⁻⁶ Structurally unidentified in this experiment
Precision The Cramér–Rao bound √((F⁻¹)_ii) is at most half the prior standard deviation Parameter i is identified by the experiment
Aliasing A pair with correlation of magnitude at least 0.95 in F⁻¹ Reported as an aliased combination, with the combination that is identified
Profile A profile likelihood on the synthetic twin of the experiment, for finalists A flat profile overrides a good local bound

Some aliases are structural and known in advance. They are planted in GATE-GROUND-03 and seed the negative-control registry.

# Aliased quantities Smallest case What separates them
1 Armature N²·J_r and link inertia about the joint axis A joint moving alone: only I_link + N²·J_r appears A payload of known inertia, or a second joint moving
2 Coulomb friction and a constant bias torque Motion in one direction: τ_c·sgn(q̇) + τ_b is one number Reversals
3 Viscous friction and back-EMF damping Voltage drive: b + k_t·k_e/R is one number A current measurement, or current-mode drive
4 Torque constant and the scale of inertia and friction Commanded current and encoder only: all four are known up to one factor A known payload, or a torque sensor
5 Actuator delay and clock offset §30.7, rule 3 A shared hardware mark
6 Friction coefficient and the torque limit F = min(k_t·I/r, μ·N) with k_t = 0.2 N·m/A and r = 0.06 m: at 1 A and 2 A under 30 N and 40 N the drawbar force is 3.33 N and 6.67 N for μ = 0.4 and for μ = 0.8; at 3 A under 10 N it is 4 N and 8 N Exciting the traction-limited regime as well as the torque-limited one
7 Static friction and everything else A run that never dwells at zero velocity carries no information on breakaway Slow torque ramps from rest, both directions
8 Contact stiffness and contact damping One drop height gives one rebound ratio Two drop heights, or a force trace

Design. Candidate experiments come from a small grammar, each with a duration, a safety envelope (limits on torque, speed, travel and temperature) and a predicted J.

Experiment Instruments Informs
Slow torque ramp from rest, both directions Current, encoder Static friction, Stribeck speed
Velocity steps and coast-down Encoder Coulomb and viscous friction
Multisine torque, unloaded and with a known payload Current, encoder Armature, torque-constant scale
Step command with a shared mark Command log, encoder Delay, first-order lag
Stall and speed sweep at two bus voltages Current, voltage, encoder Torque–speed envelope
Thermal soak at fixed current Winding and case temperature Thermal resistances and capacitances
Incline to first slip; sled drag at two normal loads Angle, force Friction coefficient per material pair
Drop from two heights Force or acceleration Contact stiffness and dissipation
Scale, balance and bifilar pendulum Mass, period Mass, centre of mass, inertia

Selection maximizes log det(I + Σ_g J_gᵀ·J_g/ridge) greedily over whole experiments under a time budget, using fs-uq::experimental_design. Where instruments share a calibration error, the cost-budgeted plan of fs-assimilate::groups::stream::design is used instead, because it conditions on the shared nuisance. ground.excite returns the plan, the predicted bound per parameter, the combinations still aliased and the experiment that would separate each. It needs no data and it never returns a fit.

Two cautions bind the design.

  • Model class. A probe that is perfect inside its assumed law class can be wrong outside it. In one executed study a probe built for three material laws classified 675 of 675 cases inside the class and 0 of 225 under an omitted delayed law, while measuring the target quantity directly was right in 900 of 900 (FACT, Appendix H). Where measuring the decision quantity directly costs about what probing a parameter costs, Ground recommends the direct measurement, and the rehearsal always contains an omitted-law control (§30.21).
  • Decision relevance. An experiment is recommended for the decision it could change, not for the parameter it would sharpen. Ranking uses value of information per unit cost (§30.15). If every admissible parameter value implies the same design decision, the recommendation is to measure nothing.

30.9 Identification: actuators first F

Why actuators first. Recent sim-to-real studies agree on where the gap lives (§15). Identifying armature, joint friction and delay gave 46% more travel distance and 75% less rotational deviation in one 2026 study (https://arxiv.org/abs/2604.10351); static friction is commonly missing from randomization; joint friction and actuator delay were called particularly critical for a point-foot biped (FACT, Appendix H). Simulation agrees in kind. In a planar threshold-crossing pilot, changing one winding feed-forward term from R·i_ref to R·i changed 24 of 156 outcome labels, and success fractions of 0.093 and 0.780 at a 100 Hz loop with no rotor inertia became 1.000 and 1.000 at 1 kHz or with rotor inertia added (FACT, Appendix H). A contact parameter fitted before the actuator is right absorbs the actuator's error and then predicts the wrong thing on the next surface.

Order. (0) Clocks. (1) Actuators, joint by joint, unloaded on a stand where possible: delay and lag; static, Coulomb and viscous friction with the Stribeck speed; armature; the scale of the torque constant; then the torque–speed envelope and thermal constants of level L2 (§15). (2) Contact and surface: friction per material pair under at least two normal loads, dissipation, rolling resistance. (3) Inertia and geometry, from scale and pendulum measurements and from as-built scans (§30.14). (4) Sensors: bias, noise, latency (§20).

Model. Per joint at level L1,

(I(q) + J_a)·q̈ + b·q̇ + τ_f(q̇) + g(q) = N·η·k_t·i(t − d), τ_f(q̇) = [τ_c + (τ_s − τ_c)·exp(−(q̇/v_s)²)]·sgn(q̇) while moving,

with the joint-level stiction row of §18 holding q̇ = 0 while the applied torque is inside ±τ_s. The parameter vector is θ = (J_a, b, τ_c, τ_s, v_s, d, τ_lag, k_t scale).

Estimator. Three passes, owned by frob-ground except where a sibling is named.

  • Pass A, linear. Away from sticking and saturation the model is linear in (I + J_a, b, τ_c, bias). A least-squares regressor fit on band-limited signals gives a warm start and a first residual plot.
  • Pass B, output error. The joint, or the whole robot, is simulated with candidate θ and compared with the measured encoder, current and torque traces. The Gaussian update is the iterated Gauss–Newton Kalman update of fs-assimilate::nonlinear::iterated, with model Jacobians from the referee; outliers go through its Huber-loss fit; a shared encoder bias enters as a common-mode source through groups, so a thousand samples that share one bias do not count as a thousand measurements. Because that update admits at most 256 rows, traces enter as windows of summary features, and the window definition is part of the calibration record.
  • Pass C, nonsmooth parameters. Delay is profiled, not differentiated: the other parameters are fitted at each delay on a grid of rational fractions of the control period (§20), and the result is the profile, its minimum, and the set of delays inside the 95% likelihood-ratio bound (TARGET). Static friction and the Stribeck speed are estimated from the ramp experiments by the ensemble lane, run as batched rollouts with per-world parameter variants (§17), because the stick–slip likelihood has no useful Jacobian.

Receipt. The calibration record holds the prior, the windows, each pass, the posterior (mean, joint covariance, delay profile), misfit before and after, and the autocorrelation of residuals at control-rate lags. It also holds one independent cross-check: the energy ledger of §29 evaluated on the real log. A model can fit nominal motion for the wrong physical reason, with current draw and mechanical work disagreeing while speed looks right. A fit whose electrical-to-mechanical energy residual exceeds the instrument bound is marked wrong-reason and cannot be admitted.

30.10 Card updates from logs F

The posterior is written as a new card version. Every identified field gets provenance measured, the dataset hash, the cell and its marginal uncertainty. The card also stores the joint covariance of the identified fields. Armature and friction estimates are correlated, and randomization that samples the marginals independently is wider than the evidence in some directions and narrower in others; correlated draws use fs-uq::product_copula (FACT).

  1. Candidate, then admitted. ground.identify writes a candidate. It becomes admitted only when ground.score has scored a frozen prediction made with it on sealed data and the registered interval covered. Randomization for training (§23) keeps the prior width until then (INV-GROUND-05).
  2. A discrepancy floor. The posterior variance of a field is never reported below the variance that validation residuals attribute to model form. The floor is the common-mode term of fs-assimilate::groups, estimated on validation data. More samples shrink sampling error and leave the floor.
  3. Unit and class. One robot calibrates one robot. A per-unit posterior describes that unit's left knee. A part-class card is hierarchical: a class mean and a unit-to-unit spread. With one unit measured the spread stays at its prior; with k units it is estimated on k − 1 degrees of freedom.

30.11 Frozen predictions, sealed trials, holdout retirement F

A real trial is preceded by a prediction record. It extends the registered predictions of §28.

# frob.ground.prediction/1 (DESIGN)
[prediction]
version = 1; cell = "…"; model = "ModelId"; cards = ["…"]; scene = "SceneId"; task = "TaskId"
conditions_draw = "philox:seed=…"       # trial conditions are drawn and recorded before the trial
world_addr      = "…"                   # the simulated side is replayable at its recorded determinism class
metrics = [ { name = "crossing_time_s", interval = [4.05, 4.42], level = 0.90 },
            { name = "peak_current_A",  interval = [4.8, 6.1],   level = 0.90 } ]
scoring   = "interval-score"
decision  = "B beats A by at least 5 points"
tolerance = "from instrument sigma and the decision margin"
study     = { type = "fixed-n", n = 20, reachable = ["promote", "inconclusive"] }
frozen_at = "ledger-seq:…"              # precedes the first read of the sealed chunk
  • Tolerances are registered and are derived from measurement uncertainty and the decision margin. One unitless epsilon across angles, currents and temperatures is refused.
  • Scoring is proper. The interval score is S = (u − l) + (2/α)·(l − y)₊ + (2/α)·(y − u)₊, reported with bias, coverage, and residual structure against condition.
  • The study type is declared (§24): fixed-n exact with a pre-analysis of reachable verdicts, or anytime-valid, never both. For real trials n is small and the pre-analysis decides whether the trial is worth running. With zero failures in n trials, the one-sided 95% upper bound on the failure probability is 1 − 0.05^(1/n): 13.9% at n = 20, 9.5% at n = 30, 4.95% at n = 59. A claim of "under 5%" is unreachable below 59 failure-free trials (FACT, arithmetic).
  • A refit opens a new version. A posterior changed after validation data was seen needs version 2 of the prediction and fresh sealed data. A published failure keeps its original threshold.
  • A scored holdout is spent for that cell and model lineage. It moves to the calibration pool or the regression set and is never a holdout again (INV-GROUND-04). Repeated confirmation attempts spend error as in the qualification lane: the i-th attempt on fresh data runs at α_i = α/[i·(i+1)] (§24).
  • A reversed ranking is a result. If the real ranking of two designs contradicts the simulated one, the outcome is ranking-falsified: the cell's domain narrows to where the ranking held, and the pair, its conditions and its logs become a regression case in the divergence ledger (§16).

30.12 Conformal bands per calibrated cell F

Definition. Inside one cell, calibration pairs (ŷ_i, y_i) are a simulated prediction and the real outcome under the same registered conditions. The residual is r_i = |y_i − ŷ_i| for a two-sided band, or r_i = ŷ_i − y_i for a one-sided statement "real is at least sim minus q̂" on a performance metric. The half-width q̂ is the ⌈(n+1)·(1−α)⌉-th smallest residual, and the band is infinite when that index exceeds n. The implementation is fs-eproc::hardening::MondrianConformal with the cell as the bucket and a minimum calibration count of 19 (TARGET; the sibling's own fixture uses 19, FACT).

What the evidence supports (FACT, Appendix H: https://arxiv.org/abs/2107.07511 and arithmetic from its coverage law).

  • Marginal coverage of at least 1 − α holds for any simulator quality, provided test draws are exchangeable with the calibration draws. A poor simulator gives a wide band, not a wrong one.
  • Conditional on the calibration set, realized coverage is distributed Beta(n + 1 − l, l) with l = ⌊(n+1)·α⌋.
n Target Mean coverage Standard deviation P(coverage < 0.80)
20 0.90 0.905 0.063 0.069
200 0.90 0.900 0.021 below 0.001
  • A finite band needs n ≥ (1 − α)/α: 9 at 90%, 19 at 95%, 99 at 99%. At n = 20 a 95% band is the largest residual seen, and any level above 20/21 = 95.2% is unbounded.
  • The exchangeable unit is the robot, not the episode. Twenty episodes on one machine are one cluster. For the same unit in the same cell, episodes are the draws. For a new unit of the same design, units are the draws, so a band across units needs at least 9 calibrated units at 90% and is refused below that.
  • Paired simulation buys little hardware time. One study reports savings of 20–25% of hardware evaluation effort for similar bounds, and that with low correlation between simulation and reality, real-only evaluation gives the tightest bounds (https://arxiv.org/abs/2510.04354). The ceiling of the benefit on real-trial count is therefore about 1.3, stated before any test. Ground reports the measured correlation in each cell and recommends real-only evaluation when it is below 0.5 (TARGET).
  • The known bound on the coverage gap under shift is Σ w_i·d_TV(Z, Z_i)/(1 + Σ w_i) (https://arxiv.org/abs/2202.13415). For an unbuilt design the distance cannot be measured, so nothing is issued.

Rules.

  1. A band is issued per cell, and refused for an uncalibrated cell, for n below the minimum, for a new unit when too few units are calibrated, for any unbuilt design, for data pooled across cells or ModelIds, and for synthetic data mixed with real (FROB-REF-889, -846, -850).
  2. A simulated metric in a calibrated cell is reported as [ŷ − q̂, ŷ + q̂] with n, the level, and the sentence "coverage is marginal over calibration draws; at this n realized coverage varies by about ±(one standard deviation from the table)".
  3. A band never raises an evidence class. It is Estimated, and in a claim product (§8) the weakest input wins.
  4. A scorecard with many banded metrics spends an explicit false-coverage budget: each claim reserves its share up front (admission_alpha) and violations are flagged by e-BH (fcr_flag).

Counterexample: pooling hides a failing regime. Pooled calibration at a 90% target covers 20 of 20 episodes in one regime and 16 of 20 in a shifted one. The total is 36 of 40, nominal overall and 80% where it matters (FACT: fs-eproc/tests/conformal_shift_receipt.rs). This is why the cell is the bucket.

30.13 Drift detection that retires a calibration F

Trigger Mechanism Fires
Scope change Controller or firmware identity changes; a part is replaced or re-lubricated; the surface class changes; a recorded condition leaves the envelope; ModelId changes, including a kernel change that alters bits (§21); an instrument's calibration identity changes Immediately and deterministically
Rank drift Each new residual is ranked in the frozen calibration residuals. Under exchangeability the normalized rank is uniform. DriftMonitor bets against that in both directions and averages the two e-processes At e ≥ 1/α_d, α_d = 0.05 (TARGET)
Miss counting A likelihood-ratio e-process on band misses, null "miss rate ≤ p₀(n)", alternative p₁ = 0.5 At e ≥ 1/α_d
Expiry Age or operating hours since calibration (OPEN-GROUND-3) At the limit

Two facts about power, printed by ground.band --status so that a quiet monitor is not misread.

  • The rank monitor's slack is δ = max(1/√n, 0.02): 0.224 at n = 20 and 0.071 at n = 200 (FACT). At n = 20 it sees only gross shifts.
  • For the miss monitor, p₀(n) is the 95th percentile of the conditional miss rate: about 0.22 at n = 20 and about 0.14 at n = 200 for a 90% band (FACT, arithmetic from the Beta law). At n = 20 a miss multiplies the evidence by 2.27 and a cover by 0.641, so four misses in a row give 26.7 and retire the calibration, and three give 11.7 and do not. This monitor cannot tell drift from an unlucky calibration draw. Both mean the band under-covers, and both call for recalibration.

On retirement the status becomes retired(cell, reason), reports revert to reality: no-claim, and verdicts that cited the band are marked stale through the dependency-directed revalidation of §28. The alarm ends the regime, and calibration restarts inside the new one. The monitors are e-processes, so they are read after every episode without inflating error (§24).

30.14 As-built ingestion F

A built part is one more representation of the design.

  1. The build packet declares datums and at least three non-collinear fiducials per part at design time (§31.12). That is what makes registration well-posed.
  2. A scan with fiducial correspondences is admitted like any dataset.
  3. fs-asbuilt::rigid3::register3 aligns scan to design in closed form. The similarity variant reports scale with a standard error and a unit-suspicion diagnostic: a scale near 25.4 or 0.001 is a unit error, not shrinkage. estimate_calibrated_rigid3 returns a six-parameter pose covariance.
  4. field computes signed deviation, wall thickness and form fields from supplied surface correspondences.
  5. propagate carries pose covariance into link length, axis offset and axis parallelism with their cross-correlation, and downgrades a term to unknown when its sigma-point check shows the linearization is poor.
  6. Ground converts geometric deltas into posteriors on .fbot parameters, and converts volume and a scale reading into mass, centre of mass and inertia through fs-mbd-material, which compiles geometry and card density into the existing spatial inertia (FACT). Measured mass against computed volume gives the effective density of a printed part.
  7. The result is an as-built model variant with provenance as-built, hence a new ModelId. Per-world model variants (§17) hold the as-designed and as-built robots in one batch, so "does the built unit still pass?" is one run.
  8. Each measured feature is compared with its allocated tolerance and sensitivity (§31.11).

If the registration residual exceeds the deviation under review, the signal is below the noise and no deviation is reported (well_posed). The residual is a fit diagnostic, not a transform uncertainty. Because the sibling does not search for correspondences, Ground accepts only scans with fiducials, or scans registered by an identified external tool whose identity is recorded as provenance (FROB-REF-812 otherwise).

30.15 The decision model for reality calibration F

This is the reality-calibration decision core of §28, specified for its owner. Its deterministic fallback is already the default state of the chapter.

  • State, per cell. Uncalibrated; calibrated and exchangeable; calibrated and shifted.
  • Actions. Issue a band; refuse; recommend k more real episodes; retire.
  • Loss. A band that under-covers and is relied on costs C_false. A valid band withheld costs C_refuse. A real episode costs c_real, expressed in GPU-second equivalents at a declared exchange rate (OPEN-GROUND-4). C_false is far larger than C_refuse: reporting an artifact-dependent result as established costs more than a wasted episode. The alarm level follows from the loss as α_d = c_recal/C_stale, with 0.05 as the default.
  • Artifacts. (a) The residual quantile per cell, whose calibration set is its only calibration source and whose conditions come from a pre-registered draw. (b) A guard table (n, level) → finite band, infinite band or refusal, regenerated in CI and diffed. (c) The two monitors of §30.13. (d) Rows of the experiment table for real batches: cost, expected value of sample information, and their ratio.
  • Buying real episodes. With Δ ~ N(m, s²) the posterior on the score difference of two finalists and s̃² the variance an experiment removes, EVSI = s̃·[φ(z) − z·Φ(−z)] with z = |m|/s̃. Here s² is the sum of sampling variance, tier-bias variance and the reality-gap variance σ_r² of the cell.
  • Substituted (illustrative). m = 0.03, sampling 0.03², tier bias 0.04². In an uncalibrated cell with σ_r = 0.10, twenty real pairs with per-pair noise 0.3 remove s̃ = 0.096 and are worth 0.0251; all remaining simulation can remove at most the first two terms (s̃ = 0.05) and is worth 0.0084. In a calibrated cell with σ_r = 0.02 the same real batch is worth 0.0035 and the simulation 0.0084.
  • Intuition. Calibration does not make simulation faster. It changes which experiment is worth buying.
  • Obligations. Coverage at least 1 − α for exchangeable draws. Type-I error of each monitor at most α_d under optional stopping. The planner never issues a verdict, so a wrong variance model costs efficiency and never validity. The planner chooses how many real episodes, never which conditions: assigned conditions equal the registered draw, and that equality is the interference test.
  • Failure modes. Survivor-only calibration; starved cells; conditions chosen by the operator; drift.
  • Deterministic fallback. reality: no-claim. Triggers: fewer than 19 calibration points; a monitor at or above 20; an audited miss rate above its bound; any scope change.
  • Budgeted mode. At most 30 real episodes are recommended per decision (TARGET); beyond that the answer is "inconclusive, no-claim".
  • Timescale. Once per real batch. Kernel builds and effort profiles are constants to it; per-episode promotion treats the band as a constant.

30.16 Verbs

Verb Kind First milestone Does Refusals
ground.ingest mutate M1 for admission and the reality: line; M5 for scans Admits a log, a bench measurement or a scan; fits clocks; seals splits; feeds the monitors of calibrated cells 840, 841, 849
ground.excite read M4 Identifiability report and excitation plan for a design, a card set and a rig description 842
ground.identify run M5 Staged identification; writes candidate card versions and the calibration record 842, 850
ground.predict mutate M5 Freezes a prediction for a planned trial 843
ground.score run M5 Opens sealed data once, scores, retires the holdout, admits or rejects the posterior 843, 844
ground.band read M5 Issues or refuses a band; lists cells, coverage accounting and monitor states; --retire needs a capability 845, 846, 847
ground.kit run M5 Builds or checks a replication kit 848

The cluster has seven verbs, the limit of §32. Long verbs take the bounded synchronous wait and otherwise return a job handle.

30.17 Bench work packages (optional, outside the critical path)

These packages are imports. None is scheduled against a milestone, none gates a release, and each leaves reality: no-claim in place if it never runs. Work-package identifiers are assigned in §44.

Package Rig Measures Completion condition
A. Actuator stand One actuator of a catalogue class on a stand with a known payload Current, encoder, optionally torque A sealed prediction of a held-out trajectory is scored; the card gains measured fields
B. Ramp and material pairs An incline and a drag sled Slip angle, drag at two normal loads Friction per pair with its interval; alias 6 of §30.8 shown separated
C. Instrumented cart The cart and sill fixture of §24 with 60 mm and 75 mm wheels Current, encoder, crossing time A frozen prediction and the A/B ranking are scored on a sealed day
D. One built link A printed or machined link with declared fiducials A scan and a scale reading The as-built loop of §30.14 closes and the tolerance audit is produced
E. Calibrated release Named robot, surface and task cells Whole-robot logs Bands issued per cell from held-out predictions, with limits stated
F. Revalidation Independently acquired traces for cells of E Whole-robot logs Each ranking reversal and calibration limit reported

Sourcing may start at M0. Nothing waits for it.

30.18 The replication kit F

A kit lets a third party rebuild a result without access to this machine or to anything private.

  • Contents. The design, cards, scene pack, task and prediction records; the dataset if its licence permits, otherwise its hash and the acquisition protocol; the bench protocol (rig description, excitation plan as data, instrument list); the analysis configuration; expected outputs with tolerances and determinism classes; any cited .frobcert; the no-authorization flags of §12; and the synthetic rehearsal, so the known answers run with no hardware.
  • Nothing private. The builder refuses any input that carries or inherits the private mark of §37, and any asset whose licence forbids redistribution (FROB-REF-899). There is no override flag.
  • Self-test. A kit passes when a clean machine reproduces its numbers: bit-for-bit on the same backend (class D2), inside the recorded envelope otherwise (class D3).
  • Losing results too. A kit is built for a falsified prediction as readily as for a confirmed one.

30.19 Refusals

Codes are in the evidence-and-protocol family of §35.

Code Refused Repair offered
FROB-REF-873 A dataset lacking licence, provenance, rights or measurement uncertainty The missing fields
FROB-REF-876 Clock alignment under-determined, or a scored instant outside the bracket The marks needed
FROB-REF-879 A fit on a parameter set that fails identifiability The aliased combination and the separating experiment
FROB-REF-883 A read of sealed data with no frozen prediction, or a prediction changed after freezing Register a new version
FROB-REF-886 Reuse of a spent holdout Acquire fresh sealed data
FROB-REF-889 A band for an uncalibrated cell, or with too few calibration points Samples present and samples needed
FROB-REF-895 A band for a design that was never built reality: no-claim, with the simulation's own interval
FROB-REF-897 Use of a retired calibration The retirement reason; recalibrate
FROB-REF-899 A private or non-redistributable input to a kit The offending inputs
FROB-REF-812 An as-built registration that is ill-posed or below its noise screen Fiducials needed; residual against deviation
FROB-REF-814 Pooling across cells, across ModelIds, or of synthetic with real data Separate the pools

30.20 Invariants and proof obligations

ID Statement How it is tested
INV-GROUND-01 Every report prints a reality: line, and its default is no-claim. A report generated with no dataset is checked in CI
INV-GROUND-02 A card is never mutated; a posterior is a new version with provenance and dataset hash. Content addresses before and after ground.identify
INV-GROUND-03 A prediction's ledger sequence precedes the first read of the sealed chunk it predicts. The ledger's total order; a planted early read is refused
INV-GROUND-04 A holdout chunk is scored at most once per cell and model lineage. A planted reuse is refused
INV-GROUND-05 Randomization width from a card does not narrow without an admitted validation. A candidate posterior leaves the training manifest unchanged
INV-GROUND-06 Data of origin synthetic never yields a status other than synthetic. A relabelled synthetic set fails its hash
INV-GROUND-07 Ground performs no device input or output. Dependency firewall in xtask; no socket, serial or bus crate in its graph
PO-GROUND-01 The quantile index ⌈(n+1)·(1−α)⌉ and the infinite-band rule give coverage at least 1 − α for exchangeable draws. Tested over 10⁴ exchangeable resamples; a candidate for a theorem card in §12
PO-GROUND-02 The two-mark clock formulas of §30.7. Derivation on file; Monte Carlo over mark jitter
PO-GROUND-03 Each drift monitor's false-alarm rate is at most α_d under optional stopping. 10⁴ null runs stopped adversarially

30.21 Known answers: the synthetic rehearsal

No real data is needed to decide whether Ground's machinery is correct. A truth simulator is the referee with planted parameters and one planted difference of model form; it emits logs through the sensor models of §20 with planted clock skew and offset. Everything it produces is origin = "synthetic". Recovering planted values shows that a bounded loop is sound and nothing more; the Reality claim stays no-claim.

Known answer Planted truth Expected Negative control
Clock recovery Skew 100 ppm, offset 3.7 ms, mark jitter 50 µs, marks 10 s apart Skew within 3·σ_s = 21 ppm; aligned instants cover truth One pulse only: refused. Offset fitted to the scored event: detected
Structural aliases The eight cases of §30.8 Each flagged, with the identified combination named A fit request on each: refused
Friction against torque limit k_t = 0.2 N·m/A, r = 0.06 m, μ ∈ {0.4, 0.8} Forces 3.33 N and 6.67 N indistinguishable; 4 N and 8 N separated at 3 A under 10 N The torque-limited data alone yields no μ
Actuator recovery J_a, b, τ_c, τ_s, v_s, d on a single-joint rig Each within 10% of truth; delay within one grid step Unidirectional data: τ_c refused
Delay against offset Delay 8 ms, offset −8 ms, no shared mark Reported as "delay plus offset = 0" A card delay update: refused
Omitted law Truth has a Stribeck term the fit class lacks The candidate is rejected at validation The same fit scored on its own calibration data passes, showing why sealing matters
Wrong reason Speed matched by a compensating error in k_t and friction Energy cross-check marks wrong-reason —
Band coverage Exchangeable residuals, n = 20, target 0.90, 1,000 resamples Mean coverage 19/21 = 0.905; fraction below 0.80 about 0.069 Pooled shifted regime: 16 of 20
Band refusal An unbuilt design; a cell with 8 points; a new unit with 3 units calibrated Refused in each case —
Drift Friction raised by 30% after episode k Retired within 20 further episodes Null runs: false retirement at most 5%
Miss monitor arithmetic n = 20, p₀ = 0.22, p₁ = 0.5 Four straight misses give 26.7; three give 11.7 —
Reachability Zero failures in 20 real trials Upper bound 13.9%; "under 5%" unreachable A registered claim of "under 5%" at n = 20: refused at registration
As-built registration A planted rotation and translation; a 0.3 mm wall deviation Recovered inside stated uncertainty Two fiducials: refused. Scale 25.4: unit suspicion raised
Protocol Read before freeze; refit without a new version; holdout reuse Each refused —

30.22 Pilots, gates and kill gates

Pilots before funding. None needs hardware, and each costs hours of CPU and one to two engineer-days.

Mechanism Pilot Falsifier
Bands and drift A second simulator with a perturbed contact model stands in for reality. Calibrate on 20 episodes of task family A; test on held-out A and on shifted family B; 1,000 resamples. Mean coverage on A differs from 19/21 by more than 0.01; or a band is issued for B without B data; or B episodes fed as A raise no alarm
Identification One joint with planted parameters, simulated on the referee alone, through the three passes of §30.9 A planted parameter missed by more than 10% after the designed excitation; or an aliased pair fitted without refusal
As-built A synthetic point cloud of one link with a planted pose and wall deviation through fs-asbuilt The planted values fall outside the stated uncertainty

Ceiling. Ground has no lever on time or compute. It is an honesty mechanism, and its only possible saving, on real-trial count, is bounded near 1.3 (§30.12).

Gate Claim Threshold (TARGET) Earliest
GATE-GROUND-01 Known answer Every report prints the reality: line; with no dataset it reads no-claim; a negative battery of 50 planted misuses is refused in full. M1, then every exit
GATE-GROUND-02 Known answer Clock recovery as in §30.21 in at least 99% of 1,000 resamples; both negative controls caught. M5
GATE-GROUND-03 Known answer The eight structural aliases are flagged, 8 of 8, and no fit is issued on an aliased set. M4
GATE-GROUND-04 Known answer Planted actuator parameters within 10% on at least 95 of 100 synthetic rigs; identified cards cut held-out trajectory error by at least 30% against prior cards; the omitted-law candidate is rejected in at least 90 of 100. M5
GATE-GROUND-05 Known answer The freeze-before-read order holds for every trial; the three protocol mutations are refused. M5
GATE-GROUND-06 Known answer Mean in-cell coverage within 0.01 of 19/21; fraction below 0.80 within 0.03 of 0.069; zero bands for the shifted cell, the short cell or the unbuilt design. M5
GATE-GROUND-07 Known answer The planted drift retires the calibration within 20 episodes in at least 90% of resamples; false retirement at most 5% over 10⁴ null runs; every scope change fires. M5
GATE-GROUND-08 Known answer As-built known answers of §30.21; the as-built variant has a new ModelId. M5
GATE-GROUND-09 Known answer A kit rebuilds the rehearsal on a clean machine inside its class; a private input is refused. M5
GATE-GROUND-10 Reality The first real cell: a frozen prediction scored on sealed data and a band issued. An import lane: it blocks nothing, and its resting state is no-claim. When data is admitted
Kill Trigger Fallback Decided at
✖ KILL-GROUND GATE-GROUND-04 fails after one repair cycle No identification. Ground keeps admission, clocks, frozen predictions and bands on direct measurements with prior cards; a card field changes only by direct bench measurement of that field. M5
✖ KILL-BAND GATE-GROUND-06 or -07 fails Bands are withdrawn. Reports print reality: no-claim with the raw residual table. M5
✖ KILL-CLOCK GATE-GROUND-02 or -05 fails Real logs are scored on time-free metrics only (success, energy, peak values); no crossing time, latency or delay is reported. M5
✖ KILL-ASBUILT GATE-GROUND-08 fails Scans are not ingested. As-built data enters as scalar bench measurements (mass, lengths), each a direct measurement of one card field. M5
✖ KILL-KIT GATE-GROUND-09 fails The kit ships as an archive of inputs, records and hashes, with no reproduction claim. M5

30.23 Open questions

  • OPEN-GROUND-1. Which public paired simulation-and-reality dataset, if any, has enough robots per class to test exchangeability across units. None was identified (FACT, Appendix H). Default: the second-simulator stand-in, labelled synthetic. Owner: Ground lead. Blocks GATE-GROUND-10 only.
  • OPEN-GROUND-2. Whether any bench hardware of §30.17 is acquired. Default: none; Reality stays no-claim. Owner: project lead. Blocks nothing.
  • OPEN-GROUND-3. Calibration expiry by age and operating hours. Default: 90 days or 200 operating hours, whichever comes first, and always on part replacement. Owner: Ground lead. Blocks GATE-GROUND-10.
  • OPEN-GROUND-4. The exchange rate between operator time and GPU-seconds in the experiment table. Default: real episodes are recommended, never scheduled, and no rate is assumed. Owner: project lead.
  • OPEN-GROUND-5. Who is the authenticated authority that could promote a sibling's estimated candidate. Default: nobody; every Ground output stays Estimated. Owner: Lemma lead (§12).

30.24 Exposure delay and mount translation on a straight pass

What it is. S A ninth structural alias beside the eight of §30.8, kept as its own fixture so that the count of GATE-GROUND-03 is unchanged. A synchronized clock does not separate a sensor's exposure delay from a translation of its mount along the direction of travel. Owner: frob-ground. Verb: ground.excite.

The alias. A range sensor with fixed orientation approaches a wall at coordinate L along a straight line at speed v. With an exposure delay δ and a forward mount offset b its reading at time t is

L − v·(t + δ) − b.

Only v·δ + b appears. At +2 m/s a delay of 20 ms and an offset of 40 mm give the same 101 samples of a one-second pass at 100 Hz.

What separates them. DESIGN. ground.excite flags the pair when every planned pass has the same velocity along the sensor's axis, and proposes, in order of the separation they give:

  • the same pass reversed without rotating the robot: at −2 m/s the two explanations differ by 80 mm;
  • a second speed: at +1 m/s they differ by 20 mm;
  • an independent exposure mark on the shared hardware line of §30.7, which measures δ directly.

A fit requested on data with one axial velocity returns the identified combination v·δ + b and updates neither the card's delay nor the mount transform. This is the spatial counterpart of the delay-against-offset alias of §30.7, and the same alias binds the extrinsic graph of §20.14 when a faulty edge is a time offset on one pair.

GATE-GROUND-11 Known answer. In the synthetic rehearsal of §30.21, the two explanations produce bit-equal samples on the +2 m/s pass and the fit reports "delay times speed plus offset = 40 mm" with no card update. With the reversed pass added, both the 20 ms delay and a planted 40 mm offset are recovered within their intervals, and the predicted separation is 80 mm to 10⁻⁹. A card delay update from the single pass is refused. M5.