What does The Bit Budget of Tieban Shenshu conclude, in numbers, about “Verse Specificity and Clock Resolution: Barnum Statements, Same-Minute Births and Twins”?
Answer: 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.
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.5307
| verse share p bits p*bits | |
| worked hard when young | 0.8500 0.234 0.199 |
| one parent stricter than the other | 0.8000 0.322 0.258 |
| has at least one sibling | 0.7000 0.515 0.360 |
| both parents living | 0.6000 0.737 0.442 |
| exactly two brothers | 0.2000 2.322 0.464 |
| father born in a Rat year | 0.0833 3.585 0.299 |
| father Rat, mother Ox | 0.0069 7.170 0.050 |
| best expected surprisal: p | 0.3679, 0.5307 bits per verse |
| reading of 12 verses: expected confirmed 6.8 (0.567) | |
| chance at least one specific verse is confirmed | 0.3439 |
| expected bits carried by confirmed verses | 3.389 |
| Forer 1949: mean rating 4.26 of 5 = share 0.852 |
Show the full program
# Chapter 5. p51: The trade between being confirmed and being
# informative. A verse true of a share p of clients is confirmed with
# probability p and, when confirmed, carries -log2 p bits. Its expected
# surprisal p * (-log2 p) peaks at p = 1/e. Shares are illustrative.
# Forer (1949) reports a mean accuracy rating of 4.26 on a 0 to 5 scale
# for one generic sketch given to every student; we print its share.
import math
verses = [
("worked hard when young", 0.85),
("one parent stricter than the other", 0.80),
("has at least one sibling", 0.70),
("both parents living", 0.60),
("exactly two brothers", 0.20),
("father born in a Rat year", 1 / 12),
("father Rat, mother Ox", 1 / 144),
]
print(" verse share p bits p*bits")
for name, p in verses:
b = -math.log2(p)
print(" {:<36}{:7.4f} {:6.3f} {:6.3f}".format(name, p, b, p * b))
pk = 1 / math.e
print(" best expected surprisal: p = {:.4f}, {:.4f} bits per verse"
.format(pk, -pk * math.log2(pk)))
# a reading of 8 generic verses (p = 0.8) and 4 specific ones (p = 0.1)
ps = [0.8] * 8 + [0.1] * 4
conf = math.fsum(ps)
print(" reading of 12 verses: expected confirmed {:.1f} ({:.3f})".format(
conf, conf / 12))
print(" chance at least one specific verse is confirmed: {:.4f}".format(
1 - 0.9 ** 4))
info = math.fsum(-p * math.log2(p) for p in ps)
print(" expected bits carried by confirmed verses: {:.3f}".format(info))
FORER_MEAN = 4.26
print(" Forer 1949: mean rating {} of 5 = share {:.3f}".format(
FORER_MEAN, FORER_MEAN / 5))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 5: Verse Specificity and Clock Resolution: Barnum Statements, Same-Minute Births and Twins. 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
- Chapter 1 · The Bit Budget of a Verse Bank: What the Double-Hour, the Ke, the Fen and the Bank Are Worth
- Chapter 2 · The Kaoke Decision Tree: Entropy Bounds on the Mean Number of Questions and Huffman Optimality
- Chapter 3 · An Affine Cipher for Verse Numbers: Invertibility, Key Space and Known-Pair Attacks
- Chapter 4 · Questions Are Leaks: The Cold Reader's Entropy Budget and Why a Match Is Nearly Certain
- Chapter 6 · Noisy Answers: The Liar Game, Year-Boundary Errors in Birth Animals, and Fano's Inequality
- Chapter 7 · The Classical Sources: The Combinatorics of the Sound-and-Tone Chart and Leibniz's Binary
- Chapter 8 · Practice and Refutation: A Bit Budget for Intake, Red Lines for Scripts, and a Pre-Registered Test