What does The Bit Budget of Tieban Shenshu conclude, in numbers, about “The Bit Budget of a Verse Bank: What the Double-Hour, the Ke, the Fen and the Bank Are Worth”?
Answer: Chapter 1 finds that locating one of 120,000 verses takes 16.8727 bits, that 13.2877 bits are still missing once the double-hour is known, and that a four-question checking questionnaire already has a raw capacity of 11.340 bits.
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: 120000, 13.2877, 16.8727
| item | N | log2 N | bits |
| double-hours in a day | 12 | 3.5850 | 4 |
| ke per double-hour, 96-ke day | 8 | 3.0000 | 3 |
| ke per double-hour, 100-ke day | 8.3333 | 3.0589 | 4 |
| fen (minutes) per double-hour | 120 | 6.9069 | 7 |
| ke in a day, 96-ke day | 96 | 6.5850 | 7 |
| minutes in a day | 1,440 | 10.4919 | 11 |
| verse bank, small variant | 6,000 | 12.5507 | 13 |
| verse bank, 12000 reading | 12,000 | 13.5507 | 14 |
| verse bank, 120000 reading | 120,000 | 16.8727 | 17 |
| minute cells in a 60-year cycle: 31,556,952 | (24.91 bits) | ||
| minute cells per verse, bank | 12,000: 2,629.7 | ||
| minute cells per verse, bank 120,000: 263.0 | |||
| bits still needed after the double-hour is known: 13.2877 |
Show the full program
# Chapter 1. p11: Bits needed to single out one item among N.
# Hartley (1928) and Shannon (1948): picking one of N equally likely
# items needs log2 N bits. Time units: 12 double-hours a day; under the
# 96-ke day adopted in the early Qing a double-hour holds 8 ke of 15
# minutes, and 1 fen is taken as 1 minute (120 fen per double-hour);
# under the older 100-ke day a double-hour holds 25/3 ke. Verse-bank
# sizes 6000, 12000 and 120000 are the figures reported by different
# lineages and are treated as parameters, not attested counts.
import math
from fractions import Fraction
rows = [
("double-hours in a day", Fraction(12)),
("ke per double-hour, 96-ke day", Fraction(8)),
("ke per double-hour, 100-ke day", Fraction(100, 12)),
("fen (minutes) per double-hour", Fraction(120)),
("ke in a day, 96-ke day", Fraction(96)),
("minutes in a day", Fraction(1440)),
("verse bank, small variant", Fraction(6000)),
("verse bank, 12000 reading", Fraction(12000)),
("verse bank, 120000 reading", Fraction(120000)),
]
print(" item N log2 N bits")
for name, n in rows:
b = math.log2(n)
shown = ("{:,}".format(int(n)) if n.denominator == 1
else "{:.4f}".format(float(n)))
print(" {:<32}{:>10} {:9.4f} {:4d}".format(
name, shown, b, math.ceil(b - 1e-12)))
# a 60-year cycle at minute resolution (mean Gregorian year)
YEAR_DAYS = Fraction(3652425, 10000)
cells = 60 * YEAR_DAYS * 1440
print(" minute cells in a 60-year cycle: {:,} ({:.2f} bits)".format(
int(cells), math.log2(cells)))
for bank in (12000, 120000):
print(" minute cells per verse, bank {:>7,}: {:,.1f}".format(
bank, float(cells / bank)))
need = math.log2(120000) - math.log2(12)
print(" bits still needed after the double-hour is known: "
"{:.4f}".format(need))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 1: The Bit Budget of a Verse Bank: What the Double-Hour, the Ke, the Fen and the Bank Are Worth. 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 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 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