关于「实证闭环:演示与交付的精算工具与执行清单」,《演示先行与四十八小时交付》给出的定量结论是什么?

结论:精算工具把前六章的公式合成一个检查器,无参数运行即复现示范结果。执行清单规定台账字段、每日每周每月的节奏,以及每个阈值亮灯以后做什么、停什么。预注册检验事先写明了样本量与推翻条件:预览跃升每组 231 次报价,四十八小时承诺 59 份订单,零价效应每组 6 份订单。

数据口径:书中的赢率、工时、毛利、首付比例、月费与价格均为示意参数,以「单位」计,不对应任何币种、真实客户或真实成交;全部计算由书中程序生成。 本书不是法律意见,也不是个人化经营或理财建议,合同条款须由当地执业律师审阅;书中不写威胁催促、不写会重置的倒计时、不写收益承诺,推荐奖励只写单层。

English version

对照数据表

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

H1 preview jump 0.200.30: n = 231 per arm, 462 pitches
at 12 pitches a month38.5 months
H2 on time 0.85 vs 0.95: n59 builds, reject if >= 55 on time
exact alpha 0.0469, power 0.8281, 9.8 months at 6 builds
H3 change rate 6.0 vs 2.5 per project: n6 projects per arm
refute H1 if the upper 95 % bound of the jump < 0.0409
refute H2 if fewer than 55 of 59 builds land inside 48 hours
查看完整验算程序
# Chapter 8. p82: sample sizes for the pre-registered tests.
# H1 (preview jump): win rate 0.20 without a preview vs 0.30 with one,
#   one-sided alpha 0.05, power 0.80; the refuting result is an upper
#   95 % bound of the jump below the break-even line 0.0409.
# H2 (48-hour promise): exact binomial test of on-time share 0.85 vs
#   0.95; smallest n whose rejection region keeps alpha <= 0.05 and
#   reaches power >= 0.80.
# H3 (zero-price creep): Poisson change counts per project, 6.0 when
#   free vs 2.5 when priced, square-root transform, two-sided 0.05.
# Deal flow (12 pitches, 6 builds a month) is illustrative.
import math
from statistics import NormalDist

Z = NormalDist()


def n_two_prop(p0, p1, alpha=0.05, power=0.80):
    za, zb = Z.inv_cdf(1 - alpha), Z.inv_cdf(power)
    pbar = (p0 + p1) / 2
    num = (za * math.sqrt(2 * pbar * (1 - pbar)) +
           zb * math.sqrt(p0 * (1 - p0) + p1 * (1 - p1))) ** 2
    return math.ceil(num / (p1 - p0) ** 2)


def binom_tail(n, k, p):
    return math.fsum(math.comb(n, j) * p ** j * (1 - p) ** (n - j)
                     for j in range(k, n + 1))


def exact_n(p0, p1, alpha=0.05, power=0.80):
    for n in range(10, 400):
        for k in range(n + 1):
            if binom_tail(n, k, p0) <= alpha:
                if binom_tail(n, k, p1) >= power:
                    return n, k, binom_tail(n, k, p0), binom_tail(n, k, p1)
                break
    return None


n1 = n_two_prop(0.20, 0.30)
print("H1 preview jump 0.20 -> 0.30: n = {} per arm, {} pitches".format(
    n1, 2 * n1))
print("   at 12 pitches a month: {:.1f} months".format(2 * n1 / 12))
n2, k2, a2, b2 = exact_n(0.85, 0.95)
print("H2 on time 0.85 vs 0.95: n = {} builds, reject if >= {} on time"
      .format(n2, k2))
print("   exact alpha {:.4f}, power {:.4f}, {:.1f} months at 6 builds"
      .format(a2, b2, n2 / 6))
l0, l1 = 6.0, 2.5
n3 = math.ceil((Z.inv_cdf(0.975) + Z.inv_cdf(0.80)) ** 2 /
               (2 * (math.sqrt(l0) - math.sqrt(l1)) ** 2))
print("H3 change rate 6.0 vs 2.5 per project: n = {} projects per arm"
      .format(n3))
print("refute H1 if the upper 95 % bound of the jump < 0.0409")
print("refute H2 if fewer than {} of {} builds land inside 48 hours"
      .format(k2, n2))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《半成品演示先行逼单、四十八小时交钥匙系统交付与防需求蔓延母典》第 8 章「实证闭环:演示与交付的精算工具与执行清单」(版本 1.0.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026368,
  author    = {Fan, Yafu},
  title     = {Demo-First B2B Closing, Forty-Eight-Hour Turnkey System Delivery and Scope-Creep Containment},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论