Skip to main content

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 2,569 curated research declarations and 119,070 complete package declarations. Search 10,000 more complete Mathlib declarations.

All topics

Showing 1,459 to 1,464 of 2,569 results.

Project-declaredLean 4.31.0

Sum choose K

JohnsonBound.sum_choose_K'

Mathematical statement

Jensen's inequality applied to choose_2 for nonzero coordinates.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Sum hamming weight sum

JohnsonBound.sum_hamming_weight_sum

Mathematical statement

Sum of Hamming weights equals n · |B| minus total zero-coordinate counts.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Sum of not equals

JohnsonBound.sum_of_not_equals

Mathematical statement

Counting pairs that disagree at position i in terms of choose_2.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Sum sum K i eq n sub d

JohnsonBound.sum_sum_K_i_eq_n_sub_d

Mathematical statement

Total choose_2 over all coordinates equals choose_2(|B|) · (n - d).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

IND CPA Game eq IND CCA Game to IND CCA

KEMScheme.IND_CPA_Game_eq_IND_CCA_Game_toIND_CCA

Mathematical statement

The one-stage IND-CPA game is exactly the IND-CCA game instantiated with the trivial CPA-to-CCA embedding (toIND_CCA) that never uses the decryption oracle.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Ind cpa one time bias advantage compose with dem le

KEMScheme.ind_cpa_one_time_bias_advantage_compose_with_dem_le

Mathematical statement

Proof-ladders A1 reduction statement: the one-time IND-CPA advantage of textbook KEM+DEM is bounded by two KEM IND-CPA advantages plus one DEM IND-CPA advantage, using the canonical left/right and DEM reductions defined above. The runtime coherence hypotheses require runtime.evalDist to be a monad morphism (preserves pure and distributes >>=) and to...

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record