关于「沉没输入:承诺,还是筛选?」,《诊断收费站、悬念缺口与解锁定价》给出的定量结论是什么?

结论:第二章说明收银台前的输入,只有在每一步让支付意愿提高超过 1.0753 时才有帮助,而单靠筛选就能让收银台转化提高到 1.4080 倍,同时每位访客的购买降到 0.6439。

数据口径:书中的用户、比率与参数均为示意模型;全部计算由书中程序生成;本书不是法律、财务或消费者保护方面的建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序)、原典与作者的假说。

English version

对照数据表

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

stepsreach paywallpay at paywallbuys per visitor
01.00000.03960.03961
20.75400.04540.03421
40.58140.04940.02873
60.45730.05580.02550
80.36470.06020.02194
paywall conversion, 6 steps over none: 1.4080
buys per visitor, 6 steps over none:0.6439
查看完整验算程序
# Chapter 2. p04: Selection is not commitment. Visitors differ in intent
# t, drawn as the square of a uniform number (most are browsing). Each
# input step is abandoned with chance 0.20 (1 - t), so the curious stay.
# At the paywall a visitor pays with chance 0.12 t: no causal commitment
# effect at all. Observed paywall conversion still rises with the number
# of steps, because the visitors who reach it are different people. We
# print both, and what a randomised test of 0 against 6 steps would show.
# 200000 visitors per arm, seed 114.
import random

def arm(steps, n=200000, seed=114):
    rng = random.Random(seed)
    reach, buy = 0, 0
    for _ in range(n):
        t = rng.random() ** 2
        ok = True
        for _ in range(steps):
            if rng.random() < 0.20 * (1 - t):
                ok = False
                break
        if not ok:
            continue
        reach += 1
        if rng.random() < 0.12 * t:
            buy += 1
    return reach / n, buy / reach, buy / n

if __name__ == "__main__":
    print("steps   reach paywall   pay at paywall   buys per visitor")
    for s in (0, 2, 4, 6, 8):
        r, p, b = arm(s)
        print("{:5d}   {:13.4f}   {:14.4f}   {:16.5f}".format(s, r, p, b))
    r0, p0, b0 = arm(0)
    r6, p6, b6 = arm(6)
    print("paywall conversion, 6 steps over none: {:.4f}".format(p6 / p0))
    print("buys per visitor, 6 steps over none:   {:.4f}".format(b6 / b0))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《算法诊断收费站、悬念缺口校准与多阶解锁经济学》第 2 章「沉没输入:承诺,还是筛选?」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-114 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026114,
  author    = {Fan, Yafu},
  title     = {Algorithmic Diagnostic Paywalls, Curiosity-Gap Calibration and Tiered Report Unlock Economics},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论