task_id stringlengths 21 23 | challenge_id stringlengths 16 16 | proof_assistant stringclasses 1
value | session stringclasses 1
value | repo stringclasses 57
values | revision stringclasses 57
values | file_path stringlengths 13 92 | theory stringlengths 1 48 | variant int64 0 132 | challenge_type stringclasses 1
value | difficulty null | count null | by_centrality bool 1
class | ablation_prob float64 0.5 0.5 | min_depth int64 1 1 | max_depth int64 1 1 | leaves_only bool 1
class | min_size int64 0 0 | max_size stringclasses 1
value | min_centrality int64 0 0 | max_centrality stringclasses 1
value | seed int64 42 42 | n_proofs int64 1 173 | n_ablated int64 1 60 | holes_filled listlengths 1 60 | deleted_lemmas listlengths 1 1 | corollaries listlengths 1 1 | closure_size int64 1 172 | challenge_file_content stringlengths 133 350k | solution_file_content stringlengths 394 351k | solution_diff stringlengths 243 134k | manifest dict |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
ablate_2e66f40b211a_7 | c3de6eac7193ed0c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/Iter.lean | Iter | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "isQueryBoundP_replicateTR_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [replicateTR_eq_replicate]; exact isQueryBoundP_replicate_iff hn",
"n_chars": 73,
"n_subproofs": 0... | [
{
"name": "isQueryBoundP_replicate_iff",
"text": "theorem isQueryBoundP_replicate_iff [Finite ι] [IsUniformSpec spec]\n {oa : OracleComp spec α} {p : ι → Prop} [DecidablePred p] {n k : ℕ} (hn : 0 < n) :\n IsQueryBoundP (oa.replicate n) p (n * k) ↔ IsQueryBoundP oa p k := by\n letI : DecidableEq ι := ... | [
{
"name": "isQueryBoundP_replicateTR_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 370,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 4 | /-
Copyright (c) 2026 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.Constructions.Replicate
/-!
# Query Bounds for Iteration Constructs
This file lifts the structural ... | /-
Copyright (c) 2026 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.Constructions.Replicate
/-!
# Query Bounds for Iteration Constructs
This file lifts the structural ... | @@ -93,9 +93,24 @@
· funext i; simp
· funext i; simp [Pi.add_apply, add_mul, add_comm]
+theorem isQueryBoundP_replicate_iff [Finite ι] [IsUniformSpec spec]
+ {oa : OracleComp spec α} {p : ι → Prop} [DecidablePred p] {n k : ℕ} (hn : 0 < n) :
+ IsQueryBoundP (oa.replicate n) p (n * k) ↔ IsQueryBou... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_2e66f40b211a_8 | af96eef3a9864b89 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/Iter.lean | Iter | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "isTotalQueryBound_listMapM_const",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have := isTotalQueryBound_listMapM h xs\n rwa [show (xs.map fun _ => k).sum = xs.length * k by\n rw [L... | [
{
"name": "isTotalQueryBound_listMapM",
"text": "lemma isTotalQueryBound_listMapM\n {f : α → OracleComp spec β} {k : α → ℕ}\n (h : ∀ x, IsTotalQueryBound (f x) (k x)) (xs : List α) :\n IsTotalQueryBound (xs.mapM f) ((xs.map k).sum) := by\n induction xs with\n | nil => simpa [List.mapM_nil] using\... | [
{
"name": "isTotalQueryBound_listMapM_const",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 366,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,... | 1 | /-
Copyright (c) 2026 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.Constructions.Replicate
/-!
# Query Bounds for Iteration Constructs
This file lifts the structural ... | /-
Copyright (c) 2026 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.Constructions.Replicate
/-!
# Query Bounds for Iteration Constructs
This file lifts the structural ... | @@ -35,10 +35,28 @@
/-! ### Forward `replicate` bounds -/
+lemma isTotalQueryBound_listMapM
+ {f : α → OracleComp spec β} {k : α → ℕ}
+ (h : ∀ x, IsTotalQueryBound (f x) (k x)) (xs : List α) :
+ IsTotalQueryBound (xs.mapM f) ((xs.map k).sum) := by
+ induction xs with
+ | nil => simpa [List.mapM_nil] usi... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_2e66f40b211a_9 | a54566a9ce4e9868 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/Iter.lean | Iter | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "isQueryBoundP_listMapM_const",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have := isQueryBoundP_listMapM h xs\n rwa [show (xs.map fun _ => k).sum = xs.length * k by\n rw [List.map_... | [
{
"name": "isQueryBoundP_listMapM",
"text": "lemma isQueryBoundP_listMapM\n {f : α → OracleComp spec β} {p : ι → Prop} [DecidablePred p] {k : α → ℕ}\n (h : ∀ x, IsQueryBoundP (f x) p (k x)) (xs : List α) :\n IsQueryBoundP (xs.mapM f) p ((xs.map k).sum) := by\n induction xs with\n | nil => simp [L... | [
{
"name": "isQueryBoundP_listMapM_const",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 390,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
Copyright (c) 2026 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.Constructions.Replicate
/-!
# Query Bounds for Iteration Constructs
This file lifts the structural ... | /-
Copyright (c) 2026 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.Constructions.Replicate
/-!
# Query Bounds for Iteration Constructs
This file lifts the structural ... | @@ -35,10 +35,24 @@
/-! ### Forward `replicate` bounds -/
+lemma isQueryBoundP_listMapM
+ {f : α → OracleComp spec β} {p : ι → Prop} [DecidablePred p] {k : α → ℕ}
+ (h : ∀ x, IsQueryBoundP (f x) p (k x)) (xs : List α) :
+ IsQueryBoundP (xs.mapM f) p ((xs.map k).sum) := by
+ induction xs with
+ | nil => ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_2e66f40b211a_10 | 778915adca1e2595 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/Iter.lean | Iter | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "isPerIndexQueryBound_listMapM_const",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have := isPerIndexQueryBound_listMapM h xs\n rwa [show (xs.map fun _ => qb).sum = xs.length • qb by\n ... | [
{
"name": "isPerIndexQueryBound_listMapM",
"text": "lemma isPerIndexQueryBound_listMapM [DecidableEq ι]\n {f : α → OracleComp spec β} {qb : α → ι → ℕ}\n (h : ∀ x, IsPerIndexQueryBound (f x) (qb x)) (xs : List α) :\n IsPerIndexQueryBound (xs.mapM f) ((xs.map qb).sum) := by\n induction xs with\n | ... | [
{
"name": "isPerIndexQueryBound_listMapM_const",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 398,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": fal... | 1 | /-
Copyright (c) 2026 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.Constructions.Replicate
/-!
# Query Bounds for Iteration Constructs
This file lifts the structural ... | /-
Copyright (c) 2026 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.Constructions.Replicate
/-!
# Query Bounds for Iteration Constructs
This file lifts the structural ... | @@ -35,10 +35,24 @@
/-! ### Forward `replicate` bounds -/
+lemma isPerIndexQueryBound_listMapM [DecidableEq ι]
+ {f : α → OracleComp spec β} {qb : α → ι → ℕ}
+ (h : ∀ x, IsPerIndexQueryBound (f x) (qb x)) (xs : List α) :
+ IsPerIndexQueryBound (xs.mapM f) ((xs.map qb).sum) := by
+ induction xs with
+ | ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_7e268c5c39bd_0 | 20f7d5c84a154f7f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/ProbabilityTheory/FinRatPMF.lean | FinRatPMF | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "probOfList_eq_zero_of_not_mem_supportOfList",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [supportOfList, List.mem_toFinset, List.mem_map, List.mem_filter] at hx\n unfold pr... | [
{
"name": "sum_eq_zero_of_forall_eq_zero",
"text": "private lemma sum_eq_zero_of_forall_eq_zero (l : List ℚ≥0)\n (h : ∀ q ∈ l, q = 0) : l.sum = 0 := by\n induction l with\n | nil => simp\n | cons q qs ih =>\n simp [h q (by simp), ih (by\n intro r hr\n exact h r (by simp [hr]))]\n\n",
... | [
{
"name": "probOfList_eq_zero_of_not_mem_supportOfList",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 603,
"n_subproofs": 2,
"n_tactics": 12,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 1,
"n_structural": 5,
"automation_... | 1 | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | @@ -65,6 +65,15 @@
def supportOfList [DecidableEq α] (l : List (α × ℚ≥0)) : Finset α :=
(l.filter (fun a => a.2 ≠ 0)).map Prod.fst |>.toFinset
+private lemma sum_eq_zero_of_forall_eq_zero (l : List ℚ≥0)
+ (h : ∀ q ∈ l, q = 0) : l.sum = 0 := by
+ induction l with
+ | nil => simp
+ | cons q qs ih =>
+ simp... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_7e268c5c39bd_1 | 392e6f7c7cb0cc33 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/ProbabilityTheory/FinRatPMF.lean | FinRatPMF | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 2 | [
{
"theorem_name": "list_sum_prob_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction l with\n | nil => simp\n | cons hd tl ih =>\n simp only [List.map_cons, List.toFinset_cons, List.sum_cons]... | [
{
"name": "filter_cons_sum",
"text": "private lemma filter_cons_sum [DecidableEq α] (hd : α × ℚ≥0) (tl : List (α × ℚ≥0)) (x : α) :\n ((hd :: tl).filter (fun a => a.1 = x) |>.map Prod.snd).sum =\n (if hd.1 = x then hd.2 else 0) +\n (tl.filter (fun a => a.1 = x) |>.map Prod.snd).sum := by\n simp onl... | [
{
"name": "list_sum_prob_eq",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 16,
"n_chars": 599,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": false,
"max_nest... | 2 | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | @@ -269,6 +269,13 @@
x ∈ p.support ↔ p.prob x ≠ 0 := by
simpa [prob, support] using mem_supportOfList_iff p.toList x
+private lemma filter_cons_sum [DecidableEq α] (hd : α × ℚ≥0) (tl : List (α × ℚ≥0)) (x : α) :
+ ((hd :: tl).filter (fun a => a.1 = x) |>.map Prod.snd).sum =
+ (if hd.1 = x then hd.2 else ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_7e268c5c39bd_2 | 96061319b801dc36 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/ProbabilityTheory/FinRatPMF.lean | FinRatPMF | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "prob_uniformList_of_nodup",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have htoList :\n (Raw.uniformList l hl).toList = l.map fun a => (a, ((l.length : ℚ≥0)⁻¹)) := by\n simp [... | [
{
"name": "probOfList_map_const_eq_length_filter",
"text": "private lemma probOfList_map_const_eq_length_filter [DecidableEq α]\n (l : List α) (w : ℚ≥0) (x : α) :\n probOfList (l.map fun a => (a, w)) x = ((l.filter fun a => a = x).length : ℚ≥0) * w := by\n induction l with\n | nil => simp [probOfLis... | [
{
"name": "prob_uniformList_of_nodup",
"fan_in": 3,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 21,
"n_chars": 798,
"n_subproofs": 2,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 4,
"automation_only": false,
... | 2 | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | @@ -337,6 +337,27 @@
simp [mem_support_iff]
· simp [mem_support_iff, prob_pure, h]
+private lemma probOfList_map_const_eq_length_filter [DecidableEq α]
+ (l : List α) (w : ℚ≥0) (x : α) :
+ probOfList (l.map fun a => (a, w)) x = ((l.filter fun a => a = x).length : ℚ≥0) * w := by
+ induction l with
+ | ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_7e268c5c39bd_3 | 6cce1f970aea7a9f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/ProbabilityTheory/FinRatPMF.lean | FinRatPMF | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "probOfList_eq_zero_of_not_mem_supportOfList",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [supportOfList, List.mem_toFinset, List.mem_map, List.mem_filter] at hx\n unfold pr... | [
{
"name": "sum_eq_zero_of_forall_eq_zero",
"text": "private lemma sum_eq_zero_of_forall_eq_zero (l : List ℚ≥0)\n (h : ∀ q ∈ l, q = 0) : l.sum = 0 := by\n induction l with\n | nil => simp\n | cons q qs ih =>\n simp [h q (by simp), ih (by\n intro r hr\n exact h r (by simp [hr]))]\n\n",
... | [
{
"name": "prob_le_one",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 8,
"n_chars": 303,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_nesting": 6... | 4 | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | @@ -65,6 +65,15 @@
def supportOfList [DecidableEq α] (l : List (α × ℚ≥0)) : Finset α :=
(l.filter (fun a => a.2 ≠ 0)).map Prod.fst |>.toFinset
+private lemma sum_eq_zero_of_forall_eq_zero (l : List ℚ≥0)
+ (h : ∀ q ∈ l, q = 0) : l.sum = 0 := by
+ induction l with
+ | nil => simp
+ | cons q qs ih =>
+ simp... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_7e268c5c39bd_4 | cff112ec2b4c7e52 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/ProbabilityTheory/FinRatPMF.lean | FinRatPMF | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "probOfList_map_mul",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold probOfList\n rw [filter_map_mul_eq]\n rw [List.map_map]\n simp only [Function.comp_def]\n simpa using List.su... | [
{
"name": "filter_map_mul_eq",
"text": "private lemma filter_map_mul_eq [DecidableEq α] (l : List (α × ℚ≥0)) (p : ℚ≥0) (x : α) :\n (l.map (fun (a, q) => (a, p * q))).filter (fun a => a.1 = x) =\n (l.filter (fun a => a.1 = x)).map (fun (a, q) => (a, p * q)) := by\n induction l with\n | nil => simp\... | [
{
"name": "probOfList_map_mul",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 361,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
"max_nest... | 1 | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | @@ -467,8 +467,21 @@
unfold probOfList
rw [List.filter_append, List.map_append, List.sum_append]
+private lemma filter_map_mul_eq [DecidableEq α] (l : List (α × ℚ≥0)) (p : ℚ≥0) (x : α) :
+ (l.map (fun (a, q) => (a, p * q))).filter (fun a => a.1 = x) =
+ (l.filter (fun a => a.1 = x)).map (fun (a, q) => (... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_7e268c5c39bd_5 | 70de4b513189cee1 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/ProbabilityTheory/FinRatPMF.lean | FinRatPMF | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "probOfList_bind_eq_sum",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction l with\n | nil => simp [probOfList]\n | cons hd tl ih =>\n rw [List.flatMap_cons, probOfList_append, ... | [
{
"name": "probOfList_append",
"text": "private lemma probOfList_append [DecidableEq α] (l₁ l₂ : List (α × ℚ≥0)) (x : α) :\n probOfList (l₁ ++ l₂) x = probOfList l₁ x + probOfList l₂ x := by\n unfold probOfList\n rw [List.filter_append, List.map_append, List.sum_append]\n\n",
"fan_in": 1,
"n_li... | [
{
"name": "probOfList_bind_eq_sum",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 11,
"n_chars": 436,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max... | 3 | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | @@ -462,6 +462,11 @@
unfold Raw.bernoulli Raw.prob probOfList Raw.toList
simp
+private lemma probOfList_append [DecidableEq α] (l₁ l₂ : List (α × ℚ≥0)) (x : α) :
+ probOfList (l₁ ++ l₂) x = probOfList l₁ x + probOfList l₂ x := by
+ unfold probOfList
+ rw [List.filter_append, List.map_append, List.sum_appen... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_7e268c5c39bd_6 | 9c1b0c2b45149f41 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/ProbabilityTheory/FinRatPMF.lean | FinRatPMF | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "getD_accumulateWeights_eq_prob",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold accumulateWeights\n rw [← Array.foldl_toList (f := addWeight) (init := ({} : Std.HashMap α ℚ≥0)) (xs... | [
{
"name": "getD_foldl_addWeight_eq_probOfList",
"text": "private lemma getD_foldl_addWeight_eq_probOfList [DecidableEq α] [BEq α] [Hashable α]\n [LawfulBEq α] [LawfulHashable α] (l : List (α × ℚ≥0)) (m : Std.HashMap α ℚ≥0) (x : α) :\n (l.foldl addWeight m).getD x 0 = m.getD x 0 + probOfList l x := by\... | [
{
"name": "getD_accumulateWeights_eq_prob",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 448,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | @@ -588,9 +588,28 @@
Std.HashMap α ℚ≥0 :=
xs.foldl addWeight {}
+private lemma getD_foldl_addWeight_eq_probOfList [DecidableEq α] [BEq α] [Hashable α]
+ [LawfulBEq α] [LawfulHashable α] (l : List (α × ℚ≥0)) (m : Std.HashMap α ℚ≥0) (x : α) :
+ (l.foldl addWeight m).getD x 0 = m.getD x 0 + probOfList l x ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_7e268c5c39bd_7 | 1801b003a6918c04 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/ProbabilityTheory/FinRatPMF.lean | FinRatPMF | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "probOfList_toList_eq_getD",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [probOfList_eq_find?_getD m.toList x (pairwise_ne_keys_toList m),\n Std.HashMap.getD_eq_getD_getElem?]\n ... | [
{
"name": "pairwise_ne_keys_toList",
"text": "private lemma pairwise_ne_keys_toList [BEq α] [Hashable α] [LawfulBEq α] [LawfulHashable α]\n (m : Std.HashMap α ℚ≥0) :\n m.toList.Pairwise (fun a b => a.1 ≠ b.1) := by\n refine (Std.HashMap.distinct_keys_toList (m := m)).imp ?_\n intro a b hab hEq\n si... | [
{
"name": "probOfList_toList_eq_getD",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 24,
"n_chars": 1030,
"n_subproofs": 5,
"n_tactics": 20,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
... | 2 | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | @@ -611,6 +611,13 @@
rw [← Array.foldl_toList (f := addWeight) (init := ({} : Std.HashMap α ℚ≥0)) (xs := xs)]
simpa using getD_foldl_addWeight_eq_probOfList xs.toList ({} : Std.HashMap α ℚ≥0) x
+private lemma pairwise_ne_keys_toList [BEq α] [Hashable α] [LawfulBEq α] [LawfulHashable α]
+ (m : Std.HashMap α ℚ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_7e268c5c39bd_8 | 80789e256aa00b72 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/ProbabilityTheory/FinRatPMF.lean | FinRatPMF | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "probOfList_eq_zero_of_not_mem_supportOfList",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [supportOfList, List.mem_toFinset, List.mem_map, List.mem_filter] at hx\n unfold pr... | [
{
"name": "sum_eq_zero_of_forall_eq_zero",
"text": "private lemma sum_eq_zero_of_forall_eq_zero (l : List ℚ≥0)\n (h : ∀ q ∈ l, q = 0) : l.sum = 0 := by\n induction l with\n | nil => simp\n | cons q qs ih =>\n simp [h q (by simp), ih (by\n intro r hr\n exact h r (by simp [hr]))]\n\n",
... | [
{
"name": "SameDist.map_congr",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 19,
"n_lines": 7,
"n_chars": 232,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nest... | 13 | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | @@ -65,6 +65,15 @@
def supportOfList [DecidableEq α] (l : List (α × ℚ≥0)) : Finset α :=
(l.filter (fun a => a.2 ≠ 0)).map Prod.fst |>.toFinset
+private lemma sum_eq_zero_of_forall_eq_zero (l : List ℚ≥0)
+ (h : ∀ q ∈ l, q = 0) : l.sum = 0 := by
+ induction l with
+ | nil => simp
+ | cons q qs ih =>
+ simp... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_7e268c5c39bd_9 | e7611b1e00c8efd2 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/ProbabilityTheory/FinRatPMF.lean | FinRatPMF | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "getD_accumulateWeights_eq_prob",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold accumulateWeights\n rw [← Array.foldl_toList (f := addWeight) (init := ({} : Std.HashMap α ℚ≥0)) (xs... | [
{
"name": "getD_foldl_addWeight_eq_probOfList",
"text": "private lemma getD_foldl_addWeight_eq_probOfList [DecidableEq α] [BEq α] [Hashable α]\n [LawfulBEq α] [LawfulHashable α] (l : List (α × ℚ≥0)) (m : Std.HashMap α ℚ≥0) (x : α) :\n (l.foldl addWeight m).getD x 0 = m.getD x 0 + probOfList l x := by\... | [
{
"name": "sameDist_normalize",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 8,
"n_chars": 311,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nest... | 5 | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | @@ -588,9 +588,28 @@
Std.HashMap α ℚ≥0 :=
xs.foldl addWeight {}
+private lemma getD_foldl_addWeight_eq_probOfList [DecidableEq α] [BEq α] [Hashable α]
+ [LawfulBEq α] [LawfulHashable α] (l : List (α × ℚ≥0)) (m : Std.HashMap α ℚ≥0) (x : α) :
+ (l.foldl addWeight m).getD x 0 = m.getD x 0 + probOfList l x ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_7e268c5c39bd_10 | 1afac0d0aee8db22 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/ProbabilityTheory/FinRatPMF.lean | FinRatPMF | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "getD_accumulateWeights_eq_prob",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold accumulateWeights\n rw [← Array.foldl_toList (f := addWeight) (init := ({} : Std.HashMap α ℚ≥0)) (xs... | [
{
"name": "getD_foldl_addWeight_eq_probOfList",
"text": "private lemma getD_foldl_addWeight_eq_probOfList [DecidableEq α] [BEq α] [Hashable α]\n [LawfulBEq α] [LawfulHashable α] (l : List (α × ℚ≥0)) (m : Std.HashMap α ℚ≥0) (x : α) :\n (l.foldl addWeight m).getD x 0 = m.getD x 0 + probOfList l x := by\... | [
{
"name": "sameDist_normalize_normalize",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 8,
"n_chars": 361,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 5 | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | @@ -588,9 +588,28 @@
Std.HashMap α ℚ≥0 :=
xs.foldl addWeight {}
+private lemma getD_foldl_addWeight_eq_probOfList [DecidableEq α] [BEq α] [Hashable α]
+ [LawfulBEq α] [LawfulHashable α] (l : List (α × ℚ≥0)) (m : Std.HashMap α ℚ≥0) (x : α) :
+ (l.foldl addWeight m).getD x 0 = m.getD x 0 + probOfList l x ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_7e268c5c39bd_11 | 64a77d3b02626c6c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/ProbabilityTheory/FinRatPMF.lean | FinRatPMF | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "mem_supportOfList_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · intro hx\n rcases List.mem_toFinset.1 hx with hx\n rcases List.mem_map.1 hx with ⟨a, ha, hax⟩... | [
{
"name": "probOfList_ne_zero_of_mem",
"text": "private lemma probOfList_ne_zero_of_mem [DecidableEq α] {l : List (α × ℚ≥0)} {x : α} {q : ℚ≥0}\n (hmem : (x, q) ∈ l) (hq : q ≠ 0) : probOfList l x ≠ 0 := by\n have hqmem : q ∈ (l.filter (fun a => a.1 = x)).map Prod.snd := by\n apply List.mem_map.2\n ... | [
{
"name": "bind_mk",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 21,
"n_lines": 12,
"n_chars": 461,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 6,
"automation_only": false,
"max_nesting": 6
... | 14 | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | @@ -74,6 +74,17 @@
intro r hr
exact h r (by simp [hr]))]
+private lemma probOfList_ne_zero_of_mem [DecidableEq α] {l : List (α × ℚ≥0)} {x : α} {q : ℚ≥0}
+ (hmem : (x, q) ∈ l) (hq : q ≠ 0) : probOfList l x ≠ 0 := by
+ have hqmem : q ∈ (l.filter (fun a => a.1 = x)).map Prod.snd := by
+ apply List.m... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_7e268c5c39bd_12 | 9c8d5aecdaf4e28b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/ProbabilityTheory/FinRatPMF.lean | FinRatPMF | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "mem_supportOfList_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · intro hx\n rcases List.mem_toFinset.1 hx with hx\n rcases List.mem_map.1 hx with ⟨a, ha, hax⟩... | [
{
"name": "probOfList_ne_zero_of_mem",
"text": "private lemma probOfList_ne_zero_of_mem [DecidableEq α] {l : List (α × ℚ≥0)} {x : α} {q : ℚ≥0}\n (hmem : (x, q) ∈ l) (hq : q ≠ 0) : probOfList l x ≠ 0 := by\n have hqmem : q ∈ (l.filter (fun a => a.1 = x)).map Prod.snd := by\n apply List.mem_map.2\n ... | [
{
"name": "out_bind_sameDist",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 21,
"n_lines": 8,
"n_chars": 293,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nest... | 14 | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import Mathlib.Probability.Distributions.Uniform
public import Mathlib.Data.DFinsupp.BigO... | @@ -74,6 +74,17 @@
intro r hr
exact h r (by simp [hr]))]
+private lemma probOfList_ne_zero_of_mem [DecidableEq α] {l : List (α × ℚ≥0)} {x : α} {q : ℚ≥0}
+ (hmem : (x, q) ∈ l) (hq : q ≠ 0) : probOfList l x ≠ 0 := by
+ have hqmem : q ∈ (l.filter (fun a => a.1 = x)).map Prod.snd := by
+ apply List.m... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6731d263d4a9_0 | 2e21a11c1193b184 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/Stateful/Compatibility.lean | Compatibility | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "postKeygenAdv_runState_eq_postKeygenAdvBase_run",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold QueryImpl.Stateful.runState postKeygenAdv postKeygenAdvBase\n postKeygenCandidat... | [
{
"name": "simulateQ_cmaReal_liftM_fsRo_eq_sourceCma",
"text": "/-- The Fiat-Shamir public random-oracle interface has the same real-CMA\nsemantics whether it is embedded directly into the named CMA interface or first\nthrough the source-CMA interface. -/\nprivate lemma simulateQ_cmaReal_liftM_fsRo_eq_sourc... | [
{
"name": "postKeygenAdv_runState_eq_postKeygenAdvBase_run",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 22,
"n_chars": 1185,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 1,
"automa... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | @@ -102,6 +102,23 @@
intro t
rcases t with (n | mc) | m <;> exact simulateQ_spec_query (cmaReal M Commit Chal σ hr) _
+/-- The Fiat-Shamir public random-oracle interface has the same real-CMA
+semantics whether it is embedded directly into the named CMA interface or first
+through the source-CMA interface. -/
+... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6731d263d4a9_1 | 860745455d813007 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/Stateful/Compatibility.lean | Compatibility | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "statefulCmaFreshAdvantage_eq_statefulPostKeygenFreshAdvantage",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold statefulCmaFreshAdvantage statefulCmaFreshExperiment\n statefulPos... | [
{
"name": "postKeygenAdv_runState_eq_postKeygenAdvBase_run",
"text": "/-- Fixed-key `postKeygenAdv` over the named CMA interface is the source\npost-keygen computation interpreted by the full-state source handler. -/\nprivate lemma postKeygenAdv_runState_eq_postKeygenAdvBase_run\n (adv : SourceAdv (σ := ... | [
{
"name": "statefulCmaFreshAdvantage_eq_statefulPostKeygenFreshAdvantage",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 21,
"n_chars": 994,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 1... | 3 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | @@ -119,12 +119,44 @@
rw [liftM_bind, liftM_bind, simulateQ_bind, simulateQ_bind]
cases t <;> exact bind_congr ih
+/-- Fixed-key `postKeygenAdv` over the named CMA interface is the source
+post-keygen computation interpreted by the full-state source handler. -/
+private lemma postKeygenAdv_runState_eq_p... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6731d263d4a9_2 | 05eae5e0f0564c56 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/Stateful/Compatibility.lean | Compatibility | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "postKeygenAppendImpl_run_eq_cmaRealSourceFullSum_run",
"depth": 1,
"n_commands": 0,
"n_lines": 37,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let impl := postKeygenAppendImpl (σ := σ) (hr := hr) (M := M)\n (Commit := Commit)... | [
{
"name": "postKeygenAppendProdImpl_eq_flattenStateT",
"text": "private lemma postKeygenAppendProdImpl_eq_flattenStateT\n (pk : Stmt) (sk : Wit) :\n postKeygenAppendProdImpl (σ := σ) (hr := hr) (M := M)\n (Commit := Commit) (Chal := Chal) (Resp := Resp) pk sk =\n (postKeygenAppendImpl (σ :... | [
{
"name": "postKeygenAppendImpl_run_eq_cmaRealSourceFullSum_run",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 47,
"n_chars": 2668,
"n_subproofs": 2,
"n_tactics": 37,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 1,
"a... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | @@ -219,6 +219,30 @@
cases hcache : cache (m, c) <;>
simp [fs_simp, uniformSampleImpl, StateT.run_modifyGet, monad_norm]
+private lemma postKeygenAppendProdImpl_eq_flattenStateT
+ (pk : Stmt) (sk : Wit) :
+ postKeygenAppendProdImpl (σ := σ) (hr := hr) (M := M)
+ (Commit := Commit) (Chal :... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6731d263d4a9_3 | ab0b4094b070befb | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/Stateful/Compatibility.lean | Compatibility | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "postKeygenFreshAppendProb_eq_statefulPostKeygenFreshProb",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold postKeygenFreshAppendProb postKeygenFreshProb\n simp only [FiatShamir, Ha... | [
{
"name": "postKeygenAppendImpl_run_eq_cmaRealSourceFullSum_run",
"text": "private lemma postKeygenAppendImpl_run_eq_cmaRealSourceFullSum_run {α : Type}\n (oa : SourceCmaComp (M := M) (Commit := Commit) (Chal := Chal) (Resp := Resp) α)\n (pk : Stmt) (sk : Wit) (signed : List M) (cache : RoCache M Comm... | [
{
"name": "postKeygenFreshAppendProb_eq_statefulPostKeygenFreshProb",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 24,
"n_chars": 1452,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 3,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 2,
... | 3 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | @@ -273,13 +273,74 @@
pk msg sig
pure (!decide (msg ∈ signed) && verified)).run' (∅ : RoCache M Commit Chal)
+private lemma postKeygenAppendImpl_run_eq_cmaRealSourceFullSum_run {α : Type}
+ (oa : SourceCmaComp (M := M) (Commit := Commit) (Chal := Chal) (Resp := Resp) α)
+ (pk : Stmt) (sk :... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6731d263d4a9_4 | 6b1bbf92d71da609 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/Stateful/Compatibility.lean | Compatibility | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "cmaRealLoggedProdImpl_liftAdv_run",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa using congrArg (fun x => x.run st)\n (QueryImpl.simulateQ_liftM_eq_of_query\n (impl := cma... | [
{
"name": "cmaRealLoggedProdImpl_lift_query_eq_cmaRealAppendProdImpl",
"text": "private lemma cmaRealLoggedProdImpl_lift_query_eq_cmaRealAppendProdImpl\n (t : (SourceCmaSpec (M := M) (Commit := Commit) (Chal := Chal)\n (Resp := Resp)).Domain) :\n simulateQ (cmaRealLoggedProdImpl (σ := σ) (hr := h... | [
{
"name": "cmaRealLoggedProdImpl_liftAdv_run",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 1078,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": tr... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | @@ -260,6 +260,54 @@
(cmaSignLogImpl (M := M) (Commit := Commit) (Chal := Chal)
(Resp := Resp) (Stmt := Stmt))).flattenStateT
+private lemma cmaRealLoggedProdImpl_lift_query_eq_cmaRealAppendProdImpl
+ (t : (SourceCmaSpec (M := M) (Commit := Commit) (Chal := Chal)
+ (Resp := Resp)).Domain) :
+ s... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6731d263d4a9_5 | 4cc3428038dda853 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/Stateful/Compatibility.lean | Compatibility | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "cmaReal_cmaSignLog_liftM_run_eq_cmaRealSourceFullSum_run",
"depth": 1,
"n_commands": 0,
"n_lines": 35,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let st : CmaState M Commit Chal Stmt Wit := ((signed, cache, some (pk, sk)), fals... | [
{
"name": "cmaRealLoggedProdImpl_liftAdv_run",
"text": "private lemma cmaRealLoggedProdImpl_liftAdv_run {α : Type}\n (oa : SourceCmaComp (M := M) (Commit := Commit) (Chal := Chal)\n (Resp := Resp) α)\n (st : List M × CmaState M Commit Chal Stmt Wit) :\n (simulateQ (cmaRealLoggedProdImpl (σ := ... | [
{
"name": "cmaReal_cmaSignLog_liftM_run_eq_cmaRealSourceFullSum_run",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 52,
"n_chars": 2820,
"n_subproofs": 2,
"n_tactics": 35,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 0,
... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | @@ -308,6 +308,25 @@
simp [fs_simp, QueryImpl.extendStateLeft, QueryImpl.mapStateTBase,
QueryImpl.flattenStateT, StateT.run_bind, monad_norm]
+private lemma cmaRealLoggedProdImpl_liftAdv_run {α : Type}
+ (oa : SourceCmaComp (M := M) (Commit := Commit) (Chal := Chal)
+ (Resp := Resp) α)
+ (st : ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6731d263d4a9_6 | cfc698328d942561 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/Stateful/Compatibility.lean | Compatibility | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 3 | [
{
"theorem_name": "postKeygenFreshAppendProb_eq_statefulPostKeygenFreshProb",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold postKeygenFreshAppendProb postKeygenFreshProb\n simp only [FiatShamir, Ha... | [
{
"name": "cmaRealSourceFullSum_lift_ro_query_run",
"text": "private lemma cmaRealSourceFullSum_lift_ro_query_run\n (mc : M × Commit) (s : CmaState M Commit Chal Stmt Wit) :\n (simulateQ (cmaRealSourceFullSum M Commit Chal σ hr)\n (liftM (liftM ((roSpec M Commit Chal).query mc) :\n OracleC... | [
{
"name": "fiatShamirVerify_run_eq_cmaRealSourceFullSum_run_signedFresh_cache_some",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 27,
"n_chars": 1814,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_str... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | @@ -135,6 +135,19 @@
(s : CmaState M Commit Chal Stmt Wit) : Prop :=
s.1.2.2 = some (pk, sk) ∧ s.2 = false
+private lemma cmaRealSourceFullSum_lift_ro_query_run
+ (mc : M × Commit) (s : CmaState M Commit Chal Stmt Wit) :
+ (simulateQ (cmaRealSourceFullSum M Commit Chal σ hr)
+ (liftM (liftM ((roSpe... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6731d263d4a9_7 | d6cda97083a97a4c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/Stateful/Compatibility.lean | Compatibility | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 3 | [
{
"theorem_name": "postKeygenFreshAppendProb_eq_statefulPostKeygenFreshProb",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold postKeygenFreshAppendProb postKeygenFreshProb\n simp only [FiatShamir, Ha... | [
{
"name": "cmaRealSourceFullSum_lift_ro_query_run",
"text": "private lemma cmaRealSourceFullSum_lift_ro_query_run\n (mc : M × Commit) (s : CmaState M Commit Chal Stmt Wit) :\n (simulateQ (cmaRealSourceFullSum M Commit Chal σ hr)\n (liftM (liftM ((roSpec M Commit Chal).query mc) :\n OracleC... | [
{
"name": "fiatShamirVerify_run_eq_cmaRealSourceFullSum_run_signedFresh_cache_none",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 26,
"n_chars": 1814,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 3,
"n_str... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | @@ -135,6 +135,19 @@
(s : CmaState M Commit Chal Stmt Wit) : Prop :=
s.1.2.2 = some (pk, sk) ∧ s.2 = false
+private lemma cmaRealSourceFullSum_lift_ro_query_run
+ (mc : M × Commit) (s : CmaState M Commit Chal Stmt Wit) :
+ (simulateQ (cmaRealSourceFullSum M Commit Chal σ hr)
+ (liftM (liftM ((roSpe... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6731d263d4a9_8 | a82f22142ddedd44 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/Stateful/Compatibility.lean | Compatibility | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "statefulPostKeygenFreshAdvantage_eq_cmaRealRunProb_signedFreshAdv",
"depth": 1,
"n_commands": 0,
"n_lines": 49,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold statefulPostKeygenFreshAdvantage\n have hpost :\n ((hr.gen ... | [
{
"name": "cmaReal_cmaSignLog_liftM_run_eq_cmaRealSourceFullSum_run",
"text": "private lemma cmaReal_cmaSignLog_liftM_run_eq_cmaRealSourceFullSum_run\n {α : Type} (oa : SourceCmaComp (M := M) (Commit := Commit) (Chal := Chal)\n (Resp := Resp) α)\n (pk : Stmt) (sk : Wit) (signed : List M) (cache :... | [
{
"name": "statefulPostKeygenFreshAdvantage_eq_cmaRealRunProb_signedFreshAdv",
"fan_in": 0,
"n_deps_direct": 6,
"n_deps_transitive": 10,
"n_lines": 57,
"n_chars": 3267,
"n_subproofs": 1,
"n_tactics": 49,
"cyclomatic": 3,
"n_automation": 5,
"n_rewrites": 5,
"n_structur... | 10 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | @@ -482,6 +482,57 @@
refine bind_congr (m := ProbComp) fun ⟨c, prv⟩ => ?_
cases hcache : cache (m, c) <;> simp [fs_simp, monad_norm]
+private lemma cmaReal_cmaSignLog_liftM_run_eq_cmaRealSourceFullSum_run
+ {α : Type} (oa : SourceCmaComp (M := M) (Commit := Commit) (Chal := Chal)
+ (Resp... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6731d263d4a9_9 | a1cecc0d39c5a1e2 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/Stateful/Compatibility.lean | Compatibility | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "statefulPostKeygenFreshAdvantage_eq_cmaRealRunProb_signedFreshAdv",
"depth": 1,
"n_commands": 0,
"n_lines": 49,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold statefulPostKeygenFreshAdvantage\n have hpost :\n ((hr.gen ... | [
{
"name": "postKeygenFreshAppendProb_eq_statefulPostKeygenFreshProb",
"text": "private theorem postKeygenFreshAppendProb_eq_statefulPostKeygenFreshProb\n (adv : SourceAdv (σ := σ) (hr := hr) (M := M))\n (pk : Stmt) (sk : Wit) :\n postKeygenFreshAppendProb (σ := σ) (hr := hr) (M := M)\n (Commit... | [
{
"name": "postKeygenFreshWriterProb_eq_postKeygenFreshProb",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 62,
"n_chars": 3318,
"n_subproofs": 2,
"n_tactics": 55,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 0,
"autom... | 5 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | @@ -319,6 +319,29 @@
(fun z : α × (List M × RoCache M Commit Chal) => ((z.1, z.2.1), z.2.2)) <$> p)
hproj.symm
+private theorem postKeygenFreshAppendProb_eq_statefulPostKeygenFreshProb
+ (adv : SourceAdv (σ := σ) (hr := hr) (M := M))
+ (pk : Stmt) (sk : Wit) :
+ postKeygenFreshAppen... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6731d263d4a9_10 | 2d9f3397769f95ea | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/Stateful/Compatibility.lean | Compatibility | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "simulateQ_fsBaseImpl_postKeygenFreshWriterComp_run'_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 41,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold postKeygenFreshWriterComp postKeygenFreshWriterProb\n let baseW : QueryImpl... | [
{
"name": "fsBaseImpl_writerTMapBase_signingOracle_eq",
"text": "private lemma fsBaseImpl_writerTMapBase_signingOracle_eq\n (pk : Stmt) (sk : Wit) :\n let baseW : QueryImpl (unifSpec + roSpec M Commit Chal)\n (WriterT (QueryLog (signSpec M Commit Resp))\n (OracleComp (unifSpec + roSpec... | [
{
"name": "simulateQ_fsBaseImpl_postKeygenFreshWriterComp_run'_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 50,
"n_chars": 2732,
"n_subproofs": 1,
"n_tactics": 41,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 0,
... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | @@ -358,6 +358,42 @@
pk msg sig
pure (!decide (msg ∈ signed) && verified)).run' ∅
+private lemma fsBaseImpl_writerTMapBase_signingOracle_eq
+ (pk : Stmt) (sk : Wit) :
+ let baseW : QueryImpl (unifSpec + roSpec M Commit Chal)
+ (WriterT (QueryLog (signSpec M Commit Resp))
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6731d263d4a9_12 | 36fed0d5717c53bf | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/Stateful/Compatibility.lean | Compatibility | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "runtime_evalDist_postKeygenFreshWriterComp_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [_root_.FiatShamir.runtime_eq_runtimeWithCache_empty (M := M),\n runtimeWithCache_eval... | [
{
"name": "simulateQ_fsBaseImpl_postKeygenFreshWriterComp_run'_eq",
"text": "private theorem simulateQ_fsBaseImpl_postKeygenFreshWriterComp_run'_eq\n (adv : SourceAdv (σ := σ) (hr := hr) (M := M)) (pk : Stmt) (sk : Wit) :\n (simulateQ (fsBaseImpl (M := M) (Commit := Commit) (Chal := Chal))\n (p... | [
{
"name": "publicUnforgeableAdvantage_eq_statefulPostKeygenFreshAdvantage",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 10,
"n_lines": 30,
"n_chars": 1592,
"n_subproofs": 0,
"n_tactics": 24,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 5,
"n_structural"... | 10 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | @@ -601,13 +601,71 @@
QueryImpl.withLogging_apply, cmaRealFixedSign, SourceSigAlg, FiatShamir,
fsBaseImpl, randomOracle, StateT.run_bind, roSim.run_liftM]
+private theorem simulateQ_fsBaseImpl_postKeygenFreshWriterComp_run'_eq
+ (adv : SourceAdv (σ := σ) (hr := hr) (M := M)) (pk : Stmt) (sk : Wit) :
... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6731d263d4a9_13 | 24f4e73e488b7b85 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/Stateful/Compatibility.lean | Compatibility | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "runtime_evalDist_postKeygenFreshWriterComp_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [_root_.FiatShamir.runtime_eq_runtimeWithCache_empty (M := M),\n runtimeWithCache_eval... | [
{
"name": "simulateQ_fsBaseImpl_postKeygenFreshWriterComp_run'_eq",
"text": "private theorem simulateQ_fsBaseImpl_postKeygenFreshWriterComp_run'_eq\n (adv : SourceAdv (σ := σ) (hr := hr) (M := M)) (pk : Stmt) (sk : Wit) :\n (simulateQ (fsBaseImpl (M := M) (Commit := Commit) (Chal := Chal))\n (p... | [
{
"name": "publicCompatible",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 15,
"n_lines": 11,
"n_chars": 535,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_nest... | 15 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Stateful.Bridge
import VCVio.StateSeparating.Advantage
/-!
# Compatibility endpoints for the stateful Fiat-Shamir CMA proof
Th... | @@ -673,13 +673,71 @@
QueryImpl.withLogging_apply, cmaRealFixedSign, SourceSigAlg, FiatShamir,
fsBaseImpl, randomOracle, StateT.run_bind, roSim.run_liftM]
+private theorem simulateQ_fsBaseImpl_postKeygenFreshWriterComp_run'_eq
+ (adv : SourceAdv (σ := σ) (hr := hr) (M := M)) (pk : Stmt) (sk : Wit) :
... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_8cc5456bd1b9_2 | a03eca885afedd7e | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/PRFTagReader/PRFReductions/Structural.lean | Structural | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "probEvent_unlinkBad_bad_eq_one_of_bad",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [probEvent_eq_one_iff]\n exact ⟨by simp, fun z hz => simulateQ_unlinkBad_preserves_bad adv sB hba... | [
{
"name": "simulateQ_unlinkBad_preserves_bad",
"text": "/-- The `bad` flag of a full `simulateQ unlinkBadQueryImpl` run is monotone: started from a state\nwith `bad = true` the run keeps `bad = true`. Derived from the per-step monotonicity via the\ngeneric `OracleComp.simulateQ_run_preservesInv`. -/\nlemma ... | [
{
"name": "probEvent_unlinkBad_bad_eq_one_of_bad",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 11,
"n_chars": 605,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": ... | 5 | /-
Copyright (c) 2026 Oleksandr Vovkotrub. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oleksandr Vovkotrub
-/
import Examples.PRFTagReader.PRFReductions.IdealHandlers
/-!
# PRF Tag/Reader Protocol — Structural `query_bind` Reductions
Structural `query_bind`-decom... | /-
Copyright (c) 2026 Oleksandr Vovkotrub. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oleksandr Vovkotrub
-/
import Examples.PRFTagReader.PRFReductions.IdealHandlers
/-!
# PRF Tag/Reader Protocol — Structural `query_bind` Reductions
Structural `query_bind`-decom... | @@ -121,13 +121,30 @@
subst hz'; exact hbad
omit [Nonempty TagId] [NeZero sessionsPerTag] in
+/-- The `bad` flag of a full `simulateQ unlinkBadQueryImpl` run is monotone: started from a state
+with `bad = true` the run keeps `bad = true`. Derived from the per-step monotonicity via the
+generic `OracleComp.simul... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_9305ed00ad23_0 | 0c37dceee57cf66a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/CommitmentScheme/Hiding/CountBounds.lean | CountBounds | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 3 | [
{
"theorem_name": "hiding_distinguish_totalBound_of_choose_count_support",
"depth": 1,
"n_commands": 0,
"n_lines": 32,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n haveI : Fintype M := Fintype.ofFinite M\n have hres :\n IsTotalQueryBound\n ... | [
{
"name": "sum_counts_step_le_succ_hidingImplCountAll",
"text": "/-- One-step growth bound for the shared counted hiding implementation:\nthe total count increases by at most one. -/\nlemma sum_counts_step_le_succ_hidingImplCountAll [Fintype S] (ms : M × S)\n (st : QueryCache (CMOracle M S C) × (S → ℕ))\... | [
{
"name": "hiding_distinguish_totalBound_of_choose_count_support",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 39,
"n_chars": 1677,
"n_subproofs": 3,
"n_tactics": 31,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 1,
"... | 1 | /-
Copyright (c) 2026 James Waters. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: James Waters
-/
import Examples.CommitmentScheme.Hiding.Defs
/-!
# Count bounds for commitment-scheme hiding
-/
open OracleSpec OracleComp ENNReal
variable {M S C : Type}
[Decidable... | /-
Copyright (c) 2026 James Waters. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: James Waters
-/
import Examples.CommitmentScheme.Hiding.Defs
/-!
# Count bounds for commitment-scheme hiding
-/
open OracleSpec OracleComp ENNReal
variable {M S C : Type}
[Decidable... | @@ -17,6 +17,30 @@
attribute [local instance] Fintype.ofFinite
+/-- One-step growth bound for the shared counted hiding implementation:
+the total count increases by at most one. -/
+lemma sum_counts_step_le_succ_hidingImplCountAll [Fintype S] (ms : M × S)
+ (st : QueryCache (CMOracle M S C) × (S → ℕ))
+ (x ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_9305ed00ad23_4 | 782dd1b6823adf9a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/CommitmentScheme/Hiding/CountBounds.lean | CountBounds | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 2 | [
{
"theorem_name": "hidingCountInv_of_mem_support_run_hidingImplCountAll",
"depth": 1,
"n_commands": 0,
"n_lines": 28,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n suffices h : ∀ (β : Type) (ob : OracleComp (CMOracle M S C) β)\n (st : QueryCach... | [
{
"name": "hidingCountInv_step_hidingImplCountAll",
"text": "/-- The counted implementation preserves the hiding count invariant. -/\nlemma hidingCountInv_step_hidingImplCountAll (ms₀ : M × S)\n (st : QueryCache (CMOracle M S C) × (S → ℕ)) (hInv : HidingCountInv st)\n (x : C × (QueryCache (CMOracle M ... | [
{
"name": "hidingCountInv_of_mem_support_run_hidingImplCountAll",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 36,
"n_chars": 1464,
"n_subproofs": 3,
"n_tactics": 27,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 7,
"a... | 1 | /-
Copyright (c) 2026 James Waters. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: James Waters
-/
import Examples.CommitmentScheme.Hiding.Defs
/-!
# Count bounds for commitment-scheme hiding
-/
open OracleSpec OracleComp ENNReal
variable {M S C : Type}
[Decidable... | /-
Copyright (c) 2026 James Waters. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: James Waters
-/
import Examples.CommitmentScheme.Hiding.Defs
/-!
# Count bounds for commitment-scheme hiding
-/
open OracleSpec OracleComp ENNReal
variable {M S C : Type}
[Decidable... | @@ -22,6 +22,41 @@
∀ ms : M × S, ∀ u : C, st.1 ms = some u → 1 ≤ st.2 ms.2
omit [Finite C] [Inhabited C] in
+/-- The counted implementation preserves the hiding count invariant. -/
+lemma hidingCountInv_step_hidingImplCountAll (ms₀ : M × S)
+ (st : QueryCache (CMOracle M S C) × (S → ℕ)) (hInv : HidingCountInv ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_9305ed00ad23_5 | e03a3a1c670b268e | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/CommitmentScheme/Hiding/CountBounds.lean | CountBounds | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 2 | [
{
"theorem_name": "cache_none_of_zero_count_of_mem_support_run_hidingChoose",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hInv₀ : HidingCountInv ((∅ : QueryCache (CMOracle M S C)), fun _ : S => 0) :... | [
{
"name": "hidingCountInv_of_mem_support_run_hidingImplCountAll",
"text": "/-- Every cached salt has a positive counter along the support of the counted run. -/\nlemma hidingCountInv_of_mem_support_run_hidingImplCountAll {α : Type}\n (oa : OracleComp (CMOracle M S C) α)\n (st₀ : QueryCache (CMOracle M... | [
{
"name": "cache_none_of_zero_count_of_mem_support_run_hidingChoose",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 33,
"n_chars": 1170,
"n_subproofs": 3,
"n_tactics": 22,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 3,
... | 2 | /-
Copyright (c) 2026 James Waters. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: James Waters
-/
import Examples.CommitmentScheme.Hiding.Defs
/-!
# Count bounds for commitment-scheme hiding
-/
open OracleSpec OracleComp ENNReal
variable {M S C : Type}
[Decidable... | /-
Copyright (c) 2026 James Waters. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: James Waters
-/
import Examples.CommitmentScheme.Hiding.Defs
/-!
# Count bounds for commitment-scheme hiding
-/
open OracleSpec OracleComp ENNReal
variable {M S C : Type}
[Decidable... | @@ -57,6 +57,41 @@
exact le_trans h_old h_mono
omit [Finite C] [Inhabited C] in
+/-- Every cached salt has a positive counter along the support of the counted run. -/
+lemma hidingCountInv_of_mem_support_run_hidingImplCountAll {α : Type}
+ (oa : OracleComp (CMOracle M S C) α)
+ (st₀ : QueryCache (CMOr... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_9305ed00ad23_6 | 3fef70c70ee64846 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/CommitmentScheme/Hiding/CountBounds.lean | CountBounds | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 2 | [
{
"theorem_name": "fresh_step_state_of_mem_support_hidingImplCountAll",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hnone : qchoose.2.1 (qchoose.1.1, s) = none :=\n cache_none_of_zero_count_of_me... | [
{
"name": "cache_none_of_zero_count_of_mem_support_run_hidingChoose",
"text": "/-- On the support of the counted choose run, a zero salt-count means no cache entry\nat that salt can already exist. -/\nlemma cache_none_of_zero_count_of_mem_support_run_hidingChoose\n {AUX : Type} {t : ℕ}\n (A : HidingAd... | [
{
"name": "fresh_step_state_of_mem_support_hidingImplCountAll",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 25,
"n_chars": 1127,
"n_subproofs": 2,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 1,
"n_structural": 2,
"aut... | 3 | /-
Copyright (c) 2026 James Waters. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: James Waters
-/
import Examples.CommitmentScheme.Hiding.Defs
/-!
# Count bounds for commitment-scheme hiding
-/
open OracleSpec OracleComp ENNReal
variable {M S C : Type}
[Decidable... | /-
Copyright (c) 2026 James Waters. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: James Waters
-/
import Examples.CommitmentScheme.Hiding.Defs
/-!
# Count bounds for commitment-scheme hiding
-/
open OracleSpec OracleComp ENNReal
variable {M S C : Type}
[Decidable... | @@ -92,6 +92,38 @@
exact ih qu.1 qu.2 hInv' y hy'
omit [Finite C] [Inhabited C] in
+/-- On the support of the counted choose run, a zero salt-count means no cache entry
+at that salt can already exist. -/
+lemma cache_none_of_zero_count_of_mem_support_run_hidingChoose
+ {AUX : Type} {t : ℕ}
+ (A : Hidin... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_9305ed00ad23_10 | 6d96fe41bdd5d4eb | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/CommitmentScheme/Hiding/CountBounds.lean | CountBounds | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "exists_new_salt_cacheEntry_of_count_gt_one",
"depth": 1,
"n_commands": 0,
"n_lines": 74,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing cache₀ counts₀ z with\n | pure x =>\n ... | [
{
"name": "cache_le_of_mem_support_run_hidingImplCountAll",
"text": "lemma cache_le_of_mem_support_run_hidingImplCountAll\n {α : Type} (oa : OracleComp (CMOracle M S C) α)\n {st₀ : HidingCountState M S C}\n {z : α × HidingCountState M S C}\n (hz : z ∈ support ((simulateQ hidingImplCountAll oa).r... | [
{
"name": "exists_new_salt_cacheEntry_of_count_gt_one",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 85,
"n_chars": 3858,
"n_subproofs": 14,
"n_tactics": 73,
"cyclomatic": 6,
"n_automation": 12,
"n_rewrites": 8,
"n_structural": 20,
"automati... | 1 | /-
Copyright (c) 2026 James Waters. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: James Waters
-/
import Examples.CommitmentScheme.Hiding.Defs
/-!
# Count bounds for commitment-scheme hiding
-/
open OracleSpec OracleComp ENNReal
variable {M S C : Type}
[Decidable... | /-
Copyright (c) 2026 James Waters. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: James Waters
-/
import Examples.CommitmentScheme.Hiding.Defs
/-!
# Count bounds for commitment-scheme hiding
-/
open OracleSpec OracleComp ENNReal
variable {M S C : Type}
[Decidable... | @@ -28,6 +28,24 @@
QueryCache (CMOracle M S C) × (S → ℕ)
omit [Finite C] [Inhabited C] in
+lemma cache_le_of_mem_support_run_hidingImplCountAll
+ {α : Type} (oa : OracleComp (CMOracle M S C) α)
+ {st₀ : HidingCountState M S C}
+ {z : α × HidingCountState M S C}
+ (hz : z ∈ support ((simulateQ hidingIm... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_06599423c7f2_0 | 08d59bfaaa7640ce | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLDSA/Signature.lean | Signature | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "polyNorm_neg",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold polyNorm normOps\n simp only [LatticeCrypto.zmodPolyNormOps, LatticeCrypto.normOpsOfCenteredView]\n unfold LatticeCr... | [
{
"name": "neg_rq_get",
"text": "private lemma neg_rq_get (f : Rq) (i : Fin ringDegree) : (-f).get i = -(f.get i) := by\n change (coeffRing.neg f).get i = _\n simp [LatticeCrypto.vectorNegacyclicRing]\n\nomit nttOps in\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 184,
"n_subproofs": 0,
"n... | [
{
"name": "polyNorm_neg",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 476,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": false,
"max_nesting"... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Scheme
import LatticeCrypto.MLDSA.Encoding
/-!
# ML-DSA FIPS 204 Signature Algorithms
This file implements the faithful FIPS 204 signature algorith... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Scheme
import LatticeCrypto.MLDSA.Encoding
/-!
# ML-DSA FIPS 204 Signature Algorithms
This file implements the faithful FIPS 204 signature algorith... | @@ -130,8 +130,22 @@
/-! ### Vector Arithmetic Helpers -/
omit nttOps in
-private lemma polyNorm_neg (f : Rq) : polyNorm (-f) = polyNorm f := sorry
+private lemma neg_rq_get (f : Rq) (i : Fin ringDegree) : (-f).get i = -(f.get i) := by
+ change (coeffRing.neg f).get i = _
+ simp [LatticeCrypto.vectorNegacyclicRin... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_abfbf9cb7b18_0 | 53ab78c5f3329dbc | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Data/ENNReal/SumSquares.lean | SumSquares | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "sq_sum_le_card_mul_sum_sq",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sq, Finset.sum_mul_sum]\n suffices h : 2 * ∑ i ∈ s, ∑ j ∈ s, f i * f j ≤ 2 * (↑s.card * ∑ i ∈ s, f i ^ 2) b... | [
{
"name": "two_mul_le_add_sq",
"text": "lemma two_mul_le_add_sq (a b : ℝ≥0∞) :\n 2 * a * b ≤ a ^ 2 + b ^ 2 := by\n rcases eq_or_ne a ⊤ with rfl | ha\n · simp [top_pow, top_add, le_top]\n rcases eq_or_ne b ⊤ with rfl | hb\n · simp [top_pow, add_top, le_top]\n rw [← ENNReal.coe_toNNReal ha, ← ENNReal.... | [
{
"name": "sq_sum_le_card_mul_sum_sq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 29,
"n_chars": 1600,
"n_subproofs": 3,
"n_tactics": 29,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 10,
"n_structural": 5,
"automation_only": false,
... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Topology.Algebra.InfiniteSum.ENNReal
/-!
# Sum-of-squares inequalities for `ℝ≥0∞`
Cauchy-Schwarz-style inequalities relating sums, products, and... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Topology.Algebra.InfiniteSum.ENNReal
/-!
# Sum-of-squares inequalities for `ℝ≥0∞`
Cauchy-Schwarz-style inequalities relating sums, products, and... | @@ -20,9 +20,42 @@
namespace ENNReal
+lemma two_mul_le_add_sq (a b : ℝ≥0∞) :
+ 2 * a * b ≤ a ^ 2 + b ^ 2 := by
+ rcases eq_or_ne a ⊤ with rfl | ha
+ · simp [top_pow, top_add, le_top]
+ rcases eq_or_ne b ⊤ with rfl | hb
+ · simp [top_pow, add_top, le_top]
+ rw [← ENNReal.coe_toNNReal ha, ← ENNReal.coe_toNNR... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_abfbf9cb7b18_1 | cb1eb62a760e8c57 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Data/ENNReal/SumSquares.lean | SumSquares | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "sq_sum_div_card_le_sum_sq",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases Nat.eq_zero_or_pos s.card with hcard | hcard\n · have hs : s = ∅ := Finset.card_eq_zero.mp hcard\n si... | [
{
"name": "sq_sum_le_card_mul_sum_sq",
"text": "lemma sq_sum_le_card_mul_sum_sq {ι' : Type*}\n (s : Finset ι') (f : ι' → ℝ≥0∞) :\n (∑ i ∈ s, f i) ^ 2 ≤ s.card * ∑ i ∈ s, f i ^ 2 := by\n rw [sq, Finset.sum_mul_sum]\n suffices h : 2 * ∑ i ∈ s, ∑ j ∈ s, f i * f j ≤ 2 * (↑s.card * ∑ i ∈ s, f i ^ 2) by\n... | [
{
"name": "sq_sum_div_card_le_sum_sq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 23,
"n_chars": 1110,
"n_subproofs": 3,
"n_tactics": 16,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 4,
"automation_only": false,
... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Topology.Algebra.InfiniteSum.ENNReal
/-!
# Sum-of-squares inequalities for `ℝ≥0∞`
Cauchy-Schwarz-style inequalities relating sums, products, and... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Topology.Algebra.InfiniteSum.ENNReal
/-!
# Sum-of-squares inequalities for `ℝ≥0∞`
Cauchy-Schwarz-style inequalities relating sums, products, and... | @@ -29,6 +29,34 @@
rw [← ENNReal.coe_toNNReal ha, ← ENNReal.coe_toNNReal hb]
exact_mod_cast _root_.two_mul_le_add_sq a.toNNReal b.toNNReal
+lemma sq_sum_le_card_mul_sum_sq {ι' : Type*}
+ (s : Finset ι') (f : ι' → ℝ≥0∞) :
+ (∑ i ∈ s, f i) ^ 2 ≤ s.card * ∑ i ∈ s, f i ^ 2 := by
+ rw [sq, Finset.sum_mul_sum]... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_abfbf9cb7b18_2 | acd4c1ef69c4452b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Data/ENNReal/SumSquares.lean | SumSquares | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "sq_tsum_le_tsum_mul_tsum",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sq, tsum_mul_tsum_eq, tsum_mul_tsum_eq]\n have h2 : (2 : ℝ≥0∞) ≠ 0 := two_ne_zero\n have h2' : (2 : ℝ≥0∞) ≠... | [
{
"name": "tsum_mul_tsum_eq",
"text": "private lemma tsum_mul_tsum_eq {α : Type*} (g h : α → ℝ≥0∞) :\n (∑' a, g a) * (∑' b, h b) = ∑' a, ∑' b, g a * h b := by\n rw [← ENNReal.tsum_mul_right]; congr 1; ext a\n exact ENNReal.tsum_mul_left.symm\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 226,
... | [
{
"name": "sq_tsum_le_tsum_mul_tsum",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 33,
"n_chars": 1757,
"n_subproofs": 3,
"n_tactics": 34,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 8,
"n_structural": 6,
"automation_only": false,
... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Topology.Algebra.InfiniteSum.ENNReal
/-!
# Sum-of-squares inequalities for `ℝ≥0∞`
Cauchy-Schwarz-style inequalities relating sums, products, and... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Topology.Algebra.InfiniteSum.ENNReal
/-!
# Sum-of-squares inequalities for `ℝ≥0∞`
Cauchy-Schwarz-style inequalities relating sums, products, and... | @@ -29,8 +29,42 @@
rw [← ENNReal.coe_toNNReal ha, ← ENNReal.coe_toNNReal hb]
exact_mod_cast _root_.two_mul_le_add_sq a.toNNReal b.toNNReal
+private lemma tsum_mul_tsum_eq {α : Type*} (g h : α → ℝ≥0∞) :
+ (∑' a, g a) * (∑' b, h b) = ∑' a, ∑' b, g a * h b := by
+ rw [← ENNReal.tsum_mul_right]; congr 1; ext a
... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_abfbf9cb7b18_3 | 7a5efa77cdc70bd3 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Data/ENNReal/SumSquares.lean | SumSquares | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "sq_tsum_le_tsum_sq",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n calc (∑' a, w a * f a) ^ 2\n _ ≤ (∑' a, w a) * ∑' a, w a * f a ^ 2 := sq_tsum_le_tsum_mul_tsum w f\n _ ≤ 1 * ∑' a, w ... | [
{
"name": "sq_tsum_le_tsum_mul_tsum",
"text": "lemma sq_tsum_le_tsum_mul_tsum {α : Type*} (w f : α → ℝ≥0∞) :\n (∑' a, w a * f a) ^ 2 ≤ (∑' a, w a) * ∑' a, w a * f a ^ 2 := by\n rw [sq, tsum_mul_tsum_eq, tsum_mul_tsum_eq]\n have h2 : (2 : ℝ≥0∞) ≠ 0 := two_ne_zero\n have h2' : (2 : ℝ≥0∞) ≠ ⊤ := by norm_... | [
{
"name": "sq_tsum_le_tsum_sq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 352,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nest... | 3 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Topology.Algebra.InfiniteSum.ENNReal
/-!
# Sum-of-squares inequalities for `ℝ≥0∞`
Cauchy-Schwarz-style inequalities relating sums, products, and... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Topology.Algebra.InfiniteSum.ENNReal
/-!
# Sum-of-squares inequalities for `ℝ≥0∞`
Cauchy-Schwarz-style inequalities relating sums, products, and... | @@ -34,8 +34,44 @@
rw [← ENNReal.tsum_mul_right]; congr 1; ext a
exact ENNReal.tsum_mul_left.symm
+lemma sq_tsum_le_tsum_mul_tsum {α : Type*} (w f : α → ℝ≥0∞) :
+ (∑' a, w a * f a) ^ 2 ≤ (∑' a, w a) * ∑' a, w a * f a ^ 2 := by
+ rw [sq, tsum_mul_tsum_eq, tsum_mul_tsum_eq]
+ have h2 : (2 : ℝ≥0∞) ≠ 0 := two_... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_ff021d792139_0 | ce3f46c331e86bc0 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/SimSemantics/SimulateQ.lean | SimulateQ | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "simulateQ_StateT_compose",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing s with\n | pure x => simp [StateT.run_pure]\n | query_bin... | [
{
"name": "simulateQ_spec_query",
"text": "/-- Specialized form of `simulateQ_query` for the canonical `spec.query t`\nconstructor: `simulateQ impl (liftM (spec.query t)) = impl t`.\n\nThe general `simulateQ_query` rewrite leaves an `id <$>` artifact when applied\nto `spec.query t` (because `(spec.query t).... | [
{
"name": "simulateQ_StateT_compose",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 20,
"n_chars": 1133,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.SimSemantics.QueryImpl.Basic
import VCVio.Prelude
import ToMathlib.Control.OptionT
/-!
# Simulation Semantics for Oracles in a Computation... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.SimSemantics.QueryImpl.Basic
import VCVio.Prelude
import ToMathlib.Control.OptionT
/-!
# Simulation Semantics for Oracles in a Computation... | @@ -50,6 +50,22 @@
simulateQ impl (liftM q) = q.cont <$> (impl q.input) := by
simp [simulateQ, OracleComp.liftM_def]
+/-- Specialized form of `simulateQ_query` for the canonical `spec.query t`
+constructor: `simulateQ impl (liftM (spec.query t)) = impl t`.
+
+The general `simulateQ_query` rewrite leaves an `i... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_ff021d792139_1 | 0d301c1c7a32fdaf | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/SimSemantics/SimulateQ.lean | SimulateQ | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "simulateQ_StateT_compose",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing s with\n | pure x => simp [StateT.run_pure]\n | query_bin... | [
{
"name": "simulateQ_spec_query",
"text": "/-- Specialized form of `simulateQ_query` for the canonical `spec.query t`\nconstructor: `simulateQ impl (liftM (spec.query t)) = impl t`.\n\nThe general `simulateQ_query` rewrite leaves an `id <$>` artifact when applied\nto `spec.query t` (because `(spec.query t).... | [
{
"name": "simulateQ_StateT_StateT_compose",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 25,
"n_chars": 1503,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.SimSemantics.QueryImpl.Basic
import VCVio.Prelude
import ToMathlib.Control.OptionT
/-!
# Simulation Semantics for Oracles in a Computation... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.SimSemantics.QueryImpl.Basic
import VCVio.Prelude
import ToMathlib.Control.OptionT
/-!
# Simulation Semantics for Oracles in a Computation... | @@ -50,6 +50,22 @@
simulateQ impl (liftM q) = q.cont <$> (impl q.input) := by
simp [simulateQ, OracleComp.liftM_def]
+/-- Specialized form of `simulateQ_query` for the canonical `spec.query t`
+constructor: `simulateQ impl (liftM (spec.query t)) = impl t`.
+
+The general `simulateQ_query` rewrite leaves an `i... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_cc095aa8b18b_8 | a417d9638034acae | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/PRFTagReader/Collision.lean | Collision | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "authRFExp_le_uniformCollisionBound_of_distinctReaderNonces",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hmax : ∀ d : Digest,\n (Pr[= d | ($ᵗ Digest : ProbComp Digest)]).toRe... | [
{
"name": "authRFExp_le_collisionBound_of_distinctReaderNonces",
"text": "/-- Collision bound for the random-function authentication world, restricted to adversaries whose\nreader queries use pairwise-distinct nonces. For such an adversary making at most `q` reader\nqueries, the probability that the random-... | [
{
"name": "authExp_le_prfAdvantage_add_uniformCollisionBound",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 21,
"n_chars": 1146,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"autom... | 6 | /-
Copyright (c) 2026 Oleksandr Vovkotrub. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oleksandr Vovkotrub
-/
import Examples.PRFTagReader.Collision.ForgeStep
/-!
# PRF Tag/Reader Protocol — Collision Bound
The collision-bound theorems for the random-function aut... | /-
Copyright (c) 2026 Oleksandr Vovkotrub. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oleksandr Vovkotrub
-/
import Examples.PRFTagReader.Collision.ForgeStep
/-!
# PRF Tag/Reader Protocol — Collision Bound
The collision-bound theorems for the random-function aut... | @@ -423,6 +423,66 @@
rw [hc, hqcast, mul_assoc]
omit [Nonempty TagId] [NeZero sessionsPerTag] in
+/-- Collision bound for the random-function authentication world, restricted to adversaries whose
+reader queries use pairwise-distinct nonces. For such an adversary making at most `q` reader
+queries, the ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_58be1f38b4c4_0 | 9067048c6d2e56d8 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Data/ENNReal/AbsDiff.lean | AbsDiff | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "absDiff_triangle",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold ENNReal.absDiff\n calc (a - c) + (c - a)\n ≤ ((a - b) + (b - c)) + ((c - b) + (b - a)) :=\n add_le_add... | [
{
"name": "tsub_le_tsub_add_tsub",
"text": "private lemma tsub_le_tsub_add_tsub (a b c : ℝ≥0∞) : a - c ≤ (a - b) + (b - c) := by\n rw [tsub_le_iff_right]\n calc a ≤ (a - b) + b := le_tsub_add\n _ ≤ (a - b) + ((b - c) + c) := by gcongr; exact le_tsub_add\n _ = ((a - b) + (b - c)) + c := (add_assoc _ ... | [
{
"name": "absDiff_triangle",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 368,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Topology.Algebra.InfiniteSum.ENNReal
/-!
# Symmetric Absolute Difference and Supporting Lemmas for `ℝ≥0∞`
This file defines `ENNReal.absDiff`, a... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Topology.Algebra.InfiniteSum.ENNReal
/-!
# Symmetric Absolute Difference and Supporting Lemmas for `ℝ≥0∞`
This file defines `ENNReal.absDiff`, a... | @@ -42,8 +42,19 @@
@[simp] lemma absDiff_self (a : ℝ≥0∞) : ENNReal.absDiff a a = 0 := by
simp [ENNReal.absDiff]
+private lemma tsub_le_tsub_add_tsub (a b c : ℝ≥0∞) : a - c ≤ (a - b) + (b - c) := by
+ rw [tsub_le_iff_right]
+ calc a ≤ (a - b) + b := le_tsub_add
+ _ ≤ (a - b) + ((b - c) + c) := by gcongr; exac... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_58be1f38b4c4_1 | 9ed6d3d8f96d7f50 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Data/ENNReal/AbsDiff.lean | AbsDiff | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "absDiff_tsum_le",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold ENNReal.absDiff\n calc (∑' x, a x - ∑' x, b x) + (∑' x, b x - ∑' x, a x)\n ≤ ∑' x, (a x - b x) + ∑' x, (b x - ... | [
{
"name": "tsum_tsub_le_tsum_tsub",
"text": "lemma tsum_tsub_le_tsum_tsub {α : Type*} (a b : α → ℝ≥0∞) :\n ∑' x, a x - ∑' x, b x ≤ ∑' x, (a x - b x) := by\n rw [tsub_le_iff_right]\n calc ∑' x, a x ≤ ∑' x, ((a x - b x) + b x) :=\n ENNReal.tsum_le_tsum fun x => le_tsub_add\n _ = ∑' x, (a x - b ... | [
{
"name": "absDiff_tsum_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 487,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Topology.Algebra.InfiniteSum.ENNReal
/-!
# Symmetric Absolute Difference and Supporting Lemmas for `ℝ≥0∞`
This file defines `ENNReal.absDiff`, a... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Topology.Algebra.InfiniteSum.ENNReal
/-!
# Symmetric Absolute Difference and Supporting Lemmas for `ℝ≥0∞`
This file defines `ENNReal.absDiff`, a... | @@ -52,8 +52,20 @@
/-! ### Tsum inequalities -/
+lemma tsum_tsub_le_tsum_tsub {α : Type*} (a b : α → ℝ≥0∞) :
+ ∑' x, a x - ∑' x, b x ≤ ∑' x, (a x - b x) := by
+ rw [tsub_le_iff_right]
+ calc ∑' x, a x ≤ ∑' x, ((a x - b x) + b x) :=
+ ENNReal.tsum_le_tsum fun x => le_tsub_add
+ _ = ∑' x, (a x - b x) ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_58be1f38b4c4_2 | a6c142a96cfdd93f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Data/ENNReal/AbsDiff.lean | AbsDiff | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "absDiff_mul_right_le",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [ENNReal.absDiff]\n calc a * c - b * c + (b * c - a * c)\n ≤ (a - b) * c + (b - a) * c :=\n add... | [
{
"name": "tsub_mul_le",
"text": "private lemma tsub_mul_le (a b c : ℝ≥0∞) : a * c - b * c ≤ (a - b) * c := by\n rw [tsub_le_iff_right]\n calc a * c ≤ ((a - b) + b) * c := by gcongr; exact le_tsub_add\n _ = (a - b) * c + b * c := add_mul _ _ _\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 223... | [
{
"name": "absDiff_mul_right_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 376,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_n... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Topology.Algebra.InfiniteSum.ENNReal
/-!
# Symmetric Absolute Difference and Supporting Lemmas for `ℝ≥0∞`
This file defines `ENNReal.absDiff`, a... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Topology.Algebra.InfiniteSum.ENNReal
/-!
# Symmetric Absolute Difference and Supporting Lemmas for `ℝ≥0∞`
This file defines `ENNReal.absDiff`, a... | @@ -52,8 +52,18 @@
/-! ### Tsum inequalities -/
+private lemma tsub_mul_le (a b c : ℝ≥0∞) : a * c - b * c ≤ (a - b) * c := by
+ rw [tsub_le_iff_right]
+ calc a * c ≤ ((a - b) + b) * c := by gcongr; exact le_tsub_add
+ _ = (a - b) * c + b * c := add_mul _ _ _
+
lemma absDiff_mul_right_le (a b c : ℝ≥0∞) :
- ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3b04554830bc_0 | 6f0cb85edac14192 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/ResourceProfile.lean | ResourceProfile | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "eval_instantiate",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [show c = ofIntrinsic c.intrinsic + ofUsage c.usage by ext <;> simp [ofUsage],\n instantiate_add, eval_add, eval_ins... | [
{
"name": "eval_instantiate_ofIntrinsic",
"text": "/-- Evaluating a purely intrinsic profile after instantiation leaves the intrinsic cost\nunchanged. -/\n@[simp] lemma eval_instantiate_ofIntrinsic [AddCommMonoid ω]\n (w : ω) (impl : κ → ResourceProfile ω κ') (weights : κ' → ω) :\n ((ofIntrinsic (κ :=... | [
{
"name": "eval_instantiate",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 5,
"n_lines": 12,
"n_chars": 612,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Mathlib.Data.Finsupp.Basic
import Mathlib.Data.Finsupp.Order
/-!
# Structured Resource Profiles
This file defines a compositional resource profile for open computatio... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Mathlib.Data.Finsupp.Basic
import Mathlib.Data.Finsupp.Order
/-!
# Structured Resource Profiles
This file defines a compositional resource profile for open computatio... | @@ -284,6 +284,14 @@
rw [hc]
simp only [instantiate_add, instantiate_ofIntrinsic, hu]
+/-- Evaluating a purely intrinsic profile after instantiation leaves the intrinsic cost
+unchanged. -/
+@[simp] lemma eval_instantiate_ofIntrinsic [AddCommMonoid ω]
+ (w : ω) (impl : κ → ResourceProfile ω κ') (weights : κ'... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3a0a5f4df0eb_0 | 889be3150193ad8c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Probability/ProbabilityMassFunction/TailSums.lean | TailSums | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "tsum_coe_mul_nat_eq_tsum_measure_Ioi",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n calc\n ∑' n : ℕ, p n * (n : ℝ≥0∞) = ∑' i : ℕ, ∑' n : ℕ, if i < n then p n else 0 :=\n ENNReal.... | [
{
"name": "tsum_mul_nat_eq_tsum_tail",
"text": "/-- Tail-sum identity for a nonnegative sequence on `ℕ`:\n\n`∑' n, f n * n = ∑' i, ∑' n, if i < n then f n else 0`.\n\nThis is the discrete nonnegative analogue of writing `n = ∑_{i < n} 1` and exchanging the order of\nsummation. -/\ntheorem tsum_mul_nat_eq_ts... | [
{
"name": "tsum_coe_mul_nat_eq_tsum_measure_Ioi",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 748,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": ... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Basic
public import Mathlib.Topology.Algebra.InfiniteSum.ENNReal
/-!
# Tail-Sum Identities for `PMF`
This f... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Basic
public import Mathlib.Topology.Algebra.InfiniteSum.ENNReal
/-!
# Tail-Sum Identities for `PMF`
This f... | @@ -30,6 +30,33 @@
namespace ENNReal
+/-- Tail-sum identity for a nonnegative sequence on `ℕ`:
+
+`∑' n, f n * n = ∑' i, ∑' n, if i < n then f n else 0`.
+
+This is the discrete nonnegative analogue of writing `n = ∑_{i < n} 1` and exchanging the order of
+summation. -/
+theorem tsum_mul_nat_eq_tsum_tail (f : ℕ → ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3a0a5f4df0eb_1 | 072c614518286fb1 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Probability/ProbabilityMassFunction/TailSums.lean | TailSums | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "tsum_coe_mul_nat_eq_tsum_measure_Ioi",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n calc\n ∑' n : ℕ, p n * (n : ℝ≥0∞) = ∑' i : ℕ, ∑' n : ℕ, if i < n then p n else 0 :=\n ENNReal.... | [
{
"name": "tsum_mul_nat_eq_tsum_tail",
"text": "/-- Tail-sum identity for a nonnegative sequence on `ℕ`:\n\n`∑' n, f n * n = ∑' i, ∑' n, if i < n then f n else 0`.\n\nThis is the discrete nonnegative analogue of writing `n = ∑_{i < n} 1` and exchanging the order of\nsummation. -/\ntheorem tsum_mul_nat_eq_ts... | [
{
"name": "tsum_coe_mul_nat_le_tsum_of_measure_Ioi_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 12,
"n_chars": 573,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_on... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Basic
public import Mathlib.Topology.Algebra.InfiniteSum.ENNReal
/-!
# Tail-Sum Identities for `PMF`
This f... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Basic
public import Mathlib.Topology.Algebra.InfiniteSum.ENNReal
/-!
# Tail-Sum Identities for `PMF`
This f... | @@ -30,6 +30,33 @@
namespace ENNReal
+/-- Tail-sum identity for a nonnegative sequence on `ℕ`:
+
+`∑' n, f n * n = ∑' i, ∑' n, if i < n then f n else 0`.
+
+This is the discrete nonnegative analogue of writing `n = ∑_{i < n} 1` and exchanging the order of
+summation. -/
+theorem tsum_mul_nat_eq_tsum_tail (f : ℕ → ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e3a2f72f2909_0 | 8a114bb03a85d9f2 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/OneTimePad/Basic.lean | Basic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "perfectSecrecyAt",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro mgen msg σ\n have hpair :\n Pr[= (msg, σ) | (oneTimePad sp).PerfectSecrecyExp mgen] =\n Pr[= msg | mge... | [
{
"name": "probOutput_cipher_uniform",
"text": "lemma probOutput_cipher_uniform (sp : ℕ)\n (mgen : ProbComp (BitVec sp)) (σ : BitVec sp) :\n Pr[= σ | (oneTimePad sp).PerfectSecrecyCipherExp mgen] =\n (Fintype.card (BitVec sp) : ℝ≥0∞)⁻¹ := by\n simpa [SymmEncAlg.PerfectSecrecyCipherExp, SymmEncAl... | [
{
"name": "perfectSecrecyAt",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 522,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nest... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.CryptoFoundations.SymmEncAlg
import VCVio.OracleComp.Constructions.BitVec
import VCVio.ProgramLogic.Tactics.Relational
import VCVioWidgets.GameHop.Pan... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.CryptoFoundations.SymmEncAlg
import VCVio.OracleComp.Constructions.BitVec
import VCVio.ProgramLogic.Tactics.Relational
import VCVioWidgets.GameHop.Pan... | @@ -37,8 +37,25 @@
namespace oneTimePad
+lemma probOutput_cipher_uniform (sp : ℕ)
+ (mgen : ProbComp (BitVec sp)) (σ : BitVec sp) :
+ Pr[= σ | (oneTimePad sp).PerfectSecrecyCipherExp mgen] =
+ (Fintype.card (BitVec sp) : ℝ≥0∞)⁻¹ := by
+ simpa [SymmEncAlg.PerfectSecrecyCipherExp, SymmEncAlg.PerfectSecre... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e3a2f72f2909_1 | 7e8b5af7f46122e3 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/OneTimePad/Basic.lean | Basic | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "perfectSecrecyAt",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro mgen msg σ\n have hpair :\n Pr[= (msg, σ) | (oneTimePad sp).PerfectSecrecyExp mgen] =\n Pr[= msg | mge... | [
{
"name": "probOutput_cipher_uniform",
"text": "lemma probOutput_cipher_uniform (sp : ℕ)\n (mgen : ProbComp (BitVec sp)) (σ : BitVec sp) :\n Pr[= σ | (oneTimePad sp).PerfectSecrecyCipherExp mgen] =\n (Fintype.card (BitVec sp) : ℝ≥0∞)⁻¹ := by\n simpa [SymmEncAlg.PerfectSecrecyCipherExp, SymmEncAl... | [
{
"name": "perfectSecrecy",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 384,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting"... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.CryptoFoundations.SymmEncAlg
import VCVio.OracleComp.Constructions.BitVec
import VCVio.ProgramLogic.Tactics.Relational
import VCVioWidgets.GameHop.Pan... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.CryptoFoundations.SymmEncAlg
import VCVio.OracleComp.Constructions.BitVec
import VCVio.ProgramLogic.Tactics.Relational
import VCVioWidgets.GameHop.Pan... | @@ -37,8 +37,25 @@
namespace oneTimePad
+lemma probOutput_cipher_uniform (sp : ℕ)
+ (mgen : ProbComp (BitVec sp)) (σ : BitVec sp) :
+ Pr[= σ | (oneTimePad sp).PerfectSecrecyCipherExp mgen] =
+ (Fintype.card (BitVec sp) : ℝ≥0∞)⁻¹ := by
+ simpa [SymmEncAlg.PerfectSecrecyCipherExp, SymmEncAlg.PerfectSecre... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e6be3eb2a103_0 | 163592434d8d19b4 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/Xmss.lean | Xmss | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "climb_authPath",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro z\n induction z with\n | zero =>\n intro base idx\n simp only [authPath, List.range_zero, List.map_nil, climb... | [
{
"name": "combined_eq",
"text": "/-- Folding the honest leaf's sibling in reproduces the parent subtree root. -/\nprivate theorem combined_eq (leaf : ℕ → Y) (nodeHash : ℕ → ℕ → Y → Y → Y) (base idx : ℕ) :\n (if idx % 2 = 0\n then nodeHash (base + 1) (idx / 2) (merkleRoot leaf nodeHash base idx)\n ... | [
{
"name": "climb_authPath",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 32,
"n_chars": 1407,
"n_subproofs": 3,
"n_tactics": 24,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 5,
"n_structural": 5,
"automation_only": false,
"max_nesti... | 1 | /-
Copyright (c) 2026 Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolas Consigny
-/
import HashSig.SLHDSA.Wots
/-!
# Merkle trees and XMSS (FIPS 205 §6)
A small generic binary-Merkle-tree theory (`SLHDSA.Merkle`) parameterized by a leaf-value
f... | /-
Copyright (c) 2026 Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolas Consigny
-/
import HashSig.SLHDSA.Wots
/-!
# Merkle trees and XMSS (FIPS 205 §6)
A small generic binary-Merkle-tree theory (`SLHDSA.Merkle`) parameterized by a leaf-value
f... | @@ -52,6 +52,26 @@
(if idx % 2 = 0 then nodeHash (base + 1) (idx / 2) node a
else nodeHash (base + 1) (idx / 2) a node) auth
+/-- Folding the honest leaf's sibling in reproduces the parent subtree root. -/
+private theorem combined_eq (leaf : ℕ → Y) (nodeHash : ℕ → ℕ → Y → Y → Y) (base idx : ℕ) :
+... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e6be3eb2a103_1 | f221a24d6e6faa36 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/Xmss.lean | Xmss | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "xmssPkFromSig_xmssSign",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold xmssPkFromSig xmssSign xmssRoot xmssNode\n dsimp only\n rw [wotsPkFromSig_wotsSign]\n have key := Merkle.c... | [
{
"name": "climb_authPath",
"text": "/-- **Merkle auth-path consistency.** Climbing the honest authentication path of leaf `idx`\nfrom its honest subtree root reconstructs the height-`(base+z)` ancestor root. -/\ntheorem climb_authPath (leaf : ℕ → Y) (nodeHash : ℕ → ℕ → Y → Y → Y) :\n ∀ (z base idx : ℕ),... | [
{
"name": "xmssPkFromSig_xmssSign",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 16,
"n_chars": 770,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"max... | 2 | /-
Copyright (c) 2026 Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolas Consigny
-/
import HashSig.SLHDSA.Wots
/-!
# Merkle trees and XMSS (FIPS 205 §6)
A small generic binary-Merkle-tree theory (`SLHDSA.Merkle`) parameterized by a leaf-value
f... | /-
Copyright (c) 2026 Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolas Consigny
-/
import HashSig.SLHDSA.Wots
/-!
# Merkle trees and XMSS (FIPS 205 §6)
A small generic binary-Merkle-tree theory (`SLHDSA.Merkle`) parameterized by a leaf-value
f... | @@ -72,6 +72,37 @@
have h3 : 2 * (idx / 2) + 1 = idx := by omega
rw [h3, h2]
+/-- **Merkle auth-path consistency.** Climbing the honest authentication path of leaf `idx`
+from its honest subtree root reconstructs the height-`(base+z)` ancestor root. -/
+theorem climb_authPath (leaf : ℕ → Y) (nodeHash : ℕ → ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_26bb370a3ef0_5 | becba9c43e00558a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/ProgrammingOracle.lean | ProgrammingOracle | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "tvDist_simulateQ_withCaching_withProgramming_le_probEvent_bad'",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n set sim₁ := (simulateQ (so.withProgramming policy) oa).run (ca... | [
{
"name": "tvDist_withProgramming_withCachingTrackingPolicy_run_le_probEvent_bad'",
"text": "/-- Joint (state-included) identical-until-bad TV-distance bound between `withProgramming policy`\nand its tracking partner `withCachingTrackingPolicy policy`, with the base implementation valued\nin `OracleComp spe... | [
{
"name": "tvDist_simulateQ_withCaching_withProgramming_le_probEvent_bad'",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 41,
"n_chars": 2224,
"n_subproofs": 3,
"n_tactics": 21,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural":... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.OracleComp.QueryTracking.ProgrammingOracle
import VCVio.OracleComp.QueryTracking.RandomOracle.Basic
import VCVio.ProgramLogic.Relational.SimulateQ
/-!
# TV-distan... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.OracleComp.QueryTracking.ProgrammingOracle
import VCVio.OracleComp.QueryTracking.RandomOracle.Basic
import VCVio.ProgramLogic.Relational.SimulateQ
/-!
# TV-distan... | @@ -126,6 +126,33 @@
rw [probOutput_pure, if_neg (hne u' _), mul_zero]
omit [IsUniformSpec spec] in
+/-- Joint (state-included) identical-until-bad TV-distance bound between `withProgramming policy`
+and its tracking partner `withCachingTrackingPolicy policy`, with the base implementation valued
+in `OracleCo... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e6803abca6da_0 | de8e6b821b08cda7 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/HardnessAssumptions/CollisionResistance.lean | CollisionResistance | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "romCRWin_implies_collision",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro z hz hwin\n simp only [romCRInner, simulateQ_bind, simulateQ_pure, StateT.run_bind, support_bind,\n S... | [
{
"name": "ROMHashSpec.simulateQ_cachingOracle_query",
"text": "/-- Specialised `simulateQ_query` lemma for the bridge: simulating a single\npre-spec query through `ROMHashSpec.cachingOracle` is the generic\n`cachingOracle` action at the post-cache spec. The two specs are\ndefinitionally equal as `OracleSpe... | [
{
"name": "romCRWin_implies_collision",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 1208,
"n_subproofs": 2,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 4,
"automation_only": false,
... | 1 | /-
Copyright (c) 2026 XC0R. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: XC0R
-/
import VCVio.OracleComp.ProbComp
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Birthday
/-!
# Collision-Resistant Hash Functions
This file defines collision re... | /-
Copyright (c) 2026 XC0R. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: XC0R
-/
import VCVio.OracleComp.ProbComp
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Birthday
/-!
# Collision-Resistant Hash Functions
This file defines collision re... | @@ -175,6 +175,17 @@
(OracleComp (ROMHashSpec.cached X Y))) :=
OracleSpec.cachingOracle (spec := ROMHashSpec.cached X Y)
+/-- Specialised `simulateQ_query` lemma for the bridge: simulating a single
+pre-spec query through `ROMHashSpec.cachingOracle` is the generic
+`cachingOracle` action at the post-cache... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e6803abca6da_1 | fca8ca41077f1d62 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/HardnessAssumptions/CollisionResistance.lean | CollisionResistance | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "romCRAdvantage_le_birthday",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [romCRAdvantage, romCRExp_eq]\n exact (probEvent_mono (romCRWin_implies_collision A)).trans <|\n p... | [
{
"name": "romCRWin_implies_collision",
"text": "/-- A win in the ROM-CR experiment implies a collision in the final cache:\nthe verification queries cache `x ↦ y` and `x' ↦ y'` with `x ≠ x'` and\n`y = y'`, which is exactly `CacheHasCollision`. -/\nprivate lemma romCRWin_implies_collision [DecidableEq X] [D... | [
{
"name": "romCRAdvantage_le_birthday",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 14,
"n_chars": 829,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 4 | /-
Copyright (c) 2026 XC0R. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: XC0R
-/
import VCVio.OracleComp.ProbComp
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Birthday
/-!
# Collision-Resistant Hash Functions
This file defines collision re... | /-
Copyright (c) 2026 XC0R. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: XC0R
-/
import VCVio.OracleComp.ProbComp
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Birthday
/-!
# Collision-Resistant Hash Functions
This file defines collision re... | @@ -245,6 +245,27 @@
simp only [isTotalQueryBound_query_bind_iff]
exact ⟨by lia, fun _y => ⟨Nat.one_pos, fun _ => trivial⟩⟩
+/-- A win in the ROM-CR experiment implies a collision in the final cache:
+the verification queries cache `x ↦ y` and `x' ↦ y'` with `x ≠ x'` and
+`y = y'`, which is exactly `CacheHasCol... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_693c89279c9b_0 | df532620ae91cdca | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/DiscreteGaussian.lean | DiscreteGaussian | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "discreteGaussianWeight_nonneg",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n le_of_lt (discreteGaussianWeight_pos σ μ z)",
"n_chars": 48,
"n_subproofs": 0,
"n_tactics": 1,
"... | [
{
"name": "discreteGaussianWeight_pos",
"text": "/-- The discrete Gaussian weight is strictly positive at every integer point. -/\ntheorem discreteGaussianWeight_pos (σ μ : ℝ) (z : ℤ) :\n 0 < discreteGaussianWeight σ μ z :=\n exp_pos _\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 197,
"n_... | [
{
"name": "discreteGaussianWeight_nonneg",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 232,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Mathlib.Analysis.SpecialFunctions.Gaussian.GaussianIntegral
import Mathlib.Probability.ProbabilityMassFunction.Basic
import Mathlib.Topology.Algebra.InfiniteSum.Real
/-... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Mathlib.Analysis.SpecialFunctions.Gaussian.GaussianIntegral
import Mathlib.Probability.ProbabilityMassFunction.Basic
import Mathlib.Topology.Algebra.InfiniteSum.Real
/-... | @@ -41,9 +41,15 @@
noncomputable def discreteGaussianWeight (σ μ : ℝ) (z : ℤ) : ℝ :=
Real.exp (-(↑z - μ) ^ 2 / (2 * σ ^ 2))
+/-- The discrete Gaussian weight is strictly positive at every integer point. -/
+theorem discreteGaussianWeight_pos (σ μ : ℝ) (z : ℤ) :
+ 0 < discreteGaussianWeight σ μ z :=
+ exp_pos ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_693c89279c9b_1 | 15e226bc30cd3ccd | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/DiscreteGaussian.lean | DiscreteGaussian | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "discreteGaussianWeight_nonneg",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n le_of_lt (discreteGaussianWeight_pos σ μ z)",
"n_chars": 48,
"n_subproofs": 0,
"n_tactics": 1,
"... | [
{
"name": "discreteGaussianWeight_pos",
"text": "/-- The discrete Gaussian weight is strictly positive at every integer point. -/\ntheorem discreteGaussianWeight_pos (σ μ : ℝ) (z : ℤ) :\n 0 < discreteGaussianWeight σ μ z :=\n exp_pos _\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 197,
"n_... | [
{
"name": "discreteGaussianPMF_pos",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 316,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max... | 4 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Mathlib.Analysis.SpecialFunctions.Gaussian.GaussianIntegral
import Mathlib.Probability.ProbabilityMassFunction.Basic
import Mathlib.Topology.Algebra.InfiniteSum.Real
/-... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Mathlib.Analysis.SpecialFunctions.Gaussian.GaussianIntegral
import Mathlib.Probability.ProbabilityMassFunction.Basic
import Mathlib.Topology.Algebra.InfiniteSum.Real
/-... | @@ -41,9 +41,15 @@
noncomputable def discreteGaussianWeight (σ μ : ℝ) (z : ℤ) : ℝ :=
Real.exp (-(↑z - μ) ^ 2 / (2 * σ ^ 2))
+/-- The discrete Gaussian weight is strictly positive at every integer point. -/
+theorem discreteGaussianWeight_pos (σ μ : ℝ) (z : ℤ) :
+ 0 < discreteGaussianWeight σ μ z :=
+ exp_pos ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_693c89279c9b_2 | e73ce9d6e89b3ec1 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/DiscreteGaussian.lean | DiscreteGaussian | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "discreteGaussianSum_pos",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n (discreteGaussianSum_summable σ μ hσ).tsum_pos\n (fun z => discreteGaussianWeight_nonneg σ μ z) 0\n (discreteGau... | [
{
"name": "discreteGaussianWeight_nonneg",
"text": "/-- The discrete Gaussian weight is nonnegative at every integer point. -/\ntheorem discreteGaussianWeight_nonneg (σ μ : ℝ) (z : ℤ) :\n 0 ≤ discreteGaussianWeight σ μ z :=\n le_of_lt (discreteGaussianWeight_pos σ μ z)\n\n",
"fan_in": 2,
"n_line... | [
{
"name": "hasSum_ofReal_discreteGaussian",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 7,
"n_lines": 8,
"n_chars": 392,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 7 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Mathlib.Analysis.SpecialFunctions.Gaussian.GaussianIntegral
import Mathlib.Probability.ProbabilityMassFunction.Basic
import Mathlib.Topology.Algebra.InfiniteSum.Real
/-... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Mathlib.Analysis.SpecialFunctions.Gaussian.GaussianIntegral
import Mathlib.Probability.ProbabilityMassFunction.Basic
import Mathlib.Topology.Algebra.InfiniteSum.Real
/-... | @@ -46,6 +46,11 @@
0 < discreteGaussianWeight σ μ z :=
exp_pos _
+/-- The discrete Gaussian weight is nonnegative at every integer point. -/
+theorem discreteGaussianWeight_nonneg (σ μ : ℝ) (z : ℤ) :
+ 0 ≤ discreteGaussianWeight σ μ z :=
+ le_of_lt (discreteGaussianWeight_pos σ μ z)
+
/-- The normalizing... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_693c89279c9b_3 | 134b346f595545a2 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/DiscreteGaussian.lean | DiscreteGaussian | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "discreteGaussianWeight_nonneg",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n le_of_lt (discreteGaussianWeight_pos σ μ z)",
"n_chars": 48,
"n_subproofs": 0,
"n_tactics": 1,
"... | [
{
"name": "discreteGaussianWeight_pos",
"text": "/-- The discrete Gaussian weight is strictly positive at every integer point. -/\ntheorem discreteGaussianWeight_pos (σ μ : ℝ) (z : ℤ) :\n 0 < discreteGaussianWeight σ μ z :=\n exp_pos _\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 197,
"n_... | [
{
"name": "discreteGaussianDist_pos",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 5,
"n_chars": 182,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"ma... | 5 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Mathlib.Analysis.SpecialFunctions.Gaussian.GaussianIntegral
import Mathlib.Probability.ProbabilityMassFunction.Basic
import Mathlib.Topology.Algebra.InfiniteSum.Real
/-... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Mathlib.Analysis.SpecialFunctions.Gaussian.GaussianIntegral
import Mathlib.Probability.ProbabilityMassFunction.Basic
import Mathlib.Topology.Algebra.InfiniteSum.Real
/-... | @@ -41,9 +41,15 @@
noncomputable def discreteGaussianWeight (σ μ : ℝ) (z : ℤ) : ℝ :=
Real.exp (-(↑z - μ) ^ 2 / (2 * σ ^ 2))
+/-- The discrete Gaussian weight is strictly positive at every integer point. -/
+theorem discreteGaussianWeight_pos (σ μ : ℝ) (z : ℤ) :
+ 0 < discreteGaussianWeight σ μ z :=
+ exp_pos ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_693c89279c9b_4 | d5d0169c326d947f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/DiscreteGaussian.lean | DiscreteGaussian | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "discreteGaussianWeight_nonneg",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n le_of_lt (discreteGaussianWeight_pos σ μ z)",
"n_chars": 48,
"n_subproofs": 0,
"n_tactics": 1,
"... | [
{
"name": "discreteGaussianWeight_pos",
"text": "/-- The discrete Gaussian weight is strictly positive at every integer point. -/\ntheorem discreteGaussianWeight_pos (σ μ : ℝ) (z : ℤ) :\n 0 < discreteGaussianWeight σ μ z :=\n exp_pos _\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 197,
"n_... | [
{
"name": "discreteGaussianDist_ne_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 5,
"n_chars": 175,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 6 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Mathlib.Analysis.SpecialFunctions.Gaussian.GaussianIntegral
import Mathlib.Probability.ProbabilityMassFunction.Basic
import Mathlib.Topology.Algebra.InfiniteSum.Real
/-... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Mathlib.Analysis.SpecialFunctions.Gaussian.GaussianIntegral
import Mathlib.Probability.ProbabilityMassFunction.Basic
import Mathlib.Topology.Algebra.InfiniteSum.Real
/-... | @@ -41,9 +41,15 @@
noncomputable def discreteGaussianWeight (σ μ : ℝ) (z : ℤ) : ℝ :=
Real.exp (-(↑z - μ) ^ 2 / (2 * σ ^ 2))
+/-- The discrete Gaussian weight is strictly positive at every integer point. -/
+theorem discreteGaussianWeight_pos (σ μ : ℝ) (z : ℤ) :
+ 0 < discreteGaussianWeight σ μ z :=
+ exp_pos ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_0 | ae0fa34967eb79b0 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 4 | [
{
"theorem_name": "triple_ofLE",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n (triple_iff_le_wp pre oa post).mpr h",
"n_chars": 39,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_au... | [
{
"name": "triple_iff_le_wp",
"text": "/-- Bridge between Loom2's inductive `Std.Do'.Triple` and Mathlib's `≤` on\n`ℝ≥0∞`. Loom2 defines `Std.Do'.Triple.iff` against\n`Lean.Order.PartialOrder.rel`; on `ℝ≥0∞` our `Lean.Order.PartialOrder`\ninstance defines `rel` as Mathlib's `≤`, so the two coincide. The\nex... | [
{
"name": "triple_ofLE",
"fan_in": 10,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 499,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting":... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -87,6 +87,18 @@
wp oa post =
MAlgOrdered.wp (m := OracleComp spec) (l := ℝ≥0∞) oa post := rfl
+/-- Bridge between Loom2's inductive `Std.Do'.Triple` and Mathlib's `≤` on
+`ℝ≥0∞`. Loom2 defines `Std.Do'.Triple.iff` against
+`Lean.Order.PartialOrder.rel`; on `ℝ≥0∞` our `Lean.Order.PartialOrder`
+instance... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_1 | b83354eebc6d8829 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 4 | [
{
"theorem_name": "triple_ofLE",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n (triple_iff_le_wp pre oa post).mpr h",
"n_chars": 39,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_au... | [
{
"name": "triple_iff_le_wp",
"text": "/-- Bridge between Loom2's inductive `Std.Do'.Triple` and Mathlib's `≤` on\n`ℝ≥0∞`. Loom2 defines `Std.Do'.Triple.iff` against\n`Lean.Order.PartialOrder.rel`; on `ℝ≥0∞` our `Lean.Order.PartialOrder`\ninstance defines `rel` as Mathlib's `≤`, so the two coincide. The\nex... | [
{
"name": "triple_toLE",
"fan_in": 7,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 342,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": ... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -87,12 +87,25 @@
wp oa post =
MAlgOrdered.wp (m := OracleComp spec) (l := ℝ≥0∞) oa post := rfl
+/-- Bridge between Loom2's inductive `Std.Do'.Triple` and Mathlib's `≤` on
+`ℝ≥0∞`. Loom2 defines `Std.Do'.Triple.iff` against
+`Lean.Order.PartialOrder.rel`; on `ℝ≥0∞` our `Lean.Order.PartialOrder`
+instanc... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_2 | 3024894f7208b99a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 4 | [
{
"theorem_name": "wp_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [wp_eq_mAlgOrdered_wp, MAlgOrdered.wp_pure]",
"n_chars": 52,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
... | [
{
"name": "wp_eq_mAlgOrdered_wp",
"text": "theorem wp_eq_mAlgOrdered_wp (oa : OracleComp spec α) (post : α → ℝ≥0∞) :\n wp oa post =\n MAlgOrdered.wp (m := OracleComp spec) (l := ℝ≥0∞) oa post := rfl\n\n",
"fan_in": 4,
"n_lines": 5,
"n_chars": 179,
"n_subproofs": 0,
"n_tactics": 1... | [
{
"name": "wp_pure",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 180,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
}... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -83,8 +83,13 @@
re-exposes this so existing `MAlgOrdered.wp_*` lemmas can be applied with
a single rewrite. -/
+theorem wp_eq_mAlgOrdered_wp (oa : OracleComp spec α) (post : α → ℝ≥0∞) :
+ wp oa post =
+ MAlgOrdered.wp (m := OracleComp spec) (l := ℝ≥0∞) oa post := rfl
+
@[simp, game_rule] theorem wp_pure... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_3 | 7145eb60b7fcfcba | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 4 | [
{
"theorem_name": "wp_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [wp_eq_mAlgOrdered_wp, MAlgOrdered.wp_pure]",
"n_chars": 52,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
... | [
{
"name": "wp_eq_mAlgOrdered_wp",
"text": "theorem wp_eq_mAlgOrdered_wp (oa : OracleComp spec α) (post : α → ℝ≥0∞) :\n wp oa post =\n MAlgOrdered.wp (m := OracleComp spec) (l := ℝ≥0∞) oa post := rfl\n\n",
"fan_in": 4,
"n_lines": 5,
"n_chars": 179,
"n_subproofs": 0,
"n_tactics": 1... | [
{
"name": "wp_mono",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 268,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
}... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -83,8 +83,13 @@
re-exposes this so existing `MAlgOrdered.wp_*` lemmas can be applied with
a single rewrite. -/
+theorem wp_eq_mAlgOrdered_wp (oa : OracleComp spec α) (post : α → ℝ≥0∞) :
+ wp oa post =
+ MAlgOrdered.wp (m := OracleComp spec) (l := ℝ≥0∞) oa post := rfl
+
@[simp, game_rule] theorem wp_pure... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_4 | ae5158ed79ee80e7 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 6 | [
{
"theorem_name": "wp_const",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [wp_eq_tsum, ENNReal.tsum_mul_right, tsum_probOutput_of_liftM_PMF, one_mul]",
"n_chars": 84,
"n_subproofs": 0,
"n_t... | [
{
"name": "wp_eq_tsum",
"text": "/-- General unfolding: `wp` as weighted sum over output probabilities. -/\ntheorem wp_eq_tsum (oa : OracleComp spec α) (post : α → ℝ≥0∞) :\n wp oa post = ∑' x, Pr[= x | oa] * post x := by\n rw [wp_eq_mAlgOrdered_wp, MAlgOrdered.wp]\n change μ (oa >>= fun a => pure (post... | [
{
"name": "wp_const",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 185,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -165,21 +165,35 @@
rw [wp_bind]
simp [Function.comp_def]
+/-- General unfolding: `wp` as weighted sum over output probabilities. -/
+theorem wp_eq_tsum (oa : OracleComp spec α) (post : α → ℝ≥0∞) :
+ wp oa post = ∑' x, Pr[= x | oa] * post x := by
+ rw [wp_eq_mAlgOrdered_wp, MAlgOrdered.wp]
+ change μ (oa... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_5 | 924543b143d6b3c4 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 6 | [
{
"theorem_name": "wp_const",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [wp_eq_tsum, ENNReal.tsum_mul_right, tsum_probOutput_of_liftM_PMF, one_mul]",
"n_chars": 84,
"n_subproofs": 0,
"n_t... | [
{
"name": "wp_eq_tsum",
"text": "/-- General unfolding: `wp` as weighted sum over output probabilities. -/\ntheorem wp_eq_tsum (oa : OracleComp spec α) (post : α → ℝ≥0∞) :\n wp oa post = ∑' x, Pr[= x | oa] * post x := by\n rw [wp_eq_mAlgOrdered_wp, MAlgOrdered.wp]\n change μ (oa >>= fun a => pure (post... | [
{
"name": "wp_const_mul",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 14,
"n_chars": 553,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting":... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -165,16 +165,29 @@
rw [wp_bind]
simp [Function.comp_def]
+/-- General unfolding: `wp` as weighted sum over output probabilities. -/
+theorem wp_eq_tsum (oa : OracleComp spec α) (post : α → ℝ≥0∞) :
+ wp oa post = ∑' x, Pr[= x | oa] * post x := by
+ rw [wp_eq_mAlgOrdered_wp, MAlgOrdered.wp]
+ change μ (oa... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_6 | 695192cec659a6cb | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 10 | [
{
"theorem_name": "triple_conseq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " fun h =>\n triple_ofLE\n (le_trans hpre (le_trans (triple_toLE h)\n (MAlgOrdered.wp_mono (m := OracleComp spec) (l := ℝ≥0∞... | [
{
"name": "triple_ofLE",
"text": "/-- Construct a `Triple …` from a `≤`-form proof\n`pre ≤ wp oa post`. Companion to\n`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs\nbecause it avoids Lean's typeclass-projection unification failures\nthat arise when calling `Std.Do'.Triple.intro` di... | [
{
"name": "triple_conseq",
"fan_in": 3,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 10,
"n_chars": 379,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting"... | 5 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -99,6 +99,18 @@
pre ≤ wp oa post :=
Std.Do'.Triple.iff (epost := Lean.Order.bot)
+/-- Construct a `Triple …` from a `≤`-form proof
+`pre ≤ wp oa post`. Companion to
+`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs
+because it avoids Lean's typeclass-projection unification failures... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_7 | bc315edb42f92c99 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 10 | [
{
"theorem_name": "triple_conseq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " fun h =>\n triple_ofLE\n (le_trans hpre (le_trans (triple_toLE h)\n (MAlgOrdered.wp_mono (m := OracleComp spec) (l := ℝ≥0∞... | [
{
"name": "triple_ofLE",
"text": "/-- Construct a `Triple …` from a `≤`-form proof\n`pre ≤ wp oa post`. Companion to\n`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs\nbecause it avoids Lean's typeclass-projection unification failures\nthat arise when calling `Std.Do'.Triple.intro` di... | [
{
"name": "triple_bind",
"fan_in": 3,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 401,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": 4... | 3 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -99,6 +99,18 @@
pre ≤ wp oa post :=
Std.Do'.Triple.iff (epost := Lean.Order.bot)
+/-- Construct a `Triple …` from a `≤`-form proof
+`pre ≤ wp oa post`. Companion to
+`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs
+because it avoids Lean's typeclass-projection unification failures... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_8 | 026b4111016a3acb | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 10 | [
{
"theorem_name": "triple_conseq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " fun h =>\n triple_ofLE\n (le_trans hpre (le_trans (triple_toLE h)\n (MAlgOrdered.wp_mono (m := OracleComp spec) (l := ℝ≥0∞... | [
{
"name": "triple_ofLE",
"text": "/-- Construct a `Triple …` from a `≤`-form proof\n`pre ≤ wp oa post`. Companion to\n`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs\nbecause it avoids Lean's typeclass-projection unification failures\nthat arise when calling `Std.Do'.Triple.intro` di... | [
{
"name": "triple_bind_wp",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 8,
"n_chars": 283,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting"... | 4 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -99,6 +99,18 @@
pre ≤ wp oa post :=
Std.Do'.Triple.iff (epost := Lean.Order.bot)
+/-- Construct a `Triple …` from a `≤`-form proof
+`pre ≤ wp oa post`. Companion to
+`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs
+because it avoids Lean's typeclass-projection unification failures... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_9 | 0575064b9ea90d68 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 10 | [
{
"theorem_name": "triple_conseq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " fun h =>\n triple_ofLE\n (le_trans hpre (le_trans (triple_toLE h)\n (MAlgOrdered.wp_mono (m := OracleComp spec) (l := ℝ≥0∞... | [
{
"name": "triple_ofLE",
"text": "/-- Construct a `Triple …` from a `≤`-form proof\n`pre ≤ wp oa post`. Companion to\n`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs\nbecause it avoids Lean's typeclass-projection unification failures\nthat arise when calling `Std.Do'.Triple.intro` di... | [
{
"name": "triple_pure",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 141,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": 2
... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -99,6 +99,18 @@
pre ≤ wp oa post :=
Std.Do'.Triple.iff (epost := Lean.Order.bot)
+/-- Construct a `Triple …` from a `≤`-form proof
+`pre ≤ wp oa post`. Companion to
+`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs
+because it avoids Lean's typeclass-projection unification failures... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_10 | a953c9505fb2fb76 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 10 | [
{
"theorem_name": "triple_conseq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " fun h =>\n triple_ofLE\n (le_trans hpre (le_trans (triple_toLE h)\n (MAlgOrdered.wp_mono (m := OracleComp spec) (l := ℝ≥0∞... | [
{
"name": "triple_ofLE",
"text": "/-- Construct a `Triple …` from a `≤`-form proof\n`pre ≤ wp oa post`. Companion to\n`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs\nbecause it avoids Lean's typeclass-projection unification failures\nthat arise when calling `Std.Do'.Triple.intro` di... | [
{
"name": "triple_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 6,
"n_chars": 206,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": 2
... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -99,6 +99,18 @@
pre ≤ wp oa post :=
Std.Do'.Triple.iff (epost := Lean.Order.bot)
+/-- Construct a `Triple …` from a `≤`-form proof
+`pre ≤ wp oa post`. Companion to
+`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs
+because it avoids Lean's typeclass-projection unification failures... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_11 | 33b7253c5233c209 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 6 | [
{
"theorem_name": "wp_const",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [wp_eq_tsum, ENNReal.tsum_mul_right, tsum_probOutput_of_liftM_PMF, one_mul]",
"n_chars": 84,
"n_subproofs": 0,
"n_t... | [
{
"name": "wp_eq_tsum",
"text": "/-- General unfolding: `wp` as weighted sum over output probabilities. -/\ntheorem wp_eq_tsum (oa : OracleComp spec α) (post : α → ℝ≥0∞) :\n wp oa post = ∑' x, Pr[= x | oa] * post x := by\n rw [wp_eq_mAlgOrdered_wp, MAlgOrdered.wp]\n change μ (oa >>= fun a => pure (post... | [
{
"name": "probEvent_eq_wp_indicator",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 297,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"ma... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -165,26 +165,41 @@
rw [wp_bind]
simp [Function.comp_def]
+/-- General unfolding: `wp` as weighted sum over output probabilities. -/
+theorem wp_eq_tsum (oa : OracleComp spec α) (post : α → ℝ≥0∞) :
+ wp oa post = ∑' x, Pr[= x | oa] * post x := by
+ rw [wp_eq_mAlgOrdered_wp, MAlgOrdered.wp]
+ change μ (oa... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_12 | 35ef048f14331478 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 6 | [
{
"theorem_name": "wp_const",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [wp_eq_tsum, ENNReal.tsum_mul_right, tsum_probOutput_of_liftM_PMF, one_mul]",
"n_chars": 84,
"n_subproofs": 0,
"n_t... | [
{
"name": "wp_eq_tsum",
"text": "/-- General unfolding: `wp` as weighted sum over output probabilities. -/\ntheorem wp_eq_tsum (oa : OracleComp spec α) (post : α → ℝ≥0∞) :\n wp oa post = ∑' x, Pr[= x | oa] * post x := by\n rw [wp_eq_mAlgOrdered_wp, MAlgOrdered.wp]\n change μ (oa >>= fun a => pure (post... | [
{
"name": "probOutput_eq_wp_indicator",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 7,
"n_chars": 329,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"m... | 3 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -165,21 +165,35 @@
rw [wp_bind]
simp [Function.comp_def]
+/-- General unfolding: `wp` as weighted sum over output probabilities. -/
+theorem wp_eq_tsum (oa : OracleComp spec α) (post : α → ℝ≥0∞) :
+ wp oa post = ∑' x, Pr[= x | oa] * post x := by
+ rw [wp_eq_mAlgOrdered_wp, MAlgOrdered.wp]
+ change μ (oa... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_13 | ecb9d3216dad3cc6 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 10 | [
{
"theorem_name": "triple_conseq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " fun h =>\n triple_ofLE\n (le_trans hpre (le_trans (triple_toLE h)\n (MAlgOrdered.wp_mono (m := OracleComp spec) (l := ℝ≥0∞... | [
{
"name": "triple_ofLE",
"text": "/-- Construct a `Triple …` from a `≤`-form proof\n`pre ≤ wp oa post`. Companion to\n`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs\nbecause it avoids Lean's typeclass-projection unification failures\nthat arise when calling `Std.Do'.Triple.intro` di... | [
{
"name": "triple_probEvent_indicator",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 6,
"n_chars": 281,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"... | 5 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -99,6 +99,18 @@
pre ≤ wp oa post :=
Std.Do'.Triple.iff (epost := Lean.Order.bot)
+/-- Construct a `Triple …` from a `≤`-form proof
+`pre ≤ wp oa post`. Companion to
+`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs
+because it avoids Lean's typeclass-projection unification failures... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_14 | 65610b774fcd5f57 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 10 | [
{
"theorem_name": "triple_conseq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " fun h =>\n triple_ofLE\n (le_trans hpre (le_trans (triple_toLE h)\n (MAlgOrdered.wp_mono (m := OracleComp spec) (l := ℝ≥0∞... | [
{
"name": "triple_ofLE",
"text": "/-- Construct a `Triple …` from a `≤`-form proof\n`pre ≤ wp oa post`. Companion to\n`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs\nbecause it avoids Lean's typeclass-projection unification failures\nthat arise when calling `Std.Do'.Triple.intro` di... | [
{
"name": "triple_probOutput_indicator",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 6,
"n_chars": 277,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 6 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -99,6 +99,18 @@
pre ≤ wp oa post :=
Std.Do'.Triple.iff (epost := Lean.Order.bot)
+/-- Construct a `Triple …` from a `≤`-form proof
+`pre ≤ wp oa post`. Companion to
+`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs
+because it avoids Lean's typeclass-projection unification failures... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_15 | 234367e6e6607bf2 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 4 | [
{
"theorem_name": "triple_ofLE",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n (triple_iff_le_wp pre oa post).mpr h",
"n_chars": 39,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_au... | [
{
"name": "triple_iff_le_wp",
"text": "/-- Bridge between Loom2's inductive `Std.Do'.Triple` and Mathlib's `≤` on\n`ℝ≥0∞`. Loom2 defines `Std.Do'.Triple.iff` against\n`Lean.Order.PartialOrder.rel`; on `ℝ≥0∞` our `Lean.Order.PartialOrder`\ninstance defines `rel` as Mathlib's `≤`, so the two coincide. The\nex... | [
{
"name": "le_probEvent_iff_triple_indicator",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 345,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false... | 4 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -87,6 +87,18 @@
wp oa post =
MAlgOrdered.wp (m := OracleComp spec) (l := ℝ≥0∞) oa post := rfl
+/-- Bridge between Loom2's inductive `Std.Do'.Triple` and Mathlib's `≤` on
+`ℝ≥0∞`. Loom2 defines `Std.Do'.Triple.iff` against
+`Lean.Order.PartialOrder.rel`; on `ℝ≥0∞` our `Lean.Order.PartialOrder`
+instance... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_16 | 9abefb4e5058ae7d | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 6 | [
{
"theorem_name": "wp_const",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [wp_eq_tsum, ENNReal.tsum_mul_right, tsum_probOutput_of_liftM_PMF, one_mul]",
"n_chars": 84,
"n_subproofs": 0,
"n_t... | [
{
"name": "wp_eq_tsum",
"text": "/-- General unfolding: `wp` as weighted sum over output probabilities. -/\ntheorem wp_eq_tsum (oa : OracleComp spec α) (post : α → ℝ≥0∞) :\n wp oa post = ∑' x, Pr[= x | oa] * post x := by\n rw [wp_eq_mAlgOrdered_wp, MAlgOrdered.wp]\n change μ (oa >>= fun a => pure (post... | [
{
"name": "le_probOutput_iff_triple_indicator",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 8,
"n_chars": 337,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fals... | 5 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -177,21 +177,35 @@
rw [wp_bind]
simp [Function.comp_def]
+/-- General unfolding: `wp` as weighted sum over output probabilities. -/
+theorem wp_eq_tsum (oa : OracleComp spec α) (post : α → ℝ≥0∞) :
+ wp oa post = ∑' x, Pr[= x | oa] * post x := by
+ rw [wp_eq_mAlgOrdered_wp, MAlgOrdered.wp]
+ change μ (oa... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_17 | e3c59d668bc67687 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 10 | [
{
"theorem_name": "triple_conseq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " fun h =>\n triple_ofLE\n (le_trans hpre (le_trans (triple_toLE h)\n (MAlgOrdered.wp_mono (m := OracleComp spec) (l := ℝ≥0∞... | [
{
"name": "triple_ofLE",
"text": "/-- Construct a `Triple …` from a `≤`-form proof\n`pre ≤ wp oa post`. Companion to\n`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs\nbecause it avoids Lean's typeclass-projection unification failures\nthat arise when calling `Std.Do'.Triple.intro` di... | [
{
"name": "triple_probEvent_eq_one",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 8,
"n_chars": 326,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max... | 6 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -99,6 +99,18 @@
pre ≤ wp oa post :=
Std.Do'.Triple.iff (epost := Lean.Order.bot)
+/-- Construct a `Triple …` from a `≤`-form proof
+`pre ≤ wp oa post`. Companion to
+`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs
+because it avoids Lean's typeclass-projection unification failures... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_18 | fb421793065dddca | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 10 | [
{
"theorem_name": "triple_conseq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " fun h =>\n triple_ofLE\n (le_trans hpre (le_trans (triple_toLE h)\n (MAlgOrdered.wp_mono (m := OracleComp spec) (l := ℝ≥0∞... | [
{
"name": "triple_ofLE",
"text": "/-- Construct a `Triple …` from a `≤`-form proof\n`pre ≤ wp oa post`. Companion to\n`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs\nbecause it avoids Lean's typeclass-projection unification failures\nthat arise when calling `Std.Do'.Triple.intro` di... | [
{
"name": "triple_probOutput_eq_one",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 8,
"n_chars": 332,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"ma... | 7 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -99,6 +99,18 @@
pre ≤ wp oa post :=
Std.Do'.Triple.iff (epost := Lean.Order.bot)
+/-- Construct a `Triple …` from a `≤`-form proof
+`pre ≤ wp oa post`. Companion to
+`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs
+because it avoids Lean's typeclass-projection unification failures... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_19 | 90d0d07bba6f79e6 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 10 | [
{
"theorem_name": "triple_conseq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " fun h =>\n triple_ofLE\n (le_trans hpre (le_trans (triple_toLE h)\n (MAlgOrdered.wp_mono (m := OracleComp spec) (l := ℝ≥0∞... | [
{
"name": "triple_ofLE",
"text": "/-- Construct a `Triple …` from a `≤`-form proof\n`pre ≤ wp oa post`. Companion to\n`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs\nbecause it avoids Lean's typeclass-projection unification failures\nthat arise when calling `Std.Do'.Triple.intro` di... | [
{
"name": "probOutput_eq_one_iff_triple",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 9,
"n_lines": 12,
"n_chars": 509,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
... | 9 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -99,6 +99,18 @@
pre ≤ wp oa post :=
Std.Do'.Triple.iff (epost := Lean.Order.bot)
+/-- Construct a `Triple …` from a `≤`-form proof
+`pre ≤ wp oa post`. Companion to
+`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs
+because it avoids Lean's typeclass-projection unification failures... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_20 | 4684dfba68355ddf | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 10 | [
{
"theorem_name": "triple_conseq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " fun h =>\n triple_ofLE\n (le_trans hpre (le_trans (triple_toLE h)\n (MAlgOrdered.wp_mono (m := OracleComp spec) (l := ℝ≥0∞... | [
{
"name": "triple_ofLE",
"text": "/-- Construct a `Triple …` from a `≤`-form proof\n`pre ≤ wp oa post`. Companion to\n`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs\nbecause it avoids Lean's typeclass-projection unification failures\nthat arise when calling `Std.Do'.Triple.intro` di... | [
{
"name": "triple_support",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 11,
"n_chars": 454,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting"... | 8 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -99,6 +99,18 @@
pre ≤ wp oa post :=
Std.Do'.Triple.iff (epost := Lean.Order.bot)
+/-- Construct a `Triple …` from a `≤`-form proof
+`pre ≤ wp oa post`. Companion to
+`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs
+because it avoids Lean's typeclass-projection unification failures... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_21 | e899bd07a36741e7 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 10 | [
{
"theorem_name": "triple_conseq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " fun h =>\n triple_ofLE\n (le_trans hpre (le_trans (triple_toLE h)\n (MAlgOrdered.wp_mono (m := OracleComp spec) (l := ℝ≥0∞... | [
{
"name": "triple_ofLE",
"text": "/-- Construct a `Triple …` from a `≤`-form proof\n`pre ≤ wp oa post`. Companion to\n`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs\nbecause it avoids Lean's typeclass-projection unification failures\nthat arise when calling `Std.Do'.Triple.intro` di... | [
{
"name": "triple_replicate_succ",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 6,
"n_lines": 9,
"n_chars": 337,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_n... | 4 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -99,6 +99,18 @@
pre ≤ wp oa post :=
Std.Do'.Triple.iff (epost := Lean.Order.bot)
+/-- Construct a `Triple …` from a `≤`-form proof
+`pre ≤ wp oa post`. Companion to
+`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs
+because it avoids Lean's typeclass-projection unification failures... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_22 | 23eba6dac85a7029 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 10 | [
{
"theorem_name": "triple_conseq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " fun h =>\n triple_ofLE\n (le_trans hpre (le_trans (triple_toLE h)\n (MAlgOrdered.wp_mono (m := OracleComp spec) (l := ℝ≥0∞... | [
{
"name": "triple_ofLE",
"text": "/-- Construct a `Triple …` from a `≤`-form proof\n`pre ≤ wp oa post`. Companion to\n`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs\nbecause it avoids Lean's typeclass-projection unification failures\nthat arise when calling `Std.Do'.Triple.intro` di... | [
{
"name": "triple_list_mapM_cons",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 6,
"n_lines": 9,
"n_chars": 351,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_n... | 4 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -99,6 +99,18 @@
pre ≤ wp oa post :=
Std.Do'.Triple.iff (epost := Lean.Order.bot)
+/-- Construct a `Triple …` from a `≤`-form proof
+`pre ≤ wp oa post`. Companion to
+`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs
+because it avoids Lean's typeclass-projection unification failures... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_23 | 6e4aac577b5636f2 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 10 | [
{
"theorem_name": "triple_conseq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " fun h =>\n triple_ofLE\n (le_trans hpre (le_trans (triple_toLE h)\n (MAlgOrdered.wp_mono (m := OracleComp spec) (l := ℝ≥0∞... | [
{
"name": "triple_ofLE",
"text": "/-- Construct a `Triple …` from a `≤`-form proof\n`pre ≤ wp oa post`. Companion to\n`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs\nbecause it avoids Lean's typeclass-projection unification failures\nthat arise when calling `Std.Do'.Triple.intro` di... | [
{
"name": "triple_list_foldlM_cons",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 6,
"n_lines": 10,
"n_chars": 383,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"ma... | 4 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -99,6 +99,18 @@
pre ≤ wp oa post :=
Std.Do'.Triple.iff (epost := Lean.Order.bot)
+/-- Construct a `Triple …` from a `≤`-form proof
+`pre ≤ wp oa post`. Companion to
+`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs
+because it avoids Lean's typeclass-projection unification failures... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_24 | c61beb0d6b03ed10 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 24 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 10 | [
{
"theorem_name": "triple_conseq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " fun h =>\n triple_ofLE\n (le_trans hpre (le_trans (triple_toLE h)\n (MAlgOrdered.wp_mono (m := OracleComp spec) (l := ℝ≥0∞... | [
{
"name": "triple_ofLE",
"text": "/-- Construct a `Triple …` from a `≤`-form proof\n`pre ≤ wp oa post`. Companion to\n`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs\nbecause it avoids Lean's typeclass-projection unification failures\nthat arise when calling `Std.Do'.Triple.intro` di... | [
{
"name": "triple_replicate_inv",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 12,
"n_chars": 473,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"max_n... | 5 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -99,6 +99,18 @@
pre ≤ wp oa post :=
Std.Do'.Triple.iff (epost := Lean.Order.bot)
+/-- Construct a `Triple …` from a `≤`-form proof
+`pre ≤ wp oa post`. Companion to
+`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs
+because it avoids Lean's typeclass-projection unification failures... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_25 | 7e378916ccc9960f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 25 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 10 | [
{
"theorem_name": "triple_conseq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " fun h =>\n triple_ofLE\n (le_trans hpre (le_trans (triple_toLE h)\n (MAlgOrdered.wp_mono (m := OracleComp spec) (l := ℝ≥0∞... | [
{
"name": "triple_ofLE",
"text": "/-- Construct a `Triple …` from a `≤`-form proof\n`pre ≤ wp oa post`. Companion to\n`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs\nbecause it avoids Lean's typeclass-projection unification failures\nthat arise when calling `Std.Do'.Triple.intro` di... | [
{
"name": "triple_list_foldlM_inv",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 13,
"n_chars": 508,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"max... | 5 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -99,6 +99,18 @@
pre ≤ wp oa post :=
Std.Do'.Triple.iff (epost := Lean.Order.bot)
+/-- Construct a `Triple …` from a `≤`-form proof
+`pre ≤ wp oa post`. Companion to
+`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs
+because it avoids Lean's typeclass-projection unification failures... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_26 | f163e5e571990258 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 26 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 10 | [
{
"theorem_name": "triple_conseq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " fun h =>\n triple_ofLE\n (le_trans hpre (le_trans (triple_toLE h)\n (MAlgOrdered.wp_mono (m := OracleComp spec) (l := ℝ≥0∞... | [
{
"name": "triple_ofLE",
"text": "/-- Construct a `Triple …` from a `≤`-form proof\n`pre ≤ wp oa post`. Companion to\n`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs\nbecause it avoids Lean's typeclass-projection unification failures\nthat arise when calling `Std.Do'.Triple.intro` di... | [
{
"name": "triple_list_mapM_inv",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 14,
"n_chars": 540,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"max_n... | 5 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -99,6 +99,18 @@
pre ≤ wp oa post :=
Std.Do'.Triple.iff (epost := Lean.Order.bot)
+/-- Construct a `Triple …` from a `≤`-form proof
+`pre ≤ wp oa post`. Companion to
+`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs
+because it avoids Lean's typeclass-projection unification failures... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_27 | 76584b5d4206323a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 27 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 10 | [
{
"theorem_name": "triple_conseq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " fun h =>\n triple_ofLE\n (le_trans hpre (le_trans (triple_toLE h)\n (MAlgOrdered.wp_mono (m := OracleComp spec) (l := ℝ≥0∞... | [
{
"name": "triple_ofLE",
"text": "/-- Construct a `Triple …` from a `≤`-form proof\n`pre ≤ wp oa post`. Companion to\n`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs\nbecause it avoids Lean's typeclass-projection unification failures\nthat arise when calling `Std.Do'.Triple.intro` di... | [
{
"name": "triple_replicate",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 9,
"n_chars": 403,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nestin... | 9 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -99,6 +99,18 @@
pre ≤ wp oa post :=
Std.Do'.Triple.iff (epost := Lean.Order.bot)
+/-- Construct a `Triple …` from a `≤`-form proof
+`pre ≤ wp oa post`. Companion to
+`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs
+because it avoids Lean's typeclass-projection unification failures... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_28 | e90d6048a6aee743 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 28 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 10 | [
{
"theorem_name": "triple_conseq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " fun h =>\n triple_ofLE\n (le_trans hpre (le_trans (triple_toLE h)\n (MAlgOrdered.wp_mono (m := OracleComp spec) (l := ℝ≥0∞... | [
{
"name": "triple_ofLE",
"text": "/-- Construct a `Triple …` from a `≤`-form proof\n`pre ≤ wp oa post`. Companion to\n`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs\nbecause it avoids Lean's typeclass-projection unification failures\nthat arise when calling `Std.Do'.Triple.intro` di... | [
{
"name": "triple_list_foldlM",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 10,
"n_chars": 439,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nes... | 9 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -99,6 +99,18 @@
pre ≤ wp oa post :=
Std.Do'.Triple.iff (epost := Lean.Order.bot)
+/-- Construct a `Triple …` from a `≤`-form proof
+`pre ≤ wp oa post`. Companion to
+`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs
+because it avoids Lean's typeclass-projection unification failures... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_29 | 3149825aeef4cd89 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 29 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 10 | [
{
"theorem_name": "triple_conseq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " fun h =>\n triple_ofLE\n (le_trans hpre (le_trans (triple_toLE h)\n (MAlgOrdered.wp_mono (m := OracleComp spec) (l := ℝ≥0∞... | [
{
"name": "triple_ofLE",
"text": "/-- Construct a `Triple …` from a `≤`-form proof\n`pre ≤ wp oa post`. Companion to\n`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs\nbecause it avoids Lean's typeclass-projection unification failures\nthat arise when calling `Std.Do'.Triple.intro` di... | [
{
"name": "triple_list_mapM",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 12,
"n_chars": 451,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesti... | 9 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -99,6 +99,18 @@
pre ≤ wp oa post :=
Std.Do'.Triple.iff (epost := Lean.Order.bot)
+/-- Construct a `Triple …` from a `≤`-form proof
+`pre ≤ wp oa post`. Companion to
+`triple_iff_le_wp.mpr`; preferred as the constructor in concrete proofs
+because it avoids Lean's typeclass-projection unification failures... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_30 | 933059ffe73c84db | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 30 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 1 | [
{
"theorem_name": "μ_congr_evalDist",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold μ\n exact tsum_congr fun x => by rw [probOutput_congr_evalDist h]",
"n_chars": 79,
"n_subproofs": 0,
"... | [
{
"name": "probOutput_congr_evalDist",
"text": "lemma probOutput_congr_evalDist {oa ob : OracleComp spec α}\n (h : 𝒟[oa] = 𝒟[ob]) (x : α) :\n Pr[= x | oa] = Pr[= x | ob] := by\n change 𝒟[oa] x = 𝒟[ob] x\n rw [h]\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 183,
"n_subproofs": 0,
... | [
{
"name": "μ_congr_evalDist",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 194,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -227,9 +227,17 @@
rw [probEvent_eq_one_iff]
refine ⟨by simp, fun x hx => hx⟩
+lemma probOutput_congr_evalDist {oa ob : OracleComp spec α}
+ (h : 𝒟[oa] = 𝒟[ob]) (x : α) :
+ Pr[= x | oa] = Pr[= x | ob] := by
+ change 𝒟[oa] x = 𝒟[ob] x
+ rw [h]
+
lemma μ_congr_evalDist {oa ob : OracleComp spec ℝ≥0∞... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e72b38f37837_31 | 3fb4d666d44a3736 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/HoareTriple.lean | HoareTriple | 31 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 1 | [
{
"theorem_name": "μ_congr_evalDist",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold μ\n exact tsum_congr fun x => by rw [probOutput_congr_evalDist h]",
"n_chars": 79,
"n_subproofs": 0,
"... | [
{
"name": "probOutput_congr_evalDist",
"text": "lemma probOutput_congr_evalDist {oa ob : OracleComp spec α}\n (h : 𝒟[oa] = 𝒟[ob]) (x : α) :\n Pr[= x | oa] = Pr[= x | ob] := by\n change 𝒟[oa] x = 𝒟[ob] x\n rw [h]\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 183,
"n_subproofs": 0,
... | [
{
"name": "wp_congr_evalDist",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 268,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.Loom.Quantitative
import VCVio.OracleComp.Constructions.Replicate
import VCVio.OracleComp.Constructions.SampleableType
/-!
# Quantitative Hoar... | @@ -227,9 +227,17 @@
rw [probEvent_eq_one_iff]
refine ⟨by simp, fun x hx => hx⟩
+lemma probOutput_congr_evalDist {oa ob : OracleComp spec α}
+ (h : 𝒟[oa] = 𝒟[ob]) (x : α) :
+ Pr[= x | oa] = Pr[= x | ob] := by
+ change 𝒟[oa] x = 𝒟[ob] x
+ rw [h]
+
lemma μ_congr_evalDist {oa ob : OracleComp spec ℝ≥0∞... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_ddcadb3ad796_0 | c14999a9673608e5 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FujisakiOkamoto/UTransform.lean | UTransform | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "encaps_usesExactlyTwoQueries",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [HasQuery.UsesExactlyQueries] using\n (encaps_usesExactFamilyWeightedCost\n (ω := ℕ) (runtime :=... | [
{
"name": "encaps_usesExactFamilyWeightedCost",
"text": "/-- If each of the two U-transform oracle families is assigned a constant weight, encapsulation\nincurs exactly the sum of those family weights. -/\ntheorem encaps_usesExactFamilyWeightedCost {ω : Type} [AddMonoid ω]\n (runtime : QueryImpl (UTransf... | [
{
"name": "encaps_usesExactlyTwoQueries",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 793,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FujisakiOkamoto.TTransform
import VCVio.CryptoFoundations.KeyEncapMech
import VCVio.CryptoFoundations.PRF
import VCVio.OracleComp.Coercions.Add
i... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FujisakiOkamoto.TTransform
import VCVio.CryptoFoundations.KeyEncapMech
import VCVio.CryptoFoundations.PRF
import VCVio.OracleComp.Coercions.Add
i... | @@ -186,6 +186,31 @@
variable {m : Type → Type v} [Monad m] [LawfulMonad m] [MonadLiftT ProbComp m]
+/-- If each of the two U-transform oracle families is assigned a constant weight, encapsulation
+incurs exactly the sum of those family weights. -/
+theorem encaps_usesExactFamilyWeightedCost {ω : Type} [AddMonoid ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_ddcadb3ad796_1 | a41189dc03462893 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FujisakiOkamoto/UTransform.lean | UTransform | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "encaps_usesExactlyTwoQueries",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [HasQuery.UsesExactlyQueries] using\n (encaps_usesExactFamilyWeightedCost\n (ω := ℕ) (runtime :=... | [
{
"name": "encaps_usesExactFamilyWeightedCost",
"text": "/-- If each of the two U-transform oracle families is assigned a constant weight, encapsulation\nincurs exactly the sum of those family weights. -/\ntheorem encaps_usesExactFamilyWeightedCost {ω : Type} [AddMonoid ω]\n (runtime : QueryImpl (UTransf... | [
{
"name": "encaps_expectedQueryCost_eq_of_constantOracleWeights",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 1174,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"au... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FujisakiOkamoto.TTransform
import VCVio.CryptoFoundations.KeyEncapMech
import VCVio.CryptoFoundations.PRF
import VCVio.OracleComp.Coercions.Add
i... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FujisakiOkamoto.TTransform
import VCVio.CryptoFoundations.KeyEncapMech
import VCVio.CryptoFoundations.PRF
import VCVio.OracleComp.Coercions.Add
i... | @@ -186,6 +186,31 @@
variable {m : Type → Type v} [Monad m] [LawfulMonad m] [MonadLiftT ProbComp m]
+/-- If each of the two U-transform oracle families is assigned a constant weight, encapsulation
+incurs exactly the sum of those family weights. -/
+theorem encaps_usesExactFamilyWeightedCost {ω : Type} [AddMonoid ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_ddcadb3ad796_2 | 37c63516e445162f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FujisakiOkamoto/UTransform.lean | UTransform | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "encaps_expectedQueryCost_le",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n HasQuery.expectedQueryCost_le_of_usesCostAtMost\n (encaps_usesWeightedQueryCostAtMost\n (runtime := runtim... | [
{
"name": "encaps_usesWeightedQueryCostAtMost",
"text": "/-- Under per-family upper bounds on the two U-transform oracle families, encapsulation incurs\nweighted query cost at most the sum of those bounds. -/\ntheorem encaps_usesWeightedQueryCostAtMost {ω : Type}\n [AddCommMonoid ω] [PartialOrder ω] [IsO... | [
{
"name": "encaps_expectedQueryCost_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 1199,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FujisakiOkamoto.TTransform
import VCVio.CryptoFoundations.KeyEncapMech
import VCVio.CryptoFoundations.PRF
import VCVio.OracleComp.Coercions.Add
i... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FujisakiOkamoto.TTransform
import VCVio.CryptoFoundations.KeyEncapMech
import VCVio.CryptoFoundations.PRF
import VCVio.OracleComp.Coercions.Add
i... | @@ -186,6 +186,43 @@
variable {m : Type → Type v} [Monad m] [LawfulMonad m] [MonadLiftT ProbComp m]
+/-- Under per-family upper bounds on the two U-transform oracle families, encapsulation incurs
+weighted query cost at most the sum of those bounds. -/
+theorem encaps_usesWeightedQueryCostAtMost {ω : Type}
+ [A... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_ddcadb3ad796_3 | 261a2fb07599dfbe | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FujisakiOkamoto/UTransform.lean | UTransform | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "encaps_usesExactlyTwoQueries",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [HasQuery.UsesExactlyQueries] using\n (encaps_usesExactFamilyWeightedCost\n (ω := ℕ) (runtime :=... | [
{
"name": "encaps_usesExactFamilyWeightedCost",
"text": "/-- If each of the two U-transform oracle families is assigned a constant weight, encapsulation\nincurs exactly the sum of those family weights. -/\ntheorem encaps_usesExactFamilyWeightedCost {ω : Type} [AddMonoid ω]\n (runtime : QueryImpl (UTransf... | [
{
"name": "encaps_expectedQueries_eq_two",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 712,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FujisakiOkamoto.TTransform
import VCVio.CryptoFoundations.KeyEncapMech
import VCVio.CryptoFoundations.PRF
import VCVio.OracleComp.Coercions.Add
i... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FujisakiOkamoto.TTransform
import VCVio.CryptoFoundations.KeyEncapMech
import VCVio.CryptoFoundations.PRF
import VCVio.OracleComp.Coercions.Add
i... | @@ -186,6 +186,31 @@
variable {m : Type → Type v} [Monad m] [LawfulMonad m] [MonadLiftT ProbComp m]
+/-- If each of the two U-transform oracle families is assigned a constant weight, encapsulation
+incurs exactly the sum of those family weights. -/
+theorem encaps_usesExactFamilyWeightedCost {ω : Type} [AddMonoid ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_ddcadb3ad796_4 | 88474b249be4cd0c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FujisakiOkamoto/UTransform.lean | UTransform | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "decaps_usesWeightedQueryCostAtMost",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [HasQuery.UsesCostAtMost]\n cases hdec : pke.decrypt sk c with\n | none =>\n exact HasQuery.use... | [
{
"name": "decaps_usesZeroQueryCost_of_decrypt_eq_none",
"text": "/-- If deterministic decryption fails immediately, U-transform decapsulation incurs zero weighted\nquery cost. -/\ntheorem decaps_usesZeroQueryCost_of_decrypt_eq_none {ω : Type} [AddMonoid ω]\n (runtime : QueryImpl (UTransform.hashOracleSp... | [
{
"name": "decaps_usesWeightedQueryCostAtMost",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 42,
"n_chars": 2114,
"n_subproofs": 0,
"n_tactics": 24,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 7,
"automation_only": f... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FujisakiOkamoto.TTransform
import VCVio.CryptoFoundations.KeyEncapMech
import VCVio.CryptoFoundations.PRF
import VCVio.OracleComp.Coercions.Add
i... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FujisakiOkamoto.TTransform
import VCVio.CryptoFoundations.KeyEncapMech
import VCVio.CryptoFoundations.PRF
import VCVio.OracleComp.Coercions.Add
i... | @@ -186,6 +186,23 @@
variable {m : Type → Type v} [Monad m] [LawfulMonad m] [MonadLiftT ProbComp m]
+/-- If deterministic decryption fails immediately, U-transform decapsulation incurs zero weighted
+query cost. -/
+theorem decaps_usesZeroQueryCost_of_decrypt_eq_none {ω : Type} [AddMonoid ω]
+ (runtime : QueryI... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_ddcadb3ad796_5 | fe70967ccc0b2027 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FujisakiOkamoto/UTransform.lean | UTransform | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "decaps_usesWeightedQueryCostAtMost",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [HasQuery.UsesCostAtMost]\n cases hdec : pke.decrypt sk c with\n | none =>\n exact HasQuery.use... | [
{
"name": "decaps_usesZeroQueryCost_of_decrypt_eq_none",
"text": "/-- If deterministic decryption fails immediately, U-transform decapsulation incurs zero weighted\nquery cost. -/\ntheorem decaps_usesZeroQueryCost_of_decrypt_eq_none {ω : Type} [AddMonoid ω]\n (runtime : QueryImpl (UTransform.hashOracleSp... | [
{
"name": "decaps_expectedQueryCost_eq_zero_of_decrypt_eq_none",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 1142,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"aut... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FujisakiOkamoto.TTransform
import VCVio.CryptoFoundations.KeyEncapMech
import VCVio.CryptoFoundations.PRF
import VCVio.OracleComp.Coercions.Add
i... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FujisakiOkamoto.TTransform
import VCVio.CryptoFoundations.KeyEncapMech
import VCVio.CryptoFoundations.PRF
import VCVio.OracleComp.Coercions.Add
i... | @@ -186,6 +186,23 @@
variable {m : Type → Type v} [Monad m] [LawfulMonad m] [MonadLiftT ProbComp m]
+/-- If deterministic decryption fails immediately, U-transform decapsulation incurs zero weighted
+query cost. -/
+theorem decaps_usesZeroQueryCost_of_decrypt_eq_none {ω : Type} [AddMonoid ω]
+ (runtime : QueryI... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.