关于「宋代市舶抽解与明清山西票号的密押、调拨」,《支付路由、拒付与现金储备》给出的定量结论是什么?
结论:一个从未见过真汇票的伪造者,盲猜全部六个字的成功机会是 3,600,000 分之一。但字表是固定的:见过 10 张真汇票之后,他已经认得伪造一张随机汇票所需全部字的概率是 0.155;见过 50 张是 0.806;见过 200 张是 0.998。密押的安全不在字表本身,而在于定期更换字表、并让每张汇票只在少数人手中经过。现代的带密钥哈希(截短为 32 位)则不同:无论攻击者见过多少张真单据,猜中的机会都是 4,294,967,296 分之一,前提是密钥本身不外泄。第四章的证据日志用的就是这种做法。
数据口径:书中的订单量、事件率、毛利、退款率、冻结频率与胜诉概率均为示意或合成模型;全部数据由书中程序生成;卡组织规则以写作时的公开资料为准;本书不是法律、财务或合规意见。 第三章把友好欺诈写成威慑博弈:胜诉概率达到 0.75 时虚假争议在示意模型中完全消失;证据包中「理性消费勾选」的分量最小。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.155, 0.806, 0.998, 10, 200, 32
| forger guessing blind | 1 in 3,600,000 |
| after | 10 genuine drafts, all symbols known: 0.155 |
| after | 50 genuine drafts, all symbols known: 0.806 |
| after 200 genuine drafts, all symbols known | 0.998 |
| HMAC truncated to 32 bits | 1 in 4,294,967,296 |
| branches separate reserves pooled saving | |
| 1 | 2.33 2.33 0% |
| 4 | 9.30 4.65 50% |
| 9 | 20.93 6.98 67% |
| 16 | 37.22 9.30 75% |
查看完整验算程序
# Chapter 7. p13: Secret codes and pooled silver. (1) A draft carries a
# code: one symbol for the month (12), one for the day (30) and one per
# digit of the amount (10 symbols, 4 digits). A forger who has seen no
# genuine draft guesses all six symbols; one who has seen n genuine drafts
# may have learned the symbols he needs. Against that, a keyed hash
# (HMAC) truncated to 32 bits is guessed with 2^-32 whatever he has seen.
# (2) k branches each face independent cash calls with sd 1 (in units of
# a branch's typical call); each alone needs 2.326 sd for 99% cover, a
# pooled treasury needs 2.326 * sqrt(k).
import random
from math import sqrt
def learned(rng, n, trials=4000):
"""Share of target drafts whose six symbols all appeared in n drafts."""
hit = 0
for _ in range(trials):
seen_m, seen_d, seen_x = set(), set(), set()
for _ in range(n):
seen_m.add(rng.randrange(12))
seen_d.add(rng.randrange(30))
seen_x.update(rng.randrange(10) for _ in range(4))
m, d = rng.randrange(12), rng.randrange(30)
xs = {rng.randrange(10) for _ in range(4)}
hit += m in seen_m and d in seen_d and xs <= seen_x
return hit / trials
if __name__ == "__main__":
rng = random.Random(85)
print(" forger guessing blind: 1 in {:,}".format(12 * 30 * 10 ** 4))
for n in (10, 50, 200):
print(" after {:3d} genuine drafts, all symbols known: {:.3f}"
.format(n, learned(rng, n)))
print(" HMAC truncated to 32 bits: 1 in {:,}".format(2 ** 32))
print(" branches separate reserves pooled saving")
for k in (1, 4, 9, 16):
sep, pool = 2.326 * k, 2.326 * sqrt(k)
print(" {:8d} {:17.2f} {:6.2f} {:6.0%}".format(
k, sep, pool, 1 - pool / sep))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《跨境支付智能路由、拒付抗辩博弈与资金池破产边界》第 7 章「宋代市舶抽解与明清山西票号的密押、调拨」(版本 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}
}