What does Step-Down Communication Protocols conclude, in numbers, about “The Empirical Loop: A Step-Down Ledger, Field Tools and Checker Specifications”?
Answer: Chapter 8 gives the step-down ledger, a field checker tool with its specifications, and a pre-registered test with 198 records per arm; in the synthetic ledger green records have a rework rate of 0.115 against 0.520 for red ones. Marked boxes separate published evidence, runnable Python calculations (22 programs), classical sources and the author's hypotheses.
Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; the book offers no psychological assessment or clinical judgement, names no real person or case, and is general, not personalised, advice on business communication. Chapter 8 gives the step-down ledger, a field checker tool with its specifications, and a pre-registered test with 198 records per arm; in the synthetic ledger green records have a rework rate of 0.115 against 0.520 for red ones.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.115, 0.520
240 records: green 61 red 179 rework rate green 0.115 red 0.520 all 0.417 rule records rework if flagged rework if not R1 80 0.700 0.275 R2 137 0.533 0.262 R3 14 0.286 0.425 R4 20 0.450 0.414 R3 within same-domain k = 0: 0.286 (14) vs 0.125 (8) monthly review, 4 blocks of 60 records month 1: red share 0.700 rework 0.450 month 2: red share 0.800 rework 0.483 month 3: red share 0.683 rework 0.283 month 4: red share 0.800 rework 0.450
Show the full program
# Chapter 8. p81: a synthetic step-down ledger and its red flags.
# 240 seeded records. Each: receiver domain (same / cross), skipped
# steps k (0..4), whether a long chain (n >= 6) was spelled out in full
# to a same-domain receiver, instructions in the message (1..3), read-
# back method and rounds, and a reviewer's flag for disparaging words.
# Outcome model (all from earlier chapters, illustrative):
# m0 = 1 - p^k * E[0.5^excess] (p22), p = 0.9 same / 0.65 cross;
# full spell-out to same-domain receiver adds 0.10 (p31, p33);
# read-back residual m0 * (1 - d g)^r, d 0.35 echo / 0.80 analogy,
# g 0.9 (p41); disparaging words halve d (p63: asking costs more);
# instructions kept with exp(-0.2 j (j - 1) / 2) (p52).
# Rules: R1 k >= 2 with no read-back; R2 more than one instruction;
# R3 full spell-out to a same-domain receiver; R4 disparaging words.
import math
import random
RNG = random.Random(43181)
N = 240
CAP_W = ((3, 0.25), (4, 0.50), (5, 0.25))
D = {"none": 0.0, "echo": 0.35, "analogy": 0.80}
def wm(k):
return math.fsum(w * 0.5 ** max(0, 2 + k - c) for c, w in CAP_W)
def record():
same = RNG.random() < 0.5
k = RNG.randrange(5)
full = same and k == 0 and RNG.random() < 0.5
j = RNG.choice([1, 1, 1, 2, 2, 3])
method = RNG.choice(["none", "none", "echo", "analogy"])
rounds = 0 if method == "none" else RNG.choice([1, 2])
rude = RNG.random() < 0.08
p = 0.9 if same else 0.65
m0 = 1.0 - p ** k * wm(k) + (0.10 if full else 0.0)
d = D[method] * (0.5 if rude else 1.0)
m = m0 * (1.0 - d * 0.9) ** rounds
keep = math.exp(-0.2 * j * (j - 1) / 2.0)
rework = RNG.random() < 1.0 - (1.0 - m) * keep
flags = []
if k >= 2 and rounds == 0:
flags.append("R1")
if j > 1:
flags.append("R2")
if full:
flags.append("R3")
if rude:
flags.append("R4")
return flags, rework, same and k == 0
def rate(rows):
if not rows:
return 0.0
n = 0
for _, rw, _ in rows:
if rw:
n += 1
return n / len(rows)
if __name__ == "__main__":
rows = [record() for _ in range(N)]
green = [r for r in rows if not r[0]]
red = [r for r in rows if r[0]]
print("{} records: green {} red {}".format(N, len(green), len(red)))
print(" rework rate green {:.3f} red {:.3f} all {:.3f}".format(
rate(green), rate(red), rate(rows)))
print(" rule records rework if flagged rework if not")
for rule in ("R1", "R2", "R3", "R4"):
hit = [r for r in rows if rule in r[0]]
miss = [r for r in rows if rule not in r[0]]
print(" {:<4} {:>7} {:>17.3f} {:>13.3f}".format(
rule, len(hit), rate(hit), rate(miss)))
base = [r for r in rows if r[2] and "R3" not in r[0]]
full = [r for r in rows if "R3" in r[0]]
print(" R3 within same-domain k = 0: {:.3f} ({}) vs {:.3f} ({})"
.format(rate(full), len(full), rate(base), len(base)))
print("monthly review, 4 blocks of 60 records")
for i in range(4):
blk = rows[60 * i:60 * (i + 1)]
nred = 0
for f, _, _ in blk:
if f:
nred += 1
print(" month {}: red share {:.3f} rework {:.3f}".format(
i + 1, nred / 60, rate(blk)))Single source and citation
Fan, Y. (2026). Step-Down Communication Protocols for High-Clock-Speed Minds: Cognitive-Bandwidth Matching, Inference-Gap Bridging and Zero-Friction Alignment (Version 1.0.0), Chapter 8: The Empirical Loop: A Step-Down Ledger, Field Tools and Checker Specifications. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-431 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026431,
author = {Fan, Yafu},
title = {Step-Down Communication Protocols for High-Clock-Speed Minds: Cognitive-Bandwidth Matching, Inference-Gap Bridging and Zero-Friction Alignment},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · High Clock Speed Is Not an Intelligence Ranking: Chunk Compression and Domain Expertise
- Chapter 2 · A Step-by-Step Reconstruction Model: Skipped Steps, Loss Rates and Working-Memory Overflow
- Chapter 3 · Expertise Reversal: The Best Number of Bridging Steps Depends on the Receiver's Chunk Dictionary
- Chapter 4 · Read-Back Checks: Repetition Codes, Analogy Restatement and an Upper Bound on Residual Misunderstanding
- Chapter 5 · Shannon's Formula as Analogy Only: Channel Capacity, the Central Bottleneck and One Instruction per Message
- Chapter 6 · The Curse of Knowledge and the Conversation Game: Conclusion First, the Price of Asking and Total Coordination Time
- Chapter 7 · Classical Sources East and West: the Xue Ji on Not Skipping Joints, the Analects on Readiness, Aristotle's Shortened Syllogism and Descartes' Seventh Rule