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

1 topic

12 results

Clear filters
Project-declaredLean 4.31.0

To Shape append

CWSSStructure.toShape_append

Plain-language statement

The shape induced by appended CWSS data is the generic append of the component shapes.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
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.31.0

Append Split full Transcripts append of mem

ProtocolSpec.ChallengeTree.appendSplit_fullTranscripts_append_of_mem

Plain-language statement

Recombining a first-stage path with a suffix leaf gives a leaf transcript of the appended tree.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
Project-declaredLean 4.31.0

Left Prefix concat

ProtocolSpec.ChallengeTree.leftPrefix_concat

Plain-language statement

leftPrefix commutes with extending the prefix by one round.

cryptographyproof systemscoding theory

Source project: ArkLib

Person-level attribution pending.

View proof record
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