关于「原典考辨:《老子》《荀子》与亚里士多德、威廉·詹姆斯论起手与习惯」,《首分钟上手与粘性方程》给出的定量结论是什么?

结论:第七章考辨《老子》「天下难事必作于易」、《荀子》「不积跬步」、亚里士多德与威廉·詹姆斯论习惯:从易到难的顺序完成率 0.5757,从难到易 0.4805。

数据口径:首分钟漏斗是乘法:示意参数下,注册墙要走 9 步,每一万名访客只有 3,477 人看到第一个结果;先玩后存只要 2 步,有 8,924 人看到,约为前者的 2.57 倍,存档接受率达到 0.508 时两者账号数打平。 点按目标从 24 像素放大到 44 像素,示意误点率从 0.0865 降到 0.0017。

English version

对照数据表

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

orders24
easy first (0.05, 0.1, 0.2, 0.35) completes 0.5757
hard first (0.35, 0.2, 0.1, 0.05) completes 0.4805
best 0.5757 worst 0.4805 gap 0.0951
no progress effect, any order0.4446
split the 0.35 step into k small steps (kept last)
k1: each drop 0.3500 completes 0.5757
k2: each drop 0.1938 completes 0.5547
k3: each drop 0.1338 completes 0.5433
k4: each drop 0.1021 completes 0.5357
查看完整验算程序
# Chapter 7. p71: "hard things start from the easy" as a testable order.
# Four onboarding steps have base drop probabilities 0.05, 0.10, 0.20 and
# 0.35. Progress already made lowers the drop of the next step:
# drop = base * (1 - 0.5 * done / 4). All 24 orders are enumerated.
# Then the hardest step is split into k small steps with the same total
# base pass rate (Xunzi's small paces). Parameters are illustrative.
import itertools
import math

BASE = (0.05, 0.10, 0.20, 0.35)


def complete(order):
    n = len(order)
    passes = []
    for i, d in enumerate(order):
        passes.append(1.0 - d * (1.0 - 0.5 * i / n))
    return math.prod(passes)


if __name__ == "__main__":
    res = sorted((complete(o), o) for o in itertools.permutations(BASE))
    print("orders: {}".format(len(res)))
    print("  easy first  {}  completes {:.4f}".format(
        BASE, complete(BASE)))
    rev = tuple(reversed(BASE))
    print("  hard first  {}  completes {:.4f}".format(rev, complete(rev)))
    print("  best {:.4f}  worst {:.4f}  gap {:.4f}".format(
        res[-1][0], res[0][0], res[-1][0] - res[0][0]))
    print("no progress effect, any order: {:.4f}".format(
        math.prod(1.0 - d for d in BASE)))
    print("split the 0.35 step into k small steps (kept last)")
    for k in (1, 2, 3, 4):
        small = 1.0 - (1.0 - 0.35) ** (1.0 / k)
        order = BASE[:3] + (small,) * k
        print("  k = {}: each drop {:.4f}  completes {:.4f}".format(
            k, small, complete(order)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《首分钟零摩擦上手、微交互成瘾回路与产品超高粘性留存工程母典》第 7 章「原典考辨:《老子》《荀子》与亚里士多德、威廉·詹姆斯论起手与习惯」(版本 1.0.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026379,
  author    = {Fan, Yafu},
  title     = {Zero-Friction First-Minute Onboarding, Micro-Interaction Habit Loops and High-Stickiness Interface Engineering},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论