关于「实证闭环:门禁拦截日志周报、残余违规率计算器与预注册检验」,《硬门禁与软提示衰减》给出的定量结论是什么?

结论:第八章给出门禁拦截日志周报(虚构示例中阻断率从 42.39 降到 12.71)、小工具「门禁残余违规率计算器」与预注册检验(检验力 0.916)。书中以标注框区分已发表的证据、可运行的 Python 计算(21 段程序)、原典与作者的假说。

数据口径:软提醒按比例起作用,各层独立时残余违规率是漏过率之积,示意参数下四层之后仍是 0.0048,不是零;只有确定性的代码门禁能在它自己定义的模式类别之内做到零。 书中参数均为示意;全部计算由书中程序生成。

English version

对照数据表

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

wk saves BAN ELL SPC SUM WID per1000 reblock leak/1000
11840 21 9 30 6 12 42.39 0.141 1.087
22210 17 7 22 3 10 26.70 0.119 0.452
31975 12 4 15 2 6 19.75 0.103 0.000
42360 10 3 11 1 5 12.71 0.100 0.000
week 4: zero leaks in 2360 saves, 95% bound 0.00127 per save
turn 0-9 saves3120 blocks 45 per1000 14.42
turn 10-19 saves2650 blocks 64 per1000 24.15
turn 20-29 saves1610 blocks 55 per1000 34.16
turn 30+ saves1005 blocks 42 per1000 41.79
late over early block rate2.90, log ratio 1.064
查看完整验算程序
# Chapter 8. p81: the weekly report of a gate's interception log.
# Invented log of four weeks (not real data). Per week: saves; first
# blocks by rule (BAN banned words, ELL ellipsis, SPC digit-hanzi
# spacing, SUM float sums, WID line width); re-blocks (the same file
# blocked again right after a fix: the fix order was not obeyed);
# leaks (violations the publish gate found that the save hook had
# passed: hook down or an unhooked channel). Last lines: blocks per
# save by the turn at which the save happened, the raw sign of decay.
import math

WEEKS = [(1840, {"BAN": 21, "ELL": 9, "SPC": 30, "SUM": 6, "WID": 12},
          11, 2),
         (2210, {"BAN": 17, "ELL": 7, "SPC": 22, "SUM": 3, "WID": 10},
          7, 1),
         (1975, {"BAN": 12, "ELL": 4, "SPC": 15, "SUM": 2, "WID": 6},
          4, 0),
         (2360, {"BAN": 10, "ELL": 3, "SPC": 11, "SUM": 1, "WID": 5},
          3, 0)]
RULES = ["BAN", "ELL", "SPC", "SUM", "WID"]
print("wk saves  BAN ELL SPC SUM WID  per1000  reblock  leak/1000")
for i, (n, b, rb, lk) in enumerate(WEEKS, 1):
    tot = 0
    for r in RULES:
        tot += b[r]
    row = "%2d %5d " % (i, n)
    for r in RULES:
        row += "%4d" % b[r]
    print(row + "  %7.2f  %7.3f  %9.3f" % (1000 * tot / n, rb / tot,
                                          1000 * lk / n))
n4 = WEEKS[3][0]
print("week 4: zero leaks in %d saves, 95%% bound %.5f per save" % (
    n4, 1 - 0.05 ** (1 / n4)))
BUCKETS = [("turn 0-9", 3120, 45), ("turn 10-19", 2650, 64),
           ("turn 20-29", 1610, 55), ("turn 30+", 1005, 42)]
for name, n, b in BUCKETS:
    print("%-11s saves %5d  blocks %3d  per1000 %6.2f" % (
        name, n, b, 1000 * b / n))
lo = BUCKETS[0][2] / BUCKETS[0][1]
hi = BUCKETS[3][2] / BUCKETS[3][1]
print("late over early block rate: %.2f, log ratio %.3f" % (
    hi / lo, math.log(hi / lo)))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《客户端生命周期硬门禁工程、软提示遵从率轮次衰减与保存前物理拦截状态机母典》第 8 章「实证闭环:门禁拦截日志周报、残余违规率计算器与预注册检验」(版本 1.0.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026256,
  author    = {Fan, Yafu},
  title     = {Hard Gates across the Client Lifecycle: the Decay of Soft-Prompt Compliance over Turns and State Machines for Interception before Publication},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论