What does Step-Down Communication Protocols conclude, in numbers, about “The Curse of Knowledge and the Conversation Game: Conclusion First, the Price of Asking and Total Coordination Time”?
Answer: Chapter 6 computes the curse of knowledge: anchoring on one's own dictionary makes the bridging decision jump, with an excess cost of 3.734, and disdain towards the person who asks raises the equilibrium miss rate from 0.2940 to 0.3600.
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.2940, 0.3600
| receiver ask cost CY, equilibria (x, y), social optimum | |
| CY 0.2: eq [(0, 2)] joint 3.340 | optimum (1, 2) joint 2.964 |
| CY 0.5: eq [(0, 2), (1, 1)] joint 3.940, 3.820 | optimum (1, 2) joint 3.564 |
| CY 1.0: eq [(1, 0)] joint 4.400 | optimum (3, 0) joint 3.696 |
| CY 2.0: eq [(1, 0)] joint 4.400 | optimum (3, 0) joint 3.696 |
| CY 0.2: miss at equilibrium 0.2940, at optimum 0.1764 | |
| CY 2.0: miss at equilibrium 0.3600, at optimum 0.1296 |
Show the full program
# Chapter 6. p63: who pays for common ground (a two-player effort game).
# Sender picks bridging effort x in 0..3, receiver picks asking effort
# y in 0..2. Miss probability m(x, y) = M0 * BX ** x * BY ** y. Each
# side loses V = 5 when the request is missed (the joint loss is 10)
# and pays its own effort: CX per unit for the sender, CY for the
# receiver. Pure Nash equilibria come from best responses; the social
# optimum minimises the joint cost. CY rises when asking is made
# costly, for example when a question is met with disdain.
# All values are illustrative.
import itertools
M0, BX, BY = 0.6, 0.6, 0.7
V, CX = 5.0, 0.8
def miss(x, y):
return M0 * BX ** x * BY ** y
def costs(x, y, cy):
m = miss(x, y)
return V * m + CX * x, V * m + cy * y
def analyse(cy):
xs, ys = range(4), range(3)
eq = []
for x, y in itertools.product(xs, ys):
cs, cr = costs(x, y, cy)
if all(costs(a, y, cy)[0] >= cs for a in xs) and \
all(costs(x, b, cy)[1] >= cr for b in ys):
eq.append((x, y))
soc = min(itertools.product(xs, ys),
key=lambda p: costs(p[0], p[1], cy)[0] +
costs(p[0], p[1], cy)[1])
return eq, soc
if __name__ == "__main__":
print("receiver ask cost CY, equilibria (x, y), social optimum")
for cy in (0.2, 0.5, 1.0, 2.0):
eq, soc = analyse(cy)
tot = [costs(x, y, cy)[0] + costs(x, y, cy)[1] for x, y in eq]
st = costs(soc[0], soc[1], cy)
print(" CY {:.1f}: eq {} joint {} optimum {} joint {:.3f}".format(
cy, eq, ", ".join("{:.3f}".format(t) for t in tot), soc,
st[0] + st[1]))
for cy in (0.2, 2.0):
eq, soc = analyse(cy)
x, y = eq[0]
print(" CY {:.1f}: miss at equilibrium {:.4f}, at optimum {:.4f}"
.format(cy, miss(x, y), miss(*soc)))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 6: The Curse of Knowledge and the Conversation Game: Conclusion First, the Price of Asking and Total Coordination Time. 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 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