Gauntlet: the verification program
11,428 words18 subsections17 tables2 listingsPlan version 1.1
On this page18
The Gauntlet is the subsystem that decides whether a gate may record PASS. Its crate is frob-conformance (layer 7).
It owns the tiers G0 to G5, the oracle fixtures and their pins, the known-answer suite (Appendix M), the
counterexample catalogue and the negative-control registry seeded from it (Appendix N), the registry of metamorphic
relations, the standard battery, the chaos schedules, the pilot register, and the status file registries/gates.toml.
It also hosts the harness of the ten-fold test, whose rules are §39.
"A false certificate is worse than an ordinary wrong answer" (FACT: FrankenSim's agent instructions). The Gauntlet's first duty is therefore to the things that issue certificates and verdicts: the certificate checker, the qualification lane, the solvability oracle, the rank-agreement ledger, the monitors and the statistics. Its second duty is to the plan's own claims: a number in this document is a TARGET or a FACT about something else until a gate records it, and the Gauntlet is the only path by which it becomes a result.
38.1 What it owns, and decisions
| Owned thing | Where it lives | Consumers |
|---|---|---|
| Tier runners G0 to G5 | frob-conformance/tests/, one test target per tier |
CI, milestone exits |
| Oracle fixtures, pins, capture scripts | frob-conformance/fixtures/, tools/oracle/ |
G1, G2 |
| Known-answer suite, one derivation file per row | frob-conformance/registry/known_answers.toml, docs/derivations/ |
G1; Appendix M is its printed form |
| Negative-control registry | frob-conformance/registry/controls.toml |
Every gate; Appendix N is its seed |
| Metamorphic relation registry | frob-conformance/registry/relations.toml |
G3 |
| Standard battery and its frozen identity | frob-conformance/battery/; identity in the ledger |
Fidelity ledger, divergence ledger, detectors (§16, §23, §29) |
| Chaos schedules and minimized regressions | frob-conformance/chaos/ |
G4; §29.15 |
| Pilot register | frob-conformance/registry/pilots.toml |
Work-package funding (§44) |
| Gate status | registries/gates.toml |
README status table; §40 |
| Ten-fold harness | frob-conformance/tenfold/ |
§39 |
- ADR-GAUNT-01. The Gauntlet has no agent verb and no
xtasksubcommand. Its tiers are test targets offrob-conformance, run bycargo test -p frob-conformance --test <tier> -- <gate or row>. A run writes a hash-named receipt; the recording session enters the row ofregistries/gates.tomlthat cites it. Reasons: a harness driven through the surface it judges is a path to self-certification (§38.11), andxtaskholds exactly six checks, runs no physics and records no gate (§34.6). The verbs under test are called by the harness exactly as an agent would call them. - ADR-GAUNT-02. Registries are data and the document is their printout. Appendices M and N, the gate register of
§40 and the README status table are generated from
registries/gates.tomland the registry files offrob-conformance. Reason: a hand-edited table drifts from the tests that are supposed to back it. A KA or CX number is never reused and never renumbered; new rows append. - ADR-GAUNT-03. Every gate is registered with its failing control before its passing test is written. Reason: "A gate no deficient model can fail validates nothing" (FACT: the suite's Wright Flyer plan). The control is the specification of what the gate detects.
- ADR-GAUNT-04. Foreign tools are comparison instruments, never dependencies and never baselines of record. They run out of process, under a pin, on fixtures captured by script. Reason: FrankenSim's adapter rule (FACT), and the finding that a sibling's training code violated three of the rules it would have been an oracle for (§33.11).
- ADR-GAUNT-05. Ceiling first. No speed or efficiency experiment runs until the largest ratio it could show has been computed from a phase breakdown. Reason: the planning pilot of §38.5 measured 1.345 on a test whose ceiling was about 1.46; the experiment could not have confirmed its claim, and nobody had computed that beforehand.
- ADR-GAUNT-06. One fixture identity per physical case. A case stated by a construction (§10) and again by the subsystem that implements it is one fixture with two rows: the first tests the mathematics on the host and the second tests the subsystem on its tiers. Reason: two copies of a fixture's constants are two chances to disagree.
Scope cap: 24 thousand lines (§34). The crate depends on everything and nothing depends on it.
38.2 Six tiers
The tiers are FrankenSim's (FACT), read for robots. A test belongs to exactly one tier and names its execution site:
host (exact or double-precision arithmetic in a test binary), auditor (frob-verify), referee, strict
(batch-cpu under the strict profile), lockstep (the throughput tiers), cuda, metal, or daemon (frobd
under the simulation runtime of §29.15).
| Tier | Kind | Content carried | Content added |
|---|---|---|---|
| G0 | Laws and self-tests | The algebraic laws of §13, functor laws of C-12, cone laws, dimension checks on every kernel | Claim-product laws (§8, §37.10); the level series α·m/(m + 1); polarity laws of C-18; certifier self-tests (§38.12); layer and dependency checks (§34) |
| G1 | Known answers | Analytic and synthetic truths of the chapters | The whole of Appendix M: 835 rows at plan time (FACT, counted from the registry's seed) |
| G2 | Parity | Agreement with pinned oracles (§38.3) and published benchmark problems | Incumbent simulators as comparison instruments; conventional solvers against family answers (§25.22); published anchors for Ground (§30.2) |
| G3 | Metamorphic | Relations that hold without knowing the answer (§38.7) | Relations generated by the new constructions: 42 further relations in §38.7 |
| G4 | Chaos | Cancellation at every boundary, injected faults, capacity overflow, device loss, malformed input | Crash consistency of the job and chunk protocols; deterministic simulation of the daemon and ledger; fuzzing of the thirteen format readers; the confirmation firewall |
| G5 | Determinism | Twice on one machine; across worker counts; debug and release; across platforms; across backends, each against its class | Batch-composition invariance; decision-level equivalence under D3; exact-integer and guarded kernels; refusal of paired statistics under an uncontrolled class; D4 results refused until re-evaluated (§35, §37.11) |
The same six tiers, read for the subsystems this version adds. Each cell names the leading test; the gates are the owning chapter's.
| Subject | G0 laws | G1 known answers | G2 parity | G3 metamorphic | G4 chaos | G5 determinism |
|---|---|---|---|---|---|---|
| Phylum (§17) | Padding is exact; map merge is commutative, associative, idempotent | Orbit counts 86,185, 500,500 and 92; bucket bound 1/(1 − f + f/r + h) | A mixed cohort against P homogeneous runs; the incumbent mixed-batch rate (0.86 of the harmonic mean of its homogeneous rates, FACT to re-read) as context only | A world of a mixed cohort equals the same world alone; slot permutation permutes results | A variant row changed mid-step; a bucket overflow | Digests at capacities 32, 64 and 128 and in any co-tenancy |
| Augur (§25) | Proof rules sound on their side conditions; partition coverage | The stance, pusher, docking, pad, jaw and label fixtures | A lifted robust linear program, a scenario tree and quantifier elimination return the same family answer | Cell refinement only resolves cells; revalidation polarity | A budget stop returns complete cells and the unresolved remainder (§25.3.4) | Identical bundle bytes on a second machine |
| Nemesis (§26) | Bounded weights at most 1/ε; zero-failure arithmetic | Planted traps, the random-walk level probability, the Gaussian tail | Card-uniform randomization at equal budget as the comparison arm | A stored .fmcw replays to its state hash; removing any edit of a 1-minimal world removes the failure |
A fork with no fresh randomness is refused | Replay bit for bit on the tier that found the failure |
| Autopsy (§27) | Shapley values sum to v(N) − v(∅) | Planted causes; the thermal re-run; first divergence at tick 1 | Exact Shapley over 1,024 coalitions against the budgeted summary | The null fork is the original; a placebo flips nothing on a non-chaotic case | A checkpoint with its packet queue stripped is refused | Attribution in double precision; precision-sensitive label |
| Ground (§30) | Conformal index arithmetic; 19/21 coverage | The synthetic rehearsal (planted clock, aliases, omitted law) | Published anchors, as Parity only | Re-running the replication kit reproduces the frozen prediction | Read before freeze, refit without a version, holdout reuse: each refused | The truth simulator is the referee under a pinned seed |
| Foundry (§31) | Dimension typing of every structural quantity | Cantilever, two-bar optimum, fatigue block, rainflow sequence, tolerance split | fs-solid through the airlock against the hand derivations |
Rainflow in windows with carried residues equals the whole-history count | An open shell, an oversize part, a divergent loads–mass loop | STEP round trip replays bit for bit |
| Qualification (§24.13) | Σ α/[i·(i + 1)] = α·m/(m + 1) | 2,000 no-signal campaigns with 500 adaptive retries | — | The decision of request i does not depend on requests after it | 10⁴ fuzzed read attempts return no sealed field | frob-verify replays levels, commitments and cluster derivation |
| Clock contract (§20.4) | Integer schedule equals rational schedule for all time | L = 1,200; periods 3, 12, 40; repeat 120 | — | Re-phasing; checkpoint at any instant; independent same-instant events commute | A checkpoint just after a shutter opens, after a dropped packet, before a controller update | Packet history byte for byte across tiers |
| Transactional step (§16.5) | Sub-intervals sum to the base interval exactly | Ballistic impact time; tied sliders; noise refinement | Contact-free reference robots against the pinned double-precision engine (§38.3) | A retry equals a clean run with the same plan | 10⁵ faults between check and commit: zero uncommitted reads | Forced retry digest equals the clean digest |
38.3 Oracles and pins
| Oracle | Pin | Use | Posture |
|---|---|---|---|
fs-mbd, fs-contact, fs-query |
The FrankenSim commit in franken-stack.lock |
Parity for batched kinematics, dynamics and primitive distances; the referee itself | Consume |
| MuJoCo C, double precision | An exact release, recorded with the fixture | Parity for contact-free dynamics of reference robots; import fixtures | Development-time, out of process |
| A reference rigid-body library with analytical derivatives (optional) | Exact release | Parity for derivative kernels | Development-time, out of process |
| FrankenTorch autograd | The pinned commit | Gradient oracle for on-device learning kernels | Oracle |
FrankenSciPy solve_ivp (DOP853) |
The pinned version | Reference trajectories for smooth known answers | Oracle |
| FrankenSymPy evaluation | The pinned commit | Reference values for derived arithmetic; second checker of rational and interval certificates, never linked into the auditor (PO-LEMMA-04) | Oracle |
FrankenNumPy fnp-linalg |
The pinned commit | Double-precision oracle for small-matrix kernels | Oracle |
| Analytic derivations | docs/derivations/, one file per known answer |
Known answers | — |
| Incumbent batched simulators (the stacks of §1 and §36: a CPU engine, its GPU ports, and the learning stacks built on them) | Exact releases and container digests chosen by the rival audit (§39) and frozen in frob-conformance/registry/comparators.toml |
Comparison instruments for throughput and training-time parity (§36); context for mixed batches (§17); the proxy-adequacy pilot (§19) | Out of process, on trj; never linked, never a truth |
| The development oracle | One incumbent simulator at a pinned release (OPEN-GAUNT-4) | Paper-scale pilots that must run before the CPU referee exists (§22.17, §23.22, §24.17, §26.15, §27.17) | Out of process, outside the product; every result labeled development-oracle and re-run on the referee when it exists |
| The incumbent harness of the ten-fold test | The frozen comparator set of §39 | The rival arms of the sealed suite, measured with the same phase ledger | Out of process; operated under the neutral adjudicator's rules (§39) |
| Conventional solvers (a linear-program solver, a satisfiability solver, quantifier elimination) | Exact releases | Parity for family answers (§25): the generic method is the comparator a mission query must not lose to | Out of process |
fs-solid and fs-topopt, through the airlock |
The FrankenSim commit in franken-stack.lock |
Parity for the Foundry fixtures against their hand derivations (§31.4) | Consume |
Rules:
- A fixture is captured by a script under
tools/oracle/, stored with its pin and date, and never regenerated from the candidate (INV-GAUNT-01). - Moving a pin is a deliberate event with its own record. A comparator pin does not move between the freeze and the end of the study that uses it (§39).
- Foreign tools run out of process and never enter a production dependency graph (FrankenSim's adapter rule, FACT; checked by the dependency firewall of §33.7).
- Agreement with an oracle is Parity. It is never reported as Reality (INV-GAUNT-03). This holds for every row
above, including a published figure for the same robot (
published-anchor, §30.2) and including an incumbent that has itself been compared with hardware: its agreement with reality is its authors' claim under their conditions, and agreement with it transfers none of that. - An oracle is admitted like a dependency: a pin, an admission test, a negative control. A sibling routine is not
an oracle because it exists. FACT to recheck (§33.11): the suite's PPO update fails three of the rules of §23.6 and
planar_drivereturns zero translation on a near-straight case; both are held out of every oracle role until their admission tests pass. - Two oracles that disagree are a finding, filed with both pins. The candidate is not tuned toward either until the disagreement has an explanation in a derivation file.
- A result obtained on the development oracle funds or kills a work package and supports no gate. When the same pilot is re-run on the CPU referee and the verdict differs, the referee's verdict stands and the difference is recorded against KILL-DEVORACLE.
38.4 The form of a method experiment
A method experiment asks whether a mechanism of this plan (a ladder rung, a family policy, an adversarial search, a shield, a kernel specialization) does better than doing without it. Every such experiment is registered in the ledger before it runs and has six parts. An experiment that lacks one is not admitted, and a result from it cannot be cited by a gate (GATE-GAUNT-09).
| Part | What is written down before the first run | Why |
|---|---|---|
| Ceiling | The largest effect the experiment could show, computed from a phase breakdown measured on the baseline arm | A test whose ceiling is below its success threshold cannot confirm anything (ADR-GAUNT-05) |
| Competing arms | The mechanism; the strongest conventional alternative at equal resources; and the mechanism's own fallback. Where an incumbent could host the same method, a composed-incumbent arm (§39) | Every planning pilot's strong baseline tied or won (§38.5); an arm against a weak baseline measures the baseline |
| Potency control | A planted effect of the declared size that the experiment must detect, and an A/A arm that it must not | An experiment that cannot see a planted effect is silent about a real one; an A/A campaign that clears 1.02 has a broken harness (§36.16) |
| Paired lower bound | Arms are paired by world address and seed; the reported quantity is a lower confidence bound on the paired ratio or difference, never a ratio of means. Ten pairs of constant ratio r must return the bound r | Pairing removes world variance; a bound, not a point estimate, is what a kill rule reads |
| Pre-declared fallback | What ships if the falsifier holds, named with its kill gate | The decision is made before the data can argue |
| Reachability pre-analysis | For a fixed-n study: every verdict the rule can return at the planned n and level, and the power at declared alternatives (eval.preanalyze, §24.12). For an anytime-valid study: the budget at which the e-process can cross its threshold under the declared alternative |
At 64 pairs the frozen rule of fixture 1 cannot return one of its four verdicts (FACT, §24.10); a verdict that cannot be reached must not be promised |
Three further rules. The two study types of §24.12 are never mixed inside one experiment. Paired statistics are refused under an uncontrolled determinism class (§35). A confirmatory experiment about a design or a policy runs in the qualification lane (§24.13) at the level of its request; the development batch that suggested it keeps its original analysis and is not counted again.
A worked reading of the table, on the plan's own draft: a decision rule "the point estimate is at least 10 on every brief" confirms a true ratio of 10 in at most 18% of simulated campaigns (FACT, planning pilot; Appendix K). The rule was replaced, before any measurement, by a pooled ratio with a paired lower bound and a power analysis (§39).
38.5 Paper-scale pilots before funding
Every Frontier and Moonshot mechanism has a pilot: a small experiment with existing tools, outside the workspace,
that runs before the mechanism's work package is funded (§44). A pilot record in
frob-conformance/registry/pilots.toml states the mechanism and tier, the protocol frozen before execution, the
falsifier, the computed ceiling of the benefit, the fallback and kill gate, the cost, the tool and its pin, and
then the result. The pilots still to run are tabulated in
the owning chapters (§10 per construction; §19.10, §19.12, §20, §21, §22.17, §23.22, §24.17, §25.27, §26.15, §27.17,
§30.22, §31.19); the Gauntlet owns the register and the rule, not the protocols. A work package whose pilot's
falsifier holds is not funded; its fallback ships (GATE-GAUNT-08).
Pilots already run at plan time. Each row is FACT about a small program on a small model (planning reproduction bundle; Appendix H gives its location and digest, Appendix K the review record). Each is re-run at M0 inside this repository and recorded before any gate cites it.
| Pilot | What it measured | Result | Consequence in this plan |
|---|---|---|---|
| Static stance family | Two exact classifiers of body–load feasibility; a projection against a lifted robust program | 11,520 of 11,520 states agree; 2,254 feasible allocations; 114 of 2,304 bodies cover the mission; 102 of 102 conventional-solver spot checks agree; both programs return half-width 3/14 m in one solve each; a support-polygon-plus-capacity screen wrongly accepts 1,596 bodies | The family query is sound; it has no speed advantage over a standard lifted program |
| Stance falsifier | The same body under equal passive springs | (175, 115, 85, 25) N against a 160 N rating; the active allocation peaks at 155 N | The authority model is part of the claim |
| Material probe | A generated probe, a programmed expert and direct measurement over 900 cases and four laws | 675 of 675 in class and 0 of 225 on the withheld law; expert equals generator; direct measurement 900 of 900 | Probe verdicts are conditional; direct measurement is always admitted |
| Pad family | Minimum certified mass for a 75 N pull | 300 g and 240 g at centred nominal readings only; an admitted reading drops the bound to 73.79 N | Certificates are bound to their reading set |
| Sensor aliasing | Exact Bayes success with repeated binary reads | 27/32, 459/512, 3807/4096; a shared error bit stays at 3/4; a stop-at-gap-two rule reaches 9/10 in 16/5 expected reads | Error dependence and deadlines decide sensor budgets |
| Docking, two gains | Exact three-tick docking with one velocity packet | ε < (U + 1/2)/4; of 561 cells, 344 admitted, 217 excluded, 9 on the boundary; all 561 late-packet cells excluded; 51 linear programs agree | Observation timing decides feasibility; a scenario tree gets the same answer |
| Docking, three gains | The gain 33/32 added to the support | Exact docking unsatisfiable; worst error at least 1/65 m; 34,590 positive labels per grid reverse | Certificates are bound to the declared hypothesis support |
| Pusher | A specialized solver against a composed one on ten fixtures; six corrupted certificates | 20 of 20 intervals match in each arm; six of six bad certificates rejected; median time ratio 1.345 warm and 1.088 cold | The speed gate failed; no new kind of answer on this plant |
| Pusher audit | The timing ceiling; quantifier elimination from the raw plant | A residual of 575.7 µs that the solver does not touch (parsing, assembly, checking, serialization and harness, not separately timed), so a zero-cost solver reaches about 1.46 (842.8 ÷ 575.7); an off-the-shelf engine answered 8 of 12 queries directly | The speed test had no power: the origin of ADR-GAUNT-05 |
| Labels and deadlines | Payload-width frontier against number and timing of labels | 3/32, 7/32, 11/32 mm for one, two, three early labels; 3/32 mm late; one label unsatisfiable, two satisfiable | Deadlines change feasibility; ordinary elimination answers the query |
| Decision reuse | A semantic receipt against a hermetic dependency graph over four edit states | Both: 3 pair evaluations and 2 reductions; every verdict matches fresh replay; omitting one dependency inherits a stale promotion | No reuse advantage over a correctly keyed graph |
| Shared bus | Two fingers on one unit-current bus | Zero one-tick schedules; two two-tick schedules; an additive peak rule falsely prunes | A negative control for contract compilers |
| Fixed-n rule | Enumeration of the frozen rule | At n = 64: 2,145 count pairs, 521 prefer, 521 inferior, 0 ties, 1,103 inconclusive; a tie first reachable at n = 86 | Reachability pre-analysis is mandatory (§24.12) |
| Draft ten-fold rule | Simulated campaigns under a true ratio of 10 | The draft rule confirms in at most 18% of campaigns | The rule of §39 was rewritten |
| Boundary screen | A one-inequality classifier on 65,536 rows on the M5 Ultra and on each RTX 4090 | Bare single precision: 452 false admissions and 23,438 false exclusions, identically on every device; guarded with exact fallback: zero final errors and identical bytes; exact integer kernels: zero errors | Strict predicates need exact or guarded kernels (§35) |
| Static against dynamic sill | Sampled statics against a planar dynamic scorer, 156 cases | 94 agree (7 pass both, 87 fail both); 62 static rejections succeed dynamically; an audit found scorer defects | A static rejection is a candidate for a dynamic test |
| Wheel-loop feedforward | The winding term of a sampled wheel controller | One-tick spectral radius 1.4820 with R·i_ref and 0.9207 with R·i; 24 of 156 task labels change | The hold is modelled exactly (A-22) |
| Rotor inertia and cadence | An exploratory planar sweep on the sill fixture | Success fractions 0.093 and 0.780 at 100 Hz with zero rotor inertia; 1.000 and 1.000 at 1 kHz or with added inertia | A comparison pins rotor inertia and controller rate |
| Half-precision conditioning | Contact states of three robots after unit-diagonal scaling | κ·u ≥ 1 in 37 to 64% of states; refinement fails outright in 9 to 18% | Tensor-core half precision is rejected (§21.20) |
| Humanoid conditioning | 201 poses with simplified contact rows | κ₂(H) of 3·10⁴ to 1·10⁵ raw and 2·10³ to 9·10³ scaled at default impedance; 2·10⁶ to 3·10⁶ raw and 2·10⁵ to 5·10⁵ scaled near-rigid | Guarded single precision with scaling (§35.10) |
What these pilots did not do is part of the record.
- None used FrankenSim dynamics, FrankenSim contact or a real sensor pipeline. The analytic pilots used small CPU programs and conventional solvers; the native runs executed one scalar decision kernel; the planar sill pilots used their own law and scorer. No hypothesis of this plan was tested by running FrankenRobotics code, because none exists.
- Every pilot's strong baseline tied or won. A lifted linear program tied the projection; a programmed expert tied the probe generator and direct measurement beat both on the withheld law; exact Bayes tied the sensor calculation; a scenario tree tied the docking family; a dependency graph tied the receipt; quantifier elimination produced the pusher answers. What survives is an interface and a discipline, not a speed claim.
- No physical claim follows. The material laws are artificial, the loads stipulated, the plants scalar.
38.6 Known answers
Appendix M is the suite: 835 rows numbered KA-001 onward, grouped by chapter, each with its truth, tolerance, tier and negative control (FACT, counted at plan time; the registry is the authority and the appendix its printout). It replaces the list of version 0.2 (group and cone laws; mobility of Sarrus, Bennett and four-bar linkages; growth vectors; Elroy's beanie; pendulum, top and ballistic invariants; the contact battery; motor and thermal constants; sensor readings; the mass-spiral fixed point; leg inverse-kinematics solution counts; ledger closure for a damped pendulum), every item of which is carried as rows.
Rules for a row:
- A derivation on file.
docs/derivations/<fixture>.mdstates the model, the derivation, the numeric value with its digits, and the error budget of the test (truncation order, round-off bound, tier envelope). - A tolerance with a reason.
exactfor integers, rationals, Booleans, verdicts and digests. For real values, the tolerance of the owning gate, scaled as §35 requires. A row printed with toleranceto setis not eligible to pass until its derivation file states one (OPEN-GAUNT-2; 133 rows at plan time). - A negative control. The mutation or planted failure that must make the row fail. A row printed with
none statedcannot support a gate until a control is registered (OPEN-GAUNT-3; 325 rows at plan time). A boundary behaviour ("a 4 mm film is refused") is not a control; the registry needs a mutation. - A tier and a site. A row runs first on the weakest site that can decide it, then on every tier its gate names. A truth that holds on the referee and inside the fidelity envelope on the fast tiers is two results, not one.
- Values are not improved in transit. The suite carries each chapter's printed value. Where a recomputation disagrees, the row keeps the printed value, is listed in Appendix M (M.38), and its gate cites the derivation file once OPEN-GAUNT-6 is closed.
38.7 Metamorphic relations
Generated from Part II (D-4) and from the constructions. Each relation is a test over random scenarios on every tier it names, registered with the mutation that must break it. The first table is carried.
| Relation | Source |
|---|---|
| Applying a symmetry element to the initial state and the actions gives the symmetry element applied to the result | C-09 |
| Changing the world frame by a horizontal translation and a yaw changes nothing an invariant observation reports | C-09 |
| Re-expressing every quantity in another body frame leaves powers and energies unchanged | C-02 |
| Scaling the unit system leaves dimensionless outputs unchanged | C-14 |
| Halving the time step moves results by the integrator's order | C-05 |
| Permuting world indices permutes the results and changes nothing else | §16 |
| Adding inactive worlds or unused capacity changes no active world's digest | §16 |
| Refining the scene field moves contact results by no more than the interpolation bound | §19 |
| Splitting a rollout at a snapshot and resuming equals running it whole | §29.8 |
An edit followed by its inverse returns the same DesignId |
§14.7 |
A design built with mirror equals its hand-expanded form |
C-12 |
Relations added by the constructions of this version.
| # | Relation | Source | Mutation that must break it |
|---|---|---|---|
| MR-01 | Batch-composition invariance. A world's digests are identical alone, in any batch, slot, co-tenancy, bucket capacity (32, 64, 128) and shard count of one device family | INV-KIN-04, INV-NUM-03, GATE-KIN-05 | A reduction tree shaped by capacity; a batch-wide normalizer |
| MR-02 | P parameter variants in one batch equal P homogeneous runs bit for bit; a world of a mixed cohort equals the same world in a homogeneous batch | GATE-KIN-06, INV-PHYLUM-02 | A parameter row read after its first use in the step |
| MR-03 | A draw depends on (address, step, stream) only; adding a stream changes no other stream | INV-NUM-04, §35.9 | Sequential draws from one generator |
| MR-04 | Orbit representatives. Evaluating any member of an orbit under the observation-preserving subgroup and transporting the result equals evaluating the representative; g·d in world w behaves as d in g⁻¹·w | C-22, §17.11 | Deduplication under the mechanical group when a sensor breaks it |
| MR-05 | Designs with equal mission-observable projections replay bit-identically; two placements with equal first moment and different second moment do not merge | C-22, §28.15 | A digest that omits the second moment |
| MR-06 | Similarity rescaling. Every dimensional input scaled by its dimension with power-of-two factors (lengths × 4, times × 2, masses × 2, gravity unchanged) reproduces every significand bit and branch | C-21 | A scale factor of 10 |
| MR-07 | The Cholesky factor of D·H·D equals D times the factor of H bit for bit, for power-of-two D | PO-NUM-02, PO-TRAC-03 | A scaling by 10 instead of a power of two |
| MR-08 | Fork and replay. The empty intervention replays bit for bit; a setpoint change at tick t reuses the prefix to the snapshot before t; a child with its own address has fresh streams | C-27, C-29, §29.8 | A checkpoint with its packet queue stripped; a fork that shares streams |
| MR-09 | A retry of a transactional step equals a clean run with the same plan; the noise path is unchanged under split, rejoin, reject, checkpoint restart and device migration | INV-KIN-02, INV-KIN-03 | Redraw on rejection (P(positive) = ¾) |
| MR-10 | Revalidation after an edit and its inverse. An edit followed by its inverse restores every verdict with zero evaluations; an edit to a field the mission does not read keeps every result | C-18, §28.13, GATE-PHYLUM-05 | A memo key without delivery time |
| MR-11 | Polarity: an inclusion survives the world set shrinking, the policy class growing and assumptions weakening; an exclusion survives the three opposite moves | C-18, PO-LEMMA-03 | Hash match taken as verdict transfer |
| MR-12 | Incremental recomputation equals full recomputation on random edit sequences | INV-SKEL-02, INT-FSIM-16 | An input missing from a key |
| MR-13 | Qualification under adaptive retries. On no-signal worlds the campaign-wide false-promotion rate stays at most α for any number of retries and any adaptive strategy; the decision of request i is unchanged by later requests | §24.13, GATE-QUAL-01 | Reused clusters at a constant level |
| MR-14 | An anytime-valid study's level holds at every stopping time; a fixed-n study's verdict is computed once | C-15, §24.12 | Peeking: 13/256 after 8 looks |
| MR-15 | Clock re-phasing. Nominal event k is at phase + k·period whatever the physics step; the integer schedule equals the rational schedule for all time; schedules are identical on every tier | PO-SENS-01, INV-SENS-04 | Every-thirteenth-step scheduling of a 30 Hz policy (30.77 Hz) |
| MR-16 | Checkpoint and restore at any instant, including just after a shutter opens, after a dropped packet and just before a controller update, reproduces every later delivered observation byte for byte | INV-SENS-03, §11.7 | Packet queues left out of the checkpoint |
| MR-17 | Swapping independent events that share an instant leaves digests unchanged | §20.4.7, C-19 | An ordering by arrival |
| MR-18 | Causality: two worlds that differ only in something not yet delivered give equal command digests; an out-of-order arrival never changes a past decision | §20.15, §11.8 | A policy that reads truth behind an undelivered sensor |
| MR-19 | Unit normalization of requirements. A change of units leaves normalized robustness and the binding atom unchanged | C-30, §24.5 | Composition of raw margins |
| MR-20 | Streaming past-time robustness equals offline evaluation; G over [0, T] at 0 equals H over [0, T] at T | C-30, GATE-CORTEX-10 | A monitor that pads a short window |
| MR-21 | A rate reward totals the same at any control rate; physical discounting values a constant reward rate the same to first order at any control interval | §23.3 | A per-step penalty (500 against 1,000) |
| MR-22 | The energy budget is unchanged by retraining and by any contact friction coefficient μ ≥ 0, any restitution and any contact law | C-31, GATE-SHIELD-01 | A budget with an omitted source |
| MR-23 | Re-description of a robot (relabeling, frame change, axis-sign convention, power-of-two scaling) leaves a family policy's actions unchanged after mapping back | C-23 | File-order tokens |
| MR-24 | Policy transport: a zero-parameter edit gives a child whose first action equals the parent's; commuting edits give the same initialization in either order | C-23 | Transport by index instead of by matched token |
| MR-25 | Equivariance under the observation-preserving subgroup with noise stream identifiers permuted by g; an element outside that subgroup is not a symmetry | §20.13, C-09 | Tying under the mechanical group |
| MR-26 | A film law at zero thickness equals the dry card bit for bit and is continuous in thickness; doubling pad radius multiplies squeeze time by 16 | INV-TRAC-07, §19.10 | A masked, non-conservative film transport |
| MR-27 | The load-weighted slip metric is unchanged when a quadrature point is duplicated with halved weights | §24.8 | Unweighted point speeds |
| MR-28 | The mirrored robot on the mirrored course returns the mirrored result; forces reflect as polar vectors and moments as axial ones | §24.11, C-09 | Angular velocity treated as polar |
| MR-29 | Clearance: inner complex ⊆ free space ⊆ outer complex; a finer grid only narrows the band; both complexes shrink as the margin grows | C-33, §19.11 | A scalar clearance radius |
| MR-30 | The pooled scene field equals the dense field bit for bit; a scene regenerated from its seed has the same SceneId on both machines |
GATE-HAB-13, INV-HAB-10 | A generator that reads an unseeded source of randomness |
| MR-31 | A mirror image, a clutter variant, a retrofit variant and another scan of the same building belong to the split group of the base scene | §19.14 | A split keyed by SceneId alone |
| MR-32 | Integer histograms and address-keyed trace sampling are invariant under permutation, shard split and slot assignment | §29.6, §29.7 | An order-dependent sketch; arrival-order sampling |
| MR-33 | The tier-corrected estimate has the same mean for every fast-tier prediction; with every address audited it is the plain mean | C-25, §29.11 | Audit bits chosen after the outcomes |
| MR-34 | Rainflow counted in windows with carried residues equals the whole-history count | C-35, §31.8 | finish called per window |
| MR-35 | Canonical bytes: key order and whitespace do not change an identity; view → canonical → view and canonical → value → canonical are exact; re-serializing a bundle gives identical bytes | §34.9, PO-LEMMA-01 | Key-order canonicalization disabled |
| MR-36 | A repeated idempotency key returns the original receipt; a page sequence pinned to a frontier shows each row once under concurrent appends | §32.7, §32.8 | Two-statement lookup and insert; offset pagination |
| MR-37 | A job run through the worker process returns the digests of the same job run in process, also after the worker is killed and the job resubmitted | INT-FSIM-18 | A worker built at a different commit |
| MR-38 | A class-E rewrite changes no bit; a specialized kernel is bit-identical to its generic kernel | §21.7, INV-SPARK-09 | A reassociation filed as class E |
| MR-39 | A ranking survives the model-form variants (CL-1 against CL-2, cone against pyramid, stiffness × ½ and × 2, h against h/2) with top-k overlap at least k − 1, or is typed model-conditional |
§16.9 | A finalist that wins by diagonal traction on a pyramidal cone |
| MR-40 | The claim product is order-independent and never raises a class | §8, INV-LEMMA-02 | A function that returns a stronger class than its inputs |
| MR-41 | Holonomy: a shape loop doubled doubles the displacement, reversed negates it, and sped up leaves it unchanged, to leading order | C-08 | The curvature computed with +[𝔸ᵢ, 𝔸ⱼ] |
| MR-42 | A cell shift of an anchored position is exact in either direction (cell side 8 m, offset in [−4, 4) m) | §11.1 | An offset range of [0, 8) |
38.8 The standard battery and the hard-world set
The standard battery. For each robot class, about 200 scenarios (TARGET): stand, push recovery, each atlas gait
at three speeds, turning, stairs up and down, a slope, a low-friction patch, a payload, and a drop, crossed with
randomized parameters under fixed seeds. Wheeled, tracked and wheel-legged classes replace the gait rows with
straight travel, turning in place, a sill, a ramp and a split-grip strip. It is defined and frozen at M2 (BD-104).
The fidelity ledger, the divergence ledger, the tier-correction ledger and the exploitation detectors all read it,
so a change to the battery is a recorded event with a new battery identity, and a silently shortened battery
changes identity (GATE-ARENA-07). The batteries smoke, fixtures, full, hard and covering are Arena's
(§24.9); standard is the one this chapter owns, and it is the fallback of the covering selection (§26.11).
The hard-world set. For each task family and robot class, Nemesis keeps a versioned list of minimal
counterexample worlds (frob.hardset/1, §26.8). The Gauntlet reads it under three constraints, each enforced by a
refusal that exists already: it is discovery data and never a confirmation sample (FROB-REF-567); it is never the
nominal draw of a rare-event bound (FROB-REF-560); and it is never the only content of a battery, since a battery
made of past failures overfits them. A world enters only with a solvable-causal or plant-feasible witness and
after promotion on the referee. Regression use is legitimate: a design that once failed a hard world is re-run on it
after a repair, and the result is labeled as a regression result, not as evidence of robustness.
The fixtures. fixture:cart-sill-dock and fixture:quad-split-grip (§24.10, §24.11) are the two full fixtures
with an analytic layer, a frozen development batch and a pre-analysis. Their analytic layers run on every change
that touches contact, actuators, clocks or the requirement language.
The design corpus. About 200 designs with planted defects of known kind, planted winners for the screening audit and planted single causes for attribution (§24.9). Labels are fixed before any analysis is tuned. The corpus is the potency control of §38.4 for every analysis and screen.
38.9 Chaos
Every case below must end in its typed refusal or in a state the invariants accept, with no leaked resource.
| Family | Injection | Oracle | Owner of the mechanism |
|---|---|---|---|
| Cancellation | At every kernel-batch boundary under a deterministic schedule; at every await point of the publish and submit paths | The receipt reports the last committed tick per world; a dropped handle is not a cancellation receipt | §21, §32.10 |
| Device faults | Device loss mid-step; a kernel cache entry with one flipped byte; an arena lease revoked; a strict-backend mismatch before scoring; out-of-memory at admission | A chunk replayed from the committed slab gives the unfaulted digests; the flipped entry is refused | §21 |
| Transaction faults | 10⁵ faults between the checks and the commit of a transactional step (TARGET) | Zero uncommitted reads: every read names a commit_epoch |
§16.5 |
| Job protocol | A crash after the idempotency commit and before the receipt; duplicate and reordered delivery; a client that disconnects with a job running and reconnects by submission key; two requests with one key interleaved | One job, one charge, the original receipt | §32.7, §32.10 |
| Chunk protocol | A torn ledger write; a crash after commit; lease expiry and takeover by a second writer; overlapping tick ranges after a shard split; a reset that reuses tick zero; a full disk; a clock jump | One row and one receipt per extent; different bytes for a committed extent are FROB-REF-810; the frontier is contiguous | §29.4, §32.10 |
| Daemon and ledger | Deterministic simulation with virtual time, seeded scheduling, lineage-driven fault selection and schedule minimization (FACT: asupersync's lab runtime); a fake device whose outcomes are a pure function of the world address | INV-CHRON-01 to -04 and -12, INV-ATEL-02 and -06, one job one charge; dual runs against batch-cpu keep the fake honest |
§29.15 |
| Capacity | Contact rows, islands, packet queues and buckets forced past capacity | The typed refusal or the capacity-biased label, never a silent truncation |
§16, §17 |
| Malformed input | Fuzzing of the thirteen format readers, the envelope parser and every importer (10⁷ executions each, TARGET); path traversal; hostile strings in imported text | No panic; each limit reached by a crafted file and refused; no hostile string outside an untrusted-marked field | §34.9, §37 |
| Confirmation firewall | 10⁴ fuzzed read attempts against a sealed campaign; a planted leak path | No sealed field returned; the leak found by the audit | §24.13, §37.5 |
| Worker fallback | The FrankenSim worker killed mid-job and resubmitted | Bit-equal chunk digests | §33.14 |
TARGET: 10⁵ seeded schedules per release, every await point on the publish and submit paths hit by a crash fault at least once, and every failing schedule minimized to a regression that replays in under a second (§29.15).
38.10 The Reality lane
Reality is the one claim the first release mostly cannot make. Version 0.2 kept a lane here so that the first admitted dataset had somewhere to land. That lane is now Ground (§30), which owns the admission of data, the cell that scopes a result, clock fitting, identifiability, frozen predictions on sealed trials, conformal bands per calibrated cell, drift retirement and the replication kit. The Gauntlet keeps four duties toward it.
- The line. Every report prints
reality: <status> […], and with no dataset the status isno-claim(GATE-GROUND-01).no-claimis a legitimate terminal state. FrankenTextiles recorded the same limit about its own domain: "More numerical permutations cannot supply those observations" (FACT). - The label. A comparison with a published figure for the same robot is scheduled by the Gauntlet at M3 and is
recorded as Parity with status
published-anchor, never as Reality (rule 4 of §38.3). A comparison with data from a simulator standing in for reality issyntheticand is never promoted (INV-GROUND-06). - The rehearsal. Ground's machinery is tested without real data on the synthetic rehearsal of §30.21, whose rows are in Appendix M. Passing it shows a bounded loop is sound and nothing more.
- The share of guesses. A report that supports a benchmark claim prints the share of card fields whose
provenance is
genericorassumed(§30.2). Agreement between tiers cannot reveal a wrong card, because every tier consumes the same card.
No exported artifact carries sim_to_real_certified = true; the flag has no setter (§12.2, §37.9).
38.11 Guarding against false progress
The sibling projects documented how agent swarms produce the appearance of progress. These rules are the response.
- Typed close reasons. A bead closes with a reason that cites its own test and that test's output. A shared close reason across many beads is itself a failure signal.
- Negative controls. Every gate has at least one planted failure it must catch, registered in
frob-conformance. "A gate no deficient model can fail validates nothing" (FACT: Wright Flyer plan). - Live-dependency proofs. For a gate that claims a result depends on an input (a scene, a card, a policy), the test perturbs the input and requires the output to change.
- Synthetic is labeled. Output computed from a fixture or a stand-in prints
syntheticin its evidence. - Behaviour, not plumbing. A learning gate needs a learned behaviour and failing controls: zero-weight, random and shuffled-label policies must fail the same threshold (§23.21).
- No self-certification. A gate's PASS is recorded by a fresh-context session that did not implement the capability.
The negative-control registry. frob-conformance/registry/controls.toml holds one record per control:
[[control]]
id = "NC-0412" # stable, never reused
seed = "CX-262" # the catalogue entry it came from, if any
gate = ["GATE-ARENA-04"] # every gate that must catch it
kind = "mutation" # mutation | planted-input | planted-design | planted-world | a-a
target = "frob-actuate::stage::integrate"
defect = "explicit Euler, current before wheel speed, at 0.5 ms"
expect = "wheel-loop row reports spectral radius 1.497 where 0.9207 is true; the row fails"
last_seen = { caught = true, session = "…", date = "…" }
The registry is seeded from Appendix N: each of its 384 entries (FACT, counted at plan time) becomes at least one
control, attached to the gates of the rule it protects, and each Negative control cell of Appendix M becomes one.
Five rules govern it.
- A gate with no control in the registry cannot record PASS (INV-GAUNT-02, GATE-GAUNT-01).
- A control is run every time its gate is run. A gate run in which a control was not caught is a FAIL of the gate, whatever the passing test says.
- A control is a defect, not a boundary. "The request is refused at the limit" tests the limit; the control is the build or input in which the limit was removed.
- A control that has never failed its gate in any recorded run is itself suspect and is reviewed at each milestone exit: either the defect cannot be planted as described or the gate is not looking.
- A false certificate, a false promotion or a withdrawn result found in use becomes a permanent control with the counterexample that exposed it (§25.5.5).
38.12 Certifying the certifiers
These are G0 tests of the Gauntlet itself and of everything that issues a verdict. Carried: the certificate verifier must reject mutated certificates; the dimension checker must reject seeded violations; the e-process must hold its error rate under the null with optional stopping; the physical-consistency test must reject a matrix one eigenvalue below zero. Added:
| Certifier | Test | Threshold (TARGET) | Owner's gate |
|---|---|---|---|
The certificate checker (frob-cert, frob-verify) |
A mutation corpus per proof kind: changed coefficient, reordered quantifiers, missing side condition, wrong frame or unit, fabricated kind with consistent hashes, a flag set to true, a boundary opened or closed; valid specimens re-serialized | Every mutant rejected and every specimen accepted, with identical bytes on re-serialization; standalone and in-daemon verdicts identical on the whole corpus; dependency count zero | GATE-LEMMA-03 to -06, GATE-WS-03 |
| The checker before an answer | frob-verbs runs the checker before a mission answer returns (§12, §25.5); a producer that emits a false bundle on a planted lowering defect |
The answer is withheld and the cell is downgraded to Tested or left unresolved |
§25.5 |
| The qualification lane | 2,000 no-signal campaigns with 500 adaptive retries by a scripted adversary that sees every receipt and all discovery data | False promotion in at most 123 campaigns; a planted true gain promoted within 10 requests in at least 80%; reused clusters at a constant level give a false promotion in more than 99% | GATE-QUAL-01 to -03 |
| The solvability oracle | Planted illegal edits, impossible traps and solvable traps | 100 of 100 refused; 0 of 100 impossible traps counted; at least 95 of 100 solvable traps receive a witness; a point-robot oracle is caught on the narrow doorway | GATE-NEMESIS-01 |
| The rank-agreement ledger | Planted populations with known top-weighted rank correlation on each side of each threshold in force (0.7 and 0.5, §28.10); a planted winner the cheap rung represents poorly | The measured top-band τ covers the planted value in its bootstrap interval; the mode assigned is the one the thresholds prescribe; a lost planted winner stops the rung from discarding in that stratum; an unmeasured stratum is discard-only |
GATE-ATEL-07; KILL-RANK |
| Screening audits | A deliberately biased screen and an unbiased one | The planted winner's removal is reported; the unbiased screen passes; 30 clean audited discards bound the rate at 9.5% | §26.10, §28.12 |
| Requirement monitors | Three evaluators on 10⁶ random traces per operator | Agreement bit for bit | GATE-ARENA-03 |
| The fixed-n pre-analysis | The tables of §24.10 regenerated | Exact equality; the unreachable verdict refused | GATE-ARENA-05 |
| Rare-event bounds | The Gaussian tail 3.167 × 10⁻⁵ and the random-walk probability 1.504 × 10⁻⁴ | Truth inside the confidence sequence in at least the stated share of repetitions; every weight at most 1/ε | GATE-NEMESIS gates of §26.15 |
| Attribution | 200 planted single causes; joint and alternative pairs; a chaotic placebo | The planted factor first with but-for in at least 90%; chaotic: unattributable on the doubling map |
GATE-AUTOPSY-03 |
| Conformal bands | Exchangeable residuals at n = 20, target 0.90 | Mean coverage within 0.01 of 19/21; a pooled shifted regime is flagged | GATE-GROUND gates of §30.22 |
| The claim product | Random sets of input evidence | The envelope's class equals the meet; no public function raises a class | GATE-SAFE-08 |
| The determinism classifier | A planted nondeterministic reduction; a D4 result offered unlabeled | Classified below its claimed class; refused on every path | GATE-SAFE-09; §35 |
| The energy audit | The stiff penalty bounce; a sign error at one port | energy-created raised; the error localized to its port |
GATE-CHRON-03 |
| The Gauntlet's own harness | Ten pairs of constant ratio r; an A/A campaign | The paired lower bound equals r; A/A does not clear 1.02 | GATE-GAUNT-09 |
38.13 Status accounting
registries/gates.toml holds one record per gate, kill gate and admission gate (421 identifiers at the end of Phase
1, FACT; the register of §40 is its printout, and where a chapter and the register differ the register governs, §40).
[[gate]]
id = "GATE-ARENA-05"
claim = "known-answer" # proof | known-answer | parity | fidelity | design-comparison | reality | performance
claim_id = "clm:…" # §34.12
section = "24.17"
threshold = "eval.preanalyze reproduces the tables of §24.10 exactly and refuses the unreachable verdict"
milestone = "M1"
tier = ["G1:host"]
controls = ["NC-0398", "NC-0399"]
status = "not-run" # not-run | pass | fail | killed | no-claim | superseded
measured = "" # the value with its unit and interval, or the count
evidence = [] # ledger sequence numbers and trace identifiers
recorded = { date = "", session = "", implemented_by = "" }
Rules. claim takes one of the seven kinds of §8 and nothing else; a gate whose chapter row reads "Performance of
the method" is recorded as design-comparison, since it compares methods and does not measure the engine. pass is
refused when controls is empty, when any control was not caught in the same run, when recorded.session equals
recorded.implemented_by, or when the evidence does not resolve in the artifact graph (§29.13). killed names the
kill gate that fired and the fallback now in force. no-claim is a terminal status for Reality gates. The README's
honest-status table, the release rubric of §47 and the dashboard's view of gates (§32.14) are generated from this
file and from nothing else (INV-GAUNT-06; check-generated, §34.6). A milestone exit is a query over it.
38.14 Invariants and proof obligations
| Identifier | Statement | How it is checked |
|---|---|---|
| INV-GAUNT-01 | No fixture is regenerated from the candidate. | Fixtures are written only by tools/oracle/ scripts whose inputs exclude the workspace's build products; CI fails on a fixture changed without a pin record |
| INV-GAUNT-02 | Every gate that records PASS has at least one registered control that was caught in the same run. | Schema check on gates.toml; the runner refuses to write pass otherwise |
| INV-GAUNT-03 | Agreement with an oracle is recorded with claim kind parity. |
The record type of a G2 result has no constructor for another kind |
| INV-GAUNT-04 | Evidence computed from a fixture, a stand-in or the development oracle is labeled synthetic or development-oracle. |
Label propagated through the claim product; a planted unlabeled record is refused |
| INV-GAUNT-05 | A PASS is recorded by a session that did not implement the capability. | Session identities in the record; a planted self-certification is refused |
| INV-GAUNT-06 | Status tables are generated from registries/gates.toml and never edited. |
check-generated of §34.6 |
| INV-GAUNT-07 | KA, CX and control numbers are append-only. | A registry diff that reuses or renumbers an identifier fails CI |
| PO-GAUNT-01 | The paired lower bound of the harness is exact on constructed inputs. | Ten pairs of constant ratio r return r; an A/A campaign does not clear 1.02 |
| PO-GAUNT-02 | Every relation of §38.7 is broken by its registered mutation. | The mutation is applied in a test build and the relation's test must fail |
| PO-GAUNT-03 | The registry seed is complete: every CX entry and every stated negative control of Appendix M maps to a control with at least one gate. | A join over the three registries with no unmatched row |
38.15 Gates and kill gate
| Gate | Claim | Threshold (TARGET) | Earliest |
|---|---|---|---|
| GATE-GAUNT-01 | Known answer | Every gate recorded as PASS has a registered negative control that it catches; a run over all controls shows each caught by every gate it names | Every milestone exit |
| GATE-GAUNT-02 | Known answer | Every row of Appendix M that is due at the milestone passes on its tier inside its tolerance, with a derivation file; no row with tolerance to set or control none stated is counted; the count of such rows is printed and is zero by M3 for rows due by M3 |
Every milestone exit |
| GATE-GAUNT-03 | Known answer | Each relation of §38.7 holds on 10⁴ random scenarios per tier it names per release, and each registered mutation breaks its relation (PO-GAUNT-02) | M2, then every exit |
| GATE-GAUNT-04 | Known answer | Certifiers: every row of §38.12 meets its threshold; the certificate mutation corpus holds at least 1,000 mutants per proof kind with zero accepted | M1 for the checker; M3 for the lanes |
| GATE-GAUNT-05 | Known answer | Oracle hygiene: every fixture has a pin, a date and a capture script; a planted fixture regenerated from the candidate fails CI; no foreign tool appears in any production dependency graph; a planted G2 result offered as Reality is refused | M0, then every exit |
| GATE-GAUNT-06 | Known answer | Chaos: every row of §38.9 ends in its typed refusal or an accepted state with no leaked resource; 10⁵ seeded schedules per release; every await point on the publish and submit paths hit | M2 for kernels; M3 for the daemon |
| GATE-GAUNT-07 | Known answer | Determinism: every kernel and every verb meets its declared class twice on one machine, across worker counts, in debug and release, across platforms and across backends; MR-01 holds on 10⁴ worlds per device family | M2 |
| GATE-GAUNT-08 | Known answer | Pilots: no Frontier or Moonshot work package is funded without a pilot record that has a falsifier, a computed ceiling, a fallback and a result; the plan-time pilots of §38.5 re-run at M0 and reproduce every count exactly and every timing ratio inside its recorded band | M0, then at each funding decision |
| GATE-GAUNT-09 | Known answer | Experiment form: every registered method experiment has the six parts of §38.4; the harness passes PO-GAUNT-01; a planted experiment with an unreachable verdict is refused | M1 |
| GATE-GAUNT-10 | Known answer | Status accounting: the README table equals a fresh generation from gates.toml; a planted self-certification and a planted PASS with an uncaught control are each refused |
M0, then every exit |
| ✖ KILL-DEVORACLE | — | Trigger: of the first five pilots re-run on the CPU referee, two or more change verdict relative to their development-oracle run. Fallback: development-oracle results lose standing as funding evidence; pilots for work packages not yet funded wait for the CPU referee, and packages funded on a reversed pilot are re-decided | M1 |
38.16 Open questions
| Identifier | Question | Owner | Blocks | Fail-closed default |
|---|---|---|---|---|
| OPEN-GAUNT-1 | Which real-robot dataset, if any, is admitted to the Reality lane first | Ground (§30) | Any Reality gate | reality: no-claim everywhere |
| OPEN-GAUNT-2 | Tolerances for the 133 rows of Appendix M printed to set |
Each owning chapter | GATE-GAUNT-02 | The row is not counted as passing |
| OPEN-GAUNT-3 | Negative controls for the 325 rows of Appendix M printed none stated, and mutations for the rows whose stated control is a boundary behaviour |
Each owning chapter | GATE-GAUNT-01 | The row supports no gate |
| OPEN-GAUNT-4 | Which incumbent release is the development oracle, and which releases and container digests form the comparator set | The rival audit (§39) | GATE-GAUNT-05; every pilot that needs dynamics before M1 | No development oracle: those pilots wait for the CPU referee |
| OPEN-GAUNT-5 | The Gauntlet's runtime budget per change, per night and per release on each machine | Performance program (§36) | The schedule of G1 to G5 | smoke and fixtures per change; everything else nightly |
| OPEN-GAUNT-6 | Reconciliation of the values listed in Appendix M (M.38) | The lead; the owning chapters | Any gate that cites one of them | The row keeps the printed value and is flagged; the gate cites the derivation file |
| OPEN-GAUNT-7 | The scenario lists of the standard battery for wheeled, tracked, wheel-legged and manipulating classes | Arena (§24) with Kinesis (§16) | GATE-FID-01 for those classes | The class has no fidelity claim until its battery is frozen |
| OPEN-GAUNT-8 | Whether 10⁴ scenarios per relation per tier per release is affordable for the relations that need the referee | Performance program (§36) | GATE-GAUNT-03 | Referee relations run at 10³ and print the reduced count |
38.17 Known answers adopted from corrected fixtures
What it is. S Five rows for the known-answer suite, each with a negative control. Every value is derived on
file from the stated inputs; none is a measurement. The rows are owned by frob-conformance and run under the verbs
of their subsystems (design.check, gait.atlas, task.fixture).
| Row | Inputs | Value | Negative control | Owner section |
|---|---|---|---|---|
| Thermal runaway, second card | Constant I = 25.4 A; R₀ = 0.54 Ω referenced to T₀ = 20 °C; α = 0.00393 K⁻¹; C = 140 J/K; G = 1/2.2 W/K; ambient and initial winding temperature 25 °C; limit 120 °C | Loss 348.4 W at 20 °C and 485.3 W at 120 °C. s = I²·R₀·α = 1.369 W/K exceeds G, so there is no equilibrium; growth rate (s − G)/C = 0.006533 s⁻¹; the limit is reached at 33.49 s. Regearing from 12 to 16 at equal output torque cuts copper loss by 1 − (12/16)² = 43.75% and does not remove the runaway: s falls to 0.770 W/K, still above G, and the rate is 0.002254 s⁻¹. A ratio of 22 gives s = 0.407 W/K, below G, and a rate of −0.000337 s⁻¹, yet the equilibrium rise is P_amb/(G − s) = 2,240 K: the winding is at 58.7 °C after 45 s and at the limit after 128.6 s, so the sign of the rate decides nothing without the duty time | Reading R₀ as referenced to 25 °C gives 34.08 s; the constant-resistance model gives 39.92 s; both fall outside a 0.1 s tolerance | §15.7 |
| Plate sinkage, power law with n = 0.5 | k_c = 0.41 kN/m^1.5; k_φ = 21.6 kN/m^2.5; two tracks of length 0.55 m; g = 9.81 m/s² | 45 kg on 8 cm tracks sinks 3.52 cm; 75 kg on 8 cm sinks 9.79 cm, more than an 8 cm belly clearance; 75 kg on 12 cm sinks 4.96 cm | The same constants with n = 0.7 give 9.17, 19.01 and 11.71 cm, so a mistranscribed exponent is caught | §18.10 |
| Contact strata under the observation subgroup | Four feet, each open, stick or slip | Under the four-element leg-permutation group: 27 strata and 162 one-foot transitions. Under the two-element subgroup that a forward-facing sensor leaves: (3⁴ + 3²)/2 = 45 strata and 648/2 = 324 transitions | Using the mechanical group where the observation subgroup is required collapses 45 strata to 27 | C-16, §13.4 |
| Reality of roots at saturation | A Stewart–Gough platform instance with 40 real assembly modes; a 6R instance with 16 real inverse-kinematics solutions (FACT, literature: Dietmaier 1998; Manseur and Doty 1989; Appendix H; to be re-read) | The continuation lane certifies 40 of 40 and 16 of 16 roots as real by the conjugate-ball test. A generic instance of each family has the same complex count, and its real count is whatever the test certifies | A checker that calls a root real when its imaginary part is below a tolerance, instead of by ball disjointness, is caught on a planted near-real conjugate pair | §25.21.4 |
| A single wheel at a sharp lip | Axle load W = 25 N; lip height 12 mm; pure drive couple; a = √(2rh − h²), b = r − h; lift-off needs M = W·a and μ ≥ a/b | r = 60 mm: M = 0.900 N·m and μ ≥ 0.7500. r = 75 mm: M = 1.017 N·m and μ ≥ 0.6459. With μ = 0.70 and a 1.2 N·m cap only the 75 mm wheel is admitted; with μ = 0.80 and a 0.95 N·m cap only the 60 mm wheel is | A check of torque alone admits both wheels in the first condition | §24.10 |
The last row is the pure-couple case of a general rule for the corner. With a forward axle push P and a drive couple M, lift-off requires b·P + M = W·a, the corner reaction requires a·P + b·W ≥ 0, and friction requires |M| ≤ μ·(a·P + b·W).
| GATE-FID-09 | Known answer. Every row is reproduced at its tolerance (times to 0.1 s; sinkage to 10⁻⁵ m in double precision; counts exact; admissions exact) and every negative control fails. Rows 1, 3 and 5 at M1; row 2 at M4; row 4 with the continuation lane. |
38.18 Known answers adopted from late fixtures
What it is. S Nine rows for the known-answer suite, each with a negative control. The mechanism that each row
tests is already in its owner section; the rows are the smallest cases that distinguish it from the shortcut. Every
value is derived on file from the stated inputs. The rows are owned by frob-conformance and run under the verbs of
their subsystems.
| Row | Inputs | Value | Negative control | Owner section |
|---|---|---|---|---|
| Moment merge in single precision | Two equal-size shards of constants: 4,095 and 4,097; −1 and +1; 8,191 and 8,193 | Population variance 1 in each case by the centred merge of §23.9 | The raw second moment minus the squared mean returns 0 for the first and third pairs, because 4,096² + 1 and 8,192² + 1 are not representable, and 1 for the second | §23.9 |
| Unresolved outcomes in a comparison | Baseline 60 successes in 100 valid trials; candidate 2 successes in 2 valid trials and 98 unresolved | Complete-case rate 100%; success rate in [2%, 100%]; no preference | A ranking on complete cases prefers the candidate | §24.10, §28 |
| Independence of a writable view | A 2×2 view with element strides (1, 1) | Index [0, 1] and index [1, 0] address one element; stores of 7 and 11 leave 7 or 11 by order; the view is refused for writing | A check of address bounds alone admits it | §33.11 row 3, §21.9 |
| Reality of a certified root | f(z) = z³ + z at z = 0.001 + 1.001·i | α(f, z) = 0.0021 certifies a root near z, which is +i. α(f, Re z) = 0.0010 certifies a root near Re z, which is 0, a different root. ‖z − Re z‖ = 1.001 exceeds 1/(20·γ(f, z)) = 0.033, so the robust test of C-34 does not call the root real | A test that infers reality from α(f, Re z) alone calls +i real | §25.21.4 |
| The Cayley map on SE(3) | ω = (0, 0, 2), v = (1, 0, 0) | Rotation: a quarter turn about z. Translation: (I − ω̂/2)⁻¹·v = (1/2, 1/2, 0) | The map that pairs cay(ω̂) with v unchanged returns (1, 0, 0) and fails the differential test of C-36 | C-05, §13 |
| Tube erosion with a one-sided error | One dimension; a cell [0, 1] of measured states; true state = measured + e with e in [0, 0.1] | Admissible true successors are [0.1, 1.0], the erosion by −E | Erosion by E gives [0, 0.9]: it admits 0.05, whose measurement can be −0.05, and rejects 0.95, whose measurements lie in [0.85, 0.95] | §22.12.5 |
| Residual bound in single precision | H = 3, b = 1 | x̂ = 0.33333334; the computed residual is exactly 0; the true error is 9.93 × 10⁻⁹; with the margin ρ = 2.4 × 10⁻⁷ the bound is 7.9 × 10⁻⁸ | The bound without ρ claims zero error | §18.19 |
| Film front at a dry cell | Two cells with h = (1 mm, 0) | Face mobility ½·(h_L³ + h_R³) = 0.5 mm³, so volume crosses the face and the planar front follows t^(1/5) | A harmonic or geometric mean of the cubes gives zero flux, and the spill never reaches the dry cell | §19.10.3 |
| One edge of the extrinsic graph | Predicted pose of sensor 2 in sensor 1: a translation of (1, 0, 0) m. Sensor 1's mount is off by a rotation of 0.01 rad about z; sensor 2's is exact | r₁₂ = −Ad(T̂₂₁)·δ₁ has angular part (0, 0, −0.01) rad and linear part (0, −0.01, 0) m: sensor 2 appears at (1, −0.01, 0) m | Using Ad(T̂₁₂) on the tail gives a linear part of (0, +0.01, 0) m | §20.14 |
FACT (a recorded pilot, Appendix K; to be re-run before a gate cites it): in the first row a native single-precision kernel on the Metal device and on each RTX 4090 returned 0 by the raw form and 1 by the centred merge for the pair at 4,095 and 4,097, 1 by both for the pair at ±1, and 0 by the raw form at 8,192. Each device merged locally; nothing about communication between devices or training throughput follows.
| GATE-GAUNT-11 | Known answer. Every row is reproduced at its tolerance (single-precision rows bit-exact on every backend; rational rows exact; the root row to four significant figures in exact rational evaluation of α and γ) and every negative control fails. Each row lands at the milestone of its owner section. |