Probably Approximately Correct String Theory: A Verification Discipline for the Landscape

The string landscape contains ~10^500 vacua, so 'unified string theory' is two conflated problems — verification and selection. We build a verification discipline for the first: a probably-approximately-correct certificate, a proof that search over the flux superpotential is not evolvable (Denef-Douglas uniformity + Valiant's contrapositive), a measured log-uniform prior for |W_0|, a certified Mitchell Verification Deficit, and a boundary map of the four senses in which the problem is uncomputable. The field currently has no verification layer for its unverifiable theory; this is one.