FrankenRobotics

North-Star scenarios

2,493 wordsPlan version 1.1

Each is a before-and-after acceptance story, tagged with the first milestone that can demonstrate it. In the "after" parts, numbers are TARGETs or illustrative values unless the story says they are a known answer. Incumbent figures in the "before" parts are FACTs from Appendix H. Verb spellings follow the registry (Appendix J); where a story names a capability without a spelling, the registry is the authority. NS-01 to NS-12 are carried from version 0.2 with their incumbent denominators corrected; NS-13 to NS-24 are new.

  • NS-01 Check before you simulate [M1]. Before: an agent edits XML, launches training, and learns minutes to about an hour later that the knees saturate (training takes about seven minutes for a flat-ground quadruped task and about an hour for a default rough-terrain humanoid run). After: frob design check returns in under two seconds: the mass spiral closes at 14.2 kg, peak knee torque demand exceeds the selected actuator's continuous rating by 31%, the design has mechanical symmetry group C₂ × C₂ of which its front-only depth camera preserves C₂, and three ranked repairs are offered as typed edits.
  • NS-02 Teleport a world [M2]. Before: world 1,337 of 4,096 produces NaNs on the GPU. Where an incumbent's deterministic mode is on, the same batch can be re-run on the same GPU; none documents a bitwise re-run of that one world on a CPU. After: frob sim replay --world 1337 --tier batch-cpu reproduces that world alone on the CPU from its address (seed, world, episode), stops at the first step whose digest differs from the GPU's or at the first refusal, and reports the contact that started it. Where the device reaches class D1 the digests agree to the end, and the report says which class applied.
  • NS-03 An honest A/B [M3]. Before: two designs are compared on mean reward over an arbitrary number of episodes. After: frob eval compare A B --task warehouse-tote runs both on common world addresses under a declared anytime-valid study, stops when the e-process crosses its threshold, and reports "B beats A on energy per metre, evidence 240 to 1, valid at any stopping time". It reports separately whether each design meets the mission's hard limits, because a paired win establishes neither.
  • NS-04 A kitchen with a wet floor [M3]. A humanoid crosses a generated commercial kitchen whose floor friction map includes a wet patch governed by the film-friction law. Telemetry reports slip distance per stance, the friction utilization margin, and the stills at the moment of the slip. The agent can ask which link a pixel belongs to.
  • NS-05 Symmetry for free [M4]. The studio reports the symmetry group of a hexapod and the subgroup that its sensors, payload and task preserve, lists the gaits that subgroup permits, and trains a policy equivariant under it that reaches the target return in at most 0.7× the steps of an unconstrained one.
  • NS-06 Thirty iterations in an hour, three hundred designs decided [M4]. An agent runs thirty design-check-simulate-explain-edit cycles on a wheel-leg hybrid in one hour on trj. Each cycle dispatches a family of at least ten variants in one batch, so at least three hundred designs are decided in the hour. Every design version is content-addressed, every comparison is a declared study, and frob design bisect finds the edit that broke stair climbing. The unit of the story is designs decided per hour: the cycle count alone is worth only 3.0–3.5× against an incumbent quadruped loop (§2.3).
  • NS-07 An import that tells the truth [M1]. Importing a public humanoid description yields a loss report: which fields were dropped, which inertias fail the physical-consistency test, and which actuator limits were absent and filled from a card marked assumed.
  • NS-08 Tracks on rubble [M4]. A tracked robot climbs stairs and crosses rubble; on soft soil the sinkage model is active and labelled Frontier in the evidence.
  • NS-09 The exploit is caught [M3]. A policy that scores well by exploiting contact compliance is re-evaluated on the referee tier; the score falls outside the promotion envelope and the result is labelled provisional: tier-sensitive. A design whose rank among finalists changes under another admissible contact law is labelled model-conditional and may not spend prototype budget.
  • NS-10 The same task on a Mac [M2]. The quadruped task trains on this Mac through Metal. Results agree with the CUDA run inside the declared determinism class, and the report says which class. The throughput is reported beside the one Metal-capable incumbent's on the same machine and beside one RTX 4090's.
  • NS-11 A kernel with a certificate [M5]. frob prove kernel K-cay-step returns a certificate that the update stays on the group and conserves spatial momentum in free flight, checked by FrankenSymPy's proof kernel, with a Lean capsule re-checked by FrankenLean where the theorem's dependencies allow. The certificate says nothing about floating-point results, and its text says so.
  • NS-12 Your own kitchen [M5]. A walkthrough video becomes a private scene pack through the owner's existing reconstruction pipeline, and a candidate home robot is evaluated in it. Scale is labelled Estimated unless anchored, surfaces the scan never saw are treated conservatively and listed as a re-scan request, and the scan never leaves the machine.
  • NS-13 A mission answered over a family [M1 on the CPU, M4 at scale]. Before: an agent evaluates candidate bodies one at a time and reports the best score. Nothing says whether an untried body would also work, or why a failed one cannot. After: the mission is a query with a free parameter. A robot carries 400 N on four point feet at (±a, ±b) with a = 1/3 m; its centre of mass may lie anywhere in a rectangle of half-dimensions 150 mm by 75 mm; each foot delivers a commanded normal force in [0, 160] N; the half-width b is free. frob mission synthesize returns I ⊆ F ⊆ O. Every b ≥ 3/14 m is in the inner set, with the corner allocation (160, 130, 110, 0) N as its witness. Every b < 3/14 m is excluded, with a dual vector as the impossibility witness: at b = 0.20 m one foot would have to carry 165 N. The answer says that the boundary has zero reserve on two constraints. frob-verify re-checks the bundle offline in exact rational arithmetic. When the mission is amended to a passive equal-spring suspension, result.revalidate withdraws the earlier inner set and says what must be re-solved: at b = ¼ m, which had been admitted with the allocation (155, 135, 105, 5) N, the springs deliver (175, 115, 85, 25) N against the 160 N rating. These numbers are a known answer (Appendix M), not targets.
  • NS-14 256 different robots in one batch [M2]. Before: a population of designs with different topologies is a sequence of rebuilds. On GPU engines a structural edit needs a host compile and a new graph capture, and one stack reports just-in-time compilation of one to three minutes. After: one dispatch steps 256 distinct designs (three leg counts, mixed link lengths and actuator cards, in size buckets) with 32 worlds each on one RTX 4090. No kernel is compiled. Each world reproduces the digest of its single-design run. The report carries the two numbers of N11 against the incumbent's mixed batch and against the per-family-template control arm, and says which arm won.
  • NS-15 A minimal counterexample world of three edits [M3]. Before: domain randomization reports a failure tail of 0.4% and the agent reads logs to guess why. After: the Nemesis search (§26) finds a failing world inside the legality bounds, confirms with a witness that the candidate's own body and actuators could have completed the mission in it, and shrinks it to a .fmcw file of three edits against the nominal scene: a door sill raised by 9 mm, a friction coefficient of 0.31 on one floor tile, and a depth packet delayed by 40 ms. Removing any one edit removes the failure. The world reproduces bit for bit and joins the regression battery.
  • NS-16 An autopsy that names the cause [M3]. Before: an agent given a failed episode orders the anomalies by time and guesses. After: Autopsy (§27) forks the snapshot taken before the fall under twelve typed interventions, singly and in pairs, on identical random streams. The placebo fork replays the failure bit for bit. The report says that lifting the knee torque limit prevents the fall in 94% of perturbed forks against a placebo flip rate of 3%, so it is a but-for cause, and that restoring nominal friction does so in 8%, so it is not. The gear-ratio intervention is re-run from the episode start, because winding temperature depends on the whole history. Attribution runs in double precision, and the first-ranked repair comes back as a typed edit. An episode whose placebo flip rate is high is labelled chaotic: unattributable and is given no cause.
  • NS-17 Qualification that survives 500 adaptive retries [M3]. Before: an agent submits fifty candidates against the same held-out scenes until one passes. Each comparison is valid alone and the campaign is not. After: frob eval qualify pre-commits the candidate, the baseline, the mission and the metrics. Submission i runs on fresh sealed world clusters at level α_i = α / [i·(i + 1)], a series that sums to α. The discovery lane cannot read those worlds, and only the decision and an aggregate receipt come back until the campaign closes. The gate behind the story drives the lane with 500 adaptive retries on worlds that carry no signal and requires a false-promotion rate of at most α, with power preserved on planted gains.
  • NS-18 A twelve-dollar ramp against a chassis redesign [M4]. Before: every repair an agent considers lives in the robot. After: a wheeled carrier fails kitchen doorway D. The clearance complex returns an impossibility cut that names the bottleneck, a 19 mm threshold. The retrofit catalogue (§19) reports that one 1:12 rubber threshold ramp, priced at USD 12, makes the mission solvable with the policy frozen, and that the alternative in the robot is a larger drive wheel that changes the gearbox and adds USD 140 in parts. Both enter the same budget, and the mission answer lists them as competing, testable decisions. Prices and dimensional norms come from a cited catalogue; where none is cited they are labelled assumed.
  • NS-19 A family policy walks an unseen design [M4]. Before: every new design waits for its own training run, about seven minutes for a quadruped and up to an hour for a humanoid. After: an agent lengthens the femur by 8% and widens the stance. The family policy of the quadruped class, conditioned on the design, walks it with no training. The report gives its return as 0.78 of the specialist reference for the class, the in-distribution check, and the rank-agreement status that says whether this rung may eliminate designs. When the design is shortlisted, inheritance from its parent reaches the target return in 12% of the steps of an early-stopped from-scratch control. A six-legged variant falls outside the class, is flagged out-of-distribution, and is routed to the baseline controller.
  • NS-20 A build packet [M5]. Before: the loop ends with a scored design. After: from a qualified design and task, Foundry (§31) emits a .fbuild packet: a bill of materials against a pinned catalogue, faceted solid geometry, a tolerance stack that closes, fatigue margins computed from the simulated load histories, and one link re-optimized to be 18% lighter at equal margin. The packet's claim product is Estimated, because its material cards are, and every file in it carries the three no-authorization flags of §8 and the packet flag fabrication_released, all false.
  • NS-21 A calibrated reality band [M5]. Before: every report says reality: no-claim. After: bench measurements of one quadruped on one floor are imported with their provenance. Predictions for the held-out episodes are frozen before the comparison. For that robot and task family, Ground reports a cost of transport of 0.62 with a band of [0.55, 0.71] at 90% nominal coverage from 20 calibration episodes, and states that coverage at this sample size varies by about six points. The same question about a design that was never built returns a refusal that names the missing calibrated family.
  • NS-22 The docking fixture [M1]. The first mission slice, on the CPU. A cart must reach position 1 at rest in three one-second ticks. Its acceleration is g·u with an unknown gain g ∈ {1, 2} and commands bounded by U. The only informative packet is the first velocity reading. Before: a simulator scores a given controller on sampled worlds and cannot say whether any controller exists. After: the mission query returns four facts, each with a certificate. With the packet on time and U = ¾, a first command of ¼ identifies the gain and both worlds dock exactly. Docking tolerates a sensor error ε exactly when ε < (U + ½)/4, so choosing the probe and the feedback together raises the tolerable error from 1/8 to 5/16 on the same actuator. With the packet late, no causal controller docks in both worlds. When a third gain 33/32 is admitted it aliases with gain 1 at an error radius of 1/64, exact docking becomes impossible, and every label that was feasible reverses. These are known answers (Appendix M).
  • NS-23 An energy-budget safety claim [M4]. Before: a safety statement about a humanoid stepping off a kerb depends on a contact model that nobody trusts at impact. After: the claim is stated as an .fenergy budget: the kinetic and potential energy that can arrive at the ankle on a 12 cm step-down is below what the joint and its bump stop are rated to absorb, with every term taken from the energy ledger. No contact law enters the claim. A runtime shield enforces the budget as a filter on commands, at a measured cost and with a statistically measured margin. The claim product is Tested, and the type offers no conversion to Proved.
  • NS-24 The sealed ten-fold tournament [M7]. Missions in named strata are sealed, and some worlds come from an evaluator independent of both arms. The rival is the strongest composed incumbent workflow, improved by a competent baseline engineer on development fixtures and then frozen. Both arms get the same agent model, token budget, hardware envelope and prior information, in fresh contexts. A neutral adjudicator releases paired receipts after both arms close. The report gives, per stratum, the ratio of restricted mean times with its interval, cold and warm separately, the crossover reuse count, and a phase ledger for each arm that sums to wall-clock. Every submitted certificate is replayed by frob-verify, and one false certificate disqualifies that arm from the scoped claim. Where the composed-incumbent arm ties, the report says so and the layer ships for that stratum.