What does Step-Down Communication Protocols conclude, in numbers, about “Shannon's Formula as Analogy Only: Channel Capacity, the Central Bottleneck and One Instruction per Message”?

Answer: Chapter 5 shows that one instruction per message is a conditional rule, best only when the overhead of a message lies below a threshold, 0.4877 in the illustration.

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.4877

best instructions per message (rows overhead o, cols hazard h)
o h0.01 h=0.02 h=0.05 h=0.10 h=0.20
0.252 2 1 1 1
0.503 2 2 1 1
1.005 3 2 2 1
2.006 5 3 2 2
4.009 7 4 3 2
k1 beats k = 2 exactly when o < R * (1 - exp(-h));
check at h0.05:
threshold o0.4877; o = 0.25 -> k = 1; o = 0.5 -> k = 2
Show the full program
# Chapter 5. p53: when "one request per message" is optimal, and when not.
# Per-instruction cost of sending k instructions in one message:
#     o / k + R * (1 - done(k) / k),
# where o is the fixed overhead of one message (reading, switching,
# finding context), R = 10 is the rework cost of a lost instruction and
# done(k) = sum of exp(-h * i), i < k, as in p52. The best k is found by
# search. All values are illustrative.
import math

R = 10.0


def per_instr(k, o, h):
    done = math.fsum(math.exp(-h * i) for i in range(k))
    return o / k + R * (1.0 - done / k)


def best_k(o, h):
    return min(range(1, 13), key=lambda k: per_instr(k, o, h))


if __name__ == "__main__":
    hs = (0.01, 0.02, 0.05, 0.10, 0.20)
    print("best instructions per message (rows overhead o, cols hazard h)")
    print("     o   " + "  ".join("h={:.2f}".format(h) for h in hs))
    for o in (0.25, 0.5, 1.0, 2.0, 4.0):
        print("  {:>4.2f}   ".format(o) + "  ".join(
            "{:>6}".format(best_k(o, h)) for h in hs))
    print("k = 1 beats k = 2 exactly when o < R * (1 - exp(-h));")
    print("check at h = 0.05:")
    edge = R * (1.0 - math.exp(-0.05))
    print("  threshold o = {:.4f}; o = 0.25 -> k = {}; o = 0.5 -> k = {}"
          .format(edge, best_k(0.25, 0.05), best_k(0.5, 0.05)))

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 5: Shannon's Formula as Analogy Only: Channel Capacity, the Central Bottleneck and One Instruction per Message. 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