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

1 topic

573 results

Clear filters
Project-declaredLean 4.31.0

To Shape seq Compose

CWSSStructure.toShape_seqCompose

Plain-language statement

The shape induced by finite sequential CWSS data is the generic sequential composition of the component shapes.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Decrypt uses At Most One Query

decrypt_usesAtMostOneQuery

Plain-language statement

T-transform decryption makes at most one hash-oracle query under unit-cost instrumentation.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Dlog Success sq le cdh Success dlog To CDHReduction

DiffieHellman.dlogSuccess_sq_le_cdhSuccess_dlogToCDHReduction

Plain-language statement

Concrete form of the hardness implication CDH ⇒ DLog: if a DLog adversary succeeds with probability p, the induced CDH adversary succeeds with probability at least p^2.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Prob Output ddh Exp Rand cdh To DDHReduction eq uniform Scalar

DiffieHellman.probOutput_ddhExpRand_cdhToDDHReduction_eq_uniformScalar

Plain-language statement

In the random DDH game, the CDH-to-DDH reduction only matches the target with the uniform baseline probability. The bijectivity assumption identifies scalar samples with uniformly sampled group elements in the subgroup generated by g.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Dist interleaved code to code lb

dist_interleaved_code_to_code_lb

Plain-language statement

Lemma 4.3, [AHIV22] (row-span lower bound). If the interleaved word U⋆ is more than e far from the interleaved code L^⋈κ, then the row-span of U⋆ contains a word more than e far from L. The additional field-size assumption |F| > e is needed: for small fields one can have a linear subspace of F^ι consisting entirely of e-sparse vector...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record