关于「基率、标签的信息量与两项预注册研究」,《卓尔金、神谕与闸门的数学》给出的定量结论是什么?

结论:第八章给出巧合的基率、标签的熵与两项预注册研究:盲法辨认需 359 名参与者,神谕关系研究需招募约 8561 对伴侣。书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 359, 8561

(A) hit rate 0.32 vs 0.25359 participants, at least 104 hits
exact size 0.0485
(A) hit rate 0.35 vs 0.25179 participants, at least 55 hits
exact size 0.0485
(B) couple tied either way0.01752
couples to recruit for 150 tied couples8561
查看完整验算程序
# Chapter 8. p16: Two pre-registered studies and their sizes.
# (A) Blind recognition: each participant reads four type-and-profile
#     descriptions written from four different charts (theirs and three
#     strangers' matched to differ in type), with labels removed, and picks
#     the one most like them. Chance 1/4; exact one-sided binomial test,
#     alpha 0.05, power 0.90.
# (B) Oracle ties and couples: the claim that a partner who is one's
#     analog, antipode, occult or guide makes a different relationship.
#     One is in the other's oracle for 0.01455 of ordered pairs (p05);
#     here we count unordered couples tied in either direction, and how
#     many couples must be recruited to observe 150 tied couples.
from itertools import product
from math import comb, ceil

KINS = list(product(range(20), range(1, 14)))

def oracle(k):
    s, t = k
    return {((s + 12 * (t - 1)) % 20, t), ((19 - s) % 20, t),
            ((s + 10) % 20, t), ((21 - s) % 20, 14 - t)} - {k}

def tail(n, k, p):
    return sum(comb(n, i) * p ** i * (1 - p) ** (n - i)
               for i in range(k, n + 1))

def plan(p0, p1, alpha=0.05, power=0.90):
    for n in range(20, 5000):
        k = next(k for k in range(n + 1) if tail(n, k, p0) <= alpha)
        if tail(n, k, p1) >= power:
            return n, k, tail(n, k, p0)

if __name__ == "__main__":
    for p1 in (0.32, 0.35):
        n, k, a = plan(0.25, p1)
        print("   (A) hit rate {:.2f} vs 0.25: {} participants, at least {}"
              " hits".format(p1, n, k))
        print("       exact size {:.4f}".format(a))
    tied = sum(1 for a, b in product(KINS, KINS)
               if a != b and (b in oracle(a) or a in oracle(b)))
    either = tied / (260 * 259)
    print("   (B) couple tied either way: {:.5f}".format(either))
    print("       couples to recruit for 150 tied couples: {}".format(
        ceil(150 / either)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《玛雅卓尔金双模齿轮、神谕十字对合变换与六十四闸门网络渗流》第 8 章「基率、标签的信息量与两项预注册研究」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090193

DOI: 10.5281/zenodo.24090193 · 阅读本章所在专著 · 5DL-B-072 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026072,
  author    = {Fan, Yafu},
  title     = {Mayan Tzolkin Modular Gears, Oracle-Cross Involutions and Sixty-Four-Gate Network Percolation},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090193},
  url       = {https://doi.org/10.5281/zenodo.24090193}
}

本书其他章节结论