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

Relative Unique Decoding Radius RS eq

ReedSolomon.relativeUniqueDecodingRadius_RS_eq

Plain-language statement

Relative unique decoding radius for RS code with arbitrary finite index type ι.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

To Polynomial mem lt deg

ReedSolomon.toPolynomial_mem_lt_deg

Plain-language statement

The polynomials corresponding to Reed-Solomon codewords are of degree smaller than deg.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Instantiate assoc

ResourceProfile.instantiate_assoc

Plain-language statement

Instantiating symbolic capabilities is associative. Substituting impl₁ into a profile c, and then substituting impl₂ into the resulting profile, is the same as substituting the composite implementation fun k ↦ (impl₁ k).instantiate impl₂ into c directly.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Core Interaction perfect Completeness

RingSwitching.SumcheckPhase.coreInteraction_perfectCompleteness

Plain-language statement

Perfect completeness for large-field reduction (Sumcheck ++ FinalSum)

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Generalised round consistency completeness

RoundConsistency.generalised_round_consistency_completeness

Plain-language statement

Completeness of the round consistency check. Given a polynomial f, challenge γ, and n-th roots of unity ω, when f is honestly evaluated at the scaled points {ω i * s₀}, the round consistency check succeeds with the value (foldNth n f γ).eval (s₀^n). This establishes that the Lagrange interpolant through the evaluation points matches the n-wa...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Run Obs lift Comp

runObs_liftComp

Plain-language statement

runObs on a lifted base-spec computation: the trace is 1 (monoid identity).

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record