关于「乘积账:软层叠加的残余违规率为何永远不是零」,《硬门禁与软提示衰减》给出的定量结论是什么?

结论:软提醒是按比例起作用的,叠层之后残余率是乘积,示意参数下四层之后是 0.004800,不是零。硬门禁把违规分成类内与类外:类内只有在门禁故障且放行时才漏,类外完全不受影响。观察到零只给出一个上界,零的保证来自结构。可是,乘积账依赖一个很强的假设:各层彼此独立。假如所有软层读的是同一段上下文、犯的是同一种迷糊,漏洞会不会一起出现?叠层的收益又会在哪里停下?这是下一章的问题。

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

English version

对照数据表

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

base violation share v = 0.10 per save
layer added    miss     residual  per 1e6 saves
prompt         0.30     0.030000        30000.0
self-check     0.50     0.015000        15000.0
peer           0.40     0.006000         6000.0
human          0.80     0.004800         4800.0
residual is exactly 3/625, never 0
layers of miss 0.30 needed to reach a target residual:
  target 1e-04   layers  6
  target 1e-06   layers 10
  target 1e-09   layers 16
a deterministic layer with miss 0 inside its class: residual 0

核心公式

\[R = v \times m_1 \times m_2 \times \cdots \times m_k.\]
查看完整验算程序
# Chapter 1. p11: residual violation rate of stacked soft layers, exact.
# Model: an agent would commit one class of violation in a share v of
# its saves. Soft layers (a system prompt, a self-check reminder, a
# peer review, a sampled human look) each let a violation through with
# miss rate m_i. If the layers fail independently, the residual rate
# is v times the product of all m_i: it shrinks but never reaches
# zero while every m_i > 0. All rates are illustrative.
from fractions import Fraction as F
import math

V = F(1, 10)
LAYERS = [("prompt", F(3, 10)), ("self-check", F(1, 2)),
          ("peer", F(2, 5)), ("human", F(4, 5))]

print("base violation share v = %.2f per save" % float(V))
print("%-12s %6s %12s %14s" % ("layer added", "miss", "residual",
                                "per 1e6 saves"))
r = V
for name, m in LAYERS:
    r = r * m
    print("%-12s %6.2f %12.6f %14.1f" % (name, float(m), float(r),
                                          float(r) * 1e6))
print("residual is exactly %s, never 0" % r)
print("layers of miss 0.30 needed to reach a target residual:")
for target in (F(1, 10 ** 4), F(1, 10 ** 6), F(1, 10 ** 9)):
    k = math.ceil(math.log(float(target / V)) / math.log(0.3))
    print("  target %.0e   layers %2d" % (float(target), k))
print("a deterministic layer with miss 0 inside its class: residual 0")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《客户端生命周期硬门禁工程、软提示遵从率轮次衰减与保存前物理拦截状态机母典》第 1 章「乘积账:软层叠加的残余违规率为何永远不是零」(版本 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}
}

本书其他章节结论