关于「东西方原典考辨:《明会典》勘合半印比对之制与高尔顿《指纹》」,《截图不是钱》给出的定量结论是什么?

结论:示意目录下的金额只有 4.27 比特,生日界 5.2 单,与第一章一致。末四位 13.29 比特、生日界 117.7;末五位 16.61 比特、生日界 372.3;三十分钟时间窗 4.60 比特。金额、末五码与时间窗合起来是 25.48 比特,生日界 8,065.2,即一个时间窗里要有八千多单,才有对半的机会撞键。高尔顿的指纹估算相当于 36.00 比特,生日界 308,651.0;64 位理想哈希在门槛 4 下相当于 44.63 比特;16 位数字的交易号有 53.15 比特,生日界一亿多。

数据口径:书中订单、账号末码、金额、截图与哈希均由固定种子合成,参数为示意,全部计算由书中程序生成;本书只讨论核销方如何检出重复或改动过的凭证,不提供任何制作凭证的方法;属非个人化经营方法,不构成法律、财务或理财建议,任何置付与发货都须由主事者人工放行。 第一章用生日问题量化撞单:从 10 单到 100 单,期望撞单配对数增长 110.0 倍,撞单概率只增长 41.3 倍;示意目录的有效金额只有 19.3 种,5.2 单即有对半机会撞单。

English version

对照数据表

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

keybitsany pair, even oddsone vs all, even odds
register serial, 1006.6411.869
amount, catalogue law4.275.213
last four digits13.29117.76,931
last five digits16.61372.369,315
30-minute window4.605.817
amount+last5+window25.488,065.232,524,123
Galton fingerprint36.00308,651.047,632,711,549
64-bit hash, d <= 444.636,136,404.918,827,732,679,747
16-digit txn number53.15117,741,002.36,931,471,805,599,453
查看完整验算程序
# Chapter 7. p71: identification keys measured in bits
# Model: a key that falls on K equally likely values carries log2 K
# bits. Two questions differ: (a) how many items until two of them
# share a value by chance (any pair; even odds near sqrt(2 ln2 K),
# the birthday bound), and (b) how many items until a given one meets
# a twin (one against all; even odds near ln2 * K). Keys: a serial in
# a register of 100 numbers per character (as on the Ming tally
# certificates, illustrative size), the amount under the catalogue
# law of p12 (1/s = 19.3 effective values), last four and last five
# digits, a 30-minute window (1/q, q = 0.04123 from p21), the three
# together, Galton's 36 bits for a fingerprint, a 64-bit hash within
# distance 4 (P from p61), and a 16-digit transaction number.
import math
from fractions import Fraction


def p_within(b, t):
    num = 0
    for k in range(t + 1):
        num += math.comb(b, k)
    return Fraction(num, 2 ** b)


S = 0.051690
Q = 0.04123
KEYS = [
    ("register serial, 100", 100.0),
    ("amount, catalogue law", 1.0 / S),
    ("last four digits", 1e4),
    ("last five digits", 1e5),
    ("30-minute window", 1.0 / Q),
    ("amount+last5+window", 1e5 / (S * Q)),
    ("Galton fingerprint", 2.0 ** 36),
    ("64-bit hash, d <= 4", 1.0 / float(p_within(64, 4))),
    ("16-digit txn number", 1e16),
]
print("key                    bits   any pair, even odds"
      "     one vs all, even odds")
for name, k in KEYS:
    pair = math.sqrt(2 * math.log(2) * k)
    one = math.log(2) * k
    print("%-21s %6.2f  %19s  %23s"
          % (name, math.log2(k), "{:,.1f}".format(pair),
             "{:,.0f}".format(one)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《多模态汇款凭证与口语订单容错解析、转账末五码核销自动机与重复截图欺诈阻断母典》第 7 章「东西方原典考辨:《明会典》勘合半印比对之制与高尔顿《指纹》」(版本 1.0.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026267,
  author    = {Fan, Yafu},
  title     = {Fault-Tolerant Parsing of Payment Receipts and Spoken Orders: Last-Five-Digit Write-Off Automata and Blocking Duplicate-Screenshot Fraud},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论