关于「四步核查、合规清单与一项预注册的付费墙检验」,《裂变、好奇心与付费墙》给出的定量结论是什么?

结论:第八章给出四步核查、合规清单与一项预注册的付费墙检验(每组 166,788 棵推荐树)。书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

数据口径:本书不是经营、法律或投资建议;全部数据为程序生成的合成数据。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

English version

对照数据表

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

   simulated net revenue per seed: A 2.987, B 3.253
   pooled SD 10.308  ->  166,788 trees per arm for 80 % power
   decision rule, one line per branch:
   D = +0.25: B better by at least the smallest effect of interest
   D = +0.12: B better, but not shown to reach 0.10
   D = +0.05: no difference shown
   D = -0.20: B worse: the tiered menu earns less per seed
   D = +0.25: uninterpretable: sample-ratio mismatch
   D = +0.25: uninterpretable: arms mixed in more than 5 % of trees
   D = +0.25: uninterpretable: under 90 % of planned trees
Reading: because one seed's tree may hold hundreds of users,
the outcome is so dispersed that detecting 0.10 per seed takes
well over a hundred thousand trees per arm. A test that small
sites cannot afford should not be replaced by a guess.
查看完整验算程序
# Chapter 8. A pre-registered paywall test and its decision rule.
# Arms: A = one price for the full reading (9.9); B = the tiered menu.
# Unit of randomisation: the referral tree (p15). Primary outcome: NET
# revenue per seed visitor over 30 days, counting every visitor in the
# seed's tree: payments minus commissions paid out minus the cost of the
# free readings given (0.15 each). Estimand D = mean(B) - mean(A); the
# smallest effect of interest is 0.10 per seed. Gates that make a result
# uninterpretable rather than negative: sample-ratio mismatch (|z| > 3 on
# the split of trees), more than 5 % of trees exposed to both arms, and
# fewer than 90 % of the planned trees. The program sizes the test by
# simulating trees (outcome per seed: a heavy-tailed sum, as in p02; a
# tenth of payments paid out as commission; B lifts paying by 0.4 point)
# and prints the decision for each branch of the rule.
import math
import random
from statistics import NormalDist

Z = NormalDist()

def tree_outcome(rng, uplift):
    size = 1
    alive = 1
    while alive and size < 400:
        kids = sum(rng.random() < 0.18 for _ in range(5))
        alive += kids - 1
        size += kids
    pays = sum(rng.random() < 0.05 + uplift for _ in range(size))
    return pays * 9.9 * 0.9 - 0.15 * size

def decide(d, se, srm_z, mixed, enrolled):
    if abs(srm_z) > 3:
        return "uninterpretable: sample-ratio mismatch"
    if mixed > 0.05:
        return "uninterpretable: arms mixed in more than 5 % of trees"
    if enrolled < 0.9:
        return "uninterpretable: under 90 % of planned trees"
    lo, hi = d - 1.96 * se, d + 1.96 * se
    if lo > 0.10:
        return "B better by at least the smallest effect of interest"
    if hi < 0:
        return "B worse: the tiered menu earns less per seed"
    if lo > 0:
        return "B better, but not shown to reach 0.10"
    return "no difference shown"

if __name__ == "__main__":
    rng = random.Random(63016)
    a = [tree_outcome(rng, 0.0) for _ in range(20000)]
    b = [tree_outcome(rng, 0.004) for _ in range(20000)]
    ma, mb = sum(a) / len(a), sum(b) / len(b)
    sd = math.sqrt((sum((x - ma) ** 2 for x in a)
                    + sum((x - mb) ** 2 for x in b)) / (len(a) + len(b) - 2))
    n = math.ceil(2 * ((1.96 + Z.inv_cdf(0.8)) * sd / 0.10) ** 2)
    print("   simulated net revenue per seed: A {:.3f}, B {:.3f}".format(
        ma, mb))
    print("   pooled SD {:.3f}  ->  {:,} trees per arm for 80 % power"
          .format(sd, n))
    se = sd * math.sqrt(2 / n)
    print("\n   decision rule, one line per branch:")
    for case in ((0.25, 0.0, 0.0, 1.0), (0.12, 0.0, 0.0, 1.0),
                 (0.05, 0.0, 0.0, 1.0), (-0.20, 0.0, 0.0, 1.0),
                 (0.25, 3.5, 0.0, 1.0), (0.25, 0.0, 0.08, 1.0),
                 (0.25, 0.0, 0.0, 0.8)):
        print("   D = {:+.2f}: {}".format(case[0], decide(case[0], se,
                                                       *case[1:])))
    print("\nReading: because one seed's tree may hold hundreds of users,")
    print("the outcome is so dispersed that detecting 0.10 per seed takes")
    print("well over a hundred thousand trees per arm. A test that small")
    print("sites cannot afford should not be replaced by a guess.")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《超临界病毒级联、信息缺口风险率与多层付费墙优化》第 8 章「四步核查、合规清单与一项预注册的付费墙检验」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090174

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

BibTeX
@book{fan2026063,
  author    = {Fan, Yafu},
  title     = {Supercritical Viral Cascades, Information-Gap Hazard Rates and Multi-Tier Paywall Optimization},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090174},
  url       = {https://doi.org/10.5281/zenodo.24090174}
}

本书其他章节结论