The Recursive SpiralRFPA/AVPT & the Odisena Infinity Engine

Appendix C

Appendix C — The RFPA Framing Canvas

A one-page canvas to complete before opening any Infinity Engine loop (Chapter 10). Reproduce and fill for each loop.

Loop name / identifier: _______ Date: _______ Owner: _______

RECOVER — the verified prior state

  • Required state bundle (minimal prior state to continue and reverse): _______
  • Location of each element (checkpoint / snapshot / log): _______
  • Integrity verified (hash/checksum matches)? ☐ Yes ☐ No
  • Conventions confirmed (units, versions, indexing)? ☐ Yes ☐ No
  • Reversal possible to a known-good point? ☐ Yes ☐ No
  • Recover PASS only if all boxes are Yes; otherwise the loop does not open.

FIELD — the declared boundary

  • Scope (what is in): _______
  • Exclusions (what is deliberately out — incl. private/personal/security-sensitive): _______
  • Conventions (indexing, units, defaults, naming): _______
  • Audience (and therefore what may/may not be shown): _______
  • Domain of validity (where claims hold, and where they stop): _______

PRINCIPAL — the governing rule

  • The one governing rule (single sentence): _______
  • Invariants it guarantees: _______
  • Cheap checks for each invariant (analogue of Cassini): _______
  • Response to a violated invariant (should block promotion): _______

ASSUMPTION — the registered inputs

  • Load-bearing assumptions (with owner and falsification test): _______
  • Blast radius of each (what depends on it): _______
  • Change discipline (branch/version on change; never silent edit): confirmed ☐

GATE: All four moves PASS? ☐ Yes → loop may open. ☐ No → fix the failing move first.