Answer A-20: the gate's kept data moves with the fewest parts that lose none

Claude-Session: https://claude.ai/code/session_01JG73KEq4zoDfM9WtYpcQgZ
2026-11-11 21:54:44 +01:00
parent 99d9721ff3
commit b057329e65
1 changed files with 6 additions and 0 deletions
@@ -76,3 +76,9 @@ names the principle that settles it, and is cited as "design 47 G A-n".
  durable; the read's messages go to the same handler as the durable's, so one path handles both; it names the read
  `waiting` and then `read` through one callback option it calls, which the module wires to its first views, so
  `process` imports nothing of `views`.
+- **A-20** (§613, replaces A-8's way of opening the old section; principles 7 and 2, and no data is lost) The gate keeps
+  its kept data with the fewest parts that lose none: where the template `state` entry can take the old section's
+  existing bucket as its own, it does, and nothing is copied; where it cannot, the old section stays declared in
+  `state` under the local name `<name>-old` bound to its existing bucket, read through `stdio.State` like any section,
+  copied once by A-8's rule (a key only where the template lacks it), and retired with §613's other old sections.
+  The developer says which of the two the runtime allows, with the line of code that shows it.