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

1 topic

423 results

Clear filters
Project-declaredLean 4.31.0

Inner relation of verified

ArkLib.Lattices.Ajtai.InnerOuter.WeakBinding.inner_relation_of_verified

Plain-language statement

Verified weak blocks with equal flattened inner decomps give a valid inner relation.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Outer relation of verified

ArkLib.Lattices.Ajtai.InnerOuter.WeakBinding.outer_relation_of_verified

Plain-language statement

Verified weak openings with different flattened witnesses give a valid outer relation.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Output To Module SIS valid

ArkLib.Lattices.Ajtai.InnerOuter.WeakBinding.outputToModuleSIS_valid

Plain-language statement

A successful pair of weak openings yields a valid inner or outer Module-SIS witness (over 𝓜(q, α)). The boolean-verification wrapper around outputToModuleSIS_valid_of_verified: it extracts the VerifiedOpening facts from verify_weak and applies the core.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Output To Module SIS valid of verified

ArkLib.Lattices.Ajtai.InnerOuter.WeakBinding.outputToModuleSIS_valid_of_verified

Plain-language statement

Extractor validity (the reusable core). Two verified weak openings that differ yield a valid inner or outer Module-SIS witness (over 𝓜(q, α)). This is stated directly on the extracted VerifiedOpening facts, independent of how those facts were obtained , so it is reused both by the weak-binding bound below (where the VerifiedOpenings come fr...

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Sample advantage le module SIS

ArkLib.Lattices.Ajtai.InnerOuter.WeakBinding.sample_advantage_le_moduleSIS

Plain-language statement

Pointwise weak-binding to Module-SIS bound for fixed samples (over 𝓜(q, α)).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Verified Opening of verify eq true

ArkLib.Lattices.Ajtai.InnerOuter.WeakBinding.verifiedOpening_of_verify_eq_true

Plain-language statement

Extract reusable weak-opening facts from a successful verification (over 𝓜(q, α), where Lyubashevsky–Seiler invertibility applies).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record