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

1 topic

3 results

Clear filters
Project-declaredLean 4.32.0

Get Putative Root is Total Query Bound

InductiveMerkleTree.getPutativeRoot_isTotalQueryBound

Plain-language statement

getPutativeRoot makes one oracle query per level of idx, so it has total query bound idx.depth.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Is Query Bound P iff counting filter le

OracleComp.isQueryBoundP_iff_counting_filter_le

Plain-language statement

Predicate-targeted analogue of isTotalQueryBound_iff_counting_total_le: a counting-oracle filtered-sum bound characterizes the structural IsQueryBoundP bound.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

Is Query Bound P counting bounded

OracleComp.IsQueryBoundP.counting_bounded

Plain-language statement

Soundness: any path of the counting-oracle simulation of a p-bounded computation has sum of per-index counts over p-indices at most n.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record