From 8c1f3c4d3845380ea782bdc77ef303bb9b24ad96 Mon Sep 17 00:00:00 2001 From: Claude Date: Fri, 30 Oct 2026 10:50:22 +0000 Subject: [PATCH] =?UTF-8?q?docs:=20D=C3=BCtsch=20protocol=20=E2=80=94=20ad?= =?UTF-8?q?opt=20Grok's=20cycle-index=20labels=20(K=20=3D=20first=20scored?= =?UTF-8?q?=20cycle)?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Same cycles and pairs as 8505a723, relabelled: proof pairs 3→4..5→6 give K_case = 7, window K..K+2 with remain-settled pairs, last scored cycle 11. Co-Authored-By: Claude Opus 5.5 --- docs/validation/duetsch_re100_kc5_protocol.md | 24 +++++++++---------- 1 file changed, 12 insertions(+), 12 deletions(-) diff --git a/docs/validation/duetsch_re100_kc5_protocol.md b/docs/validation/duetsch_re100_kc5_protocol.md index db797d3..9e90c73 100644 --- a/docs/validation/duetsch_re100_kc5_protocol.md +++ b/docs/validation/duetsch_re100_kc5_protocol.md @@ -140,17 +140,17 @@ quarter `s/T < 0.25`. Pair p_k compares cycle k−1 with cycle k. - Discarded: cycles 0, 1, 2 (s/T < 2.25). Pairs are formed only between cycles ≥ 3, so the first pair is p_4 (3 → 4). -- Settling proof for a case: the earliest K_case such that p_{K-2}, p_{K-1}, - p_K all pass (three consecutive pairs over cycles K−3 .. K). Earliest - possible: K_case = 6 (pairs 3→4, 4→5, 5→6). -- Scored window (after the proof): cycles K+1, K+2, K+3 with - K = max over compared cases of K_case. The case must stay settled - throughout: pairs p_{K+1}, p_{K+2}, p_{K+3} must pass as well, otherwise - FAIL-CLOSED. -- Cap: cycle k ends at s/T = 0.25 + k, so the window ends at s/T = K + 3.25 - ≤ 12 ⇒ K ≤ 8. Allowed: K = 6 (window 7–9, ends 9.25 T), 7 (8–10, - 10.25 T), 8 (9–11, 11.25 T). K_case > 8 for any case → FAIL-CLOSED. -- Every case is run to the end of cycle K + 3 (proportionally more native +- Settling proof for a case: three consecutive pairs all pass; K_case = the + first cycle AFTER the last of those pairs. Earliest possible: pairs 3→4, + 4→5, 5→6 pass ⇒ K_case = 7. +- Common window: K = max over compared cases of K_case; every case scores the + same three complete cycles K, K+1, K+2 and must stay settled throughout: + pairs (K−1→K), (K→K+1), (K+1→K+2) must pass on every case, otherwise that + case is FAIL-CLOSED (an earlier local settle does not waive this). +- Cap: cycle k ends at s/T = k + 0.25, so the last admissible scored cycle is + 11 (ends 11.25 T) and K ≤ 9. Examples: K = 7 → cycles 7–9 (ends 9.25 T); + K = 9 → cycles 9–11 (ends 11.25 T); any K_case > 9 → FAIL-CLOSED. +- Every case is run to the end of cycle K + 2 (proportionally more native steps on finer grids). - Discard: the initial quarter cycle plus the first 2 full paper cycles (s/T < 2.25). Settling is searched from cycle 3; cap 12 periods from s = 0; @@ -193,7 +193,7 @@ cap and the earlier tolerance numbers. ## 6a. Driver unit tests (CPU, before any run) - Phase/cycle arithmetic: s ↔ (k, φ), cycle boundaries, bin membership, - window/cap selection for K = 6, 7, 8, 9. + window/cap selection for K = 7, 8, 9, 10. - Solid-aware interpolation: all-fluid, partial-solid (renormalized weights), no-fluid (MISSING) and inside-circle cases. - Interval-averaged Morison bases and the two-parameter fit on a synthetic