What does Step-Down Communication Protocols conclude, in numbers, about “High Clock Speed Is Not an Intelligence Ranking: Chunk Compression and Domain Expertise”?
Answer: This chapter rewrote high clock speed, replacing a ranking of intelligence with a gap in chunk compression. The number of slots is broadly the same, about four; the difference lies in how many steps each slot carries. The evidence from the chessboard and the model in p12 both show that the same slots with different chunk sizes are enough to create a fourfold difference in recall, and that the difference vanishes on random positions. Program p11 adds that the compression gap reverses with the domain, and that one of the sender's chunks unpacks on average into 2.67 of the receiver's.
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: 12, 2.67
A. same 12 steps, four dictionaries, capacity 4
person domain chunks steps/chunk WM loads
A X 3 4.00 1
A Y 8 1.50 2
B X 8 1.50 2
B Y 4 3.00 1
B. receiver chunks per sender chunk (unpack load)
domain X A->B: [3, 2, 3] max 3 mean 2.67
domain X B->A: [1, 1, 1, 1, 1, 1, 1, 1] max 1 mean 1.00
domain Y A->B: [1, 2, 1, 1, 1, 1, 1, 1] max 2 mean 1.12
domain Y B->A: [2, 3, 2, 2] max 3 mean 2.25
C. speed ratio A/B in X 2.67, in Y 0.50Show the full program
# Chapter 1. p11: one 12-step chain read through four chunk dictionaries.
# Each (person, domain) pair has a dictionary that groups the same 12
# atomic steps into chunks. Time per chunk is held fixed, so apparent
# "clock speed" is steps per chunk. Capacity 4 follows Cowan (2001);
# the dictionaries are illustrative, not measured.
import math
STEPS = 12
CAP = 4
DICTS = {
("A", "X"): [4, 4, 4],
("A", "Y"): [2, 2, 1, 1, 2, 1, 1, 2],
("B", "X"): [2, 1, 1, 2, 2, 1, 1, 2],
("B", "Y"): [3, 3, 3, 3],
}
def bounds(sizes):
out, start = [], 0
for s in sizes:
out.append((start, start + s))
start += s
return out
def unpack(sender, receiver):
# receiver chunks touched by each sender chunk
rb = bounds(receiver)
counts = []
for a, b in bounds(sender):
n = 0
for c, d in rb:
if c < b and a < d:
n += 1
counts.append(n)
return counts
if __name__ == "__main__":
print("A. same 12 steps, four dictionaries, capacity {}".format(CAP))
print(" person domain chunks steps/chunk WM loads")
for (who, dom), sizes in sorted(DICTS.items()):
n = len(sizes)
print(" {:>6} {:>6} {:>6} {:>11.2f} {:>8}".format(
who, dom, n, STEPS / n, math.ceil(n / CAP)))
print("B. receiver chunks per sender chunk (unpack load)")
for dom in ("X", "Y"):
for s, r in (("A", "B"), ("B", "A")):
c = unpack(DICTS[(s, dom)], DICTS[(r, dom)])
print(" domain {} {}->{}: {} max {} mean {:.2f}".format(
dom, s, r, c, max(c), math.fsum(c) / len(c)))
ax = STEPS / len(DICTS[("A", "X")])
bx = STEPS / len(DICTS[("B", "X")])
ay = STEPS / len(DICTS[("A", "Y")])
by = STEPS / len(DICTS[("B", "Y")])
print("C. speed ratio A/B in X {:.2f}, in Y {:.2f}".format(
ax / bx, ay / by))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 1: High Clock Speed Is Not an Intelligence Ranking: Chunk Compression and Domain Expertise. 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 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
- Chapter 8 · The Empirical Loop: A Step-Down Ledger, Field Tools and Checker Specifications