FrankenRobotics

Plan hygiene rules

806 wordsPlan version 1.1

The first eight come from what the sibling plans recorded about their own mistakes. The rest come from the reviews, audits and paper-scale pilots behind this version (§0.8).

  • The delivery log lives in docs/delivery/, never in this plan. FrankenTextiles' §25 grew to 82% of its plan (FACT: Mining §0.7). This document states decisions; crate contracts and beads state progress.
  • A closed bead is not acceptance. FrankenMining found 87 beads closed within 12 seconds with one shared close reason, serving figures from a stand-in (FACT: Mining App. K.2). Here a bead closes with a typed reason that cites its own test, and gates require a live-dependency proof (§38).
  • Process is never the product. FrankenMining's xtask reached about 27% of its code (FACT: audit of franken_mining). xtask here has a hard scope: six checks, listed in §34. A new check needs a named defect class it would have caught. The same rule covers every registry, ledger and receipt this version adds: each exists because a named verb reads it or a named gate checks it, and one that nothing reads is deleted.
  • Line counts are scope caps, never schedules. Per-crate figures in §34 are caps that trigger a scope conversation at 115%. FrankenTextiles set a ceiling and retired it at 1.9× (FACT: audit of franken_textiles).
  • Every number carries a label (§0.1). Performance numbers also carry the disclosure block of §36, and any ratio against an incumbent carries the measurement protocol of §39.
  • The seven claims are never conflated (§8), and each gate names exactly one of them.
  • Mathematics is written in Unicode, without LaTeX, and every symbol is defined in §11 or Appendix D.
  • Sibling repos are the owner's, and this program changes them. A limitation, defect or mismatch in a sibling is fixed in that sibling's repository, under its own AGENTS.md, gates and conventions, as an upstream work item (Appendix F): a bead in this program's graph with the label upstream, mirrored as a bead in the sibling's tracker. Every upstream work item carries an interim posture and a switch-over rule, so no milestone waits on a sibling change landing.
  • Every Frontier and Moonshot item needs a paper-scale pilot with a falsifier before it is funded. A pilot is small enough to run on a CPU in a day, uses exact or hand-checkable arithmetic where it can, is registered before it runs, and has an outcome that is not known in advance. A pilot that cannot fail is not a pilot. Its result, including a negative one, is recorded in the review log (Appendix K) and its mechanism's tier and scope are revised to match.
  • The ceiling is computed before any speed test. Before a speed comparison is locked, the ceiling implied by the work both arms share (authoring, checking, serialization, review) is computed, and the test is refused if the ceiling is below the claimed ratio. One pilot behind this version measured a specialized solver at 1.345× a composed one warm and 1.088× cold, with a residual of 575.7 µs that the solver does not touch (parsing, assembly, checking, serialization and harness, not separately timed), so that no solver could have shown more than about 1.46× (842.8 ÷ 575.7; FACT, Appendix K): the test could not have confirmed the claim it was run to test.
  • A frozen decision rule is enumerated before sampling. For every fixed-n rule the set of reachable verdicts at that n is listed first. One pilot rule with 64 pairs could return three of its four verdicts; the fourth was first reachable at 86 pairs (FACT, Appendix K).
  • Counterexamples are first-class. Where a plausible shortcut is wrong, the plan gives the smallest hand-checkable case that breaks it, and the case enters the negative-control registry (§38) and the counterexample catalogue (Appendix N). A rule that ships without such a case has not been thought through.
  • Killed ideas stay on the page with the calculation that killed them (Appendix C). A mechanism whose strong form was refuted is not built in that form, and its narrowed form is written with the claim that survived (§0.8).
  • Mechanisms are named plainly. A label from a richer theory is used only when the mechanism uses that theory's theorems. A least-squares pose graph is a least-squares pose graph.
  • A gate needs only what a simulator has. A gate that needs a physical board, a bench measurement, a building scan or a human review panel is written as an import lane with a recorded no-claim until the data exists (§30).
  • The incumbent is measured before a mechanism is funded against it. Versions are pinned, the strongest warm configuration is recorded, and the phase ledger of the incumbent loop is taken on trj before any ratio is written (§39).