What does Step-Down Communication Protocols conclude, in numbers, about “A Step-by-Step Reconstruction Model: Skipped Steps, Loss Rates and Working-Memory Overflow”?
Answer: Chapter 2 builds the reconstruction model: with each skipped premise completed independently with probability 0.95, reconstruction alone loses 0.143 of three-step jumps, and working-memory overflow raises the loss to 0.518.
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.143, 0.518, 0.95
| A. memory factor E[PHI^excess] by skipped steps k | |
| k | 0: load 2 factor 1 = 1.0000 |
| k | 1: load 3 factor 1 = 1.0000 |
| k | 2: load 4 factor 7/8 = 0.8750 |
| k | 3: load 5 factor 9/16 = 0.5625 |
| k | 4: load 6 factor 9/32 = 0.2812 |
| k | 5: load 7 factor 9/64 = 0.1406 |
| B. loss without and with the memory term | |
| p k recon-only with-memory extra | |
| 0.95 | 1 0.050 0.050 0.000 |
| 0.95 | 2 0.098 0.210 0.113 |
| 0.95 | 3 0.143 0.518 0.375 |
| 0.95 | 4 0.185 0.771 0.585 |
| 0.80 | 1 0.200 0.200 0.000 |
| 0.80 | 2 0.360 0.440 0.080 |
| 0.80 | 3 0.488 0.712 0.224 |
| 0.80 | 4 0.590 0.885 0.294 |
| 0.60 | 1 0.400 0.400 0.000 |
| 0.60 | 2 0.640 0.685 0.045 |
| 0.60 | 3 0.784 0.879 0.095 |
| 0.60 | 4 0.870 0.964 0.093 |
| C. p | 0.95: largest one-step rise in loss is k 2 -> 3 (+0.307) |
| mean of the five rises 0.178 |
Show the full program
# Chapter 2. p22: the extra failure when rebuilt steps overflow memory.
# To rebuild k skipped steps the receiver holds the premise, the
# conclusion and each rebuilt step at once: load L = 2 + k chunks.
# Capacity K is 3, 4 or 5 with weights 1:2:1 (about four, Cowan 2001).
# Each chunk beyond K halves the chance that the rebuilt chain stays
# intact (PHI = 0.5). Success = p ** k * E[PHI ** max(0, L - K)].
# PHI and the K weights are illustrative.
import math
from fractions import Fraction
CAP_W = {3: Fraction(1, 4), 4: Fraction(1, 2), 5: Fraction(1, 4)}
PHI = Fraction(1, 2)
def wm_factor(k):
load = 2 + k
terms = [w * PHI ** max(0, load - cap) for cap, w in CAP_W.items()]
out = Fraction(0)
for t in terms:
out += t
return out
if __name__ == "__main__":
print("A. memory factor E[PHI^excess] by skipped steps k")
for k in range(6):
f = wm_factor(k)
print(" k = {}: load {} factor {} = {:.4f}".format(
k, 2 + k, f, float(f)))
print("B. loss without and with the memory term")
print(" p k recon-only with-memory extra")
for p in (0.95, 0.80, 0.60):
for k in (1, 2, 3, 4):
a = 1.0 - p ** k
b = 1.0 - p ** k * float(wm_factor(k))
print(" {:.2f} {} {:>10.3f} {:>11.3f} {:>5.3f}".format(
p, k, a, b, b - a))
jump = [1.0 - 0.95 ** k * float(wm_factor(k)) for k in range(6)]
steps = [jump[i + 1] - jump[i] for i in range(5)]
i = max(range(5), key=lambda j: steps[j])
print("C. p = 0.95: largest one-step rise in loss is k {} -> {}"
" (+{:.3f})".format(i, i + 1, steps[i]))
print(" mean of the five rises {:.3f}".format(
math.fsum(steps) / len(steps)))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 2: A Step-by-Step Reconstruction Model: Skipped Steps, Loss Rates and Working-Memory Overflow. 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 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
- Chapter 8 · The Empirical Loop: A Step-Down Ledger, Field Tools and Checker Specifications