Security Certificate Studio

Start from lane D's examples and the failure states

• Wiesner W1 · n = 73MVW2012 Theorem 1 at the smallest n with (3/4)^n ≤ 1e-9.
• S-money S2 · Kent Fig. 5 hypotheticalAll four axes with a hypothetical β = 6e-6 tuple (θ = 10°, E = 0.058).
• S-money S2 · Kent experimental tupleThe paper's measured biases violate Theorem 1's domain (f ≤ 0): no unforgeability bound.
• Schiansky D1 · published tupleReproduces p_d = 5.9e-45 (SI Eq. 22). The checker never certifies D1.
• S2 with Schiansky photon calibrationMeasured QBER from a different experiment family: rejected, not transferred.
• D1 with Schiansky photon calibrationSame family: the measured D/A QBER interval enters e_h; still never certified.
• W1 with 2 % honest-error tolerance(3/4)^n is a zero-tolerance theorem; tolerating errors is game W2, which has no bound.
• W1 with a privacy targetNo privacy theorem exists for Wiesner money: the axis has no bound (never 0).
• Noisy Wiesner W2No published closed form; SDP support only (P-W2).