Source-pinned research
Search theorem names, mathematical ideas, modules, topics, projects, and role-labelled researchers. Open a result for its complete indexed Lean declaration and source record.
This index contains 2 research declarations. Search 10,000 more complete Mathlib declarations.
2 results
Clear filtersSignatureAlg.le_probOutput_bind_of_forall_support
Plain-language statement
If every value x in the support of gen satisfies Pr[= a | f x] ā„ 1 - Ī“, then the overall probability satisfies Pr[= a | gen >>= f] ā„ 1 - Ī“. This reduces a "for all keys" completeness statement to per-key bounds.
Source project: VCVio
Person-level attribution pending.
SignatureAlg.unforgeableAdv.advantage_le_unforgeableExpNoFresh
Plain-language statement
Phase B (freshness-drop) bound. The CMA advantage is bounded above by the success probability of the same experiment with the freshness check dropped. Both unforgeableExp and unforgeableExpNoFresh factor as runtime.evalDist (joint >>= ...) sharing the same prefix joint. The hypothesis h_pull packages the runtime-specific factoring step that...
Source project: VCVio
Person-level attribution pending.