Twelve principles
838 wordsPlan version 1.1
Each principle is the short form of a section. The plan stands or falls with them.
- Algebra first, numbers last, and no ornamental mathematics. State is stored as elements of Lie groups and advanced by maps that stay on the group. Every hot kernel is the image of an algebraic object under a derivation we can replay, with a content hash. A construction stays in the plan only if it owns a type, a verb an agent can call, a test that fails when the mathematics is wrong, and a measured payoff or a kill date (§9, §10, §13, §21).
- One model, three tiers, one ledger of disagreement; the CPU reference is permanent. The referee tier, the CPU batch tier and the GPU tier run the same model, and their differences are measured and stored, never assumed away. GPUs propose and the referee disposes: a fast-tier result is provisional until it is promoted, and any world can be re-run alone on the CPU from its address (§16, §21, §29).
- Compose, don't enumerate; a body is data. A robot is a composition of modules over typed ports, which is also FrankenSim's governing rule. Because a design lowers to tables and not to code, many different robots run in one batch, a new design recompiles nothing, and the unit of dispatch is a family (§14, §17).
- Consume the suite, never fork it, behind one airlock. FrankenSim is taken by path dependency and pinned by commit; one crate names its volatile types. Every sibling is the owner's, so what is missing or wrong in one is changed there, in its own repository and under its own rules, as an upstream work item with a failing fixture, an interim posture and a switch-over rule. Fallbacks are named in order before they are needed (§33).
- Check before you simulate, simulate before you train, train before you claim; every design stands on day one. Static analyses return in seconds with typed repairs. A baseline estimator and controller are synthesized from the model, so no design waits for a learned policy before it gets feedback. Each rung of the ladder is trusted only as far as its measured rank agreement with the rung above (§22, §23, §28).
- The unit of work is a decision over a family of designs, not a score for one design. A mission names the design family, the worlds, what the controller may observe and when, and the quantifiers that relate them. The answer is an inner set, an outer set, witnesses, and the next experiment. The body, a sensor, the timing of a packet and the building are all design variables (§19, §20, §25).
- Counterexamples are an output. The system searches for the world that breaks a design, shrinks it to the fewest edits that still break it, and ships it as a regression. Every rule in this plan travels with the smallest hand-checkable case that defeats a plausible shortcut, and every gate has a negative control it must catch (§26, §38, Appendix N).
- An edit invalidates evidence. A hash identifies an artifact; only an implication licenses skipping a recheck. After any edit the system says which verdicts survive, which are withdrawn and what it would cost to restore them. One false reused verdict kills the reuse rule that produced it (§28, §29).
- Discovery cannot read confirmation worlds. Search, tuning and training run in an open lane. Qualification runs on fresh sealed world clusters with pre-committed requests and an error budget that shrinks with each submission, so the error rate holds across an agent's adaptive retries. Anytime-valid studies and fixed-n studies are both offered and never mixed inside one study (§24).
- A proof is what a checker accepted; the weakest input wins and nothing is laundered into a proof. Every result carries a claim product whose class is set by its weakest input, by construction of the type. A certificate about a family travels in a bundle that an offline auditor re-checks. The word "verified" is not used, and every exported artifact says in machine-readable form that it authorizes nothing (§8, §12).
- Refuse by name, never approximate in silence;
unknownis an answer. A request outside a validity domain gets a typed refusal with ranked repairs or a separating witness. A solver that fails leaves the verdict unknown; it does not become a failure of the design. Under load the system sheds presentation or refuses; it never lowers the physics tier of a running world (§35, §25). - Engine speed is parity, not the thesis; a number is a target until a gate records it. Throughput must match the incumbents and is not where the gain is sought. A recorded number names its world count, time step, substeps, solver iterations and contact count; a ratio against a rival names the rival's frozen configuration and every cost in the denominator; and a speed test is run only after its ceiling has been computed (§2, §36, §39).