关于「信任锚、定金比例与以新补旧检出」,《负营运资金飞轮与预收安全边界》给出的定量结论是什么?

结论:买家先付钱,靠的是信任锚:履约记录、第三方托管、公开交付期限与公开退款条款。p62 说明,没有托管时,新卖家要累积十几单干净记录,谨慎的买家才肯先付;有托管时,两三单就够。p61 说明,在示意曲线下,期望净现金最大的定金比例只有两成左右,远低于把周期压负所需的比例,所以压周期要靠供应商账期,不能全靠定金。p63 给出逐周检出以新补旧的规则,它在现金转负之前数周就亮起红灯。

数据口径:书名中的「零本金」只指不借债、不融资,不等于没有风险;书中的营收、毛利、账期、退款率、获客成本与价格均为示意参数,全部计算由书中程序生成;本书是非个人化经营建议,不构成法律、会计、税务或投资建议,各地预付款、定金与储值规则以上架前人工复核为准,本书不涉及任何分润或返佣。 第四至六章用固定种子蒙特卡洛说明,单一冲击很少压垮预售生意,叠加冲击才是准备金要防的东西,示意参数下审慎的准备金率红线是 0.474;每单定金交付前可动用于获客的比例上界是 0.475,回本只按已实现毛利计;并给出信任锚、定金比例权衡与逐周检出以新补旧的规则。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库

required delivery probability: no escrow 0.800, escrow 0.242
clean orders needed before a cautious buyer prepays
with 0 failed: no escrow13, escrow 2
with 1 failed: no escrow20, escrow 2
with 2 failed: no escrow27, escrow 3
anonymous pool: prepayment unravels if honest share < 0.825
lower bound after 30 clean orders0.908
查看完整验算程序
# Chapter 6. p62: trust anchors for prepayment - track record and escrow.
# A buyer values delivery at 1.25 and pays 1.00 in advance. Without a
# refund route she prepays only if the delivery probability p satisfies
# 1.25 * p - 1 >= 0, i.e. p >= 0.8. With a third-party escrow that
# refunds on non-delivery, minus a 0.03 fee and a 0.05 cost of waiting,
# the condition is 1.25 * p + 0.92 * (1 - p) >= 1, i.e. p >= 0.242.
# A cautious buyer uses the 5% lower bound of the Beta(1 + n, 1 + k)
# posterior after n delivered and k failed orders (uniform prior). Pooled
# anonymous sellers: an honest share h delivers with 0.97, others never.
# All values are illustrative.
import math


def beta_cdf(x, a, b):
    # integer a, b: I_x(a, b) = P(Binomial(a + b - 1, x) >= a)
    n = a + b - 1
    terms = [math.comb(n, j) * x ** j * (1 - x) ** (n - j)
             for j in range(a, n + 1)]
    return math.fsum(terms)


def lower_bound(n, k, tail=0.05):
    lo, hi = 0.0, 1.0
    for _ in range(60):
        mid = (lo + hi) / 2
        if beta_cdf(mid, 1 + n, 1 + k) < tail:
            lo = mid
        else:
            hi = mid
    return lo


def need(req, k):
    n = 0
    while lower_bound(n, k) < req:
        n += 1
    return n


plain = 1.0 / 1.25
escrow = 0.08 / (0.25 + 0.08)
print("required delivery probability: no escrow %.3f, escrow %.3f" % (
    plain, escrow))
print("clean orders needed before a cautious buyer prepays")
for k in (0, 1, 2):
    print("   with %d failed: no escrow %3d, escrow %2d" % (
        k, need(plain, k), need(escrow, k)))
h = plain / 0.97
print("anonymous pool: prepayment unravels if honest share < %.3f" % h)
print("lower bound after 30 clean orders: %.3f" % lower_bound(30, 0))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《负营运资金飞轮、预收定金周转动力学与零本金商业放大母典》第 6 章「信任锚、定金比例与以新补旧检出」(版本 1.0.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026365,
  author    = {Fan, Yafu},
  title     = {Negative Working-Capital Flywheels, Upfront Customer Float and Zero-Capital Bootstrap Scaling},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论