关于「实证闭环:每周雷达的判决接进规则状态机」,《规则的一生》给出的定量结论是什么?
结论:第八章把每周雷达的判决接进状态机,给出蒸馏小工具「规则转正降级判定器」与预注册的 A/A 校准:100 条 A/A 规则,不少于 11 条转正即推翻本书。书中以标注框区分已发表的证据、可运行的 Python 计算(20 段程序)、原典与作者的假说。
数据口径:书中的转化率、流量与每周计数均为示意;全部计算由书中程序生成;本书属非个人化经营方法,不构成经营、法律或投资建议,规则的转正、降级与退役须由主事者人工放行,紧迫感只能来自真实库存与真实截止。 书中以标注框区分已发表的证据、可运行的 Python 计算(20 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 100, 11, 20
| A/A rules | reject if KEEPs >= | size@0.0625 | size@0.0332 | pow@0.10 | pow@0.15 |
| 20 | 4 | 0.0330 | 0.0038 | 0.1330 | 0.3523 |
| 40 | 6 | 0.0367 | 0.0019 | 0.2063 | 0.5675 |
| 60 | 8 | 0.0326 | 0.0008 | 0.2484 | 0.6953 |
| 80 | 10 | 0.0273 | 0.0003 | 0.2766 | 0.7789 |
| 100 | 11 | 0.0480 | 0.0005 | 0.4168 | 0.9006 |
| 120 | 13 | 0.0375 | 0.0002 | 0.4239 | 0.9254 |
| 150 | 15 | 0.0491 | 0.0002 | 0.5398 | 0.9717 |
| 200 | 19 | 0.0462 | 0.0000 | 0.6276 | 0.9918 |
| smallest listed n with power >= 0.80 against 0.15: 100 | |||||
| at 20 A/A slots and 5.83 weeks per null trial: 29.1 weeks |
查看完整验算程序
# Chapter 8. p82: how many A/A calibration rules the pre-registration needs
# Model: an A/A rule sends traffic to a variant identical to control, so
# every KEEP it earns is a false promotion. The book's claim is that the
# weekly SPRT pipeline keeps the false-KEEP rate at or below Wald's
# bound 0.0625; its exact value at 600 visitors a week is 0.0332 (p41).
# The rival claim is that it behaves like weekly peeking, near 0.15 or
# more (p11, p12). For n A/A rules we pick the smallest critical count
# c with exact one-sided binomial size <= 0.05 under rate 0.0625, and
# report the power against 0.10 and 0.15. Exact binomial sums.
import math
R0, R_TRUE = 0.0625, 0.0332
def tail(n, c, p):
terms = [math.exp(math.lgamma(n + 1) - math.lgamma(j + 1)
- math.lgamma(n - j + 1) + j * math.log(p)
+ (n - j) * math.log(1 - p))
for j in range(c, n + 1)]
return math.fsum(terms)
def crit(n):
for c in range(n + 1):
if tail(n, c, R0) <= 0.05:
return c
return n + 1
print("A/A rules reject if KEEPs >= size@0.0625 size@0.0332"
" pow@0.10 pow@0.15")
first = None
for n in (20, 40, 60, 80, 100, 120, 150, 200):
c = crit(n)
pw = tail(n, c, 0.15)
if first is None and pw >= 0.8:
first = n
print("%9d %18d %11.4f %11.4f %8.4f %8.4f"
% (n, c, tail(n, c, R0), tail(n, c, R_TRUE), tail(n, c, 0.10),
pw))
print("smallest listed n with power >= 0.80 against 0.15: %d" % first)
weeks = first * 5.83 / 20
print("at 20 A/A slots and 5.83 weeks per null trial: %.1f weeks" % weeks)唯一数据源与引用
范雅福(Fan, Y.). (2026). 《线上规则实证淘汰、序贯概率比检验接入真实转化流与新文案规则转正降级母典》第 8 章「实证闭环:每周雷达的判决接进规则状态机」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-263 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026263,
author = {Fan, Yafu},
title = {Empirical Retirement of Live Rules: Wiring the Sequential Probability Ratio Test into Real Conversion Streams to Promote, Demote and Retire Copy Rules},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}