What does Taiyi Congruence Cycles and Game Bounds conclude, in numbers, about “Practice and a Plan for Falsification: Pre-Registered Tests, a Sixteen-Palace Walk Component and a Checklist for Owners”?

Answer: Chapter 8 gives a pre-registration plan (eleven hundred years of records can detect, per palace, only a calamity share of 0.289 or more), a checklist for owners and a style specification for a sixteen-palace walk component. Marked boxes separate published evidence, runnable Python calculations (18 programs), classical sources and the author's hypotheses.

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.289

p1alphacondition-yearscalendar years (share 1/8)
0.250.054193352
0.250.05/7310838664
0.300.05109872
0.300.05/732782224
0.400.0529232
0.400.05/7372576
1100-year record, 137 years per palace:
smallest detectable rate, alpha 0.05: 0.289
smallest detectable rate, alpha 0.05/73: 0.344
Show the full program
# Chapter 8. p81: sample sizes for a pre-registered test. One condition
# is named in advance (for example one Taiyi palace, 1/8 of all years).
# Calamity base rate p0 = 0.20 (illustrative). One-sided test of a
# proportion, power 0.80, normal approximation; alpha 0.05 for a single
# named condition, alpha 0.05/73 if all 73 conditions of p61 are kept.
import math
from statistics import NormalDist

Z = NormalDist()


def n_needed(p0, p1, alpha, power=0.80):
    za, zb = Z.inv_cdf(1 - alpha), Z.inv_cdf(power)
    top = za * math.sqrt(p0 * (1 - p0)) + zb * math.sqrt(p1 * (1 - p1))
    return math.ceil((top / (p1 - p0)) ** 2)


def mde(n, p0, alpha, power=0.80):
    lo, hi = p0, 0.99
    for _ in range(60):
        mid = (lo + hi) / 2
        if n_needed(p0, mid, alpha, power) > n:
            lo = mid
        else:
            hi = mid
    return hi


if __name__ == "__main__":
    p0, share = 0.20, 1 / 8
    print(" p1    alpha      condition-years  calendar years (share 1/8)")
    for p1 in (0.25, 0.30, 0.40):
        for name, a in (("0.05", 0.05), ("0.05/73", 0.05 / 73)):
            n = n_needed(p0, p1, a)
            print(" {:.2f}  {:<9} {:>16} {:>27}".format(
                p1, name, n, math.ceil(n / share)))
    n = 1100 // 8
    print(" 1100-year record, {} years per palace:".format(n))
    print("  smallest detectable rate, alpha 0.05: {:.3f}".format(
        mde(n, p0, 0.05)))
    print("  smallest detectable rate, alpha 0.05/73: {:.3f}".format(
        mde(n, p0, 0.05 / 73)))

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 8: Practice and a Plan for Falsification: Pre-Registered Tests, a Sixteen-Palace Walk Component and a Checklist for Owners. 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