Tieban Shenshu Ke-Fen Decision Trees, Affine Coding of the Verse Bank and Entropy Lower Bounds on Elicitation: chapter answers
Tieban Shenshu is famed for precision: it is said to cut the double-hour into ke and fen and to retrieve, from a bank of tens of thousands of verses, the verses naming a client's parents' birth animals and number of brothers. Using Shannon's information theory and elementary number theory, this book asks a question that can be calculated: how many bits does it take to locate one verse, and where do those bits come from? Lineages disagree about the bank size and the subdivision of the clock; the book adopts 8 ke to the double-hour and 15 fen to the ke, and takes a bank of 120,000 verses as its…
DOI pending · monograph page goes live after publication · 5DL-B-157 · 中文版
- Chapter 1 · The Bit Budget of a Verse Bank: What the Double-Hour, the Ke, the Fen and the Bank Are Worth
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… - Chapter 2 · The Kaoke Decision Tree: Entropy Bounds on the Mean Number of Questions and Huffman Optimality
Chapter 2 writes kaoke as a decision tree: twelve-way questions fix one of 120 fen in 1.9833 questions on average with a Huffman tree. - Chapter 3 · An Affine Cipher for Verse Numbers: Invertibility, Key Space and Known-Pair Attacks
Chapter 3 studies affine coding of verse numbers: with modulus 12,000 the invertible keys are worth only 25.195 bits, an average of 3.288 known pairs breaks the table, and no one-to-one code adds information. - Chapter 4 · Questions Are Leaks: The Cold Reader's Entropy Budget and Why a Match Is Nearly Certain
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. - Chapter 5 · Verse Specificity and Clock Resolution: Barnum Statements, Same-Minute Births and Twins
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. - Chapter 6 · Noisy Answers: The Liar Game, Year-Boundary Errors in Birth Animals, and Fano's Inequality
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. - Chapter 7 · The Classical Sources: The Combinatorics of the Sound-and-Tone Chart and Leibniz's Binary
Chapter 7 examines the 17,024 syllable positions of the Sound-and-Tone chart in Shao Yong's Huangji jingshi and Leibniz's binary. - Chapter 8 · Practice and Refutation: A Bit Budget for Intake, Red Lines for Scripts, and a Pre-Registered Test
Chapter 8 gives a pre-registered blind test, needing 65 clients if the true hit rate is 0.10, and distils the results into a script skeleton and red lines for service-desk intake. Marked boxes separate published evidenc…
Illustrative model calculation, not a live quote