关于「订单状态机:穷举检验与幂等窗口」,《零人工站群、支付防欺诈与现金流排队》给出的定量结论是什么?

结论:第三章的穷举模型检验显示,不看状态的处理函数两个事件就能造成重复放行,幂等键必须比 511 分钟的重试计划活得更久且原子写入。

数据口径:第四章用排队论与模拟显示,突发到达把单个工作进程的 T99 推到数十秒;平均负载 0.80 时,突发需要 4 个工作进程,或 3 个加限流(拒绝 0.0005 的请求)。 书中以标注框区分证据、16 段可运行的 Python 程序、史料与假说。

English version

对照数据表

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

   retry schedule spans 511 minutes
   copies delivered beyond the first: 26,883
   race copies within 0.2 s: 486
     TTL (min)   processed twice, plain   with atomic check
             0                   26,883              26,883
            10                    9,912               9,426
            60                    3,015               2,529
           600                      486                   0
          1440                      486                   0
Reading: retries are the normal case, not the exception:
tens of thousands of copies per 100,000 orders, spread by a
slow-down over hours of back-off. A key kept for ten minutes
or an hour still lets thousands through; only a TTL longer
than the whole schedule together with an atomic check-and-
insert stops them all.
查看完整验算程序
# Chapter 3. [p06] At-least-once notices and the idempotency window.
# A payment notice (webhook) is retried until acknowledged: the sender
# waits 1, 2, 4, ..., 256 minutes between tries. A delivery that was
# processed is retried anyway when its acknowledgement is lost: with
# chance 0.03 at random, and throughout a receiver slow-down (chance
# 0.05 per order, lasting an exponential time of mean 30 minutes)
# during which work is done but every acknowledgement times out. With
# chance 0.005 a proxy also resends the first copy after about 0.05 s.
# The receiver keeps each idempotency key for a time-to-live (TTL); a
# copy arriving after the key has expired is processed again. Two
# copies within the 0.2 s it takes to process one notice both pass the
# key check unless the check-and-insert is atomic.
# 100,000 orders are simulated; duplicates processed per 100,000 are
# reported for each TTL, without and with an atomic check.
import random

GAPS = [2 ** i for i in range(9)]

def deliveries(rng):
    slow = rng.expovariate(1 / 30) if rng.random() < 0.05 else -1.0
    t, out = 0.0, []
    for g in [0] + GAPS:
        t += g
        out.append(t)
        if t >= slow and rng.random() >= 0.03:
            break
    if rng.random() < 0.005:
        out.insert(1, rng.expovariate(1 / 0.05) / 60)
    return out

if __name__ == "__main__":
    rng = random.Random(75006)
    orders = [deliveries(rng) for _ in range(100000)]
    dup = sum(len(o) - 1 for o in orders if o)
    print("   retry schedule spans {} minutes".format(sum(GAPS)))
    print("   copies delivered beyond the first: {:,d}".format(dup))
    print("   race copies within 0.2 s: {:,d}".format(sum(
        1 for o in orders for a, b in zip(o, o[1:]) if b - a < 0.2 / 60)))
    print("     TTL (min)   processed twice, plain   with atomic check")
    for ttl in (0, 10, 60, 600, 1440):
        plain = atomic = 0
        for o in orders:
            if not o:
                continue
            first = o[0]
            for t in o[1:]:
                late = t - first > ttl
                race = t - first < 0.2 / 60 and not late
                plain += late or race
                atomic += late
        print("     {:9d} {:24,d} {:19,d}".format(ttl, plain, atomic))
    print("\nReading: retries are the normal case, not the exception:")
    print("tens of thousands of copies per 100,000 orders, spread by a")
    print("slow-down over hours of back-off. A key kept for ten minutes")
    print("or an hour still lets thousands through; only a TTL longer")
    print("than the whole schedule together with an atomic check-and-")
    print("insert stops them all.")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《零人工多站点容错架构、支付防欺诈状态机与被动现金流排队论》第 3 章「订单状态机:穷举检验与幂等窗口」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090201

DOI: 10.5281/zenodo.24090201 · 阅读本章所在专著 · 5DL-B-075 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026075,
  author    = {Fan, Yafu},
  title     = {Zero-Touch Multi-Site Fault Tolerance, Payment Anti-Fraud State Machines and Passive Cashflow Queuing},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090201},
  url       = {https://doi.org/10.5281/zenodo.24090201}
}

本书其他章节结论