What does Hard Gates and Soft-Prompt Decay conclude, in numbers, about “Holes That Line Up: the Floor That Common-Cause Failure Puts under Stacked Soft Layers”?
Answer: Chapter 2 treats common-cause failure: with a common-cause share of only 0.01, it supplies 0.933 of the residual after six soft layers.
Scope of the numbers: Soft reminders work in proportion; when layers are independent the residual violation rate is the product of their miss rates, and with illustrative parameters four layers still leave 0.0048, not zero. Its parameters are illustrative; all calculations are generated by its programs.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.01, 0.933
| residual per save, k soft layers of miss 0.30 each | |
| k q | 0.00 q=0.01 q=0.05 q=0.20 |
| 1 | 0.0300000 0.0307000 0.0335000 0.0440000 |
| 2 | 0.0090000 0.0099100 0.0135500 0.0272000 |
| 3 | 0.0027000 0.0036730 0.0075650 0.0221600 |
| 4 | 0.0008100 0.0018019 0.0057695 0.0206480 |
| 5 | 0.0002430 0.0012406 0.0052309 0.0201944 |
| 6 | 0.0000729 0.0010722 0.0050693 0.0200583 |
| floor v x q as k grows: | |
| q | 0.00 floor 0.0000 share of R(6) from q 0.000 |
| q | 0.01 floor 0.0010 share of R(6) from q 0.933 |
| q | 0.05 floor 0.0050 share of R(6) from q 0.986 |
| q | 0.20 floor 0.0200 share of R(6) from q 0.997 |
Key formula
Show the full program
# Chapter 2. p21: a common cause puts a floor under stacked soft layers.
# Beta-factor style model: with probability q a shared condition (the
# instruction was never loaded, the session drifted, every layer reads
# the same wrong context) makes all soft layers miss together; else
# they miss independently with miss m each. Residual per save:
# R(k) = v x ((1 - q) x m ** k + q)
# As k grows R(k) falls to the floor v x q, not to zero.
# v = 0.10 and m = 0.30 as in p11; q is illustrative.
from fractions import Fraction as F
V, M = F(1, 10), F(3, 10)
QS = [F(0), F(1, 100), F(5, 100), F(1, 5)]
print("residual per save, k soft layers of miss 0.30 each")
head = "%3s" % "k"
for q in QS:
head += "%13s" % ("q=%.2f" % float(q))
print(head)
for k in range(1, 7):
row = "%3d" % k
for q in QS:
row += "%13.7f" % float(V * ((1 - q) * M ** k + q))
print(row)
print("floor v x q as k grows:")
for q in QS:
r6 = V * ((1 - q) * M ** 6 + q)
print(" q = %.2f floor %.4f share of R(6) from q %.3f" % (
float(q), float(V * q), float(V * q / r6)))Single source and citation
Fan, Y. (2026). Hard Gates across the Client Lifecycle: the Decay of Soft-Prompt Compliance over Turns and State Machines for Interception before Publication (Version 1.0.0), Chapter 2: Holes That Line Up: the Floor That Common-Cause Failure Puts under Stacked Soft Layers. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 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}
}Other chapter answers in this book
- Chapter 1 · The Product Account: Why Stacked Soft Layers Never Leave a Zero Residual
- Chapter 3 · Decay over Turns: an Exponential Model of Soft-Prompt Compliance, Re-Sending Periods and Reading the Log
- Chapter 4 · Where to Intercept: before the Write, after It or before Publication, and Whether a Broken Gate Passes or Refuses
- Chapter 5 · Exhausting the State Machine: Proving a Dirty Publication Unreachable and Finding the Shortest Counterexamples of Three Faulty Designs
- Chapter 6 · The Price of Hardness: Pattern Width, Wrong Blocks and Gates That Get Switched Off
- Chapter 7 · Classical Sources East and West: Law and the Inked Line in the Han Feizi, and Reason's Classification of Error
- Chapter 8 · Closing the Loop: the Weekly Interception Report, the Residual Calculator and a Pre-Registered Test