The gate register
26,701 words9 subsections40 tablesPlan version 1.1
On this page9
This chapter is the single list of every gate in the plan. The subsystem chapters define their gates where the mechanisms are described; the register collects them, gives each one claim and one earliest milestone, lists every kill gate with its trigger and fallback, and says what each milestone exit must have on record. It contains 32 admission gates and five sibling admission gates, 278 convergence gates with the Gauntlet's own gate and the thirteen gates of the ten-fold test beside them, 112 kill gates with the seven kill gates of the ten-fold test beside them, and the program gates. The gates of subsections added after these tables were compiled are indexed in §40.8. All thresholds are TARGETs until a gate records a measured value.
40.1 Semantics
- A gate passes only with a recorded measurement against its threshold. The record is a row of
registries/gates.tomlthat cites a commit of this repository, the command, its output and a receipt hash, and that resolves in the artifact graph of §29. A gate with no record has the statusnot run, which is not a pass. Statuses arenot run,pass,fail,killed: fallback adoptedandblocked: ⟨open question⟩. - A kill gate (✖) names its trigger and its fallback in advance and is never quietly re-scoped. Its decision is recorded as an ADR at the milestone named here. A trigger, a threshold or a fallback changes only by a dated amendment to this register, with its reason, made before the measurement it governs. A kill gate that fires is not a failure of the program: the fallback is the plan.
- Each gate names exactly one of the seven claims of §8: Proof, Known answer, Parity, Fidelity, Design comparison, Reality or Performance. A row that a chapter labelled "method" or "Performance of the method" is a Design comparison, as §8.1 rules. A row that named two claims is given the claim of its governing part, and the note under §40.3 says which part that is.
- Where a chapter and the register differ, the register governs: on a gate's identity, its claim, its earliest milestone, a kill gate's trigger, fallback and decision point, and on every number the register states. The threshold column is a brief. The full pass criterion, with its fixtures and negative controls, is the row in the defining subsection, and a clause that the brief leaves out is not waived.
- Every convergence gate has a registered negative control that it catches (GATE-GAUNT-01, §38). A gate whose control has not been shown to fail has not passed.
- Earliest milestone. The first milestone at whose exit the gate must have a record. Where two milestones are given, a part is due at each, as stated. A milestone exits when every gate with a part due there has a record that is a pass or a kill decision with its fallback adopted. A failed convergence gate that has no kill gate blocks the exit.
- Admission is never inherited (§33). A foundation first used at a later milestone is admitted then, by its own record, at the pin of that day.
- Recurring gates. GATE-GROUND-01, GATE-SAFE-01, GATE-GAUNT-01 and GATE-TENFOLD-09 are re-run at every exit after their first.
- Owner. The chapter of the defining subsection owns the gate and its fixtures. Six kill gates are stated in two chapters; the register lists each once under its owner and names the other chapter as a consumer (§40.7).
40.2 Admission gates
A foundation is not used above the airlock until its gate has a record in DEPENDENCY_ADMISSION.md (§33.6).
| Gate | Foundation | Pass criterion, in brief | First needed | Defined in |
|---|---|---|---|---|
| INT-TOOLCHAIN-01 | The one Rust toolchain T of the build graph | T is chosen and recorded in franken-stack.lock and rust-toolchain.toml, in the order of preference of §33.13: (a) the suite's common nightly, (b) FrankenSim's present pin. The whole build graph (the core, the GPU annexes, derive/frob-derive and surface/frob-mcp) builds and tests on T; the matrix of §33.12 is recorded: which of the four nightlies in play compile fs-qty, the bedrock-direct list, the M1 closure and each of the other build sets. After this gate T moves only by a toolchain train |
M0 | §33.6 |
| INT-FSIM-01 | frankensim: bedrock crates by path | A crate depending by path on fs-ga, fs-mbd, fs-contact, fs-time and fs-query passes cargo check --all-targets and reproduces the digest of a G1 forward-dynamics state at the pinned commit; the cold check fits one hour, 16 GiB and 8 cores; check times, peak memory, package count and sibling drift recorded |
M0 | §33.6 |
| INT-FSIM-02 | frankensim fs-ga: group façades, twist and wrench conventions |
Power ⟨wrench, twist⟩ is frame-invariant to 10⁻¹² relative; the analytic Jacobian agrees with central differences to 10⁻⁷ relative at 1,000 seeded configurations; a deliberately reversed adjoint fails at least three fixtures | M0 | §33.10 |
| INT-FSIM-03 | frankensim fs-mbd: tree kinematics, articulated-body solve, rigid-point motion |
A two-joint arm's accelerations equal those from independently differentiated energy to 10⁻¹⁰; an offset inertial sensor's acceleration equals the rigid-point formula; scalar genericity, adjoint support and contact inputs recorded | M0 | §33.10 |
| INT-FSIM-04 | frankensim fs-mbd contact steps and fs-contact broad phase |
A thin step lying between two clear endpoint poses is detected on 1,000 of 1,000 seeded sweeps; a set of 22 contacts returns a typed refusal | M0 | §33.10 |
| INT-FSIM-05 | frankensim fs-mbd::planar_drive and the robot catalog builders |
Exact straight travel, the near-zero-curvature case of §33.11 row 2, wrapped against unwrapped headings, and incremental against one-shot integration to 10⁻¹². Until it passes, planar_drive is not an oracle |
M0 | §33.10 |
| INT-FSIM-06 | frankensim fs-g1-train (nothing linked: an update rule to compare against) |
The three probes of §33.11 row 1: the four combinations of advantage sign and clip side against finite differences to 10⁻³; the critic gradient against the current forward output; a packed sequence against separate replays, ratio 1 to 10⁻⁶. Until it passes upstream, neither file is a baseline | M0 | §33.10 |
| INT-FSIM-07 | frankensim sustained contact step | The flat-to-edge-to-top transition returns the typed refusal through the airlock at the pin, and completes under witness migration with the energy ledger closed to its stated residual (§33.11 row 4) | M0 (the refusal); M1 (under witness migration) | §33.10 |
| INT-FSIM-08 | frankensim fs-scene, fs-query: support and keep-out boxes, convex queries |
A box-on-plane support query equals the closed form. A mesh-backed interior is not admitted by this test | M0 | §33.10 |
| INT-FSIM-09 | frankensim fs-phs, fs-tribo, fs-matdb: ports, friction laws, material data |
Power across an interconnection sums to zero to 10⁻¹² relative; every pair parameter returns with its provenance record; a missing material pair is a refusal | M0 | §33.10 |
| INT-FSIM-10 | frankensim fs-symmetry, fs-ad: cyclic cases, implicit sensitivities, gradient checks |
The implicit sensitivity of a 2×2 fixed point equals its closed form. Recorded scope: cyclic groups only, no contact-event derivatives | M0 | §33.10 |
| INT-FSIM-11 | frankensim fs-tilelang and the instrument-lab kernels (pattern only) |
No dependency is added. One dialect source compiles through both preludes and matches its CPU twin (the test of GATE-SPARK-00) | M0 | §33.10 |
| INT-FSIM-13 | frankensim group spectral |
The Floquet multipliers of the monodromy of ẍ + x = 0 over one period are both 1 to 10⁻¹²; a monodromy with a multiplier of modulus 1.01 is reported unstable | M3 | §33.9 |
| INT-FSIM-14 | frankensim group stats |
The ranking-flip probability Φ(−Δ/√(s₁² + s₂²)) to 10⁻¹²; a multilevel estimate of E[x²] under a standard normal is 1 within its stated interval; importance weights that miss the failure region trip the effective-sample-size floor and the estimate is refused | M3 | §33.9 |
| INT-FSIM-15 | frankensim group structure |
A tolerance allocation on a two-term stack reproduces the hand-computed variance split; a mesh written through fs-io reads back with the same hash; a STEP file above the stated bound is quarantined with a receipt, not parsed |
M5 | §33.9 |
| INT-FSIM-16 | frankensim group ledger (fs-recompute) |
Incremental recomputation equals full recomputation on 10⁴ random edit sequences; an input missing from a key is caught by the shadow recompute within 64 hits | M1 | §33.9 |
| INT-FSIM-17 | frankensim group multiphysics |
Poiseuille flow between plates matches the parabola to the crate's stated tolerance; film mass conserved to 10⁻¹² relative over 10⁴ steps; the bridge refuses when the feature is off and refuses a throughput-tier request | M6 | §33.9 |
| INT-FSIM-18 | frankensim worker-process fallback | A 2,000-step G1 referee rollout submitted through the worker returns chunk digests equal, bit for bit, to the same job run in process; a worker killed mid-job and resubmitted returns the same result (§33.14) | M0 | §33.6 |
| INT-ASUP-01 | asupersync | cargo tree -d shows one asupersync package in each workspace, the same published version in all of them, and no binary links two. This is the gate that proves FD-ASUP-01 |
M0 | §33.6 |
| INT-ASUP-02 | asupersync lab runtime | The job protocol runs under the lab runtime: 100 of 100 repeats of one seed give identical traces; a planted lost-chunk bug is found within 10,000 explored schedules and replays from its minimized fixture | M2 | §33.6 |
| INT-FSQL-01 | frankensqlite | The ledger opens, writes, and recovers after a forced kill mid-write | M0 | §33.6 |
| INT-FSQL-02 | frankensqlite pager policy (pattern and oracle) | The memo store's eviction sequence equals the sibling policy's on 10 recorded traces of at least 10⁵ accesses | M1 | §33.6 |
| INT-FT-01 | frankentorch ft-kernel-metal |
The gateway builds in the Metal annex, with FrankenTorch's block patch repeated at the annex root, and runs a kernel on this Mac |
M0 | §33.6 |
| INT-FT-02 | frankentorch ft-kernel-metal gateway |
A buffer stays resident across two command buffers; the gateway returns a completion receipt from the device; a device tag alone earns zero operator coverage | M0 | §33.10 |
| INT-CUDA-01 | cudarc |
The pinned cudarc builds without a CUDA toolkit, loads the driver on trj, and runs a kernel on both GPUs |
M0 | §33.6 |
| INT-FSYM-01 | frankensympy | derive/ builds on T against the fsym-* crates by path, derives K-cay-step, and its certificate replays in the offline auditor |
M0 | §33.6 |
| INT-FSYM-02 | frankensympy sparse Jacobians and formal checker | The planar two-link Jacobian compiles and agrees with closed forms at a regular and a singular configuration | M0 | §33.10 |
| INT-FLN-01 | franken_lean | fln builds on a Linux host, re-checks and seals one trivial theorem from lean/, and the capsule checks from an empty environment |
M5 | §33.6 |
| INT-FLN-02 | franken_lean checker | The checker admits a true port identity and rejects its sign-mutated twin; axioms and coverage are listed | M5 | §33.10 |
| INT-FMCP-01 | fastmcp_rust | frob-mcp builds in the core graph on T with exactly one asupersync package (cargo tree -d shows no duplicate), lists the tools generated from the verb registry, and passes the MCP protocol smoke test over stdio and HTTP |
M0 (admission); M1 (M1 verbs); M3 (full surface) | §33.6 |
| INT-FNP-01 | franken_numpy | An array file written through fnp-io reads back identically |
M0 | §33.6 |
| INT-FNP-02 | franken_numpy and frankentorch host tensor layouts | The stride conversion at the interchange boundary reads element 3, not element 12, on the 2×2 case (§33.11 row 3) | M0 | §33.10 |
Five sibling admission gates are defined in §33.15 for foundations that are off every critical path. Each is the pilot of its item as well as its gate, and none blocks a milestone.
| Gate | Foundation | Pass criterion, in brief | First needed | Defined in |
|---|---|---|---|---|
| INT-FTUI-01 | frankentui F | One asupersync package or none in its graph; the job pane rendered from a recorded event stream equals its stored snapshot in the headless harness; idle processor use at most 2% of one core | M3 | §33.15 |
| INT-F3D-01 | franken_threed (pattern; subprocess) F | Ten reference frames of the replay page built through the route match the plain bundle within 1/255 per channel on at least 99.9% of pixels; an unadmitted feature fails explicitly | M3 | §33.15 |
| INT-FDGR-01 | drone geometry reconstruction (pattern; subprocess) F | The schema fixtures validate; a geometry generation whose scale status is not metric is refused; coverage masks become the scene's unknown-space label; privacy inheritance applies | M3 (schema fixtures); M5 (scan import) | §33.15 |
| INT-FJAX-01 | frankenjax (pattern) F | With rewrite rules that preserve floating-point results under the kernel's determinism class, the extracted kernel matches the baseline bit for bit and the operation count falls by at least 10% on at least three kernels | M2 at the earliest, only if the profile asks | §33.15 |
| INT-FTX-01 | franken_textiles (oracle) M | A square cloth draped over a sphere matches ftx-drape's settled shape to its own stated tolerance |
M6 | §33.15 |
INT-FSIM-12 is reserved and unused. INT-FMCP-01 is run with frob-mcp inside the core graph on T. The two P0
upstream work items FD-FMCP-01 and FD-ASUP-01 (§33.8) are what make it passable, and KILL-MCP (§40.4) applies if it
cannot pass within the M0 budget after both have been attempted.
40.3 Convergence gates by subsystem
One table per subsystem, one row per gate. "Earliest" follows rule 6 of §40.1. "Defined in" is the subsection that holds the full criterion.
Lemma (§12).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-LEMMA-00 | Proof | T-01, T-03 and T-04 certified by FrankenSymPy for the M0 kernels; certificates replay offline. | M0 | §12.6 |
| GATE-LEMMA-01 | Proof | At least 80% of derived kernels carry a replayable instance certificate for each identity their manifest declares (BET-11). | M5 | §12.6 |
| GATE-LEMMA-02 | Proof | At least three Lean theorem cards compiled by stock Lean, re-checked by fln, and sealed; the capsule verifies from an empty environment. |
M5 | §12.6 |
| GATE-LEMMA-03 | Known answer | Every proof kind in use has one specimen that frob-verify accepts and at least three mutations it rejects; the four stance mutations, an unknown kind with consistent hashes and a changed quantifier are all rejected; the binary has no dependency outside the standard library and runs in an empty environment. |
M1 | §12.6 |
| GATE-LEMMA-04 | Proof | The first mission slice of §25 ships its inner cells and its exclusions as bundles; a re-check on a second machine accepts every one; the seeded-defect suite yields zero accepted false certificates. One accepted false certificate fails the gate. | M1, repeated at M4 | §12.6 |
| GATE-LEMMA-05 | Proof | The Farkas and rational LDLᵀ reflectors have soundness theorems compiled by stock Lean and re-checked by fln, and each proves its specimen by kernel evaluation within 60 s. |
M5 | §12.6 |
| GATE-LEMMA-06 | Known answer | Compile-fail tests show no conversion from a claim product to a factor and no constructor of Proved evidence outside frob-lemma; every artifact exported by the conformance suite carries the three flags, all false. |
M0 | §12.6 |
Marrow (§13).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-MARROW-01 | Known answer | All laws pass on 10⁶ cases each: at most 64 ulp in f64; at most 16 ulp in f32 for single operations. T-01, T-03, T-04 certified (GATE-LEMMA-00). |
M0 | §13.10 |
| GATE-MARROW-02 | Known answer | Character tables and isotypic projectors correct for Cₙ and Dₙ with n ≤ 12, their products with C₂, and S₄, against tables on file. | M1 | §13.10 |
| GATE-MARROW-03 | Known answer | Γ_mech and Γ_obs equal the groups on file for all eighteen archetypes of §14.10 and for 24 planted asymmetries (a moved sensor, a one-sided payload, a changed sole material, a reversed gear), with the correct breaker named in every case; zero disagreements. | M3 | §13.10 |
| GATE-MARROW-04 | Known answer | PO-MARROW-05 holds exactly for every group of GATE-MARROW-02 on 100 random pairs of channel spaces each; all eight mutations of §13.8 are caught by at least three fixtures each. | M4 | §13.10 |
| GATE-MARROW-05 | Known answer | Zero sign errors of Guarded predicates against exact rational evaluation over 10⁹ adversarial inputs within 4 ulp of the zero set, on batch-cpu, CUDA and Metal; the fallback rate on the standard contact battery recorded (target below 10⁻³ of evaluations). |
M2 | §13.10 |
Skeleton (§14).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-SKEL-01 | Parity | Each reference robot imports with forward-kinematics parity against the oracle within 10⁻⁹ m and 10⁻⁹ rad over 10⁴ configurations, and its loss report lists every dropped field found by a field-coverage diff. | M1 | §14.15 |
| GATE-SKEL-02 | Known answer | Functor laws and INV-SKEL-02 hold on 10⁴ random designs and edits. | M1 | §14.15 |
| GATE-SKEL-03 | Known answer | Each of the eighteen archetypes compiles, passes stages 1 to 6 of design check with no refusal, has the symmetry groups on file, and stands or rolls under its baseline controller at the milestone GATE-REFLEX-01 gives for it. |
M1 (archetypes landed); M3 (all eighteen) | §14.15 |
| GATE-SKEL-04 | Known answer | Stages 1 to 6: of 100 seeded defects (at least two per refusal code) all refused, at least 95 by the stage and code that own them; zero refusals on the eighteen archetypes and on 10³ random valid designs. Stages 7 and 8: of 40 planted cases at least 36 decided correctly within budget and none wrongly. | M1 (stages 1 to 6); M3 (stages 7 and 8) | §14.15 |
| GATE-SKEL-05 | Known answer | INV-SKEL-04 and PO-SKEL-01 hold on 10⁴ random designs; a JavaScript client's round trip of every wide integer and hash matches the native decoder. | M1 | §14.15 |
| GATE-SKEL-06 | Known answer | Substitution controls: the mirror swap reuses every sibling product bit-identically; the shared-bus edit invalidates every electrical and thermal product; a reversed port sign refuses; INV-SKEL-06 holds on 10⁴ random edits. | M1 | §14.15 |
| GATE-SKEL-07 | Known answer | PO-SKEL-02 holds exactly; the mass of each archetype lies within 15% of the mass on file for its reference robot where one exists. | M1; M3 (all eighteen) | §14.15 |
| GATE-SKEL-08 | Known answer | Patches: a stale parent refuses in 100 of 100 trials; a repeated idempotency key returns the same DesignId; a schema migration leaves forward kinematics and mass properties bit-identical and old runs replayable. |
M1 | §14.15 |
Sinew (§15).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-SINEW-01 | Known answer | Known answers within 1%: stall torque, no-load speed, electrical and mechanical time constants of a DC motor step, thermal steady-state rise ΔT = P·R_th. | M1 | §15.14 |
| GATE-SINEW-02 | Known answer | Port energy balance closes to 10⁻⁹ relative on the referee and 10⁻⁴ relative per episode on single-precision tiers. | M1 (referee); M2 (single precision) | §15.14 |
| GATE-SINEW-03 | Fidelity | Batched L1 and L2 kernels agree with the referee components within 10⁻⁴ relative on a 10⁴-case battery. | M2 | §15.14 |
| GATE-SINEW-04 | Known answer | The six cases of §15.6: breakaway within one step of τ_s/r; amplitude loss per cycle within 2% of 4·τ_c/k; drift at most ε·t; zero output motion inside the gap; loop width within 1% of β; closure speed and energy loss within 1%. Referee exact; batched tiers within their stated regularization. | M1 (referee); M2 (batched tiers) | §15.14 |
| GATE-SINEW-05 | Known answer | Thermal: equilibrium, time constant, critical current and time to limit within 0.5% of the closed forms of §15.7; the two-node condition; tangency under torque holding within 1%; the worked card's 20 A point admitted by the constant-resistance check and refused by the corrected one. | M1 | §15.14 |
| GATE-SINEW-06 | Known answer | The five closed forms of §15.8 within 0.5%; over 10⁴ random operating points the inscribed-circle envelope never exceeds the hexagon envelope. | M1 | §15.14 |
| GATE-SINEW-07 | Known answer | Battery and bus: the step response's drop and both time constants within 1%; the ceiling E²/(4·R) and the voltage at a given power within 0.1%; a demand above the ceiling produces a brownout event in 100 of 100 trials and never a completed step; exhaustion refuses. | M1 | §15.14 |
| GATE-SINEW-08 | Known answer | Passivity and second law: over 10⁶ random operating points in all four quadrants every loss and every entropy production is nonnegative; the single-multiplier gear fixture refuses; every card in the catalog passes actuator.check. |
M1 | §15.14 |
| GATE-SINEW-09 | Known answer | PO-SINEW-02 holds; with twelve backlash joints the dense factorization has the size it has with none. | M2 | §15.14 |
Kinesis and the fidelity ledger (§16).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-KIN-01 | Known answer | Pendulum period within 10⁻⁶ relative at h = 1 ms; symmetric-top precession within 10⁻⁴; free-flight momentum conserved to 10⁻¹² relative over 10⁶ steps on the variational lane; ballistic invariants of C-04. | M1 | §16.17 |
| GATE-KIN-02 | Parity | Contact-free forward dynamics of each reference robot against the pinned oracle: joint accelerations within 10⁻⁹ relative in f64. |
M1 | §16.17 |
| GATE-KIN-03 | Parity | batch-cpu in f64 against fs-mbd: kinematics, inverse dynamics, forward dynamics and mass matrix within 10⁻¹⁰ relative on 10⁴ states per reference robot. |
M2 | §16.17 |
| GATE-KIN-04 | Known answer | The transactional rows of §16.16 on referee and strict: impact time within 10⁻⁹ s; tied sliders exact to 10⁻¹² N·s; zero uncommitted reads in 10⁵ injected faults; forced-retry digests equal; refinement statistics inside 3σ at 10⁶ draws; the redraw mutation caught. |
M1 (referee); M2 (strict) |
§16.17 |
| GATE-KIN-05 | Known answer | INV-KIN-04: 1,000 episodes with identical digests solo and in 100 random co-tenancies, capacities and slot assignments, per back end; the path-table Jacobian gives the same digests as the dense one. | M2 | §16.17 |
| GATE-KIN-06 | Parity | A batch of 256 parameter variants of each reference robot equals 256 homogeneous runs bit for bit on batch-cpu and on each GPU back end. |
M2 | §16.17 |
| GATE-KIN-07 | Known answer | Under the capacities of §16.6, Degraded world-steps ≤ 10⁻⁴ of world-steps per class on the standard battery; every forced overflow flagged; capacities printed in every disclosure block. |
M2 | §16.17 |
| GATE-FID-01 | Fidelity | M2 battery, batch-cpu against referee: median and 95th-percentile disagreement at most 2% and 5% for base displacement over 2 s, 3% and 8% for energy per metre, 5% and 12% for stance impulse. Re-baselined once at M2 with a written rationale, then frozen. |
M2 | §16.17 |
| GATE-FID-02 | Fidelity | The promotion rule is exercised end to end: a planted tier-sensitive policy is caught (NS-09). | M3 | §16.17 |
| GATE-FID-03 | Fidelity | The referee's coverage reported per robot class at M2 exit, with the breakdown by refusal cause, the strict share and promotion wall-clock at the 50th and 95th percentiles; an adjudicator named wherever coverage is below 90%; coverage below 90% in a reference class falsifies BET-34 for that class, and its fallback applies. |
M2 | §16.17 |
| GATE-FID-04 | Fidelity | Rank agreement between batch-cpu and the referee on the 40-design set per reference class, with the permitted use per stratum written to the ledger; per-episode ρ on 256 paired episodes per design reported. |
M3 | §16.17 |
| GATE-FID-05 | Known answer | Model-form check: the planted pyramid-cone and penetration-recovery winners are returned as model-conditional; a genuine winner is model-robust; cost at most 10% of the campaign's compute. |
M3 | §16.17 |
| GATE-FID-06 | Known answer | Energy audit: both planted exploits flagged within one episode; an honest policy under CL-1 unflagged; created energy on the standard battery below the frozen bound. | M2 | §16.17 |
| GATE-FID-07 | Fidelity | Background referee: coverage at least 0.1% of GPU world-seconds, reported; GPU throughput loss at most 5%; a planted single-kernel defect localized to its stage from one-step defects; a planted tier-sensitive policy detected within twice the time §16.11 predicts. | M2 | §16.17 |
| GATE-FID-08 | Known answer | Tier correction: type-I error at most α over 10⁴ null comparisons with optional stopping; equals the paired mean at pᵢ = 1; a planted between-tier reversal is not established; ρ and the replaced higher-tier count printed. | M3 | §16.17 |
Phylum (§17).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-PHYLUM-01 | Known answer | Orbit and ballast rows of §17.18 exact; zero false quotients in 10⁴ sampled class pairs by replay; the lidar and equal-Σx controls caught. | M3 | §17.19 |
| GATE-PHYLUM-02 | Known answer | Each of 512 designs in a mixed cohort has the same digests as in a homogeneous batch, on batch-cpu and per GPU back end, at three bucket sizes and under slot dispatch with 100 random co-tenancies. |
M2 | §17.19 |
| GATE-PHYLUM-03 | Performance | The head-to-head of §17.14 run and published with all four arms. For the cohort to remain the engine: at least 0.70 of the harmonic mean of the homogeneous rates (§36.3 row 10) at padding waste of at most 25% on cohorts of at least 256 designs; a lower bound above 1 against arm B on edit to first accepted result at K ≤ 128; at most eight buckets. | M2 | §17.19 |
| GATE-PHYLUM-04 | Performance | Edit-to-first-step latency on the warm and cool paths inside the targets of §17.8 over 1,000 edits from the mutation corpus, cold reported separately, with the same quantity measured on the pinned incumbents. | M2 | §17.19 |
| GATE-PHYLUM-05 | Known answer | Invalidation contract: the positive control reuses, each negative control invalidates or refuses, and 10⁴ random edit sequences give results equal to full recomputation. | M3 | §17.19 |
| GATE-PHYLUM-06 | Design comparison | Paired gradient: the ballistic row within 1%; binary metrics refused; on the pilot task a variance ratio of at least 2 at the admitted horizon and sign agreement of at least 70% over 20 replicates. | M4 | §17.19 |
| GATE-PHYLUM-07 | Known answer | Generator: reproducible across platforms; exact probabilities on enumerable sub-grammars; rejection rates reported; no orbit straddles a DesignSplit. |
M3 | §17.19 |
| GATE-PHYLUM-08 | Design comparison | Maps per dispatch: on the benchmark of §39, campaigns reach the acceptance target in at most half the serial rounds of one-design-per-turn search at equal compute, with compute reported beside rounds. | M4 | §17.19 |
Traction (§18).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-TRAC-01 | Known answer | Every row of §18.16 that tests a Solid mechanism passes on strict and on batch-cpu, and on referee for the rows FrankenSim's solve can express (the list is recorded with the gate); rows for the fast law pass on GPU tiers within the stated creep. |
M1 and M2 | §18.17 |
| GATE-TRAC-02 | Parity | Primitive pair distances and normals agree with fs-query within 10⁻⁹ m (f64) on 10⁶ random pairs. |
M1 | §18.17 |
| GATE-TRAC-03 | Fidelity | Tunneling audit: on the M2 battery the fast tiers miss fewer than 1 contact per 10⁶ world-steps that the certified detector finds. | M2 | §18.17 |
| GATE-TRAC-04 | Known answer | Cone and joint rows: spin stop, ring co-stop, stiction breakaway and backlash values within 1%; coupled and diagonal forces within 0.5% of μ·N/√2 and μ·N; the pyramid and independent-row mutations fail. | M2 | §18.17 |
| GATE-TRAC-05 | Known answer | Film law: Stefan times within 2%; Couette force within 10⁻⁶ relative in f64; the dry limit bit-identical; the limits at h ≤ σ and h ≥ 3σ and continuity between them on 10⁴ random states. |
M3 | §18.17 |
| GATE-TRAC-06 | Known answer | Zero missed hits in 10⁶ randomized thin-barrier crossings under transactional profiles, and the endpoint-only mutation caught; on the sill, work and impulse within 1% of their refined values at h/4 and no couple above 10⁻⁹ N·m in f64; the capacity-bias comparison labeled. |
M1 (referee); M2 (strict) |
§18.17 |
| GATE-TRAC-07 | Known answer | Enclosures: on 10⁴ generated pairs with known truth, no false clear and no false penetrates; the 6 mm case answers unknown; every certificate re-checked offline (§12). |
M3 | §18.17 |
| GATE-TRAC-08 | Known answer | Soil, track and tyre: law evaluations match the closed forms within 10⁻⁶ in f64; simulated plate sinkage and drawbar pull within 2% of them; rut leak zero over 10³ resets. |
M4 | §18.17 |
| GATE-TRAC-09 | Fidelity | CL-H on batch-cpu: residual at most 10⁻⁴ within eight passes on at least 95% of battery contact states and 10⁻⁶ under strict; zero creep on the incline below threshold; no separation velocity on a sliding block; agreement with the referee on the Solid rows of §18.16. |
M5; GPU at M6 | §18.17 |
| GATE-TRAC-10 | Known answer | Scaling: bit-identical solutions with and without S on 10⁵ sampled systems; f32 against f64 Newton-step error at most 0.5% at default cards and 5% at near-rigid cards; cards over the bound refused. |
M2 | §18.17 |
Habitat (§19).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-HAB-01 | Known answer | Compiled field against source geometry: error at most half a fine voxel at 10⁶ surface samples and never above the brick bound; analytic shapes exact to the interpolation bound and overlays to round-off; quantization ripple on a resting 10 kg block at most 1% of weight on every tier. | M2 | §19.19 |
| GATE-HAB-02 | Known answer | Per archetype, 1,000 seeds yield valid scenes: all constraints satisfied; each tagged witnessed, impossible or unresolved (at most 5% unresolved); impossible: intended within one percentage point of quota; none resampled; one seed gives one SceneId on Linux and macOS. |
M3 | §19.19 |
| GATE-HAB-03 | Reality | One real place ingested end to end, privately, with its scale label and unknown regions respected, and at least one probe request emitted for it. A place for which no capture exists is recorded as no-claim, not as a pass. F. |
M5 | §19.19 |
| GATE-HAB-04 | Known answer | Scene acceptance: every fixture of §19.5.6 passes on 100 scenes per archetype; the reflected room is rejected and the three-point control accepts it; the 6 mm case returns unknown. |
M3 | §19.19 |
| GATE-HAB-05 | Known answer | Separation of optics and friction: the four-state tile behaves as in §19.5.4 on every tier, bit for bit within the determinism class. | M3 | §19.19 |
| GATE-HAB-06 | Known answer | Film-friction law as scenes consume it (the law's own gate is GATE-TRAC-05): the three squeeze times within 2%; the R⁴ scaling; dry and thick-film limits recover the card coefficients. | M3 | §19.19 |
| GATE-HAB-07 | Known answer | Advected film F: relative volume residual at most 10⁻⁶ over 10⁵ steps with pickup and redeposition; spreading exponent within 2% of 1/8; the non-conservative control fails; no cross-world leak in 10⁶ world-episodes. | M6 | §19.19 |
| GATE-HAB-08 | Known answer | Slosh and proxies F: first-mode frequency within 3% at three fill depths; catenary sag within 2% at 20 links; the free-slab rug slides in the castor case. | M6 | §19.19 |
| GATE-HAB-09 | Fidelity | Proxy adequacy: the pilot of §19.10.7 is run and its number recorded; this gate reports, and KILL-LIVING decides. | Before the island work package | §19.19 |
| GATE-HAB-10 | Known answer | Clearance complexes F: the corridor closed form bracketed by witness and cut on 100 (a, b) pairs; zero false witnesses and zero false cuts on the seven archetype fixtures against a brute-force grid at four times the resolution; the checker accepts every certificate and rejects six mutated ones. | M3 | §19.19 |
| GATE-HAB-11 | Design comparison | Retrofit F: three planted bottlenecks (a 20 mm threshold, a closer above push capability, an unmarked glass door) are repaired by the expected kits with the policy identity unchanged; the wheel-and-ramp closed form is reproduced by both arms. | M4 | §19.19 |
| GATE-HAB-12 | Performance | World bank: resident counts recorded against §19.15 (targets: at least 2,000 homes at 2 cm on the M5 Ultra; at least 150 on one RTX 4090 beside an 8,192-world quadruped batch); admission never exceeds the cap; a world changes scene at reset with no recompilation. | M3 | §19.19 |
| GATE-HAB-13 | Known answer | Brick pool: the pooled field equals the dense field bit for bit at 10⁶ points per scene; measured occupancy and deduplication ratios are recorded for every archetype. | M2 | §19.19 |
| GATE-HAB-14 | Known answer | Hygiene: a mirrored layout and a retrofit variant planted across a split are refused; feasibility counts in manifests equal recounts. | M3 | §19.19 |
Sensorium (§20).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-SENS-01 | Known answer | Depth against analytic scenes within 1 mm plus the brick bound; the three IMU cases of §20.5 and the turntable case; lidar beam geometry and instants match the pattern definition. | M2 | §20.21 |
| GATE-SENS-02 | Fidelity | Sensor outputs, masks and delivered-observation digests agree across backends inside their determinism class. | M2 | §20.21 |
| GATE-SENS-03 | Known answer | Noninterference: all five properties of §20.17 hold on the standard battery; the draw-order control fails. | M2 | §20.21 |
| GATE-SENS-04 | Known answer | Clock contract: the 400/30 schedule exactly; zero drift against rational arithmetic over 10⁹ ticks; the impulse and arrival cases; identical schedules on every tier. | M1 (CPU); M2 (every tier) | §20.21 |
| GATE-SENS-05 | Known answer | Checkpoints: restore at the three adversarial instants gives byte-equal delivered observations and physics digests over the next 10⁴ ticks on every tier. | M1 (CPU); M2 (every tier) | §20.21 |
| GATE-SENS-06 | Known answer | Rolling shutter and beam instants: skew within 0.5 pixel of 19.2; seam displacement within 1 cm of 0.5 m; no fabricated blur across an impact; at most 5% added ray-stage cost. | M2 | §20.21 |
| GATE-SENS-07 | Known answer | Optical failure modes: the mirror, glass, steam and pattern-dropout cases of §20.20; every masked sample carries a reason; repeated reads through one pane fail together. | M3 | §20.21 |
| GATE-SENS-08 | Known answer | Observability: the corridor case and the four-dimensional gauge, by the linearized and the empirical form, agreeing to within 5% in the non-zero eigenvalues. | M1 (docking rows); M3 | §20.21 |
| GATE-SENS-09 | Known answer | Alias witness: the T-junction and the late-packet docking witnesses are found and pass the checker; on 64 planted layouts every planted alias is found and no false witness is reported. | M1 (docking rows); M3 | §20.21 |
| GATE-SENS-10 | Known answer | Γ_obs: the two cases of §20.13 on every template; the equivariance test passes for members and fails for non-members. | M3 | §20.21 |
| GATE-SENS-11 | Known answer | Calibration: the triangle and four-sensor residual patterns; the planted bump recovered within 0.1° and 1 mm and attributed to the right node in 100 of 100 seeds. | M3 | §20.21 |
| GATE-SENS-12 | Known answer | Causal-policy test: the reference actor and every baseline controller pass; each of the five planted leaks fails. | M1 (CPU); M2 (every tier) | §20.21 |
| GATE-SENS-13 | Known answer | Docking fixture: 344, 217 and 9 in exact arithmetic on batch-cpu, CUDA and Metal with identical bytes; guarded single precision with fallback gives zero final errors; the third-gain amendment reverses every admitted cell. |
M2 | §20.21 |
| GATE-SENS-14 | Known answer | Sensor cards: every failure mode of §20.8 marked S has its first check passing, and every card field reports its provenance. | M3 | §20.21 |
Spark, numerics and the performance program (§21, §35, §36).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-SPARK-00 | Known answer | One dialect source for K-cay-step compiles and runs on CUDA (trj) and on Metal (this Mac) and matches the Rust reference inside its class. |
M0 | §21.24 |
| GATE-SPARK-01 | Known answer | IEEE probe per device family: exhaustive bit comparison of f32 square root and reciprocal over all 2³² inputs; 10⁹ sampled operand pairs for +, −, ×, ÷ with subnormal and overflow edges; the contraction detector; subnormal and NaN behaviour recorded. The outcome sets each device's best attainable determinism class. |
M0 | §21.24 |
| GATE-SPARK-02 | Fidelity | Every M2 kernel and the full step agree between batch-cpu (f32) and each device inside the declared class: bit-equal for class D1; for class D3 at most 4 ulp per kernel output, statistical equivalence of 1,000-step rollouts, and the decision-level test of §35.4. |
M2 | §21.24 |
| GATE-SPARK-03 | Performance | CUDA rows of §36.3 inside their tolerances, with the disclosure block and the paired lower bound of §36.6. | M2 | §21.24 |
| GATE-SPARK-04 | Performance | Metal throughput at least 25% of one RTX 4090 at matched settings on this M5 Ultra (BET-09), reported beside an incumbent with a Metal path measured on the same machine. | M2 | §21.24 |
| GATE-SPARK-05 | Known answer | Precision battery: over 10⁶ steps, group-membership error within 4 ulp, closure and contact violations inside their envelopes, energy-ledger residual under 10⁻⁴ relative, at distances up to 1 km from the origin. | M2 | §21.24 |
| GATE-SPARK-06 | Known answer | Cancellation and fault injection: every injected fault yields its typed refusal, no leaked device memory after 10³ cancel cycles, and the drain report is executor-minted. | M2 | §21.24 |
| GATE-SPARK-07 | Known answer | Fingerprints of both machines are complete (every field measured, or unavailable with a reason), repeatable (two runs agree on every discrete field and within 5% on every rate), and reproduce the starting values of §21.16. |
M0 | §21.24 |
| GATE-SPARK-08 | Known answer | Exact and guarded kernels pass the boundary corpus and the strict-predicate case on batch-cpu, both RTX 4090 and Metal, with identical bytes; the guarded kernel's fallback fraction is reported. |
M0 | §21.24 |
| GATE-SPARK-09 | Known answer | For every stage, withholding its device kernel under a strict request yields the refusal with zero worlds stepped; receipt counters for transfers and synchronizations match an instrumented shim within one count. | M2 | §21.24 |
| GATE-SPARK-10 | Performance | Per-world parameter variants cost at most 5% at 8,192 worlds; 256 topology variants of one bucket run on one captured graph with zero compiles after warm-up; a mixed batch of three body plans reaches at least 0.70 of the harmonic mean of its homogeneous rates; admitting a variant changes no other world's digest. | M2 | §21.24 |
| GATE-SPARK-11 | Known answer | Allocated device bytes are flat over 10⁶ steps; a warm start loads every kernel with zero compiler invocations; each cache control of §21.23 is caught. | M2 | §21.24 |
| GATE-SPARK-12 | Known answer | Zero graph captures after warm-up and zero synchronizations inside a chunk; no pool memory leaked after 10³ cancel cycles; 10⁵ snapshot reads each match the digest emitted for their epoch; the commit-fence known answer holds under 10³ injected faults. | M2 | §21.24 |
| GATE-SPARK-13 | Performance | F On the standard campaign, the paired lower bound of the speedup of two machines over the better single machine is at least 1.3; at most 1 GB crosses per campaign-hour; no forbidden transfer class crosses. | M4 | §21.24 |
| GATE-SPARK-14 | Performance | F A specialized kernel is bit-identical to its generic kernel and at least 1.2 times as fast on the whole step, with compile time at most 60 s. | M4 | §21.24 |
| GATE-SPARK-15 | Known answer | 1,000 episodes per reference workload: per-world digests identical alone, in 100 random co-tenancies, under slot permutation, at two bucket capacities and on one and two shards, on batch-cpu and each device family; draws depend on address alone; both negative controls of §35.14 caught. |
M2 | §35.15 |
| GATE-SPARK-16 | Fidelity | Every class D3 placement pair used as evidence, on at least 4,096 frozen worlds per reference workload: upper bound on discordant decisions at most 1%; net one-sided discordance at most 0.5%; continuous outcomes equivalent inside ledger margins; first divergences recorded. A planted bias of one decision in fifty must fail. | M2 | §35.15 |
| GATE-SPARK-17 | Known answer | Each licence refusal of §35.3 fires on its planted case (a D4 arm in a paired comparison; attribution below D2; a cited training return; a cross-family pair demanded as paired), and a policy trained under fast-training re-evaluates to the same digest twice. |
M3 | §35.15 |
| GATE-SPARK-18 | Known answer | PO-NUM-02 holds on each backend; on 10⁴ contact states per reference robot the relative error of the f32 Newton step against f64 is at most 10·κ₂·u, and at most 10⁻³ on near-rigid states under the stiff profile; κ̂ never exceeds the κ₂ computed in f64. |
M2 | §35.15 |
| GATE-SPARK-19 | Known answer | The harness rejects a report that violates the unit ordering or omits a decimation; the paired-bound known answer holds; of 100 A/A campaigns at most 9 clear a threshold of 1.02; a figure without a complete disclosure block is refused. | M2 | §36.16 |
| GATE-SPARK-20 | Performance | Weak scaling at least 1.8 and strong scaling at least 1.25 at equal task quality, both as paired lower bounds; the gradient known answer of §36.13 holds and its control is caught. | M2 | §36.16 |
| GATE-SPARK-21 | Parity | Incumbents measured on trj and on this Mac under the disclosure block: physics and full step for Q and H at matched and native settings; time to threshold on one and two cards; cold start; edit to first step (parameter and topology); CPU MuJoCo at 1, 24 and 36 threads; a Metal-path incumbent. Each published figure of §36.3 reproduced within 20% or the difference explained in writing. |
M0 (the trj rows that need no agent); M1 (complete) |
§36.16 |
| GATE-SPARK-22 | Known answer | sim.estimate memory within 5% of measured high-water marks at 1, 8, 64 and 256 worlds and at capacity for Q and H on each device; a job that does not fit refused before allocation; time estimates inside their intervals on at least 90% of held-out runs; bytes touched per world-step measured per launch. |
M2 | §36.16 |
Reflex, with gaits and shields (§22).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-REFLEX-01 | Known answer | Each archetype stands for 10 s and traverses 5 m of flat ground under its baseline controller: at M1 the first archetypes, on referee only, restricted to those whose contact law exists at M1 and whose contact count fits the referee's 21-contact cap (§16.6); at M2 the same set on batch-cpu; at M3 all eighteen on batch-cpu, except tracked and hybrid archetypes, which follow at M4 with their contact laws. |
M1 (referee); M2 (batch-cpu); M3 (all but tracked and hybrid); M4 |
§22.18 |
| GATE-REFLEX-02 | Design comparison | BET-06: at least 80% of corpus designs that pass design check traverse 5 m, as a paired 95% lower bound. Potency control: every corpus design with a planted control-relevant defect fails. |
M3 | §22.18 |
| GATE-REFLEX-03 | Known answer | Filter consistency inside χ² bounds on the simulated IMU; position drift under 2% of distance on a flat trot, scored by the gauge rule; PO-REFLEX-01; the comparator's overconfident flag fires on a planted bias. |
M1 | §22.18 |
| GATE-REFLEX-04 | Design comparison | Rank agreement of the baseline rung with trained specialists on 30 to 40 designs per morphology class and task family, thresholds fixed before data: a Kendall τ lower 95% bound of at least 0.7 lets the rung select; at least 0.5 lets it discard the bottom half; below 0.5 it removes outright failures only (baseline-only: unranked). |
M3 (legged, wheeled); M4 (tracked, hybrid) | §22.18 |
| GATE-REFLEX-05 | Known answer | PO-REFLEX-02; every command has a layer record; a planted infeasible program yields a certificate that checks exactly and a fallback event; a run that needs commands beyond the envelope is marked actuator-infeasible. |
M3 | §22.18 |
| GATE-REFLEX-06 | Design comparison | Sampling controller on the pilot design set: success at least 60% within three episodes; median at most 1 GPU-minute per 20 s quadruped episode and 6 per humanoid episode (the thresholds of BET-27); Kendall τ against specialists at least 0.5; FROB-REF-817 fires on a planted acceptance request that has no frozen planner record; the digest does not change with the fork count. | M4 | §22.18 |
| GATE-REFLEX-07 | Known answer | Planted asymmetries (side slope, off-centre payload, front-only sensor, one-sided patch) remove exactly the expected generators; the two-latch fixture passes in law and fails tied; the event identity holds on regular landings and is flagged on grazing ones. | M4 | §22.18 |
| GATE-REFLEX-08 | Known answer | Skill exact layer: both hand fixtures reproduce; 4 of 4 infeasible bodies are refused with certificates that check exactly; feasible witnesses replay; the {stable, fall} refinement is refused. | M4 | §22.18 |
| GATE-REFLEX-09 | Design comparison | Learned residual transport M: at least 18 of 20 feasible unseen bodies within 3 percentage points of tuned baselines with no adaptation, both cost denominators reported. | M8 | §22.18 |
| GATE-GAIT-01 | Known answer | Rimless-wheel fixed point and multiplier within 10⁻⁶; compass-gait multipliers within 10⁻⁶ of an independent high-precision computation; the planted transverse instability is found and the restricted computation is marked incomplete; PO-GAIT-01. | M4 | §22.18 |
| GATE-GAIT-02 | Known answer | 100-case suite: in at least 72 of 80 regular cases the gradient's cosine against central differences is at least 0.95; all 20 grazing and fold controls labeled or refused; no case refused for simultaneity alone; the bar fixture returns rest, v/4 and the sign of the coupling term. | M4 | §22.18 |
| GATE-GAIT-03 | Design comparison | Continuation succeeds on at least 50% of 10% design perturbations; median solve at most 10 minutes of CPU; Kendall τ of at least 0.5 between orbit cost of transport and specialists on the calibration set; the measured solve cost is recorded beside the published range. | M4 | §22.18 |
| GATE-SHIELD-01 | Known answer | Energy tier: the worked card reproduces; no exceedance over 10⁴ randomized contact sequences with μ in [0, 5], restitution in [0, 1] and every contact law; a budget with a planted unlisted spring is refused; a payload-only budget shows an exceedance. | M4 | §22.18 |
| GATE-SHIELD-02 | Known answer | PO-SHIELD-02 with zero box violations; the worked example gives (1, 0.5); a planted non-convergent multi-row instance invokes the backup; PO-SHIELD-03. | M4 | §22.18 |
| GATE-SHIELD-03 | Design comparison | 5,000 in-envelope and 5,000 shifted-world episodes with independent breach labels: in-envelope violations within the stated bound; shifted results reported separately; at least 85% of unshielded return; at most 5% added step cost. | M4 | §22.18 |
| GATE-SHIELD-04 | Known answer | Measured margin: empirical coverage at least 1 − α − 0.01 on 10⁴ held-out episodes of the calibrated family; a planted change of policy trips FROB-REF-457; a planted drift trips the alarm. | M4 | §22.18 |
| GATE-SHIELD-05 | Known answer | Reachable-set table M: zero false admissions in 5,000 in-envelope episodes on the braking fixture; uncovered outside the table. |
M8 | §22.18 |
Cortex (§23).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-CORTEX-01 | Known answer | PPO on the reference quadruped's flat velocity task reaches the return threshold on batch-cpu and on each GPU backend; a zero-weight and a random policy both fail it; the exported checkpoint, reloaded on batch-cpu, reproduces the return inside the D3 envelope with a non-zero policy head. |
M2 | §23.23 |
| GATE-CORTEX-02 | Parity | On-device backward kernels match FrankenTorch autograd within 10⁻⁵ relative on 10³ random batches. | M2 | §23.23 |
| GATE-CORTEX-03 | Design comparison | BET-07 as the three-arm experiment of §23.13, ten paired seeds: the equivariant arm reaches the return in at most 0.7 times the steps of the unaugmented arm with no loss of final return; the one-sided patch is passed; the comparison with the augmented arm is reported, whichever wins. | M4 | §23.23 |
| GATE-CORTEX-04 | Known answer | Each detector of §23.16 flags its planted exploit and passes an honest policy. | M3 | §23.23 |
| GATE-CORTEX-05 | Performance | Wall-clock to the return threshold of GATE-CORTEX-01 on one RTX 4090 is at most 1.25 times an incumbent's wall-clock for the comparable task, re-measured on the same card under the disclosure block of §36. Published context: about 410 s. This is parity, not advantage. | M2 | §23.23 |
| GATE-CORTEX-06 | Known answer | Rules E-1 to E-9 each pass their fixture; the final observation is retrievable in both reset modes; the 0 and 9.9 bootstrap fixture; the 500 against 1,000 reward fixture is invariant under rate terms. | M2 | §23.23 |
| GATE-CORTEX-07 | Known answer | The PPO battery P-1 to P-11 passes for our implementation, and three planted defects that reproduce the sibling's errors each fail it. | M2 | §23.23 |
| GATE-CORTEX-08 | Parity | Two-shard and one-device updates agree inside the D3 envelope on 10³ random batches, an empty shard included; the 0.25 and 32/9 fixtures; strong scaling of at least 1.25 times at constant global workload and equal task quality (§36.3 row 5; 1.6 is the ambition and the funding threshold of KILL-SHARD). | M2 | §23.23 |
| GATE-CORTEX-09 | Known answer | The stride fixture reads element 3; the negative-stride view is materialized or refused; a stale-epoch read is refused. | M2 | §23.23 |
| GATE-CORTEX-10 | Known answer | Streaming past-time robustness equals offline evaluation on 10⁴ random traces; the mixed-unit fixture binds on the clearance in both unit systems; a future-time online reward is refused. | M3 | §23.23 |
| GATE-CORTEX-11 | Design comparison | Family policy in one class on held-out parametric designs: median return with no adaptation at least 70% of a specialist's; fine-tuning reaches specialist return in at most 20% of the steps of a from-scratch run stopped at 95% of its final return, on the task family's terrain set including stairs, slopes and wet patches; out-of-class designs declined; re-described robots keep at least 80% of return. | M4 | §23.23 |
| GATE-CORTEX-12 | Design comparison | The rank-agreement experiment of §23.11 is run and its consequence applied: τ, top-10 recall and intervals are recorded per class and task family, and a rung without a record is refused. The gate passes when the record exists and the rule is enforced, whatever τ is. | M3 as a pilot on incumbent tools; M4 on ours | §23.23 |
| GATE-CORTEX-13 | Design comparison | Inheritance on 12 parent-child edit pairs (4 blind): median adaptation samples for parameter edits at most 20% of a from-scratch run stopped at 95% of its final return, and fewer than a raw-checkpoint warm start needs; the inherited child more than 5% worse in at most 20% of edits; a chain of 10 edits shows no decline under scheduled resets (audit twin within 5%). Topology edits reported, not required. | M4 | §23.23 |
| GATE-CORTEX-14 | Design comparison | The shuffled-label control fails; a student of a baseline or specialist teacher reaches at least 90% of the teacher's requirement pass rate; the figure for a sampling-controller teacher is recorded with its cost. | M4 | §23.23 |
| GATE-CORTEX-15 | Known answer | Planted box-cone and penetration-energy exploits flip a planted ranking and are typed model-conditional; a genuine winner stays model-robust; the cost is at most 10% of the campaign; FROB-REF-830 fires. |
M3 | §23.23 |
| GATE-CORTEX-16 | Parity | 10³ episodes driven through the adapter and natively have equal digests (D2); the final observation is in info in every autoreset mode; an external PPO reaches the threshold of GATE-CORTEX-01 through it. |
M3 | §23.23 |
| GATE-CORTEX-17 | Design comparison | Geometric-algebra tree policy M: arm B or C is at least 1.3 times faster than arm A to the return threshold at equal wall-clock, or better with no adaptation beyond seed spread. | M8 | §23.23 |
Arena and qualification (§24).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-ARENA-01 | Known answer | Every task is reproducible inside its determinism class from its TaskId, SceneId, ModelId and seed; reference-robot baseline scorecards are recorded. |
M2 | §24.17 |
| GATE-ARENA-02 | Known answer | The scene-split check rejects an evaluation that reuses a training scene. | M3 | §24.17 |
| GATE-ARENA-03 | Known answer | Monitors: the three evaluators agree bit for bit on 10⁶ random traces per operator, including multi-rate signals and windows with rounding; every requirement-language refusal of §24.14 (FROB-REF-520, -535, -536, -523, -538, -525, -526, -539 and -528) is triggered by its planted task file. | M1 | §24.17 |
| GATE-ARENA-04 | Known answer | Fixture 1: every analytic row within tolerance on the referee and inside the fidelity envelope on the batch tiers; the creep rigs flip at the stated thresholds; both negative controls are caught. | M1 on the referee; M2 on the batch tiers | §24.17 |
| GATE-ARENA-05 | Known answer | eval.preanalyze reproduces the tables of §24.10 exactly and refuses the unreachable verdict. |
M1 | §24.17 |
| GATE-ARENA-06 | Known answer | Fixture 2: limiting-model rows within 1% on the referee; slip invariance to 10⁻¹² relative in double precision; reflected cases mirror inside the determinism class. | M2 | §24.17 |
| GATE-ARENA-07 | Known answer | Scorecard accounting: a planted infeasible scenario appears in its column and in the all-scenario denominator; columns sum to the battery size on 100 random batteries; a silently shortened battery changes identity. | M3 | §24.17 |
| GATE-ARENA-08 | Known answer | Reset cache: penetration at most 0.5 mm and first impulse within 5% of static support on all 64 states for each reference robot; a design edit invalidates the cache. | M2 | §24.17 |
| GATE-ARENA-09 | Design comparison | Requirement writing: on 50 scripted mission statements, each with a reference formula and 20 labelled trajectories the agent does not see, at most 20% of first-draft requirements mislabel a trajectory, and task.check rejects every draft that does. |
M3 | §24.17 |
| GATE-QUAL-01 | Known answer | Over 2,000 simulated no-signal campaigns at α = 0.05, each with 500 adaptive retries by a scripted adversary that sees every receipt and all discovery data: a false promotion in at most 123 campaigns; a planted true gain of the declared size promoted within 10 requests in at least 80% of campaigns. | M3 | §24.17 |
| GATE-QUAL-02 | Known answer | Firewall: 10⁴ fuzzed read attempts across every verb return no sealed field; a planted leak path is found by the audit; receipts contain only the listed fields. | M3 | §24.17 |
| GATE-QUAL-03 | Known answer | frob-verify replays the levels, the commitments and, after close, the cluster derivation of a campaign; a reordered index, a changed request and a reused cluster are each rejected. |
M5 | §24.17 |
Augur (§25).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-AUGUR-01 | Known answer | Admission and checker reject 100% of a mutation corpus of at least 60 mutated queries and certificates (every mutation of §25.5.3, every row of §25.4.7, a swapped prefix, a clairvoyant witness) with the expected refusal code; zero false accepts. | M1 | §25.27 |
| GATE-AUGUR-02 | Known answer | Stance family through the public verb: boundary exactly 3/14 m; four vertex witnesses; dual (0, 1/2, 1/2) for the excluded cell; 11,520 of 11,520 grid states agree with an independent zonotope test; lifted and projected forms agree; the passive-spring amendment withdraws the cell at b = 1/4 m. | M1 | §25.27 |
| GATE-AUGUR-03 | Known answer | The docking family through the public verbs: 561 of 561 cells, nine boundary cells excluded, all late-packet cells excluded, the equality reading 15/16 exported, the three-gain amendment withdraws every positive cell and reports 1/65 m. | M1 | §25.27 |
| GATE-AUGUR-04 | Known answer | The pusher battery: 20 of 20 intervals with exact ends, and the per-build and shared queries return [1/2, 2] and ∅ for the same plant. | M1 | §25.27 |
| GATE-AUGUR-05 | Proof | Every Certified cell of GATE-AUGUR-02 to 04 is accepted by frob-verify built from an empty environment on a host with no GPU, in under 10 s in total; bundle digests identical across two hosts. |
M1 | §25.27 |
| GATE-AUGUR-06 | Proof | Checker independence: dependency closure is std; zero shared source files with proposers; a seeded-fault campaign of at least 200 mutated witnesses per proof kind yields zero false accepts. |
M1, repeated at M3 | §25.27 |
| GATE-AUGUR-07 | Design comparison | A fresh agent with only the generated documentation completes 10 scripted docking and stance amendments, names the binding hardware restriction in at least 9, and never reports an unresolved cell as a verdict; serial turns are recorded against an arm restricted to the lower verbs. | M1 | §25.27 |
| GATE-AUGUR-08 | Known answer | Monotone transport: zero false transports on a planted set of at least 20 non-monotone fixtures (including the widened sole); the falsification harness finds every planted reversal within 10⁴ ordered pairs. | M3 | §25.27 |
| GATE-AUGUR-09 | Known answer | Region certificates on the 12-parameter box: the per-constraint arm decides at least 50% of each constraint's sub-box volume within 10⁴ boxes; no single monotone bound gives more than 95% of decided volume; zero certified boxes contradicted by 10⁶ point evaluations. | M3 (pilot); M4 | §25.27 |
| GATE-AUGUR-10 | Known answer | Alias and jaw fixtures exact; mission.refute on the blind payload task returns all three engineering answers with their conditions. |
M3 | §25.27 |
| GATE-AUGUR-11 | Design comparison | Probe design: 675 of 675 in class; zero unconditional verdicts issued on the withheld law; the direct measurement is offered in every proposal list and is right in 900 of 900. | M4 | §25.27 |
| GATE-AUGUR-12 | Known answer | Revalidation on the frozen 30-amendment campaign: zero incorrectly inherited verdicts; unnecessary invalidations at most 20% of unaffected verdicts; the cost-9 and cost-5 fixture keeps the witness and withdraws the minimum. | M3 | §25.27 |
| GATE-AUGUR-13 | Design comparison | Separation: for each of 10 planted design reversals, mission.separate returns an admissible world pair whose minimized edit list has at most 3 edits and whose first cause is unchanged by minimization, confirmed on the referee. |
M3 | §25.27 |
| GATE-AUGUR-14 | Performance | Ceiling before speed: every registered speed comparison in this subsystem records measured f, r and h on the strong baseline and is refused when 1/(1 − f + f/r + h) is below the claimed ratio. | M3, M4 | §25.27 |
| GATE-AUGUR-15 | Parity | Family execution: inner, excluded and unresolved labels for the 65,536-row screen and for one 1,024-design family batch are identical on batch-cpu, CUDA and Metal under the exact-integer or guarded class, with zero final errors against exact CPU arithmetic. |
M4 | §25.27 |
| GATE-AUGUR-16 | Design comparison | Product dominance: the z fixture exact; on the contact-transition pilot zero mislabelled joint outcomes against per-case referee replay over 10⁴ draws. | M4 | §25.27 |
| GATE-AUGUR-17 | Known answer | Constructive lanes: the co-design fixed point equals the GB-03 closed form and rejects the additive-peak rule on the bus fixture; the three-pose dyad and both circuit fixtures exact; zero certified linkages change circuit on the referee across 240 instances. | M4 | §25.27 |
| GATE-AUGUR-18 | Design comparison | Refinement: of 20 trajectory-optimized candidates per mission, at least 10 pass the referee route and beat the nominal design on held-out terrain, each solved within 10 minutes on 8 threads. | M4 | §25.27 |
| GATE-AUGUR-19 | Known answer | Labels: the three-variant, three-reading and station-record fixtures exact; with inner and outer sets the returned label interval contains the exact count on 20 generated instances. | M4 | §25.27 |
| GATE-AUGUR-20 | Known answer | Holonomy: differential-drive loop within 10⁻⁹ of 4w·(1 − cos θ); loop-reversal and chart-change residuals below 10⁻⁸ m; the skid-steer and slip mutations refused or withdrawn; one newly proposed gait admitted by a full referee rollout. | M6 | §25.27 |
| GATE-AUGUR-21 | Known answer | Symmetry at contact: the identity holds to finite-difference error on the mirrored landing and fails by a margin of at least 10 times that error on each of the four asymmetric mutations. | M6 | §25.27 |
| GATE-AUGUR-22 | Known answer | Continuation: 40 certified Stewart–Gough roots on 10 generic parameter sets; Complete issued only when the trace test agrees; lost paths at most 0.1% and every one flagged. |
M8 | §25.27 |
| GATE-AUGUR-23 | Design comparison | Skill transport: the three-treatment experiment on the tray interface, pre-registered; the planted ramp-crest loss of authority is reported with its mode and a replayable counterexample. | M8 | §25.27 |
| GATE-AUGUR-24 | Design comparison | Facility fixture: at least two feasible engineering strategies discriminated; each of the four seeded failures recovered with a withdrawal and a minimized scenario; the optimality gap reported for every unresolved continuous subproblem. | M8 | §25.27 |
Nemesis (§26).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-NEMESIS-01 | Known answer | Legality and oracle: 100 of 100 planted illegal edits refused; 0 of 100 planted impossible traps counted; at least 95 of 100 planted solvable traps receive a witness. | M3 | §26.15 |
| GATE-NEMESIS-02 | Design comparison | Planted traps of nominal probability at most 3 × 10⁻⁵, 30 paired repetitions: a first promoted failure with at least 3 times fewer simulated steps than card-uniform randomization at a 95% lower bound; at least 70% of reported counterexamples solvable-causal or plant-feasible. |
M3 | §26.15 |
| GATE-NEMESIS-03 | Known answer | Shrinking: planted causes recovered exactly in at least 95 of 100 trials; every .fmcw replays with identical digests in 100 of 100; on unplanted failures the share of worlds with at most three edits is recorded. |
M3 | §26.15 |
| GATE-NEMESIS-04 | Known answer | Bounds: over 10⁴ synthetic studies with known p the 95% upper bound covers p in at least 95%; the defensive mixture covers under a mis-centred proposal; non-nominal episodes are refused. | M3 | §26.15 |
| GATE-NEMESIS-05 | Design comparison | Exploration on planted failures of probability 10⁻⁴ and 10⁻⁵ (one with two separate modes), equal episode budget, 30 repetitions: at least 10 times fewer episodes than crude sampling at 10⁻⁵; both modes found in at least 80% of repetitions. | M3 | §26.15 |
| GATE-NEMESIS-06 | Known answer | Guard: 100 of 100 planted artifact failures labelled and none in the hard-world set; at least 95 of 100 genuine planted failures survive promotion. | M3 | §26.15 |
| GATE-NEMESIS-07 | Known answer | Screening audit: a planted winner removed by a biased screen is reported in 100 of 100 runs; the stratified bound covers the planted false-discard rate in at least 95% of 1,000 synthetic campaigns. | M4 | §26.15 |
| GATE-NEMESIS-08 | Known answer | Coverage: lazy and plain greedy agree; on 1,000 random instances of at most 20 scenes the brute-force optimum is at or below the certificate and greedy is at or above (1 − 1/e) of it. | M3 | §26.15 |
Autopsy (§27).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-AUTOPSY-01 | Known answer | Null forks of 1,000 failing worlds replay with identical digests on the originating backend; a world forked alone and in a batch of 512 children gives identical digests. | M2 | §27.17 |
| GATE-AUTOPSY-02 | Known answer | Classification: 40 catalogued pairs of intervention and state are classified correctly; the warm-start graft and a mid-episode gear change are refused with the right fields. | M2 | §27.17 |
| GATE-AUTOPSY-03 | Known answer | Planted single causes: the planted factor ranks first in at least 90% of 200 failures in double precision, and in the single-precision lane for windows of at most 1 s, and the top factor changes in at most 30% of cases under 10⁻⁷ perturbation; the agreement between ten one-at-a-time forks and the full coalition table is recorded. | M3 | §27.17 |
| GATE-AUTOPSY-04 | Known answer | Coalitions: planted joint and alternative causes are labelled correctly in at least 95 of 100; the Shapley identities hold exactly; the negative-value case is reproduced. | M3 | §27.17 |
| GATE-AUTOPSY-05 | Known answer | Abstention: a planted chaotic failure and a planted no-cause failure name no factor in 100 of 100. | M3 | §27.17 |
| GATE-AUTOPSY-06 | Known answer | The thermal counterexample: all four numbers within 0.1 s and 0.1 K; the mid-episode request is refused and the re-run passes. | M3 | §27.17 |
| GATE-AUTOPSY-07 | Known answer | First divergence: planted divergences found at the right tick and stage in 100 of 100 in exact mode; the pointwise mutant is caught; tolerance mode reports gaps. | M2 | §27.17 |
| GATE-AUTOPSY-08 | Design comparison | On the planted-defect designs of the corpus (§24.9), agents given Autopsy reach an accepted repair in at most one third of the serial turns of agents given logs and explain alone, pre-registered, with an anytime-valid verdict. |
M4 | §27.17 |
Atelier (§28).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-ATEL-01 | Design comparison | BET-05 on the design corpus: area under the ROC curve at least 0.8 and at least 0.05 above the heuristic baseline at a 95% paired lower bound; planted defective designs flagged and a planted sound design passed. | M3 | §28.23 |
| GATE-ATEL-02 | Known answer | Each analysis A-01 to A-14 passes its known-answer tests; design check finishes in under 2 s at the 95th percentile on templates. |
M1 (the analyses that exist); M4 (the rest) | §28.23 |
| GATE-ATEL-03 | Design comparison | BET-10: the pre-registered A/B of agent surfaces on the design benchmark of §24, with an anytime-valid verdict and an effect size: restricted mean time to an accepted answer lower by a factor of at least 1.5 on at least ten briefs. The incumbent arm belongs to §39. | M4 | §28.23 |
| GATE-ATEL-04 | Known answer | Comparison type-I error at or below α under optional stopping over 10⁴ null comparisons; design bisect finds the planted edit in at least 95 of 100 trials. |
M3 (comparison); M4 (bisect) | §28.23 |
| GATE-ATEL-05 | Known answer | Each analysis A-15 to A-26 passes its known answers (§28.22 and the owning chapters) and its negative control fails; the analyses marked ✓ keep design check under 2 s. |
M1 (A-20 to A-23); M4 (the rest) | §28.23 |
| GATE-ATEL-06 | Known answer | The fixed-n planner reproduces the enumeration at n = 64 and n = 86 exactly; FROB-REF-553, -555, -542, -543 and -556 each fire on their planted violation, 100 of 100. | M1 | §28.23 |
| GATE-ATEL-07 | Design comparison | The rank-agreement experiment per morphology class: Kendall τ on the top band at least 0.7 for selective and at least 0.5 for discard-only, and ρ_ep at least 0.7, all at the lower bootstrap bound, on 40 designs. A class below 0.5 is uninformative. |
M3 (pilot); M4 | §28.23 |
| GATE-ATEL-08 | Design comparison | Layer 2 against the fixed table: held-out coverage at least 1 − α − 0.03 per stratum; audited top-k recall no lower than halving's; a paired 95% lower bound above 1 on GPU-seconds to the same accepted decision; a planted over-scored design caught at the next rung; synthetic drift trips the alarm. | M3 (pilot); M4 | §28.23 |
| GATE-ATEL-09 | Known answer | Atelier does not trust a rung whose screening audit (§26.10, GATE-NEMESIS-07) is missing or failed: in 100 of 100 planted campaigns a stage with no audit record, a missed planted winner or an audited miss rate above its tolerance has its rung set to uninformative in the affected strata and its results labelled screen-biased; a planted unsound prune is caught in 100 of 100; no audit episode is ever cancelled. |
M4 | §28.23 |
| GATE-ATEL-10 | Known answer | A-19: every planted cone-excess and energy-pumping exploit is typed model-conditional; honest winners are typed model-robust; the stage costs at most 10% of campaign compute. |
M4 | §28.23 |
| GATE-ATEL-11 | Known answer | Revalidation on the frozen 30-amendment campaign: every decision equals full recomputation; zero unsafe reuse; the stale-key mutant is caught; unnecessary invalidations are at most 20% of unaffected verdicts, counted and reported. | M1 (dependency grades on mission cells); M3 (dependency grades); M4 | §28.23 |
| GATE-ATEL-12 | Performance | PO-ATEL-07 holds; a shadow mismatch stops serving within one hit; design check after a one-parameter edit in 0.2 / 0.5 / 1.0 s at the 50th / 95th / 99th percentile. |
M1 (analysis part); M2 (episode part) | §28.23 |
| GATE-ATEL-13 | Known answer | Each decision core: its table regenerates bit-identically; its null calibration holds (PO-ATEL-01 to -05, -10); its fallback is demonstrated by forcing each trigger; its shadow run records both actions. | M3 (DC-01, DC-09, DC-10); M4 (the rest) | §28.23 |
| GATE-ATEL-14 | Known answer | The nine interference tests of §28.19.3 pass on a replayed campaign. | M4 | §28.23 |
| GATE-ATEL-15 | Design comparison | The offline replay of §28.9: the knowledge-gradient chooser at least 1.5 times better than the agent chooser in evaluations to a true top-3; the value is exactly zero on a fixture where no outcome can change the choice. | M4 | §28.23 |
| GATE-ATEL-16 | Known answer | The cascade end to end on a seeded population: stage controls all run; the report prints every mode, every fallback and the phase ledger; merge of two agents' archives in both orders gives identical bytes. | M4 | §28.23 |
Chronicle (§29).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-CHRON-01 | Known answer | 1,000 random worlds from a GPU run replay with identical digests on the same backend, and inside the class on batch-cpu; the same worlds replayed alone, in a batch of another size and among other co-tenants give the same digests. |
M2 | §29.20 |
| GATE-CHRON-02 | Known answer | Teleport localizes a planted single-kernel divergence to the right step and stage in 100 of 100 trials. | M2 | §29.20 |
| GATE-CHRON-03 | Known answer | The energy ledger closes: residual below 10⁻⁹ relative on the referee and 10⁻³ on single-precision tiers; a damped pendulum's ledger matches the hand calculation. | M1 (referee); M2 (single precision) | §29.20 |
| GATE-CHRON-04 | Known answer | The chunk protocol under 10⁵ seeded fault schedules: INV-CHRON-01 to -04 hold in every one; each planted violation (late lease, overlap, conflict, tick-zero reuse) is refused, 100 of 100. | M1 (CPU); M2 (device) | §29.20 |
| GATE-CHRON-05 | Known answer | Fork classification: the five classes of §27.4 are assigned correctly on 100 planted change sets; the warm-start graft is refused 100 of 100; the empty intervention equals replay on 1,000 worlds. | M2 | §29.20 |
| GATE-CHRON-06 | Known answer | First divergence: the two-tick case reports the earlier tick 100 of 100; a tolerance case with a loose bound returns unresolved and then the right interval after refinement; a trace with missing samples returns an interval and a gap. |
M2 | §29.20 |
| GATE-CHRON-07 | Known answer | Sampling and histograms: INV-CHRON-05 and -06 hold over 100 permutations, shard splits and co-tenancies on batch-cpu, CUDA and Metal; weighted estimates from the traced stratum recover a planted population mean inside the exact interval. |
M2 | §29.20 |
| GATE-CHRON-08 | Known answer | The created-energy audit flags every planted trampolining and cone-excess exploit and no honest fixture. Each failure class's monitor fires on its planted fixture, and a numerical fault is never counted as a physical failure or dropped from a denominator. | M2 | §29.20 |
| GATE-CHRON-09 | Known answer | Tier correction: equal to the plain mean at n = N; type-I error at most α over 10⁴ null comparisons under optional stopping; coverage at least nominal − 0.03; a planted between-tier reversal never established; referee episodes per established verdict 16 / 64 / 256 at the 50th / 95th / 99th percentile. | M3 | §29.20 |
| GATE-CHRON-10 | Known answer | The artifact graph: every row of registries/gates.toml with a PASS resolves; a dangling identifier fails the build; evidence.trace on 100 random claims returns closures whose hashes recompute. |
M1 | §29.20 |
| GATE-CHRON-11 | Known answer | Simulation testing: full await-point coverage of the publish and submit paths; every failure minimized to a regression that replays in under one second; dual-run agreement on 100 small jobs. | M1 (CPU); M2 (device) | §29.20 |
| GATE-CHRON-12 | Known answer | Retention: 10⁴ random collection cycles remove no pinned object; every removal has a tombstone; a citation of a collected object is refused with its reason. | M2 | §29.20 |
| GATE-CHRON-13 | Performance | T0 and T1 on every world cost at most 3% of step time, and T2 on a 1% sample at most 2% more, on the reference quadruped workload with the disclosure block of §36. | M2 | §29.20 |
Ground (§30).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-GROUND-01 | Known answer | Every report prints the reality: line; with no dataset it reads no-claim; a negative battery of 50 planted misuses is refused in full. |
M1, then every exit | §30.22 |
| GATE-GROUND-02 | Known answer | Clock recovery as in §30.21 in at least 99% of 1,000 resamples; both negative controls caught. | M5 | §30.22 |
| GATE-GROUND-03 | Known answer | The eight structural aliases are flagged, 8 of 8, and no fit is issued on an aliased set. | M5 | §30.22 |
| GATE-GROUND-04 | Known answer | Planted actuator parameters within 10% on at least 95 of 100 synthetic rigs; identified cards cut held-out trajectory error by at least 30% against prior cards; the omitted-law candidate is rejected in at least 90 of 100. | M5 | §30.22 |
| GATE-GROUND-05 | Known answer | The freeze-before-read order holds for every trial; the three protocol mutations are refused. | M5 | §30.22 |
| GATE-GROUND-06 | Known answer | Mean in-cell coverage within 0.01 of 19/21; fraction below 0.80 within 0.03 of 0.069; zero bands for the shifted cell, the short cell or the unbuilt design. | M5 | §30.22 |
| GATE-GROUND-07 | Known answer | The planted drift retires the calibration within 20 episodes in at least 90% of resamples; false retirement at most 5% over 10⁴ null runs; every scope change fires. | M5 | §30.22 |
| GATE-GROUND-08 | Known answer | As-built known answers of §30.21; the as-built variant has a new ModelId. |
M5 | §30.22 |
| GATE-GROUND-09 | Known answer | A kit rebuilds the rehearsal on a clean machine inside its class; a private input is refused. | M5 | §30.22 |
| GATE-GROUND-10 | Reality | The first real cell: a frozen prediction scored on sealed data and a band issued. An import lane: it blocks nothing, and its resting state is no-claim. |
When data is admitted | §30.22 |
Foundry (§31).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-FOUNDRY-01 | Known answer | Cantilever deflection within 2% and stress within 5% after refinement; the planted overstress located with utilization 1.25 ± 5%. | M5 | §31.19 |
| GATE-FOUNDRY-02 | Known answer | Free-body residual at most 10⁻⁶ relative on the referee and 10⁻³ on single-precision tiers; superposition equals direct solves (PO-FOUNDRY-01); the assembled-peak and equal-limb mutations refused. | M5 | §31.19 |
| GATE-FOUNDRY-03 | Known answer | Fatigue block and rainflow sequence exact to 10⁻¹² relative; the window-split mutation reproduces its 10.7% and is caught. | M5 | §31.19 |
| GATE-FOUNDRY-04 | Known answer | Two-bar compliance within 10% and bar angle within 5°; the extracted surface meshes and passes the mesh audit on 20 of 20 fixtures. | M5 | §31.19 |
| GATE-FOUNDRY-05 | Design comparison | The stage-2 pilot: saving at least 7% (kill threshold, as in BET-29 and C-35) with 15% the target; the convergence test passes within five iterations; coarse solve at most 120 s per link class. | M5 | §31.19 |
| GATE-FOUNDRY-06 | Known answer | Planted-gain loop: fixed point within 10⁻⁶, λ̂ within 0.01; divergence and cycling refused. | M5 | §31.19 |
| GATE-FOUNDRY-07 | Known answer | Planted violations of wall, corner radius, tool access, overhang and undercut each detected with location and repair; clean parts pass; 20 of 20. | M5 | §31.19 |
| GATE-FOUNDRY-08 | Known answer | The worked allocation to 10⁻⁹; the zero-sensitivity and quadratic cases handled as specified; a correlated stack equals its hand value. | M5 | §31.19 |
| GATE-FOUNDRY-09 | Known answer | Tetrahedron round trip bit-exact; open shell and over-bound parts refused; mass properties from exported geometry within 10⁻⁶ of the model. | M5 | §31.19 |
| GATE-FOUNDRY-10 | Known answer | Packet schema-valid, every hash matching, flags present and false, cross-consistency of parts, geometry, nets and schedule; a mutated flag rejected by frob-verify; a writer killed at any file boundary leaves no packet. |
M5 | §31.19 |
| GATE-FOUNDRY-11 | Known answer | M The fixed-point cases of §31.18; 10⁶ vectors bit-equal. | M8 | §31.19 |
| GATE-FOUNDRY-12 | Fidelity | M A 100-hour reference (1.8 × 10⁸ steps) compressed at least 50-fold in steps with at most 5% error on every slow state; the planted backlash-induced gait collapse caught. | M6 | §31.19 |
Tether (§32).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-TETHER-01 | Design comparison | A fresh agent given only robot-docs completes 20 scripted studio tasks with at least 18 correct and no budget violation. |
M3 | §32.21 |
| GATE-TETHER-02 | Known answer | CLI and MCP surfaces are generated from the registry and their parity diff is empty; every verb has a schema, an example and a refusal list. The served tools/list equals the registry under the name map. |
M1 | §32.21 |
| GATE-TETHER-03 | Known answer | Envelope and exit-code conformance on malformed, unknown and over-budget inputs. | M0 | §32.21 |
| GATE-TETHER-04 | Known answer | Each of the three failure classes is exercised on both surfaces; every refusal code maps to exactly one exit code; a killed connection during a wait leaves the job recoverable by key in 100 of 100 trials. | M2 | §32.21 |
| GATE-TETHER-05 | Known answer | Idempotency: 1,000 races of two identical submissions and 1,000 with a changed payload each leave exactly one job and one charge; a crash injected at every commit point leaves one job, one charge and a replayed receipt. Negative control: the two-statement variant fails. | M2 | §32.21 |
| GATE-TETHER-06 | Known answer | Pagination: over 10⁴ seeded schedules of concurrent appends, concatenated pages equal the frontier snapshot, including rows with equal timestamps; a changed filter with an old cursor is refused. | M2 | §32.21 |
| GATE-TETHER-07 | Known answer | Integers: the golden envelope set passes through a double-decoding client with no changed value; the schema lint finds no bare 64-bit integer. | M1 | §32.21 |
| GATE-TETHER-08 | Known answer | Job protocol under seeded faults (late lease, overlapping ranges, a reset reusing tick zero, a kill between chunk write and publish, a daemon restart): contiguous frontier; a duplicate chunk reuses its receipt; a conflicting chunk is flagged; terminal counts sum to planned; a cancel names the last committed tick; no device leak. | M2 | §32.21 |
| GATE-TETHER-09 | Performance | Slot invariance: 1,000 episodes solo and in 100 random co-tenancies have identical digests. At 8,192 identical worlds shared dispatch loses at most 5% throughput and 99th-percentile step time is at most 1.10 of solo. Admission to first step for jobs of up to 256 worlds: 0.1, 0.5 and 2 s at the 50th, 95th and 99th percentiles. | M3 | §32.21 |
| GATE-TETHER-10 | Performance | Scheduling on a replayed mix (90% interactive) at utilization 0.7: interactive wait at the 95th percentile at most 6 s; batch slowdown at most 10%; no job beyond the ageing bound; random preemption and reordering leave every digest and verdict identical. | M3 | §32.21 |
| GATE-TETHER-11 | Known answer | The 90% estimate interval covers the actual cost in 85% to 95% of at least 200 held-out jobs per stratum; a stratum with fewer than 19 points reports uncalibrated. |
M3 | §32.21 |
| GATE-TETHER-12 | Known answer | MCP: every run tool returns within sync_wait_ms plus 500 ms with a result or a handle; a wire-cancelled wait leaves the job running; after session_focus at most seven tools plus the base three; each resource kind of §32.12.7 listed and readable; prompts match robot-docs. |
M3 | §32.21 |
| GATE-TETHER-13 | Design comparison | A fresh agent with only robot-docs completes 10 scripted tasks of the mission session with at least 9 correct, no budget violation and no instruction taken from a poisoned import. Second arm: with solve.run, serial turns per accepted design fall by the pre-registered factor or KILL-SOLVE fires. |
M4 | §32.21 |
| GATE-TETHER-14 | Known answer | Dashboard: a snapshot test per pane on a recorded daemon trace, and every displayed number is reproduced by its source verb. Viewer: on analytic scenes the overlay value under a probe pixel equals the telemetry channel within its quantization. | M3 | §32.21 |
Safety, security and privacy (§37).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-SAFE-01 | Known answer | Flags: every artifact produced by every exporting verb carries the three fields, all false. Negative control: an artifact edited to true, and one with the fields removed, are each refused by the importer and by frob-verify. |
M1, then every exit | §37.14 |
| GATE-SAFE-02 | Known answer | Injection: at least 200 hostile strings pass through every verb that echoes imported text; none appears outside an untrusted-marked field, and none appears in any tool description, prompt or next_actions command. |
M3 | §37.14 |
| GATE-SAFE-03 | Known answer | Confirmation isolation: a session holding every discovery scope attempts at least 25 enumerated read paths against a confirmation run; all return FROB-REF-840. Negative control: a test build that leaks per-world outcomes is detected by the adaptive-retry gate of §24. |
M3 | §37.14 |
| GATE-SAFE-04 | Known answer | Privacy: for a private scene, each derived artifact kind carries the mark; exports without the flag are refused; after scene.purge no digest of the closure remains in the store. |
M3 | §37.14 |
| GATE-SAFE-05 | Known answer | Licences: over random derivation graphs the licence set equals the join of the inputs; a research-only asset cannot be made to enter an exported report or pack. | M3 | §37.14 |
| GATE-SAFE-06 | Known answer | Supply chain: one asupersync package per workspace; all lockfiles committed; a kernel cache entry with one flipped byte is refused; frob-verify builds with no dependency outside the standard library. |
M2 | §37.14 |
| GATE-SAFE-07 | Known answer | Importers: at least 10⁷ fuzz executions per importer with no panic; each limit is reached by a crafted file and refused. | M2 | §37.14 |
| GATE-SAFE-08 | Known answer | Claim product: over random sets of input evidence the envelope's class equals the meet; no public function returns a stronger class than its inputs. | M1 | §37.14 |
| GATE-SAFE-09 | Known answer | D4: a result produced under the nondeterministic training profile is refused on each of the five paths of INV-SAFE-07; the same policy re-evaluated under D2 is accepted. | M3 | §37.14 |
| GATE-SAFE-10 | Known answer | Path jail: a corpus of traversal, absolute-path and swapped-link attempts is refused on every path-taking argument of every verb. | M1 | §37.14 |
Workspace (§34).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-WS-01 | Known answer | Seven plants in a scratch copy (an upward edge, an intra-layer edge against rank, a second asupersync package, an unregistered capsule, an edited generated file, a contract missing a section, a stale stack lock): each caught by the check that owns it and by no other; no failure on the clean tree. | M0 | §34.13 |
| GATE-WS-02 | Known answer | The format registry round trips of §34.9. | M1, then at each new format; complete at M5 | §34.13 |
| GATE-WS-03 | Known answer | The auditor's independence, §34.11. | M1 | §34.13 |
| GATE-WS-04 | Performance | The six checks together finish in at most 60 seconds on a warm tree, so that they are run and not skipped. | M0 | §34.13 |
Gauntlet (§38).
| Gate | Claim | Threshold, in brief (TARGET) | Earliest | Defined in |
|---|---|---|---|---|
| GATE-GAUNT-01 | Known answer | Every gate in this register has a registered negative control that it catches. | Every milestone exit | §38 |
Further gates that §38 defines for the verification program itself are entered here under the same rules. The gates of the ten-fold test, GATE-TENFOLD-01 to -13, are listed with the program gates in §40.5.
Claims the register assigned. The chapters of §12 to §15 give their gates no claim column; the register assigns Proof to the certificate gates of §12, Parity to GATE-SKEL-01, Fidelity to GATE-SINEW-03 and Known answer to the rest, as version 0.2 did. Twenty-three rows that a chapter labels, or first labelled, "Performance of the method" or "method" are Design comparison (the chapters of §24 to §32 now print that claim; the rows quoted below are quoted as first drafted): GATE-ARENA-09; GATE-ATEL-01, -03, -07, -08, -15; GATE-AUTOPSY-08; GATE-CORTEX-03, -11, -13, -14, -17; GATE-FOUNDRY-05; GATE-NEMESIS-02, -05; GATE-PHYLUM-06, -08; GATE-REFLEX-02, -06, -09; GATE-SHIELD-03; GATE-TETHER-01, -13; and, by the readings below, GATE-AUGUR-07. Rows that named two claims, or a claim outside the seven, are read as follows.
- GATE-ATEL-12. Row: Known answer, Performance. The latency figures govern; PO-ATEL-07 and the shadow-mismatch stop are known-answer preconditions.
- GATE-AUGUR-07. Row: Performance. Read as Design comparison: two agent arms on scripted tasks; no speed figure on named hardware is claimed.
- GATE-CHRON-09. Row: Known answer, Performance of the method. The null calibration, coverage and planted-reversal rows govern; referee episodes per verdict are recorded figures.
- GATE-CORTEX-08. Row: Parity and Performance. Agreement of two-shard and one-device updates governs; the scaling figure is evaluated by GATE-SPARK-20 and KILL-SHARD (§40.7).
- GATE-CORTEX-14. Row: Known answer and Performance of the method. The student-against-teacher comparison governs; the shuffled-label control is its negative control.
- GATE-FOUNDRY-12. Row: Performance of the method M. Read as Fidelity: a compressed run agrees with a 100-hour reference within a stated error.
- GATE-PHYLUM-06. Row: Known answer and method. The variance-ratio and sign-agreement comparison governs; the ballistic row and the binary-metric refusal are known-answer preconditions.
- GATE-SPARK-21. Row: Parity baseline. A Parity claim: published incumbent figures reproduced on our hardware.
- GATE-TETHER-09. Row: Parity; Performance. The dispatch limits govern; digest equality is the precondition also tested by GATE-SPARK-15.
Milestones the register assigned. Where a chapter's gate table has no milestone column, the earliest milestone above comes from the milestone skeleton of §43 (Marrow, Skeleton, Sinew, Tether, safety, workspace, GATE-QUAL-01 and GATE-REFLEX-04) or from the milestone note printed under the chapter's own table (Atelier and Chronicle). Every other milestone is the one in the gate's own row, except where that row disagrees with the milestone skeleton: there the register follows the skeleton, and §40.7 lists each case.
Shared fixtures. Several gates record one experiment from the side of the chapter that consumes it. The batch independence of a world's digests is recorded by GATE-KIN-05, GATE-PHYLUM-02, GATE-SPARK-15, GATE-CHRON-01, GATE-AUTOPSY-01 and the digest part of GATE-TETHER-09. The model-form check is recorded by GATE-FID-05, GATE-CORTEX-15 and GATE-ATEL-10. The frozen 30-amendment campaign serves GATE-ATEL-11 and GATE-AUGUR-12, over one revalidation engine. The tier correction is recorded by GATE-FID-08 and GATE-CHRON-09. In each case the fixture is one, it is run once per milestone, and each gate is compared with the threshold in its own row.
40.4 Kill gates
Every kill gate of the plan, once. "Decided" is the milestone at whose exit the decision is recorded as an ADR; for a gate whose trigger is a pilot, it is the earliest milestone at which the work package can be funded. "Owner" is the subsection that governs the trigger and the fallback; a second subsection in parentheses is a consumer that states the same gate from its side.
Foundations and the mathematical spine (§12 to §15, §33).
| Kill gate | Trigger, in brief | Fallback, in brief | Decided | Owner (consumer) |
|---|---|---|---|---|
| ✖ KILL-FSIM | INT-FSIM-01 cannot pass within two weeks of M0 effort, or its cold check exceeds the machine envelope, or upstream breakage exceeds 20% of working days in any four-week window (BET-04) | (a) One pinned FrankenSim worker process per device exchanging whole jobs through the airlock traits. (b) Only if (a) fails INT-FSIM-18 or the pin can no longer be built: lift the minimal referee set with provenance headers and golden tests, and state lift-only | M0, then rolling | §33.8 |
| ✖ KILL-FAMILYCERT | At the partial ten-fold gate no family certificate has decided a cell that the generic comparator of D-17 leaves undecided at equal cost | Mission answers come from the generic solvers alone and still ship in the bundle format; the specialized projections are removed | M3 | §12.6 |
| ✖ KILL-LEMMA | GATE-LEMMA-01 below 50% after one repair cycle | Certificates become exact-rational randomized identity tests recorded as Tested; the word certificate leaves kernel manifests |
M5 | §12.6 |
| ✖ KILL-REFLECT | GATE-LEMMA-05 fails after one repair cycle, or no reflector's closure avoids the blocked modules | Instance certificates stay Certified; reflection is parked in Appendix C |
M5 | §12.6 |
| ✖ KILL-MARROW-BLOCKS | GATE-MARROW-04 fails after one repair cycle, or exact field arithmetic for n ≤ 12 exceeds its bit budget | Equivariant layers by Reynolds projection in f64 with an idempotence test, classed Tested; the free-parameter count is read from the projection's rank |
M4 | §13.10 |
| ✖ KILL-MARROW-GUARD | Fallback rate above 10⁻² on the contact battery on either GPU backend, or the exact path cannot be made bit-identical across backends | Strict predicates are evaluated exactly only on strict and the referee; GPU tiers mark worlds that came within E of a boundary and the sampled referee re-runs them |
M2 | §13.10 |
| ✖ KILL-SKEL-ALIAS | Stage 8 returns a witness that a hand-built policy defeats, or decides fewer than half of the planted cases within budget | Stage 8 becomes an advisory report built on A-14 coverage and refuses nothing | M3 | §14.15 |
| ✖ KILL-SKEL-PORT | PO-SKEL-04 fails, or the tree-operator route of §16 is not funded (KILL-TREEOP) | No limb port packets; all dynamics go through the whole-model path | M5 | §14.15 |
| ✖ KILL-SKEL-SEXPR | INV-SKEL-04 cannot be held after one repair cycle | The S-expression view is removed; JSON is the only syntax | M1 | §14.15 |
| ✖ KILL-SKEL-SUBST | A reused product differs from its recompiled value after one repair cycle, or leaf-local reuse saves less than 20% of compile time on the archetypes | Every substitution is global; the memo graph keeps subterm reuse by content hash only | M1 | §14.15 |
| ✖ KILL-SINEW-AGE | The ageing law fails its pilot, or no card with ageing coefficients better than assumed exists when the lifecycle work of §31 is funded |
f_Q and f_R are user-set constants per scenario, with no evolution law | M6, before the lifecycle work package | §15.14 |
| ✖ KILL-SINEW-ROTOR | The hover known answer or the port balance fails, or the hybrid variant has no consumer when frontier physics is funded | The rotor port and the variant are withdrawn | M6 | §15.14 |
| ✖ KILL-SINEW-ROWS | With stiction rows on, the fast-tier solve needs more than 1.5 times the Newton iterations of the smooth-friction model on the contact battery, or throughput falls by more than 20%, after one repair cycle | Throughput tiers apply regularized friction as a force; the rows stay on the referee and strict; smooth-model results carry a flag and the fidelity ledger measures the gap |
M2 | §15.14 |
The body (§16 to §21, §35, §36).
| Kill gate | Trigger, in brief | Fallback, in brief | Decided | Owner (consumer) |
|---|---|---|---|---|
| ✖ KILL-SHADOW | GATE-FID-07 fails on cost or on coverage after one repair cycle, or no planted defect is detected | The referee runs at promotion time only, plus an offline audit of sampled snapshots after each run | M3 | §16.17 |
| ✖ KILL-TREEOP | Whole-step gain below 1.15 at 64 degrees of freedom on the M2 profile | The dense factorization everywhere and a cap of 64 degrees of freedom | M5 | §16.6 |
| ✖ KILL-VARIATIONAL | The implicit solve costs more than twice a semi-implicit step on batch-cpu, or the articulated form fails its momentum row after one repair cycle |
The free-body step is kept as a known-answer oracle; every rollout uses the default integrator | M5 | §16.7 |
| ✖ KILL-FAMILYLANE | Measured whole-step gain below 1.15 on the mixed workload, or overhead h ≥ f·(1 − 1/r) | The general masked lane only, with shared structure tables kept | M4 | §17.6 |
| ✖ KILL-FDGRAD | The pilot's falsifier fires (variance ratio below 2 at every horizon of 50 steps or more, or sign agreement below 70%), or no end point is confirmed by a specialist | Rank-based search (CMA-ES, racing); the stencil is kept as a sensitivity report for A-16 | M4; the pilot runs before funding | §17.13 (§28.8) |
| ✖ KILL-PHYLUM | GATE-PHYLUM-03 fails: below 0.5 of homogeneous throughput on 512 designs, more than eight buckets, or arm B covers at least 95% of the mutation corpus and is faster | Per-family templates become the engine; cohorts are formed by exact tree with per-design parameter tables; the table-driven path remains for admission and preview on batch-cpu |
M2 | §17.19 |
| ✖ KILL-QUOTIENT | One false quotient survives a repair cycle, or digest classes save less than 5% of dispatches on the campaign corpus | Orbit representatives only; the digest is kept as a cache key with no claim | M3 | §17.19 |
| ✖ KILL-CONTACT | GATE-FID-01 fails on slip or creep after parameter mapping and one repair cycle | CL-2 becomes the default at a published lower throughput; if that also fails, locomotion claims are restricted to the referee tier and the fast tiers are labeled exploratory | M2 | §18.17 |
| ✖ KILL-FILM | On the wet-floor battery the film law changes fewer than 10% of episode outcomes against a constant-coefficient patch, or adds more than 5% to step time | Static condition cards on the lockstep tiers; the law is kept on the transactional profiles for audits | M3 | §18.8 |
| ✖ KILL-ADVECT | The advected film fails its mass gate after one repair cycle, or costs more than 15% of the step, or design rankings on the spill battery agree with static patches at a rank correlation of 0.95 or above | Static film-friction patches under the law of §18; advection is not built | M6, with GATE-HAB-07 | §19.10.7 |
| ✖ KILL-HARDCONTACT | GATE-TRAC-09 fails after one repair cycle | Fixed-iteration island solvers on batch-cpu with a residual flag; CL-H remains the referee's specification and a model-form arm under strict |
M5 | §18.5 |
| ✖ KILL-MESHGPU | Mesh traversal on a GPU breaks fixed launch shapes or adds more than 15% to the step | GPUs see thin geometry as analytic primitives only; meshes stay on the CPU tiers | M3 at the earliest, before the work package | §18.3 |
| ✖ KILL-RESPONSE | Mode guards reroute more than half the columns on battery states | Full solves per query | M4 | §18.5 |
| ✖ KILL-SOIL | GATE-TRAC-08 fails after one repair cycle, or no soil card can be sourced with provenance | A rigid floor with rolling resistance and a drag card labeled assumed; soft-ground results labeled exploratory |
M4 | §18.17 |
| ✖ KILL-BANK-BREADTH | Held-out success does not rise with scene breadth beyond its confidence sequence | The bank serves evaluation, qualification, replay, clearance and retrofit search and large scenes; training keeps per-card resident sets | M3 | §19.15 |
| ✖ KILL-DRESSING | A dressing item breaks the fixed launch shape or the determinism class of a batch, adds more than 25% to step cost, or exposes no failure class beyond the proxies on the M5 battery | Structural proxies and static clutter only | M5 | §19.7 |
| ✖ KILL-FCLEAR | One false witness or false cut survives a repair cycle, or more than 30% of doorway queries on the archetype battery stay unresolved after refinement |
The route-graph traversability check for a nominal footprint, labeled heuristic | M3 | §19.11 |
| ✖ KILL-INGEST | GATE-HAB-03 cannot pass with a scale label of witnessed or better after one repair cycle |
The place is authored in the interior grammar from a tape-measure survey, and the pack says it is a proxy | M5 | §19.13 |
| ✖ KILL-LIVING | The proxies reproduce at least 90% of the full-model failures (GATE-HAB-09), or an island costs more than 181 rigid worlds at 5% activity with no route to less | The Solid tier and the Frontier proxies are the product; coupled islands are not built; reports say deformable matter is represented by proxy | M6, before the island work package | §19.10 |
| ✖ KILL-POOL | Measured deduplication on the archetype battery below 1.5 | Dense per-variant fields behind the same directory interface | M2 | §19.15 |
| ✖ KILL-PROXY | The proxy pilot's falsifier fires (Solid proxies already reproduce the failures of the articulated ones), or the cost exceeds its target with no route to less | Solid proxies in training batches; articulated proxies in evaluation batches only, or not at all | M6 | §19.10 |
| ✖ KILL-RETROFIT | On the home battery kits flip fewer than 30% of the failures attributed to a building feature, or more than 10% of kit verdicts reverse on the referee | The catalog remains the edit vocabulary of Nemesis; the search verb is withdrawn | M4 | §19.12 |
| ✖ KILL-SLOSH | The frequency gate fails after one repair cycle, or sprung masses change no ranking on the carried-container battery | Rigid ballast, with a spill metric computed from payload acceleration | M6 | §19.10 |
| ✖ KILL-ALIAS | One false witness from the searched lane | Structural, enumerated and declared witnesses only | M3 | §20.21 |
| ✖ KILL-EXPOSURE | Exposure integration costs more than 25% of the ray stage, or changes no mask statistic beyond noise | Midpoint sampling | M2 | §20.21 |
| ✖ KILL-SCHED | The race check misses a planted race | The fixed total order, with no enumeration | M2 | §20.21 |
| ✖ KILL-BUCKET | More than eight buckets are needed to hold Ω₃ ≤ 2 on the reference family corpus, or the mixed batch of GATE-SPARK-10 runs below 0.5 of the harmonic mean of its homogeneous rates after one optimization pass | At most nine padded per-family templates, each a homogeneous environment, scheduled in turn; parameter variants are unaffected | M2 | §21.11 |
| ✖ KILL-D1 | GATE-SPARK-01 or GATE-SPARK-02 shows that a device family cannot hold bit equality with batch-cpu for the floating kernels of the step |
That family is class D2 for itself and D3 against others, with the decision-level test of §35.4; a teleported world is a tolerance replay; cross-family comparisons are unpaired; the replay claim of §6 and §29 is reworded | M2 | §21.15 |
| ✖ KILL-FLEET | The pilot shows g < 1/3, or after one repair cycle the paired lower bound of campaign speedup at GATE-SPARK-13 is below 1.3 against the better single machine | The machines run standalone; jobs are assigned by the role table; the seeds-only rule stays | M4 | §21.17 |
| ✖ KILL-KIR | At M2 the derivation toolchain cannot express or emit more than 20% of the kernel arithmetic, or emitted kernels miss BET-01's speed bound after one optimization pass | Arithmetic is hand-written in Rust and the dialect and bound by differential tests; certificates fall back per KILL-LEMMA | M2 | §21.6 |
| ✖ KILL-MEGA | In the one-week fusion pilot (8,192 worlds, digests unchanged) the paired lower bound on the whole step is below 2.0 | The staged step plan, which is the design of record | M8, before the work package | §21.18 |
| ✖ KILL-METAL | GATE-SPARK-04 fails after one optimization pass, or the Metal backend cannot hold run-to-run determinism | Metal becomes a development and replay tier; CUDA is the training tier; the Mac trains on batch-cpu |
M2 | §21.24 |
| ✖ KILL-SPECIALIZE | In the pilot the specialized kernel is below 1.2 times the data-driven one on the whole step, or takes more than 60 s to compile; or the M2 profile shows a specializable share under one third | Data-driven kernels only; derivation stays for correctness, certificates and the derivative kernels of CPU solvers | M4 | §21.18 (§17.9) |
| ✖ KILL-PARITY | At M2 exit, after one profile-guided optimization pass, the paired lower bound of a physics row (1, 7 or 8 of §36.3) is below 0.33 of the incumbent on the same card | Feature work on the device tier stops until the row is inside tolerance; the arithmetic of §2 and §39 is redone with measured rates before the partial gate, where shipping the layer is decided. Between 0.33 and 0.67: a recorded defect, one further pass, a disclosure on every Performance claim | M2 | §36.16 |
| ✖ KILL-SHARD | After one optimization pass the paired lower bound of strong scaling at equal task quality is below 1.6 | No further sharding work is funded; the two cards run as independent job lanes; the tolerance of 1.25 still applies where synchronous sharding is used | M2 | §36.6 |
| Kill gate | Trigger, in brief | Fallback, in brief | Decided | Owner (consumer) |
|---|---|---|---|---|
| ✖ KILL-BASELINE | GATE-REFLEX-02 fails (BET-06) | Baseline synthesis is limited to the morphology classes that pass; others report not-synthesizable and route to training |
M3 | §22.18 |
| ✖ KILL-ENERGY | An exceedance under the premises survives one repair cycle at GATE-SHIELD-01 | The claim is withdrawn; the monitor remains as an alarm of class Estimated |
M4 | §22.18 |
| ✖ KILL-GAIT | GATE-GAIT-03 fails | Orbits serve stability diagnostics and warm starts only; the atlas keeps supplying clocks and reward references; no design is ranked by an orbit | M4 | §22.18 |
| ✖ KILL-MPC | GATE-REFLEX-06 fails after one repair cycle | The sampling controller is kept as a single-world CPU debugging aid; demonstrations come from the baseline and from specialists | M4 | §22.18 |
| ✖ KILL-RESIDUAL | The pilot's falsifier holds, or at M4 the residual rung needs more than 50% of a specialist's steps on the corpus | The residual rung is removed; the baseline remains a behaviour-cloning warm start | M4 | §22.18 |
| ✖ KILL-SHIELD | GATE-SHIELD-03 fails after one repair cycle | The energy tier stays; barrier rows become reward penalties and alarms; nothing is called a shield | M4 | §22.18 |
| ✖ KILL-SKILL | GATE-REFLEX-09 fails | Keep the exact layer and its witnesses; drop the learned residual | M8 | §22.18 |
| ✖ KILL-TUBE | GATE-SHIELD-05 fails, or the pilot's falsifier holds | No tables are built; reduced-order barriers cover those subsystems | M8 | §22.18 |
| ✖ KILL-ALTALGO | For any one of the other algorithms of §23.22, its pilot's falsifier holds | That algorithm is not built; PPO under the rules of §23.6 remains the trainer | M4 at the earliest, per algorithm, before funding | §23.23 |
| ✖ KILL-DISTILL | Students stay below 70% of their teachers' requirement pass rate after one repair cycle | Distillation is limited to the privileged-teacher case; warm starts come from behaviour cloning only | M4 | §23.23 |
| ✖ KILL-EQUIV | GATE-CORTEX-03 fails (BET-07) | Symmetry is used for augmentation and metamorphic testing only | M4 | §23.23 |
| ✖ KILL-FAMILY | At GATE-CORTEX-11, return with no adaptation below 70% of specialists on more than half of the held-out set and fine-tuning above 20% of specialist steps; or the pilot's falsifier holds | No family policy: specialists with inheritance from the nearest parent, and the baseline screens | M4 | §23.23 |
| ✖ KILL-GATREE | GATE-CORTEX-17 fails | The plain morphology transformer remains; fs-ga features are not used in policies |
M8 | §23.23 |
| ✖ KILL-GYMADAPT | GATE-CORTEX-16 fails | Rival stacks drive the environment through the job interface of §32 in whole rollouts, and the ten-fold test records the added latency in its phase ledger | M3 | §23.23 |
| ✖ KILL-INHERIT | Median parameter-edit cost above 60% of from-scratch steps, or the inherited arm more than 5% worse in over 20% of edits | Every child trains from the class prior or from scratch; the mapping table is kept for loading policies | M4 | §23.23 |
| ✖ KILL-LEARNKERN | GATE-CORTEX-02 fails after one repair cycle, or GATE-CORTEX-05 is missed by more than two times after one optimization pass | The forward pass stays on the device; rollout storage is read back once per rollout and the learner runs on FrankenTorch on the CPU, with the lost throughput disclosed | M2 | §23.23 |
| ✖ KILL-SPEC-REWARD | In the training pilot the arm with the added requirement term does not improve success over the shaped reward across five seeds | Requirements stay acceptance metrics and search scores only; the added-term option leaves the task schema; margin-only training is offered only if it reaches 80% of the shaped arm's success | M3 | §24.17 |
| ✖ KILL-AUGUR-ALIAS | Generated alias witnesses are contradicted by a permitted probe in more than 5% of audited cases | Witnesses are labelled experiment-specific only; universal observability claims are refused | M3 | §25.27 |
| ✖ KILL-AUGUR-CUTS | One false cut on the frozen catalog, or less than 70% of evaluation cost saved; or one quotient merge with different replayed traces | Cuts off: exhaustive evaluation with the static screen as an ordering heuristic. Quotient off: memoize on full model identity only | M4 | §25.27 |
| ✖ KILL-AUGUR-DOMINANCE | One mislabelled joint outcome, or a conventional reachability tool closes the same cells at similar cost | Paired comparison by replay under the studies of §24; the product lowering is kept only as the rule for space-indexed shared inputs | M4 | §25.27 |
| ✖ KILL-AUGUR-FACILITY | The acceptance fixture fails to discriminate two strategies, or misses a seeded failure after one repair cycle | Single-robot missions with priced world edits from §19; multi-robot composition is parked | M8 | §25.27 |
| ✖ KILL-AUGUR-FALSECERT | One certificate accepted by frob-verify is shown false within its scope |
The procedure of §25.5.5; if the cause is the rule and not an implementation defect, the proof kind is removed and its cells become Tested |
Standing, from M1 | §25.27 |
| ✖ KILL-AUGUR-LABELS | Deriving command sets costs more than labelling every part, or an inner set contains a failing command | The query is kept for supplied sets through a conventional solver; extraction from contact is parked | M4 | §25.27 |
| ✖ KILL-AUGUR-PHASE | No proposed gait is admitted by a full rollout, or trajectory optimization finds every proposed gait at lower total cost | A-09 remains a forward diagnostic; the inverse query and the atlas are parked | M6 | §25.27 |
| ✖ KILL-AUGUR-PROBE | The generator never beats the programmed expert plus direct measurement at matched correctness on the coupled-layout experiment, or issues one false lower bound | experiment.suggest ships the expert grid and the direct measurement; the experiment grammar is parked |
M3 | §25.27 |
| ✖ KILL-AUGUR-REGION | The pilot of §25.6 meets its falsifier (more than 90% undecided in the best arm, or more than 95% of decided volume from one monotone bound), or GATE-AUGUR-09 fails after one repair cycle | Region certificates are removed; family answers use dual witnesses, monotone bounds and pointwise static analyses; untested regions are reported as sample coverage, Estimated |
M3 | §25.27 |
| ✖ KILL-AUGUR-REUSE | One incorrectly inherited verdict from an implication rule | That rule is removed; reuse falls back to the dependency-keyed memo graph of §28 | Standing, from M3 | §25.27 |
| ✖ KILL-AUGUR-SEPARATE | Minimization changes the failure mechanism in more than 20% of planted cases, or a conventional scenario tool with the same generator matches the result at equal cost | Ship the Nemesis search and minimization without the design-pair query; keep counterexamples as regressions | M3 | §25.27 |
| ✖ KILL-AUGUR-SYMEVENT | The identity cannot separate the symmetric fixture from its mutations, or amortization shows no reduction in decision time on either GPU | Per-event finite differences; symmetry is used only on smooth kernels | M6 | §25.27 |
| ✖ KILL-AUGUR-TIE | On the strata of the M3 partial gate that use §25, a short robust program over a conventional solver reaches the same checked scope at comparable turnaround | Ship that program behind the same verbs, schema and checker; retire any claim of exclusive expressivity on those families; spend the research budget on the first mission the program cannot resolve | M3 | §25.27 |
| ✖ KILL-AUGUR-TRANSPORT | The interface arm needs as many target trials as the conditioned policy, or reports coverage where the referee shows a fall | Family policies and inheritance of §23; the wrench-coverage test is kept as a static analysis | M8 | §25.27 |
| ✖ KILL-SYNTH-CODESIGN | The lane mis-ranks more than 20% of top designs against the referee, or prunes one independently feasible design | Restrict to the closure analysis A-10 for actuator, battery and compute selection | M4 | §25.27 |
| ✖ KILL-SYNTH-CONT | More than 0.1% lost paths, an unflagged lost path, or a missed known count | The exact lane plus multi-start CPU recovery; every result labelled Partial |
M8 | §25.27 |
| ✖ KILL-SYNTH-LINKAGE | A certified linkage binds or changes circuit on the referee, or more than 25% of template instances exceed the caps | Multi-start numerical optimization of linkage dimensions with the same circuit and clearance check, classed Tested |
M4 | §25.27 |
| ✖ KILL-SYNTH-TRAJOPT | GATE-AUGUR-18 fails, or solves exceed the budget at 12 degrees of freedom | Continuous optimization of §28 with the baseline controller in the inner loop | M4 | §25.27 |
| ✖ KILL-MCW | On unplanted failures fewer than half of shrunk worlds have at most three edits, or fewer than 90% replay | Nemesis ships full failing worlds with replay and single-edit contrasts ranked by margin; the format stays | M3 | §26.15 |
| ✖ KILL-NEMESIS | GATE-NEMESIS-02 fails after one repair cycle | The search methods are removed; Nemesis keeps the legality profile, the oracle, the guard and shrinking, applied to failures that card randomization finds | M3 | §26.15 |
| ✖ KILL-RARE | In the exploration pilot the gain is below 10 times at 10⁻⁵, or the coverage of any interval offered as a bound is below 85%, or a planted mode is missed in more than 20% of repetitions | Crude nominal sampling with the binomial bound alone; splitting is removed; tilting is kept only inside nemesis.search |
M3 | §26.15 |
| ✖ KILL-AUTOPSY | GATE-AUTOPSY-03 fails after one repair cycle: planted-cause accuracy below 90%, or the top factor changes in more than 30% of cases at 10⁻⁷ | Single-factor paired re-runs from the episode start, with first-anomaly ordering labelled Estimated; coalitions and Shapley summaries are removed |
M3 | §27.17 |
| ✖ KILL-ATLAS | The A-26 pilot of §28.4 fails | A-26 is a descriptive report with no validity label | M4 | §28.23 |
| ✖ KILL-LADDER | GATE-ATEL-08 fails after one repair cycle | The fixed halving table is the allocation rule; the audit lane is kept as measurement | M4 | §28.23 |
| ✖ KILL-RANK | GATE-ATEL-07 fails for every morphology class tested | R1 is uninformative everywhere and every candidate that survives static analysis is scored on the higher rung; the ladder's claim shrinks to stopping and elimination among trained candidates; §39 records the lost factor |
M4 | §28.23 (§16.17) |
| ✖ KILL-REUSE | Any unsafe reuse in GATE-ATEL-11, or grade 3 saves less than a fifth of the recheck cost grade 2 leaves | Grades 1 and 2 only | M4 | §28.23 |
| ✖ KILL-STATIC | GATE-ATEL-01 fails (BET-05) | design check verdicts are downgraded to advisory lints and the pruning claim is withdrawn |
M3 | §28.23 |
| ✖ KILL-VOI | GATE-ATEL-15 fails | Value of information is a stop rule only; experiment.suggest lists proposals unranked by value |
M4 | §28.23 |
The record, the world and the surface (§29 to §32).
| Kill gate | Trigger, in brief | Fallback, in brief | Decided | Owner (consumer) |
|---|---|---|---|---|
| ✖ KILL-DR | ρ_ep below 0.7 on 200 paired addresses in every stratum tested, or GATE-CHRON-09 coverage fails after one repair cycle | Promotion reports the label only, from referee episodes alone; the ledger keeps recording ρ_ep | M3 | §29.20 (§16.17) |
| ✖ KILL-ASBUILT | GATE-GROUND-08 fails | Scans are not ingested; as-built data enters as scalar bench measurements, each a direct measurement of one card field | M5 | §30.22 |
| ✖ KILL-BAND | GATE-GROUND-06 or -07 fails | Bands are withdrawn; reports print reality: no-claim with the raw residual table |
M5 | §30.22 |
| ✖ KILL-CLOCK | GATE-GROUND-02 or -05 fails | Real logs are scored on time-free metrics only; no crossing time, latency or delay is reported | M5 | §30.22 |
| ✖ KILL-GROUND | GATE-GROUND-04 fails after one repair cycle | No identification; Ground keeps admission, clocks, frozen predictions and bands on direct measurements with prior cards | M5 | §30.22 |
| ✖ KILL-KIT | GATE-GROUND-09 fails | The kit ships as an archive of inputs, records and hashes, with no reproduction claim | M5 | §30.22 |
| ✖ KILL-FAB | GATE-FOUNDRY-07 fails | Manufacturability findings become advisory lints; a packet records no manufacturability pass | M5 | §31.19 |
| ✖ KILL-FIRMWARE | GATE-FOUNDRY-11 fails | Controller parameters, Q formats and the test-vector manifest only; no code | M8 | §31.19 |
| ✖ KILL-LIFECYCLE | GATE-FOUNDRY-12 fails | Aged model variants at hand-specified wear states, with no time axis and no compression claim | M6 | §31.19 |
| ✖ KILL-LOADS | GATE-FOUNDRY-02 fails after one repair cycle | Load cases are declared by hand from statics with a stated dynamic factor; spectra and fatigue read no-claim |
M5 | §31.19 |
| ✖ KILL-PACKET | GATE-FOUNDRY-09 or -10 fails after one repair cycle | Parts list, mass properties and STL only; STEP and harness deferred | M5 | §31.19 |
| ✖ KILL-TOLERANCE | GATE-FOUNDRY-08 fails, or band-extreme checks fail on more than a fifth of features in the pilot | Worst-case boxes per interface | M5 | §31.19 |
| ✖ KILL-TOPOPT | GATE-FOUNDRY-05 fails: saving under 7%, no convergence, or over budget | Beam-rung sizing supplies mass and inertia feedback; three-dimensional optimization becomes an offline option or is dropped; A-15 is unaffected | M5 | §31.19 |
| ✖ KILL-MCP | INT-FMCP-01 cannot pass within the M0 budget after FD-FMCP-01 and FD-ASUP-01 have been attempted | Fallback 1: frob-mcp as its own workspace, talking to frobd over a local socket in newline-delimited JSON. Fallback 2: agents use the CLI, which is complete on its own (§33.13, §40.7) |
M0; re-read at M1 with the M1 verbs | §32.21 |
| ✖ KILL-MCPTASKS | The pilot of §32.12.6 fails, or the protocol extension changes incompatibly | Job handles only | M3 | §32.21 |
| ✖ KILL-PREEMPT | A resumed job's digest differs, or measured resume cost exceeds the quantum | Run to completion with the slot reserve only | M3 | §32.21 |
| ✖ KILL-SLOT | Any digest difference under co-tenancy, or GATE-TETHER-09's throughput or step-time limits fail after one optimization pass | frobd --dispatch=per-job: one environment per job, queued |
M3 | §32.21 (§21.11) |
| ✖ KILL-SOLVE | The ceiling of §32.6.2 is under 1.4-fold, or agents with solve.run do no better than agents driving the verbs |
The prompts | M4 | §32.21 |
| ✖ KILL-TUI | FrankenTUI cannot be admitted with one asupersync package, or the snapshot tests cannot be made stable | No dashboard; job.list and session.show carry the same numbers |
M3 | §32.21 |
The seven kill gates of the ten-fold test are defined in §39.18 and summarized in §40.5.
40.5 Program gates
Program gates decide whether the program continues as planned. They do not belong to a subsystem.
| Gate | When | Measurement and threshold | If it is not met |
|---|---|---|---|
| The schedule gate (BET-12) | End of M1 | The elapsed time of M0 plus M1 against the planning estimate of §43, with the cause of any slip attributed in the M1 exit review. Not met if the two milestones took more than 1.5 times their estimate because a sibling lacked a primitive, its upstream work item had not landed and no interim posture of Appendix F applied | The program pauses for a written re-plan before M2 starts |
| GATE-TENFOLD-01 (the parity-baseline gate) | M0 | The rival audit and the incumbent phases that need no agent, measured on trj: the M0 rows of GATE-SPARK-21 (§39.11) |
M0 does not exit. The arithmetic of §2 stays a HYPOTHESIS and no work package is funded as a speed lever |
| GATE-TENFOLD-02 | M1 | The incumbent design loop with the common agent, with closed phase ledgers (§39.11) | The same. The table of §2.2 may not be cited as a denominator |
| GATE-TENFOLD-09 | M1, then every exit | Ceiling before speed, program-wide (§39.8) | The speed comparison is refused; the work package loses its speed justification (KILL-TENFOLD-LEVER) |
| GATE-TENFOLD-03, -04, -05 | M3 and M7, before a sealed suite is opened | The harness known answers; the freeze and seal order with the pre-analysis; adjudicator acceptance (§39.18) | The suite is not opened |
| GATE-TENFOLD-06 (the partial ten-fold gate) | M3 | On legged-quad and wheeled, and on envelope and sensing where ready: the pooled ratio with its interval, verdict, completion, coverage, tie test and phase ledgers for arms A, B and C; the outcome rules of §39.10 applied. Met when the record exists, whatever the ratio |
M3 does not exit |
| GATE-TENFOLD-07 (the tournament) | M7 | The same record for every stratum run, on fresh sealed families with every pin frozen, published with its ledgers and its kit. Met when the report is published, whatever it says | M7 does not exit, and no comparative claim is made |
| GATE-TENFOLD-08 | M7 | The replication kit recomputes every published number and re-runs a sampled pair per stratum (§39.14) | The result is labelled unreplicated and the word "ten-fold" is not used |
| GATE-TENFOLD-10 | M3, before the partial gate | The pre-analysis known answers of §39.20 (10.081, 9.677, 1.8215, 0.78568; the counts 32, 46, 49 and 182); the contrast test certifies ten-fold in none of 2,000 rare-tail campaigns, and the percentile bootstrap, run as the negative control, certifies it in 78.6% ± 3 points | The suite is not opened; no population wording is used |
| GATE-TENFOLD-11 | M3 for the partial gate; M7 | The rival audit of §39.21 is complete before sealing: each arm's frozen configuration reproduces its development-fixture figure within 10%; the sign-off and the pack digest are recorded | The suite is not sealed; a changed digest voids the arm |
| GATE-TENFOLD-12 | M7 | Suite hygiene (§39.21): an easy win and an unresolved answer in every stratum; every planted mutation rejected; zero missed withdrawals for a scoped claim | The affected stratum is descriptive |
| GATE-TENFOLD-13 | M3; M7 for the sealed suite | The recovery ratios r_T and r_C with 95% intervals for every stratum that has a ratio; the three phase ablations on both briefs, each inside its bound; the one-receipt pipeline for arm W built first (§39.22) | No engine-internal work package beyond M2 is funded |
| Kill gate of the ten-fold test | In brief | Decided |
|---|---|---|
| ✖ KILL-TENFOLD-SPEED | A measured ratio below 3 on a confirmatory cell, or a futility stop, withdraws the speed claim for that class; the product is described by what does not depend on speed | M3 for the classes run; M7 |
| ✖ KILL-TENFOLD-TIE | The ablation arm reaches the same accepted scope within a factor of 1.5, or the composed incumbent's recovery ratio is at least 0.8 on elapsed time and on compute (§39.22): say so and ship the layer over that engine for that stratum | M3; M7 |
| ✖ KILL-TENFOLD-CERT | One false certificate disqualifies the arm from the scoped claim | Standing, from M3 |
| ✖ KILL-TENFOLD-LEAK | Any leak from sealed confirmation worlds voids the affected cells, retires their families and, if unbounded, voids the gate | Standing, from M3 |
| ✖ KILL-TENFOLD-LEVER | A mechanism whose removable cost is under 10% of the measured loop is not funded as a speed lever | M1; M2 |
| ✖ KILL-TENFOLD-ADJ | No neutral simulator passes acceptance for a stratum: cross-home adjudication, labelled; failing that, the stratum is descriptive | M3; M7 |
| ✖ KILL-TENFOLD-REACH | A cell whose pre-analysis cannot reach its verdicts is opened as descriptive | M3; M7 |
Bets and the gates that decide them. Each bet of §4 is decided by a recorded gate. A bet with no kill gate has its consequence written in §4.
| Bet | Deciding gates | Kill gate | At |
|---|---|---|---|
| BET-01 The algebra pays for itself | GATE-SPARK-03 | KILL-KIR | M2 |
| BET-02 One source, three backends | GATE-SPARK-01, -02, -15, -16 | KILL-D1 | M0, M2 |
| BET-03 Convex compliant contact | GATE-FID-01, GATE-FID-05 | KILL-CONTACT | M2, M3 |
| BET-04 FrankenSim by path | INT-FSIM-01, INT-TOOLCHAIN-01 | KILL-FSIM | M0, then rolling |
| BET-05 Static analysis | GATE-ATEL-01 | KILL-STATIC | M3 |
| BET-06 Baseline controller | GATE-REFLEX-02 | KILL-BASELINE | M3 |
| BET-07 Symmetry and sample efficiency | GATE-CORTEX-03 | KILL-EQUIV | M4 |
| BET-08 Single precision | GATE-SPARK-05, -18 | None; the fallback of §35 | M2 |
| BET-09 Metal | GATE-SPARK-04 | KILL-METAL | M2 |
| BET-10 Structure for agents | GATE-ATEL-03, and arm B of GATE-TENFOLD-06 | None; the surface is reduced to the verbs that showed an effect | M3, M4 |
| BET-11 Proof-carrying kernels | GATE-LEMMA-01 | KILL-LEMMA | M5 |
| BET-12 Narrow purity | The schedule gate | A written re-plan | M1 |
| BET-13 Ten-fold on the sealed suite | GATE-TENFOLD-06, -07 | KILL-TENFOLD-SPEED | M3, M7 |
| BET-14 The mechanisms need this engine | Arm C of GATE-TENFOLD-06, -07; the recovery ratio of GATE-TENFOLD-13 | KILL-TENFOLD-TIE; KILL-AUGUR-TIE on the family strata | M3, M7 |
| BET-15 Family policies | GATE-CORTEX-11 | KILL-FAMILY | M4 |
| BET-16 Inheritance | GATE-CORTEX-13 | KILL-INHERIT | M4 |
| BET-17 Rank agreement between rungs | GATE-REFLEX-04, GATE-CORTEX-12, GATE-ATEL-07 | KILL-RANK | M3, M4 |
| BET-18 Mixed-topology batches | GATE-PHYLUM-02, -03, GATE-SPARK-10 | KILL-PHYLUM, KILL-BUCKET | M2 |
| BET-19 Mission queries | GATE-AUGUR-01 to -07, GATE-AUGUR-15, and the envelope cell of GATE-TENFOLD-06 |
KILL-AUGUR-TIE, KILL-AUGUR-FALSECERT | M1, M3, M4 |
| BET-20 Region certificates | GATE-AUGUR-09 | KILL-AUGUR-REGION | M3 |
| BET-21 Blinded qualification | GATE-QUAL-01, -02 | None; fixed-n exact confirmation with a cap on submissions | M3 |
| BET-22 Minimal counterexample worlds | GATE-NEMESIS-02, -03 | KILL-NEMESIS, KILL-MCW | M3 |
| BET-23 Interventional autopsy | GATE-AUTOPSY-03, -08 | KILL-AUTOPSY | M3, M4 |
| BET-24 A requirement language | GATE-ARENA-03, -09, GATE-CORTEX-10 | KILL-SPEC-REWARD | M1, M3 |
| BET-25 An energy-budget safety tier | GATE-SHIELD-01, -03 | KILL-ENERGY, KILL-SHIELD | M3, M4 |
| BET-26 Gait orbits as screening | GATE-GAIT-01, -03 | KILL-GAIT | M4 |
| BET-27 A sampling controller as fallback | GATE-REFLEX-06, GATE-CORTEX-14 | KILL-MPC, KILL-DISTILL | M4 |
| BET-28 Calibration bands | GATE-GROUND-06, -07, -10 | KILL-BAND | M5 |
| BET-29 Generative structure | GATE-FOUNDRY-05, -08, -09 | KILL-TOPOPT, KILL-TOLERANCE, KILL-PACKET | M5 |
| BET-30 Equivariance under the observation-preserving subgroup | GATE-MARROW-03, -04, GATE-CORTEX-03, -17 | KILL-EQUIV, KILL-MARROW-BLOCKS, KILL-GATREE | M4, M8 |
| BET-31 Campaign quotienting | GATE-PHYLUM-01 | KILL-QUOTIENT | M3 |
| BET-32 Rare-failure bounds, for refutation and for estimates once failures are observed | GATE-NEMESIS-04, -05 | KILL-RARE | M3 |
| BET-33 Revalidation | GATE-ATEL-11, GATE-AUGUR-12, GATE-PHYLUM-05 | KILL-REUSE, KILL-AUGUR-REUSE | M3, M4 |
| BET-34 Referee coverage | GATE-FID-03, -07 | KILL-SHADOW | M2, M3 |
| BET-35 Two machines | GATE-SPARK-13 | KILL-FLEET | M4 |
| BET-36 Living worlds | GATE-TRAC-05, GATE-HAB-06, -07 | KILL-FILM, KILL-ADVECT, KILL-LIVING | M3, M6 |
| BET-37 The building is a design variable | GATE-HAB-11 | KILL-RETROFIT | M3, M4 |
40.6 Gates by milestone exit
What each milestone must have on record before it exits. A gate that appears under two milestones has a part due at each, as its row in §40.3 or §40.4 states. Recurring gates (rule 8 of §40.1) are listed where they first run. The last column repeats the exit condition of the milestone skeleton (§43); the columns before it are the full list.
| Exit | Admission gates first needed | Convergence gates with a part due | Kill gates decided | Program gates | The exit is defined by (§43) |
|---|---|---|---|---|---|
| M0 | INT-TOOLCHAIN-01; INT-FSIM-01 to -11, -18; INT-ASUP-01; INT-FSQL-01; INT-FT-01, -02; INT-CUDA-01; INT-FSYM-01, -02; INT-FMCP-01; INT-FNP-01, -02 | GATE-LEMMA-00, -06; GATE-MARROW-01; GATE-SPARK-00, -01, -07, -08, -21; GATE-TETHER-03; GATE-WS-01, -04 | KILL-FSIM; KILL-MCP | GATE-TENFOLD-01 | The admission gates; GATE-MARROW-01; GATE-SPARK-00, -01; GATE-LEMMA-00; GATE-TETHER-03; GATE-TENFOLD-01 |
| M1 | INT-FSIM-07, -16; INT-FSQL-02; INT-FMCP-01 | GATE-ARENA-03 to -05; GATE-ATEL-02, -05, -06, -11, -12; GATE-AUGUR-01 to -07; GATE-CHRON-03, -04, -10, -11; GATE-GROUND-01; GATE-KIN-01, -02, -04; GATE-LEMMA-03, -04; GATE-MARROW-02; GATE-REFLEX-01, -03; GATE-SAFE-01, -08, -10; GATE-SENS-04, -05, -08, -09, -12; GATE-SINEW-01, -02, -04 to -08; GATE-SKEL-01 to -08; GATE-SPARK-21; GATE-TETHER-02, -07; GATE-TRAC-01, -02, -06; GATE-WS-02, -03 | KILL-SKEL-SEXPR; KILL-SKEL-SUBST; KILL-AUGUR-FALSECERT; KILL-MCP | GATE-TENFOLD-02; the schedule gate (BET-12) | NS-01, NS-07 and the docking scenario demonstrated; the schedule gate |
| M2 | INT-ASUP-02; INT-FJAX-01 | GATE-ARENA-01, -04, -06, -08; GATE-ATEL-12; GATE-AUTOPSY-01, -02, -07; GATE-CHRON-01 to -08, -11 to -13; GATE-CORTEX-01, -02, -05 to -09; GATE-FID-01, -03, -06, -07; GATE-HAB-01, -13; GATE-KIN-03 to -07; GATE-MARROW-05; GATE-PHYLUM-02 to -04; GATE-REFLEX-01; GATE-SAFE-06, -07; GATE-SENS-01 to -06, -12, -13; GATE-SINEW-02 to -04, -09; GATE-SPARK-02 to -06, -09 to -12, -15, -16, -18 to -20, -22; GATE-TETHER-04 to -06, -08; GATE-TRAC-01, -03, -04, -06, -10 | KILL-MARROW-GUARD; KILL-SINEW-ROWS; KILL-PHYLUM; KILL-CONTACT; KILL-POOL; KILL-EXPOSURE; KILL-SCHED; KILL-BUCKET; KILL-D1; KILL-KIR; KILL-METAL; KILL-PARITY; KILL-SHARD; KILL-LEARNKERN | KILL-TENFOLD-LEVER re-read with our own profile | The kill decisions for the kernel toolchain, contact, Metal and mixed batches recorded as ADRs (KILL-KIR, KILL-CONTACT, KILL-METAL, KILL-PHYLUM, KILL-BUCKET) |
| M3 | INT-FSIM-13, -14; INT-FMCP-01; INT-FTUI-01; INT-F3D-01; INT-FDGR-01 | GATE-ARENA-02, -07, -09; GATE-ATEL-01, -04, -07, -08, -11, -13; GATE-AUGUR-06, -08 to -10, -12 to -14; GATE-AUTOPSY-03 to -06; GATE-CHRON-09; GATE-CORTEX-04, -10, -12, -15, -16; GATE-FID-02, -04, -05, -08; GATE-HAB-02, -04 to -06, -10, -12, -14; GATE-MARROW-03; GATE-NEMESIS-01 to -06, -08; GATE-PHYLUM-01, -05, -07; GATE-QUAL-01, -02; GATE-REFLEX-01, -02, -04, -05; GATE-SAFE-02 to -05, -09; GATE-SENS-07 to -11, -14; GATE-SKEL-03, -04, -07; GATE-SPARK-17; GATE-TETHER-01, -09 to -12, -14; GATE-TRAC-05, -07 | KILL-FAMILYCERT; KILL-SKEL-ALIAS; KILL-SHADOW; KILL-QUOTIENT; KILL-FILM; KILL-MESHGPU; KILL-BANK-BREADTH; KILL-FCLEAR; KILL-ALIAS; KILL-BASELINE; KILL-GYMADAPT; KILL-SPEC-REWARD; KILL-AUGUR-ALIAS; KILL-AUGUR-PROBE; KILL-AUGUR-REGION; KILL-AUGUR-REUSE; KILL-AUGUR-SEPARATE; KILL-AUGUR-TIE; KILL-MCW; KILL-NEMESIS; KILL-RARE; KILL-AUTOPSY; KILL-STATIC; KILL-DR; KILL-MCPTASKS; KILL-PREEMPT; KILL-SLOT; KILL-TUI | GATE-TENFOLD-03 to -06; KILL-TENFOLD-SPEED, -TIE, -REACH for the classes run | GATE-TENFOLD-06 recorded, whatever the ratio |
| M4 | — | GATE-ATEL-02 to -05, -07 to -11, -13 to -16; GATE-AUGUR-09, -11, -14 to -19; GATE-AUTOPSY-08; GATE-CORTEX-03, -11 to -14; GATE-GAIT-01 to -03; GATE-HAB-11; GATE-LEMMA-04; GATE-MARROW-04; GATE-NEMESIS-07; GATE-PHYLUM-06, -08; GATE-REFLEX-01, -04, -06 to -08; GATE-SHIELD-01 to -04; GATE-SPARK-13, -14; GATE-TETHER-13; GATE-TRAC-08 | KILL-MARROW-BLOCKS; KILL-FAMILYLANE; KILL-FDGRAD; KILL-RESPONSE; KILL-SOIL; KILL-RETROFIT; KILL-FLEET; KILL-SPECIALIZE; KILL-ENERGY; KILL-GAIT; KILL-MPC; KILL-RESIDUAL; KILL-SHIELD; KILL-ALTALGO; KILL-DISTILL; KILL-EQUIV; KILL-FAMILY; KILL-INHERIT; KILL-AUGUR-CUTS; KILL-AUGUR-DOMINANCE; KILL-AUGUR-LABELS; KILL-SYNTH-CODESIGN; KILL-SYNTH-LINKAGE; KILL-SYNTH-TRAJOPT; KILL-ATLAS; KILL-LADDER; KILL-RANK; KILL-REUSE; KILL-VOI; KILL-SOLVE | — | Rank agreement measured (GATE-REFLEX-04, GATE-CORTEX-12, GATE-ATEL-07); the family-policy bets decided (KILL-FAMILY, KILL-INHERIT) |
| M5 | INT-FSIM-15; INT-FLN-01, -02; INT-FDGR-01 | GATE-FOUNDRY-01 to -10; GATE-GROUND-02 to -09; GATE-HAB-03; GATE-LEMMA-01, -02, -05; GATE-QUAL-03; GATE-TRAC-09; GATE-WS-02 | KILL-LEMMA; KILL-REFLECT; KILL-SKEL-PORT; KILL-TREEOP; KILL-VARIATIONAL; KILL-HARDCONTACT; KILL-DRESSING; KILL-INGEST; KILL-ASBUILT; KILL-BAND; KILL-CLOCK; KILL-GROUND; KILL-KIT; KILL-FAB; KILL-LOADS; KILL-PACKET; KILL-TOLERANCE; KILL-TOPOPT | — | The Reality lane has a record or a recorded no-claim (GATE-GROUND-01, GATE-GROUND-10) |
| M6 | INT-FSIM-17; INT-FTX-01 | GATE-AUGUR-20, -21; GATE-FOUNDRY-12; GATE-HAB-07 to -09; GATE-TRAC-09 | KILL-SINEW-AGE; KILL-SINEW-ROTOR; KILL-LIVING; KILL-PROXY; KILL-SLOSH; KILL-AUGUR-PHASE; KILL-AUGUR-SYMEVENT; KILL-LIFECYCLE; KILL-ADVECT | — | Per-epic plans and kill gates |
| M7 | — | — | — | GATE-TENFOLD-03 to -05 repeated; GATE-TENFOLD-07, -08; every KILL-TENFOLD rule | GATE-TENFOLD-07: the measured ratio published with its phase ledger |
| M8 | — | GATE-AUGUR-22 to -24; GATE-CORTEX-17; GATE-FOUNDRY-11; GATE-REFLEX-09; GATE-SHIELD-05 | KILL-MEGA; KILL-SKILL; KILL-TUBE; KILL-GATREE; KILL-AUGUR-FACILITY; KILL-AUGUR-TRANSPORT; KILL-SYNTH-CONT; KILL-FIRMWARE | — | Per-epic plans and stop rules |
| Not tied to a milestone | — | GATE-GROUND-10 | — | — | — |
The load by exit, counted in parts due:
| Exit | M0 | M1 | M2 | M3 | M4 | M5 | M6 | M7 | M8 |
|---|---|---|---|---|---|---|---|---|---|
| Admission gates | 23 | 4 | 2 | 6 | 0 | 4 | 2 | 0 | 0 |
| Convergence gates | 11 | 59 | 80 | 77 | 49 | 25 | 7 | 0 | 7 |
| Kill decisions | 2 | 4 | 14 | 28 | 30 | 18 | 9 | 0 | 8 |
M2 and M3 carry half of the convergence parts, and M3 and M4 more than half of the kill decisions. That concentration is by design, since those exits are where the engine and the method are decided, and it is a schedule risk that §41 carries. M7 has no subsystem gate of its own: its exit is the tournament.
40.7 Discrepancies resolved by this register
Kill gates stated in two chapters. The owner chapter governs the trigger and the fallback, and the other chapter is a consumer.
| Kill gate | Owner's row | Consumer's row | Resolution |
|---|---|---|---|
| KILL-DR | §29.20: ρ_ep below 0.7 on 200 paired addresses in every stratum tested, or GATE-CHRON-09 coverage fails after one repair cycle. Fallback: promotion reports the label only, from referee episodes alone | §16.17: ρ below 0.7 for the promoted quantities on 200 battery addresses, or effective sample size below 30% of the audited count in more than a tenth of promotions. Fallback: the plain paired promotion of C-15, with segment mode where whole-episode ρ is low | §29 governs. §16's effective-sample-size clause is not a trigger; it stays a recorded diagnostic of the correction. The two fallbacks describe one state from two sides: the tier correction is off and promotion returns to the paired label of C-15. Segment mode remains an option inside that fallback |
| KILL-RANK | §28.23: GATE-ATEL-07 fails for every morphology class tested. Fallback: R1 is uninformative everywhere, every candidate that survives static analysis is scored on the higher rung, and the ladder's claim shrinks to stopping and elimination among trained candidates |
§16.17: top-weighted τ below 0.5 in more than half the strata for the reference classes. Fallback: tier pairs promote individual results only | §28 governs: the kill gate concerns agreement between evaluation rungs. §16's row concerns agreement between physics tiers, which GATE-FID-04 measures; its consequence, that no population is ordered across a tier pair whose τ is below 0.5, is the per-stratum rule of GATE-FID-04 and holds without a kill gate |
| KILL-FDGRAD | §17.13: the pilot's falsifier fires (variance ratio below 2 at every horizon of 50 steps or more, or sign agreement below 70%), or no end point is confirmed by a specialist. Fallback: rank-based search, with the stencil kept as a sensitivity report | §28.8 and §28.23 cite §17.13 and repeat its trigger and fallback | One gate; §17's statement is the register's |
| KILL-FILM | §18.8: on the wet-floor battery the film law changes fewer than 10% of episode outcomes against a constant-coefficient patch, or adds more than 5% to step time. Fallback: static condition cards on lockstep tiers | §19.10: the advected film fails its mass gate after one repair cycle, or costs more than 15% of the step, or design rankings on the spill battery agree with static patches at a rank correlation of 0.95 or above. Fallback: static film-friction patches | Two mechanisms shared one name, and they are two gates. The register's KILL-FILM is §18's and governs the film-friction law S. §19's gate is KILL-ADVECT, the stop rule of the advected film F, with its own row in §40.4 and its decision recorded with GATE-HAB-07: when it fires, advection is not built and Habitat uses the law of §18 on static film patches. If KILL-FILM itself fires, both fall to static condition cards |
| KILL-SLOT | §32.21: any digest difference under co-tenancy, or the throughput or step-time limits of GATE-TETHER-09 fail after one optimization pass | §21.11: any slot-invariance failure at GATE-SPARK-15, or 99th-percentile step time more than 10% above the same job run alone | §32 governs. Its limits contain §21's and add the 5% throughput limit and the optimization pass. The fallback is the same |
| KILL-SPECIALIZE | §21.18: the specialized kernel below 1.2 on the whole step in the pilot, or a compile above 60 s, or a specializable share under one third in the M2 profile | §17.9: measured whole-step gain below 1.2, or compile above 60 s per design | §21 governs and adds the profile clause, which can fire at M2 before any pilot is funded. The fallbacks agree |
Admission gates stated twice. INT-FLN-02, INT-FNP-02, INT-FSYM-02 and INT-FT-02 appear in §33.6 and again, with their source anchors, in §33.10. The thresholds do not differ. The register uses the fuller statement of §33.10.
KILL-MCP, stated once. The design of record is frob-mcp as a member of the core graph on T, running verbs in
process (§33.13). The row in §32.21 and the register agree: the trigger is that INT-FMCP-01 cannot pass within the M0
budget after FD-FMCP-01 and FD-ASUP-01 have been attempted, and the fallbacks are, in order, frob-mcp as its own
workspace reaching frobd over a local socket in newline-delimited JSON, and then the CLI.
Rows against the milestone skeleton. A gate cannot be due before its mechanism lands. Where a row's own milestone disagrees with the milestone skeleton (§43), the register follows the skeleton.
| Gate | Row | Skeleton | Register |
|---|---|---|---|
| GATE-SPARK-21 | M1 as first drafted; M0 in §36.16 now | The incumbent phase ledger is measured at M0 | Split. The trj rows that need no agent are due at M0, where GATE-TENFOLD-01 reads them; the whole gate closes at M1 |
| GATE-TRAC-09, KILL-HARDCONTACT | M3, with the GPU at M6 | The hard-contact batch law lands at M5 | M5 on batch-cpu and M6 on the GPU. The batch-cpu rows may be recorded from M3 |
| GATE-HAB-11 | M3 | The retrofit catalog lands at M4 | M4, with KILL-RETROFIT |
| GATE-SHIELD-01, KILL-ENERGY | M3 | The energy-budget tier lands at M4 | M4 |
| GATE-FOUNDRY-01 to -03, GATE-GROUND-03, KILL-LOADS | M4 | Foundry and Ground land at M5 | M5. The four gates may be recorded at M4 |
| GATE-FOUNDRY-12, KILL-LIFECYCLE, KILL-SINEW-AGE | M8 | Lifecycle compression is an M6 item | M6 |
| GATE-KIN-04, GATE-TRAC-06, GATE-REFLEX-01 | M1, naming strict or batch-cpu |
The batched step, and with it the strict profile, lands at M2 |
Referee rows at M1; strict and batch-cpu rows at M2 |
| GATE-SENS-04, -05, -12; GATE-SENS-08, -09 | M2; M3 | The clock contract and the first mission slice land at M1 | A CPU part at M1 (for -08 and -09, the docking rows), and the rest as tagged |
| GATE-AUGUR-09 | M3 | Region certificates land at M4 | The pilot at M3, where KILL-AUGUR-REGION is decided; the gate at M4 |
| GATE-SKEL-03, GATE-SKEL-07 | No milestone; each speaks of all eighteen archetypes | First archetypes at M1; a baseline controller for every archetype at M3 | A part at M1 for the archetypes that have landed, and the whole at M3 |
| KILL-TREEOP, KILL-SKEL-PORT, KILL-FAMILYLANE, KILL-SPECIALIZE, KILL-MEGA | No decision point; the triggers read the M2 profile or a pilot | The mechanisms are Frontier or Moonshot work funded after M2 | Decided when the work package would be funded: M4 for the family lane and specialization, M5 for the tree-operator route and its port packets, M8 for the fused kernel. The profile clauses are read at M2 and can close a question early |
Related thresholds under different identifiers. These are not conflicts, and the register changes none of them. They are listed because a reader will meet two numbers for what looks like one quantity.
| Quantity | Where it appears | Reading |
|---|---|---|
| Strong scaling on two cards | 1.25 in GATE-SPARK-20 and in GATE-CORTEX-08; 1.6 as the ambition and as the threshold of KILL-SHARD | §36 owns the figure. Both gates hold the tolerance of 1.25. Below 1.6, KILL-SHARD stops further sharding work |
| Mixed-batch rate | 0.70 of the harmonic mean of the homogeneous rates, for three body plans in one bucket (GATE-SPARK-10) and for cohorts of at least 256 designs (GATE-PHYLUM-03); 0.5 in KILL-BUCKET and in KILL-PHYLUM | One tolerance, 0.70, and one kill threshold, 0.5, on two workloads, with one fallback, per-family templates. The head-to-head of §17.14 is the deciding experiment, and KILL-PHYLUM's record is the decision of record for the engine |
| Film squeeze times | Within 2% in GATE-TRAC-05 and in GATE-HAB-06 | One fixture, measured once, against one bound. §18 owns the law; GATE-HAB-06 tests the law as scenes consume it |
| Energy residual on single-precision tiers | 10⁻³ for the whole ledger (GATE-CHRON-03); 10⁻⁴ per episode for the port balance (GATE-SINEW-02); 10⁻⁴ on the precision battery (GATE-SPARK-05) | Different scopes. The looser bound on the whole ledger does not relax the other two |
| Rank agreement | Kendall τ of 0.7 to select and 0.5 to discard in GATE-REFLEX-04 and GATE-ATEL-07; 0.5 in GATE-GAIT-03 and GATE-REFLEX-06 | One pair of thresholds, 0.7 and 0.5, everywhere a rule depends on τ. Below 0.5, or with no record, a rung neither selects nor discards (§28.10). The alternative pair that §22.19 left open is not adopted |
| Sampling-controller cost | A median of at most 1 GPU-minute per 20 s quadruped episode and 6 per humanoid episode, in GATE-REFLEX-06 and in the falsifier of BET-27 | One pair of thresholds. The derived costs are about 0.33 and 1 GPU-minutes at a 20 ms planning step and about 1.7 and 5.2 at 4 ms (§22.8) |
| Screening audit | GATE-NEMESIS-07 (§26.10) and GATE-ATEL-09 (§28.23) | One mechanism, owned by §26.10, with the exact bound 1 − δ^(1/m). GATE-ATEL-09 is the statement that the cascade does not trust a rung whose audit is missing or failed |
| Fork classification | GATE-AUTOPSY-02 (§27.17) and GATE-CHRON-05 (§29.20) | One set of five classes, defined in §27.4 and implemented by the mechanism of §29.8; one refusal code for a warm-start graft, FROB-REF-582 |
40.8 Gates defined by subsections added after the register was compiled
The subsections below were added after the tables of §40.2 to §40.4 were compiled. Their gates and kill gates are binding under the rules of §40.1. Until those tables are regenerated, each has its row in the subsection that defines it, and that row governs its threshold. The milestone printed is the one its defining row states. A kill gate with no milestone of its own is decided at the milestone of the gate beside it.
| Chapter | Convergence gates (defining subsection; earliest milestone) | Kill gates (defining subsection) |
|---|---|---|
| §13 | GATE-MARROW-06 (§13.11; M1) | — |
| §14 | GATE-SKEL-09 (§14.16; M3); GATE-SKEL-10 (§14.16; M4) | KILL-SKEL-CELL (§14.16) |
| §16 | GATE-KIN-08 (§16.19; M2); GATE-KIN-09 (§16.20; M8); GATE-KIN-10 (§16.21; M6); GATE-KIN-11 (§16.22; M2); GATE-KIN-12 (§16.23; M2) | KILL-ROWQUEUE (§16.19); KILL-INTERACT (§16.20); KILL-STEPADJOINT (§16.21); KILL-LOOPELIM (§16.22); KILL-ANCESTOR (§16.23) |
| §17 | GATE-PHYLUM-09 (§17.21; M2) | KILL-LIMBKERNEL (§17.21) |
| §18 | GATE-TRAC-11 (§18.19; M4), the gate of KILL-RESPONSE | — |
| §19 | GATE-HAB-15 (§19.21; M6) | KILL-FARFIELD (§19.21) |
| §20 | GATE-SENS-15 (§20.23; M2); GATE-SENS-16 (§20.24; M3); GATE-SENS-17 (§20.24; M4) | KILL-VISIBILITY (§20.24) |
| §21 | GATE-SPARK-23 (§21.26; M2) | — |
| §22 | GATE-REFLEX-10 (§22.20; M6); GATE-SHIELD-06 (§22.21; M4); GATE-REFLEX-11 (§22.22; M3) | KILL-SOILLIFT (§22.20); KILL-MPCRECORD (§22.22) |
| §23 | GATE-CORTEX-18 (§23.25; M2); GATE-CORTEX-19 (§23.26; M2); GATE-CORTEX-20 (§23.27; M2); GATE-CORTEX-21 (§23.28; M3); GATE-CORTEX-22 (§23.29; M6) | KILL-SHORTGRAD (§23.29) |
| §24 | GATE-ARENA-10 (§24.19; M2); GATE-ARENA-11 (§24.20; M3); GATE-ARENA-12, -13 (§24.21; M3); GATE-ARENA-14 (§24.22; M2, M3) | KILL-FOIL (§24.20); KILL-ITEMBANK (§24.21); KILL-EXPODOMAIN (§24.22) |
| §25 | GATE-AUGUR-25 (§25.29; M4, M8); GATE-AUGUR-26 (§25.30; M3); GATE-AUGUR-27 (§25.31; M3); GATE-AUGUR-28 (§25.32; M4); GATE-AUGUR-29 (§25.33; M4); GATE-AUGUR-30 (§25.34; M4) | KILL-COUPLING (§25.29); KILL-AUGUR-BRACKET (§25.32); KILL-SYNTH-REGRESSOR (§25.33); KILL-WEAKVAR (§25.34) |
| §27 | GATE-AUTOPSY-09 (§27.19; M3) | KILL-ENSEMBLE (§27.19) |
| §28 | GATE-ATEL-17 (§28.25; M3); GATE-ATEL-18 (§28.25; M4); GATE-ATEL-19 (§28.26; M3) | KILL-BUDGETCURVE (§28.25) |
| §29 | GATE-CHRON-14 (§29.22; M1, M2) | — |
| §31 | GATE-FOUNDRY-13 (§31.21; M5); GATE-FOUNDRY-14 (§31.22; M5); GATE-FOUNDRY-15 (§31.23; M3) | — |
| §32 | GATE-TETHER-15 (§32.23; M3); GATE-TETHER-16 (§32.24; M3) | KILL-REPLAYPACK (§32.24) |
| §33, §34, §41, §47 | GATE-WS-05 (§34.14; M0); GATE-WS-06 (§33.17; M0, M2); GATE-WS-07 (§41.5; M0, M2, M3); GATE-WS-08 (§47.4; M1) | — |
| §38 | GATE-FID-09 (§38.17; M1, M4) | — |
Four existing gates were amended by the same subsections and keep their rows above: GATE-CORTEX-05 (§23.27),
GATE-TETHER-01 and -13 (§32.23) and GATE-AUTOPSY-03 (§27.19). KILL-EXPODOMAIN is the kill gate of §24.22; it is
not KILL-EXPOSURE, which is §20's.
| Training time against the incumbent | 1.25 times for the quadruped task (GATE-CORTEX-05); 1.5 times for the humanoid task, a row of §36.3 under GATE-SPARK-03 | Different workloads |
| No-authorization flags | Three fields in GATE-LEMMA-06 and GATE-SAFE-01; a fourth, fabrication_released, on build packets (GATE-FOUNDRY-10) | GATE-SAFE-01 covers every flag that the artifact kind carries |
40.9 Gates defined in subsections added by the final audit
These gates are defined in subsections that were added after the tables above were compiled. Each is listed with its defining subsection, which governs its threshold until the next revision of this register folds it into the tables of its subsystem. A kill gate here names its fallback in its defining subsection.
| Gate | Defined in | Statement (abridged) |
|---|---|---|
| GATE-SKEL-11 | §14.17 | Known answer. On 10³ random trees with fixed joints the folded model's mass, first moment and pseudo-inertia equal the sums over the unfolded links exactly in rationals and to 10⁻¹² relative in double precision; forward dynamics of the folded model and of the unfolded model with the joints held as constraints on the referee agre |
| GATE-SINEW-10 | §15.15 | Known answer. The one-rotor table is exact: the envelope has one generator (1, 1) N·m, the command (1, −1) N·m is refused as outside the image, the reflected inertia is [[1, 1], [1, 1]] and the two energies are 0 J and 2 J; the diagonal mutant reports 1 J twice and fails. For 10³ random couplings with up to four motors and six j |
| GATE-KIN-13 | §16.24 | Known answer. The four rows reproduce exactly in rational arithmetic on the host. In single precision on batch-cpu, CUDA and Metal the pass or fail decision of each of the 64 cases equals the rational one for the exact map and for d = 1, 2 and 4. A-22 reports a tier radius of 1.366 at d = 1 and withholds the stability label. T |
| GATE-TRAC-12 | §18.20 | Known answer. The arc fixture is detected on 1,000 of 1,000 seeded variants (radius 0.2 to 2 m, angle up to π, sphere radius 1 to 10 cm, an obstacle on the arc and outside the padded chord); the chord-only mutant fails the gate. On 10⁴ random two- and three-joint sweeps the bound of the second item contains 1,000 sampled path po |
| GATE-HAB-16 | §19.22 | Known answer. The two sphere points return clearances of 0.10 m and 0.20 m after compilation, and the pre-compilation query returns the interval of rule 1 and never the local value. The two-plane fixture returns the foreground at 2 m through the compiled pack, through the viewer's pick and through the adapter; the mutant that so |
| GATE-SENS-18 | §20.25 | Known answer. The rebound window reads 200 m/s² on the referee to 10⁻⁹ relative, and the adjacent windows read zero; the mutant without the jump term and the closed-closed window mutant both fail. The encoder fixture: +80 and −20 turns per second deliver bit-equal samples, sense.alias returns the pair, and the largest unambigu |
| GATE-GAIT-04 | §22.23 | Known answer. On the planar loop the section and bordered forms agree with the closed forms to 10⁻⁹ on the multiplier, on dr*/dμ and on dT*/dμ; a stroboscopic solve of the same loop is refused, and is not reported as a fold. The rimless wheel and the compass gait of GATE-GAIT-01 pass through the autonomous path with the trivial |
| KILL-FREEPERIOD | §22.23 | Trigger: on the gait battery the section and bordered forms disagree beyond tolerance on more than 5% of autonomous orbits after one repair cycle, or the bordered iteration fails to converge on more than a quarter. Fallback: autonomous loops are analysed on an event section only; a loop with no transverse event is reported `unsu |
| GATE-GAIT-05 | §22.24 | Known answer. The counterexample returns the eigenvalue 3/4 + 1/√2 to 10⁻¹², the per-stride bound 1.2071 and the word (A, B); a pair of commuting contractions returns stable-under-switching with a common matrix that the checker verifies in exact rationals; a mutant that tests each mode alone labels the counterexample stable an |
| KILL-STRIDESEQ | §22.24 | Trigger: the pilot's falsifier holds after one repair cycle, or cycle enumeration exceeds its budget on the reference gaits. Fallback: no switching verdict is issued; multi-mode gaits are tested by finite-disturbance recovery over sampled admitted sequences, class Tested, and the per-mode multipliers carry the flag `single-mod |
| GATE-SHIELD-07 | §22.25 | Known answer. The four rows are exact. shield.fit refuses 300 N·s/m at 10 ms on an inertia of 1 kg and admits 100 N·s/m. Over 10⁴ random triples (M̄, K_d, h) with 2·M̄ − h·K_d ⪰ 0 the ledger's stored energy at ticks never increases, and each of 10³ planted violations shows an increase. The continuous-time identity remains a th |
| GATE-AUGUR-31 | §25.35 | Known answer. Through the public verb the stance family returns 3/14 m under adjustable with the bilinear law, 1/2 m under affine with the symmetric law and a matching dual, and an exclusion for every b under constant. The bilinear law evaluated on a 121 × 61 grid of loads meets every balance equation and rating in exact r |
| GATE-AUGUR-32 | §25.36 | Known answer. Through the public verbs: δ = 1/50 is excluded with the alias pair and the partition of the probe axis; δ = 1/40 is included with p = 5/8; the minimum is returned as the root of 16·δ² + 41·δ − 1 with an enclosure no wider than 10⁻⁹ m and attained: true. The witness policy passes the 133,185 exact cases on the raw |
| GATE-AUGUR-33 | §25.37 | Known answer. Enumeration of the 128 histories returns 55/64 for the pairwise law, 3807/4096 for the independent law and 3/4 for the shared fault, exactly; a redundancy claim on a card marked pairwise is refused. The three label rows return 2, 3 and 5 bits with codes whose received-word sets are disjoint; the four-bit request |
| GATE-AUGUR-34 | §25.38 | Known answer. The margin table reproduces to 10⁻³ N, and a refutation built from the independent extremes under law D is refused. With four laws admitted mission.distinguish returns a probe at t = 1/2 s with r = 3 and a gap of at least 0.10, decides 900 of 900 cases, and returns no probe at any dwell of 1/4 s or less. M4. |
| GATE-AUGUR-35 | §25.39 | Known answer. On the scalar pack the lane returns a bracket whose upper end passes F(U) ≤ U and lies within 1 g of 100 kg; the increment-stopping mutant returns 99.5 kg and is refused. On the three-build catalog all three builds are returned with dispositions; a weights-only mutant omits (4, 4) and fails; the budget query return |
| GATE-ARENA-13 | §24.21 | Design comparison ¦ Replay on a recorded full matrix of about 40 designs × 150 items × 4 replicates (24,000 episodes): for the 20 closest pairs, episodes to equal interval width lower by a factor of at least 4; coverage within 2 points of nominal; item parameters fitted on one family predict held-out designs better than per-item |
| GATE-ARENA-15 | §24.23 | Known answer. On ten authored tasks with a planted safety-only reward and ten clean tasks, the idle arm flags ten of ten and none of ten (TARGET: at least nine, at most one). The hand case is flagged, and after the progress clause is accepted the parked robot's verdict is violated. M3. |
| GATE-GROUND-11 | §30.24 | Known answer. In the synthetic rehearsal of §30.21, the two explanations produce bit-equal samples on the +2 m/s pass and the fit reports "delay times speed plus offset = 40 mm" with no card update. With the reversed pass added, both the 20 ms delay and a planted 40 mm offset are recovered within their intervals, and the predict |
| GATE-WS-09 | §33.18 | Known answer. Each of the six admission tests is recorded at the pin with its result: the roll-up of 31.96314202 kg; the refusal at 33 m and the agreement at 1 m to 10⁻¹², with the closed form returning ∓16.5 m; the signed motion witness for both transformer entry points; the arc fixture; the two fs-sos probes compared with ex |
| GATE-GAUNT-02 | §38.15 | 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 | §38.15 | 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 | §38.15 | 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 | §38.15 | 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 | §38.15 | 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 | §38.15 | 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 | §38.15 | 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 | §38.15 | 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 | §38.15 | 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 | §38.15 | — ¦ 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 ¦ M |
| GATE-GAUNT-11 | §38.18 | 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. |
| GATE-TENFOLD-04 | §39.18 | Known answer ¦ Freeze and seal: the six steps in order; a published manifest and advocate statement for every arm; the frozen rival reproduces its home-task training time within 20% on trj and wins at least one easy-win development family per stratum; the pre-analysis recorded, with every confirmatory cell meeting the reachabi |
| GATE-TENFOLD-05 | §39.18 | Known answer ¦ Adjudicator acceptance: the adjudicating simulator passes the known answers of §38 that it can express, inside its own stated tolerances; of 20 planted answers per stratum (10 that must pass, 10 that must fail) it classifies 20 correctly; no arm's logs show it in training or tuning; on a 5% sample of accepted answ |