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.

All topics

423 results

Clear filters
Project-declaredLean 4.31.0

Right Prefix concat

ProtocolSpec.ChallengeTree.rightPrefix_concat

Plain-language statement

rightPrefix commutes with extending the right prefix by one round. The rightPrefix/Fin.snoc dites are split by split_ifs; contradictory combinations close by omega (with idx's bound), matching ones by cast_eq_cast_of_heq (stripping casts to a base HEq, then rfl/index omega).

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Right Prefix leaf eq append

ProtocolSpec.ChallengeTree.rightPrefix_leaf_eq_append

Plain-language statement

At the right boundary (pre₂ is a full right transcript) the embedding is literally tr₁ ++ₜ.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Right Proj tree is Structured

ProtocolSpec.ChallengeTree.RightProj.tree_isStructured

Plain-language statement

If the appended source tree of a RightProj is structured then so is its right-protocol tree.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Split Data fst is Structured

ProtocolSpec.ChallengeTree.SplitData.fst_isStructured

Plain-language statement

If the appended source tree of a SplitData is structured then so is its first-stage tree.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Split Data snd At is Structured

ProtocolSpec.ChallengeTree.SplitData.sndAt_isStructured

Plain-language statement

The suffix tree selected by any first-stage path of a structured SplitData is structured.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Lift Context process Round

Prover.liftContext_processRound

Plain-language statement

Lifting the prover intertwines with the process round function

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record