Research proof index

Three-way disagreement-aware additive bind bound (hop A). A coupled three-world variant of probEvent_bind_le_add_of_disagree: the three worlds share the sampling computation mx, and at each shared sample x, off the disagreement set D the my-world is bounded by the oc-world plus the per-step slack ε, while on D the ob-world (the bad w...

Prefix-event split for a bind. Prefix points satisfying p are charged in full; off-prefix continuations are charged by the uniform tail bound ε.

Convex prefix-event split for a bind. The off-prefix tail bound ε is charged only on the mass outside p, giving Pr[p] + (1 - Pr[p]) * ε.

First-moment / Markov bound (support-restricted cost). Variant of probEvent_le_tsum_probOutput_mul_cost whose c ≥ 1 hypothesis need only hold on the support of mx.

The stateful-responder probability bridge: running an adversary against the responder built from a StateT σ ProbComp handler (ofStateQueryImpl impl) is exactly the evaluation distribution of running it against impl itself , the responder's SPMF program-run is 𝒟 of the ProbComp program-run, jointly in the returned value and the final sta...

Recombining a first-stage path with a suffix leaf gives a leaf transcript of the appended tree.