关于「一个用户自己的核算器与一项预注册的盲法检验」,《回溯信念与升单自动机》给出的定量结论是什么?
结论:第八章给出一个用户核算器与一项预注册的盲法检验(152 位参与者)。书中以标注框区分证据、16 段可运行的 Python 程序、原典与假说。
数据口径:第一章证明「信任雪崩」是感受上的相变而不是证据上的:泛泛的回溯断言真实似然比只有 1.19,怀疑者需要 27 次命中才半信,但若把基率 0.80 误判为 0.20,3 次就够;在 20,000 位模拟用户中,一位没有任何洞察力的测算师在 6 条泛泛断言之内使 0.5263 的用户确信,而按真实似然比更新的用户几乎无人确信。 第六章显示稀有的跨板块转移在 1,000 位用户时区间宽度仍为真值的 0.74 倍;「自己学会算」蚕食的测算收入小于学费;两类用户合成一条链会严重低估长尾留存。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 152
participants 152, reject H0 at 61 hits or more size 0.0468, power 0.9015 for H1 = 0.40 instead: 447 participants, 166 hits Reading: a fair test of retrodiction is cheap: a few hundred participants. What makes it fair is the decoys, the blinding and the registration, not the size.
查看完整验算程序
# Chapter 8. [p16] A pre-registered blinded retrodiction test.
# Each participant gives birth data; an independent analyst runs the
# registered engine to write retrodictive statements for the
# participant and for two decoys (other participants' birth data). The
# participant, blind to the source, picks the set that fits her past.
# H0: hit rate 1/3. H1: 0.45. One-sided exact binomial test at 0.05,
# power 0.90: the smallest n and its critical number of hits.
from math import comb
def tails(n, p):
"""upper tails P(X >= k), k = 0..n, for X ~ Binomial(n, p)"""
pmf = [comb(n, j) * p ** j * (1 - p) ** (n - j) for j in range(n + 1)]
out, acc = [0.0] * (n + 2), 0.0
for j in range(n, -1, -1):
acc += pmf[j]
out[j] = acc
return out
def plan(p0, p1, alpha=0.05, power=0.90):
for n in range(20, 2000):
t0, t1 = tails(n, p0), tails(n, p1)
k = next(k for k in range(n + 1) if t0[k] <= alpha)
if t1[k] >= power:
return n, k, t0[k], t1[k]
if __name__ == "__main__":
n, k, a, b = plan(1 / 3, 0.45)
print(" participants {}, reject H0 at {} hits or more".format(n, k))
print(" size {:.4f}, power {:.4f}".format(a, b))
n2, k2, a2, b2 = plan(1 / 3, 0.40)
print(" for H1 = 0.40 instead: {} participants, {} hits".format(
n2, k2))
print("\nReading: a fair test of retrodiction is cheap: a few hundred")
print("participants. What makes it fair is the decoys, the blinding")
print("and the registration, not the size.")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《回溯信念锁定、序贯痛点唤醒与马尔可夫升单自动机》第 8 章「一个用户自己的核算器与一项预注册的盲法检验」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090186
DOI: 10.5281/zenodo.24090186 · 阅读本章所在专著 · 5DL-B-069 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026069,
author = {Fan, Yafu},
title = {Retrodictive Belief Locking, Sequential Pain-Point Agitation and Markovian Upsell Automata},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090186},
url = {https://doi.org/10.5281/zenodo.24090186}
}