关于「四步核查与两项预注册研究」,《塔罗、雷诺曼与生命树的数学》给出的定量结论是什么?
结论:第八章给出四步核查与两项预注册研究:盲法配对检验需 359 名参与者,洗牌审计需 263 个牌阵。书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。
数据口径:书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 263, 359
| (A) hit rate 0.32 vs 0.25 | 359 participants, at least 104 hits |
| exact size 0.0485 | |
| (A) hit rate 0.35 vs 0.25 | 179 participants, at least 55 hits |
| exact size 0.0485 | |
| (B) mean changes 4.2 vs 4.5 | 263 audited spreads |
| (B) mean changes 4.0 vs 4.5 | 95 audited spreads |
| Reading: the matching test needs a few hundred participants; | |
| the shuffle audit is cheap, because orientation is mechanical. |
查看完整验算程序
# Chapter 8. p16: Two pre-registered studies and their sizes.
# (A) Blind matching: each participant receives four unlabelled Celtic
# Cross readings written by an interpreter who never meets them: one
# from a spread dealt for their question, three from spreads dealt for
# other participants. Chance of choosing their own: 1/4. Exact
# one-sided binomial test, alpha 0.05, power 0.90.
# (B) Shuffle audit: readers shuffle as they always do; we record the
# orientation of the top 10 cards. Under independent turning the
# number of changes has mean 4.5 and s.d. 1.5. Size to detect a mean
# of 4.2 (a mild clustering) two-sided at 0.05 with power 0.90.
from math import comb, ceil
from statistics import NormalDist
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))
z = NormalDist().inv_cdf
for mu1 in (4.2, 4.0):
n = ceil(((z(0.975) + z(0.90)) * 1.5 / (4.5 - mu1)) ** 2)
print(" (B) mean changes {:.1f} vs 4.5: {} audited spreads".format(
mu1, n))
print("\nReading: the matching test needs a few hundred participants;")
print("the shuffle audit is cheap, because orientation is mechanical.")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《塔罗超几何抽样、雷诺曼网格拓扑与卡巴拉生命树图论》第 8 章「四步核查与两项预注册研究」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090191
DOI: 10.5281/zenodo.24090191 · 阅读本章所在专著 · 5DL-B-071 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026071,
author = {Fan, Yafu},
title = {Tarot Hypergeometric Sampling, Lenormand Grid Topology and Kabbalistic Tree Graphs},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090191},
url = {https://doi.org/10.5281/zenodo.24090191}
}