FrankenRobotics

Doctrine

1,225 wordsPlan version 1.1

The owner's brief is that the whole robot design, simulation and control problem be formulated in the language of abstract algebra and Lie theory, and that this machinery guide the system instead of decorating it. The rules below are how that brief is kept honest. D-1 to D-8 govern how mathematics enters the system. D-9 to D-19 govern how a mathematical claim is allowed to leave it.

  • D-1 Algebra first, numbers last. The primary description of every object is algebraic: a group, an algebra, a cone, a representation, a poset. Floating-point arrays are a lowering of that description, produced as late as possible and by a replayable derivation.
  • D-2 No ornamental mathematics. A construction earns its place with four things: a Rust type, a verb an agent can call, a test that fails when the mathematics is wrong, and a measured payoff or a date by which the payoff is measured. A construction missing any of the four is moved to Appendix C as parked or rejected. The rule also binds vocabulary: a mechanism is named by what it computes, and a term from a richer theory is used only where a theorem of that theory is used.
  • D-3 Group elements, not coordinates. State is stored as group elements. Coordinates (angles, Euler triples) appear only at import, export and display, each at one boundary.
  • D-4 Structure is a test oracle. Every conserved quantity, every symmetry and every algebraic identity is a metamorphic test that costs nothing to state. The Gauntlet's property tier is generated from Part II (§38).
  • D-5 Proof classes are typed, and the weakest link wins. Proved, Certified, Tested, Estimated are distinct evidence classes (§12.2). A result is no stronger than its weakest input, and the type that carries a combined result has no conversion to a stronger class.
  • D-6 The moonshot budget is capped. At most four M items are active at once. An item is active from the funding of its pilot until its expiry gate; the others wait in the register of Appendix C. Each has a falsifier and an expiry gate. Nothing tagged M is on the critical path of §43.
  • D-7 Derive, don't hand-write. The arithmetic of a kernel comes from a symbolic derivation with a content hash (C-14). Hand-written arithmetic is allowed in the referee tier and in kernel skeletons (loops, gathers, sorts), not in the mathematical core of a batched kernel.
  • D-8 Every domain ships its adjoint or its excuse. A kernel either has a derivative program or a recorded reason it does not, with the estimator that replaces it (inherited from FrankenSim's expansion charter, D8).
  • D-9 A plausible shortcut ships with its counterexample. Where an obvious simplification is wrong, the plan states the smallest case a reader can check by hand that breaks it, and that case becomes a permanent negative control (Appendix N; the negative-control registry of §38). Examples in this Part: taking the lower three rows of a space Jacobian (C-04), projecting an action and then clipping it (C-31), intersecting per-world answers (C-18), and accepting pairwise compatibility as joint compatibility (C-19).
  • D-10 Every Frontier or Moonshot construction has a pilot and a ceiling. Before its work package is funded, an F or M construction runs a paper-scale pilot with a written falsifier. Before any speed test, it states the most the mechanism could gain. If a fraction f of the matched wall time is improved by a factor r and the method adds overhead h, the gain is at most 1/(1 − f + f/r + h); a pruning ratio is never multiplied by a speedup measured on work already removed.
  • D-11 A hash identifies; only an implication licenses skipping a recheck. A content hash says that two artifacts are the same bytes. It never says that a verdict about one transfers to a different one. A verdict is reused after a change only under a recorded implication: polarity in the assumption lattice (C-18), a monotonicity argument, a symmetry together with its stabilizer check (C-09), or equality of every dependency. A checker rejects an unknown proof kind or a changed quantifier even when every hash is consistent.
  • D-12 Quantifiers are part of the claim. A claim names the order of its quantifiers, the population it ranges over, and the information available to the policy when it acts. Evidence for an easier quantifier order, such as a separate policy per world where one policy for all worlds was asked, is rejected by type (C-17).
  • D-13 Answers are two-sided, and unknown is a verdict. A set-valued answer is an inner set, an outer set and the unresolved remainder between them. A point answer carries a witness or a refutation of matching scope. A solver failure, a timeout or an unenclosed branch yields unknown; it never yields failure and never success.
  • D-14 Symmetry is used only where it holds. A symmetry of the mechanism is intersected with the stabilizers of payload, gravity, task, observation and contact mode before it reduces any calculation. Augmenting data with a transformation that preserves a distribution and reducing one world by a transformation that preserves that world are different operations with different preconditions (C-09).
  • D-15 A derivative carries its validity label. Extending D-8: every derivative that leaves a kernel or an analysis says whether it is smooth, a saltation composite, a fixed-mode conditional, one-sided, generalized, smoothed or a finite difference, and a query near grazing or an ambiguous event order is refused by name (C-16).
  • D-16 Exploration and certification are separate lanes. A method that finds failures quickly (splitting, adaptive search, a discovery run) issues no bound. A bound comes from a lane whose validity does not depend on where the search looked: crude sampling, bounded-weight importance sampling, or a sealed confirmation run that discovery could not read (C-27, §24).
  • D-17 A specialized method names the generic method it must beat. Each construction that claims an advantage names the off-the-shelf method that answers the same question: a lifted linear program, a satisfiability solver, a reachability tool, successive halving, a plain transformer. If the generic method ties, the plan says so and ships the generic method. FACT (planning pilot, to be re-run in this repository before a gate cites it): on the static-stance family of C-32 a lifted robust linear program and the specialized projection each reached the optimum in one solve.
  • D-18 A strict decision is computed exactly. Predicates with strict comparators, digests and certificate arithmetic run in an exact-integer kernel class, in exact rationals, or in guarded single precision with an exact fallback (§35). FACT (same pilot archive, same caveat): an unguarded f32 screen of 65,536 boundary cases produced 452 false admissions and 23,438 false exclusions, and a guarded or integer kernel produced none.
  • D-19 A model assumption is an input with a name. Actuator authority, load-sharing law, hidden-parameter support, delivery deadline and controller information are fields of the claim, not prose around it. FACT (same archive): changing one winding feed-forward term in a sampled wheel controller moved a one-tick spectral radius from 1.48 to 0.92 and changed 24 of 156 task labels; admitting one extra hidden gain reversed every feasible label on the pilot's grid of the docking fixture of C-19.