What does Taiyi Congruence Cycles and Game Bounds conclude, in numbers, about “The Game Bounds of the Counting Rods: Base-Rate Leakage and the Ceiling on Choosing the Best of Many Readings”?
Answer: Chapter 5 derives the game bounds of the readings: on records in which the host side holds seven in ten, an uninformed reading still beats a coin by 0.083.
Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; its chronicle of calamities is synthetic data generated with a fixed seed. Chapter 6 runs random-permutation tests on a synthetic chronicle: the most "significant" configuration has a family-wise p of 0.501, and once the choice of convention and tolerance is counted, the chance that some path is nominally significant is 0.867.
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.083
| q(longer count names host) = 0.458 | ||||
| q(host count >= 10) | = 0.708 | |||
| b | longer | host>=10 | always host | bound |
| 0.30 | 0.517 | 0.417 | 0.300 | 0.700 |
| 0.40 | 0.508 | 0.458 | 0.400 | 0.600 |
| 0.50 | 0.500 | 0.500 | 0.500 | 0.500 |
| 0.60 | 0.492 | 0.542 | 0.600 | 0.600 |
| 0.70 | 0.483 | 0.583 | 0.700 | 0.700 |
| at b = 0.70 the >=10 rule beats a coin by 0.083 with zero information |
Show the full program
# Chapter 5. p51: base-rate leakage. If a record's outcomes do not
# depend on the counts at all, a rule that names the host side in a
# share q of years and a record in which the host side prevails in a
# share b of contests agree in q*b + (1-q)*(1-b) of cases. q comes from
# the exact 72-year enumeration; b is illustrative. Bound: no rule
# without information beats max(b, 1-b) in expectation.
from fractions import Fraction
# Ring of sixteen gods, clockwise from zi; ring slots that are palaces
# carry the Taiyi palace number (Jinjing vol. 2 example: from Dayi (hai)
# 1, Dizhu (zi) 8, Hede (gen) 3, Gaocong (mao) 4, total 16 before xun 9).
RING = ("zi", "chou", "gen", "yin", "mao", "chen", "xun", "si",
"wu", "wei", "kun", "shen", "you", "xu", "qian", "hai")
PAL = {0: 8, 2: 3, 4: 4, 6: 9, 8: 2, 10: 7, 12: 6, 14: 1}
POS = {p: k for k, p in PAL.items()}
TY_ORDER = (1, 2, 3, 4, 6, 7, 8, 9) # skips the centre 5
# Wenchang starts at Wude (shen) and walks clockwise; qian and kun each
# hold it two years, so one circuit of 16 gods takes 18 years.
WC_SEQ = (11, 12, 13, 14, 14, 15, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10)
BR_POS = (0, 1, 3, 4, 5, 7, 8, 9, 11, 12, 13, 15) # 12 branches on ring
def taiyi(j):
r = j % 360 % 72 % 24 or 24
return TY_ORDER[(r - 1) // 3]
def wenchang(j):
r = j % 360 % 72 % 18 or 18
return WC_SEQ[r - 1]
def jishen(j):
r = j % 60 or 60 # from yin, counter-clockwise
return BR_POS[(2 - (r - 1)) % 12]
def shiji(j):
# Jishen laid on Hede (gen, slot 2); read where Wenchang falls
return (wenchang(j) + 2 - jishen(j)) % 16
def count(start, ty):
stop = POS[ty]
k, tot = start, PAL.get(start, 1)
if k == stop:
return tot
k = (k + 1) % 16
while k != stop:
tot += PAL.get(k, 0)
k = (k + 1) % 16
return tot
def host(j):
return count(wenchang(j), taiyi(j))
def guest(j):
return count(shiji(j), taiyi(j))
def acc(q, b):
return q * b + (1 - q) * (1 - b)
if __name__ == "__main__":
js = range(72)
q1 = Fraction(len([j for j in js if host(j) > guest(j)]), 72)
q2 = Fraction(len([j for j in js if host(j) >= 10]), 72)
print(" q(longer count names host) = {:.3f}".format(float(q1)))
print(" q(host count >= 10) = {:.3f}".format(float(q2)))
print(" b longer host>=10 always host bound")
for b100 in (30, 40, 50, 60, 70):
b = Fraction(b100, 100)
print(" {:.2f} {:>6.3f} {:>8.3f} {:>11.3f} {:>5.3f}".format(
float(b), float(acc(q1, b)), float(acc(q2, b)), float(b),
float(max(b, 1 - b))))
b = Fraction(70, 100)
gain = acc(q2, b) - Fraction(1, 2)
print(" at b = 0.70 the >=10 rule beats a coin by {:.3f}"
" with zero information".format(float(gain)))Single source and citation
Fan, Y. (2026). Taiyi Shenshu: Sixteen-Palace Walks, Accumulated-Year Congruence Cycles and the Game Bounds of Host and Guest Counting Rods (Version 1.0.0), Chapter 5: The Game Bounds of the Counting Rods: Base-Rate Leakage and the Ceiling on Choosing the Best of Many Readings. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-154 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026154,
author = {Fan, Yafu},
title = {Taiyi Shenshu: Sixteen-Palace Walks, Accumulated-Year Congruence Cycles and the Game Bounds of Host and Guest Counting Rods},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Accumulated Year Is a Residue: Thirteen Readable Bits in a Seven-Digit Number
- Chapter 2 · A Deterministic Walk on the Ring of Sixteen Gods: Occupancy and the True Base Rate of "Rare" Configurations
- Chapter 3 · The Great Orbits of Wufu and Dayou: Least Common Periods, Irregular Revisits and the Whole Extent of the Schools' Disagreement
- Chapter 4 · Host and Guest Counts: the Exact Distribution over Seventy-Two Ju and the Structural Asymmetry of "Long and Short"
- Chapter 6 · Random-Permutation Tests on a Chronicle of Calamities: Why Fitting after the Fact Almost Always Succeeds
- Chapter 7 · The Sources Examined: the Self-Consistency of the Golden Mirror's Accumulated Years and Kepler's Cycle of Great Conjunctions
- Chapter 8 · Practice and a Plan for Falsification: Pre-Registered Tests, a Sixteen-Palace Walk Component and a Checklist for Owners