What does Taiyi Congruence Cycles and Game Bounds conclude, in numbers, about “The Accumulated Year Is a Residue: Thirteen Readable Bits in a Seven-Digit Number”?

Answer: Chapter 1 shows that the accumulated year acts only through residues: three documented conventions agree exactly modulo 720, and no god can read more than 12.81 bits.

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: 12.81, 720

set of gods L combos share reachable
Taiyi 2424 24 1
+Wenchang 1872 432 0.167
+Jishen 1272 5.18e+03 0.0139
+sexagenary 60360 3.11e+05 0.00116
+Gates 240720 7.46e+07 9.65e-06
+Junji 360720 2.69e+10 2.68e-08
+Wufu 2253600 6.05e+12 5.95e-10
+Dayou 2887200 1.74e+15 4.13e-12
bits in J1937281: 20.89; bits any god can read: 12.81
bits in J10154641: 23.28
Show the full program
# Chapter 1. p12: how much of a seven-digit accumulated year the system
# actually uses. Each god reads the year only through a residue; the
# joint state repeats with the least common multiple L of the periods.
# Of all combinations of residues, only L can ever occur (Chinese
# remainder theorem with non-coprime moduli). Periods: Taiyi small
# circuit 24, Wenchang (heavenly eye) 18, Jishen 12, Eight Gates 240,
# Junji 360 (from the Jinjing); Wufu 225 and Dayou 288 (later manuals).
import math
from functools import reduce

STEPS = (("Taiyi 24", 24), ("+Wenchang 18", 18), ("+Jishen 12", 12),
         ("+sexagenary 60", 60), ("+Gates 240", 240), ("+Junji 360", 360),
         ("+Wufu 225", 225), ("+Dayou 288", 288))


def lcm(a, b):
    return a * b // math.gcd(a, b)


def reachable(mods):
    seen = set()
    period = reduce(lcm, mods)
    for j in range(period):
        seen.add(tuple(j % m for m in mods))
    return len(seen), period


if __name__ == "__main__":
    print(" set of gods          L   combos      share reachable")
    mods = []
    for name, m in STEPS:
        mods.append(m)
        prod = reduce(lambda x, y: x * y, mods)
        if len(mods) <= 4:
            n, per = reachable(mods)
            assert n == per
        per = reduce(lcm, mods)
        print(" {:<16} {:>6} {:>8.3g}   {:.3g}".format(
            name, per, float(prod), per / prod))
    bits_used = math.log2(7200)
    print(" bits in J = 1937281: {:.2f}; bits any god can read: {:.2f}"
          .format(math.log2(1937281), bits_used))
    print(" bits in J = 10154641: {:.2f}".format(math.log2(10154641)))

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 1: The Accumulated Year Is a Residue: Thirteen Readable Bits in a Seven-Digit Number. 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