All proofs
Project-declaredLean 4.32.0 · mathlib@81a5d257

Get Putative Batch Root With Hash unique

InductiveMerkleTree.getPutativeBatchRootWithHash_unique

Plain-language statement

Batch opening uniqueness. When hashFn is injective, two batch openings for the same selector that produce the same putative root must agree on both the claimed selected values and the entire pruned authentication data.

Exact Lean statement

theorem getPutativeBatchRootWithHash_unique
    (hashFn : α → α → α) (hinj : Function.Injective2 hashFn)
    {s : Skeleton} {sel : LeafData Bool s}
    (v₁ v₂ : SelectedValues α sel) (p₁ p₂ : BatchProof α sel)
    (heq : getPutativeBatchRootWithHash hashFn v₁ p₁
         = getPutativeBatchRootWithHash hashFn v₂ p₂) :
    v₁ = v₂ ∧ p₁ = p₂

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
theorem getPutativeBatchRootWithHash_unique    (hashFn : α  α  α) (hinj : Function.Injective2 hashFn)    {s : Skeleton} {sel : LeafData Bool s}    (v₁ v₂ : SelectedValues α sel) (p₁ p₂ : BatchProof α sel)    (heq : getPutativeBatchRootWithHash hashFn v₁ p₁         = getPutativeBatchRootWithHash hashFn v₂ p₂) :    v₁ = v₂  p₁ = p₂ := by  induction p₁ with  | leaf =>    cases p₂ with    | leaf => exact heq, rfl  | internalBoth pl₁ pr₁ ihl ihr =>    cases p₂ with    | internalBoth pl₂ pr₂ =>      simp only [getPutativeBatchRootWithHash] at heq      obtain hL, hR := hinj heq      obtain hvl, hpl := ihl v₁.1 v₂.1 pl₂ hL      obtain hvr, hpr := ihr v₁.2 v₂.2 pr₂ hR      exact Prod.ext hvl hvr, by rw [hpl, hpr]    | pruneRight hr₂ rightRoot₂ pl₂ =>      exact absurd (BatchProof.anySelected_of_batchProof pr₁) (by simp [hr₂])    | pruneLeft hl₂ leftRoot₂ pr₂ =>      exact absurd (BatchProof.anySelected_of_batchProof pl₁) (by simp [hl₂])  | pruneRight hr₁ rightRoot₁ pl₁ ih =>    cases p₂ with    | internalBoth pl₂ pr₂ =>      exact absurd (BatchProof.anySelected_of_batchProof pr₂) (by simp [hr₁])    | pruneRight hr₂ rightRoot₂ pl₂ =>      simp only [getPutativeBatchRootWithHash] at heq      obtain hL, hRoot := hinj heq      obtain hvl, hpl := ih v₁.1 v₂.1 pl₂ hL      refine Prod.ext hvl (selectedValues_eq_of_not_anySelected hr₁ v₁.2 v₂.2), ?_      rw [hpl, hRoot]    | pruneLeft hl₂ leftRoot₂ pr₂ =>      exact absurd (BatchProof.anySelected_of_batchProof pr₂) (by simp [hr₁])  | pruneLeft hl₁ leftRoot₁ pr₁ ih =>    cases p₂ with    | internalBoth pl₂ pr₂ =>      exact absurd (BatchProof.anySelected_of_batchProof pl₂) (by simp [hl₁])    | pruneRight hr₂ rightRoot₂ pl₂ =>      exact absurd (BatchProof.anySelected_of_batchProof pl₂) (by simp [hl₁])    | pruneLeft hl₂ leftRoot₂ pr₂ =>      simp only [getPutativeBatchRootWithHash] at heq      obtain hRoot, hR := hinj heq      obtain hvr, hpr := ih v₁.2 v₂.2 pr₂ hR      refine Prod.ext (selectedValues_eq_of_not_anySelected hl₁ v₁.1 v₂.1) hvr, ?_      rw [hpr, hRoot]
Project
VCVio
License
Apache-2.0
Commit
2ceb2d825ee3
Source
VCVio/CryptoFoundations/MerkleTree/Inductive/Batch/Uniqueness.lean:75-121

Reuse this declaration

Bring the exact result into your workflow

The import identifies the source module. Your project still needs the pinned package dependency shown on this page.

What this badge means

This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.

Continue in this project

Related declarations

Project-declaredLean 4.32.0

Expected Cost Nat eq sum tail probs of pathwise Cost At Most

AddWriterT.expectedCostNat_eq_sum_tail_probs_of_pathwiseCostAtMost

Plain-language statement

Finite tail-sum formula for natural-valued writer cost under a pathwise upper bound. If every execution path of oa incurs cost at most n, then the tail probabilities vanish above n, so the infinite tail sum truncates to Finset.range n.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record
Project-declaredLean 4.32.0

IND CPA advantage to Real le sum step signed Advantage Real abs

AsymmEncAlg.IND_CPA_advantage_toReal_le_sum_step_signedAdvantageReal_abs

Plain-language statement

Planned generic one-time-to-many-time lift: bounded multi-query IND-CPA advantage is at most the sum of the extracted one-time signed advantages over the first q fresh LR queries.

program verificationseparation logiccryptography

Source project: VCVio

Person-level attribution pending.

View proof record