关于「积年只是余数:七位数里能被读到的十三比特」,《太乙神数的同余结构与博弈边界》给出的定量结论是什么?

结论:第一章说明积年只以余数起作用:三种有据可查的积年在模 720 上完全一致,任何一个神能读到的信息不超过 12.81 比特。

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

English version

对照数据表

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

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《太乙神数十六宫游走、积年同余周期与主客算筹博弈边界》第 1 章「积年只是余数:七位数里能被读到的十三比特」(版本 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}
}

本书其他章节结论