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_10b2270a7777_1 | 65a5fe7199ecb80a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/WotsChecksum.lean | WotsChecksum | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 2 | [
{
"theorem_name": "fromBaseW_cons",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n change List.foldl (fun acc x => acc * w + x) 0 (d :: ds)\n = d * w ^ ds.length + List.foldl (fun acc x => acc * w + x) 0 ... | [
{
"name": "foldl_mul_add_shift",
"text": "private theorem foldl_mul_add_shift (w a : ℕ) (ds : List ℕ) :\n List.foldl (fun acc x => acc * w + x) a ds\n = a * w ^ ds.length + List.foldl (fun acc x => acc * w + x) 0 ds := by\n induction ds generalizing a with\n | nil => simp\n | cons d ds ih =>\n ... | [
{
"name": "fromBaseW_append",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 421,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 1 | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | @@ -42,12 +42,31 @@
@[simp]
theorem fromBaseW_nil (w : ℕ) : fromBaseW w [] = 0 := rfl
+private theorem foldl_mul_add_shift (w a : ℕ) (ds : List ℕ) :
+ List.foldl (fun acc x => acc * w + x) a ds
+ = a * w ^ ds.length + List.foldl (fun acc x => acc * w + x) 0 ds := by
+ induction ds generalizing a 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_10b2270a7777_2 | 3e4ef4b089ca0278 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/WotsChecksum.lean | WotsChecksum | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 1 | [
{
"theorem_name": "fromBaseW_pointwiseLE",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n foldl_acc_le ds1 ds2 w 0 0 (Nat.le_refl 0) hLE",
"n_chars": 49,
"n_subproofs": 0,
"n_tactics": 1,
"cyclo... | [
{
"name": "foldl_acc_le",
"text": "/-- Helper: pointwise `≤` at the `foldl` level with an accumulator. -/\nprivate theorem foldl_acc_le (ds1 ds2 : List ℕ) (w : ℕ) (a b : ℕ) (hAcc : a ≤ b)\n (hLE : Forall₂ (· ≤ ·) ds1 ds2) :\n List.foldl (fun acc d => acc * w + d) a ds1 ≤\n List.foldl (fun acc d => ... | [
{
"name": "fromBaseW_pointwiseLE",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 194,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_n... | 1 | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | @@ -60,8 +60,21 @@
rw [List.foldl_cons, foldl_mul_add_shift w (0 * w + d) ds]
ring
+/-- Helper: pointwise `≤` at the `foldl` level with an accumulator. -/
+private theorem foldl_acc_le (ds1 ds2 : List ℕ) (w : ℕ) (a b : ℕ) (hAcc : a ≤ b)
+ (hLE : Forall₂ (· ≤ ·) ds1 ds2) :
+ List.foldl (fun acc d => acc * ... | {
"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_10b2270a7777_3 | 3c08599b4a96fa67 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/WotsChecksum.lean | WotsChecksum | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 1 | [
{
"theorem_name": "fromBaseW_digitsOfBaseW_eq_mod",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction len generalizing n with\n | zero => simp [digitsOfBaseW, fromBaseW, Nat.mod_one]\n | succ len ih... | [
{
"name": "mod_pow_succ_extract",
"text": "/-- The key modular identity: `n % w^(len+1) = ((n / w^len) % w) * w^len + n % w^len`. -/\ntheorem mod_pow_succ_extract (n w len : ℕ) (hw : 0 < w) :\n n % (w ^ (len + 1)) = ((n / w ^ len) % w) * w ^ len + n % w ^ len := by\n let M := w ^ len\n let MW := M * w\... | [
{
"name": "fromBaseW_digitsOfBaseW_eq_mod",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 9,
"n_chars": 368,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 3 | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | @@ -71,11 +71,67 @@
| zero => simp [digitsOfBaseW]
| succ len ih => simp [digitsOfBaseW, ih]
+/-- The key modular identity: `n % w^(len+1) = ((n / w^len) % w) * w^len + n % w^len`. -/
+theorem mod_pow_succ_extract (n w len : ℕ) (hw : 0 < w) :
+ n % (w ^ (len + 1)) = ((n / w ^ len) % w) * w ^ len + n % w ^ le... | {
"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_10b2270a7777_4 | b2cecef05f0125cc | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/WotsChecksum.lean | WotsChecksum | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 1 | [
{
"theorem_name": "fromBaseW_digitsOfBaseW_eq_mod",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction len generalizing n with\n | zero => simp [digitsOfBaseW, fromBaseW, Nat.mod_one]\n | succ len ih... | [
{
"name": "mod_pow_succ_extract",
"text": "/-- The key modular identity: `n % w^(len+1) = ((n / w^len) % w) * w^len + n % w^len`. -/\ntheorem mod_pow_succ_extract (n w len : ℕ) (hw : 0 < w) :\n n % (w ^ (len + 1)) = ((n / w ^ len) % w) * w ^ len + n % w ^ len := by\n let M := w ^ len\n let MW := M * w\... | [
{
"name": "fromBaseW_digitsOfBaseW_of_lt",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 6,
"n_chars": 214,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 4 | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | @@ -71,11 +71,67 @@
| zero => simp [digitsOfBaseW]
| succ len ih => simp [digitsOfBaseW, ih]
+/-- The key modular identity: `n % w^(len+1) = ((n / w^len) % w) * w^len + n % w^len`. -/
+theorem mod_pow_succ_extract (n w len : ℕ) (hw : 0 < w) :
+ n % (w ^ (len + 1)) = ((n / w ^ len) % w) * w ^ len + n % w ^ le... | {
"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_10b2270a7777_5 | 27d5b90964dbba8b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/WotsChecksum.lean | WotsChecksum | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 1 | [
{
"theorem_name": "fromBaseW_digitsOfBaseW_of_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [fromBaseW_digitsOfBaseW_eq_mod n w len hw]\n exact Nat.mod_eq_of_lt h",
"n_chars": 79,
"n_subpro... | [
{
"name": "fromBaseW_digitsOfBaseW_eq_mod",
"text": "theorem fromBaseW_digitsOfBaseW_eq_mod (n w len : ℕ) (hw : 0 < w) :\n fromBaseW w (digitsOfBaseW n w len) = n % (w ^ len) := by\n induction len generalizing n with\n | zero => simp [digitsOfBaseW, fromBaseW, Nat.mod_one]\n | succ len ih =>\n simp... | [
{
"name": "digitsOfBaseW_pointwiseLE_imp_le",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 15,
"n_chars": 608,
"n_subproofs": 3,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false... | 7 | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | @@ -141,8 +141,18 @@
_ = R % MW := by simp
_ = R := Nat.mod_eq_of_lt h_bound
+theorem fromBaseW_digitsOfBaseW_eq_mod (n w len : ℕ) (hw : 0 < w) :
+ fromBaseW w (digitsOfBaseW n w len) = n % (w ^ len) := by
+ induction len generalizing n with
+ | zero => simp [digitsOfBaseW, fromBaseW, Nat.mod_one]
+ |... | {
"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_10b2270a7777_6 | 5a75f76e803b06e1 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/WotsChecksum.lean | WotsChecksum | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 1 | [
{
"theorem_name": "wotsChecksumValue_le",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [wotsChecksumValue]\n have h_each := checksum_each_le w digits hBound\n have h_len_map : (digits.map (fun d => w ... | [
{
"name": "sum_le_length_mul",
"text": "private theorem sum_le_length_mul (xs : List ℕ) (M : ℕ)\n (h : ∀ x ∈ xs, x ≤ M) : xs.sum ≤ xs.length * M := by\n induction xs with\n | nil => simp\n | cons x xs ih =>\n simp only [List.sum_cons]\n have hx : x ≤ M := h x (by simp)\n have hxs : ∀ y ∈ xs, ... | [
{
"name": "wotsChecksumValue_le",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 485,
"n_subproofs": 3,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_n... | 2 | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | @@ -77,9 +77,32 @@
have hlt : d < w := hBound d hd
omega
+private theorem sum_le_length_mul (xs : List ℕ) (M : ℕ)
+ (h : ∀ x ∈ xs, x ≤ M) : xs.sum ≤ xs.length * M := by
+ induction xs with
+ | nil => simp
+ | cons x xs ih =>
+ simp only [List.sum_cons]
+ have hx : x ≤ M := h x (by simp)
+ have hx... | {
"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_10b2270a7777_7 | 7cb9cb2c67ccf53d | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/WotsChecksum.lean | WotsChecksum | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 2 | [
{
"theorem_name": "fromBaseW_digitsOfBaseW_eq_mod",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction len generalizing n with\n | zero => simp [digitsOfBaseW, fromBaseW, Nat.mod_one]\n | succ len ih... | [
{
"name": "digitsOfBaseW_length",
"text": "theorem digitsOfBaseW_length (n w len : ℕ) : (digitsOfBaseW n w len).length = len := by\n induction len with\n | zero => simp [digitsOfBaseW]\n | succ len ih => simp [digitsOfBaseW, ih]\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 189,
"n_subproof... | [
{
"name": "wotsFullDigits_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 227,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_ne... | 1 | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | @@ -66,6 +66,11 @@
| 0 => []
| len + 1 => ((n / w ^ len) % w) :: digitsOfBaseW n w len
+theorem digitsOfBaseW_length (n w len : ℕ) : (digitsOfBaseW n w len).length = len := by
+ induction len with
+ | zero => simp [digitsOfBaseW]
+ | succ len ih => simp [digitsOfBaseW, ih]
+
/-- The WOTS+ checksum value `Σ ... | {
"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_10b2270a7777_8 | 619c01db4ffcfc4b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/WotsChecksum.lean | WotsChecksum | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 1 | [
{
"theorem_name": "wotsChecksumValue_antitone",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [wotsChecksumValue, wotsChecksumValue]\n exact (Forall₂_map_checksum_rev hLE hBound1 hBound2).sum_le",
"... | [
{
"name": "Forall₂_map_checksum_rev",
"text": "/-- `Forall₂ (≤) (map f dig2) (map f dig1)` helper for the antitone lemma. -/\nprivate theorem Forall₂_map_checksum_rev {dig1 dig2 : List ℕ} {w : ℕ}\n (hLE : Forall₂ (· ≤ ·) dig1 dig2)\n (hBound1 : ∀ d ∈ dig1, d < w) (hBound2 : ∀ d ∈ dig2, d < w) :\n F... | [
{
"name": "wotsChecksumValue_antitone",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 359,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"... | 1 | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | @@ -83,10 +83,28 @@
def wotsFullDigits (dig : List ℕ) (w _l1 l2 : ℕ) : List ℕ :=
dig ++ digitsOfBaseW (wotsChecksumValue w dig) w l2
+/-- `Forall₂ (≤) (map f dig2) (map f dig1)` helper for the antitone lemma. -/
+private theorem Forall₂_map_checksum_rev {dig1 dig2 : List ℕ} {w : ℕ}
+ (hLE : Forall₂ (· ≤ ·) dig... | {
"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_10b2270a7777_9 | 16f86affe27a2162 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/WotsChecksum.lean | WotsChecksum | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 1 | [
{
"theorem_name": "wotsChecksum_eq_imp_sum_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hLenEq : dig1.length = dig2.length := hLE.length_eq\n have hIdent1 := wotsChecksumValue_add_sum_eq w dig1 ... | [
{
"name": "wotsChecksumValue_add_sum_eq",
"text": "theorem wotsChecksumValue_add_sum_eq (w : ℕ) (digits : List ℕ)\n (hBound : ∀ d ∈ digits, d < w) :\n wotsChecksumValue w digits + digits.sum = digits.length * (w - 1) := by\n rw [wotsChecksumValue]\n induction digits with\n | nil => simp\n | cons d... | [
{
"name": "wotsChecksum_eq_imp_sum_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 567,
"n_subproofs": 3,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | @@ -81,11 +81,40 @@
def wotsFullDigits (dig : List ℕ) (w _l1 l2 : ℕ) : List ℕ :=
dig ++ digitsOfBaseW (wotsChecksumValue w dig) w l2
+theorem wotsChecksumValue_add_sum_eq (w : ℕ) (digits : List ℕ)
+ (hBound : ∀ d ∈ digits, d < w) :
+ wotsChecksumValue w digits + digits.sum = digits.length * (w - 1) := by
+ ... | {
"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_10b2270a7777_10 | 6bb55577d9a1ac67 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/WotsChecksum.lean | WotsChecksum | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 1 | [
{
"theorem_name": "wotsChecksum_eq_imp_sum_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hLenEq : dig1.length = dig2.length := hLE.length_eq\n have hIdent1 := wotsChecksumValue_add_sum_eq w dig1 ... | [
{
"name": "wotsChecksumValue_add_sum_eq",
"text": "theorem wotsChecksumValue_add_sum_eq (w : ℕ) (digits : List ℕ)\n (hBound : ∀ d ∈ digits, d < w) :\n wotsChecksumValue w digits + digits.sum = digits.length * (w - 1) := by\n rw [wotsChecksumValue]\n induction digits with\n | nil => simp\n | cons d... | [
{
"name": "wots_fullDigits_pointwiseLE_imp_dig_eq",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 16,
"n_lines": 30,
"n_chars": 1542,
"n_subproofs": 8,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 3,
"automation_onl... | 15 | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | @@ -281,6 +281,29 @@
def wotsFullDigits (dig : List ℕ) (w _l1 l2 : ℕ) : List ℕ :=
dig ++ digitsOfBaseW (wotsChecksumValue w dig) w l2
+theorem wotsChecksumValue_add_sum_eq (w : ℕ) (digits : List ℕ)
+ (hBound : ∀ d ∈ digits, d < w) :
+ wotsChecksumValue w digits + digits.sum = digits.length * (w - 1) := by
+... | {
"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_10b2270a7777_11 | f5a9462f90b796a6 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/WotsChecksum.lean | WotsChecksum | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 1 | [
{
"theorem_name": "wotsChecksumValue_antitone",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [wotsChecksumValue, wotsChecksumValue]\n exact (Forall₂_map_checksum_rev hLE hBound1 hBound2).sum_le",
"... | [
{
"name": "Forall₂_map_checksum_rev",
"text": "/-- `Forall₂ (≤) (map f dig2) (map f dig1)` helper for the antitone lemma. -/\nprivate theorem Forall₂_map_checksum_rev {dig1 dig2 : List ℕ} {w : ℕ}\n (hLE : Forall₂ (· ≤ ·) dig1 dig2)\n (hBound1 : ∀ d ∈ dig1, d < w) (hBound2 : ∀ d ∈ dig2, d < w) :\n F... | [
{
"name": "wots_fullDigits_incomparable",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 17,
"n_lines": 17,
"n_chars": 932,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
... | 16 | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | @@ -304,10 +304,28 @@
rw [h_all]
simp [List.length_cons, Nat.succ_mul, Nat.add_comm]
+/-- `Forall₂ (≤) (map f dig2) (map f dig1)` helper for the antitone lemma. -/
+private theorem Forall₂_map_checksum_rev {dig1 dig2 : List ℕ} {w : ℕ}
+ (hLE : Forall₂ (· ≤ ·) dig1 dig2)
+ (hBound1 : ∀ d ∈ dig1, d < w)... | {
"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_c97748f50ab1_0 | c1c4c3ef15d9a148 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/Constructions/SampleableType.lean | SampleableType | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 3 | [
{
"theorem_name": "probOutput_bind_bijective_uniform_cross",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp_rw [show (($ᵗ α) >>= fun x => g (f x)) = ((f <$> ($ᵗ α)) >>= g) from by simp [monad_norm],\n ... | [
{
"name": "probOutput_map_bijective_uniform_cross",
"text": "/-- Pushing forward uniform sampling along a bijection preserves output probabilities. -/\nlemma probOutput_map_bijective_uniform_cross\n {β : Type} [SampleableType β] [Finite α]\n (f : α → β) (hf : Function.Bijective f) (y : β) :\n Pr[= ... | [
{
"name": "probOutput_bind_bijective_uniform_cross",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 582,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only"... | 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.ProbComp
import VCVio.OracleComp.SimSemantics.SimulateQ
import VCVio.OracleComp.EvalDist
import VCVio.EvalDist.Bool
import VCVio.EvalDist.P... | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.SimulateQ
import VCVio.OracleComp.EvalDist
import VCVio.EvalDist.Bool
import VCVio.EvalDist.P... | @@ -73,13 +73,26 @@
rw [probOutput_map_injective ($ᵗ α) hf.injective x']
exact SampleableType.probOutput_selectElem_eq _ _
+/-- Pushing forward uniform sampling along a bijection preserves output probabilities. -/
+lemma probOutput_map_bijective_uniform_cross
+ {β : Type} [SampleableType β] [Finite α]
+ (... | {
"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_c97748f50ab1_1 | 09693ae2160b6155 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/Constructions/SampleableType.lean | SampleableType | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "probOutput_add_left_uniform",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n probOutput_map_bijective_uniformSample α (hf := AddGroup.addLeft_bijective m) x",
"n_chars": 83,
"n_subpro... | [
{
"name": "probOutput_map_bijective_uniformSample",
"text": "/-- Pushing a uniform sample through a bijection of `α` preserves each output probability. -/\nlemma probOutput_map_bijective_uniformSample\n {f : α → α} (hf : Function.Bijective f) (x : α) :\n Pr[= x | f <$> ($ᵗ α)] = Pr[= x | $ᵗ α] := by\n... | [
{
"name": "probOutput_add_left_uniform",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 369,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"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.ProbComp
import VCVio.OracleComp.SimSemantics.SimulateQ
import VCVio.OracleComp.EvalDist
import VCVio.EvalDist.Bool
import VCVio.EvalDist.P... | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.SimulateQ
import VCVio.OracleComp.EvalDist
import VCVio.EvalDist.Bool
import VCVio.EvalDist.P... | @@ -65,16 +65,26 @@
lemma probOutput_uniformSample_inj (x y : α) : Pr[= x | $ᵗ α] = Pr[= y | $ᵗ α] :=
SampleableType.probOutput_selectElem_eq _ _
+/-- Pushing a uniform sample through a bijection of `α` preserves each output probability. -/
+lemma probOutput_map_bijective_uniformSample
+ {f : α → α} (hf : Func... | {
"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_c97748f50ab1_2 | 8e49cf4cbff91457 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/Constructions/SampleableType.lean | SampleableType | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "probOutput_add_left_uniform",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n probOutput_map_bijective_uniformSample α (hf := AddGroup.addLeft_bijective m) x",
"n_chars": 83,
"n_subpro... | [
{
"name": "probOutput_map_bijective_uniformSample",
"text": "/-- Pushing a uniform sample through a bijection of `α` preserves each output probability. -/\nlemma probOutput_map_bijective_uniformSample\n {f : α → α} (hf : Function.Bijective f) (x : α) :\n Pr[= x | f <$> ($ᵗ α)] = Pr[= x | $ᵗ α] := by\n... | [
{
"name": "probOutput_bind_add_left_uniform",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 587,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false... | 2 | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.SimulateQ
import VCVio.OracleComp.EvalDist
import VCVio.EvalDist.Bool
import VCVio.EvalDist.P... | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.SimulateQ
import VCVio.OracleComp.EvalDist
import VCVio.EvalDist.Bool
import VCVio.EvalDist.P... | @@ -65,10 +65,19 @@
lemma probOutput_uniformSample_inj (x y : α) : Pr[= x | $ᵗ α] = Pr[= y | $ᵗ α] :=
SampleableType.probOutput_selectElem_eq _ _
+/-- Pushing a uniform sample through a bijection of `α` preserves each output probability. -/
+lemma probOutput_map_bijective_uniformSample
+ {f : α → α} (hf : Func... | {
"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_c97748f50ab1_3 | ddf995f61a8f944d | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/Constructions/SampleableType.lean | SampleableType | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "probOutput_add_left_uniform",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n probOutput_map_bijective_uniformSample α (hf := AddGroup.addLeft_bijective m) x",
"n_chars": 83,
"n_subpro... | [
{
"name": "probOutput_map_bijective_uniformSample",
"text": "/-- Pushing a uniform sample through a bijection of `α` preserves each output probability. -/\nlemma probOutput_map_bijective_uniformSample\n {f : α → α} (hf : Function.Bijective f) (x : α) :\n Pr[= x | f <$> ($ᵗ α)] = Pr[= x | $ᵗ α] := by\n... | [
{
"name": "probOutput_bind_add_right_uniform",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 590,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fals... | 2 | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.SimulateQ
import VCVio.OracleComp.EvalDist
import VCVio.EvalDist.Bool
import VCVio.EvalDist.P... | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.SimulateQ
import VCVio.OracleComp.EvalDist
import VCVio.EvalDist.Bool
import VCVio.EvalDist.P... | @@ -65,16 +65,26 @@
lemma probOutput_uniformSample_inj (x y : α) : Pr[= x | $ᵗ α] = Pr[= y | $ᵗ α] :=
SampleableType.probOutput_selectElem_eq _ _
+/-- Pushing a uniform sample through a bijection of `α` preserves each output probability. -/
+lemma probOutput_map_bijective_uniformSample
+ {f : α → α} (hf : Func... | {
"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_c97748f50ab1_4 | ededa6c3f6d38c74 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/Constructions/SampleableType.lean | SampleableType | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "probOutput_add_left_uniform",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n probOutput_map_bijective_uniformSample α (hf := AddGroup.addLeft_bijective m) x",
"n_chars": 83,
"n_subpro... | [
{
"name": "probOutput_map_bijective_uniformSample",
"text": "/-- Pushing a uniform sample through a bijection of `α` preserves each output probability. -/\nlemma probOutput_map_bijective_uniformSample\n {f : α → α} (hf : Function.Bijective f) (x : α) :\n Pr[= x | f <$> ($ᵗ α)] = Pr[= x | $ᵗ α] := by\n... | [
{
"name": "evalDist_add_left_uniform_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 7,
"n_chars": 369,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 3 | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.SimulateQ
import VCVio.OracleComp.EvalDist
import VCVio.EvalDist.Bool
import VCVio.EvalDist.P... | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.SimulateQ
import VCVio.OracleComp.EvalDist
import VCVio.EvalDist.Bool
import VCVio.EvalDist.P... | @@ -65,16 +65,26 @@
lemma probOutput_uniformSample_inj (x y : α) : Pr[= x | $ᵗ α] = Pr[= y | $ᵗ α] :=
SampleableType.probOutput_selectElem_eq _ _
+/-- Pushing a uniform sample through a bijection of `α` preserves each output probability. -/
+lemma probOutput_map_bijective_uniformSample
+ {f : α → α} (hf : Func... | {
"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_c97748f50ab1_5 | 746e08a7a8845b3b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/Constructions/SampleableType.lean | SampleableType | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "probOutput_add_left_uniform",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n probOutput_map_bijective_uniformSample α (hf := AddGroup.addLeft_bijective m) x",
"n_chars": 83,
"n_subpro... | [
{
"name": "probOutput_map_bijective_uniformSample",
"text": "/-- Pushing a uniform sample through a bijection of `α` preserves each output probability. -/\nlemma probOutput_map_bijective_uniformSample\n {f : α → α} (hf : Function.Bijective f) (x : α) :\n Pr[= x | f <$> ($ᵗ α)] = Pr[= x | $ᵗ α] := by\n... | [
{
"name": "evalDist_add_right_uniform_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 7,
"n_chars": 369,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 3 | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.SimulateQ
import VCVio.OracleComp.EvalDist
import VCVio.EvalDist.Bool
import VCVio.EvalDist.P... | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.SimulateQ
import VCVio.OracleComp.EvalDist
import VCVio.EvalDist.Bool
import VCVio.EvalDist.P... | @@ -65,16 +65,26 @@
lemma probOutput_uniformSample_inj (x y : α) : Pr[= x | $ᵗ α] = Pr[= y | $ᵗ α] :=
SampleableType.probOutput_selectElem_eq _ _
+/-- Pushing a uniform sample through a bijection of `α` preserves each output probability. -/
+lemma probOutput_map_bijective_uniformSample
+ {f : α → α} (hf : Func... | {
"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_c97748f50ab1_6 | 69c976566691cf0f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/Constructions/SampleableType.lean | SampleableType | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 3 | [
{
"theorem_name": "probOutput_bind_bijective_uniform_cross",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp_rw [show (($ᵗ α) >>= fun x => g (f x)) = ((f <$> ($ᵗ α)) >>= g) from by simp [monad_norm],\n ... | [
{
"name": "probOutput_map_bijective_uniform_cross",
"text": "/-- Pushing forward uniform sampling along a bijection preserves output probabilities. -/\nlemma probOutput_map_bijective_uniform_cross\n {β : Type} [SampleableType β] [Finite α]\n (f : α → β) (hf : Function.Bijective f) (y : β) :\n Pr[= ... | [
{
"name": "evalDist_map_bijective_uniform_cross",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 370,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": fa... | 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.ProbComp
import VCVio.OracleComp.SimSemantics.SimulateQ
import VCVio.OracleComp.EvalDist
import VCVio.EvalDist.Bool
import VCVio.EvalDist.P... | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.SimulateQ
import VCVio.OracleComp.EvalDist
import VCVio.EvalDist.Bool
import VCVio.EvalDist.P... | @@ -73,6 +73,17 @@
rw [probOutput_map_injective ($ᵗ α) hf.injective x']
exact SampleableType.probOutput_selectElem_eq _ _
+/-- Pushing forward uniform sampling along a bijection preserves output probabilities. -/
+lemma probOutput_map_bijective_uniform_cross
+ {β : Type} [SampleableType β] [Finite α]
+ (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_c97748f50ab1_7 | 9f31dffd2bc2975a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/Constructions/SampleableType.lean | SampleableType | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 3 | [
{
"theorem_name": "probOutput_bind_bijective_uniform_cross",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp_rw [show (($ᵗ α) >>= fun x => g (f x)) = ((f <$> ($ᵗ α)) >>= g) from by simp [monad_norm],\n ... | [
{
"name": "probOutput_map_bijective_uniform_cross",
"text": "/-- Pushing forward uniform sampling along a bijection preserves output probabilities. -/\nlemma probOutput_map_bijective_uniform_cross\n {β : Type} [SampleableType β] [Finite α]\n (f : α → β) (hf : Function.Bijective f) (y : β) :\n Pr[= ... | [
{
"name": "evalDist_bind_bijective_add_right_uniform",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 20,
"n_chars": 1305,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 0,
"automation_on... | 5 | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.SimulateQ
import VCVio.OracleComp.EvalDist
import VCVio.EvalDist.Bool
import VCVio.EvalDist.P... | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.SimulateQ
import VCVio.OracleComp.EvalDist
import VCVio.EvalDist.Bool
import VCVio.EvalDist.P... | @@ -73,6 +73,17 @@
rw [probOutput_map_injective ($ᵗ α) hf.injective x']
exact SampleableType.probOutput_selectElem_eq _ _
+/-- Pushing forward uniform sampling along a bijection preserves output probabilities. -/
+lemma probOutput_map_bijective_uniform_cross
+ {β : Type} [SampleableType β] [Finite α]
+ (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_c97748f50ab1_8 | 3161ce025fc60dfd | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/Constructions/SampleableType.lean | SampleableType | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 3 | [
{
"theorem_name": "probOutput_bind_bijective_uniform_cross",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp_rw [show (($ᵗ α) >>= fun x => g (f x)) = ((f <$> ($ᵗ α)) >>= g) from by simp [monad_norm],\n ... | [
{
"name": "probOutput_map_bijective_uniform_cross",
"text": "/-- Pushing forward uniform sampling along a bijection preserves output probabilities. -/\nlemma probOutput_map_bijective_uniform_cross\n {β : Type} [SampleableType β] [Finite α]\n (f : α → β) (hf : Function.Bijective f) (y : β) :\n Pr[= ... | [
{
"name": "evalDist_bind_bijective_add_right_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 12,
"n_chars": 738,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": f... | 6 | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.SimulateQ
import VCVio.OracleComp.EvalDist
import VCVio.EvalDist.Bool
import VCVio.EvalDist.P... | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.SimulateQ
import VCVio.OracleComp.EvalDist
import VCVio.EvalDist.Bool
import VCVio.EvalDist.P... | @@ -73,6 +73,17 @@
rw [probOutput_map_injective ($ᵗ α) hf.injective x']
exact SampleableType.probOutput_selectElem_eq _ _
+/-- Pushing forward uniform sampling along a bijection preserves output probabilities. -/
+lemma probOutput_map_bijective_uniform_cross
+ {β : Type} [SampleableType β] [Finite α]
+ (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_c97748f50ab1_9 | 4381ef3504d6e853 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/Constructions/SampleableType.lean | SampleableType | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "support_uniformSample_nonempty",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [Set.nonempty_iff_ne_empty]\n intro h\n rw [← probFailure_eq_one_iff, probFailure_uniformSample] at h\n... | [
{
"name": "probFailure_uniformSample",
"text": "lemma probFailure_uniformSample : Pr[⊥ | $ᵗ α] = 0 := by aesop\n\n",
"fan_in": 1,
"n_lines": 3,
"n_chars": 69,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"au... | [
{
"name": "support_uniformSample_nonempty",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 484,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"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.ProbComp
import VCVio.OracleComp.SimSemantics.SimulateQ
import VCVio.OracleComp.EvalDist
import VCVio.EvalDist.Bool
import VCVio.EvalDist.P... | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.SimulateQ
import VCVio.OracleComp.EvalDist
import VCVio.EvalDist.Bool
import VCVio.EvalDist.P... | @@ -99,6 +99,8 @@
𝒟[((· + m) : α → α) <$> ($ᵗ α)] = 𝒟[$ᵗ α] :=
evalDist_ext (probOutput_add_right_uniform (α := α) m)
+lemma probFailure_uniformSample : Pr[⊥ | $ᵗ α] = 0 := by aesop
+
@[simp] instance : NeverFail ($ᵗ α) := inferInstance
@[simp, grind =]
@@ -113,7 +115,11 @@
Tagged `@[grind]` rather tha... | {
"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_77006878088b_0 | 9e765fd458831c9d | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Control/Monad/RelWP.lean | RelWP | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 4 | [
{
"theorem_name": "rwp_consequence_rel",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n PartialOrder.rel_trans h' (rwp_consequence x y post post' epost₁ epost₂ h)",
"n_chars": 81,
"n_subproofs": 0,
... | [
{
"name": "rwp_consequence",
"text": "/-- Consequence rule for the joint normal postcondition. -/\ntheorem rwp_consequence\n (x : m₁ α) (y : m₂ β) (post post' : α → β → Pred)\n (epost₁ : EPred₁) (epost₂ : EPred₂)\n (h : ∀ a b, post a b ⊑ post' a b) :\n rwp x y post epost₁ epost₂ ⊑ rwp x y post' ... | [
{
"name": "rwp_consequence_rel",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 834,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_ne... | 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 Loom.WP.Basic
@[expose] public section
/-!
# Relational Weakest Precondition Interpretation (Loom2-style)
This module defines the relational analogue o... | /-
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 Loom.WP.Basic
@[expose] public section
/-!
# Relational Weakest Precondition Interpretation (Loom2-style)
This module defines the relational analogue o... | @@ -205,6 +205,15 @@
`Loom.WP.Basic`.
-/
+/-- Consequence rule for the joint normal postcondition. -/
+theorem rwp_consequence
+ (x : m₁ α) (y : m₂ β) (post post' : α → β → Pred)
+ (epost₁ : EPred₁) (epost₂ : EPred₂)
+ (h : ∀ a b, post a b ⊑ post' a b) :
+ rwp x y post epost₁ epost₂ ⊑ rwp x y post' epos... | {
"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_77006878088b_1 | 65d5691e95aa814d | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Control/Monad/RelWP.lean | RelWP | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "rwp_bind_left_le",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := rwp_bind_le (γ := γ) (δ := β)\n (m₁ := m₁) (m₂ := m₂) x y f (fun b : β => (pure b : m₂ β))\n post epost₁ e... | [
{
"name": "rwp_bind_le",
"text": "/-- Bind rule: iterated relational WP is below the relational WP of the\njoint `>>=`. -/\ntheorem rwp_bind_le\n (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)\n (post : γ → δ → Pred) (epost₁ : EPred₁) (epost₂ : EPred₂) :\n rwp x y (fun a b => rwp (f a) (g b) p... | [
{
"name": "rwp_bind_left_le",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 554,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesti... | 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 Loom.WP.Basic
@[expose] public section
/-!
# Relational Weakest Precondition Interpretation (Loom2-style)
This module defines the relational analogue o... | /-
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 Loom.WP.Basic
@[expose] public section
/-!
# Relational Weakest Precondition Interpretation (Loom2-style)
This module defines the relational analogue o... | @@ -205,12 +205,25 @@
`Loom.WP.Basic`.
-/
+/-- Bind rule: iterated relational WP is below the relational WP of the
+joint `>>=`. -/
+theorem rwp_bind_le
+ (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)
+ (post : γ → δ → Pred) (epost₁ : EPred₁) (epost₂ : EPred₂) :
+ rwp x y (fun a b => rwp (f a) (g b) ... | {
"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_77006878088b_2 | be780afa91458cb1 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Control/Monad/RelWP.lean | RelWP | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "rwp_bind_left_le",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := rwp_bind_le (γ := γ) (δ := β)\n (m₁ := m₁) (m₂ := m₂) x y f (fun b : β => (pure b : m₂ β))\n post epost₁ e... | [
{
"name": "rwp_bind_le",
"text": "/-- Bind rule: iterated relational WP is below the relational WP of the\njoint `>>=`. -/\ntheorem rwp_bind_le\n (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)\n (post : γ → δ → Pred) (epost₁ : EPred₁) (epost₂ : EPred₂) :\n rwp x y (fun a b => rwp (f a) (g b) p... | [
{
"name": "rwp_bind_right_le",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 555,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nest... | 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 Loom.WP.Basic
@[expose] public section
/-!
# Relational Weakest Precondition Interpretation (Loom2-style)
This module defines the relational analogue o... | /-
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 Loom.WP.Basic
@[expose] public section
/-!
# Relational Weakest Precondition Interpretation (Loom2-style)
This module defines the relational analogue o... | @@ -205,12 +205,25 @@
`Loom.WP.Basic`.
-/
+/-- Bind rule: iterated relational WP is below the relational WP of the
+joint `>>=`. -/
+theorem rwp_bind_le
+ (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)
+ (post : γ → δ → Pred) (epost₁ : EPred₁) (epost₂ : EPred₂) :
+ rwp x y (fun a b => rwp (f a) (g b) ... | {
"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_77006878088b_3 | 41499fffcbaf7749 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Control/Monad/RelWP.lean | RelWP | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "relTriple_conseq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n PartialOrder.rel_trans hpre\n (PartialOrder.rel_trans h\n (RelWP.rwp_consequence_econs x y post post' epost₁ epost₁' ... | [
{
"name": "rwp_consequence_econs",
"text": "/-- Consequence rule on both exception postconditions plus the joint\nnormal postcondition. -/\ntheorem rwp_consequence_econs\n (x : m₁ α) (y : m₂ β) (post post' : α → β → Pred)\n (epost₁ epost₁' : EPred₁) (epost₂ epost₂' : EPred₂)\n (h : ∀ a b, post a b ... | [
{
"name": "relTriple_conseq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 660,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesti... | 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 Loom.WP.Basic
@[expose] public section
/-!
# Relational Weakest Precondition Interpretation (Loom2-style)
This module defines the relational analogue o... | /-
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 Loom.WP.Basic
@[expose] public section
/-!
# Relational Weakest Precondition Interpretation (Loom2-style)
This module defines the relational analogue o... | @@ -205,6 +205,16 @@
`Loom.WP.Basic`.
-/
+/-- Consequence rule on both exception postconditions plus the joint
+normal postcondition. -/
+theorem rwp_consequence_econs
+ (x : m₁ α) (y : m₂ β) (post post' : α → β → Pred)
+ (epost₁ epost₁' : EPred₁) (epost₂ epost₂' : EPred₂)
+ (h : ∀ a b, post a b ⊑ post' 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_77006878088b_4 | 5ebb3174bcc6402f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Control/Monad/RelWP.lean | RelWP | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "relTriple_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n PartialOrder.rel_trans hpre (RelWP.rwp_pure a b post epost₁ epost₂)",
"n_chars": 74,
"n_subproofs": 0,
"n_tactics":... | [
{
"name": "rwp_pure",
"text": "/-- Pure rule: the joint postcondition at `(a, b)` is below the\nrelational WP of `(pure a, pure b)`. -/\ntheorem rwp_pure (a : α) (b : β) (post : α → β → Pred)\n (epost₁ : EPred₁) (epost₂ : EPred₂) :\n post a b ⊑ rwp (pure a : m₁ α) (pure b : m₂ β) post epost₁ epost₂ :=... | [
{
"name": "relTriple_pure",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 363,
"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
-/
module
public import Loom.WP.Basic
@[expose] public section
/-!
# Relational Weakest Precondition Interpretation (Loom2-style)
This module defines the relational analogue o... | /-
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 Loom.WP.Basic
@[expose] public section
/-!
# Relational Weakest Precondition Interpretation (Loom2-style)
This module defines the relational analogue o... | @@ -205,6 +205,13 @@
`Loom.WP.Basic`.
-/
+/-- Pure rule: the joint postcondition at `(a, b)` is below the
+relational WP of `(pure a, pure b)`. -/
+theorem rwp_pure (a : α) (b : β) (post : α → β → Pred)
+ (epost₁ : EPred₁) (epost₂ : EPred₂) :
+ post a b ⊑ rwp (pure a : m₁ α) (pure b : m₂ β) post epost₁ epost₂... | {
"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_77006878088b_5 | 0a9cf829a3f6e473 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Control/Monad/RelWP.lean | RelWP | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "rwp_bind_left_le",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := rwp_bind_le (γ := γ) (δ := β)\n (m₁ := m₁) (m₂ := m₂) x y f (fun b : β => (pure b : m₂ β))\n post epost₁ e... | [
{
"name": "rwp_bind_le",
"text": "/-- Bind rule: iterated relational WP is below the relational WP of the\njoint `>>=`. -/\ntheorem rwp_bind_le\n (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)\n (post : γ → δ → Pred) (epost₁ : EPred₁) (epost₂ : EPred₂) :\n rwp x y (fun a b => rwp (f a) (g b) p... | [
{
"name": "relTriple_bind",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 757,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"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
-/
module
public import Loom.WP.Basic
@[expose] public section
/-!
# Relational Weakest Precondition Interpretation (Loom2-style)
This module defines the relational analogue o... | /-
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 Loom.WP.Basic
@[expose] public section
/-!
# Relational Weakest Precondition Interpretation (Loom2-style)
This module defines the relational analogue o... | @@ -205,6 +205,15 @@
`Loom.WP.Basic`.
-/
+/-- Bind rule: iterated relational WP is below the relational WP of the
+joint `>>=`. -/
+theorem rwp_bind_le
+ (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)
+ (post : γ → δ → Pred) (epost₁ : EPred₁) (epost₂ : EPred₂) :
+ rwp x y (fun a b => rwp (f a) (g b) 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_77006878088b_6 | e6eddf1fedaac34d | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Control/Monad/RelWP.lean | RelWP | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "rwp_bind_left_le",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := rwp_bind_le (γ := γ) (δ := β)\n (m₁ := m₁) (m₂ := m₂) x y f (fun b : β => (pure b : m₂ β))\n post epost₁ e... | [
{
"name": "rwp_bind_le",
"text": "/-- Bind rule: iterated relational WP is below the relational WP of the\njoint `>>=`. -/\ntheorem rwp_bind_le\n (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)\n (post : γ → δ → Pred) (epost₁ : EPred₁) (epost₂ : EPred₂) :\n rwp x y (fun a b => rwp (f a) (g b) p... | [
{
"name": "relTriple_bind_left",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 759,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_ne... | 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 Loom.WP.Basic
@[expose] public section
/-!
# Relational Weakest Precondition Interpretation (Loom2-style)
This module defines the relational analogue o... | /-
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 Loom.WP.Basic
@[expose] public section
/-!
# Relational Weakest Precondition Interpretation (Loom2-style)
This module defines the relational analogue o... | @@ -205,6 +205,15 @@
`Loom.WP.Basic`.
-/
+/-- Bind rule: iterated relational WP is below the relational WP of the
+joint `>>=`. -/
+theorem rwp_bind_le
+ (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)
+ (post : γ → δ → Pred) (epost₁ : EPred₁) (epost₂ : EPred₂) :
+ rwp x y (fun a b => rwp (f a) (g b) 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_77006878088b_7 | 83c59af1bda5f061 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Control/Monad/RelWP.lean | RelWP | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "rwp_bind_left_le",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := rwp_bind_le (γ := γ) (δ := β)\n (m₁ := m₁) (m₂ := m₂) x y f (fun b : β => (pure b : m₂ β))\n post epost₁ e... | [
{
"name": "rwp_bind_le",
"text": "/-- Bind rule: iterated relational WP is below the relational WP of the\njoint `>>=`. -/\ntheorem rwp_bind_le\n (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)\n (post : γ → δ → Pred) (epost₁ : EPred₁) (epost₂ : EPred₂) :\n rwp x y (fun a b => rwp (f a) (g b) p... | [
{
"name": "relTriple_bind_right",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 762,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_n... | 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 Loom.WP.Basic
@[expose] public section
/-!
# Relational Weakest Precondition Interpretation (Loom2-style)
This module defines the relational analogue o... | /-
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 Loom.WP.Basic
@[expose] public section
/-!
# Relational Weakest Precondition Interpretation (Loom2-style)
This module defines the relational analogue o... | @@ -205,6 +205,15 @@
`Loom.WP.Basic`.
-/
+/-- Bind rule: iterated relational WP is below the relational WP of the
+joint `>>=`. -/
+theorem rwp_bind_le
+ (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)
+ (post : γ → δ → Pred) (epost₁ : EPred₁) (epost₂ : EPred₂) :
+ rwp x y (fun a b => rwp (f a) (g b) 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_bd1423cc41f2_0 | 28112847e47472f6 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/ProbComp.lean | ProbComp | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 3 | [
{
"theorem_name": "support_uniformSelectVector",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n ext x\n simp [uniformSelectVector_def, Vector.mem_iff_getElem, Fin.exists_iff]",
"n_chars": 84,
"n_sub... | [
{
"name": "uniformSelectVector_def",
"text": "lemma uniformSelectVector_def : $! xs = (xs[·]) <$> $[0..n] := rfl\n\n",
"fan_in": 3,
"n_lines": 3,
"n_chars": 69,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"... | [
{
"name": "support_uniformSelectVector",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 181,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"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.EvalDist
import Batteries.Control.OptionT
/-!
# Computations with Uniform Selection Oracles
This file defines a type `ProbComp α` for the... | /-
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.EvalDist
import Batteries.Control.OptionT
/-!
# Computations with Uniform Selection Oracles
This file defines a type `ProbComp α` for the... | @@ -273,8 +273,12 @@
variable {α : Type} {n : ℕ} (xs : Vector α (n + 1))
+lemma uniformSelectVector_def : $! xs = (xs[·]) <$> $[0..n] := rfl
+
@[simp, grind =]
-lemma support_uniformSelectVector : support ($! xs) = {x | x ∈ xs.toList} := sorry
+lemma support_uniformSelectVector : support ($! xs) = {x | x ∈ xs.toL... | {
"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_bd1423cc41f2_1 | 7fcaf1d2b68f412b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/ProbComp.lean | ProbComp | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "probOutput_uniformSelectListVector",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [uniformSelectListVector_def, probOutput_map_eq_sum_finSupport_ite, div_eq_mul_inv,\n ← List.Vec... | [
{
"name": "uniformSelectListVector_def",
"text": "lemma uniformSelectListVector_def : $! xs = (xs[·]) <$> $[0..n] := rfl\n\n",
"fan_in": 2,
"n_lines": 3,
"n_chars": 73,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": ... | [
{
"name": "probOutput_uniformSelectListVector",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 269,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true... | 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.EvalDist
import Batteries.Control.OptionT
/-!
# Computations with Uniform Selection Oracles
This file defines a type `ProbComp α` for the... | /-
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.EvalDist
import Batteries.Control.OptionT
/-!
# Computations with Uniform Selection Oracles
This file defines a type `ProbComp α` for the... | @@ -309,13 +309,19 @@
variable {α : Type} {n : ℕ} (xs : List.Vector α (n + 1))
+lemma uniformSelectListVector_def : $! xs = (xs[·]) <$> $[0..n] := rfl
+
@[simp, grind =]
lemma probOutput_uniformSelectListVector [DecidableEq α] (x : α) :
- Pr[= x | $! xs] = xs.toList.count x / (n + 1) := sorry
+ Pr[= 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_bd1423cc41f2_2 | d44969dd91a78120 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/ProbComp.lean | ProbComp | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 5 | [
{
"theorem_name": "support_uniformSelectFinset",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n aesop (add norm uniformSelectFinset_def)",
"n_chars": 46,
"n_subproofs": 0,
"n_tactics": 2,
"cy... | [
{
"name": "uniformSelectFinset_def",
"text": "lemma uniformSelectFinset_def : $ s = $ s.toList := rfl\n\n",
"fan_in": 5,
"n_lines": 3,
"n_chars": 57,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_... | [
{
"name": "support_uniformSelectFinset",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"... | 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.EvalDist
import Batteries.Control.OptionT
/-!
# Computations with Uniform Selection Oracles
This file defines a type `ProbComp α` for the... | /-
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.EvalDist
import Batteries.Control.OptionT
/-!
# Computations with Uniform Selection Oracles
This file defines a type `ProbComp α` for the... | @@ -336,25 +336,34 @@
variable {α : Type} (s : Finset α)
+lemma uniformSelectFinset_def : $ s = $ s.toList := rfl
+
@[simp, grind =]
lemma support_uniformSelectFinset :
- support ($ s) = if s.Nonempty then ↑s else ∅ := sorry
+ support ($ s) = if s.Nonempty then ↑s else ∅ := by
+ aesop (add norm uniformSel... | {
"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_bd1423cc41f2_3 | 0a4ef61c605aa5ae | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/ProbComp.lean | ProbComp | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "support_uniformSelectMultiset",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n ext x; simp [uniformSelectMultiset_def, Multiset.mem_toList]",
"n_chars": 66,
"n_subproofs": 0,
"... | [
{
"name": "uniformSelectMultiset_def",
"text": "lemma uniformSelectMultiset_def : ($ s : OptionT ProbComp α) = $ s.toList := rfl\n\n",
"fan_in": 4,
"n_lines": 3,
"n_chars": 83,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_struc... | [
{
"name": "support_uniformSelectMultiset",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 159,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"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.EvalDist
import Batteries.Control.OptionT
/-!
# Computations with Uniform Selection Oracles
This file defines a type `ProbComp α` for the... | /-
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.EvalDist
import Batteries.Control.OptionT
/-!
# Computations with Uniform Selection Oracles
This file defines a type `ProbComp α` for the... | @@ -425,9 +425,12 @@
variable {α : Type} (s : Multiset α)
+lemma uniformSelectMultiset_def : ($ s : OptionT ProbComp α) = $ s.toList := rfl
+
@[simp, grind =]
lemma support_uniformSelectMultiset :
- support ($ s) = {x | x ∈ s} := sorry
+ support ($ s) = {x | x ∈ s} := by
+ ext x; simp [uniformSelectMultis... | {
"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_43ed1ad08239_0 | 8573627b3755be1b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/RandomOracle/Eager.lean | Eager | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "eagerRandomOracle_evalDist_generateSeed_bind_step_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hih : ∀ u, ∑' seed, Pr[= seed | generateSeed spec₀ qc js] *\n Pr[= x | (s... | [
{
"name": "eagerRandomOracle_run'_nil",
"text": "/-- Helper: the `run'` of the eager oracle bind reduces to uniform sampling\nwhen `seed t = []`. -/\nprivate lemma eagerRandomOracle_run'_nil {ι₀ : Type} [DecidableEq ι₀]\n {spec₀ : OracleSpec.{0, 0} ι₀} [∀ t : spec₀.Domain, SampleableType (spec₀.Range t)]... | [
{
"name": "eagerRandomOracle_evalDist_generateSeed_bind_step_zero",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 40,
"n_chars": 2424,
"n_subproofs": 3,
"n_tactics": 27,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 5,
"n_structural": 4,
... | 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.Constructions.GenerateSeed
/-!
# Eager Random Oracle
The eager random oracle serves answers from a pre-generated `QuerySeed`, consuming v... | /-
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.Constructions.GenerateSeed
/-!
# Eager Random Oracle
The eager random oracle serves answers from a pre-generated `QuerySeed`, consuming v... | @@ -53,6 +53,24 @@
end eagerRandomOracle
+/-- Helper: the `run'` of the eager oracle bind reduces to uniform sampling
+when `seed t = []`. -/
+private lemma eagerRandomOracle_run'_nil {ι₀ : Type} [DecidableEq ι₀]
+ {spec₀ : OracleSpec.{0, 0} ι₀} [∀ t : spec₀.Domain, SampleableType (spec₀.Range t)]
+ {α : Typ... | {
"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_43ed1ad08239_1 | fe11de6c21cfe4ee | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/RandomOracle/Eager.lean | Eager | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "eagerRandomOracle_evalDist_generateSeed_bind_step_pos",
"depth": 1,
"n_commands": 0,
"n_lines": 36,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hstep : ∀ seed,\n Pr[= seed | generateSeed spec₀ qc js] *\n Pr[= x ... | [
{
"name": "eagerRandomOracle_run'_cons",
"text": "/-- Helper: the `run'` of the eager oracle bind consumes the head\nwhen `seed t = u :: us`. -/\nprivate lemma eagerRandomOracle_run'_cons {ι₀ : Type} [DecidableEq ι₀]\n {spec₀ : OracleSpec.{0, 0} ι₀} [∀ t : spec₀.Domain, SampleableType (spec₀.Range t)]\n ... | [
{
"name": "eagerRandomOracle_evalDist_generateSeed_bind_step_pos",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 53,
"n_chars": 2943,
"n_subproofs": 4,
"n_tactics": 41,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 7,
"n_structural": 8,
"... | 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.Constructions.GenerateSeed
/-!
# Eager Random Oracle
The eager random oracle serves answers from a pre-generated `QuerySeed`, consuming v... | /-
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.Constructions.GenerateSeed
/-!
# Eager Random Oracle
The eager random oracle serves answers from a pre-generated `QuerySeed`, consuming v... | @@ -53,6 +53,25 @@
end eagerRandomOracle
+/-- Helper: the `run'` of the eager oracle bind consumes the head
+when `seed t = u :: us`. -/
+private lemma eagerRandomOracle_run'_cons {ι₀ : Type} [DecidableEq ι₀]
+ {spec₀ : OracleSpec.{0, 0} ι₀} [∀ t : spec₀.Domain, SampleableType (spec₀.Range t)]
+ {α : Type} (... | {
"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_43ed1ad08239_2 | 70f0602add3d6109 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/RandomOracle/Eager.lean | Eager | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "eagerRandomOracle_evalDist_generateSeed_bind_step_pos",
"depth": 1,
"n_commands": 0,
"n_lines": 36,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hstep : ∀ seed,\n Pr[= seed | generateSeed spec₀ qc js] *\n Pr[= x ... | [
{
"name": "eagerRandomOracle_run'_cons",
"text": "/-- Helper: the `run'` of the eager oracle bind consumes the head\nwhen `seed t = u :: us`. -/\nprivate lemma eagerRandomOracle_run'_cons {ι₀ : Type} [DecidableEq ι₀]\n {spec₀ : OracleSpec.{0, 0} ι₀} [∀ t : spec₀.Domain, SampleableType (spec₀.Range t)]\n ... | [
{
"name": "eagerRandomOracle_evalDist_generateSeed_bind",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 33,
"n_chars": 1702,
"n_subproofs": 1,
"n_tactics": 24,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 9,
"automatio... | 4 | /-
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.Constructions.GenerateSeed
/-!
# Eager Random Oracle
The eager random oracle serves answers from a pre-generated `QuerySeed`, consuming v... | /-
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.Constructions.GenerateSeed
/-!
# Eager Random Oracle
The eager random oracle serves answers from a pre-generated `QuerySeed`, consuming v... | @@ -71,6 +71,25 @@
rw [ht]
rw [h]; simp
+/-- Helper: the `run'` of the eager oracle bind consumes the head
+when `seed t = u :: us`. -/
+private lemma eagerRandomOracle_run'_cons {ι₀ : Type} [DecidableEq ι₀]
+ {spec₀ : OracleSpec.{0, 0} ι₀} [∀ t : spec₀.Domain, SampleableType (spec₀.Range t)]
+ {α : Typ... | {
"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_82d09a1ed3c8_0 | 643fc8403771dc5b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/OneTimePad/HeapBasic.lean | HeapBasic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "realImpl_impl_evalDist_idealImpl",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases q with\n | enc m =>\n change 𝒟[if h .used then (pure (0#sp, h) : OracleComp unifSpec _)\n ... | [
{
"name": "bitVec_xor_right_bijective",
"text": "/-- Right XOR by a fixed mask is a bijection on `BitVec sp`: it is its\nown inverse via `(a ^^^ m) ^^^ m = a`. The key arithmetic fact behind\nOTP perfect secrecy. -/\nprivate lemma bitVec_xor_right_bijective (sp : ℕ) (m : BitVec sp) :\n Function.Bijective... | [
{
"name": "realImpl_impl_evalDist_idealImpl",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 44,
"n_chars": 1880,
"n_subproofs": 0,
"n_tactics": 20,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 4,
"automation_only": fal... | 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.StateSeparating.DistEquiv
import VCVio.OracleComp.Constructions.BitVec
import ToMathlib.Data.Heap
/-!
# One-Time Pad as a state-separating handler
Pilot port of ... | /-
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.StateSeparating.DistEquiv
import VCVio.OracleComp.Constructions.BitVec
import ToMathlib.Data.Heap
/-!
# One-Time Pad as a state-separating handler
Pilot port of ... | @@ -149,6 +149,26 @@
/-! ## XOR-by-`m` is a bijection on `BitVec sp` -/
+/-- Right XOR by a fixed mask is a bijection on `BitVec sp`: it is its
+own inverse via `(a ^^^ m) ^^^ m = a`. The key arithmetic fact behind
+OTP perfect secrecy. -/
+private lemma bitVec_xor_right_bijective (sp : ℕ) (m : BitVec sp) :
+ 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_82d09a1ed3c8_1 | 2ee3c7dd0e8c391c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/OneTimePad/HeapBasic.lean | HeapBasic | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "realImpl_impl_evalDist_idealImpl",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases q with\n | enc m =>\n change 𝒟[if h .used then (pure (0#sp, h) : OracleComp unifSpec _)\n ... | [
{
"name": "bitVec_xor_right_bijective",
"text": "/-- Right XOR by a fixed mask is a bijection on `BitVec sp`: it is its\nown inverse via `(a ^^^ m) ^^^ m = a`. The key arithmetic fact behind\nOTP perfect secrecy. -/\nprivate lemma bitVec_xor_right_bijective (sp : ℕ) (m : BitVec sp) :\n Function.Bijective... | [
{
"name": "realImpl_distEquiv_idealImpl",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 15,
"n_chars": 629,
"n_subproofs": 0,
"n_tactics": 1,
"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.StateSeparating.DistEquiv
import VCVio.OracleComp.Constructions.BitVec
import ToMathlib.Data.Heap
/-!
# One-Time Pad as a state-separating handler
Pilot port of ... | /-
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.StateSeparating.DistEquiv
import VCVio.OracleComp.Constructions.BitVec
import ToMathlib.Data.Heap
/-!
# One-Time Pad as a state-separating handler
Pilot port of ... | @@ -149,6 +149,26 @@
/-! ## XOR-by-`m` is a bijection on `BitVec sp` -/
+/-- Right XOR by a fixed mask is a bijection on `BitVec sp`: it is its
+own inverse via `(a ^^^ m) ^^^ m = a`. The key arithmetic fact behind
+OTP perfect secrecy. -/
+private lemma bitVec_xor_right_bijective (sp : ℕ) (m : BitVec sp) :
+ 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_82d09a1ed3c8_2 | 1d59af39b29a4457 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/OneTimePad/HeapBasic.lean | HeapBasic | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "realImpl_impl_evalDist_idealImpl",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases q with\n | enc m =>\n change 𝒟[if h .used then (pure (0#sp, h) : OracleComp unifSpec _)\n ... | [
{
"name": "bitVec_xor_right_bijective",
"text": "/-- Right XOR by a fixed mask is a bijection on `BitVec sp`: it is its\nown inverse via `(a ^^^ m) ^^^ m = a`. The key arithmetic fact behind\nOTP perfect secrecy. -/\nprivate lemma bitVec_xor_right_bijective (sp : ℕ) (m : BitVec sp) :\n Function.Bijective... | [
{
"name": "evalDist_run_encOnce_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 17,
"n_chars": 832,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"ma... | 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.StateSeparating.DistEquiv
import VCVio.OracleComp.Constructions.BitVec
import ToMathlib.Data.Heap
/-!
# One-Time Pad as a state-separating handler
Pilot port of ... | /-
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.StateSeparating.DistEquiv
import VCVio.OracleComp.Constructions.BitVec
import ToMathlib.Data.Heap
/-!
# One-Time Pad as a state-separating handler
Pilot port of ... | @@ -149,6 +149,26 @@
/-! ## XOR-by-`m` is a bijection on `BitVec sp` -/
+/-- Right XOR by a fixed mask is a bijection on `BitVec sp`: it is its
+own inverse via `(a ^^^ m) ^^^ m = a`. The key arithmetic fact behind
+OTP perfect secrecy. -/
+private lemma bitVec_xor_right_bijective (sp : ℕ) (m : BitVec sp) :
+ 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_0b9304e2534d_0 | 67fb9991341bbcae | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Interop/Rust/Run.lean | Run | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "run_run_liftM",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := run_run_bind_liftM (spec := spec) oa\n (k := fun a => (pure a : Interop.Rust.RustOracleComp spec α))\n simp onl... | [
{
"name": "run_run_bind_liftM",
"text": "/-! ### Peel `.run.run` through `liftM`-bind\n\nThe core peel lemma: when a `RustOracleComp` program starts with a lifted\noracle call and continues with `>>= k`, running both transformer layers\nproduces the underlying `OracleComp` bind with the continuation's\n`.ru... | [
{
"name": "run_run_liftM",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 15,
"n_chars": 644,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"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 Interop.Rust.Common
/-!
# Peeling the `RustOracleComp` transformer stack
The canonical intermediate form for any probabilistic / support / `evalDist`
claim on `RustOr... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Interop.Rust.Common
/-!
# Peeling the `RustOracleComp` transformer stack
The canonical intermediate form for any probabilistic / support / `evalDist`
claim on `RustOr... | @@ -84,6 +84,26 @@
OracleComp spec (Option (Except Interop.Rust.Error α))) :=
rfl
+/-! ### Peel `.run.run` through `liftM`-bind
+
+The core peel lemma: when a `RustOracleComp` program starts with a lifted
+oracle call and continues with `>>= k`, running both transformer layers
+produces the underlying `... | {
"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_35253487d75f_0 | 7fa9a93869c3393d | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Vector/Completeness.lean | Completeness | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "functional_completeness",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n with\n | zero =>\n simp [Fin.eq_zero i, buildMerkleTree_with_hash, getPutativeRoot_with_hash, getR... | [
{
"name": "buildLayer_with_hash_get_aux",
"text": "private lemma buildLayer_with_hash_get_aux {n : ℕ} (leaves : List.Vector α (2 ^ (n + 1)))\n (i : Fin (2 ^ (n + 1))) (hashFn : α × α → α)\n (a b : Fin (2 ^ (n + 1))) (ha : a.val = 2 * (i.val / 2)) (hb : b.val = 2 * (i.val / 2) + 1) :\n hashFn (leave... | [
{
"name": "functional_completeness",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 26,
"n_chars": 1421,
"n_subproofs": 2,
"n_tactics": 19,
"cyclomatic": 2,
"n_automation": 11,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
Copyright (c) 2024 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Fawad Haider
-/
import VCVio.CryptoFoundations.MerkleTree.Vector.Defs
import VCVio.OracleComp.QueryTracking.RandomOracle.Simulation
/-!
# Completeness of vector Merkle trees
T... | /-
Copyright (c) 2024 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Fawad Haider
-/
import VCVio.CryptoFoundations.MerkleTree.Vector.Defs
import VCVio.OracleComp.QueryTracking.RandomOracle.Simulation
/-!
# Completeness of vector Merkle trees
T... | @@ -59,6 +59,16 @@
(buildMerkleTree α n leaves)).run preexisting_cache) := by
grind only [= neverFail_iff, = probFailure_of_liftM_PMF]
+private lemma buildLayer_with_hash_get_aux {n : ℕ} (leaves : List.Vector α (2 ^ (n + 1)))
+ (i : Fin (2 ^ (n + 1))) (hashFn : α × α → α)
+ (a b : Fin (2 ^ (n + 1)))... | {
"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_35253487d75f_1 | 83eb572164ce3a3b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Vector/Completeness.lean | Completeness | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "functional_completeness",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n with\n | zero =>\n simp [Fin.eq_zero i, buildMerkleTree_with_hash, getPutativeRoot_with_hash, getR... | [
{
"name": "buildLayer_with_hash_get_aux",
"text": "private lemma buildLayer_with_hash_get_aux {n : ℕ} (leaves : List.Vector α (2 ^ (n + 1)))\n (i : Fin (2 ^ (n + 1))) (hashFn : α × α → α)\n (a b : Fin (2 ^ (n + 1))) (ha : a.val = 2 * (i.val / 2)) (hb : b.val = 2 * (i.val / 2) + 1) :\n hashFn (leave... | [
{
"name": "completeness",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 23,
"n_chars": 1138,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"max_nesting"... | 2 | /-
Copyright (c) 2024 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Fawad Haider
-/
import VCVio.CryptoFoundations.MerkleTree.Vector.Defs
import VCVio.OracleComp.QueryTracking.RandomOracle.Simulation
/-!
# Completeness of vector Merkle trees
T... | /-
Copyright (c) 2024 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Fawad Haider
-/
import VCVio.CryptoFoundations.MerkleTree.Vector.Defs
import VCVio.OracleComp.QueryTracking.RandomOracle.Simulation
/-!
# Completeness of vector Merkle trees
T... | @@ -59,6 +59,16 @@
(buildMerkleTree α n leaves)).run preexisting_cache) := by
grind only [= neverFail_iff, = probFailure_of_liftM_PMF]
+private lemma buildLayer_with_hash_get_aux {n : ℕ} (leaves : List.Vector α (2 ^ (n + 1)))
+ (i : Fin (2 ^ (n + 1))) (hashFn : α × α → α)
+ (a b : Fin (2 ^ (n + 1)))... | {
"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_5cee57c2bd4f_0 | 4480628f8bfdfc9a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Notation.lean | Notation | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "GameEquiv.of_approxRelTriple_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n GameEquiv.of_relTriple' (Relational.relTriple'_eq_approxRelTriple_zero.mpr h)",
"n_chars": 80,
"n_su... | [
{
"name": "GameEquiv.of_relTriple'",
"text": "/-- Game equivalence from exact pRHL equality coupling. -/\ntheorem GameEquiv.of_relTriple'\n {g₁ g₂ : OracleComp spec₁ α}\n (h : Relational.RelTriple' (spec₁ := spec₁) (spec₂ := spec₁) g₁ g₂\n (Relational.EqRel α)) :\n GameEquiv g₁ g₂ :=\n Relati... | [
{
"name": "GameEquiv.of_approxRelTriple_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 373,
"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 VCVio.ProgramLogic.NotationCore
import VCVio.ProgramLogic.Relational.Quantitative
/-!
# Ergonomic Notation and Convenience Layer for Program Logic
This file extends `... | /-
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.NotationCore
import VCVio.ProgramLogic.Relational.Quantitative
/-!
# Ergonomic Notation and Convenience Layer for Program Logic
This file extends `... | @@ -25,12 +25,21 @@
variable [IsUniformSpec spec₁]
variable {α : Type}
+/-- Game equivalence from exact pRHL equality coupling. -/
+theorem GameEquiv.of_relTriple'
+ {g₁ g₂ : OracleComp spec₁ α}
+ (h : Relational.RelTriple' (spec₁ := spec₁) (spec₂ := spec₁) g₁ g₂
+ (Relational.EqRel α)) :
+ GameEquiv ... | {
"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_025a24461663_0 | 3ca3bee14f53c494 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/SimSemantics/WriterT/Basic.lean | Basic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "NeverFail_writerT_run_simulateQ_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← probFailure_eq_zero_iff, ← probFailure_eq_zero_iff,\n probFailure_writerT_run_simulateQ oa]",
... | [
{
"name": "probFailure_writerT_run_simulateQ",
"text": "/-- Running a writer-instrumented simulation preserves the failure probability of the\nunderlying computation. -/\nlemma probFailure_writerT_run_simulateQ [IsUniformSpec spec]\n {so : QueryImpl spec (WriterT ω (OracleComp spec))}\n (oa : OracleCo... | [
{
"name": "NeverFail_writerT_run_simulateQ_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 465,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fa... | 1 | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import VCVio.OracleComp.EvalDist
import ToMathlib.Control.WriterT
/-!
# Simulation through `WriterT` Handlers
Combinators and output-preservation lemmas for writer-instrume... | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import VCVio.OracleComp.EvalDist
import ToMathlib.Control.WriterT
/-!
# Simulation through `WriterT` Handlers
Combinators and output-preservation lemmas for writer-instrume... | @@ -63,12 +63,21 @@
variable {ι : Type u} {spec : OracleSpec ι} {α : Type u} {ω : Type u} [Monoid ω]
+/-- Running a writer-instrumented simulation preserves the failure probability of the
+underlying computation. -/
+lemma probFailure_writerT_run_simulateQ [IsUniformSpec spec]
+ {so : QueryImpl spec (WriterT ω ... | {
"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_89d7cc270b13_0 | 811828290dbc839b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/SimpleTwoServerPIR.lean | SimpleTwoServerPIR | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "pirResponse_cons",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [pirResponse, List.foldl_cons, zero_add]; exact foldl_add_shift _ (a j) s",
"n_chars": 89,
"n_subproofs"... | [
{
"name": "foldl_add_shift",
"text": "private lemma foldl_add_shift {β : Type*} (g : β → W) (c : W) (l : List β) :\n l.foldl (fun acc x => acc + g x) c = c + l.foldl (fun acc x => acc + g x) 0 := by\n induction l generalizing c with\n | nil => simp\n | cons x t ih => simp only [List.foldl_cons]; rw [i... | [
{
"name": "pirResponse_cons",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 226,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"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.OracleComp.ProbComp
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.Constructions.SampleableType
import VCVio.ProgramLogic.Tactics.Relational
/-!
# Infor... | /-
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.ProbComp
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.Constructions.SampleableType
import VCVio.ProgramLogic.Tactics.Relational
/-!
# Infor... | @@ -82,7 +82,14 @@
/-! ## Correctness -/
+private lemma foldl_add_shift {β : Type*} (g : β → W) (c : W) (l : List β) :
+ l.foldl (fun acc x => acc + g x) c = c + l.foldl (fun acc x => acc + g x) 0 := by
+ induction l generalizing c with
+ | nil => simp
+ | cons x t ih => simp only [List.foldl_cons]; rw [ih, ... | {
"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_89d7cc270b13_1 | 562f9c83c6926756 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/SimpleTwoServerPIR.lean | SimpleTwoServerPIR | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "pirQuery_foldl_support",
"depth": 1,
"n_commands": 0,
"n_lines": 35,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction l generalizing init with\n | nil => simp only [List.foldlM, support_pure, Set.mem_singleton_iff] at hss;... | [
{
"name": "pirResponse_cons",
"text": "private lemma pirResponse_cons (a : Fin N → W) (j : Fin N) (s : List (Fin N)) :\n pirResponse a (j :: s) = a j + pirResponse a s := by\n simp only [pirResponse, List.foldl_cons, zero_add]; exact foldl_add_shift _ (a j) s\n\n",
"fan_in": 1,
"n_lines": 5,
... | [
{
"name": "pirQuery_foldl_support",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 50,
"n_chars": 2429,
"n_subproofs": 6,
"n_tactics": 42,
"cyclomatic": 8,
"n_automation": 12,
"n_rewrites": 14,
"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
-/
import VCVio.OracleComp.ProbComp
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.Constructions.SampleableType
import VCVio.ProgramLogic.Tactics.Relational
/-!
# Infor... | /-
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.ProbComp
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.Constructions.SampleableType
import VCVio.ProgramLogic.Tactics.Relational
/-!
# Infor... | @@ -88,6 +88,10 @@
| nil => simp
| cons x t ih => simp only [List.foldl_cons]; rw [ih, ih (0 + g x), zero_add, add_assoc]
+private lemma pirResponse_cons (a : Fin N → W) (j : Fin N) (s : List (Fin N)) :
+ pirResponse a (j :: s) = a j + pirResponse a s := by
+ simp only [pirResponse, List.foldl_cons, zero_ad... | {
"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_89d7cc270b13_2 | a3ad1485ad7e1fd8 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/SimpleTwoServerPIR.lean | SimpleTwoServerPIR | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "pirQuery_foldl_support",
"depth": 1,
"n_commands": 0,
"n_lines": 35,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction l generalizing init with\n | nil => simp only [List.foldlM, support_pure, Set.mem_singleton_iff] at hss;... | [
{
"name": "pirResponse_cons",
"text": "private lemma pirResponse_cons (a : Fin N → W) (j : Fin N) (s : List (Fin N)) :\n pirResponse a (j :: s) = a j + pirResponse a s := by\n simp only [pirResponse, List.foldl_cons, zero_add]; exact foldl_add_shift _ (a j) s\n\n",
"fan_in": 1,
"n_lines": 5,
... | [
{
"name": "pir_correct",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 25,
"n_chars": 1222,
"n_subproofs": 3,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 4,
"automation_only": false,
"max_nesting"... | 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.OracleComp.ProbComp
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.Constructions.SampleableType
import VCVio.ProgramLogic.Tactics.Relational
/-!
# Infor... | /-
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.ProbComp
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.Constructions.SampleableType
import VCVio.ProgramLogic.Tactics.Relational
/-!
# Infor... | @@ -88,6 +88,10 @@
| nil => simp
| cons x t ih => simp only [List.foldl_cons]; rw [ih, ih (0 + g x), zero_add, add_assoc]
+private lemma pirResponse_cons (a : Fin N → W) (j : Fin N) (s : List (Fin N)) :
+ pirResponse a (j :: s) = a j + pirResponse a s := by
+ simp only [pirResponse, List.foldl_cons, zero_ad... | {
"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_6530d11b0132_0 | 4e62525d6007019f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/C13/WotsC.lean | WotsC | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "wotsPkFromSigTops_wotsSign",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Vector.ext\n intro i hi\n simp only [wotsPkFromSigTops, wotsSign, wotsPkGenTops, Vector.getElem_ofFn]\n ... | [
{
"name": "digit_lt",
"text": "theorem digit_lt (prims : Primitives) (pkSeed : prims.PkSeed) (adrs : Adrs) (node : prims.Y)\n (count i : ℕ) : digit prims pkSeed adrs node count i < params.w := by\n unfold digit; exact Nat.mod_lt _ (by decide)\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 217,
... | [
{
"name": "wotsPkFromSigTops_wotsSign",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 699,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
... | 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.C13.Params
import HashSig.SLHDSA.C13.Primitives
/-!
# WOTS+C (C13)
The compact Winternitz one-time signature of the C-series (ePrint 2025/... | /-
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.C13.Params
import HashSig.SLHDSA.C13.Primitives
/-!
# WOTS+C (C13)
The compact Winternitz one-time signature of the C-series (ePrint 2025/... | @@ -60,6 +60,10 @@
(count i : ℕ) : ℕ :=
(prims.Hwots pkSeed adrs node count >>> (i * params.lgw)) % params.w
+theorem digit_lt (prims : Primitives) (pkSeed : prims.PkSeed) (adrs : Adrs) (node : prims.Y)
+ (count i : ℕ) : digit prims pkSeed adrs node count i < params.w := by
+ unfold digit; exact Nat.mod_l... | {
"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_6530d11b0132_1 | becde8243775154c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/C13/WotsC.lean | WotsC | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "wotsPkFromSig_wotsSign",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold wotsPkFromSig wotsPkGen\n rw [wotsPkFromSigTops_wotsSign]",
"n_chars": 70,
"n_subproofs": 0,
"n_... | [
{
"name": "wotsPkFromSigTops_wotsSign",
"text": "theorem wotsPkFromSigTops_wotsSign (prims : Primitives) (node : prims.Y) (sk : prims.SkSeed)\n (pk : prims.PkSeed) (adrs : Adrs) (count : ℕ) :\n wotsPkFromSigTops prims (wotsSign prims node sk pk adrs count) node pk adrs count\n = wotsPkGenTops pri... | [
{
"name": "wotsPkFromSig_wotsSign",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 10,
"n_chars": 509,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max... | 3 | /-
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.C13.Params
import HashSig.SLHDSA.C13.Primitives
/-!
# WOTS+C (C13)
The compact Winternitz one-time signature of the C-series (ePrint 2025/... | /-
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.C13.Params
import HashSig.SLHDSA.C13.Primitives
/-!
# WOTS+C (C13)
The compact Winternitz one-time signature of the C-series (ePrint 2025/... | @@ -126,12 +126,27 @@
/-! ### Correctness -/
+theorem wotsPkFromSigTops_wotsSign (prims : Primitives) (node : prims.Y) (sk : prims.SkSeed)
+ (pk : prims.PkSeed) (adrs : Adrs) (count : ℕ) :
+ wotsPkFromSigTops prims (wotsSign prims node sk pk adrs count) node pk adrs count
+ = wotsPkGenTops prims sk pk 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_94194a8a04ef_0 | e7d796ae24084853 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CostModel.lean | CostModel | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "expectedCost_eq_wp_costDist",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n AddWriterT.expectedCost_eq_wp_run _ val",
"n_chars": 42,
"n_subproofs": 0,
"n_tactics": 1,
"cyclom... | [
{
"name": "expectedCost_eq_wp_run",
"text": "/-- For `OracleComp`, `AddWriterT.expectedCost` is the weakest-precondition expectation of the\nrun semantics projected to the additive cost component. -/\nlemma expectedCost_eq_wp_run\n [AddMonoid ω]\n (oa : AddWriterT ω (OracleComp spec) α) (val : ω → ENN... | [
{
"name": "expectedCost_eq_wp_costDist",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 378,
"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.Algebra.Polynomial.Eval.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.ProgramLogic.Unary.Hoa... | /-
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.Algebra.Polynomial.Eval.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.ProgramLogic.Unary.Hoa... | @@ -97,6 +97,16 @@
variable [IsUniformSpec spec]
+/-- For `OracleComp`, `AddWriterT.expectedCost` is the weakest-precondition expectation of the
+run semantics projected to the additive cost component. -/
+lemma expectedCost_eq_wp_run
+ [AddMonoid ω]
+ (oa : AddWriterT ω (OracleComp spec) α) (val : ω → ENNRe... | {
"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_94194a8a04ef_1 | 0b142fca049b0436 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CostModel.lean | CostModel | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 3 | [
{
"theorem_name": "expectedCost_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [expectedCost_eq_wp_costDist, costDist, instrumentedRun] using hval",
"n_chars": 79,
"n_subproofs": 0,
... | [
{
"name": "expectedCost_eq_wp_costDist",
"text": "/-- The `CostModel.expectedCost` facade agrees definitionally with the weakest-precondition\nexpectation of the instrumented `costDist`. -/\ntheorem expectedCost_eq_wp_costDist (oa : OracleComp spec α) (cm : CostModel spec ω)\n (val : ω → ℝ≥0∞) :\n exp... | [
{
"name": "expectedCost_pure",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 254,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nestin... | 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.Algebra.Polynomial.Eval.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.ProgramLogic.Unary.Hoa... | /-
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.Algebra.Polynomial.Eval.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.ProgramLogic.Unary.Hoa... | @@ -131,10 +131,19 @@
(cm : CostModel spec ℕ) : ℝ≥0∞ :=
expectedCost oa cm (fun n => ↑n)
+/-- The `CostModel.expectedCost` facade agrees definitionally with the weakest-precondition
+expectation of the instrumented `costDist`. -/
+theorem expectedCost_eq_wp_costDist (oa : OracleComp spec α) (cm : CostModel sp... | {
"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_94194a8a04ef_2 | 9f386349dafc98da | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CostModel.lean | CostModel | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 3 | [
{
"theorem_name": "expectedCost_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [expectedCost_eq_wp_costDist, costDist, instrumentedRun] using hval",
"n_chars": 79,
"n_subproofs": 0,
... | [
{
"name": "expectedCost_eq_wp_costDist",
"text": "/-- The `CostModel.expectedCost` facade agrees definitionally with the weakest-precondition\nexpectation of the instrumented `costDist`. -/\ntheorem expectedCost_eq_wp_costDist (oa : OracleComp spec α) (cm : CostModel spec ω)\n (val : ω → ℝ≥0∞) :\n exp... | [
{
"name": "expectedCost_le_of_support_bound",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 675,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 2,
"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 Mathlib.Algebra.Polynomial.Eval.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.ProgramLogic.Unary.Hoa... | /-
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.Algebra.Polynomial.Eval.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.ProgramLogic.Unary.Hoa... | @@ -131,17 +131,32 @@
(cm : CostModel spec ℕ) : ℝ≥0∞ :=
expectedCost oa cm (fun n => ↑n)
+/-- The `CostModel.expectedCost` facade agrees definitionally with the weakest-precondition
+expectation of the instrumented `costDist`. -/
+theorem expectedCost_eq_wp_costDist (oa : OracleComp spec α) (cm : CostModel sp... | {
"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_94194a8a04ef_3 | d9091a21478de412 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CostModel.lean | CostModel | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 3 | [
{
"theorem_name": "expectedCost_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [expectedCost_eq_wp_costDist, costDist, instrumentedRun] using hval",
"n_chars": 79,
"n_subproofs": 0,
... | [
{
"name": "expectedCost_eq_wp_costDist",
"text": "/-- The `CostModel.expectedCost` facade agrees definitionally with the weakest-precondition\nexpectation of the instrumented `costDist`. -/\ntheorem expectedCost_eq_wp_costDist (oa : OracleComp spec α) (cm : CostModel spec ω)\n (val : ω → ℝ≥0∞) :\n exp... | [
{
"name": "probEvent_cost_gt_mul_le_expectedCost",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 546,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": f... | 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.Algebra.Polynomial.Eval.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.ProgramLogic.Unary.Hoa... | /-
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.Algebra.Polynomial.Eval.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.ProgramLogic.Unary.Hoa... | @@ -131,10 +131,19 @@
(cm : CostModel spec ℕ) : ℝ≥0∞ :=
expectedCost oa cm (fun n => ↑n)
+/-- The `CostModel.expectedCost` facade agrees definitionally with the weakest-precondition
+expectation of the instrumented `costDist`. -/
+theorem expectedCost_eq_wp_costDist (oa : OracleComp spec α) (cm : CostModel sp... | {
"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_94194a8a04ef_4 | 5c5a441c6b2624d8 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CostModel.lean | CostModel | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 3 | [
{
"theorem_name": "expectedCost_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [expectedCost_eq_wp_costDist, costDist, instrumentedRun] using hval",
"n_chars": 79,
"n_subproofs": 0,
... | [
{
"name": "expectedCost_eq_wp_costDist",
"text": "/-- The `CostModel.expectedCost` facade agrees definitionally with the weakest-precondition\nexpectation of the instrumented `costDist`. -/\ntheorem expectedCost_eq_wp_costDist (oa : OracleComp spec α) (cm : CostModel spec ω)\n (val : ω → ℝ≥0∞) :\n exp... | [
{
"name": "probEvent_cost_gt_le_expectedCost_div",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 449,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": f... | 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 Mathlib.Algebra.Polynomial.Eval.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.ProgramLogic.Unary.Hoa... | /-
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.Algebra.Polynomial.Eval.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.ProgramLogic.Unary.Hoa... | @@ -131,10 +131,19 @@
(cm : CostModel spec ℕ) : ℝ≥0∞ :=
expectedCost oa cm (fun n => ↑n)
+/-- The `CostModel.expectedCost` facade agrees definitionally with the weakest-precondition
+expectation of the instrumented `costDist`. -/
+theorem expectedCost_eq_wp_costDist (oa : OracleComp spec α) (cm : CostModel sp... | {
"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_94194a8a04ef_5 | a30edc0c4478f33e | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CostModel.lean | CostModel | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "exists_mem_support_costDist_of_mem_support",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hx' : x ∈ support (Prod.fst <$> costDist oa cm) := by\n simpa [fst_map_costDist] using h... | [
{
"name": "fst_map_costDist",
"text": "/-- Cost instrumentation does not change the output distribution. -/\n@[simp]\ntheorem fst_map_costDist [AddCommMonoid ω] (oa : OracleComp spec α) (cm : CostModel spec ω) :\n Prod.fst <$> costDist oa cm = oa :=\n fst_map_run_simulateQ_addCostOracle cm.queryCost oa\... | [
{
"name": "exists_mem_support_costDist_of_mem_support",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 12,
"n_chars": 439,
"n_subproofs": 2,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 2,
"automation_on... | 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.Algebra.Polynomial.Eval.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.ProgramLogic.Unary.Hoa... | /-
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.Algebra.Polynomial.Eval.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.ProgramLogic.Unary.Hoa... | @@ -87,6 +87,12 @@
def costDist [AddCommMonoid ω] (oa : OracleComp spec α) (cm : CostModel spec ω) :=
(instrumentedRun oa cm).run
+/-- Cost instrumentation does not change the output distribution. -/
+@[simp]
+theorem fst_map_costDist [AddCommMonoid ω] (oa : OracleComp spec α) (cm : CostModel spec ω) :
+ Prod.... | {
"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_94194a8a04ef_6 | d5ec3d3db8bbe1cd | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CostModel.lean | CostModel | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "isPerIndexQueryBound_of_unit_support_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing bound with\n | pure x =>\n exact i... | [
{
"name": "exists_mem_support",
"text": "private lemma exists_mem_support [IsUniformSpec spec] (oa : OracleComp spec α) :\n ∃ x, x ∈ support oa := by\n induction oa using OracleComp.inductionOn with\n | pure x => exact ⟨x, by simp⟩\n | query_bind t mx ih =>\n obtain ⟨x, hx⟩ := ih default\n e... | [
{
"name": "isPerIndexQueryBound_of_unit_support_bound",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 30,
"n_chars": 1375,
"n_subproofs": 3,
"n_tactics": 25,
"cyclomatic": 6,
"n_automation": 6,
"n_rewrites": 2,
"n_structural": 7,
"automation_... | 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.Algebra.Polynomial.Eval.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.ProgramLogic.Unary.Hoa... | /-
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.Algebra.Polynomial.Eval.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.ProgramLogic.Unary.Hoa... | @@ -190,6 +190,14 @@
section UnitCostBridge
+private lemma exists_mem_support [IsUniformSpec spec] (oa : OracleComp spec α) :
+ ∃ x, x ∈ support oa := by
+ induction oa using OracleComp.inductionOn with
+ | pure x => exact ⟨x, by simp⟩
+ | query_bind t mx ih =>
+ obtain ⟨x, hx⟩ := ih default
+ 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_94194a8a04ef_7 | 453202165b2425b3 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CostModel.lean | CostModel | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "isPerIndexQueryBound_of_unit_support_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing bound with\n | pure x =>\n exact i... | [
{
"name": "exists_mem_support",
"text": "private lemma exists_mem_support [IsUniformSpec spec] (oa : OracleComp spec α) :\n ∃ x, x ∈ support oa := by\n induction oa using OracleComp.inductionOn with\n | pure x => exact ⟨x, by simp⟩\n | query_bind t mx ih =>\n obtain ⟨x, hx⟩ := ih default\n e... | [
{
"name": "WorstCaseCostBound.toIsPerIndexQueryBound_unit",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 12,
"n_chars": 584,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automatio... | 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.Algebra.Polynomial.Eval.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.ProgramLogic.Unary.Hoa... | /-
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.Algebra.Polynomial.Eval.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.ProgramLogic.Unary.Hoa... | @@ -190,6 +190,14 @@
section UnitCostBridge
+private lemma exists_mem_support [IsUniformSpec spec] (oa : OracleComp spec α) :
+ ∃ x, x ∈ support oa := by
+ induction oa using OracleComp.inductionOn with
+ | pure x => exact ⟨x, by simp⟩
+ | query_bind t mx ih =>
+ obtain ⟨x, hx⟩ := ih default
+ 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_94194a8a04ef_8 | deffa198dbde536b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CostModel.lean | CostModel | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "IsPerIndexQueryBound.toWorstCaseCostBound_unit_sum",
"depth": 1,
"n_commands": 0,
"n_lines": 29,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have haux :\n ∀ {oa : OracleComp spec α} {qb : ι → ℕ},\n IsPerIndexQueryBou... | [
{
"name": "sum_update_pred_eq",
"text": "private lemma sum_update_pred_eq\n [DecidableEq ι] [Fintype ι]\n (qb : ι → ℕ) (t : ι) (ht : 0 < qb t) :\n (∑ j, Function.update qb t (qb t - 1) j) + 1 = ∑ j, qb j := by\n rw [Finset.sum_update_of_mem (Finset.mem_univ t), Finset.sdiff_singleton_eq_erase,\n ... | [
{
"name": "IsPerIndexQueryBound.toWorstCaseCostBound_unit_sum",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 37,
"n_chars": 1846,
"n_subproofs": 3,
"n_tactics": 29,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 7,
"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 Mathlib.Algebra.Polynomial.Eval.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.ProgramLogic.Unary.Hoa... | /-
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.Algebra.Polynomial.Eval.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.ProgramLogic.Unary.Hoa... | @@ -190,6 +190,14 @@
section UnitCostBridge
+private lemma sum_update_pred_eq
+ [DecidableEq ι] [Fintype ι]
+ (qb : ι → ℕ) (t : ι) (ht : 0 < qb t) :
+ (∑ j, Function.update qb t (qb t - 1) j) + 1 = ∑ j, qb j := by
+ rw [Finset.sum_update_of_mem (Finset.mem_univ t), Finset.sdiff_singleton_eq_erase,
+ ←... | {
"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_c1483305ad6c_9 | 4292c8a78012e4ce | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Quantitative.lean | Quantitative | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 2 | [
{
"theorem_name": "map_bind_mapKernelWithFallback",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let K : β → PMF γ := fun b => PMF.map out (condOnMap p f b)\n have hbind :\n (PMF.map f p).bind (mapK... | [
{
"name": "map_bind_condOnMap",
"text": "lemma map_bind_condOnMap {α β : Type*} (p : PMF α) (f : α → β) :\n (PMF.map f p).bind (condOnMap p f) = p := by\n classical\n ext a\n rw [PMF.bind_apply]\n by_cases ha : a ∈ p.support\n · have hsingle : ∀ b, b ≠ f a → (PMF.map f p) b * condOnMap p f b a = 0 :... | [
{
"name": "liftLeftMapCoupling_isCoupling",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 7,
"n_lines": 39,
"n_chars": 1871,
"n_subproofs": 0,
"n_tactics": 33,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 9,
"n_structural": 3,
"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 VCVio.ProgramLogic.Relational.QuantitativeDefs
import VCVio.EvalDist.TVDist
import VCVio.ProgramLogic.Unary.HoareTriple
import ToMathlib.ProbabilityTheory.OptimalCoupli... | /-
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.Relational.QuantitativeDefs
import VCVio.EvalDist.TVDist
import VCVio.ProgramLogic.Unary.HoareTriple
import ToMathlib.ProbabilityTheory.OptimalCoupli... | @@ -124,6 +124,32 @@
Set.indicator_of_mem (show a ∈ fiber f (f a) from rfl)]
simp only [PMF.map_apply, Set.indicator_apply, fiber, Set.mem_setOf_eq, eq_comm]
+lemma map_bind_condOnMap {α β : Type*} (p : PMF α) (f : α → β) :
+ (PMF.map f p).bind (condOnMap p f) = p := by
+ classical
+ ext a
+ rw [PMF.bin... | {
"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_cdd83d214e97_0 | 98f1c9a0d213e05d | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/SimSemantics/StateT/StateProjection.lean | StateProjection | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "run'_simulateQ_eq_of_query_map_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hmap := congrArg (fun p => Prod.fst <$> p)\n (map_run_simulateQ_eq_of_query_map_eq impl₁ impl₂ pr... | [
{
"name": "map_run_simulateQ_eq_of_query_map_eq",
"text": "/-- State-projection transport for `simulateQ.run`.\n\nIf each oracle call under `impl₁` becomes the corresponding `impl₂` call after mapping the state\nwith `proj`, then the full simulated runs agree under the same projection. -/\ntheorem map_run_s... | [
{
"name": "run'_simulateQ_eq_of_query_map_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 789,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": fals... | 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.OracleComp.ProbComp
import VCVio.OracleComp.SimSemantics.StateT.Basic
/-!
# State-Projection Lemmas for `simulateQ`
This file collects the *equational* state-pr... | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.StateT.Basic
/-!
# State-Projection Lemmas for `simulateQ`
This file collects the *equational* state-pr... | @@ -46,6 +46,31 @@
/-! ## State-projection: all states -/
+/-- State-projection transport for `simulateQ.run`.
+
+If each oracle call under `impl₁` becomes the corresponding `impl₂` call after mapping the state
+with `proj`, then the full simulated runs agree under the same projection. -/
+theorem map_run_simulate... | {
"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_cdd83d214e97_1 | 52b5a05d2bad8a73 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/SimSemantics/StateT/StateProjection.lean | StateProjection | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "map_run_simulateQ_bind_eq_of_query_map_eq_inv'",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [StateT.run_bind, map_bind]\n have hpres := simulateQ_run_preserves_inv_of_query ... | [
{
"name": "map_run_simulateQ_eq_of_query_map_eq_inv'",
"text": "/-- Invariant-gated state-projection theorem: if `proj` commutes with each oracle\nstep *under* a state invariant `inv` that is preserved by every step, then it\ncommutes with the full simulation starting from any state satisfying `inv`. This\n... | [
{
"name": "map_run_simulateQ_bind_eq_of_query_map_eq_inv'",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 28,
"n_chars": 1401,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automati... | 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.ProbComp
import VCVio.OracleComp.SimSemantics.StateT.Basic
/-!
# State-Projection Lemmas for `simulateQ`
This file collects the *equational* state-pr... | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.StateT.Basic
/-!
# State-Projection Lemmas for `simulateQ`
This file collects the *equational* state-pr... | @@ -46,6 +46,34 @@
/-! ## State-projection: all states -/
+/-- Invariant-gated state-projection theorem: if `proj` commutes with each oracle
+step *under* a state invariant `inv` that is preserved by every step, then it
+commutes with the full simulation starting from any state satisfying `inv`. This
+is the natur... | {
"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_cdd83d214e97_2 | 68596f9b96aa335a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/SimSemantics/StateT/StateProjection.lean | StateProjection | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "map_run_simulateQ_bind_eq_of_query_map_eq_inv'",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [StateT.run_bind, map_bind]\n have hpres := simulateQ_run_preserves_inv_of_query ... | [
{
"name": "map_run_simulateQ_eq_of_query_map_eq_inv'",
"text": "/-- Invariant-gated state-projection theorem: if `proj` commutes with each oracle\nstep *under* a state invariant `inv` that is preserved by every step, then it\ncommutes with the full simulation starting from any state satisfying `inv`. This\n... | [
{
"name": "run'_simulateQ_eq_of_query_map_eq_inv'",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 959,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"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
-/
import VCVio.OracleComp.ProbComp
import VCVio.OracleComp.SimSemantics.StateT.Basic
/-!
# State-Projection Lemmas for `simulateQ`
This file collects the *equational* state-pr... | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.StateT.Basic
/-!
# State-Projection Lemmas for `simulateQ`
This file collects the *equational* state-pr... | @@ -46,6 +46,34 @@
/-! ## State-projection: all states -/
+/-- Invariant-gated state-projection theorem: if `proj` commutes with each oracle
+step *under* a state invariant `inv` that is preserved by every step, then it
+commutes with the full simulation starting from any state satisfying `inv`. This
+is the natur... | {
"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_cdd83d214e97_3 | 70b41a072f784d8c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/SimSemantics/StateT/StateProjection.lean | StateProjection | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "map_run_simulateQ_bind_eq_of_query_map_eq_inv'",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [StateT.run_bind, map_bind]\n have hpres := simulateQ_run_preserves_inv_of_query ... | [
{
"name": "map_run_simulateQ_eq_of_query_map_eq_inv'",
"text": "/-- Invariant-gated state-projection theorem: if `proj` commutes with each oracle\nstep *under* a state invariant `inv` that is preserved by every step, then it\ncommutes with the full simulation starting from any state satisfying `inv`. This\n... | [
{
"name": "run_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 496,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": 4
}... | 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.OracleComp.ProbComp
import VCVio.OracleComp.SimSemantics.StateT.Basic
/-!
# State-Projection Lemmas for `simulateQ`
This file collects the *equational* state-pr... | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.StateT.Basic
/-!
# State-Projection Lemmas for `simulateQ`
This file collects the *equational* state-pr... | @@ -46,6 +46,34 @@
/-! ## State-projection: all states -/
+/-- Invariant-gated state-projection theorem: if `proj` commutes with each oracle
+step *under* a state invariant `inv` that is preserved by every step, then it
+commutes with the full simulation starting from any state satisfying `inv`. This
+is the natur... | {
"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_cdd83d214e97_4 | 119b6272b0f16968 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/SimSemantics/StateT/StateProjection.lean | StateProjection | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "map_run_simulateQ_bind_eq_of_query_map_eq_inv'",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [StateT.run_bind, map_bind]\n have hpres := simulateQ_run_preserves_inv_of_query ... | [
{
"name": "map_run_simulateQ_eq_of_query_map_eq_inv'",
"text": "/-- Invariant-gated state-projection theorem: if `proj` commutes with each oracle\nstep *under* a state invariant `inv` that is preserved by every step, then it\ncommutes with the full simulation starting from any state satisfying `inv`. This\n... | [
{
"name": "run'_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 386,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"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.OracleComp.ProbComp
import VCVio.OracleComp.SimSemantics.StateT.Basic
/-!
# State-Projection Lemmas for `simulateQ`
This file collects the *equational* state-pr... | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.StateT.Basic
/-!
# State-Projection Lemmas for `simulateQ`
This file collects the *equational* state-pr... | @@ -46,6 +46,34 @@
/-! ## State-projection: all states -/
+/-- Invariant-gated state-projection theorem: if `proj` commutes with each oracle
+step *under* a state invariant `inv` that is preserved by every step, then it
+commutes with the full simulation starting from any state satisfying `inv`. This
+is the natur... | {
"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_cdd83d214e97_5 | fb5899fdf87e5106 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/SimSemantics/StateT/StateProjection.lean | StateProjection | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "simulateQ_run'_eq_of_snd_invariant",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [StateT.run'] using congrArg (fun p => Prod.fst <$> p)\n (simulateQ_run_eq_of_snd_invariant imp... | [
{
"name": "simulateQ_run_eq_of_snd_invariant",
"text": "/-- If the Q-component of product state `(σ × Q)` is invariant under all oracle queries\nstarting from `q₀`, then the full `simulateQ` computation decomposes: running with `(s, q₀)`\nproduces the same result as running the projected implementation on `... | [
{
"name": "simulateQ_run'_eq_of_snd_invariant",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 645,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": tru... | 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.OracleComp.ProbComp
import VCVio.OracleComp.SimSemantics.StateT.Basic
/-!
# State-Projection Lemmas for `simulateQ`
This file collects the *equational* state-pr... | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.StateT.Basic
/-!
# State-Projection Lemmas for `simulateQ`
This file collects the *equational* state-pr... | @@ -100,6 +100,34 @@
variable {α : Type}
+/-- If the Q-component of product state `(σ × Q)` is invariant under all oracle queries
+starting from `q₀`, then the full `simulateQ` computation decomposes: running with `(s, q₀)`
+produces the same result as running the projected implementation on `s` alone, with `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_cdd83d214e97_6 | 4a76f3a4244859e4 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/SimSemantics/StateT/StateProjection.lean | StateProjection | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "run'_simulateQ_eq_of_query_map_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hmap := congrArg (fun p => Prod.fst <$> p)\n (map_run_simulateQ_eq_of_query_map_eq impl₁ impl₂ pr... | [
{
"name": "map_run_simulateQ_eq_of_query_map_eq",
"text": "/-- State-projection transport for `simulateQ.run`.\n\nIf each oracle call under `impl₁` becomes the corresponding `impl₂` call after mapping the state\nwith `proj`, then the full simulated runs agree under the same projection. -/\ntheorem map_run_s... | [
{
"name": "extendState_run_proj_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 21,
"n_chars": 1029,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"m... | 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.OracleComp.ProbComp
import VCVio.OracleComp.SimSemantics.StateT.Basic
/-!
# State-Projection Lemmas for `simulateQ`
This file collects the *equational* state-pr... | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.StateT.Basic
/-!
# State-Projection Lemmas for `simulateQ`
This file collects the *equational* state-pr... | @@ -46,6 +46,31 @@
/-! ## State-projection: all states -/
+/-- State-projection transport for `simulateQ.run`.
+
+If each oracle call under `impl₁` becomes the corresponding `impl₂` call after mapping the state
+with `proj`, then the full simulated runs agree under the same projection. -/
+theorem map_run_simulate... | {
"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_cdd83d214e97_7 | b357826f35347ed3 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/SimSemantics/StateT/StateProjection.lean | StateProjection | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "run'_simulateQ_eq_of_query_map_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hmap := congrArg (fun p => Prod.fst <$> p)\n (map_run_simulateQ_eq_of_query_map_eq impl₁ impl₂ pr... | [
{
"name": "map_run_simulateQ_eq_of_query_map_eq",
"text": "/-- State-projection transport for `simulateQ.run`.\n\nIf each oracle call under `impl₁` becomes the corresponding `impl₂` call after mapping the state\nwith `proj`, then the full simulated runs agree under the same projection. -/\ntheorem map_run_s... | [
{
"name": "extendState_run'_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 15,
"n_chars": 728,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_ne... | 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.ProbComp
import VCVio.OracleComp.SimSemantics.StateT.Basic
/-!
# State-Projection Lemmas for `simulateQ`
This file collects the *equational* state-pr... | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.StateT.Basic
/-!
# State-Projection Lemmas for `simulateQ`
This file collects the *equational* state-pr... | @@ -46,6 +46,31 @@
/-! ## State-projection: all states -/
+/-- State-projection transport for `simulateQ.run`.
+
+If each oracle call under `impl₁` becomes the corresponding `impl₂` call after mapping the state
+with `proj`, then the full simulated runs agree under the same projection. -/
+theorem map_run_simulate... | {
"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_cdd83d214e97_8 | 174916c4104bc97f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/SimSemantics/StateT/StateProjection.lean | StateProjection | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "run'_simulateQ_eq_of_query_map_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hmap := congrArg (fun p => Prod.fst <$> p)\n (map_run_simulateQ_eq_of_query_map_eq impl₁ impl₂ pr... | [
{
"name": "map_run_simulateQ_eq_of_query_map_eq",
"text": "/-- State-projection transport for `simulateQ.run`.\n\nIf each oracle call under `impl₁` becomes the corresponding `impl₂` call after mapping the state\nwith `proj`, then the full simulated runs agree under the same projection. -/\ntheorem map_run_s... | [
{
"name": "extendStateLeft_run_proj_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 766,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"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.OracleComp.ProbComp
import VCVio.OracleComp.SimSemantics.StateT.Basic
/-!
# State-Projection Lemmas for `simulateQ`
This file collects the *equational* state-pr... | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.StateT.Basic
/-!
# State-Projection Lemmas for `simulateQ`
This file collects the *equational* state-pr... | @@ -46,6 +46,31 @@
/-! ## State-projection: all states -/
+/-- State-projection transport for `simulateQ.run`.
+
+If each oracle call under `impl₁` becomes the corresponding `impl₂` call after mapping the state
+with `proj`, then the full simulated runs agree under the same projection. -/
+theorem map_run_simulate... | {
"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_cdd83d214e97_9 | 5dee246587059cac | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/SimSemantics/StateT/StateProjection.lean | StateProjection | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "run'_simulateQ_eq_of_query_map_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hmap := congrArg (fun p => Prod.fst <$> p)\n (map_run_simulateQ_eq_of_query_map_eq impl₁ impl₂ pr... | [
{
"name": "map_run_simulateQ_eq_of_query_map_eq",
"text": "/-- State-projection transport for `simulateQ.run`.\n\nIf each oracle call under `impl₁` becomes the corresponding `impl₂` call after mapping the state\nwith `proj`, then the full simulated runs agree under the same projection. -/\ntheorem map_run_s... | [
{
"name": "extendStateLeft_run'_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 607,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"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.OracleComp.ProbComp
import VCVio.OracleComp.SimSemantics.StateT.Basic
/-!
# State-Projection Lemmas for `simulateQ`
This file collects the *equational* state-pr... | /-
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.ProbComp
import VCVio.OracleComp.SimSemantics.StateT.Basic
/-!
# State-Projection Lemmas for `simulateQ`
This file collects the *equational* state-pr... | @@ -46,6 +46,31 @@
/-! ## State-projection: all states -/
+/-- State-projection transport for `simulateQ.run`.
+
+If each oracle call under `impl₁` becomes the corresponding `impl₂` call after mapping the state
+with `proj`, then the full simulated runs agree under the same projection. -/
+theorem map_run_simulate... | {
"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_07f7b81726a4_0 | 7ffabc681a7d8d6c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Interop/Hax/Examples.lean | Examples | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "tossedAdd_run_run",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_ok : (addOrPanicLifted 0 0 : Interop.Rust.RustOracleComp unifSpec Nat)\n = pure 0 := by\n have := addOrPa... | [
{
"name": "addOrPanicLifted_fail_of_ge",
"text": "/-- When the sum overflows, the lifted computation reduces to\n`fail integerOverflow`, with the error rebranded through `errorOfHax`.\nThe trivial rebrand sends `Error.integerOverflow ↦\nInterop.Rust.Error.integerOverflow`. -/\ntheorem addOrPanicLifted_fail_... | [
{
"name": "tossedAdd_run_run",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 36,
"n_chars": 1713,
"n_subproofs": 3,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_ne... | 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 Interop.Hax.Bridge
import Interop.Rust.Run
import VCVio.OracleComp.ProbComp
import VCVio.EvalDist.Instances.ErrorT
import VCVio.EvalDist.Instances.OptionT
import VCVio.... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Interop.Hax.Bridge
import Interop.Rust.Run
import VCVio.OracleComp.ProbComp
import VCVio.EvalDist.Instances.ErrorT
import VCVio.EvalDist.Instances.OptionT
import VCVio.... | @@ -77,6 +77,40 @@
rw [if_pos h]
rfl
+/-- When the sum overflows, the lifted computation reduces to
+`fail integerOverflow`, with the error rebranded through `errorOfHax`.
+The trivial rebrand sends `Error.integerOverflow ↦
+Interop.Rust.Error.integerOverflow`. -/
+theorem addOrPanicLifted_fail_of_ge (x y : Nat... | {
"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_07f7b81726a4_1 | 25edb4d586226d51 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Interop/Hax/Examples.lean | Examples | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "tossedAdd_run_run",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_ok : (addOrPanicLifted 0 0 : Interop.Rust.RustOracleComp unifSpec Nat)\n = pure 0 := by\n have := addOrPa... | [
{
"name": "addOrPanicLifted_fail_of_ge",
"text": "/-- When the sum overflows, the lifted computation reduces to\n`fail integerOverflow`, with the error rebranded through `errorOfHax`.\nThe trivial rebrand sends `Error.integerOverflow ↦\nInterop.Rust.Error.integerOverflow`. -/\ntheorem addOrPanicLifted_fail_... | [
{
"name": "tossedAdd_panic_prob",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 18,
"n_chars": 883,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_n... | 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 Interop.Hax.Bridge
import Interop.Rust.Run
import VCVio.OracleComp.ProbComp
import VCVio.EvalDist.Instances.ErrorT
import VCVio.EvalDist.Instances.OptionT
import VCVio.... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Interop.Hax.Bridge
import Interop.Rust.Run
import VCVio.OracleComp.ProbComp
import VCVio.EvalDist.Instances.ErrorT
import VCVio.EvalDist.Instances.OptionT
import VCVio.... | @@ -77,6 +77,40 @@
rw [if_pos h]
rfl
+/-- When the sum overflows, the lifted computation reduces to
+`fail integerOverflow`, with the error rebranded through `errorOfHax`.
+The trivial rebrand sends `Error.integerOverflow ↦
+Interop.Rust.Error.integerOverflow`. -/
+theorem addOrPanicLifted_fail_of_ge (x y : Nat... | {
"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_e6be58cb2098_0 | 04e76fdce24848d1 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/SimSemantics/StateT/StateSeparating.lean | StateSeparating | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "simulateQ_link_run",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n simulateQ_linkWith_run (Frame.prod σ₁ σ₂) outer inner A (s₁, s₂)",
"n_chars": 77,
"n_subproofs": 0,
"n_tactics"... | [
{
"name": "simulateQ_linkWith_run",
"text": "/-- Structural form of linked simulation through an explicit state frame. -/\ntheorem simulateQ_linkWith_run {α : Type v} (F : Frame σ σ₁ σ₂)\n (outer : QueryImpl.Stateful M E σ₁) (inner : QueryImpl.Stateful I M σ₂)\n (A : OracleComp E α) (s : σ) :\n (si... | [
{
"name": "simulateQ_link_run",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 511,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nes... | 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.OracleComp.Coercions.Add
import VCVio.OracleComp.SimSemantics.StateT.Basic
import PolyFun.PFunctor.Lens.State
/-!
# Stateful query implementations
`QueryImpl.Sta... | /-
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.Coercions.Add
import VCVio.OracleComp.SimSemantics.StateT.Basic
import PolyFun.PFunctor.Lens.State
/-!
# Stateful query implementations
`QueryImpl.Sta... | @@ -217,13 +217,36 @@
QueryImpl.Stateful I E (σ₁ × σ₂) :=
outer.linkWith (Frame.prod σ₁ σ₂) inner
+/-- Structural form of linked simulation through an explicit state frame. -/
+theorem simulateQ_linkWith_run {α : Type v} (F : Frame σ σ₁ σ₂)
+ (outer : QueryImpl.Stateful M E σ₁) (inner : QueryImpl.Stateful ... | {
"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_5a3703df85c6_0 | 7253a5ed44e669d4 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/EvalDist/Inequalities.lean | Inequalities | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "marginalized_jensen_forking_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n set w : X → ℝ≥0∞ := fun x => Pr[= x | mx]\n set μ : ℝ≥0∞ := ∑' x, w x * acc x with hμ_def\... | [
{
"name": "tsum_sub_tsum_le_tsum_sub",
"text": "private lemma tsum_sub_tsum_le_tsum_sub {ι : Type*} (f g : ι → ℝ≥0∞)\n (_hg : ∑' i, g i ≠ ⊤) : (∑' i, f i) - ∑' i, g i ≤ ∑' i, (f i - g i) := by\n rw [tsub_le_iff_right, ← ENNReal.tsum_add]\n exact ENNReal.tsum_le_tsum fun i => le_tsub_add\n\nomit [Monad ... | [
{
"name": "marginalized_jensen_forking_bound",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 66,
"n_chars": 3227,
"n_subproofs": 7,
"n_tactics": 36,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 4,
"n_structural": 6,
"automation_only": fa... | 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.EvalDist.Defs.Basic
import ToMathlib.Data.ENNReal.SumSquares
/-!
# Probability-weighted Cauchy-Schwarz / Jensen inequalities
Inequalities relating per-element bo... | /-
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.EvalDist.Defs.Basic
import ToMathlib.Data.ENNReal.SumSquares
/-!
# Probability-weighted Cauchy-Schwarz / Jensen inequalities
Inequalities relating per-element bo... | @@ -34,6 +34,12 @@
variable {m : Type → Type v} [Monad m] [MonadLiftT m SPMF]
+private lemma tsum_sub_tsum_le_tsum_sub {ι : Type*} (f g : ι → ℝ≥0∞)
+ (_hg : ∑' i, g i ≠ ⊤) : (∑' i, f i) - ∑' i, g i ≤ ∑' i, (f i - g i) := by
+ rw [tsub_le_iff_right, ← ENNReal.tsum_add]
+ exact ENNReal.tsum_le_tsum fun i => le_... | {
"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_c7d5839b2d35_1 | bc5bd3141567b883 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/PRFTagReader/DirectCoupling.lean | DirectCoupling | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "evalDist_multipleTableHandler_tag_run_eq_singleTableHandler_tag_run_of_sessionsUsed_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n congrArg evalDist\n (multipleTableHandler_tag_run_... | [
{
"name": "multipleTableHandler_tag_run_eq_singleTableHandler_tag_run_of_sessionsUsed_zero",
"text": "/-- **Tag-step first-session pointwise equality.** When the queried tag has no prior sessions\n(`s.sessionsUsed tag = 0`), the eager-table tag-handler outputs of the multiple-session world\n(running against... | [
{
"name": "evalDist_multipleTableHandler_tag_run_eq_singleTableHandler_tag_run_of_sessionsUsed_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 21,
"n_chars": 1263,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites... | 1 | /-
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.Table
/-!
# PRF Tag/Reader Protocol — Direct M_ideal/S_ideal Coupling Foundations
Foundations for the direct coupling that i... | /-
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.Table
/-!
# PRF Tag/Reader Protocol — Direct M_ideal/S_ideal Coupling Foundations
Foundations for the direct coupling that i... | @@ -130,6 +130,41 @@
[DecidableEq Digest]
omit [DecidableEq Nonce] in
+/-- **Tag-step first-session pointwise equality.** When the queried tag has no prior sessions
+(`s.sessionsUsed tag = 0`), the eager-table tag-handler outputs of the multiple-session world
+(running against the sub-table `slotZeroSubTable gS`)... | {
"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_277e50c8f260_0 | 417cec9235e594c1 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/Structures.lean | Structures | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "toSet_encard_cacheQuery_le",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n le_trans (Set.encard_le_encard (toSet_cacheQuery_subset_insert cache t u))\n (Set.encard_insert_le cache.toSet ⟨... | [
{
"name": "toSet_cacheQuery_subset_insert",
"text": "lemma toSet_cacheQuery_subset_insert (t : spec.Domain) (u : spec.Range t) :\n (cache.cacheQuery t u).toSet ⊆ insert ⟨t, u⟩ cache.toSet := by\n rintro ⟨t', u'⟩ hmem\n rcases eq_or_ne t' t with rfl | ht <;> simp_all [cacheQuery]\n\n",
"fan_in": 1,
... | [
{
"name": "toSet_encard_cacheQuery_le",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 270,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"... | 1 | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import Mathlib.Data.Real.ENatENNReal
import Mathlib.Data.Set.Card
import VCVio.OracleComp.SimSemantics.SimulateQ
/-!
# Structures For Tracking a Computation's Ora... | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import Mathlib.Data.Real.ENatENNReal
import Mathlib.Data.Set.Card
import VCVio.OracleComp.SimSemantics.SimulateQ
/-!
# Structures For Tracking a Computation's Ora... | @@ -114,8 +114,15 @@
(cache.cacheQuery t u) t' = cache t' := by
simp [cacheQuery, h]
+lemma toSet_cacheQuery_subset_insert (t : spec.Domain) (u : spec.Range t) :
+ (cache.cacheQuery t u).toSet ⊆ insert ⟨t, u⟩ cache.toSet := by
+ rintro ⟨t', u'⟩ hmem
+ rcases eq_or_ne t' t with rfl | ht <;> simp_all [cach... | {
"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_277e50c8f260_1 | 19aedd5f056a3016 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/Structures.lean | Structures | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "toSet_encard_cacheQuery_le",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n le_trans (Set.encard_le_encard (toSet_cacheQuery_subset_insert cache t u))\n (Set.encard_insert_le cache.toSet ⟨... | [
{
"name": "toSet_cacheQuery_subset_insert",
"text": "lemma toSet_cacheQuery_subset_insert (t : spec.Domain) (u : spec.Range t) :\n (cache.cacheQuery t u).toSet ⊆ insert ⟨t, u⟩ cache.toSet := by\n rintro ⟨t', u'⟩ hmem\n rcases eq_or_ne t' t with rfl | ht <;> simp_all [cacheQuery]\n\n",
"fan_in": 1,
... | [
{
"name": "enncard_cacheQuery_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 6,
"n_chars": 207,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_ne... | 2 | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import Mathlib.Data.Real.ENatENNReal
import Mathlib.Data.Set.Card
import VCVio.OracleComp.SimSemantics.SimulateQ
/-!
# Structures For Tracking a Computation's Ora... | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import Mathlib.Data.Real.ENatENNReal
import Mathlib.Data.Set.Card
import VCVio.OracleComp.SimSemantics.SimulateQ
/-!
# Structures For Tracking a Computation's Ora... | @@ -114,8 +114,15 @@
(cache.cacheQuery t u) t' = cache t' := by
simp [cacheQuery, h]
+lemma toSet_cacheQuery_subset_insert (t : spec.Domain) (u : spec.Range t) :
+ (cache.cacheQuery t u).toSet ⊆ insert ⟨t, u⟩ cache.toSet := by
+ rintro ⟨t', u'⟩ hmem
+ rcases eq_or_ne t' t with rfl | ht <;> simp_all [cach... | {
"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_277e50c8f260_2 | dd7f5a4411490ac9 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/Structures.lean | Structures | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "wasQueried_eq_decide_mem_map_fst",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n decide_eq_decide.mpr (getQ_ne_nil_iff_mem_map_fst log t)",
"n_chars": 59,
"n_subproofs": 0,
"n_ta... | [
{
"name": "getQ_ne_nil_iff_mem_map_fst",
"text": "lemma getQ_ne_nil_iff_mem_map_fst [spec.DecidableEq]\n (log : QueryLog spec) (t : spec.Domain) :\n log.getQ (· = t) ≠ [] ↔ t ∈ log.map (fun e => e.1) := by\n induction log with\n | nil => simp\n | cons hd tl ih => rcases eq_or_ne hd.1 t with h | h <... | [
{
"name": "wasQueried_eq_decide_mem_map_fst",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 228,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,... | 1 | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import Mathlib.Data.Real.ENatENNReal
import Mathlib.Data.Set.Card
import VCVio.OracleComp.SimSemantics.SimulateQ
/-!
# Structures For Tracking a Computation's Ora... | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import Mathlib.Data.Real.ENatENNReal
import Mathlib.Data.Set.Card
import VCVio.OracleComp.SimSemantics.SimulateQ
/-!
# Structures For Tracking a Computation's Ora... | @@ -314,9 +314,17 @@
def wasQueried [spec.DecidableEq] (log : QueryLog spec) (t : spec.Domain) : Bool :=
log.getQ (· = t) ≠ []
+lemma getQ_ne_nil_iff_mem_map_fst [spec.DecidableEq]
+ (log : QueryLog spec) (t : spec.Domain) :
+ log.getQ (· = t) ≠ [] ↔ t ∈ log.map (fun e => e.1) := by
+ induction log 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_277e50c8f260_3 | b8e8303102e0ddef | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/Structures.lean | Structures | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "wasQueried_cons_self",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [wasQueried_eq_decide_mem_map_fst]",
"n_chars": 45,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic... | [
{
"name": "wasQueried_eq_decide_mem_map_fst",
"text": "lemma wasQueried_eq_decide_mem_map_fst [spec.DecidableEq]\n (log : QueryLog spec) (t : spec.Domain) :\n log.wasQueried t = decide (t ∈ log.map (fun e => e.1)) :=\n decide_eq_decide.mpr (getQ_ne_nil_iff_mem_map_fst log t)\n\n",
"fan_in": 2,
... | [
{
"name": "wasQueried_cons_self",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 212,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nes... | 2 | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import Mathlib.Data.Real.ENatENNReal
import Mathlib.Data.Set.Card
import VCVio.OracleComp.SimSemantics.SimulateQ
/-!
# Structures For Tracking a Computation's Ora... | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import Mathlib.Data.Real.ENatENNReal
import Mathlib.Data.Set.Card
import VCVio.OracleComp.SimSemantics.SimulateQ
/-!
# Structures For Tracking a Computation's Ora... | @@ -321,15 +321,22 @@
| nil => simp
| cons hd tl ih => rcases eq_or_ne hd.1 t with h | h <;> simp [List.mem_map, ih, h, Ne.symm]
+lemma wasQueried_eq_decide_mem_map_fst [spec.DecidableEq]
+ (log : QueryLog spec) (t : spec.Domain) :
+ log.wasQueried t = decide (t ∈ log.map (fun e => e.1)) :=
+ decide_eq_d... | {
"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_277e50c8f260_4 | 29d0f7de8104452c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/Structures.lean | Structures | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "addValues_eq_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n eq_comm.trans (eq_addValues_iff seed' seed xs)",
"n_chars": 49,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic... | [
{
"name": "eq_addValues_iff",
"text": "lemma eq_addValues_iff (seed seed' : QuerySeed spec)\n {i : ι} (xs : List (spec.Range i)) :\n seed = seed'.addValues xs ↔ seed' i ++ xs = seed i ∧\n ∀ j, j ≠ i → seed' j = seed j := by\n constructor\n · rintro rfl\n exact ⟨by simp, fun j hj => by simp [... | [
{
"name": "addValues_eq_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 7,
"n_chars": 251,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nestin... | 1 | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import Mathlib.Data.Real.ENatENNReal
import Mathlib.Data.Set.Card
import VCVio.OracleComp.SimSemantics.SimulateQ
/-!
# Structures For Tracking a Computation's Ora... | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import Mathlib.Data.Real.ENatENNReal
import Mathlib.Data.Set.Card
import VCVio.OracleComp.SimSemantics.SimulateQ
/-!
# Structures For Tracking a Computation's Ora... | @@ -496,10 +496,24 @@
@[simp] lemma ofList_apply_of_ne {i j : ι} (xs : List (spec.Range i)) (hj : j ≠ i) :
(ofList xs : QuerySeed spec) j = [] := by simp [ofList, Ne.symm hj]
+lemma eq_addValues_iff (seed seed' : QuerySeed spec)
+ {i : ι} (xs : List (spec.Range i)) :
+ seed = seed'.addValues xs ↔ seed' 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_277e50c8f260_5 | f01e02ad4fb442bd | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/Structures.lean | Structures | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "eq_prependValues_of_pop_eq_some",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hcons := cons_of_pop_eq_some seed i u rest h\n have hrest := rest_eq_update_tail_of_pop_eq_some seed ... | [
{
"name": "cons_of_pop_eq_some",
"text": "lemma cons_of_pop_eq_some (seed : QuerySeed spec) (i : ι)\n (u : spec.Range i) (rest : QuerySeed spec)\n (h : seed.pop i = some (u, rest)) :\n u :: rest i = seed i := by\n unfold pop at h\n cases hsi : seed i with\n | nil => simp [hsi] at h\n | cons u0 ... | [
{
"name": "eq_prependValues_of_pop_eq_some",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 11,
"n_chars": 478,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,... | 2 | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import Mathlib.Data.Real.ENatENNReal
import Mathlib.Data.Set.Card
import VCVio.OracleComp.SimSemantics.SimulateQ
/-!
# Structures For Tracking a Computation's Ora... | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import Mathlib.Data.Real.ENatENNReal
import Mathlib.Data.Set.Card
import VCVio.OracleComp.SimSemantics.SimulateQ
/-!
# Structures For Tracking a Computation's Ora... | @@ -486,6 +486,18 @@
seed.pop i = some (u, Function.update seed i us) := by
unfold pop; simp [h]; rfl
+lemma cons_of_pop_eq_some (seed : QuerySeed spec) (i : ι)
+ (u : spec.Range i) (rest : QuerySeed spec)
+ (h : seed.pop i = some (u, rest)) :
+ u :: rest i = seed i := by
+ unfold pop at h
+ cases ... | {
"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_edb98203e1e9_0 | 1140d033987b834e | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Loom/Coherence.lean | Coherence | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "couplingPost_iff_eRelWP_indicator_eq_one",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · intro h\n exact le_antisymm (eRelWP_indicator_le_one oa ob R) (relTriple'_iff_... | [
{
"name": "eRelWP_indicator_le_one",
"text": "theorem eRelWP_indicator_le_one\n (oa : OracleComp spec₁ α) (ob : OracleComp spec₂ β) (R : RelPost α β) :\n eRelWP oa ob (RelPost.indicator R) ≤ 1 := by\n unfold eRelWP\n refine iSup_le fun c => ?_\n calc ∑' z : α × β, Pr[= z | c.1] * RelPost.indicator ... | [
{
"name": "couplingPost_iff_eRelWP_indicator_eq_one",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 792,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 4,
"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
-/
import VCVio.ProgramLogic.Relational.Loom.Probabilistic
import VCVio.ProgramLogic.Relational.Loom.Qualitative
/-!
# Cross-tier coherence for the relational `RelWP` carriers
... | /-
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.Relational.Loom.Probabilistic
import VCVio.ProgramLogic.Relational.Loom.Qualitative
/-!
# Cross-tier coherence for the relational `RelWP` carriers
... | @@ -68,6 +68,35 @@
since the indicator itself is `≤ 1` pointwise and any coupling has
total mass `≤ 1`. -/
+theorem eRelWP_indicator_le_one
+ (oa : OracleComp spec₁ α) (ob : OracleComp spec₂ β) (R : RelPost α β) :
+ eRelWP oa ob (RelPost.indicator R) ≤ 1 := by
+ unfold eRelWP
+ refine iSup_le fun c => ?_
+ ... | {
"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_ed0124381609_0 | d0336b834a14b966 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Interop/Hax/CenteredBinomial.lean | CenteredBinomial | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 3 | [
{
"theorem_name": "sampleRandomCbd1_prob_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sampleRandomCbd1_run_run, probOutput_bind_eq_sum_fintype,\n Fin.sum_univ_four]\n change _ * Pr[= cbdOut... | [
{
"name": "three_add_one_ennreal",
"text": "/-- Numeric rewrite shared by the three probability lemmas below:\n`ProbComp.probOutput_uniformFin` hands back `((3 : ℕ) + 1 : ℝ≥0∞)⁻¹`\nrather than `4⁻¹`, so collapse the cast + sum before pattern-matching\non `4⁻¹`. -/\nprivate lemma three_add_one_ennreal : ((3 ... | [
{
"name": "sampleRandomCbd1_prob_zero",
"fan_in": 0,
"n_deps_direct": 6,
"n_deps_transitive": 6,
"n_lines": 23,
"n_chars": 1296,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"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 Interop.Hax.Bridge
import Interop.Rust.Run
import Hax.rust_primitives.Cast
import Hax.rust_primitives.BVDecide
import Hax.Tactic
import VCVio.OracleComp.ProbComp
import... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Interop.Hax.Bridge
import Interop.Rust.Run
import Hax.rust_primitives.Cast
import Hax.rust_primitives.BVDecide
import Hax.Tactic
import VCVio.OracleComp.ProbComp
import... | @@ -202,6 +202,12 @@
rw [h4, ENNReal.mul_inv (Or.inl (by norm_num)) (Or.inl (by norm_num)),
← mul_add, ENNReal.inv_two_add_inv_two, mul_one]
+/-- Numeric rewrite shared by the three probability lemmas below:
+`ProbComp.probOutput_uniformFin` hands back `((3 : ℕ) + 1 : ℝ≥0∞)⁻¹`
+rather than `4⁻¹`, so collapse ... | {
"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_ed0124381609_1 | 100ec9a8b7b7e59a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Interop/Hax/CenteredBinomial.lean | CenteredBinomial | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 3 | [
{
"theorem_name": "sampleRandomCbd1_prob_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sampleRandomCbd1_run_run, probOutput_bind_eq_sum_fintype,\n Fin.sum_univ_four]\n change _ * Pr[= cbdOut... | [
{
"name": "three_add_one_ennreal",
"text": "/-- Numeric rewrite shared by the three probability lemmas below:\n`ProbComp.probOutput_uniformFin` hands back `((3 : ℕ) + 1 : ℝ≥0∞)⁻¹`\nrather than `4⁻¹`, so collapse the cast + sum before pattern-matching\non `4⁻¹`. -/\nprivate lemma three_add_one_ennreal : ((3 ... | [
{
"name": "sampleRandomCbd1_prob_pos_one",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 16,
"n_chars": 895,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"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 Interop.Hax.Bridge
import Interop.Rust.Run
import Hax.rust_primitives.Cast
import Hax.rust_primitives.BVDecide
import Hax.Tactic
import VCVio.OracleComp.ProbComp
import... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Interop.Hax.Bridge
import Interop.Rust.Run
import Hax.rust_primitives.Cast
import Hax.rust_primitives.BVDecide
import Hax.Tactic
import VCVio.OracleComp.ProbComp
import... | @@ -193,6 +193,12 @@
a `simp` / `norm_num` calculation on the four-term sum produced by
the peel. -/
+/-- Numeric rewrite shared by the three probability lemmas below:
+`ProbComp.probOutput_uniformFin` hands back `((3 : ℕ) + 1 : ℝ≥0∞)⁻¹`
+rather than `4⁻¹`, so collapse the cast + sum before pattern-matching
+on `4⁻... | {
"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_ed0124381609_2 | 8256de9d95ecba26 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Interop/Hax/CenteredBinomial.lean | CenteredBinomial | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 3 | [
{
"theorem_name": "sampleRandomCbd1_prob_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sampleRandomCbd1_run_run, probOutput_bind_eq_sum_fintype,\n Fin.sum_univ_four]\n change _ * Pr[= cbdOut... | [
{
"name": "three_add_one_ennreal",
"text": "/-- Numeric rewrite shared by the three probability lemmas below:\n`ProbComp.probOutput_uniformFin` hands back `((3 : ℕ) + 1 : ℝ≥0∞)⁻¹`\nrather than `4⁻¹`, so collapse the cast + sum before pattern-matching\non `4⁻¹`. -/\nprivate lemma three_add_one_ennreal : ((3 ... | [
{
"name": "sampleRandomCbd1_prob_neg_one",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 16,
"n_chars": 896,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"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 Interop.Hax.Bridge
import Interop.Rust.Run
import Hax.rust_primitives.Cast
import Hax.rust_primitives.BVDecide
import Hax.Tactic
import VCVio.OracleComp.ProbComp
import... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Interop.Hax.Bridge
import Interop.Rust.Run
import Hax.rust_primitives.Cast
import Hax.rust_primitives.BVDecide
import Hax.Tactic
import VCVio.OracleComp.ProbComp
import... | @@ -193,6 +193,12 @@
a `simp` / `norm_num` calculation on the four-term sum produced by
the peel. -/
+/-- Numeric rewrite shared by the three probability lemmas below:
+`ProbComp.probOutput_uniformFin` hands back `((3 : ℕ) + 1 : ℝ≥0∞)⁻¹`
+rather than `4⁻¹`, so collapse the cast + sum before pattern-matching
+on `4⁻... | {
"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_9565f9ee889a_10 | c6f105cb5632f70d | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/Fischlin/Completeness.lean | Completeness | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 28 | 2 | [
{
"theorem_name": "runtime_evalDist_bind_liftComp",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n rw [runtime_evalDist_eq]\n simp_rw [runtime_evalDist_eq]\n rw [simulateQ_bind,\n roSim.run... | [
{
"name": "runtime_evalDist_eq",
"text": "/-- The Fischlin runtime denotes a surface computation by simulating it with `fischlinImpl`\nstarting from the empty cache and discarding the final cache. -/\nprivate lemma runtime_evalDist_eq\n {α : Type} (mx : OracleComp (unifSpec + fischlinROSpec Stmt Commit C... | [
{
"name": "fischlin_game_eq_model",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 16,
"n_lines": 24,
"n_chars": 1419,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
"m... | 16 | /-
Copyright (c) 2026 Oleksandr Vovkotrub. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oleksandr Vovkotrub
-/
import VCVio.CryptoFoundations.Fischlin.Defs
/-!
# Fischlin Transform: Completeness
The completeness bound for the Fischlin transform (Fischlin 2005, Lem... | /-
Copyright (c) 2026 Oleksandr Vovkotrub. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oleksandr Vovkotrub
-/
import VCVio.CryptoFoundations.Fischlin.Defs
/-!
# Fischlin Transform: Completeness
The completeness bound for the Fischlin transform (Fischlin 2005, Lem... | @@ -108,6 +108,16 @@
+ randomOracle (spec := fischlinROSpec Stmt Commit Chal Resp ρ b M)
omit [FinEnum Chal] [Inhabited Chal] [Inhabited Resp] [SampleableType Chal] in
+/-- The Fischlin runtime denotes a surface computation by simulating it with `fischlinImpl`
+starting from the empty cache and discarding the 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_9565f9ee889a_12 | 4b037396fd3840bf | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/Fischlin/Completeness.lean | Completeness | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 28 | 1 | [
{
"theorem_name": "model_reject_le",
"depth": 1,
"n_commands": 0,
"n_lines": 79,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Every `ProbComp` is `NeverFail`, so `1 - Pr[= true]` is exactly `Pr[= false]`.\n have hfalse : 1 - Pr[= true | modelGa... | [
{
"name": "exists_div_lt_of_sum_lt",
"text": "/-- Pigeonhole over repetitions: if the total of `ρ` per-repetition values exceeds `S`, then at\nleast one value exceeds `⌊S/ρ⌋`. Vacuous when `ρ = 0` (the empty sum is `0`, so `S < 0` is\nimpossible). This is the combinatorial heart of the Fischlin completeness... | [
{
"name": "model_reject_le",
"fan_in": 1,
"n_deps_direct": 7,
"n_deps_transitive": 11,
"n_lines": 91,
"n_chars": 5234,
"n_subproofs": 13,
"n_tactics": 72,
"cyclomatic": 5,
"n_automation": 8,
"n_rewrites": 11,
"n_structural": 21,
"automation_only": false,
"max_... | 11 | /-
Copyright (c) 2026 Oleksandr Vovkotrub. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oleksandr Vovkotrub
-/
import VCVio.CryptoFoundations.Fischlin.Defs
/-!
# Fischlin Transform: Completeness
The completeness bound for the Fischlin transform (Fischlin 2005, Lem... | /-
Copyright (c) 2026 Oleksandr Vovkotrub. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oleksandr Vovkotrub
-/
import VCVio.CryptoFoundations.Fischlin.Defs
/-!
# Fischlin Transform: Completeness
The completeness bound for the Fischlin transform (Fischlin 2005, Lem... | @@ -27,6 +27,17 @@
/-! ### Completeness -/
+/-- Pigeonhole over repetitions: if the total of `ρ` per-repetition values exceeds `S`, then at
+least one value exceeds `⌊S/ρ⌋`. Vacuous when `ρ = 0` (the empty sum is `0`, so `S < 0` is
+impossible). This is the combinatorial heart of the Fischlin completeness union bo... | {
"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_9565f9ee889a_13 | 1f28262ac4e4de01 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/Fischlin/Completeness.lean | Completeness | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 28 | 1 | [
{
"theorem_name": "minUnifAux_probEvent_gt",
"depth": 1,
"n_commands": 0,
"n_lines": 57,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction t generalizing best with\n | zero =>\n cases best with\n | none =>\n simp [minUnifAu... | [
{
"name": "probEvent_val_gt_uniformSample",
"text": "/-- Single-sample tail probability for the Fischlin random oracle: a uniform `Fin (2^b)` draw\nexceeds threshold `k` with probability `(2^b - (k+1)) / 2^b`. The count of values exceeding `k`\nis `2^b - (k+1)` (truncating to `0` once `k+1 > 2^b`), out of `... | [
{
"name": "almostComplete",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 28,
"n_lines": 27,
"n_chars": 1458,
"n_subproofs": 2,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_nesti... | 28 | /-
Copyright (c) 2026 Oleksandr Vovkotrub. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oleksandr Vovkotrub
-/
import VCVio.CryptoFoundations.Fischlin.Defs
/-!
# Fischlin Transform: Completeness
The completeness bound for the Fischlin transform (Fischlin 2005, Lem... | /-
Copyright (c) 2026 Oleksandr Vovkotrub. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oleksandr Vovkotrub
-/
import VCVio.CryptoFoundations.Fischlin.Defs
/-!
# Fischlin Transform: Completeness
The completeness bound for the Fischlin transform (Fischlin 2005, Lem... | @@ -38,6 +38,30 @@
rw [Finset.sum_const, Finset.card_univ, Fintype.card_fin, smul_eq_mul] at hsum
exact absurd (lt_of_lt_of_le h hsum) (not_lt.mpr (Nat.mul_div_le S ρ))
+/-- Single-sample tail probability for the Fischlin random oracle: a uniform `Fin (2^b)` draw
+exceeds threshold `k` with probability `(2^b - ... | {
"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_bc126e041c64_0 | 7e54031ecf0fb5b1 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/SimSemantics/StateT/BundledSemantics.lean | BundledSemantics | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "withStateOracle_evalDist_bind_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n withStateOracle_evalDist_map hashImpl s f mx",
"n_chars": 47,
"n_subproofs": 0,
"n_tactics": 1,... | [
{
"name": "withStateOracle_evalDist_map",
"text": "/-- `withStateOracle` commutes with `<$>`: mapping a function over the surface computation\nis the same as mapping it over the observed `SPMF`.\n\nThis holds because `interpret` is the bundled monad morphism `simulateQ'`, and the `StateT`\nobserver `fun mx ... | [
{
"name": "withStateOracle_evalDist_bind_pure",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 636,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": fal... | 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.OracleComp.ProbComp
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.SimSemantics.Append
import VCVio.OracleComp.SimSemantics.StateT.Basic
import VCVi... | /-
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.ProbComp
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.SimSemantics.Append
import VCVio.OracleComp.SimSemantics.StateT.Basic
import VCVi... | @@ -43,6 +43,24 @@
((QueryImpl.ofLift unifSpec ProbComp).liftTarget (StateT σ ProbComp) + hashImpl)
observe := fun mx => (liftM (StateT.run' mx s) : SPMF _)
+/-- `withStateOracle` commutes with `<$>`: mapping a function over the surface computation
+is the same as mapping it over the observed `SPMF`.
+
+This ... | {
"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_d4d8483f5fed_0 | b3ec8b91167996cc | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Inductive/Binding.lean | Binding | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "getPutativeRootWithHash_binding_collision",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨l₁, r₁, l₂, r₂, hfind⟩ :=\n getPutativeRootWithHash_binding h idx proof₁ proof₂ x y hn... | [
{
"name": "findCollision_sound",
"text": "/-- Soundness: if `findCollision` returns a tuple, that tuple is a hash\n collision according to `Collision`. -/\ntheorem findCollision_sound (h : α → α → α) {s : Skeleton} (idx : SkeletonLeafIndex s)\n (proof₁ proof₂ : List.Vector α idx.depth) (x y l₁ r₁ l₂ r... | [
{
"name": "getPutativeRootWithHash_binding_collision",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 23,
"n_chars": 1171,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_on... | 2 | /-
Copyright (c) 2026 Vitalik Buterin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.Defs
/-!
# Merkle Binding (Collision Lemma)
The structural collision lemma for inductive Merkle trees, often c... | /-
Copyright (c) 2026 Vitalik Buterin. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.Defs
/-!
# Merkle Binding (Collision Lemma)
The structural collision lemma for inductive Merkle trees, often c... | @@ -94,6 +94,39 @@
else
none
+/-- Soundness: if `findCollision` returns a tuple, that tuple is a hash
+ collision according to `Collision`. -/
+theorem findCollision_sound (h : α → α → α) {s : Skeleton} (idx : SkeletonLeafIndex s)
+ (proof₁ proof₂ : List.Vector α idx.depth) (x y l₁ r₁ l₂ r₂ : α)
+ ... | {
"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_ad6c4032e7b9_0 | 3859de81df3e44ce | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Inductive/QueryBound.lean | QueryBound | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "getPutativeRoot_isTotalQueryBound",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction idx with\n | ofLeaf =>\n simp only [getPutativeRoot, SkeletonLeafIndex.depth]\n triv... | [
{
"name": "singleHash_isTotalQueryBound",
"text": "/-- `singleHash` makes exactly one oracle query, hence has total query bound `1`. -/\nlemma singleHash_isTotalQueryBound (left right : α) :\n IsTotalQueryBound (singleHash (m := OracleComp (spec α)) left right) 1 := by\n simp only [singleHash, HasQuery.... | [
{
"name": "getPutativeRoot_isTotalQueryBound",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 674,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": fals... | 1 | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import ToMathlib.Data.IndexedBinaryTree.Lemmas
/-!
# T... | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import ToMathlib.Data.IndexedBinaryTree.Lemmas
/-!
# T... | @@ -33,6 +33,12 @@
/-! ### Total query bounds for Merkle-tree primitives -/
+/-- `singleHash` makes exactly one oracle query, hence has total query bound `1`. -/
+lemma singleHash_isTotalQueryBound (left right : α) :
+ IsTotalQueryBound (singleHash (m := OracleComp (spec α)) left right) 1 := by
+ simp only [si... | {
"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_ad6c4032e7b9_1 | 9f4259641baf7b76 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Inductive/QueryBound.lean | QueryBound | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "verifyProof_isTotalQueryBound",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold verifyProof\n exact isTotalQueryBound_bind (n₂ := 0)\n (getPutativeRoot_isTotalQueryBound idx leaf... | [
{
"name": "getPutativeRoot_isTotalQueryBound",
"text": "/-- `getPutativeRoot` makes one oracle query per level of `idx`, so it has total query\nbound `idx.depth`. -/\nlemma getPutativeRoot_isTotalQueryBound {s : Skeleton}\n (idx : SkeletonLeafIndex s) (leafValue : α) (proof : List.Vector α idx.depth) :\n... | [
{
"name": "verifyProof_isTotalQueryBound",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 550,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 2 | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import ToMathlib.Data.IndexedBinaryTree.Lemmas
/-!
# T... | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import ToMathlib.Data.IndexedBinaryTree.Lemmas
/-!
# T... | @@ -39,6 +39,21 @@
simp only [singleHash, HasQuery.instOfMonadLift_query, isTotalQueryBound_query_bind_iff]
exact ⟨Nat.zero_lt_one, fun _ => trivial⟩
+/-- `getPutativeRoot` makes one oracle query per level of `idx`, so it has total query
+bound `idx.depth`. -/
+lemma getPutativeRoot_isTotalQueryBound {s : Skele... | {
"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_ad6c4032e7b9_2 | 95edff61f684d357 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Inductive/QueryBound.lean | QueryBound | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "verifyProof_isTotalQueryBound",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold verifyProof\n exact isTotalQueryBound_bind (n₂ := 0)\n (getPutativeRoot_isTotalQueryBound idx leaf... | [
{
"name": "getPutativeRoot_isTotalQueryBound",
"text": "/-- `getPutativeRoot` makes one oracle query per level of `idx`, so it has total query\nbound `idx.depth`. -/\nlemma getPutativeRoot_isTotalQueryBound {s : Skeleton}\n (idx : SkeletonLeafIndex s) (leafValue : α) (proof : List.Vector α idx.depth) :\n... | [
{
"name": "verifyProof_isTotalQueryBound_skeleton_depth",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 610,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_... | 3 | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import ToMathlib.Data.IndexedBinaryTree.Lemmas
/-!
# T... | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.Defs
import VCVio.OracleComp.QueryTracking.QueryBound
import ToMathlib.Data.IndexedBinaryTree.Lemmas
/-!
# T... | @@ -39,6 +39,21 @@
simp only [singleHash, HasQuery.instOfMonadLift_query, isTotalQueryBound_query_bind_iff]
exact ⟨Nat.zero_lt_one, fun _ => trivial⟩
+/-- `getPutativeRoot` makes one oracle query per level of `idx`, so it has total query
+bound `idx.depth`. -/
+lemma getPutativeRoot_isTotalQueryBound {s : Skele... | {
"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_1988a14c6931_0 | b3b8fd575f381cd3 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/RandomOracle/Simulation.lean | Simulation | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "run_liftM",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [show simulateQ (unifFwdImpl hashSpec + ro) (liftM oa) =\n simulateQ (unifFwdImpl hashSpec) oa from simulateQ_liftComp ro... | [
{
"name": "simulateQ_liftComp",
"text": "/-- Simulating a `liftComp`-embedded `ProbComp` through `unifFwdImpl + ro` discards the hash\noracle, reducing to simulation through `unifFwdImpl` alone. -/\nlemma simulateQ_liftComp {α : Type} (oa : ProbComp α) :\n simulateQ (unifFwdImpl hashSpec + ro)\n (Or... | [
{
"name": "run_liftM",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 501,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nesting": 6
... | 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.RandomOracle.Basic
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.SimSemantics.Append
import VCVio.OracleComp.Si... | /-
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.RandomOracle.Basic
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.SimSemantics.Append
import VCVio.OracleComp.Si... | @@ -60,11 +60,23 @@
variable (ro : QueryImpl hashSpec (StateT hashSpec.QueryCache ProbComp))
+/-- Simulating a `liftComp`-embedded `ProbComp` through `unifFwdImpl + ro` discards the hash
+oracle, reducing to simulation through `unifFwdImpl` alone. -/
+lemma simulateQ_liftComp {α : Type} (oa : ProbComp α) :
+ si... | {
"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_1988a14c6931_1 | 0230c874d2d9ef18 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/RandomOracle/Simulation.lean | Simulation | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "run_liftM_support",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [run_liftM, support_map]",
"n_chars": 33,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_au... | [
{
"name": "run_liftM",
"text": "/-- Running the `unifFwdImpl + ro` simulation of a lifted `ProbComp` on cache `s` leaves the\ncache untouched, pairing each sampled output with `s`. -/\nlemma run_liftM {α : Type} (oa : ProbComp α) (s : hashSpec.QueryCache) :\n (simulateQ (unifFwdImpl hashSpec + ro) (liftM... | [
{
"name": "run_liftM_support",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 392,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesti... | 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.OracleComp.QueryTracking.RandomOracle.Basic
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.SimSemantics.Append
import VCVio.OracleComp.Si... | /-
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.RandomOracle.Basic
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.SimSemantics.Append
import VCVio.OracleComp.Si... | @@ -69,11 +69,21 @@
QueryImpl.simulateQ_add_liftComp_left
(m' := StateT hashSpec.QueryCache ProbComp) (unifFwdImpl hashSpec) ro oa
+/-- Running the `unifFwdImpl + ro` simulation of a lifted `ProbComp` on cache `s` leaves the
+cache untouched, pairing each sampled output with `s`. -/
+lemma run_liftM {α : Type... | {
"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_1988a14c6931_2 | 5a2ce220989fbfda | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/RandomOracle/Simulation.lean | Simulation | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "run_liftM_support",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [run_liftM, support_map]",
"n_chars": 33,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_au... | [
{
"name": "run_liftM",
"text": "/-- Running the `unifFwdImpl + ro` simulation of a lifted `ProbComp` on cache `s` leaves the\ncache untouched, pairing each sampled output with `s`. -/\nlemma run_liftM {α : Type} (oa : ProbComp α) (s : hashSpec.QueryCache) :\n (simulateQ (unifFwdImpl hashSpec + ro) (liftM... | [
{
"name": "run'_liftM_bind",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 648,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_nestin... | 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.OracleComp.QueryTracking.RandomOracle.Basic
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.SimSemantics.Append
import VCVio.OracleComp.Si... | /-
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.RandomOracle.Basic
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.SimSemantics.Append
import VCVio.OracleComp.Si... | @@ -69,12 +69,26 @@
QueryImpl.simulateQ_add_liftComp_left
(m' := StateT hashSpec.QueryCache ProbComp) (unifFwdImpl hashSpec) ro oa
+/-- Running the `unifFwdImpl + ro` simulation of a lifted `ProbComp` on cache `s` leaves the
+cache untouched, pairing each sampled output with `s`. -/
+lemma run_liftM {α : Type... | {
"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_1988a14c6931_3 | 5610cd4e39dd634b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/RandomOracle/Simulation.lean | Simulation | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "exists_agreesWithFn_evalWithAnswerFn_eq_iff_mem_support",
"depth": 1,
"n_commands": 0,
"n_lines": 29,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n induction oa using OracleComp.inductionOn generalizing cache a with\n... | [
{
"name": "support_randomOracle_run_bind_of_uncached",
"text": "/-- Running the lazy random oracle on an uncached query `t` and binding the result samples the\nfresh answer uniformly, so the support of the bound computation is the union over all answers of\nthe support obtained after caching that answer. -/... | [
{
"name": "exists_agreesWithFn_evalWithAnswerFn_eq_iff_mem_support",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 42,
"n_chars": 2488,
"n_subproofs": 6,
"n_tactics": 29,
"cyclomatic": 3,
"n_automation": 4,
"n_rewrites": 4,
"n_structural": 14,
... | 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.OracleComp.QueryTracking.RandomOracle.Basic
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.SimSemantics.Append
import VCVio.OracleComp.Si... | /-
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.RandomOracle.Basic
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.SimSemantics.Append
import VCVio.OracleComp.Si... | @@ -68,6 +68,19 @@
variable {ι : Type} {spec : OracleSpec ι} {α : Type}
+/-- Running the lazy random oracle on an uncached query `t` and binding the result samples the
+fresh answer uniformly, so the support of the bound computation is the union over all answers of
+the support obtained after caching that answer. ... | {
"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_1988a14c6931_4 | 53091400b0c0efa3 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/RandomOracle/Simulation.lean | Simulation | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "exists_agreesWithFn_evalWithAnswerFn_eq_iff_mem_support",
"depth": 1,
"n_commands": 0,
"n_lines": 29,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n induction oa using OracleComp.inductionOn generalizing cache a with\n... | [
{
"name": "support_randomOracle_run_bind_of_uncached",
"text": "/-- Running the lazy random oracle on an uncached query `t` and binding the result samples the\nfresh answer uniformly, so the support of the bound computation is the union over all answers of\nthe support obtained after caching that answer. -/... | [
{
"name": "probEvent_eq_one_simulateQ_randomOracle_run_iff",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 25,
"n_chars": 1294,
"n_subproofs": 2,
"n_tactics": 14,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 7,
"automa... | 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.OracleComp.QueryTracking.RandomOracle.Basic
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.SimSemantics.Append
import VCVio.OracleComp.Si... | /-
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.RandomOracle.Basic
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.SimSemantics.Append
import VCVio.OracleComp.Si... | @@ -75,6 +75,19 @@
NeverFail ((simulateQ randomOracle oa).run cache) := by
grind only [= neverFail_iff, = probFailure_of_liftM_PMF]
+/-- Running the lazy random oracle on an uncached query `t` and binding the result samples the
+fresh answer uniformly, so the support of the bound computation is the union over... | {
"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_32e37395026d_0 | 5f9b0380f82e1076 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/AsymmEncAlg/INDCPA/GenericLift.lean | GenericLift | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "IND_CPA_hybridLR_counted_run'_evalDist_eq_branch",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases branch\n · rfl\n · exact IND_CPA_hybridLR_counted_run'_evalDist_eq_above (encAlg' ... | [
{
"name": "IND_CPA_hybridLR_counted_run'_evalDist_eq_above",
"text": "/-- Once the counter has already crossed `k`, the `k` and `k + 1` counted hybrids agree. -/\nprivate lemma IND_CPA_hybridLR_counted_run'_evalDist_eq_above (pk : PK) (k : ℕ) {α : Type}\n (oa : OracleComp encAlg'.IND_CPA_oracleSpec α)\n ... | [
{
"name": "IND_CPA_hybridLR_counted_run'_evalDist_eq_branch",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 782,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automat... | 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.AsymmEncAlg.INDCPA.Oracle
import VCVio.CryptoFoundations.AsymmEncAlg.INDCPA.OneTime
import ToMathlib.Control.StateT
/-!
# Asymmetri... | /-
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.AsymmEncAlg.INDCPA.Oracle
import VCVio.CryptoFoundations.AsymmEncAlg.INDCPA.OneTime
import ToMathlib.Control.StateT
/-!
# Asymmetri... | @@ -87,6 +87,24 @@
let st' := (st.1.cacheQuery mm c, st.2 + 1)
(simulateQ (encAlg'.IND_CPA_queryImpl_hybridLR_counted pk k) (cont c)).run' st'
+/-- Once the counter has already crossed `k`, the `k` and `k + 1` counted hybrids agree. -/
+private lemma IND_CPA_hybridLR_counted_run'_evalDist_eq_above (... | {
"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_32e37395026d_1 | f20c0eb8aa62eb93 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/AsymmEncAlg/INDCPA/GenericLift.lean | GenericLift | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "IND_CPA_stepPrefix_resume_eq_hybridLR",
"depth": 1,
"n_commands": 0,
"n_lines": 47,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n revert st hst\n induction oa using OracleComp.inductionOn with\n | pure a =>\n intro st hst\n... | [
{
"name": "IND_CPA_stepPrefix_query_inl",
"text": "/-- Unfold `IND_CPA_stepPrefix` through a query to the uniform side of the oracle spec. -/\nprivate lemma IND_CPA_stepPrefix_query_inl (pk : PK) (k : ℕ) {α : Type} (tu : unifSpec.Domain)\n (mx : encAlg'.IND_CPA_oracleSpec.Range (Sum.inl tu) →\n Orac... | [
{
"name": "IND_CPA_stepPrefix_resume_eq_hybridLR",
"fan_in": 1,
"n_deps_direct": 7,
"n_deps_transitive": 8,
"n_lines": 65,
"n_chars": 3737,
"n_subproofs": 1,
"n_tactics": 49,
"cyclomatic": 8,
"n_automation": 10,
"n_rewrites": 9,
"n_structural": 15,
"automation_onl... | 8 | /-
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.AsymmEncAlg.INDCPA.Oracle
import VCVio.CryptoFoundations.AsymmEncAlg.INDCPA.OneTime
import ToMathlib.Control.StateT
/-!
# Asymmetri... | /-
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.AsymmEncAlg.INDCPA.Oracle
import VCVio.CryptoFoundations.AsymmEncAlg.INDCPA.OneTime
import ToMathlib.Control.StateT
/-!
# Asymmetri... | @@ -91,6 +91,16 @@
private lemma IND_CPA_stepPrefix_pure (pk : PK) (k : ℕ) {α : Type} (a : α) :
IND_CPA_stepPrefix (encAlg' := encAlg') pk k (pure a) = pure (.done a) := rfl
+/-- Unfold `IND_CPA_stepPrefix` through a query to the uniform side of the oracle spec. -/
+private lemma IND_CPA_stepPrefix_query_inl (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_32e37395026d_2 | cf3c021eefac8336 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/AsymmEncAlg/INDCPA/GenericLift.lean | GenericLift | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "IND_CPA_stepPrefix_resume_eq_hybridLR",
"depth": 1,
"n_commands": 0,
"n_lines": 47,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n revert st hst\n induction oa using OracleComp.inductionOn with\n | pure a =>\n intro st hst\n... | [
{
"name": "IND_CPA_stepPrefix_query_inl",
"text": "/-- Unfold `IND_CPA_stepPrefix` through a query to the uniform side of the oracle spec. -/\nprivate lemma IND_CPA_stepPrefix_query_inl (pk : PK) (k : ℕ) {α : Type} (tu : unifSpec.Domain)\n (mx : encAlg'.IND_CPA_oracleSpec.Range (Sum.inl tu) →\n Orac... | [
{
"name": "IND_CPA_stepAdversary_game_eq_hybridBranch",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 9,
"n_lines": 48,
"n_chars": 2374,
"n_subproofs": 1,
"n_tactics": 36,
"cyclomatic": 3,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 7,
"automation_... | 9 | /-
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.AsymmEncAlg.INDCPA.Oracle
import VCVio.CryptoFoundations.AsymmEncAlg.INDCPA.OneTime
import ToMathlib.Control.StateT
/-!
# Asymmetri... | /-
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.AsymmEncAlg.INDCPA.Oracle
import VCVio.CryptoFoundations.AsymmEncAlg.INDCPA.OneTime
import ToMathlib.Control.StateT
/-!
# Asymmetri... | @@ -91,6 +91,16 @@
private lemma IND_CPA_stepPrefix_pure (pk : PK) (k : ℕ) {α : Type} (a : α) :
IND_CPA_stepPrefix (encAlg' := encAlg') pk k (pure a) = pure (.done a) := rfl
+/-- Unfold `IND_CPA_stepPrefix` through a query to the uniform side of the oracle spec. -/
+private lemma IND_CPA_stepPrefix_query_inl (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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.