关于「最小安全储备公式与多网关分散」,《支付路由、拒付与现金储备》给出的定量结论是什么?
结论:第六章给出最小安全储备的近似公式,并发现最大的风险是网关冻结:一个网关需要 RM 3,114,683,分给四个网关只需 RM 1,258,468。
数据口径:书中的订单量、事件率、毛利、退款率、冻结频率与胜诉概率均为示意或合成模型;全部数据由书中程序生成;卡组织规则以写作时的公开资料为准;本书不是法律、财务或合规意见。 第三章把友好欺诈写成威慑博弈:胜诉概率达到 0.75 时虚假争议在示意模型中完全消失;证据包中「理性消费勾选」的分量最小。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 1258468, 3114683
| gateways | cash needed (99%) RM | share of paths with a freeze |
| 1 | 3,114,683 | 0.463 |
| 2 | 2,026,860 | 0.687 |
| 3 | 1,532,138 | 0.818 |
| 4 | 1,258,468 | 0.907 |
核心公式
\[u_{\min} \approx G + \max\{0,\,-(m - 0.97rV)\}\,H + 2.326\,\sigma\sqrt{H} + P + \frac{(1+\theta)\mu}{\theta}\ln\frac{1}{(1+\theta)\varepsilon}.\]
查看完整验算程序
# Chapter 6. p12: Spreading volume over several gateways. The business of
# p10 (10% rolling reserve for 90 days) splits its card sales evenly over
# k gateways. Each gateway, independently, freezes all payouts at random
# times (0.3 freezes a year); a freeze lasts 90 days, after which the
# held money is paid out. Costs and refunds go on. Cash needed so that
# the balance stays above zero over two years in 99% of 1,000 paths.
# Seed 85.
import importlib.util
import random
def load(name):
spec = importlib.util.spec_from_file_location(name, name + ".py")
m = importlib.util.module_from_spec(spec)
spec.loader.exec_module(m)
return m
p10 = load("p10_rolling_reserve")
V, PAY, R, H = p10.V, p10.PAY, 0.10, 90
def path(rng, k, days=730):
frozen_until = [0] * k
owed = [0.0] * k
cash, low, froze = 0.0, 0.0, False
for d in range(days):
for g in range(k):
if frozen_until[g] <= d and rng.random() < 0.3 / 365:
frozen_until[g] = d + 90
froze = True
share = V / k
due = 0.0
if d >= 2:
due += (1 - R) * PAY * share
if d >= H:
due += R * PAY * share
if frozen_until[g] > d:
owed[g] += due
else:
cash += due + owed[g]
owed[g] = 0.0
refunds = p10.REF * V * (3 if 300 <= d < 314 else 1)
cash -= p10.COST * V + refunds
for _ in range(p10.shocks(rng, 2 / 7)):
cash -= rng.expovariate(1 / 8000.0)
low = min(low, cash)
return -low, froze
if __name__ == "__main__":
rng = random.Random(85)
print(" gateways cash needed (99%) RM share of paths with a freeze")
for k in (1, 2, 3, 4):
runs = [path(rng, k) for _ in range(1000)]
s = sorted(x for x, _ in runs)
print(" {:8d} {:20,.0f} {:.3f}".format(
k, s[989], sum(1 for _, f in runs if f) / 1000))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《跨境支付智能路由、拒付抗辩博弈与资金池破产边界》第 6 章「最小安全储备公式与多网关分散」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090225
DOI: 10.5281/zenodo.24090225 · 阅读本章所在专著 · 5DL-B-085 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026085,
author = {Fan, Yafu},
title = {Cross-Border Payment Routing, Chargeback Defense Games and Treasury Ruin Bounds},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.24090225},
url = {https://doi.org/10.5281/zenodo.24090225}
}