Source-pinned research

Research proof index

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 1 research declarations. Search 10,000 more complete Mathlib declarations.

1 topic
Project-declaredLean 4.32.0

Negligible polynomial mul

negligible_polynomial_mul

Project documentation

If f is negligible, then fun n => ↑(p.eval n) * f n is negligible for any polynomial p. This is the key lemma for handling polynomial-loss security reductions.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record