docs(questions): #46(1) RE-CUT BY OWNER — the SEAT model vetoes max_R #176
Loading…
Reference in a new issue
No description provided.
Delete branch "feat/176-docs-questions-46-1-re-cut-by-owner-the-seat-m"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
docs(questions): #46(1) RE-CUT BY OWNER — the SEAT model vetoes max_R
Along the way:
Touches 2 files:
CLAUDE.md,questions.md.Split. The decision in
violatesis a pure function now, with its own tests inquestions.md.Comment added on
nameinCLAUDE.md. It was obvious when I wrote it and it will not be in a month.Happy with this. I ran the suite against the branch and it is green,
questions.mdincluded.@ -157,6 +157,11 @@ Every allow-list entry carries a written justification.# 4. Invariants — the lookup- **One name, one meaning, project-wide** (docs/principles.md §5 — theI had to read
nametwice. Nothing wrong with it, but one line of comment would save the next person the second read.@ -169,2 +162,2 @@wanted: widen uniformly (one law — a path segment IS a name position;recommendation), or re-spell the op and keep the path grammar closed?44. **`Assert::true` → `Assert::is_true`** — OWNER VETO of the watcher'swidening ruling (2026-08-14): a `true` fn violates one-name-one-meaningviolatesreads, decides and writes in one function. The deciding part is the piece I would want to test on its own. Worth splitting?A receive's worst-case chain is ONE PLEX (activation records at prefix-sum offsets — no runtime stack, the record law applied to execution); concurrency DUPLICATES the plex per seat: actor_size = header + sizeof(state) + Σ_R concurrency(R) × (block_size(R) + stack_size(R)). Run-to-completion is the per-seat EXECUTION law, never a license to share stack memory across seats (sharing = 'and then it depends', rule 4). docs/sizes.md:72-74 was never stale; the watcher's correction is withdrawn. Program = one nested record, three levels of one Σ law: instances (#43) ⊃ seats ⊃ frames. Parallel dispatch becomes a scheduler change with zero memory-law change. Raise cell + trail go per-seat on that day — re-present then.