Goals, non-goals, anti-goals
2,429 words3 subsections2 tablesPlan version 1.1
On this page3
6.1 Goals
GOAL-01 to GOAL-20 are carried from version 0.2, with wording corrected where the incumbent audit showed the old wording claimed too much. GOAL-21 onward are new. A tier tag on a goal is the tier of its least certain mechanism; a goal with no tag is S.
| ID | Goal | Primary section |
|---|---|---|
| GOAL-01 | Simulate articulated robots with contact at referee quality on the CPU, built on FrankenSim, with a transactional, event-located step. | §16 |
| GOAL-02 | Simulate thousands of worlds per device on CUDA and on Metal from one kernel source, at parity with published incumbent throughput on the same hardware. | §16, §21, §36 |
| GOAL-03 | Support legged robots: quadrupeds, hexapods and other multi-legged layouts, bipeds and humanoids. | §14 |
| GOAL-04 | Support wheeled robots (differential, Ackermann, omnidirectional), tracked robots, and hybrids such as wheel-legs and stair-climbing wheel clusters. | §18 |
| GOAL-05 | Provide terrain: slopes, stairs, gaps, stepping stones, rubble, and soft ground. | §19 |
| GOAL-06 | Provide interiors as seven archetypes from one grammar system: homes, apartments, offices, warehouses, manufacturing plants, retail stores, commercial kitchens, generated from grammars and ingested from scans. Generators for homes, kitchens, retail stores and warehouses exist elsewhere; none was found for manufacturing plants or commercial kitchens. | §19 |
| GOAL-07 | Formulate design, simulation and control in Lie theory and abstract algebra, with every construction load-bearing. | Part II |
| GOAL-08 | Use FrankenSim, FrankenTorch, FrankenNumpy, FrankenSymPy, FrankenLean and fastmcp_rust for what each can really do today, and do the rest as upstream work items in their repositories. | §33, App. F |
| GOAL-09 | Give agents a design studio: typed designs, typed edits, static analysis, simulation, comparison, telemetry, optimization. | §28, §32 |
| GOAL-10 | Make any world reproducible: re-run any world alone on the CPU from its address, bit for bit where the device reaches class D1, and independent of the batch it ran in. A hypothesis until GATE-SPARK-01, GATE-SPARK-02 and the batch-composition invariance test pass. | §29, §35 |
| GOAL-11 | Account for energy: a per-actuator and per-contact balance in which every joule that enters a rollout is attributed to where it went, closing to a stated residual. | §29 |
| GOAL-12 | Model actuators honestly: torque-speed and voltage limits, reflected inertia, friction, joint stiction and backlash, delay, heating, battery sag. This is parity with the best incumbent actuator models and is not claimed as new. | §15 |
| GOAL-13 | Synthesize a baseline estimator and controller for any well-formed design, per morphology class, in seconds, with no per-robot cost tuning. | §22 |
| GOAL-14 | Train policies on device with PPO first, with correct gym semantics (explicit reset with the final observation preserved; termination distinguished from truncation; the likelihood of the applied action), and with equivariance available where robot, sensors and task share a symmetry. | §23 |
| GOAL-15 | Compare designs on common world addresses under one of two declared study types, anytime-valid e-processes or fixed-n exact tests, never mixed inside one study. | §24, §28 |
| GOAL-16 | Detect results that depend on simulator artifacts or on model form before they are reported: promotion between tiers, exploit detectors, a model-form rank check, a work–energy audit of the simulator. | §16, §23, §28 |
| GOAL-17 | Attach offline-checkable certificates of algebraic identities to derived kernels and to selected safety claims. | §12 |
| GOAL-18 | Expose everything through one verb registry that generates the CLI, the MCP tools (built on fastmcp_rust), the schemas and the documentation. Every verb carries a compute budget, provenance and a typed refusal. | §32 |
| GOAL-19 | Simulate the sensors a robot would carry, with the ways real ones fail: encoders, IMU, force and contact, depth, lidar, height scans, and cameras with exposure and rolling-shutter timing. | §20 |
| GOAL-20 | State determinism as a class on every result, and test it. | §35 |
| GOAL-21 | Answer mission queries over design families: inner and outer design sets with witnesses, exclusions with impossibility witnesses, unresolved cells, and the next experiment. F | §25 |
| GOAL-22 | Run many different robots in one batch: per-world model variants inside padded capacities and size buckets, with no recompilation per design. S within one topology, F across topologies. | §17 |
| GOAL-23 | Decide most designs without per-design training: family policies per morphology class and inheritance along lineage edges, each admitted by measured rank agreement. F | §23 |
| GOAL-24 | Qualify a result so that the error rate holds across an agent's adaptive retries: a blinded lane on fresh sealed world clusters. | §24 |
| GOAL-25 | State missions as requirements: a bounded-time requirement language as the acceptance metric and as a falsification score, beside the reward terms that training keeps. | §24 |
| GOAL-26 | Search for the worlds that break a design, inside legality bounds and with a solvability witness, and reduce each failure to a minimal counterexample world. F | §26 |
| GOAL-27 | Bound rare failure rates with valid estimators, keeping exploration apart from certification. | §26 |
| GOAL-28 | Explain a failure by intervention on forked replays, with a stability figure on every attribution. | §27 |
| GOAL-29 | Say which verdicts survive an edit, memoize everything downstream of identity, and never return a stale verdict. | §28, §29 |
| GOAL-30 | Treat time as part of the model: rational periods with phase accumulators, seven distinct instants per sample, and packet queues in every checkpoint. | §20 |
| GOAL-31 | Treat sensing as part of feasibility and of symmetry: observation-alias witnesses that show when no policy on the present sensors can succeed, observability analysis, and the observation-preserving subgroup. F | §20, §28 |
| GOAL-32 | Make the world a design variable: clearance complexes that return a route witness or an impossibility cut, and a priced retrofit catalogue that shares one budget with robot edits. F | §19 |
| GOAL-33 | Model worlds that the robot changes: a film-friction law and rigid proxies in the core; advected films, slosh, cables and cloth behind flags. S core, F and M behind flags | §18, §19 |
| GOAL-34 | Offer a safety tier that survives contact uncertainty: energy budgets and runtime shields, classed Tested. F | §22, §12 |
| GOAL-35 | Treat gaits as orbits and skills as artifacts: orbit analysis with continuation in design parameters as a screening rung, and skill artifacts that carry an infeasibility witness when a body cannot produce a task wrench. F | §22 |
| GOAL-36 | Synthesize, not only analyze: bounded exact linkage synthesis and trajectory optimization with design variables. F | §25 |
| GOAL-37 | Calibrate against reality: predictions frozen before comparison, identification from imported measurements, reality bands inside a calibrated family and a refusal outside it. F | §30 |
| GOAL-38 | Produce manufacturable output: structure, tolerance and fatigue analysis and a build packet, every artifact flagged as authorizing nothing. F | §31 |
| GOAL-39 | Carry every result as a claim product, and every family claim in a portable bundle that an independent offline auditor re-checks. | §8, §12 |
| GOAL-40 | Measure the product against the strongest composed rival, with a phase ledger for both arms, and let rival learning stacks drive this environment through a Gymnasium-compatible adapter. | §39, §23 |
| GOAL-41 | Use the two machines for what each is good at, with only seeds, weights and receipts crossing between them. F | §21, §36 |
| GOAL-42 | Give people a view of what agents see: a terminal dashboard, a viewer with physical overlays, and self-contained replay pages. | §32 |
| GOAL-43 | Keep frontier physics and frontier outputs available without putting them on the critical path: Cosserat rods and cables, cloth, slosh, coupled multiphysics islands, a rotor port, tactile hands, firmware export, lifecycle compression, facility co-design and multi-robot handoff. F and M | §16, §18, §19, §31; M6, M8 |
6.2 Non-goals
Version 0.2 excluded several areas outright. Under this version's brief, five of them are admitted in a bounded form, at F or M, behind flags and off the critical path, each with known answers and a kill gate. The identifier is kept and the row states what moved in and what stays out.
| ID | Not in scope | What changed, and the reason |
|---|---|---|
| NONGOAL-01 | A photorealistic renderer. | Unchanged. Sensors need geometry-correct depth, timing and labels first. Hero images come from FrankenSim's path tracer offline (§20). |
| NONGOAL-02 | Full-room fluid, granular or cloth simulation inside every training world, and soft robots as primary bodies. | Narrowed. Cosserat rods and cables, cloth, films advected by the robot, slosh and coupled multiphysics islands are admitted at F or M behind flags (M6). Their S counterparts, a film-friction law and rigid proxies, are in the core. Full-room fluid is out of memory by orders of magnitude (H-16). |
| NONGOAL-03 | Full aerodynamics, and swimming robots. | Narrowed. A compact rotor port for flight is admitted at M (M6). The aerodynamic crates in FrankenSim remain a separate program. |
| NONGOAL-04 | Motor actuation, safety-rated board support, hardware sign-off, ROS integration, and any real-time or hardware-in-the-loop claim. | Narrowed. Firmware export is admitted at M as an exported artifact behind a caller-owned hardware interface, carrying the no-authorization flags, in the frontier-delivery milestone (§43). Bench measurements enter only as imported data (§30). |
| NONGOAL-05 | A general Python API for authoring designs or driving the studio. | Narrowed. The Rust VecEnv is primary. An optional Gymnasium-compatible adapter lives under bindings/, because the ten-fold test needs rival learning stacks to drive this environment (§23, §39). |
| NONGOAL-06 | Windows. | Unchanged. Targets are Linux x86-64 and macOS on Apple silicon. |
| NONGOAL-07 | Dexterous in-hand manipulation benchmarks. | Narrowed. Mobile-manipulation reach and carry tasks are in scope at M4, and tactile hands are admitted at M (M6). In-hand manipulation benchmarks stay out. |
| NONGOAL-08 | General-purpose formal verification of robot controllers; full-order barrier certificates; unbounded proofs about contact chaos or learning convergence. | Unchanged in substance. Lemma covers kernels, a short list of theorem cards, family certificates on small sub-boxes and reduced-order shields classed Tested (§12). |
| NONGOAL-09 | Hardware certification or authorization of any kind. | New. Every exported artifact says in machine-readable form that it authorizes nothing (§8). |
| NONGOAL-10 | One universal policy across all morphologies. | New. Out of reach at an affordable pretraining budget (H-02). Family policies per class only. |
| NONGOAL-11 | Certified isotropic paving of a high-dimensional design box. | New. Out of reach beyond a split set of about six parameters (H-06). Family answers are built per constraint. |
| NONGOAL-12 | Half-precision or tensor-core arithmetic for contact. | New. Refuted (H-15). |
| NONGOAL-13 | Per-design kernel specialization as the default path. | New. Recursion-only specialization is capped near 1.2× (H-04). Survivors only, and only if our own profile justifies it. |
| NONGOAL-14 | Sampling-based control as a stand-in evaluator for a trained policy. The delivered-controller lane of §22.8 is the one exception. | New. It costs thousands of policy rollouts per simulated second (H-01). |
| NONGOAL-15 | Gradients through contact in the rigid core before M6. | Carried from the parked list of version 0.2. Revisited if a rigid legged co-design result shows contact gradients beating population methods. The mechanism and its kill gate are specified in §16.21 M. |
| NONGOAL-16 | Simulated humans as validated agents; browser-based CAD sculpting. | New. Scripted humans appear as scenario dressing only. |
6.3 Anti-goals
Things that would make the product worse even if someone asked for them.
- Lowering physics fidelity silently to keep a frame rate or a throughput figure. Under load the system sheds presentation or refuses; it never changes the physics tier of a running world (FACT: the same rule in the Wright Flyer plan §4.3).
- Wrapping MuJoCo, PhysX or any foreign engine as the production engine. Foreign engines are development-time comparison oracles and the rival arm of the ten-fold test, run out of process (§38, §39). If the composed-incumbent arm ties, the layer ships over that engine openly, under BET-14, and not as a hidden dependency.
- Publishing a throughput number without the disclosure block (§36), or a ratio against an incumbent without the rival's frozen configuration and every cost in the denominator (§39).
- Accepting inertial parameters on faith. An imported model that is not physically consistent is refused or repaired with a recorded repair (§14).
- Putting a language model inside the physics or control loop.
- Hiding nondeterminism. A result whose determinism class is
Unspecifiedis never cited as evidence, and paired statistics are refused under an uncontrolled class. - Mathematical decoration, and ornamental labels on ordinary mechanisms. See D-2.
- Tuning against the confirmation benchmark, or letting discovery read confirmation worlds.
- Improving a time score by lowering the bar for what counts as accepted.
- Converting a tested or estimated result into a proof, by wording or by type. Using the word "verified" for a result.
- Silent clamping of a parameter, a command or a contact count. A clamp is a refusal or a recorded event.
- Multiplying a pruning ratio by a speedup measured on work the pruning already removed, or reporting an operation count as a speedup.
- Running a speed test whose ceiling is below the claim it is meant to test.
- Fast-math switches, fused multiply-add, built-in transcendentals or floating-point atomics in batched kernels.
- Forking a sibling, or patching it locally, where the change belongs in its own repository as an upstream work item; and a milestone that waits on an upstream change with no interim posture.
- A gate that needs hardware, a bench or a review panel the program does not have. Such a gate is an import lane with a recorded no-claim.
- Composing two individually successful episodes and calling the result a composed guarantee.
- A learned correction between tiers, or a learned surrogate of the physics step, which would hide exactly the artifacts the trust ladder exists to expose.
- An exported artifact that could be mistaken for permission to run hardware.