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

1 topic

169 results

Clear filters
Project-declaredLean 4.32.0

Simulate Q link With run

QueryImpl.Stateful.simulateQ_linkWith_run

Plain-language statement

Structural form of linked simulation through an explicit state frame.

program verificationseparation logiccryptography

Source project: VCVio

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.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
Project-declaredLean 4.32.0

Eval Dist lift Comp generate Seed bind simulate Q run' take At Index

seededOracle.evalDist_liftComp_generateSeed_bind_simulateQ_run'_takeAtIndex

Plain-language statement

Truncating the seed at oracle i₀ to only the first k entries does not change the distribution when averaging over seeds from generateSeed.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Le prob Output bind of forall support

SignatureAlg.le_probOutput_bind_of_forall_support

Plain-language statement

If every value x in the support of gen satisfies Pr[= a | f x] ≥ 1 - δ, then the overall probability satisfies Pr[= a | gen >>= f] ≥ 1 - δ. This reduces a "for all keys" completeness statement to per-key bounds.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Unforgeable Adv advantage le unforgeable Exp No Fresh

SignatureAlg.unforgeableAdv.advantage_le_unforgeableExpNoFresh

Plain-language statement

Phase B (freshness-drop) bound. The CMA advantage is bounded above by the success probability of the same experiment with the freshness check dropped. Both unforgeableExp and unforgeableExpNoFresh factor as runtime.evalDist (joint >>= ...) sharing the same prefix joint. The hypothesis h_pull packages the runtime-specific factoring step that...

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record