关于「实践与证伪方案:预注册检验、十六宫游走组件与经营者清单」,《太乙神数的同余结构与博弈边界》给出的定量结论是什么?

结论:第八章给出预注册方案(一千一百年史料每宫只能检出 0.289 以上的灾异比例)、经营者清单与十六宫游走组件的样式规格。书中以标注框区分已发表的证据、可运行的 Python 计算(18 段程序)、原典与作者的假说。

数据口径:书中参数为示意;全部计算由书中程序生成;书中灾异年表为固定种子生成的合成数据。 第六章在合成年表上做随机置换检验,最「显著」的格局族系 p 值为 0.501,计入积年与容差的选择后,至少一条路径名义显著的机会是 0.867。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 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
查看完整验算程序
# 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)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《太乙神数十六宫游走、积年同余周期与主客算筹博弈边界》第 8 章「实践与证伪方案:预注册检验、十六宫游走组件与经营者清单」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 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}
}

本书其他章节结论