The Proven-Model Requirement
Decision Accounting

The Proven-Model Requirement: Existence Proofs, Selection Bias, and Falsification in the Intractability Taxonomy

objection
Problem

The paper answers the survivorship objection to SAPM proven models

Critics say the taxonomy cherry-picks Australia on firearms, Portugal on drugs, the Nordic model on trafficking, Estonia on data governance, and Brazil on cash transfers while ignoring failures. The paper narrows the claim before defending it.

core
Logical claim

One implemented reform is enough to reject institutional impossibility

The proven-model requirement says a reform lies inside the feasible set if a real polity implemented it and achieved measured superior outcomes. It does not claim the model is optimal, universal, or transferable without adaptation.

boundary
Taxonomy boundary

Intractability requires a proven model; Impossibility cannot have one

The requirement applies only where the binding constraint is institutional, political, or economic. It does not apply where the constraint is physical, chemical, biological, or nuclear.

bias
Selection bias

The denominator must be reported, but it does not erase feasibility

The paper accepts the denominator problem and makes it part of the method. Each domain must identify the success case, attempted comparable reforms, failures, and causal reasons for failure.

causality
Failure types

Technical failures threaten classification; implementation and capture failures fit the diagnosis

The paper’s key move is to classify why reforms failed. A failure caused by the design producing worse outcomes is different from a failure caused by blocked implementation or capture by affected interests.

scale
Scale confound

The answer to Nordic exceptionalism is a large or heterogeneous case per reform pattern

The paper does not deny that small, high-trust societies create transfer risk. It requires the taxonomy to supply larger or more heterogeneous proven cases wherever they exist.

transfer
Transfer risk

Small-state proofs still refute impossibility, but they must be labeled honestly

The paper classifies proven models by scale and heterogeneity so a feasibility claim is not misread as a transfer guarantee.

falsify
Falsification

An Intractability domain fails if every attempted reform failed for technical reasons

The paper gives the requirement a domain-level falsification test. A domain should move toward Impossibility, or lose its theorem, if no country or program anywhere has achieved the claimed outcome.

protocol
Protocol

Every proven-model entry must make the search reproducible

The documentation protocol converts 'zero counterexamples' from a bare count into a recorded search result. The program must show where it looked and what it found.

example
Worked case

Australia’s firearms reform is the paper’s complete protocol example

The example uses the 1996 National Firearms Agreement to show what a domain entry should contain: mechanism, outcomes, failure denominator, failure causes, and transfer risk.

theorem
Theorem

The Proven-Model Theorem links existence, feasibility, and classification

The formal theorem depends on four axioms: domain classification, feasibility, falsification, and search obligation. Its conclusion is narrow: a measured success case proves institutional feasibility and rejects impossibility.

canon
Canon fit

The requirement turns the General Game-Change Conjecture into a search procedure

The paper connects the method to the SAPM canon by making the zero-counterexamples claim auditable. Success shows the trap is not physical; repeated political failures support the fiscal-capture diagnosis.