Glossary
7,618 words1 tablePlan version 1.1
Every term of art the plan uses, one line each, with the section that defines it. The defining section governs where this appendix abbreviates. Terms are in alphabetical order; a term in two senses has two rows. Identifier prefixes (BET, GOAL, NS, C, T, A, DC, GATE, KILL, INT, INV, PO, OPEN, ADR, FD, WP, BD, GB, KA, H, N, FMT, FROB-REF) are registered in §0.3 and appear here only where the thing they name needs a definition. Numbers quoted in a row are DESIGN values of the cited section unless the row says otherwise.
| Term | Meaning here |
|---|---|
| Acceptance predicate | The Boolean predicate A on executions that a mission query must satisfy; written in the requirement language (C-17, C-30, §24.5) |
| Adjoint, coadjoint | Ad_g moves twists and Ad_g⁻ᵀ moves wrenches; the algebra coadjoint is ad*_ξ = ad_ξᵀ with no minus sign, so that μ̇ = ad*_ξ μ + w (§11.2, §13.3) |
| Admission gate | An INT-* test that a sibling foundation must pass at its pinned commit before any crate may depend on it (§33.6) |
| ADR | An architecture decision record ADR-<SUBSYS>-nn: a decision with its reason, stated in the chapter that owns it |
| Airlock | frob-fsim, the only crate that names FrankenSim's volatile types (§33.3) |
| Alias witness | See indistinguishability witness; the observation-alias form of §20.12 names two distant states that deliver the same readings |
| Amdahl ledger | The table of phase shares of an incumbent design loop from which every ceiling of the thesis is computed (§2.2) |
| Anchored position | An integer cell index plus an f32 offset in a cell of side 8 m, the offset centred in [−4, 4) m so that a cell shift is exact (§11.1, §35.8) |
| Annex | A separate workspace or project outside the core's lockfile and rules, kept apart by the unsafe and foreign-interface policy and, where it is Rust, built on the same toolchain T: spark/, derive/, bindings/, viewer/, lean/ (§34.1). surface/frob-mcp is a member of the core workspace, not an annex |
| Answer | What a mission asks for: a design and controller that pass a frozen battery, a family answer, a correct withdrawal or confirmation after an amendment, or a truthful unknown with its witness (§2.1) |
| Anytime-valid study | A study whose inference is an e-process or a confidence sequence, valid at every stopping time (§24.12) |
| Archetype (design) | One of the eighteen design templates that design.templates lists (§14.10) |
| Archetype (interior) | One of the seven interior families with a generator, a structural proxy and a hazard list (§19.7) |
| Arena | The subsystem that owns tasks, requirements, fixtures, metrics and the qualification lane (§24) |
| Arena (device) | The preallocated structure-of-arrays slabs that hold every per-world quantity on a device; no allocation after environment creation (§21.10) |
| Artifact graph | The record that links every claim to the evidence, runs and decision rules that produced it (§29.13) |
| Artifact guard | The three checks a failure or a witness must survive before Nemesis counts it: replay one tier up, replay under numerical variants, and the energy audit (§26.6) |
| Assumption lattice | Assumption sets ordered by strength, on which every certificate records a polarity (C-18, §28.13) |
| Atelier | The subsystem that owns the studio loop: analyses, comparison, lineage, optimization, the ladder, the cascade and the decision cores (§28) |
| Audit lane | The share of a rung's spend given to designs drawn by a keyed stream before any score exists and evaluated at the higher rung at fixed n; the only source of calibration (§28.9) |
| Augur | The subsystem that owns mission queries and inverse design (§25) |
| Authority model | The declared law by which forces or actuators can be commanded, for example independent normal forces or equal passive springs; a field of every stance result (C-32, §25) |
| Autopsy | The subsystem that owns counterfactual debugging by forks and interventions (§27) |
| Background referee | The CPU referee re-running a keyed sample of fast-tier world-seconds and one-step defects, with a reported coverage figure (§16.11) |
| Base interval | A piece [t0, t1) of rational time cut by the physics grid and the clock boundaries; the unit a transaction commits (§16.5) |
| Baseline controller | The estimator and controller synthesized from the model for every design, with no training (§22.3, §22.4) |
| Batch-composition invariance | The property that a world's trajectory does not depend on batch size, slot, co-tenant worlds, bucket capacity or shard count (§35.5) |
| Battery (evaluation) | A frozen, versioned set of scenarios against which a design is accepted (§24.9) |
| Bead | A unit of delivery work with a BD-nnn identifier and a structured log (§45, §29.14) |
| Bet | A hypothesis the plan depends on, stated with its falsifier and a potency control (§4) |
| Brick pool | The shared pool of distance-field bricks from which the scene variants resident on a device are assembled (§19.15) |
| Brownout | A bus power demand above E²/(4·R), for which no operating point exists; recorded as an event (§15.10) |
| Budget stop | A stop on budget that publishes nothing partial as a result, except that a mission query returns its certified cells and the unresolved remainder (§25, §32.9) |
| Build packet | The bounded manufacturing export .fbuild: geometry, tolerances, datums and fiducials, load envelope and evidence, with fabrication_released always false (§31.12) |
| Campaign (design) | A declared sequence of evaluations toward one design decision, with a budget and a report (§28) |
| Campaign (qualification) | A set of confirmation requests that share a claim family, a sealed world family and a total error budget α (§24.13) |
| Campaign quotienting | Evaluating one canonical representative per Γ_obs orbit and per mission-observable class (C-22, §17.11) |
| Canonical form | A design written as its dimensionless groups after division by its own scales m₀, ℓ₀ and t₀ (C-21) |
| Capability scope | A named permission attached to a session, such as qual:admin or qual:run (§32.13, §37.5) |
| Capacity bias | The bias introduced when contact-capacity overflow removes worlds from one arm of a comparison; such a verdict is labelled capacity-biased (§18.11) |
| Card | Immutable, content-addressed data about a real or generic part, with provenance per field: .fcard kinds actuator, battery, transmission, interface, material, optical, sensor, payload (§15.3) |
| Cascade | The six-stage co-design sequence: deduplicate and check, reuse and synthesize, screen, race, rank robustness, qualify (§28.11) |
| Causal policy | A map from the history of arrived packets to commands; the policy class Π_Y of a mission query (C-19, §20.15) |
| Cayley map | The rational retraction cay(x) = (I − x/2)⁻¹(I + x/2) (C-05) |
| Ceiling | The most a mechanism could gain, stated before any speed test (D-10) |
| Cell (clearance) | A cube of the (x, y, ψ) grid of a clearance complex, with two one-sided clearances (§19.11) |
| Cell (mission) | A box of a design family's parameter space that carries one verdict and one certificate (§25.3) |
| Cell (reality) | The scope of a Reality result: physical units, controller and firmware, surface, task family and envelope of conditions (§30.5) |
| Certificate bundle | The portable .frobcert file that carries statements, proof objects and receipts for frob-verify (§12.4) |
| Certified | The evidence class of an instance-level statement accepted by a checker with an offline-verifiable certificate (§12.2) |
| Chronicle | The subsystem that owns telemetry, replay, forks, ledgers and the artifact graph (§29) |
| Chunk | The unit of published telemetry, written once and addressed by key (§29.4) |
| Claim | One of seven kinds that are never conflated: Proof, Known answer, Parity, Fidelity, Design comparison, Reality, Performance (§8.1) |
| Claim product | The type of a result that rests on two claims; its class is the weakest input's and nothing converts it into a proof (§8.2, §12.2) |
| Clearance complex | The pair of cubical complexes 𝒞_in ⊆ 𝒞_free ⊆ 𝒞_out of a planar base in one fixture mode, stored as .fclear (C-33, §19.11) |
| Clock contract | A task's declaration of rational periods, phases, the seven instants and the rule for intra-step events (§20.4) |
| Cohort | A set of model slots and worlds running under one step plan (§17.4) |
| Cold run, warm campaign | A cold run includes authoring the environment and the design domain; a warm campaign runs a declared sequence of amendments with reusable inputs (§2.1) |
| Commit fence | The rule that readers see only state at a committed commit_epoch; a candidate interval becomes visible in one step (§16.5) |
| Committed frontier | The contiguous prefix of published chunks to which a paginated query is pinned (§29.4, §32.8) |
| Compute envelope | An owner-approved resource class E0 to E3 for a run; E0 is 16 GiB, 8 cores, one hour, one device (§36.14) |
| Confirmation world | A world from a sealed cluster drawn fresh for one qualification request and unreadable by discovery until the campaign closes (§24.13) |
| Conformal margin | q̂, the ⌈(n + 1)·(1 − α)⌉-th smallest audit residual between two rungs or tiers (C-26, §28.9) |
| Construction | A mathematical object of the plan with its test, honest limits, tier and, for F and M, pilot and ceiling: C-01 to C-40 (§10) |
| Contact capacity | The fixed maximum number of contacts per world in a shape class (§16.6, §18.11) |
| Contact law | A named law of the contact solve: CL-1 compliant default, CL-2 Hunt–Crossley, CL-M import mapping, CL-H hard contact (§18.5) |
| Controller arm | The declaration, in a comparison of designs, of whether the controller is shared, retuned with equal resources, or inherited (§24.12) |
| Convergence gate | A GATE-* row: one claim, one test, one numeric threshold and one milestone (§40) |
| Cortex | The subsystem that owns the gym, learning, family policies and inheritance (§23) |
| Cosserat rod | A one-dimensional elastic body with a frame per cross-section; the M model of cables and cords inside a coupled island (§19.10) |
| Counterexample | The smallest hand-checkable case that breaks a plausible shortcut; a permanent negative control (D-9, Appendix N) |
| Coupled island | A free-surface fluid, cloth or rod solver that runs beside one world on the CPU referee, for finalists only and behind a flag (§19.10) |
| Crossover reuse count | The number of amendments after which one-time authoring has paid for itself in a warm campaign (§2.1) |
| D0 to D4 | Determinism classes: exact; bitwise across backends; bitwise per backend and independent of the batch; tolerance with decision agreement; unspecified (§35.1) |
| Decimation | d, the control period divided by the physics step h; an env-step is d world-steps (§36.2) |
| Decision core | One of eleven recurring decisions (DC-01 to DC-11), each with a compiled table, a loss model, proof obligations, a deterministic fallback and a budgeted mode (§28.19) |
| Decision-level equivalence | The test under class D3 that task decisions agree between two runs, not only that state errors are small (§35.4) |
| Defensive mixture | A proposal q = β·p + (1 − β)·q′ whose importance weights are at most 1/β (C-27, §26.9) |
Degraded, Faulted |
World states. Degraded: a world that exceeded a contact or row capacity or did not converge, marked with its reason and never silent. Faulted: a world whose transaction failed every numerical plan, with cause numerical-fault kept apart from physical failure (§16.6, §16.14) |
| Dependency firewall | The checks that keep sibling and third-party dependencies out of crates that may not have them (§33.7) |
| Derivative-validity label | One of nine labels a derivative carries: smooth, saltation, discrete-step, fixed-mode, one-sided, generalized, smoothed, finite-difference, refused (C-16, D-15) |
| Design | A typed term in the design language, stored as .fbot with schema frob.design/1 (§14.3, §14.4) |
| Design corpus | About 200 designs (templates, parameter perturbations, designs with planted defects, planted winners and planted causes) with labels fixed before any analysis is tuned (§24.9) |
| Design family | A set of designs over typed holes and parameter charts on which a mission query or a family batch ranges (§25.3, §17) |
| Design-family bucket | A packing of a family's worlds in which constants shared by its members are stored once; the device form of a family lane (§21.11) |
| Determinism profile | A named set of pins a run declares: reference-replay, device-replay, cross-backend, or the labelled class-D4 fast-training (§35.2) |
| Device-second | One second of one device's wall-clock occupancy, including compilation, admission, transfer and synchronization (§36.2) |
| Differentiator | One of the thirteen statements N1 to N13 of what the project adds, worded as the audit permits (§1.6) |
| Disclosure block | The fields every Performance claim carries: hardware, versions, world count, step and decimation, solver settings, contacts, sensors, class, timings and memory (§36.7) |
| Discovery lane | Everything an agent may read while it designs: training scenes, development splits, batteries, the hard-world set, its own runs (§24.13) |
| Divergence ledger | Recorded CPU-versus-device differences per kernel (§21.13) |
| Docking boundary | The closed-form condition ε < (U + ½)/4 of the docking fixture, equality excluded (C-19, §20.16) |
| Docking fixture | A unit mass with hidden gain g ∈ {1, 2}, three ticks and one noisy velocity packet; the known answer for information timing (C-19, §20.16) |
| Doctrine rule | One of D-1 to D-19, the rules every construction obeys (§9) |
| Doubly robust tier correction | The estimator Z = m + A·(Y − m)/p that stays unbiased whatever the cheap prediction m is (C-25, §29.11) |
| Dual witness | A vector y that proves infeasibility of a relaxation: Mᵀy ≥ 0 and rᵀy < 0 (C-32) |
| E-process | A nonnegative supermartingale under the null, here the betting product Eₙ = ∏ (1 + λᵢ·d̃ᵢ) (C-15) |
| Edit | A typed change to a design that declares its correspondences and returns an invalidation set (§14.7) |
| Edit-to-first-step latency | The wall time from an accepted design.edit to the first batched step of the new design (§17.8) |
| Energy budget | The .fenergy inequality that bounds every source of energy that can reach an absorber by the absorber's minimum work (C-31, §22.11) |
| Energy ledger | The per-episode attribution of every joule to a store, a loss or an export, with the numerical residual on its own line (§29.9) |
energy-created |
The flag of an episode in which created energy exceeded 1% of the absolute work exchanged in any 0.5 s window on a fast tier, or 10⁻⁶ relative on the referee (§29.9; applied by §16.10) |
| Env-step | One control step of one environment: d world-steps (§16.1, §36.2) |
| Envelope (fidelity) | The frozen tolerance within which a faster tier must agree with a slower one for a result to be promoted (§16.8) |
| Envelope (output) | The common wrapper frob.envelope/1 of every verb's output, with claims, reality status, budget and refusal fields (§32.4) |
| Established | The label of a result re-evaluated on a higher tier and found inside its envelope; names its adjudicator (§16.8) |
| Estimated | The evidence class of a number from a model or a statistical procedure, with its uncertainty (§12.2) |
| Evidence class | Proved, Certified, Tested or Estimated, ordered strongest to weakest (§12.2) |
| Exact-integer kernel class | Kernels in integer arithmetic for strict predicates, digests and histograms; class D0 on every backend (§21.8) |
| Exclusion | A cell removed from the outer set with a refutation of matching scope (C-17) |
| Explicit reset | The default gym semantics: an ended world keeps its final observation until the caller resets it (§23.3) |
| Exploitation detector | A re-evaluation under a perturbation that should not matter, which flags a policy that depends on it (§23.16) |
| Facility co-design | Designing the robot, the building amendments and the handoff between robots in one query M (§25.17) |
| Family certificate | Certified evidence about a set of designs: a cell of the inner set or a cell removed from the outer set (§12.2) |
| Family lane | Worlds that share a tree, a sensor graph and, for a stretch of time, a contact mode, so that structure is constant across them (§17.6) |
| Family policy | One set of weights that acts on the tokens of any design of one morphology class (C-23, §23.11) |
| Feasibility witness | A face-connected path of inner cells from start to goal in a clearance complex (§19.11) |
| Fidelity ledger | Recorded differences between a faster tier and a slower one, per stratum (§16.8) |
| Film-friction law | The contact-level law in which friction on a wetted patch depends on dwell time, load and pad size (§18.8) |
| Firmware export | Export of a fixed-point controller with its Q formats and test vectors against caller-supplied interfaces M (§31.13) |
| First-divergence search | The search over the chained digests of two runs for the first tick and stage at which they differ (§27.10) |
| Five Explicits | Units, seeds, budgets, versions and capabilities are never implicit at the agent surface (§32.2) |
| Fixed-n exact study | A study with an exact interval or test at a sample size fixed in advance, admitted only with a reachability pre-analysis (§24.12) |
| Fixture | A small registered task with a closed-form or enumerated answer, for example fixture:cart-sill-dock (§24.10, §24.11) |
| Fleet | The two machines under one scheduler: the M5 Ultra holds the world bank, proofs, replay and large-memory jobs, the two RTX 4090 train, and only seeds, weights and receipts cross (§21.17) |
| Flip rate | ρ₀, the fraction of placebo forks whose verdict differs from the parent's (§27.5) |
| Floquet multiplier | An eigenvalue of the derivative of the return map of a periodic gait (C-16) |
| Fork | A child run started from a snapshot, with its own world address and fresh keyed streams (§27.3, §29.8) |
| Fork classification | The class the service assigns a requested change before restoring state: continuation, exogenous, contact-affecting, information, or structural (§27.4) |
| Foundation | A sibling project with an FD-* row: posture, pin, admission gate and fallback (§33.4) |
| Foundry | The subsystem that owns structure, manufacture and lifecycle (§31) |
frob, frobd, frob-mcp, frob-verify, frob-tui |
The CLI, the daemon, the MCP server, the offline certificate auditor and the terminal dashboard (§32, §12.4) |
| Gait orbit | A periodic gait computed as a fixed point of a return map, with its multipliers (C-16, §22.9) |
| Gauge | Directions that are unobservable by construction, such as global position and yaw under proprioception and gravity (C-20) |
| Gauntlet | The verification program, with tiers G0 laws, G1 known answers, G2 parity, G3 metamorphic, G4 chaos, G5 determinism (§38) |
| Generator | A keyed sampler of designs within a morphology class, identified by a GeneratorId (§17.10) |
| Ground | The subsystem that owns calibration against reality (§30) |
| Growth vector | The dimensions of the flag of a distribution under brackets; it decides controllability and the cost of small motions (C-07) |
| Guarded single precision | An f32 predicate with a proved error bound that falls back to exact arithmetic inside the bound (§13.7, §21.8) |
| Habitat | The subsystem that owns scenes, living worlds, clearance and retrofits (§19) |
| Hard-contact law | CL-H: Signorini complementarity with Coulomb friction on the cone; the referee's specification and an optional batch law (§18.5) |
| Hard-world set | The versioned set of minimal counterexample worlds per task family and robot class; discovery data, never a confirmation sample (§26.8) |
| Hardware fingerprint | The digest of host, device, driver, runtime, compiler and probe results to which caches and receipts are bound (§21.16) |
| Hazard list | The registry, per interior archetype, of hazards with dimensions and provenance (§19.8) |
| Hervé class | One of the twelve conjugacy classes of connected subgroups of SE(3) (C-01) |
| Hypothesis verdict | The recorded state of one of the planning hypotheses H-01 to H-24: supported, narrowed or refuted (§0.8) |
| Idempotency key | The caller's key that binds a mutating request to exactly one effect (§32.7) |
| Identity | A content hash such as DesignId, ModelId, SceneId, KernelId, PolicyId, EpisodeId; it names bytes and carries no verdict (§11.1, D-11) |
| Impossibility cut | Disconnection of start and goal in the outer complex at a margin, with the separating cells named (§19.11) |
| Independently accepted | Accepted by a checker that is not the proposing system: a battery in a neutral evaluator, frob-verify, a neutral adjudicator (§2.1) |
| Indistinguishability witness | Two admitted worlds and a deadline such that every admitted command prefix yields identical packet histories while the successful continuations are disjoint (C-19) |
| Inheritance | Initializing the policy of an edited design from its parent by the transport of the edit (C-23, §23.12) |
| Inner and outer complex | 𝒞_in contains a cell only if every pose in it is free; 𝒞_out omits a cell only if every pose in it collides (C-33) |
| Inner and outer design sets | I and O with I ⊆ F ⊆ O: every cell of I has a witness, every cell outside O a refutation (C-17) |
| Inner and outer enclosure | Sets contained in, and containing, the occupied set of a body under the stated field and registration errors (§18.3, §19.5) |
| Instants (seven) | Sample, exposure, timestamp, arrival, decision, command, actuation, with a fixed boundary ordering (§11.8) |
| Intervention | A typed change do(X := x) to one declared mechanism, recorded as a model difference (C-29, §27.5) |
| Job handle | What a long verb returns when it does not finish inside sync_wait_ms (§32.10) |
| Joint-level rows | Stiction, backlash and hard stops written as rows of the same solve as contact (C-37, §18.7) |
| Kernel | A manifest, its arithmetic and its sources in Rust and the shared dialect (§21.5) |
| Kernel class | float, exact, guarded or stat (§21.8) |
| Kernel IR | The typed intermediate form frob.kir/1 from which kernel sources are emitted and on which dimension checks and rewrite classes are decided (§21.7) |
| Kernel reflection | The route by which an instance certificate is promoted by evaluating a reflected checker inside a proof kernel (§12.4) |
| Kill gate | A KILL-* row: a trigger written in advance and the fallback that replaces the mechanism (§40) |
| Kinesis | The subsystem that owns dynamics on three tiers (§16) |
| Known answer | An analytic or enumerated truth a mechanism must reproduce; numbered KA-nn (§38, Appendix M) |
| Label count | The least number of calibration labels with which one controller serves all admitted variants by a deadline (C-19) |
| Ladder | The six evaluation rungs R0 static, R1 shared policy, R2 fine-tuned, R3 specialist, R4 referee, R5 rare failure (§28.9) |
| Layer rule | One of L-1 to L-12, the dependency rules between crate layers (§34.3) |
| Lease | An epoch-fenced right of the host to read or write a device slab (§21.10) |
| Legality set | The typed world edits, with bounds from cited norms, that an adversarial search may apply (§26.3) |
| Lemma | The subsystem that owns proofs, certificates and the offline auditor (§12) |
| Lifecycle compression | Advancing slow wear and ageing states over many hours of duty without simulating every step M (§31.14) |
| Lineage | The graph of designs linked by typed edits, with diff, blame, bisect and merge (§28.7) |
| Link token | The per-link input of a family policy: the link with its parent joint, in dimensionless features (C-23) |
| Living world | A scene whose state the robot changes: films, proxies, slosh and cords, admitted in three tiers (§19.10) |
| Load case | One instant of one episode from which structural loads are taken; peaks from different instants are never assembled (§31.6) |
lockstep |
The step profile of the throughput tiers: fixed step, fixed iteration count, convex compliant solve (§16.3, §16.6) |
| Marrow | The subsystem that owns the algebraic core: Lie types, groups, exact predicates (§13) |
| Mass-support bound | ‖c − o‖² + tr(I_C)/(2m) ≤ ρ² for a body whose mass lies in a ball of centre o and radius ρ (§11.5) |
| Mechanical group | Γ_mech, the automorphisms of the labelled kinematic tree realized by an isometry that preserves every mechanical parameter (C-09, §13.4) |
| Memo graph | The store of results under complete dependency keys, checked by shadow recomputation (§28.14) |
| Metamorphic test | A relation that must hold between two runs without knowing either answer, such as equivariance under a symmetry or exact similarity scaling (§38) |
| Minimal counterexample world | A failing world reduced to a 1-minimal set of typed edits on a passing world, stored as .fmcw with a solvability witness (C-28, §26.7) |
| Mission query | A design domain, a world set, an observation channel, a causal policy class and an acceptance predicate with their quantifiers, stored as .fmission (C-17, §25) |
| Mission-observable projection | A digest of the compiled model restricted to what the mission's equations read; equal digests are evaluated once (C-22, §17.11) |
| Mixed-topology batch | One batch whose worlds run robots with different kinematic trees (§17) |
| Model variant | A per-world model with its own tree, joint classes and actuator count inside the padded capacities of a shape class (§17.3) |
model-conditional |
The label of a ranking that reverses between contact laws or other model forms (§16.9) |
| Model-form rank check | The comparison of design rankings under two contact laws or stiffness variants (§16.9) |
| Module | A reusable sub-assembly .fmodule with a port contract and an invalidation contract (§14.6) |
| Moonshot cap | At most four M items are active at once; the rest wait in the queue of Appendix C (D-6) |
| Morphology class | A set of designs with one kind of body plan, for example quadrupeds, within which a family policy is trained and rank agreement is measured (§23.11, §28.10) |
| Negative control | A planted defect or deliberately invalid input that a gate must catch (§38) |
| Nemesis | The subsystem that owns adversarial worlds and rare-failure estimation (§26) |
| Neutral adjudicator | The party outside both arms of the ten-fold test that releases receipts only after both arms close (§2.1, §39) |
| No-authorization flags | execution_authorized, hardware_safety_signoff, sim_to_real_certified and, on build packets, fabrication_released: always false, with no setter (§12.2, §37.9) |
| Noninterference | Five properties: presentation, hidden truth, unused sensors and batch composition cannot change physics or delivered observations, and optics and contact cards cannot change each other's outputs (§20.17) |
| North-Star scenario | One of NS-01 to NS-24, an end-to-end session the plan must make possible (§7) |
| Null fork | The empty intervention; it must reproduce the parent bit for bit (§27.5) |
| Observability Gramian | W = Σ Φᵀ·Hᵀ·R⁻¹·H·Φ over a window, reported by its smallest singular value off the gauge (C-20, §20.11) |
| Observation-preserving subgroup | Γ_obs ≤ Γ_mech: the elements that also preserve sensors, payload, task goal, gravity and declared terrain structure (C-09, §13.4, §20.13) |
| One-step defect | The difference after one control interval between a device world and the CPU advanced from the same committed state (§16.11) |
| Optical volume | A box or ellipsoid with an extinction coefficient and a backscatter albedo, for steam, dust and glare (§19.3) |
| Packet queue | The pending sensor and command packets of a world; part of every checkpoint and restore set (§11.7, §16.5, §20.4) |
| Padding | Capacity of a shape class above a world's own size, masked so that it changes no result (§17.5) |
| Paired lower bound | The one-sided 95% lower confidence bound of a paired ratio; the only form in which a performance ratio is admitted (§36.6) |
| Parameter variant | A per-world set of continuous parameters within one tree (§17.3) |
| Partial ten-fold gate | The M3 measurement of the ratio on legged and wheeled briefs, recorded whatever its value, with a written rule for each outcome (GATE-TENFOLD-06; §39.12, BET-13). The tournament at M7 is GATE-TENFOLD-07 |
| Patch reduction | The documented replacement of the samples of a small contact patch by one contact, with its qualification fixture (§18.11) |
| Per-world mutable state | Scene state that a world may change, such as film thickness or a moved proxy, allocated from fixed-capacity pools and held in every snapshot (§19.3) |
| Phase accumulator | The integer counter by which a process with a rational period fires (§11.7) |
| Phase ledger | The measured breakdown of the wall time of a design loop by phase, device and agent turn, taken on both arms (§36.15, §39) |
| Phylum | The subsystem that owns families of bodies in one batch (§17) |
| Pilot | A paper-scale experiment with a written falsifier that must run before a Frontier or Moonshot work package is funded (D-10) |
| Placebo fork | A fork whose change no physical cause could depend on, used to measure how often chaos alone flips a verdict (§27.5) |
| Placement receipt | The record of which device each stage was requested on and where it actually ran (§21.12) |
| Planted winner | A known-good design inserted into a screened population; losing it voids the screen (§28.12) |
| Polarity | The direction in which a certificate survives an amendment of the world set, the policy class or the predicate (C-18) |
| Port | A typed interface of a component: mechanical, shaft, electrical, thermal or signal (C-12) |
| Posture | How a foundation is used: Consume, Subprocess, Lift, Oracle or Pattern (§33.1) |
| Potency control | A planted effect of known size that a bet's test must detect before a null result counts (§4) |
| Power-of-two similarity test | Scaling every dimensional input by powers of two according to its dimension and requiring the run to reproduce in every bit (C-21, §17.11) |
| Pre-analysis | For a fixed-n study, the list of verdicts reachable at that n and the power at declared alternatives (§24.12) |
| Precision profile | default or stiff, the declared arithmetic of the contact solve (§21.14) |
| Preflight | The eight stages of design check (§14.11) |
| Probability of necessity | PN(c) = P(no failure under do(¬c) given failure), estimated over failing worlds (C-29) |
| Probe | A physical experiment chosen so that mechanisms implying different designs give disjoint readings (C-39, §25.14) |
| Promotion | Re-evaluating a fast-tier result on a higher tier before it is called established (§16.8) |
| Proof kind | An entry of the closed registry of certificate forms a bundle may contain (§12.4) |
| Proved | The evidence class of a general statement accepted by a Lean kernel (§12.2) |
provisional |
The label of a fast-tier result that has not been promoted (§16.8) |
| Pseudo-inertia | The 4×4 matrix [[Σ, h], [hᵀ, m]] equivalent to the ten inertial parameters; consistent exactly when positive definite (C-03, §11.5) |
| Qualification lane | The blinded confirmation service: pre-committed requests, fresh sealed clusters and the error budget α_i = α/[i·(i + 1)] (§24.13) |
| Quality-diversity archive | A map of different good designs by behaviour cell, in place of one optimum (§28.8, §17.12) |
| Rank agreement | Agreement of the order of designs between two rungs or tiers: Kendall τ, a top-weighted τ and top-k recall with intervals (C-26, §16.9, §28.10) |
| Rational clock | A process whose period is an exact rational number of seconds, advanced by a phase accumulator (§11.7) |
| Reality band | The conformal interval [ŷ − q̂, ŷ + q̂] reported for a simulated metric inside a calibrated cell (§30.12) |
| Reality status | no-claim, synthetic, published-anchor, candidate, calibrated or retired (§30.2) |
| Referee | The most trusted tier, built on FrankenSim; not ground truth (§16.3) |
| Referee coverage | The share of fast-tier world-seconds, and of standard-battery scenarios, that the referee has re-run (§16.11) |
| Refusal | A structured error FROB-REF-nnn that names the rule a request violates (Appendix O) |
| Region certificate | An outward-rounded enclosure of one constraint on a box of at most about six design parameters (C-32, §25.6) |
| Registered prediction | A forecast an agent files before a run, scored afterwards with a proper scoring rule (§28.17) |
| Replication kit | The public bundle of data, commands and expected outputs with which a third party repeats a Ground result (§30.18) |
| Requirement | A signal-temporal-logic formula over unit-normalized predicates (C-30, §24.5) |
| Rescue rate | The fraction of replicates of an intervention in which the requirement is not violated (§27.6) |
| Restricted mean time | RMT = E[min(T, H)] at a common deadline H; an unresolved mission costs H (§2.1) |
| Retraction | A map from the Lie algebra to the group used to advance state (C-05) |
| Retrofit | A priced, typed amendment to the building, drawn from a catalog and compared with design changes in one budget (§19.12) |
| Return map | The map P of a Poincaré section to itself whose fixed point is a periodic gait (C-16) |
| Reuse grade | The licence under which a stored verdict skips a recheck: 1 identity, 2 dependency, 3 implication, 4 none (§28.13) |
| Revalidation | Re-deciding stored verdicts after an amendment by one engine behind result.revalidate and mission.revalidate (§28.13, §25.8) |
| Rewrite class | Class E rewrites change no bit under round-to-nearest with contraction off; class R rewrites are equal over the reals only and need an error bound and a new kernel identity (C-14, §28.19) |
| Rigid proxy | A body without internal joints that stands for a soft object: a rug as a free slab, a cord as a ridge or rod (§19.10) |
| Robustness | ρ = ψ/s, the margin of a requirement atom divided by its declared scale (C-30) |
| Rotor port | A thrust-producing actuator port for flight, admitted as M behind a flag (§15.4) |
| Rung | One level of the ladder of evaluation, allowed to decide only what its evidence supports (§28.9) |
| Saltation matrix | Ξ_e, the first-order map of perturbations across an isolated transverse event (C-16) |
| Sampling controller | A sampling-based predictive controller that needs no training; a screening scorer and fallback that never stands in for a trained policy as acceptance evidence. Its own episodes are accepted only where it is the delivered controller (§22.8) |
| Scene pack | A compiled scene .fscene: manifest, distance bricks, materials, fixtures, optical volumes and hazards (§19.3) |
| Scene split | The mechanical separation of training, development and held-out scenes, with building-level holdouts (§19.14) |
| Schedule class | An ordering of timing events modulo commutation of independent events; a race is explored once per class (C-19) |
| Scorecard | A design's metrics beside those of the reference robot of its class (§24.8) |
screening |
The label of a score from a rung that may discard and may not establish, such as a sampling controller or a gait orbit (§22.8, §22.9) |
| Sealed suite | The missions of the ten-fold test, fixed and sealed before either arm sees them (§39) |
| Segment mode | Re-simulation of one-second segments from fast-tier snapshots on a higher tier; it estimates a different quantity and says so (§16.8) |
| Sensorium | The subsystem that owns sensors, clocks and observability (§20) |
| Separating world | The admitted world nearest to nominal on which two closed loops receive different verdicts (C-18) |
| Settled-pose reset cache | Precomputed quasi-static start states per model, spawn, contact law and kernel version (§24.7) |
| Shadow recompute | Recomputing a sampled fraction of memo hits to detect an incomplete key (§28.14) |
| Shape class | The set of capacities one static step plan is built for, identified by a ShapeClassId (§17.4) |
| Shared dialect | The common subset of CUDA C++ and Metal Shading Language, with per-backend preludes (§21.6) |
| Shield | A runtime filter that projects a policy action onto barrier rows inside the actuator box, with a KKT check and a passive braking fallback (C-31, §22.12) |
| Similarity group | 𝕊 = (ℝ₊)³, changes of the units of mass, length and time, under which executions map to executions (C-21) |
| Sinew | The subsystem that owns actuators, transmissions and power (§15) |
| Size bucket | A shape class chosen so that robots of similar size share padded capacities (§17.5) |
| Skeleton | The subsystem that owns the design language, modules, archetypes and preflight (§14) |
| Skill | A behaviour stated at the task boundary, independent of the body, stored as .fskill (§22.10) |
| Skill transport | Carrying a skill to another body through its task interface, exactly where the interface permits and by a learned residual otherwise M (§22.10, §25.11) |
| Slot-level dispatch | The daemon's assignment of episodes to free world slots of a persistent environment; the unit of work is a world, not a job (§21.11, §32.11) |
| Snapshot | A full state of selected worlds sufficient for exact restart, including queues and warm starts (§29.8) |
| Solvability witness | Evidence that the candidate's own body can succeed in a failing world: solvable-causal or plant-feasible (§26.5) |
| Spark | The subsystem that owns GPU backends and the kernel toolchain (§21) |
| Specialist | A policy trained or inherited for one design alone; rung R3 (§28.9) |
| Specialization of survivors | Per-design kernel specialization, applied only to finalists and only if the profile justifies it (§21.18) |
| Splitting | Multilevel splitting on a distress score with fixed levels; an exploration method that issues Estimated rates and no bound (C-27, §26.9) |
| Stack lock | The file that pins every sibling's commit and records the one toolchain T, with a receipt of what was built (§33.5) |
| Stage signature | A kernel's declared read and write footprints per buffer and its aliasing rules, held in its manifest (§21.5) |
| Step plan | The static list of kernels, buffers and launches built at environment creation, identified by a StepPlanId (§21.11) |
| Step profile | lockstep, strict or referee; part of the step-plan identity every result carries (§16.3) |
| Straight-line program | Branch-free arithmetic with shared subexpressions; the form of derived kernel bodies (C-14) |
| Stratum | A block of design space, missions or contact modes for which a statistic or a verdict is reported separately |
strict |
The batch-cpu profile that runs the transactional, event-located step (§16.3) |
| Strongest composed rival | Leading simulators, an optimizer, analytic bounds, a verifier and the same agent, assembled by a competent engineer and frozen (§2.1, §39) |
| Structural proxy | The S form of an interior archetype: boxes and fixtures with the hazards' dimensions (§19.7) |
| Study | A registered plan to answer one comparative or absolute question, of type anytime-valid or fixed-n (§24.12) |
| Survivor set | Every design whose lower-rung score is within 2·q̂ of the k-th best lower-rung score (§28.9) |
sync_wait_ms |
The bounded synchronous wait a long tool takes before returning a job handle (§32.10) |
| Synthetic rehearsal | The run of the whole Ground procedure against data from a simulator standing in for reality; never promoted (§30.21) |
| Task | A .ftask file: terms, requirements, randomization, clocks and symmetry declarations (§24.4) |
| Telemetry level | T0 per-episode metrics, T1 events, T2 control-rate traces on sampled worlds, T3 restart snapshots (§29.5) |
| Teleport | Replaying a GPU world on the CPU from its address to find where tiers part (§29.8) |
| Ten-fold test | The comparison of restricted mean times to an independently accepted answer against the strongest composed rival on the sealed suite (§39) |
| Tested | The evidence class of a property held on a stated set of cases (§12.2) |
| Tether | The subsystem that owns the CLI, the daemon, the MCP server, the dashboard and the viewer (§32) |
| Theorem card | A statement the project wants, with its route and tier: T-01 to T-35 (§12.3) |
| Tie rule | If a short robust program over an incumbent engine ties, the plan says so and ships the layer (BET-14, §39) |
| Tier (maturity) | S Solid, F Frontier or M Moonshot, on every mechanism (§0.1) |
| Tier (physics) | referee, batch-cpu, gpu-cuda or gpu-metal (§11.1, §16.3) |
| Tier-correction ledger | The record of audited paired differences between tiers that feeds the doubly robust estimate (§29.11) |
tier-sensitive |
The label of a result that changes when it is re-run one tier up (§16.8, §23.16) |
| Toolchain T; toolchain train | T is the one Rust toolchain of the whole build graph, chosen at INT-TOOLCHAIN-01 and recorded in franken-stack.lock and rust-toolchain.toml. A toolchain train is the one coordinated change that moves T here and in every consumed sibling that needs it, followed by the admission and parity gates (§33.13) |
| Top-weighted τ | A Kendall rank correlation in which discordances near the top of the ranking count more (§16.9) |
| Traction | The subsystem that owns collision, contact, wheels, tracks and terrain (§18) |
| Transactional step | The referee and strict step: one transaction per base interval that commits a complete checked interval or leaves no trace (§16.5) |
| Transport | T_e, the initialization of a child's policy defined by the correspondence an edit declares (C-23) |
| Transversality number | D_t g + D_x g·f⁻, the rate at which a trajectory crosses a guard; near zero is grazing (C-16) |
| Trust ladder | The rule that fast-tier results are provisional until promoted, with detectors for exploitation (§16.8, §23.16) |
| Tube table | A table of mode-indexed cells with one safe action per cell, closed under resets, sensing error and disturbance (C-31) |
unknown |
A verdict: a solver failure, a timeout or an unenclosed branch never yields success or failure (D-13) |
| Unresolved cell | A cell of O ∖ I, reported with its competing explanations and the next test that would split it (C-17, §25.3) |
| Upstream work item | A change this program makes in a sibling repository, under that repository's own rules: a bead here with the label upstream, mirrored in the sibling's tracker, with an interim posture and a switch-over rule (§33.8, Appendix F) |
| Value of information | The expected reduction in decision loss from an experiment, by which experiments are ranked per unit cost (C-39, §28.16) |
| Verb | A cluster.verb entry of the one registry from which the CLI, the MCP tools and the documentation are generated (§32.6, Appendix J) |
| Verdict | The recorded result of applying a declared rule to evidence, with its class, scope and receipts (§28, §29.13) |
| Witness | An object that makes a claim checkable: a controller with its certificate for an inner cell, a path, a dual vector, a pair of worlds, a replayable trace |
| Witness migration | Re-detection of a contact's witness pair, with transfer of its tangential memory, when sustained contact moves across features (§16.5, §18.4) |
| Work package | A WP-* unit of funded scope with entry pilots and exit gates (§44) |
| World | One simulated instance of a scene variant, a robot and its random draws, named by a world address |
| World address | (run_seed, world, episode); it determines every random draw a world sees (§11.1, §35.9) |
| World bank | The set of compiled scene packs resident on a device (§19.15) |
| World set | W, the worlds a mission query quantifies over, declared before any candidate is tested (C-17) |
| World-second | One second of simulated time of one world: 1/h world-steps (§36.2) |
| World-step | One physics step of one world (§16.1, §36.2) |
| Wreath product | K ≀ H, the group that acts when modules with their own symmetries sit in slots a hub permutes (C-22, §13.6) |