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

Choose s conflict tau

KZG.CommitmentScheme.choose_s_conflict_tau

Plain-language statement

The trapdoor τ is not in the conflict-branch support set.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Choose s middle card

KZG.CommitmentScheme.choose_s_middle_card

Plain-language statement

chooseSMiddle returns a support set of size n + 1.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Conflict query ne tau

KZG.CommitmentScheme.conflict_query_ne_tau

Plain-language statement

A genuine evaluation conflict cannot occur at the hidden trapdoor point.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Correctness

KZG.CommitmentScheme.correctness

Plain-language statement

The KZG scheme satisfies perfect correctness as defined in CommitmentScheme.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Div by monic zs to poly eq nodal erase

KZG.CommitmentScheme.div_by_monic_zs_to_poly_eq_nodal_erase

Plain-language statement

Dividing the vanishing product by one node gives the erased nodal polynomial.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Filter map conflict length

KZG.CommitmentScheme.filter_map_conflict_length

Plain-language statement

The conflict-branch candidate list contains at least n usable elements.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record