The Twelve Claims
Each claim is stated, its chapter identified, and its falsification condition specified. A reader who finds a counterexample to any claim has refuted that portion of the framework and should say so.
C1. Tempo and Legitimacy (Chapter 0: The Crisis)
When decision tempo exceeds participation tempo, legitimacy collapses unless contestability is mechanized.
Type: Architectural. Falsification: Identify a class of coercive decisions operating faster than contemporaneous human deliberation that remains meaningfully contestable without a mechanized record or equivalent procedure. Context: The crisis begins when consequential computational acts outrun the procedures that make them answerable. An account freeze that executes in milliseconds and offers an appeal that resolves in months has satisfied the formal requirements of governance while violating the substantive ones. The claim asserts that this temporal asymmetry is not a design flaw but a structural condition that can only be addressed by embedding contestability in the protocol itself.
C2. Convergent Witnessing (Chapter 1: The Weight of the Word)
Binding, conditions, stakes, recourse, and composition form a recurring witness pattern across the selected institutions. The recurrence supports, but does not prove, necessity.
Type: Historical. Falsification: Identify a durable large-scale coordination system lacking one of the five or show that the categories have been imposed on unlike institutions so loosely that the convergence disappears. Context: Mesopotamian sealings, Roman tablets, bills of exchange, and fair institutions combine documentary form, attribution, consequences, recourse, and transfer in different ways. Legal cultures also borrowed from one another. The evidence therefore supports recurrence under varied institutions, not pristine independent invention.
C3. The Trust Tax (Chapter 2: The Trust Tax)
An intermediary's premium can combine a real coherence fee with an extractable trust tax. Cheaper verification can shrink the tax without eliminating composition cost or institutional rent.
Type: Interpretive. Falsification: Show, in the proposed domains, that the distinction does not identify separable coordination work and position-derived rent, or that reducing verification cost predictably leaves the alleged rent unchanged for reasons the framework cannot explain. Context: The distinction is a diagnostic lens, not a universal accounting identity. The research program's old coherence-fee measure failed as a predictor of execution failure and survives only as a scoped disclosure or omission measure.
C4. Compositional Failure (Chapter 3: The Witness Protocol)
A system that passes its specified bilateral checks can still fail at multilateral composition. In the chosen formal model, compatibility on overlaps is the gluing requirement and certain obstructions are computable.
Type: Formal. Falsification: Produce a counterexample to the stated formal result under its exact hypotheses, or show that the institutional identification used in an application does not satisfy those hypotheses. Formal substantiation: Bridge Paper (Appendix D).
C5. Factor Prime (Chapter 6: The Selection Gradient)
Energy structured through computation and disciplined by selection is the emerging factor of production. Within a defined domain, holding the named counterforces roughly constant, verification cost should predict automation order better than cognitive difficulty alone.
Type: Conjectural. The first sentence is an interpretive frame; the V/C ratio is a proposed automation-sequence heuristic. Falsification (of the empirical sentence): Holding the named counterforces roughly constant, show persistent within-domain inversions in which lower-V/C tasks automate before higher-V/C tasks, or show that cognitive difficulty predicts the order better than verification cost. Context: The V/C ratio (the value a completed task delivers relative to the cost of verifying it was completed correctly) is a proposed sequencing heuristic, not a determinant. Within a defined domain, and holding liability, regulation, integration cost, data rights, sunk capital, error detectability, and the other named counterforces roughly constant, tasks with high value and low verification cost should attract automation earlier than comparably difficult tasks whose outputs are expensive to check. Persistent inversions under those conditions count against the hypothesis; an uncontrolled comparison across different domains does not settle it.
C6. Bifurcation (Chapter 7: The Bifurcated Economy)
As selected transaction costs fall, firm boundaries may move and power may concentrate at the interfaces between machine-speed coordination and human institutions.
Type: Conjectural. The claim is an architectural forecast. Falsification: In domains where the identified transaction costs fall, show that firm boundaries do not move in the predicted direction and that interface power does not concentrate, or show that the named counterforces reliably prevent those outcomes.
C7. Domination Without a Dominator (Chapter 10: The Kind Master Problem)
Domination without a dominator is a structural condition, not a metaphor. Local compliance does not imply global accountability.
Type: Interpretive. Falsification: Show that a system composed of individually compliant components cannot produce emergent interference that constitutes domination. Context: The Kind Master Problem identifies a form of domination that the republican tradition did not anticipate: a system in which no individual actor intends harm, each component follows its rules, and the aggregate behavior nevertheless constitutes arbitrary interference in the lives of those subject to the system. The dominator is structural, not personal, and the absence of a personal dominator makes the domination harder to identify, harder to contest, and harder to remedy.
C8. The Receipt Minimum (Chapter 11: The Receipt Regime)
A system may coerce only via a receipt whose fields — Act, Authority, Bounds, Justification, Appeal Path — are minimally sufficient for contestation. No receipt, no legitimacy.
Type: Normative. Falsification: Show that a system that coerces without receipts can maintain legitimacy at civilizational scale.
C9. Predictable Failure (Chapter 12: Three Ways Receipts Fail)
The proposal identifies three recurring failure classes — semantic deception, structural capture, and procedural obstruction — and specifies controls that can be tested against them.
Type: Architectural. Falsification: Show a recurring failure that does not reduce to the three classes, or show that capture persists through the controls specified for them.
C10. Credible Exit (Chapter 14: Fork Rights)
Contestability requires credible exit. Without fork rights, receipts become petitions.
Type: Normative. Falsification: Show that contestability can be maintained under conditions where exit is not credible.
C11. Quiet Foreclosure (Chapter 10: The Kind Master Problem)
Quiet foreclosure — the elimination of alternatives through process rather than force — is a candidate dominant form of computational coercion.
Type: Empirical. Falsification: Show that the forecast does not describe consequential computational markets, or that alternatives remain broadly available at tolerable switching cost despite the predicted foreclosure mechanisms.
C12. The Mercy Threshold (Chapter 17: The Price of Perfect Memory)
Without temporal limits, accurate records can compose into durable exclusion. The Mercy Threshold is the point at which a true record must cease to determine a person's future by default.
Type: Architectural. Falsification: Show that a receipted system without designed forgetting produces no pathology of permanent exclusion. Context: The receipt regime that makes power legible also produces durable records about persons. Designed forgetting — expiration, sealing, aggregation limits, separation, amnesty — limits those records' jurisdiction. The proposal assigns final coercive judgment to an answerable human institution; it does not depend on a claim that algorithms can never assist mercy or review.