From cb1d6d6790c3dc6e85e37a3987ab5d5e69308964 Mon Sep 17 00:00:00 2001 From: Claude Date: Thu, 19 Nov 2026 14:59:24 +0000 Subject: [PATCH] ABI choice 6: the safe moment is a heartbeat tick at which no P or return stack is inside the old code Co-Authored-By: Claude Opus 5.5 Claude-Session: https://claude.ai/code/session_017RzZgrf7V7Zk2iczBXDRbm --- docs/v4.0.0/ABI.md | 7 +++++-- 1 file changed, 5 insertions(+), 2 deletions(-) diff --git a/docs/v4.0.0/ABI.md b/docs/v4.0.0/ABI.md index 2ecb66e9..95545ea0 100644 --- a/docs/v4.0.0/ABI.md +++ b/docs/v4.0.0/ABI.md @@ -176,7 +176,10 @@ capsule-blocks.md` §5), and Artemis keeping what is kept (ruling 3). word, and every caller, compiled at run time or not, follows at once. The old code stays in place, unreachable but for that cell, until it is retired. The new word must be within the jump's reach from the old entry (27 bits in slot 0, which covers a node's memory), or activation is refused. -6. **The safe boundary:** how the system knows no node is inside the old word. It could scan return stacks - at a heartbeat for return addresses in its range, or wait until the node is idle at its prompt. +6. ~~The safe boundary~~ **Ruled 2026-11-19: "Scan at a heartbeat".** At a heartbeat tick the kernel + scans every node's P and return stack for an address inside the old words' code. When none is there, it + writes all of a set's jumps in that one tick. While some are there, it tries again on later ticks. A + message waiting for an old word is not code on a stack and does not hold the set back: the word it + reaches is the new one. 7. **Proofs:** which of ADR §5's properties come first in Isabelle/HOL. Placement's fail-closed checks and compatibility (§7) are the smallest.