What does The Bit Budget of Tieban Shenshu conclude, in numbers, about “Noisy Answers: The Liar Game, Year-Boundary Errors in Birth Animals, and Fano's Inequality”?
Answer: Chapter 6 computes year-boundary errors in birth animals, with about 0.0911 of people misreporting by Gregorian year, and gives lower bounds from the liar game and Fano's inequality.
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.0911
| 1 Jan to lunar new year, mean 33.3 days: share 0.0911 | |
| lunar new year vs lichun, mean gap 8.4 days: share 0.0231 | |
| eps bits per animal answer | |
| 0.0001 | 3.583 |
| 0.05 | 3.126 |
| 0.0911 | 2.830 |
| 0.15 | 2.456 |
| bits collected P(error) floor, 120 fen | 120000 verses |
| 3.0 | 0.421 0.763 |
| 5.0 | 0.131 0.644 |
| 6.665 | 0.000 0.546 |
| 8.018 | 0.000 0.466 |
| 12.0 | 0.000 0.230 |
Show the full program
# Chapter 6. p62: Noisy animals and Fano's inequality. Part 1: the
# zodiac year turns at the lunar new year (or at lichun), not on 1
# January, so a client who answers by calendar year can be wrong. Dates
# for 2020 to 2026 are listed below (lunar new year; lichun). Part 2: a
# 12-answer question whose answer is wrong with probability eps (spread
# over the other 11) carries at most log2 12 - h(eps) - eps log2 11
# bits. Part 3: Fano: P(error) >= (log2 N - I - 1) / log2 N when I bits
# about N equally likely cells have been collected.
import datetime as dt
import math
NEWYEAR = {2020: (1, 25), 2021: (2, 12), 2022: (2, 1), 2023: (1, 22),
2024: (2, 10), 2025: (1, 29), 2026: (2, 17)}
LICHUN = {2020: 4, 2021: 3, 2022: 4, 2023: 4, 2024: 4, 2025: 3,
2026: 4} # day of February
win, gap = [], []
for y in sorted(NEWYEAR):
m, d = NEWYEAR[y]
ny = dt.date(y, m, d)
lc = dt.date(y, 2, LICHUN[y])
win.append((ny - dt.date(y, 1, 1)).days)
gap.append(abs((ny - lc).days))
yl = 365.2425
w, g = math.fsum(win) / len(win), math.fsum(gap) / len(gap)
print(" 1 Jan to lunar new year, mean {:.1f} days: share {:.4f}".format(
w, w / yl))
print(" lunar new year vs lichun, mean gap {:.1f} days: share {:.4f}"
.format(g, g / yl))
def h2(p):
return -(p * math.log2(p) + (1 - p) * math.log2(1 - p))
print(" eps bits per animal answer")
for eps in (0.0001, 0.05, 0.0911, 0.15):
c = math.log2(12) - h2(eps) - eps * math.log2(11)
print(" {:<6} {:.3f}".format(eps, c))
print(" bits collected P(error) floor, 120 fen 120000 verses")
for info in (3.0, 5.0, 6.665, 8.018, 12.0):
f1 = max(0.0, (math.log2(120) - info - 1) / math.log2(120))
f2 = max(0.0, (math.log2(120000) - info - 1) / math.log2(120000))
print(" {:>14} {:>23.3f} {:>13.3f}".format(info, f1, f2))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 6: Noisy Answers: The Liar Game, Year-Boundary Errors in Birth Animals, and Fano's Inequality. 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 5 · Verse Specificity and Clock Resolution: Barnum Statements, Same-Minute Births and Twins
- 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