What does The Bit Budget of Tieban Shenshu conclude, in numbers, about “Questions Are Leaks: The Cold Reader's Entropy Budget and Why a Match Is Nearly Certain”?

Answer: Chapter 4 is the core: searching the 120 fen of a double-hour, the parents' animals match exactly with probability 0.6975, and a match that looks like a rare event of 6.451 bits carries only 0.520 bits of real evidence.

Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it analyses structure and probability, makes no reading of any individual, and is not legal or financial advice. Chapter 5 shows that a verse carries at most 0.5307 bits of expected information and that at an illustrative scale 19.01 people are born each minute.

中文版

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.520, 0.6975, 120, 6.451

q exact, uniform pairs: 0.00694; age-gap pairs: 0.01143
q father or mother matches: 0.1552
KP(exact)E[exact]P(partial)bits shownbits real
10.01140.0110.15526.4516.451
80.08730.0910.74046.4513.518
240.23610.2740.98246.4512.083
1200.69751.3721.00006.4510.520
3600.92504.1161.00006.4510.113
Monte Carlo, K = 120, 4000 clients: P(exact) = 0.7007
Show the full program
# Chapter 4. p42: Why a match becomes certain. The reader holds K
# candidate cells (8 ke, 120 fen, or 360 fen when the neighbouring
# double-hours are admitted) and reads each cell's check verse, which
# names the father's and mother's animals. The verse pairs are drawn
# from the same population as the client's (age-gap model of p22).
# q = collision probability of the pair. With K tries the chance of at
# least one exact match is sum_c p_c (1 - (1 - p_c)^K), close to
# 1 - (1 - q)^K. A match found after K hidden tries is worth
# -log2 P(match) bits of evidence, not -log2 q.
import math
import random

GAP = [10, 18, 20, 17, 12, 8, 5, 3, 2, 0, 2, 3]
g = [x / 100 for x in GAP]
p_pair = [[g[(mo - fa) % 12] / 12 for mo in range(12)]
          for fa in range(12)]
q_uni = 1 / 144
flat = [p for row in p_pair for p in row]
q = math.fsum(p * p for p in flat)
# partial: father matches or mother matches
p_f = 1 / 12
q_part = p_f + p_f - q
print("  q exact, uniform pairs: {:.5f}; age-gap pairs: {:.5f}".format(
    q_uni, q))
print("  q father or mother matches: {:.4f}".format(q_part))
print("    K   P(exact)  E[exact]  P(partial)  bits shown  bits real")
for K in (1, 8, 24, 120, 360):
    pe = math.fsum(p * (1 - (1 - p) ** K) for p in flat)
    pp = math.fsum(p * (1 - (1 - (2 / 12 - p)) ** K) for p in flat)
    print("  {:>3}   {:8.4f}  {:8.3f}  {:10.4f}  {:10.3f}  {:9.3f}".format(
        K, pe, K * q, pp, -math.log2(q), -math.log2(pe)))

rng = random.Random(20261112)
cells = [(f, m) for f in range(12) for m in range(12)]
wts = [p_pair[f][m] for f, m in cells]
hits = 0
TR = 4000
for _ in range(TR):
    client = rng.choices(cells, wts)[0]
    verses = rng.choices(cells, wts, k=120)
    hits += client in verses
print("  Monte Carlo, K = 120, {} clients: P(exact) = {:.4f}".format(
    TR, hits / TR))

Single source and citation

Fan, Y. (2026). Tieban Shenshu Ke-Fen Decision Trees, Affine Coding of the Verse Bank and Entropy Lower Bounds on Elicitation (Version 1.0.0), Chapter 4: Questions Are Leaks: The Cold Reader's Entropy Budget and Why a Match Is Nearly Certain. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-157 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026157,
  author    = {Fan, Yafu},
  title     = {Tieban Shenshu Ke-Fen Decision Trees, Affine Coding of the Verse Bank and Entropy Lower Bounds on Elicitation},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book