Where it would die · 5 switches
Five claims carry this chapter.
APP-3.1Show that the boundary cannot be computed from interaction data in principle — not hidden, not hard, but underdetermined — and the installation fails.
APP-3.2Exhibit two honest readings of the same decision, same data, explicit bounds, that produce incompatible verdicts no further reading, uncertainty analysis or residual vote can resolve, and the geometry does not bind. Honest disagreement under uncertainty does not fire this.
APP-3.3Produce a class of decisions the geometry is silent on at every resolution, and the coverage is partial.
APP-3.4Exhibit a capture or a systematic error the five commitments cannot identify or correct, and the protocol needs more.
APP-3.5Show the underdetermined residual is so wide that the geometry’s contribution to most decisions is negligible, and the claim is weak.
Every switch above is filed, with its status, in the registry. The registry writes them KS-APP3.1 to KS-APP3.5. What a kill switch is: Where It Would Die, on the wall.
This is the short edition of Ø Applications — a summary. Where a step is compressed here, the original carries it in full. The original book (PDF) · This edition (PDF)
The same page on the420code.org: the420code.org/models/applications/03-the-architecture-of-governance/