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 350 research declarations. Search 10,000 more complete Mathlib declarations.
350 results
Clear filtersCedar.Thm.wf_εnv_implies_attrs_wf
Plain-language statement
SymEnv being well-formed implies that any attribute function is well-formed
Source project: Cedar Specification
Person-level attribution pending.
CellRefExample.demoImpl_writesOnly
Plain-language statement
The handler writes only the cells declared by demoWrites.
Source project: VCVio
Person-level attribution pending.
CollisionResistance.bindingAdvantage_toCommitment_le_keyedCRAdvantage
Plain-language statement
Binding ≤ keyed-CR (standard model): for any binding adversary A against the hash-based commitment scheme H.toCommitment, the binding advantage is bounded by the keyed-CR advantage of H against the natural reduction adversary bindingAdv_toCRAdv A. A binding-game win has m₁ ≠ m₂ together with both openings verifying: `H k (m₁, s₁) = c = H k (...
Source project: VCVio
Person-level attribution pending.
CollisionResistance.romCRAdvantage_le_birthday
Plain-language statement
ROM Collision Resistance birthday bound: for any t-query ROM-CR adversary A over a hash range Y, the advantage is bounded by (t+2) * (t+1) / (2 * |Y|) (a vacuous bound when |Y| = 0). The two extra queries account for the experiment's verification queries, which share the adversary's cache.
Source project: VCVio
Person-level attribution pending.
compile_binaryApp_wf_types
Plain-language statement
Similar to compileApp₂_wf_types, but for compile
Source project: Cedar Specification
Person-level attribution pending.
compile_ok_implies_compile_well_typed_binaryApp
Project documentation
Since we have the nice lemma compileApp₂_wf_types, it's enough to prove that compile of a binaryApp succeeds.
Source project: Cedar Specification
Person-level attribution pending.