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_3e37ed20e7e1_0 | 4217e69364357bff | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/Wots.lean | Wots | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "chainLengths_mem_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro d hd\n unfold chainLengths wotsFullDigits at hd\n rcases List.mem_append.mp hd with h | h\n · have hb := base2... | [
{
"name": "Params.w_pos",
"text": "/-- `0 < w = 2^lgw`. -/\ntheorem Params.w_pos (p : Params) : 0 < p.w := by\n unfold Params.w; positivity\n\n/-! ### The hash chain (FIPS 205 Algorithm 5) -/\n\n",
"fan_in": 2,
"n_lines": 7,
"n_chars": 155,
"n_subproofs": 0,
"n_tactics": 3,
"cycloma... | [
{
"name": "chainLengths_mem_lt",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 446,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"max_ne... | 1 | /-
Copyright (c) 2026 Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolas Consigny
-/
import HashSig.SLHDSA.Primitives
import HashSig.SLHDSA.Encoding
import HashSig.SLHDSA.WotsChecksum
/-!
# WOTS+ (FIPS 205 §5)
The Winternitz one-time signature o... | /-
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.Primitives
import HashSig.SLHDSA.Encoding
import HashSig.SLHDSA.WotsChecksum
/-!
# WOTS+ (FIPS 205 §5)
The Winternitz one-time signature o... | @@ -31,6 +31,12 @@
variable {p : Params}
+/-- `0 < w = 2^lgw`. -/
+theorem Params.w_pos (p : Params) : 0 < p.w := by
+ unfold Params.w; positivity
+
+/-! ### The hash chain (FIPS 205 Algorithm 5) -/
+
/-- `chain(X, i, s, PK.seed, ADRS)`: apply `F` `s` times to `X`, starting at hash index `i`
(the `j`-th step us... | {
"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_3e37ed20e7e1_1 | f9dea776c0d7b916 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/Wots.lean | Wots | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "chainLengths_mem_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro d hd\n unfold chainLengths wotsFullDigits at hd\n rcases List.mem_append.mp hd with h | h\n · have hb := base2... | [
{
"name": "Params.w_pos",
"text": "/-- `0 < w = 2^lgw`. -/\ntheorem Params.w_pos (p : Params) : 0 < p.w := by\n unfold Params.w; positivity\n\n/-! ### The hash chain (FIPS 205 Algorithm 5) -/\n\n",
"fan_in": 2,
"n_lines": 7,
"n_chars": 155,
"n_subproofs": 0,
"n_tactics": 3,
"cycloma... | [
{
"name": "chainSteps_lt",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 401,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
"max_nesting"... | 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.Primitives
import HashSig.SLHDSA.Encoding
import HashSig.SLHDSA.WotsChecksum
/-!
# WOTS+ (FIPS 205 §5)
The Winternitz one-time signature o... | /-
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.Primitives
import HashSig.SLHDSA.Encoding
import HashSig.SLHDSA.WotsChecksum
/-!
# WOTS+ (FIPS 205 §5)
The Winternitz one-time signature o... | @@ -31,6 +31,12 @@
variable {p : Params}
+/-- `0 < w = 2^lgw`. -/
+theorem Params.w_pos (p : Params) : 0 < p.w := by
+ unfold Params.w; positivity
+
+/-! ### The hash chain (FIPS 205 Algorithm 5) -/
+
/-- `chain(X, i, s, PK.seed, ADRS)`: apply `F` `s` times to `X`, starting at hash index `i`
(the `j`-th step us... | {
"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_3e37ed20e7e1_2 | 8d5aab936f0df895 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/Wots.lean | Wots | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "chainSteps_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold chainSteps\n rw [List.getD_eq_getElem?_getD]\n rcases lt_or_ge i (chainLengths prims msg).length with h | h\n · rw ... | [
{
"name": "chainLengths_mem_lt",
"text": "/-- Every entry of `chainLengths` is a genuine base-`w` digit (`< w`). -/\ntheorem chainLengths_mem_lt (prims : Primitives p) (msg : prims.Y) :\n ∀ d ∈ chainLengths prims msg, d < p.w := by\n intro d hd\n unfold chainLengths wotsFullDigits at hd\n rcases List.... | [
{
"name": "chainSteps_le",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 7,
"n_chars": 224,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting":... | 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.Primitives
import HashSig.SLHDSA.Encoding
import HashSig.SLHDSA.WotsChecksum
/-!
# WOTS+ (FIPS 205 §5)
The Winternitz one-time signature o... | /-
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.Primitives
import HashSig.SLHDSA.Encoding
import HashSig.SLHDSA.WotsChecksum
/-!
# WOTS+ (FIPS 205 §5)
The Winternitz one-time signature o... | @@ -68,6 +68,16 @@
def chainLengths (prims : Primitives p) (msg : prims.Y) : List ℕ :=
wotsFullDigits (wotsMsgDigits prims msg) p.w p.len1 p.len2
+/-- Every entry of `chainLengths` is a genuine base-`w` digit (`< w`). -/
+theorem chainLengths_mem_lt (prims : Primitives p) (msg : prims.Y) :
+ ∀ d ∈ chainLengths... | {
"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_3e37ed20e7e1_3 | b5c016ecc0bc322e | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/Wots.lean | Wots | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "chainSteps_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold chainSteps\n rw [List.getD_eq_getElem?_getD]\n rcases lt_or_ge i (chainLengths prims msg).length with h | h\n · rw ... | [
{
"name": "chainLengths_mem_lt",
"text": "/-- Every entry of `chainLengths` is a genuine base-`w` digit (`< w`). -/\ntheorem chainLengths_mem_lt (prims : Primitives p) (msg : prims.Y) :\n ∀ d ∈ chainLengths prims msg, d < p.w := by\n intro d hd\n unfold chainLengths wotsFullDigits at hd\n rcases List.... | [
{
"name": "wotsPkFromSigTops_wotsSign",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 15,
"n_chars": 710,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
... | 5 | /-
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.Primitives
import HashSig.SLHDSA.Encoding
import HashSig.SLHDSA.WotsChecksum
/-!
# WOTS+ (FIPS 205 §5)
The Winternitz one-time signature o... | /-
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.Primitives
import HashSig.SLHDSA.Encoding
import HashSig.SLHDSA.WotsChecksum
/-!
# WOTS+ (FIPS 205 §5)
The Winternitz one-time signature o... | @@ -85,6 +85,16 @@
def chainLengths (prims : Primitives p) (msg : prims.Y) : List ℕ :=
wotsFullDigits (wotsMsgDigits prims msg) p.w p.len1 p.len2
+/-- Every entry of `chainLengths` is a genuine base-`w` digit (`< w`). -/
+theorem chainLengths_mem_lt (prims : Primitives p) (msg : prims.Y) :
+ ∀ d ∈ chainLengths... | {
"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_3e37ed20e7e1_4 | dccd41282c30ef0f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/Wots.lean | Wots | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "chainSteps_le",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Nat.le_sub_one_of_lt (chainSteps_lt prims msg i)",
"n_chars": 51,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic"... | [
{
"name": "chainSteps_lt",
"text": "theorem chainSteps_lt (prims : Primitives p) (msg : prims.Y) (i : ℕ) :\n chainSteps prims msg i < p.w := by\n unfold chainSteps\n rw [List.getD_eq_getElem?_getD]\n rcases lt_or_ge i (chainLengths prims msg).length with h | h\n · rw [List.getElem?_eq_getElem h]\n ... | [
{
"name": "wotsPkFromSig_wotsSign",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 10,
"n_chars": 441,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max... | 6 | /-
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.Primitives
import HashSig.SLHDSA.Encoding
import HashSig.SLHDSA.WotsChecksum
/-!
# WOTS+ (FIPS 205 §5)
The Winternitz one-time signature o... | /-
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.Primitives
import HashSig.SLHDSA.Encoding
import HashSig.SLHDSA.WotsChecksum
/-!
# WOTS+ (FIPS 205 §5)
The Winternitz one-time signature o... | @@ -99,8 +99,19 @@
def chainSteps (prims : Primitives p) (msg : prims.Y) (i : ℕ) : ℕ :=
(chainLengths prims msg).getD i 0
+theorem chainSteps_lt (prims : Primitives p) (msg : prims.Y) (i : ℕ) :
+ chainSteps prims msg i < p.w := by
+ unfold chainSteps
+ rw [List.getD_eq_getElem?_getD]
+ rcases lt_or_ge i (ch... | {
"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_09eef4ff143c_0 | 501c1c75128ea48e | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/SimSemantics/OptionT/Basic.lean | Basic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "simulateQ_optionT_vector_mapM_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_vl :\n (Vector.toArray <$> xs.mapM f : OptionT (OracleComp spec) (Array β)) =\n List... | [
{
"name": "simulateQ_optionT_list_mapM_pure",
"text": "/-- `simulateQ` over `List.mapM` in `OptionT`: when each step is `pure (some (g x))`\nunder `simulateQ`, the whole `mapM` is `pure (some (l.map g))`. -/\nlemma simulateQ_optionT_list_mapM_pure\n (f : α → OptionT (OracleComp spec) β) (g : α → β) (l : ... | [
{
"name": "simulateQ_optionT_vector_mapM_pure",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 39,
"n_chars": 1916,
"n_subproofs": 4,
"n_tactics": 25,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": f... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.SimSemantics.SimulateQ
import ToMathlib.Control.OptionT
/-!
# Simulation Semantics through `OptionT` Handlers
Distributivity lemmas for `... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.SimSemantics.SimulateQ
import ToMathlib.Control.OptionT
/-!
# Simulation Semantics through `OptionT` Handlers
Distributivity lemmas for `... | @@ -77,6 +77,30 @@
These are the `List` and `Vector` companions to `simulateQ_optionT_bind_run` /
`simulateQ_optionT_lift`. -/
+/-- `simulateQ` over `List.mapM` in `OptionT`: when each step is `pure (some (g x))`
+under `simulateQ`, the whole `mapM` is `pure (some (l.map g))`. -/
+lemma simulateQ_optionT_list_mapM_... | {
"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_09eef4ff143c_1 | 84fbf0ea88f41120 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/SimSemantics/OptionT/Basic.lean | Basic | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "simulateQ_optionT_list_forIn",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction xs generalizing init with\n | nil =>\n rw [List.forIn_nil, List.forIn_nil]\n exact simul... | [
{
"name": "simulateQ_optionT_bind",
"text": "/-- `simulateQ` distributes through `OptionT.bind`: the simulated OptionT-bind is the\n OptionT-bind of the simulated pieces. -/\nlemma simulateQ_optionT_bind\n (mx : OptionT (OracleComp spec) α) (f : α → OptionT (OracleComp spec) β) :\n simulateQ impl (... | [
{
"name": "simulateQ_optionT_list_forIn",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 26,
"n_chars": 1301,
"n_subproofs": 0,
"n_tactics": 14,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 6,
"automation_only": false,
... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.SimSemantics.SimulateQ
import ToMathlib.Control.OptionT
/-!
# Simulation Semantics through `OptionT` Handlers
Distributivity lemmas for `... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.SimSemantics.SimulateQ
import ToMathlib.Control.OptionT
/-!
# Simulation Semantics through `OptionT` Handlers
Distributivity lemmas for `... | @@ -63,6 +63,14 @@
@[deprecated (since := "2026-06-25")]
alias simulateQ_optionT_bind'' := simulateQ_optionT_bind_elimM
+/-- `simulateQ` distributes through `OptionT.bind`: the simulated OptionT-bind is the
+ OptionT-bind of the simulated pieces. -/
+lemma simulateQ_optionT_bind
+ (mx : OptionT (OracleComp 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_09eef4ff143c_2 | cc4b26535b5cda73 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/SimSemantics/OptionT/Basic.lean | Basic | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "simulateQ_optionT_forIn_yield_pure_some",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [simulateQ_optionT_list_forIn]\n induction xs with\n | nil =>\n rw [List.forIn_nil]\n ... | [
{
"name": "simulateQ_optionT_list_forIn",
"text": "/-- `simulateQ` distributes over an `OptionT`-monadic `forIn` on a list: the `OptionT`-loop\nsibling of `simulateQ_list_forIn`. The body lives in `OptionT (OracleComp spec)`, so the loop is\ndecomposed via `simulateQ_optionT_bind` (rather than the `OracleCo... | [
{
"name": "simulateQ_optionT_forIn_yield_pure_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 30,
"n_chars": 1623,
"n_subproofs": 0,
"n_tactics": 16,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 6,
"n_structural": 2,
"automation_onl... | 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.SimSemantics.SimulateQ
import ToMathlib.Control.OptionT
/-!
# Simulation Semantics through `OptionT` Handlers
Distributivity lemmas for `... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.SimSemantics.SimulateQ
import ToMathlib.Control.OptionT
/-!
# Simulation Semantics through `OptionT` Handlers
Distributivity lemmas for `... | @@ -147,6 +147,31 @@
The `List` companions to `simulateQ_optionT_bind`/`_lift` for an `OptionT`-monadic loop. -/
+/-- `simulateQ` distributes over an `OptionT`-monadic `forIn` on a list: the `OptionT`-loop
+sibling of `simulateQ_list_forIn`. The body lives in `OptionT (OracleComp spec)`, so the loop is
+decomposed... | {
"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_09eef4ff143c_3 | 4663bab6e69629fd | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/SimSemantics/OptionT/Basic.lean | Basic | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "simulateQ_optionT_forIn_yield_pure_some",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [simulateQ_optionT_list_forIn]\n induction xs with\n | nil =>\n rw [List.forIn_nil]\n ... | [
{
"name": "simulateQ_optionT_list_forIn",
"text": "/-- `simulateQ` distributes over an `OptionT`-monadic `forIn` on a list: the `OptionT`-loop\nsibling of `simulateQ_list_forIn`. The body lives in `OptionT (OracleComp spec)`, so the loop is\ndecomposed via `simulateQ_optionT_bind` (rather than the `OracleCo... | [
{
"name": "simulateQ_optionT_forIn_yield_pure_none",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 44,
"n_chars": 2483,
"n_subproofs": 0,
"n_tactics": 25,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 10,
"n_structural": 3,
"automation_on... | 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.SimSemantics.SimulateQ
import ToMathlib.Control.OptionT
/-!
# Simulation Semantics through `OptionT` Handlers
Distributivity lemmas for `... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.SimSemantics.SimulateQ
import ToMathlib.Control.OptionT
/-!
# Simulation Semantics through `OptionT` Handlers
Distributivity lemmas for `... | @@ -147,6 +147,31 @@
The `List` companions to `simulateQ_optionT_bind`/`_lift` for an `OptionT`-monadic loop. -/
+/-- `simulateQ` distributes over an `OptionT`-monadic `forIn` on a list: the `OptionT`-loop
+sibling of `simulateQ_list_forIn`. The body lives in `OptionT (OracleComp spec)`, so the loop is
+decomposed... | {
"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_006a1288ac3a_0 | 27888bc685c98672 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/EvalDist/Instances/OptionT.lean | OptionT | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "probOutput_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [probOutput_def, evalDist_eq, OptionT.mapM', SPMF.bind_apply_eq_tsum]\n refine (tsum_eq_single (some x) fun y hy =... | [
{
"name": "evalDist_eq",
"text": "lemma evalDist_eq (mx : OptionT m α) :\n 𝒟[mx] = OptionT.mapM' (MonadHom.ofLift m SPMF) mx := rfl\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 105,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
... | [
{
"name": "probOutput_eq",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 353,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nesting"... | 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 ToMathlib.Control.OptionT
import VCVio.EvalDist.Defs.AlternativeMonad
import VCVio.EvalDist.Option
/-!
# Probability Distributions on Potentially Failing C... | /-
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 ToMathlib.Control.OptionT
import VCVio.EvalDist.Defs.AlternativeMonad
import VCVio.EvalDist.Option
/-!
# Probability Distributions on Potentially Failing C... | @@ -155,9 +155,17 @@
variable [MonadLiftT m SPMF] [LawfulMonadLiftT m SPMF]
+lemma evalDist_eq (mx : OptionT m α) :
+ 𝒟[mx] = OptionT.mapM' (MonadHom.ofLift m SPMF) mx := rfl
+
@[grind =]
lemma probOutput_eq (mx : OptionT m α) (x : α) :
- Pr[= x | mx] = Pr[= some x | mx.run] := sorry
+ Pr[= x | mx] = 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_d4f8537abeb8_3 | 7d58218b351f6d08 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/ProbabilityTheory/SPMF.lean | SPMF | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "tsum_run_some_ne_top",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n ne_top_of_le_ne_top one_ne_top (p.tsum_run_some_eq_one_sub ▸ tsub_le_self)",
"n_chars": 79,
"n_subproofs": 0,
... | [
{
"name": "tsum_run_some_eq_one_sub",
"text": "lemma tsum_run_some_eq_one_sub (p : SPMF α) :\n ∑' x, p.toPMF (some x) = 1 - p.toPMF none := by\n rw [← tsum_toPMF_some_add_toPMF_none p]\n refine ENNReal.eq_sub_of_add_eq' (by simp) rfl\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 195,
"n_s... | [
{
"name": "tsum_run_some_ne_top",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 4,
"n_chars": 167,
"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) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Monad
import Batteries.Control.AlternativeMonad
import PolyFun.Control.Monad.Hom
public import ToMathlib.Gen... | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Monad
import Batteries.Control.AlternativeMonad
import PolyFun.Control.Monad.Hom
public import ToMathlib.Gen... | @@ -127,6 +127,11 @@
p.toPMF none + (∑' x, p.toPMF (some x)) = 1 := by
rw [← tsum_option _ ENNReal.summable, p.toPMF.tsum_coe]
+lemma tsum_run_some_eq_one_sub (p : SPMF α) :
+ ∑' x, p.toPMF (some x) = 1 - p.toPMF none := by
+ rw [← tsum_toPMF_some_add_toPMF_none p]
+ refine ENNReal.eq_sub_of_add_eq' (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_5841638521de_0 | efc91d654365535c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/CommitmentScheme/Hiding/LoggingBounds/Average.lean | Average | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "run_simulateQ_hidingAvgComp_eq_bind",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hleftrun :\n (simulateQ hidingAvgQueryImpl\n ((HidingAvgSpec M S C).query (Sum.inl ... | [
{
"name": "run_simulateQ_hidingAvgRightImpl_eq_liftComp",
"text": "lemma run_simulateQ_hidingAvgRightImpl_eq_liftComp {α : Type}\n (oa : OracleComp (CMOracle M S C) α)\n (st : HidingCountState M S C) :\n (simulateQ hidingAvgRightImpl oa).run st =\n OracleComp.liftComp ((simulateQ hidingImplCou... | [
{
"name": "run_simulateQ_hidingAvgComp_eq_bind",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 43,
"n_chars": 2000,
"n_subproofs": 1,
"n_tactics": 33,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 7,
"n_structural": 2,
"automation_only": ... | 1 | /-
Copyright (c) 2026 James Waters. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: James Waters
-/
import VCVio.ProgramLogic.Unary.SimulateQ
import Examples.CommitmentScheme.Hiding.CountBounds
/-!
# Averaged logging bounds for commitment-scheme hiding
-/
open OracleS... | /-
Copyright (c) 2026 James Waters. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: James Waters
-/
import VCVio.ProgramLogic.Unary.SimulateQ
import Examples.CommitmentScheme.Hiding.CountBounds
/-!
# Averaged logging bounds for commitment-scheme hiding
-/
open OracleS... | @@ -59,6 +59,35 @@
end experiments
omit [Finite C] [Inhabited C] in
+lemma run_simulateQ_hidingAvgRightImpl_eq_liftComp {α : Type}
+ (oa : OracleComp (CMOracle M S C) α)
+ (st : HidingCountState M S C) :
+ (simulateQ hidingAvgRightImpl oa).run st =
+ OracleComp.liftComp ((simulateQ hidingImplCountAll ... | {
"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_5841638521de_6 | e1c00a3dc177cd5c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/CommitmentScheme/Hiding/LoggingBounds/Average.lean | Average | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "hidingImplSim_bad_mono",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n hidingBad_of_counter_le h (hidingImplSim_counter_le_succ s ms st x hx).1",
"n_chars": 75,
"n_subproofs": 0,
... | [
{
"name": "hidingImplSim_counter_le_succ",
"text": "/-- One-step counter growth bound for `hidingImplSim`:\nthe salt counter is monotone and increases by at most one. -/\ntheorem hidingImplSim_counter_le_succ [Inhabited M] [Inhabited S] (s : S) (ms : M × S)\n (st : QueryCache (CMOracle M S C) × ℕ)\n (... | [
{
"name": "hidingImplSim_bad_mono",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 428,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_... | 2 | /-
Copyright (c) 2026 James Waters. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: James Waters
-/
import VCVio.ProgramLogic.Unary.SimulateQ
import Examples.CommitmentScheme.Hiding.CountBounds
/-!
# Averaged logging bounds for commitment-scheme hiding
-/
open OracleS... | /-
Copyright (c) 2026 James Waters. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: James Waters
-/
import VCVio.ProgramLogic.Unary.SimulateQ
import Examples.CommitmentScheme.Hiding.CountBounds
/-!
# Averaged logging bounds for commitment-scheme hiding
-/
open OracleS... | @@ -66,11 +66,37 @@
simp only [hidingBad] at h ⊢; omega
omit [Finite C] [Inhabited C] in
+/-- One-step counter growth bound for `hidingImplSim`:
+the salt counter is monotone and increases by at most one. -/
+theorem hidingImplSim_counter_le_succ [Inhabited M] [Inhabited S] (s : S) (ms : M × S)
+ (st : QueryCa... | {
"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_8d9c5e108171_0 | b1e17d970374915f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/SimSemantics/StateT/PreservesInv.lean | PreservesInv | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "PreservesInv.compose",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n fun t σ0 hσ0 z hz =>\n OracleComp.simulateQ_run_preservesInv so' Inv h (so t) σ0 hσ0 z\n (by simpa [apply_compose... | [
{
"name": "simulateQ_run_preservesInv",
"text": "/-- If `impl` preserves `Inv`, then simulating *any* oracle computation with `simulateQ impl`\npreserves `Inv` on the final state (support-wise). -/\ntheorem simulateQ_run_preservesInv\n {ι : Type} {spec : OracleSpec ι} {σ α : Type}\n (impl : QueryImpl ... | [
{
"name": "PreservesInv.compose",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 517,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_ne... | 1 | /-
Copyright (c) 2026 VCVio Contributors. 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
import VCVio.OracleComp.SimSemantics.QueryImpl.Constructions
import VCVio.EvalDist.M... | /-
Copyright (c) 2026 VCVio Contributors. 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
import VCVio.OracleComp.SimSemantics.QueryImpl.Constructions
import VCVio.EvalDist.M... | @@ -57,6 +57,33 @@
open QueryImpl
+/-- If `impl` preserves `Inv`, then simulating *any* oracle computation with `simulateQ impl`
+preserves `Inv` on the final state (support-wise). -/
+theorem simulateQ_run_preservesInv
+ {ι : Type} {spec : OracleSpec ι} {σ α : Type}
+ (impl : QueryImpl spec (StateT σ ProbCo... | {
"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_ae7d71f73d56_0 | 939c3d2fd04e0687 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/Interaction/UC/AsyncRuntime.lean | AsyncRuntime | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "processSemantics_eq_processSemanticsAsync_trivial",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold processSemantics processSemanticsAsync\n congr 1\n funext process\n simp only [... | [
{
"name": "runStepsAsync_empty_trivial_eq",
"text": "/--\nUnder the empty env alphabet (`EnvAction.empty Unit`) and the trivial env\nscheduler (always `processTick`), `runStepsAsync` reduces to\n`ProcessOver.runSteps` with the env state pinned to `()` and a constant\n`processTick` trace.\n\nThis is the oper... | [
{
"name": "processSemantics_eq_processSemanticsAsync_trivial",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 38,
"n_chars": 1413,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 1,
"autom... | 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 PolyFun.Interaction.UC.EnvOpenProcess
import VCVio.Interaction.UC.Runtime
/-!
# Asynchronous runtime semantics for env-open processes
This file defines the asynchronou... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import PolyFun.Interaction.UC.EnvOpenProcess
import VCVio.Interaction.UC.Runtime
/-!
# Asynchronous runtime semantics for env-open processes
This file defines the asynchronou... | @@ -236,6 +236,39 @@
procScheduler envScheduler n st'
pure (final, event :: tail)
+/--
+Under the empty env alphabet (`EnvAction.empty Unit`) and the trivial env
+scheduler (always `processTick`), `runStepsAsync` reduces to
+`ProcessOver.runSteps` with the env state pinned to `()` and a constant
+`pro... | {
"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_ae7d71f73d56_1 | f07899a2f34ea47c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/Interaction/UC/AsyncRuntime.lean | AsyncRuntime | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "processSemanticsProbComp_eq_processSemanticsAsyncProbComp_trivial",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n processSemantics_eq_processSemanticsAsync_trivial _ _ _ _ _ _",
"n_chars... | [
{
"name": "processSemantics_eq_processSemanticsAsync_trivial",
"text": "/--\nThe synchronous `processSemantics` is the special case of\n`processSemanticsAsync` instantiated at:\n\n* the empty env alphabet (`EnvAction.empty Unit`, with state `Unit`);\n* the trivial env scheduler (always returns `processTick`... | [
{
"name": "processSemanticsProbComp_eq_processSemanticsAsyncProbComp_trivial",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 31,
"n_chars": 1340,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import PolyFun.Interaction.UC.EnvOpenProcess
import VCVio.Interaction.UC.Runtime
/-!
# Asynchronous runtime semantics for env-open processes
This file defines the asynchronou... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import PolyFun.Interaction.UC.EnvOpenProcess
import VCVio.Interaction.UC.Runtime
/-!
# Asynchronous runtime semantics for env-open processes
This file defines the asynchronou... | @@ -351,6 +351,43 @@
/-! ## Sync recovery -/
/--
+The synchronous `processSemantics` is the special case of
+`processSemanticsAsync` instantiated at:
+
+* the empty env alphabet (`EnvAction.empty Unit`, with state `Unit`);
+* the trivial env scheduler (always returns `processTick`);
+* an `observe` that ignores the... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_40bfa0e421a1_0 | 3bd36f26ed3f7e40 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Loom/Quantitative.lean | Quantitative | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "relTriple_uniformSample_refl",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n relTriple_uniformSample_bij Function.bijective_id post le_rfl",
"n_chars": 64,
"n_subproofs": 0,
"n_t... | [
{
"name": "relTriple_uniformSample_bij",
"text": "/-- Uniform sampling under a bijection for the default quantitative\n`Std.Do'.RelTriple` carrier. -/\ntheorem relTriple_uniformSample_bij [SampleableType α]\n {f : α → α} (hf : Function.Bijective f) (post : α → α → ℝ≥0∞)\n {pre : ℝ≥0∞}\n (hpre : pre... | [
{
"name": "relTriple_uniformSample_refl",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 454,
"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 ToMathlib.Control.Monad.RelWP
import VCVio.ProgramLogic.Relational.Quantitative
import VCVio.ProgramLogic.Unary.Loom.Quantitative
/-!
# Quantitative `RelWP` carrier fo... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelWP
import VCVio.ProgramLogic.Relational.Quantitative
import VCVio.ProgramLogic.Unary.Loom.Quantitative
/-!
# Quantitative `RelWP` carrier fo... | @@ -91,6 +91,16 @@
`VCVio/ProgramLogic/Relational/Quantitative.lean` transports for free
when the user rewrites `Std.Do'.rwp _ _ _ _ _ ↦ eRelWP _ _ _`. -/
+/-- Uniform sampling under a bijection for the default quantitative
+`Std.Do'.RelTriple` carrier. -/
+theorem relTriple_uniformSample_bij [SampleableType α]
+ ... | {
"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_40bfa0e421a1_1 | b43e645a080bc241 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Loom/Quantitative.lean | Quantitative | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "relTriple_query_refl",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n relTriple_query_bij t Function.bijective_id post le_rfl",
"n_chars": 58,
"n_subproofs": 0,
"n_tactics": 1,
... | [
{
"name": "relTriple_query_bij",
"text": "/-- Oracle query under a bijection for the default quantitative\n`Std.Do'.RelTriple` carrier. -/\ntheorem relTriple_query_bij (t : spec₁.Domain)\n {f : spec₁.Range t → spec₁.Range t}\n (hf : Function.Bijective f)\n (post : spec₁.Range t → spec₁.Range t → ℝ≥... | [
{
"name": "relTriple_query_refl",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 788,
"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 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelWP
import VCVio.ProgramLogic.Relational.Quantitative
import VCVio.ProgramLogic.Unary.Loom.Quantitative
/-!
# Quantitative `RelWP` carrier fo... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelWP
import VCVio.ProgramLogic.Relational.Quantitative
import VCVio.ProgramLogic.Unary.Loom.Quantitative
/-!
# Quantitative `RelWP` carrier fo... | @@ -91,6 +91,25 @@
`VCVio/ProgramLogic/Relational/Quantitative.lean` transports for free
when the user rewrites `Std.Do'.rwp _ _ _ _ _ ↦ eRelWP _ _ _`. -/
+/-- Oracle query under a bijection for the default quantitative
+`Std.Do'.RelTriple` carrier. -/
+theorem relTriple_query_bij (t : spec₁.Domain)
+ {f : spec₁... | {
"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_449229c32f51_3 | 9d8ea689f4f27277 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/EvalDist/Defs/Basic.lean | Basic | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "evalDist_ext_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine ⟨fun h => ?_, evalDist_ext⟩\n simp [probOutput_def, h]",
"n_chars": 71,
"n_subproofs": 0,
"n_tactics":... | [
{
"name": "evalDist_ext",
"text": "lemma evalDist_ext {m n} [Monad m] [MonadLiftT m SPMF] [Monad n] [MonadLiftT n SPMF]\n {mx : m α} {mx' : n α} (h : ∀ x, Pr[= x | mx] = Pr[= x | mx']) : 𝒟[mx] = 𝒟[mx'] :=\n SPMF.ext h\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 196,
"n_subproofs": 0,
... | [
{
"name": "evalDist_ext_iff",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 6,
"n_chars": 256,
"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) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.EvalDist.Defs.Support
import ToMathlib.ProbabilityTheory.SPMF
/-!
# Typeclasses for Denotational Monad Semantics
This file builds atop `MonadLiftT m... | /-
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 VCVio.EvalDist.Defs.Support
import ToMathlib.ProbabilityTheory.SPMF
/-!
# Typeclasses for Denotational Monad Semantics
This file builds atop `MonadLiftT m... | @@ -351,8 +351,14 @@
end probability_notation
@[simp] -- TODO: versions for other constructions?
+lemma evalDist_ext {m n} [Monad m] [MonadLiftT m SPMF] [Monad n] [MonadLiftT n SPMF]
+ {mx : m α} {mx' : n α} (h : ∀ x, Pr[= x | mx] = Pr[= x | mx']) : 𝒟[mx] = 𝒟[mx'] :=
+ SPMF.ext h
+
lemma evalDist_ext_iff {m ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7b70b604b1a_0 | 76f2723496c50ce3 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Control/Monad/RelationalAlgebra.lean | RelationalAlgebra | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 4 | [
{
"theorem_name": "triple_conseq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hxy\n exact le_trans hpre (le_trans hxy (relWP_mono x y hpost))",
"n_chars": 75,
"n_subproofs": 0,
"n_tact... | [
{
"name": "relWP_mono",
"text": "theorem relWP_mono (x : m₁ α) (y : m₂ β) {post post' : α → β → l}\n (hpost : ∀ a b, post a b ≤ post' a b) :\n RelWP x y post ≤ RelWP x y post' :=\n MAlgRelOrdered.rwp_mono hpost\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 201,
"n_subproofs": 0,
"n_... | [
{
"name": "triple_conseq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 295,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"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 Mathlib.Order.CompleteLattice.Basic
public import PolyFun.Control.Monad.Algebra
/-!
# Relational monad algebras
This file introduces a two-monad relatio... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Order.CompleteLattice.Basic
public import PolyFun.Control.Monad.Algebra
/-!
# Relational monad algebras
This file introduces a two-monad relatio... | @@ -79,9 +79,16 @@
RelWP (pure a : m₁ α) (pure b : m₂ β) post = post a b :=
MAlgRelOrdered.rwp_pure a b post
+theorem relWP_mono (x : m₁ α) (y : m₂ β) {post post' : α → β → l}
+ (hpost : ∀ a b, post a b ≤ post' a b) :
+ RelWP x y post ≤ RelWP x y post' :=
+ MAlgRelOrdered.rwp_mono hpost
+
theorem trip... | {
"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_b7b70b604b1a_1 | 88c34b68feb8c0b3 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Control/Monad/RelationalAlgebra.lean | RelationalAlgebra | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 5 | [
{
"theorem_name": "triple_bind",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hcut : pre ≤ RelWP x y (fun a b => RelWP (f a) (g b) post) :=\n le_trans hxy (relWP_mono x y hfg)\n exact le_trans hcu... | [
{
"name": "relWP_bind_le",
"text": "theorem relWP_bind_le (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)\n (post : γ → δ → l) :\n RelWP x y (fun a b => RelWP (f a) (g b) post) ≤ RelWP (x >>= f) (y >>= g) post :=\n MAlgRelOrdered.rwp_bind_le x y f g post\n\n",
"fan_in": 5,
"n_lines": 6,
... | [
{
"name": "triple_bind",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 452,
"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 Mathlib.Order.CompleteLattice.Basic
public import PolyFun.Control.Monad.Algebra
/-!
# Relational monad algebras
This file introduces a two-monad relatio... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Order.CompleteLattice.Basic
public import PolyFun.Control.Monad.Algebra
/-!
# Relational monad algebras
This file introduces a two-monad relatio... | @@ -84,12 +84,20 @@
RelWP x y post ≤ RelWP x y post' :=
MAlgRelOrdered.rwp_mono hpost
+theorem relWP_bind_le (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)
+ (post : γ → δ → l) :
+ RelWP x y (fun a b => RelWP (f a) (g b) post) ≤ RelWP (x >>= f) (y >>= g) post :=
+ MAlgRelOrdered.rwp_bind_le x y 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_b7b70b604b1a_2 | b87b28bdc6b7f8d8 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Control/Monad/RelationalAlgebra.lean | RelationalAlgebra | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 5 | [
{
"theorem_name": "triple_bind",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hcut : pre ≤ RelWP x y (fun a b => RelWP (f a) (g b) post) :=\n le_trans hxy (relWP_mono x y hfg)\n exact le_trans hcu... | [
{
"name": "relWP_bind_le",
"text": "theorem relWP_bind_le (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)\n (post : γ → δ → l) :\n RelWP x y (fun a b => RelWP (f a) (g b) post) ≤ RelWP (x >>= f) (y >>= g) post :=\n MAlgRelOrdered.rwp_bind_le x y f g post\n\n",
"fan_in": 5,
"n_lines": 6,
... | [
{
"name": "relWP_map_left",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 417,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"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 Mathlib.Order.CompleteLattice.Basic
public import PolyFun.Control.Monad.Algebra
/-!
# Relational monad algebras
This file introduces a two-monad relatio... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Order.CompleteLattice.Basic
public import PolyFun.Control.Monad.Algebra
/-!
# Relational monad algebras
This file introduces a two-monad relatio... | @@ -79,10 +79,17 @@
RelWP (pure a : m₁ α) (pure b : m₂ β) post = post a b :=
MAlgRelOrdered.rwp_pure a b post
+theorem relWP_bind_le (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)
+ (post : γ → δ → l) :
+ RelWP x y (fun a b => RelWP (f a) (g b) post) ≤ RelWP (x >>= f) (y >>= g) post :=
+ MAlgRelOr... | {
"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_b7b70b604b1a_3 | 6e1e81fa50d5763d | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Control/Monad/RelationalAlgebra.lean | RelationalAlgebra | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 5 | [
{
"theorem_name": "triple_bind",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hcut : pre ≤ RelWP x y (fun a b => RelWP (f a) (g b) post) :=\n le_trans hxy (relWP_mono x y hfg)\n exact le_trans hcu... | [
{
"name": "relWP_bind_le",
"text": "theorem relWP_bind_le (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)\n (post : γ → δ → l) :\n RelWP x y (fun a b => RelWP (f a) (g b) post) ≤ RelWP (x >>= f) (y >>= g) post :=\n MAlgRelOrdered.rwp_bind_le x y f g post\n\n",
"fan_in": 5,
"n_lines": 6,
... | [
{
"name": "relWP_map_right",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 419,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"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 Mathlib.Order.CompleteLattice.Basic
public import PolyFun.Control.Monad.Algebra
/-!
# Relational monad algebras
This file introduces a two-monad relatio... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Order.CompleteLattice.Basic
public import PolyFun.Control.Monad.Algebra
/-!
# Relational monad algebras
This file introduces a two-monad relatio... | @@ -79,10 +79,17 @@
RelWP (pure a : m₁ α) (pure b : m₂ β) post = post a b :=
MAlgRelOrdered.rwp_pure a b post
+theorem relWP_bind_le (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)
+ (post : γ → δ → l) :
+ RelWP x y (fun a b => RelWP (f a) (g b) post) ≤ RelWP (x >>= f) (y >>= g) post :=
+ MAlgRelOr... | {
"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_b7b70b604b1a_4 | 5904b502dc45db3b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Control/Monad/RelationalAlgebra.lean | RelationalAlgebra | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 5 | [
{
"theorem_name": "triple_bind",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hcut : pre ≤ RelWP x y (fun a b => RelWP (f a) (g b) post) :=\n le_trans hxy (relWP_mono x y hfg)\n exact le_trans hcu... | [
{
"name": "relWP_bind_le",
"text": "theorem relWP_bind_le (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)\n (post : γ → δ → l) :\n RelWP x y (fun a b => RelWP (f a) (g b) post) ≤ RelWP (x >>= f) (y >>= g) post :=\n MAlgRelOrdered.rwp_bind_le x y f g post\n\n",
"fan_in": 5,
"n_lines": 6,
... | [
{
"name": "triple_map_left",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 317,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Order.CompleteLattice.Basic
public import PolyFun.Control.Monad.Algebra
/-!
# Relational monad algebras
This file introduces a two-monad relatio... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Order.CompleteLattice.Basic
public import PolyFun.Control.Monad.Algebra
/-!
# Relational monad algebras
This file introduces a two-monad relatio... | @@ -79,10 +79,17 @@
RelWP (pure a : m₁ α) (pure b : m₂ β) post = post a b :=
MAlgRelOrdered.rwp_pure a b post
+theorem relWP_bind_le (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)
+ (post : γ → δ → l) :
+ RelWP x y (fun a b => RelWP (f a) (g b) post) ≤ RelWP (x >>= f) (y >>= g) post :=
+ MAlgRelOr... | {
"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_b7b70b604b1a_5 | fd55da8d55f8951d | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Control/Monad/RelationalAlgebra.lean | RelationalAlgebra | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 5 | [
{
"theorem_name": "triple_bind",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hcut : pre ≤ RelWP x y (fun a b => RelWP (f a) (g b) post) :=\n le_trans hxy (relWP_mono x y hfg)\n exact le_trans hcu... | [
{
"name": "relWP_bind_le",
"text": "theorem relWP_bind_le (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)\n (post : γ → δ → l) :\n RelWP x y (fun a b => RelWP (f a) (g b) post) ≤ RelWP (x >>= f) (y >>= g) post :=\n MAlgRelOrdered.rwp_bind_le x y f g post\n\n",
"fan_in": 5,
"n_lines": 6,
... | [
{
"name": "triple_map_right",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 18,
"n_chars": 789,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesti... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Order.CompleteLattice.Basic
public import PolyFun.Control.Monad.Algebra
/-!
# Relational monad algebras
This file introduces a two-monad relatio... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Order.CompleteLattice.Basic
public import PolyFun.Control.Monad.Algebra
/-!
# Relational monad algebras
This file introduces a two-monad relatio... | @@ -79,10 +79,17 @@
RelWP (pure a : m₁ α) (pure b : m₂ β) post = post a b :=
MAlgRelOrdered.rwp_pure a b post
+theorem relWP_bind_le (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)
+ (post : γ → δ → l) :
+ RelWP x y (fun a b => RelWP (f a) (g b) post) ≤ RelWP (x >>= f) (y >>= g) post :=
+ MAlgRelOr... | {
"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_b7b70b604b1a_6 | 7aac0fa8d6b458d9 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Control/Monad/RelationalAlgebra.lean | RelationalAlgebra | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 5 | [
{
"theorem_name": "triple_bind",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hcut : pre ≤ RelWP x y (fun a b => RelWP (f a) (g b) post) :=\n le_trans hxy (relWP_mono x y hfg)\n exact le_trans hcu... | [
{
"name": "relWP_bind_le",
"text": "theorem relWP_bind_le (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)\n (post : γ → δ → l) :\n RelWP x y (fun a b => RelWP (f a) (g b) post) ≤ RelWP (x >>= f) (y >>= g) post :=\n MAlgRelOrdered.rwp_bind_le x y f g post\n\n",
"fan_in": 5,
"n_lines": 6,
... | [
{
"name": "relWP_bind_left_le",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 440,
"n_subproofs": 1,
"n_tactics": 3,
"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 Mathlib.Order.CompleteLattice.Basic
public import PolyFun.Control.Monad.Algebra
/-!
# Relational monad algebras
This file introduces a two-monad relatio... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Order.CompleteLattice.Basic
public import PolyFun.Control.Monad.Algebra
/-!
# Relational monad algebras
This file introduces a two-monad relatio... | @@ -79,10 +79,17 @@
RelWP (pure a : m₁ α) (pure b : m₂ β) post = post a b :=
MAlgRelOrdered.rwp_pure a b post
+theorem relWP_bind_le (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)
+ (post : γ → δ → l) :
+ RelWP x y (fun a b => RelWP (f a) (g b) post) ≤ RelWP (x >>= f) (y >>= g) post :=
+ MAlgRelOr... | {
"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_b7b70b604b1a_7 | 8dca880142bad2da | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Control/Monad/RelationalAlgebra.lean | RelationalAlgebra | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 5 | [
{
"theorem_name": "triple_bind",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hcut : pre ≤ RelWP x y (fun a b => RelWP (f a) (g b) post) :=\n le_trans hxy (relWP_mono x y hfg)\n exact le_trans hcu... | [
{
"name": "relWP_bind_le",
"text": "theorem relWP_bind_le (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)\n (post : γ → δ → l) :\n RelWP x y (fun a b => RelWP (f a) (g b) post) ≤ RelWP (x >>= f) (y >>= g) post :=\n MAlgRelOrdered.rwp_bind_le x y f g post\n\n",
"fan_in": 5,
"n_lines": 6,
... | [
{
"name": "relWP_bind_right_le",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 441,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"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
-/
module
public import Mathlib.Order.CompleteLattice.Basic
public import PolyFun.Control.Monad.Algebra
/-!
# Relational monad algebras
This file introduces a two-monad relatio... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Order.CompleteLattice.Basic
public import PolyFun.Control.Monad.Algebra
/-!
# Relational monad algebras
This file introduces a two-monad relatio... | @@ -79,10 +79,17 @@
RelWP (pure a : m₁ α) (pure b : m₂ β) post = post a b :=
MAlgRelOrdered.rwp_pure a b post
+theorem relWP_bind_le (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)
+ (post : γ → δ → l) :
+ RelWP x y (fun a b => RelWP (f a) (g b) post) ≤ RelWP (x >>= f) (y >>= g) post :=
+ MAlgRelOr... | {
"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_b7b70b604b1a_8 | fcb899994ac945fa | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Control/Monad/RelationalAlgebra.lean | RelationalAlgebra | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 5 | [
{
"theorem_name": "triple_bind",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hcut : pre ≤ RelWP x y (fun a b => RelWP (f a) (g b) post) :=\n le_trans hxy (relWP_mono x y hfg)\n exact le_trans hcu... | [
{
"name": "relWP_bind_le",
"text": "theorem relWP_bind_le (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)\n (post : γ → δ → l) :\n RelWP x y (fun a b => RelWP (f a) (g b) post) ≤ RelWP (x >>= f) (y >>= g) post :=\n MAlgRelOrdered.rwp_bind_le x y f g post\n\n",
"fan_in": 5,
"n_lines": 6,
... | [
{
"name": "triple_bind_left",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 603,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"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
-/
module
public import Mathlib.Order.CompleteLattice.Basic
public import PolyFun.Control.Monad.Algebra
/-!
# Relational monad algebras
This file introduces a two-monad relatio... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Order.CompleteLattice.Basic
public import PolyFun.Control.Monad.Algebra
/-!
# Relational monad algebras
This file introduces a two-monad relatio... | @@ -84,10 +84,17 @@
RelWP x y post ≤ RelWP x y post' :=
MAlgRelOrdered.rwp_mono hpost
+theorem relWP_bind_le (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)
+ (post : γ → δ → l) :
+ RelWP x y (fun a b => RelWP (f a) (g b) post) ≤ RelWP (x >>= f) (y >>= g) post :=
+ MAlgRelOrdered.rwp_bind_le x y 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_b7b70b604b1a_9 | 872857675082d3c6 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Control/Monad/RelationalAlgebra.lean | RelationalAlgebra | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 5 | [
{
"theorem_name": "triple_bind",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hcut : pre ≤ RelWP x y (fun a b => RelWP (f a) (g b) post) :=\n le_trans hxy (relWP_mono x y hfg)\n exact le_trans hcu... | [
{
"name": "relWP_bind_le",
"text": "theorem relWP_bind_le (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)\n (post : γ → δ → l) :\n RelWP x y (fun a b => RelWP (f a) (g b) post) ≤ RelWP (x >>= f) (y >>= g) post :=\n MAlgRelOrdered.rwp_bind_le x y f g post\n\n",
"fan_in": 5,
"n_lines": 6,
... | [
{
"name": "triple_bind_right",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 24,
"n_chars": 1070,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nes... | 3 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Order.CompleteLattice.Basic
public import PolyFun.Control.Monad.Algebra
/-!
# Relational monad algebras
This file introduces a two-monad relatio... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Order.CompleteLattice.Basic
public import PolyFun.Control.Monad.Algebra
/-!
# Relational monad algebras
This file introduces a two-monad relatio... | @@ -84,10 +84,17 @@
RelWP x y post ≤ RelWP x y post' :=
MAlgRelOrdered.rwp_mono hpost
+theorem relWP_bind_le (x : m₁ α) (y : m₂ β) (f : α → m₁ γ) (g : β → m₂ δ)
+ (post : γ → δ → l) :
+ RelWP x y (fun a b => RelWP (f a) (g b) post) ≤ RelWP (x >>= f) (y >>= g) post :=
+ MAlgRelOrdered.rwp_bind_le x y 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_b2eb81750b99_4 | 4f09b6f958444ae5 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryCost.lean | QueryCost | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "expectedQueries_le_tsum_of_tail_probs_le",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n (HasQuery.expectedQueries_eq_tsum_tail_probs oa runtime).trans_le (ENNReal.tsum_le_tsum h)",
"n_c... | [
{
"name": "expectedQueries_eq_tsum_tail_probs",
"text": "/-- Tail-sum formula for the expected number of oracle queries made by `oa` in `runtime`:\n\n`E[number of queries] = ∑ i, Pr[i < number of queries]`.\n\nThis is the generic `HasQuery` version of [`AddWriterT.expectedCostNat_eq_tsum_tail_probs`]. -/\nl... | [
{
"name": "expectedQueries_le_tsum_of_tail_probs_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 566,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"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.QueryTracking.WriterCost
/-!
# Query Cost Accounting
This file defines the `HasQuery`-level accounting surface for direct-style query programs.
A dir... | /-
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.WriterCost
/-!
# Query Cost Accounting
This file defines the `HasQuery`-level accounting surface for direct-style query programs.
A dir... | @@ -163,6 +163,20 @@
omit [LawfulMonadLiftT m SPMF] [MonadLiftT m SetM] [LawfulMonadLiftT m SetM] [EvalDistCompatible m]
in
+/-- Tail-sum formula for the expected number of oracle queries made by `oa` in `runtime`:
+
+`E[number of queries] = ∑ i, Pr[i < number of queries]`.
+
+This is the generic `HasQuery` ver... | {
"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_ab3a64983907_0 | 783931d6012609f9 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Leakage.lean | Leakage | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "probLeakFree_of_leakageBound_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n probLeakFree_iff_leakageBound_zero.mpr h",
"n_chars": 43,
"n_subproofs": 0,
"n_tactics": 1,
... | [
{
"name": "probLeakFree_iff_leakageBound_zero",
"text": "/-- `ProbLeakFree` is equivalent to `LeakageBound 0`. -/\ntheorem probLeakFree_iff_leakageBound_zero\n [IsUniformSpec spec₁] [IsUniformSpec spec₂]\n {oa₁ : OracleComp spec₁ (α × ω)} {oa₂ : OracleComp spec₂ (β × ω)} :\n ProbLeakFree oa₁ oa₂ ↔ ... | [
{
"name": "probLeakFree_of_leakageBound_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 353,
"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.Relational.Quantitative
import VCVio.EvalDist.TVDist
/-!
# Leakage Judgments for Side-Channel Reasoning
This file defines three leakage judgments 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.ProgramLogic.Relational.Quantitative
import VCVio.EvalDist.TVDist
/-!
# Leakage Judgments for Side-Channel Reasoning
This file defines three leakage judgments of... | @@ -78,6 +78,14 @@
/-! ### Bridge Lemmas -/
+/-- `ProbLeakFree` is equivalent to `LeakageBound 0`. -/
+theorem probLeakFree_iff_leakageBound_zero
+ [IsUniformSpec spec₁] [IsUniformSpec spec₂]
+ {oa₁ : OracleComp spec₁ (α × ω)} {oa₂ : OracleComp spec₂ (β × ω)} :
+ ProbLeakFree oa₁ oa₂ ↔ LeakageBound 0 oa₁ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_ab3a64983907_1 | 7615e2c71060d812 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Leakage.lean | Leakage | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "probLeakFree_bind_of_trace_only",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [ProbLeakFree, snd_map_bind_snd _ f, snd_map_bind_snd _ g, evalDist_bind, evalDist_bind, h]\n exact con... | [
{
"name": "snd_map_bind_snd",
"text": "private lemma snd_map_bind_snd {m : Type → Type _} [Monad m] [LawfulMonad m]\n {α' ω₁ γ' ω₂ : Type} (mx : m (α' × ω₁)) (f : ω₁ → m (γ' × ω₂)) :\n Prod.snd <$> (mx >>= fun z => f z.2) =\n (Prod.snd <$> mx) >>= fun w => Prod.snd <$> f w := by\n simp only [monad... | [
{
"name": "probLeakFree_bind_of_trace_only",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 706,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"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.ProgramLogic.Relational.Quantitative
import VCVio.EvalDist.TVDist
/-!
# Leakage Judgments for Side-Channel Reasoning
This file defines three leakage judgments 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.ProgramLogic.Relational.Quantitative
import VCVio.EvalDist.TVDist
/-!
# Leakage Judgments for Side-Channel Reasoning
This file defines three leakage judgments of... | @@ -91,6 +91,12 @@
LeakageBound 0 oa oa := by
simp [LeakageBound]
+private lemma snd_map_bind_snd {m : Type → Type _} [Monad m] [LawfulMonad m]
+ {α' ω₁ γ' ω₂ : Type} (mx : m (α' × ω₁)) (f : ω₁ → m (γ' × ω₂)) :
+ Prod.snd <$> (mx >>= fun z => f z.2) =
+ (Prod.snd <$> mx) >>= fun w => Prod.snd <$> f 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_ab3a64983907_2 | 79c51e5f661dfa75 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Leakage.lean | Leakage | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "probLeakFree_bind_of_trace_only",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [ProbLeakFree, snd_map_bind_snd _ f, snd_map_bind_snd _ g, evalDist_bind, evalDist_bind, h]\n exact con... | [
{
"name": "snd_map_bind_snd",
"text": "private lemma snd_map_bind_snd {m : Type → Type _} [Monad m] [LawfulMonad m]\n {α' ω₁ γ' ω₂ : Type} (mx : m (α' × ω₁)) (f : ω₁ → m (γ' × ω₂)) :\n Prod.snd <$> (mx >>= fun z => f z.2) =\n (Prod.snd <$> mx) >>= fun w => Prod.snd <$> f w := by\n simp only [monad... | [
{
"name": "leakageBound_bind_of_trace_only",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 856,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"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.ProgramLogic.Relational.Quantitative
import VCVio.EvalDist.TVDist
/-!
# Leakage Judgments for Side-Channel Reasoning
This file defines three leakage judgments 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.ProgramLogic.Relational.Quantitative
import VCVio.EvalDist.TVDist
/-!
# Leakage Judgments for Side-Channel Reasoning
This file defines three leakage judgments of... | @@ -91,6 +91,12 @@
LeakageBound 0 oa oa := by
simp [LeakageBound]
+private lemma snd_map_bind_snd {m : Type → Type _} [Monad m] [LawfulMonad m]
+ {α' ω₁ γ' ω₂ : Type} (mx : m (α' × ω₁)) (f : ω₁ → m (γ' × ω₂)) :
+ Prod.snd <$> (mx >>= fun z => f z.2) =
+ (Prod.snd <$> mx) >>= fun w => Prod.snd <$> f 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_1cd3653057ff_23 | 8fd72540cf0cbd2d | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/StateSeparating/CellRef.lean | CellRef | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 8 | [
{
"theorem_name": "CellWriteFootprint.prob_changed_eq_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n (footprint.preservesCell r hr).prob_changed_eq_zero t h",
"n_chars": 58,
"n_subproofs": 0,
... | [
{
"name": "preservesCell",
"text": "theorem preservesCell {impl : QueryImpl spec (StateT (Heap Ident₀) m)}\n (footprint : CellWriteFootprint impl) (r : CellRef Ident₀)\n (hr : ∀ t, r.id ∉ footprint.writes t) :\n PreservesCell impl r :=\n preservesCell_of_writesOnlyCells footprint.sound hr\n\n",
... | [
{
"name": "CellWriteFootprint.simulateQ_run_cellUnchanged_prob_eq_one",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 7,
"n_lines": 10,
"n_chars": 456,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Data.Heap
import VCVio.EvalDist.Defs.Instances
import VCVio.OracleComp.ProbComp
import VCVio.OracleComp.SimSemantics.QueryImpl.Constructions
/-!
# State-separ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Data.Heap
import VCVio.EvalDist.Defs.Instances
import VCVio.OracleComp.ProbComp
import VCVio.OracleComp.SimSemantics.QueryImpl.Constructions
/-!
# State-separ... | @@ -568,6 +568,12 @@
namespace CellWriteFootprint
+theorem preservesCell {impl : QueryImpl spec (StateT (Heap Ident₀) m)}
+ (footprint : CellWriteFootprint impl) (r : CellRef Ident₀)
+ (hr : ∀ t, r.id ∉ footprint.writes t) :
+ PreservesCell impl r :=
+ preservesCell_of_writesOnlyCells footprint.sound hr
... | {
"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_cdb0a188027f_0 | 273f07de2ce17a26 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Inductive/Completeness.lean | Completeness | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "completeness",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine (probEvent_eq_one_simulateQ_randomOracle_run_iff (spec := spec α)\n (p := fun b : Bool => b = true) _ _).mpr ?_\n i... | [
{
"name": "functional_completeness",
"text": "/--\nA functional form of the completeness theorem for Merkle trees.\nThis references the functional versions of `getPutativeRoot` and `buildMerkleTreeWithHash`\n-/\n@[simp, grind =]\ntheorem functional_completeness {s : Skeleton}\n (idx : SkeletonLeafIndex s... | [
{
"name": "completeness",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 27,
"n_chars": 1193,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 3,
"automation_only": false,
"max_nesting"... | 1 | /-
Copyright (c) 2024 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.Defs
import VCVio.OracleComp.QueryTracking.RandomOracle.Simulation
/-!
# Completeness of Inductive Merkle Trees
This file... | /-
Copyright (c) 2024 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.Defs
import VCVio.OracleComp.QueryTracking.RandomOracle.Simulation
/-!
# Completeness of Inductive Merkle Trees
This file... | @@ -30,6 +30,24 @@
variable {α : Type _}
/--
+A functional form of the completeness theorem for Merkle trees.
+This references the functional versions of `getPutativeRoot` and `buildMerkleTreeWithHash`
+-/
+@[simp, grind =]
+theorem functional_completeness {s : Skeleton}
+ (idx : SkeletonLeafIndex s)
+ (leaf_... | {
"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_88292af59dc6_0 | 19493ee7ca1bfbdc | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/Ring/Norms.lean | Norms | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "centeredRepr_eq_valMinAbs",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa using ((ZMod.valMinAbs_spec x (centeredRepr x)).2\n ⟨centeredRepr_intCast x, centeredRepr_mem_Ioc x⟩).sy... | [
{
"name": "centeredRepr_intCast",
"text": "/-- Casting the centered representative back into `ZMod q` recovers the original element. -/\ntheorem centeredRepr_intCast (x : ZMod q) :\n (x : ZMod q) = ((centeredRepr x : ℤ) : ZMod q) := by\n by_cases h : (x.val : ℤ) ≤ (q : ℤ) / 2\n · rw [centeredRepr_of_le... | [
{
"name": "centeredRepr_eq_valMinAbs",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 7,
"n_chars": 275,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"ma... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.Ring.VectorBackend
import Mathlib.Data.ZMod.Basic
import Mathlib.Data.ZMod.ValMinAbs
/-!
# Norms For Negacyclic Ring Backends
Backend-generic norm infras... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.Ring.VectorBackend
import Mathlib.Data.ZMod.Basic
import Mathlib.Data.ZMod.ValMinAbs
/-!
# Norms For Negacyclic Ring Backends
Backend-generic norm infras... | @@ -92,6 +92,16 @@
have hpos : 0 < x.val := Nat.pos_of_ne_zero ((ZMod.val_ne_zero x).mpr hx)
split_ifs <;> omega
+/-- Casting the centered representative back into `ZMod q` recovers the original element. -/
+theorem centeredRepr_intCast (x : ZMod q) :
+ (x : ZMod q) = ((centeredRepr x : ℤ) : ZMod q) := 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_88292af59dc6_1 | 48b4da195380704c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/Ring/Norms.lean | Norms | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "centeredRepr_eq_valMinAbs",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa using ((ZMod.valMinAbs_spec x (centeredRepr x)).2\n ⟨centeredRepr_intCast x, centeredRepr_mem_Ioc x⟩).sy... | [
{
"name": "centeredRepr_intCast",
"text": "/-- Casting the centered representative back into `ZMod q` recovers the original element. -/\ntheorem centeredRepr_intCast (x : ZMod q) :\n (x : ZMod q) = ((centeredRepr x : ℤ) : ZMod q) := by\n by_cases h : (x.val : ℤ) ≤ (q : ℤ) / 2\n · rw [centeredRepr_of_le... | [
{
"name": "centeredRepr_intCast_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 8,
"n_chars": 333,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max... | 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 LatticeCrypto.Ring.VectorBackend
import Mathlib.Data.ZMod.Basic
import Mathlib.Data.ZMod.ValMinAbs
/-!
# Norms For Negacyclic Ring Backends
Backend-generic norm infras... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.Ring.VectorBackend
import Mathlib.Data.ZMod.Basic
import Mathlib.Data.ZMod.ValMinAbs
/-!
# Norms For Negacyclic Ring Backends
Backend-generic norm infras... | @@ -92,6 +92,16 @@
have hpos : 0 < x.val := Nat.pos_of_ne_zero ((ZMod.val_ne_zero x).mpr hx)
split_ifs <;> omega
+/-- Casting the centered representative back into `ZMod q` recovers the original element. -/
+theorem centeredRepr_intCast (x : ZMod q) :
+ (x : ZMod q) = ((centeredRepr x : ℤ) : ZMod q) := 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_88292af59dc6_2 | 00214b3864ed5c4a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/Ring/Norms.lean | Norms | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "centeredRepr_eq_valMinAbs",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa using ((ZMod.valMinAbs_spec x (centeredRepr x)).2\n ⟨centeredRepr_intCast x, centeredRepr_mem_Ioc x⟩).sy... | [
{
"name": "centeredRepr_intCast",
"text": "/-- Casting the centered representative back into `ZMod q` recovers the original element. -/\ntheorem centeredRepr_intCast (x : ZMod q) :\n (x : ZMod q) = ((centeredRepr x : ℤ) : ZMod q) := by\n by_cases h : (x.val : ℤ) ≤ (q : ℤ) / 2\n · rw [centeredRepr_of_le... | [
{
"name": "centeredRepr_intCast_eq_of_natAbs_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 11,
"n_chars": 378,
"n_subproofs": 2,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": f... | 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 LatticeCrypto.Ring.VectorBackend
import Mathlib.Data.ZMod.Basic
import Mathlib.Data.ZMod.ValMinAbs
/-!
# Norms For Negacyclic Ring Backends
Backend-generic norm infras... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.Ring.VectorBackend
import Mathlib.Data.ZMod.Basic
import Mathlib.Data.ZMod.ValMinAbs
/-!
# Norms For Negacyclic Ring Backends
Backend-generic norm infras... | @@ -92,6 +92,16 @@
have hpos : 0 < x.val := Nat.pos_of_ne_zero ((ZMod.val_ne_zero x).mpr hx)
split_ifs <;> omega
+/-- Casting the centered representative back into `ZMod q` recovers the original element. -/
+theorem centeredRepr_intCast (x : ZMod q) :
+ (x : ZMod q) = ((centeredRepr x : ℤ) : ZMod q) := 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_88292af59dc6_3 | ce897aa51c28f7c6 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/Ring/Norms.lean | Norms | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "cInfNorm_le_halfq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cInfNorm_le_iff.mpr (fun i => centeredRepr_abs_le (p.get i))",
"n_chars": 63,
"n_subproofs": 0,
"n_tactics": 1,
... | [
{
"name": "centeredRepr_abs_le",
"text": "/-- The centered representative has absolute value at most `q / 2`. -/\ntheorem centeredRepr_abs_le (x : ZMod q) : (centeredRepr x).natAbs ≤ q / 2 := by\n simp only [centeredRepr]\n have hval := ZMod.val_lt x\n split_ifs with h <;> omega\n\n",
"fan_in": 1,
... | [
{
"name": "cInfNorm_le_halfq",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 206,
"n_subproofs": 0,
"n_tactics": 1,
"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
-/
import LatticeCrypto.Ring.VectorBackend
import Mathlib.Data.ZMod.Basic
import Mathlib.Data.ZMod.ValMinAbs
/-!
# Norms For Negacyclic Ring Backends
Backend-generic norm infras... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.Ring.VectorBackend
import Mathlib.Data.ZMod.Basic
import Mathlib.Data.ZMod.ValMinAbs
/-!
# Norms For Negacyclic Ring Backends
Backend-generic norm infras... | @@ -81,6 +81,12 @@
unfold centeredRepr
exact if_neg (not_le.mpr h)
+/-- The centered representative has absolute value at most `q / 2`. -/
+theorem centeredRepr_abs_le (x : ZMod q) : (centeredRepr x).natAbs ≤ q / 2 := by
+ simp only [centeredRepr]
+ have hval := ZMod.val_lt x
+ split_ifs with h <;> omega
+
... | {
"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_88292af59dc6_4 | fd18732afc9cf94e | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/Ring/Norms.lean | Norms | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "cInfNorm_neg",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [cInfNorm, cInfNormOf, vectorBackend, zmodCenteredCoeffView]\n congr 1\n ext i\n have hneg : (-f).get i = -(f.get... | [
{
"name": "centeredRepr_natAbs_neg",
"text": "/-- Negation preserves the absolute value of the centered representative. -/\ntheorem centeredRepr_natAbs_neg (x : ZMod q) :\n (centeredRepr (-x)).natAbs = (centeredRepr x).natAbs := by\n by_cases hx : x = 0\n · simp [hx]\n · haveI : NeZero x := ⟨hx⟩\n ... | [
{
"name": "cInfNorm_neg",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 327,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nesting": ... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.Ring.VectorBackend
import Mathlib.Data.ZMod.Basic
import Mathlib.Data.ZMod.ValMinAbs
/-!
# Norms For Negacyclic Ring Backends
Backend-generic norm infras... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.Ring.VectorBackend
import Mathlib.Data.ZMod.Basic
import Mathlib.Data.ZMod.ValMinAbs
/-!
# Norms For Negacyclic Ring Backends
Backend-generic norm infras... | @@ -81,6 +81,17 @@
unfold centeredRepr
exact if_neg (not_le.mpr h)
+/-- Negation preserves the absolute value of the centered representative. -/
+theorem centeredRepr_natAbs_neg (x : ZMod q) :
+ (centeredRepr (-x)).natAbs = (centeredRepr x).natAbs := by
+ by_cases hx : x = 0
+ · simp [hx]
+ · haveI : NeZe... | {
"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_2e8b491cee1e_0 | 6b1a50ed2a4c3eaa | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/EvalDistCompatible/Basic.lean | Basic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "probFailure_maybeHeads",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [probFailure_eq_sub_tsum,\n tsum_eq_single () (fun x hx => absurd (Subsingleton.elim x ()) hx),\n probO... | [
{
"name": "probOutput_maybeHeads",
"text": "/-- The success branch has probability `1/2`. The proof routes\n`Pr[…]` through `MonadLiftT (OptionT ProbComp) SPMF` and reduces to the\ngeneric `OracleComp` lemma `probOutput_uniformSample`. -/\ntheorem probOutput_maybeHeads : Pr[= () | maybeHeads] = 1 / 2 := by\... | [
{
"name": "probFailure_maybeHeads",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 385,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_... | 1 | /-
Copyright (c) 2026 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import VCVio.OracleComp.Constructions.SampleableType
import VCVio.EvalDist.Instances.OptionT
/-!
# Compositional probability reasoning via `MonadLiftT`
This example demonst... | /-
Copyright (c) 2026 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import VCVio.OracleComp.Constructions.SampleableType
import VCVio.EvalDist.Instances.OptionT
/-!
# Compositional probability reasoning via `MonadLiftT`
This example demonst... | @@ -33,9 +33,24 @@
let b ← (liftM ($ᵗ Bool) : OptionT ProbComp Bool)
guard (b = true)
+/-- The success branch has probability `1/2`. The proof routes
+`Pr[…]` through `MonadLiftT (OptionT ProbComp) SPMF` and reduces to the
+generic `OracleComp` lemma `probOutput_uniformSample`. -/
+theorem probOutput_maybeHeads... | {
"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_2e8b491cee1e_1 | 5e2c11cf339b4882 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/EvalDistCompatible/Basic.lean | Basic | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "probOutput_add_probFailure_maybeHeads",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [probOutput_maybeHeads, probFailure_maybeHeads, ENNReal.add_halves]",
"n_chars": 76,
"n_su... | [
{
"name": "probFailure_maybeHeads",
"text": "/-- The failure mass has probability `1/2`. Because `maybeHeads` returns\n`Unit`, the total support mass at `()` plus the failure mass is `1`. -/\ntheorem probFailure_maybeHeads : Pr[⊥ | maybeHeads] = 1 / 2 := by\n rw [probFailure_eq_sub_tsum,\n tsum_eq_sin... | [
{
"name": "probOutput_add_probFailure_maybeHeads",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 358,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": f... | 2 | /-
Copyright (c) 2026 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import VCVio.OracleComp.Constructions.SampleableType
import VCVio.EvalDist.Instances.OptionT
/-!
# Compositional probability reasoning via `MonadLiftT`
This example demonst... | /-
Copyright (c) 2026 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import VCVio.OracleComp.Constructions.SampleableType
import VCVio.EvalDist.Instances.OptionT
/-!
# Compositional probability reasoning via `MonadLiftT`
This example demonst... | @@ -45,11 +45,19 @@
rw [tsum_fintype (L := .unconditional _), Fintype.sum_bool]
simp [probOutput_uniformSample, Fintype.card_bool]
+/-- The failure mass has probability `1/2`. Because `maybeHeads` returns
+`Unit`, the total support mass at `()` plus the failure mass is `1`. -/
+theorem probFailure_maybeHeads : ... | {
"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_fa5b083f03c6_0 | 1e5210e95a030230 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 3 | [
{
"theorem_name": "relTriple_simulateQ_run'",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := relTriple_simulateQ_run impl₁ impl₂ R_state oa himpl s₁ s₂ hs\n have h_weak : RelTriple ((simulateQ imp... | [
{
"name": "relTriple_simulateQ_run",
"text": "/-- Core relational `simulateQ` theorem with state invariant.\nIf two oracle implementations produce equal outputs and preserve a state invariant `R_state`,\nthen the full simulation also preserves the invariant and output equality. -/\ntheorem relTriple_simulat... | [
{
"name": "relTriple_simulateQ_run'",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 26,
"n_chars": 1227,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 4,
"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.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -40,6 +40,36 @@
/-! ## Relational simulateQ rules -/
+/-- Core relational `simulateQ` theorem with state invariant.
+If two oracle implementations produce equal outputs and preserve a state invariant `R_state`,
+then the full simulation also preserves the invariant and output equality. -/
+theorem relTriple_sim... | {
"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_fa5b083f03c6_1 | 5f726c1eb2a03410 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 3 | [
{
"theorem_name": "relTriple_simulateQ_run'",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := relTriple_simulateQ_run impl₁ impl₂ R_state oa himpl s₁ s₂ hs\n have h_weak : RelTriple ((simulateQ imp... | [
{
"name": "relTriple_simulateQ_run",
"text": "/-- Core relational `simulateQ` theorem with state invariant.\nIf two oracle implementations produce equal outputs and preserve a state invariant `R_state`,\nthen the full simulation also preserves the invariant and output equality. -/\ntheorem relTriple_simulat... | [
{
"name": "probEvent_le_of_relTriple_simulateQ_run",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 28,
"n_chars": 1742,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"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.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -40,6 +40,36 @@
/-! ## Relational simulateQ rules -/
+/-- Core relational `simulateQ` theorem with state invariant.
+If two oracle implementations produce equal outputs and preserve a state invariant `R_state`,
+then the full simulation also preserves the invariant and output equality. -/
+theorem relTriple_sim... | {
"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_fa5b083f03c6_2 | 566058b639a80177 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 1 | [
{
"theorem_name": "relTriple_simulateQ_run'_of_impl_evalDist_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine relTriple_simulateQ_run' impl₁ impl₂ Eq oa ?_ s₁ s₂ hs\n intro t s₁ s₂ hs'\n cases hs... | [
{
"name": "relTriple_simulateQ_run'",
"text": "/-- Projection: relational `simulateQ` preserving only output equality. -/\ntheorem relTriple_simulateQ_run'\n {ι₁ ι₂ : Type u} {spec₁ : OracleSpec ι₁} {spec₂ : OracleSpec ι₂}\n [IsUniformSpec spec₁] [IsUniformSpec spec₂] {σ₁ σ₂ : Type}\n (impl₁ : Quer... | [
{
"name": "relTriple_simulateQ_run'_of_impl_evalDist_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 27,
"n_chars": 1224,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 4,
"automation... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -70,6 +70,31 @@
exact (relTriple_bind (himpl t s₁ s₂ hs) (fun ⟨u₁, s₁'⟩ ⟨u₂, s₂'⟩ ⟨eq_u, hs'⟩ => by
dsimp at eq_u hs' ⊢; subst eq_u; exact ih u₁ s₁' s₂' hs')) trivial
+/-- Projection: relational `simulateQ` preserving only output equality. -/
+theorem relTriple_simulateQ_run'
+ {ι₁ ι₂ : Type u} {spe... | {
"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_fa5b083f03c6_3 | 60b28ea4f9f775ef | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 2 | [
{
"theorem_name": "relTriple_simulateQ_run_writerT_of_impl_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine relTriple_post_mono\n (relTriple_simulateQ_run_writerT (spec₁ := spec₁) (spec₂ := spe... | [
{
"name": "relTriple_simulateQ_run_writerT",
"text": "/-- `WriterT` analogue of `relTriple_simulateQ_run`.\n\nIf two writer-transformed oracle implementations produce outputs related by a reflexive-and-closed\nrelation `R_writer` on the accumulated logs, then the full simulation preserves output equality\nt... | [
{
"name": "relTriple_simulateQ_run_writerT_of_impl_eq",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 43,
"n_chars": 1806,
"n_subproofs": 1,
"n_tactics": 22,
"cyclomatic": 3,
"n_automation": 7,
"n_rewrites": 2,
"n_structural": 8,
"automation_... | 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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -40,6 +40,52 @@
/-! ## Relational simulateQ rules -/
+/-- `WriterT` analogue of `relTriple_simulateQ_run`.
+
+If two writer-transformed oracle implementations produce outputs related by a reflexive-and-closed
+relation `R_writer` on the accumulated logs, then the full simulation preserves output equality
+toget... | {
"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_fa5b083f03c6_4 | 1b465b4a3b01a0f4 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 2 | [
{
"theorem_name": "probOutput_simulateQ_run_writerT_eq_of_impl_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n probOutput_eq_of_relTriple_eqRel\n (relTriple_simulateQ_run_writerT_of_impl_eq impl₁ impl₂ h... | [
{
"name": "relTriple_simulateQ_run_writerT_of_impl_eq",
"text": "/-- `WriterT` analogue of `relTriple_simulateQ_run_of_impl_eq_preservesInv`.\n\nIf two writer-transformed oracle implementations agree pointwise on\n`.run` (i.e. every per-query increment is identical as an `OracleComp`),\nthen the whole simul... | [
{
"name": "probOutput_simulateQ_run_writerT_eq_of_impl_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 16,
"n_chars": 757,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automatio... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -86,6 +86,48 @@
rintro ⟨a, v₁⟩ ⟨b, v₂⟩ ⟨hab, hv⟩
exact ⟨hab, hR_mul _ _ _ _ hw hv⟩
+/-- `WriterT` analogue of `relTriple_simulateQ_run_of_impl_eq_preservesInv`.
+
+If two writer-transformed oracle implementations agree pointwise on
+`.run` (i.e. every per-query increment is identical as an `OracleComp`),... | {
"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_fa5b083f03c6_5 | dc09c465f4a31532 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 2 | [
{
"theorem_name": "probOutput_simulateQ_run_writerT_eq_of_impl_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n probOutput_eq_of_relTriple_eqRel\n (relTriple_simulateQ_run_writerT_of_impl_eq impl₁ impl₂ h... | [
{
"name": "relTriple_simulateQ_run_writerT_of_impl_eq",
"text": "/-- `WriterT` analogue of `relTriple_simulateQ_run_of_impl_eq_preservesInv`.\n\nIf two writer-transformed oracle implementations agree pointwise on\n`.run` (i.e. every per-query increment is identical as an `OracleComp`),\nthen the whole simul... | [
{
"name": "evalDist_simulateQ_run_writerT_eq_of_impl_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 611,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -86,6 +86,48 @@
rintro ⟨a, v₁⟩ ⟨b, v₂⟩ ⟨hab, hv⟩
exact ⟨hab, hR_mul _ _ _ _ hw hv⟩
+/-- `WriterT` analogue of `relTriple_simulateQ_run_of_impl_eq_preservesInv`.
+
+If two writer-transformed oracle implementations agree pointwise on
+`.run` (i.e. every per-query increment is identical as an `OracleComp`),... | {
"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_fa5b083f03c6_6 | 01ba9e9f428e43e6 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 2 | [
{
"theorem_name": "relTriple_simulateQ_run_writerT_of_impl_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine relTriple_post_mono\n (relTriple_simulateQ_run_writerT (spec₁ := spec₁) (spec₂ := spe... | [
{
"name": "relTriple_simulateQ_run_writerT",
"text": "/-- `WriterT` analogue of `relTriple_simulateQ_run`.\n\nIf two writer-transformed oracle implementations produce outputs related by a reflexive-and-closed\nrelation `R_writer` on the accumulated logs, then the full simulation preserves output equality\nt... | [
{
"name": "relTriple_simulateQ_run_writerT'",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 25,
"n_chars": 1276,
"n_subproofs": 2,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"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.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -40,6 +40,52 @@
/-! ## Relational simulateQ rules -/
+/-- `WriterT` analogue of `relTriple_simulateQ_run`.
+
+If two writer-transformed oracle implementations produce outputs related by a reflexive-and-closed
+relation `R_writer` on the accumulated logs, then the full simulation preserves output equality
+toget... | {
"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_fa5b083f03c6_7 | e145f933e3e9571c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 3 | [
{
"theorem_name": "relTriple_simulateQ_run'",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := relTriple_simulateQ_run impl₁ impl₂ R_state oa himpl s₁ s₂ hs\n have h_weak : RelTriple ((simulateQ imp... | [
{
"name": "relTriple_simulateQ_run",
"text": "/-- Core relational `simulateQ` theorem with state invariant.\nIf two oracle implementations produce equal outputs and preserve a state invariant `R_state`,\nthen the full simulation also preserves the invariant and output equality. -/\ntheorem relTriple_simulat... | [
{
"name": "relTriple_simulateQ_run_of_impl_eq_preservesInv",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 48,
"n_chars": 2186,
"n_subproofs": 4,
"n_tactics": 32,
"cyclomatic": 3,
"n_automation": 5,
"n_rewrites": 2,
"n_structural": 10,
"autom... | 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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -40,6 +40,36 @@
/-! ## Relational simulateQ rules -/
+/-- Core relational `simulateQ` theorem with state invariant.
+If two oracle implementations produce equal outputs and preserve a state invariant `R_state`,
+then the full simulation also preserves the invariant and output equality. -/
+theorem relTriple_sim... | {
"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_fa5b083f03c6_8 | 60ea51ade1b218ce | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 2 | [
{
"theorem_name": "relTriple_simulateQ_run_eqRel_of_impl_eq_preservesInv",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine relTriple_post_mono\n (relTriple_simulateQ_run_of_impl_eq_preservesInv\n ... | [
{
"name": "relTriple_simulateQ_run_of_impl_eq_preservesInv",
"text": "/-- If two stateful oracle implementations agree on every query while `Inv` holds, and the\nsecond implementation preserves `Inv`, then the full simulations have identical `(output, state)`\ndistributions from any invariant-satisfying ini... | [
{
"name": "relTriple_simulateQ_run_eqRel_of_impl_eq_preservesInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 24,
"n_chars": 1047,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"a... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -70,6 +70,53 @@
exact (relTriple_bind (himpl t s₁ s₂ hs) (fun ⟨u₁, s₁'⟩ ⟨u₂, s₂'⟩ ⟨eq_u, hs'⟩ => by
dsimp at eq_u hs' ⊢; subst eq_u; exact ih u₁ s₁' s₂' hs')) trivial
+/-- If two stateful oracle implementations agree on every query while `Inv` holds, and the
+second implementation preserves `Inv`, then... | {
"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_fa5b083f03c6_9 | 38728b82e96819cd | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 2 | [
{
"theorem_name": "relTriple_simulateQ_run_eqRel_of_impl_eq_preservesInv",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine relTriple_post_mono\n (relTriple_simulateQ_run_of_impl_eq_preservesInv\n ... | [
{
"name": "relTriple_simulateQ_run_of_impl_eq_preservesInv",
"text": "/-- If two stateful oracle implementations agree on every query while `Inv` holds, and the\nsecond implementation preserves `Inv`, then the full simulations have identical `(output, state)`\ndistributions from any invariant-satisfying ini... | [
{
"name": "probOutput_simulateQ_run_eq_of_impl_eq_preservesInv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 17,
"n_chars": 863,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"auto... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -70,6 +70,53 @@
exact (relTriple_bind (himpl t s₁ s₂ hs) (fun ⟨u₁, s₁'⟩ ⟨u₂, s₂'⟩ ⟨eq_u, hs'⟩ => by
dsimp at eq_u hs' ⊢; subst eq_u; exact ih u₁ s₁' s₂' hs')) trivial
+/-- If two stateful oracle implementations agree on every query while `Inv` holds, and the
+second implementation preserves `Inv`, then... | {
"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_fa5b083f03c6_10 | 2af8ddf55aabef78 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 2 | [
{
"theorem_name": "probEvent_not_bad_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n rw [probEvent_eq_tsum_ite, probEvent_eq_tsum_ite]\n refine tsum_congr (fun ⟨a, s⟩ => ?_)\n split_ifs wi... | [
{
"name": "probOutput_simulateQ_run_eq_of_not_bad",
"text": "private lemma probOutput_simulateQ_run_eq_of_not_bad\n {σ : Type}\n (impl₁ impl₂ : QueryImpl spec (StateT σ (OracleComp spec))) (bad : σ → Prop)\n (h_agree : ∀ (t : spec.Domain) (s : σ), ¬bad s →\n (impl₁ t).run s = (impl₂ t).run s)\... | [
{
"name": "probEvent_not_bad_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 21,
"n_chars": 900,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_n... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -67,6 +67,33 @@
rw [← probOutput_eq_zero_iff]
exact ih u s' (h_mono t s₀ h_bad (u, s') h_mem)
+private lemma probOutput_simulateQ_run_eq_of_not_bad
+ {σ : Type}
+ (impl₁ impl₂ : QueryImpl spec (StateT σ (OracleComp spec))) (bad : σ → Prop)
+ (h_agree : ∀ (t : spec.Domain) (s : σ), ¬bad s →
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_fa5b083f03c6_13 | 83c83442382aacab | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 1 | [
{
"theorem_name": "identical_until_bad_with_flag",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n tvDist_simulateQ_le_probEvent_output_bad impl₁ impl₂ oa s₀ h_agree_good h_mono₁ h_mono₂",
"n_chars": 100,
... | [
{
"name": "tvDist_simulateQ_le_probEvent_output_bad",
"text": "/-- \"Identical until bad\" with the bad flag tracked at the **output** of each oracle step.\nTV-distance between two state-extended simulations is bounded by the probability of the flag\nfiring in the run of `impl₁`.\n\nCompared to `tvDist_simu... | [
{
"name": "identical_until_bad_with_flag",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 39,
"n_chars": 2317,
"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.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -276,6 +276,51 @@
rw [← h₂]; exact ENNReal.add_sub_cancel_right
(ne_top_of_le_ne_top one_ne_top probEvent_le_one)
+/-- "Identical until bad" with the bad flag tracked at the **output** of each oracle step.
+TV-distance between two state-extended simulations is bounded by the probability of the ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_fa5b083f03c6_16 | 5e068150bf70db89 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 1 | [
{
"theorem_name": "probOutput_simulateQ_run_eq_of_not_output_bad'",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing s₀ with\n | pure a =>\n simp onl... | [
{
"name": "probOutput_simulateQ_run_eq_zero_of_output_bad'",
"text": "private lemma probOutput_simulateQ_run_eq_zero_of_output_bad'\n (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))\n (h_mono : ∀ (t : spec.Domain) (p : σ × Bool), p.2 = true →\n ∀ z ∈ support ((impl t).run p), z.2.2... | [
{
"name": "probOutput_simulateQ_run_eq_of_not_output_bad'",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 34,
"n_chars": 1714,
"n_subproofs": 2,
"n_tactics": 21,
"cyclomatic": 4,
"n_automation": 5,
"n_rewrites": 2,
"n_structural": 4,
"automat... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -306,6 +306,15 @@
have hp' : p'.2 = true := h_mono t p hp (u, p') h_mem
exact ih u p' hp' z h_z
+private lemma probOutput_simulateQ_run_eq_zero_of_output_bad'
+ (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))
+ (h_mono : ∀ (t : spec.Domain) (p : σ × Bool), p.2 = true →
+ ∀ z... | {
"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_fa5b083f03c6_17 | 998e35aae33733a0 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 1 | [
{
"theorem_name": "probOutput_simulateQ_run_eq_of_not_output_bad'",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing s₀ with\n | pure a =>\n simp onl... | [
{
"name": "probOutput_simulateQ_run_eq_zero_of_output_bad'",
"text": "private lemma probOutput_simulateQ_run_eq_zero_of_output_bad'\n (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))\n (h_mono : ∀ (t : spec.Domain) (p : σ × Bool), p.2 = true →\n ∀ z ∈ support ((impl t).run p), z.2.2... | [
{
"name": "tvDist_simulateQ_run_le_probEvent_output_bad",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 42,
"n_chars": 2414,
"n_subproofs": 3,
"n_tactics": 17,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 4,
"automatio... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -306,6 +306,15 @@
have hp' : p'.2 = true := h_mono t p hp (u, p') h_mem
exact ih u p' hp' z h_z
+private lemma probOutput_simulateQ_run_eq_zero_of_output_bad'
+ (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))
+ (h_mono : ∀ (t : spec.Domain) (p : σ × Bool), p.2 = true →
+ ∀ z... | {
"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_fa5b083f03c6_18 | d43a589b6abe815b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 2 | [
{
"theorem_name": "tvDist_simulateQ_run_query_bind_le",
"depth": 1,
"n_commands": 0,
"n_lines": 54,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n set sim₁ : OracleComp spec' (α × σ × Bool) :=\n (simulateQ impl₁ (query t >>= cont)).run (s, false) ... | [
{
"name": "tsum_probOutput_mul_tvDist_le_const_plus_probEvent_bad",
"text": "/-- Bound `∑' z, p_z.toReal * tvDist (f₁ z) (f₂ z)` by `c + Pr[bad | mx >>= f₁]`,\ngiven that each summand is bounded by `p_z * (c + Pr[bad | f₁ z])`. The constant `c`\nis intended to be `(q - 1) · ε` from the inductive hypothesis.... | [
{
"name": "tvDist_simulateQ_run_query_bind_le",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 75,
"n_chars": 4444,
"n_subproofs": 13,
"n_tactics": 54,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 4,
"n_structural": 6,
"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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -396,6 +396,105 @@
rw [← h₂]; exact ENNReal.add_sub_cancel_right
(ne_top_of_le_ne_top one_ne_top probEvent_le_one)
+/-- Bound `∑' z, p_z.toReal * tvDist (f₁ z) (f₂ z)` by `c + Pr[bad | mx >>= f₁]`,
+given that each summand is bounded by `p_z * (c + Pr[bad | f₁ z])`. The constant `c`
+is intende... | {
"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_fa5b083f03c6_19 | 9d27cca9bfd4779c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 2 | [
{
"theorem_name": "tvDist_simulateQ_run_le_qeps_plus_probEvent_output_bad_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing q p with\n | pure x =>\... | [
{
"name": "tvDist_simulateQ_run_query_bind_le",
"text": "/-- The `query_bind` (`p.2 = false`) inductive step: given the per-continuation IH bound\n(parameterized by `q - 1`), combine the triangle inequality, the two `tvDist_bind_*_le`\nbounds, and the algebraic distribution to get the `q · ε + Pr[bad]` boun... | [
{
"name": "tvDist_simulateQ_run_le_qeps_plus_probEvent_output_bad_aux",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 52,
"n_chars": 2732,
"n_subproofs": 6,
"n_tactics": 30,
"cyclomatic": 4,
"n_automation": 5,
"n_rewrites": 1,
"n_structural": 5,
... | 4 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -516,6 +516,80 @@
exact ENNReal.toReal_mul.symm
rw [h_first_sum, h_second_sum]
+/-- The `query_bind` (`p.2 = false`) inductive step: given the per-continuation IH bound
+(parameterized by `q - 1`), combine the triangle inequality, the two `tvDist_bind_*_le`
+bounds, and the algebraic distribution to get th... | {
"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_fa5b083f03c6_20 | 3337edcf0c60fcdd | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 2 | [
{
"theorem_name": "tvDist_simulateQ_run_le_qeps_plus_probEvent_output_bad_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing q p with\n | pure x =>\... | [
{
"name": "tvDist_simulateQ_run_query_bind_le",
"text": "/-- The `query_bind` (`p.2 = false`) inductive step: given the per-continuation IH bound\n(parameterized by `q - 1`), combine the triangle inequality, the two `tvDist_bind_*_le`\nbounds, and the algebraic distribution to get the `q · ε + Pr[bad]` boun... | [
{
"name": "tvDist_simulateQ_le_qeps_plus_probEvent_output_bad",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 39,
"n_chars": 2206,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"aut... | 5 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -516,6 +516,80 @@
exact ENNReal.toReal_mul.symm
rw [h_first_sum, h_second_sum]
+/-- The `query_bind` (`p.2 = false`) inductive step: given the per-continuation IH bound
+(parameterized by `q - 1`), combine the triangle inequality, the two `tvDist_bind_*_le`
+bounds, and the algebraic distribution to get th... | {
"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_fa5b083f03c6_21 | 9d6abab00a8684a1 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 2 | [
{
"theorem_name": "tvDist_simulateQ_run_query_bind_le",
"depth": 1,
"n_commands": 0,
"n_lines": 54,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n set sim₁ : OracleComp spec' (α × σ × Bool) :=\n (simulateQ impl₁ (query t >>= cont)).run (s, false) ... | [
{
"name": "tsum_probOutput_mul_tvDist_le_const_plus_probEvent_bad",
"text": "/-- Bound `∑' z, p_z.toReal * tvDist (f₁ z) (f₂ z)` by `c + Pr[bad | mx >>= f₁]`,\ngiven that each summand is bounded by `p_z * (c + Pr[bad | f₁ z])`. The constant `c`\nis intended to be `(q - 1) · ε` from the inductive hypothesis.... | [
{
"name": "tvDist_simulateQ_run_free_query_bind_le",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 46,
"n_chars": 2869,
"n_subproofs": 6,
"n_tactics": 27,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 2,
"automation_onl... | 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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -396,6 +396,105 @@
rw [← h₂]; exact ENNReal.add_sub_cancel_right
(ne_top_of_le_ne_top one_ne_top probEvent_le_one)
+/-- Bound `∑' z, p_z.toReal * tvDist (f₁ z) (f₂ z)` by `c + Pr[bad | mx >>= f₁]`,
+given that each summand is bounded by `p_z * (c + Pr[bad | f₁ z])`. The constant `c`
+is intende... | {
"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_fa5b083f03c6_22 | 66323d107f1896eb | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 2 | [
{
"theorem_name": "tvDist_simulateQ_run_le_qeps_plus_probEvent_output_bad_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing q p with\n | pure x =>\... | [
{
"name": "tvDist_simulateQ_run_query_bind_le",
"text": "/-- The `query_bind` (`p.2 = false`) inductive step: given the per-continuation IH bound\n(parameterized by `q - 1`), combine the triangle inequality, the two `tvDist_bind_*_le`\nbounds, and the algebraic distribution to get the `q · ε + Pr[bad]` boun... | [
{
"name": "tvDist_simulateQ_run_le_queryBound_mul_slack_plus_probEvent_bad_aux",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 70,
"n_chars": 3691,
"n_subproofs": 7,
"n_tactics": 47,
"cyclomatic": 4,
"n_automation": 6,
"n_rewrites": 3,
"n_structu... | 5 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -516,6 +516,80 @@
exact ENNReal.toReal_mul.symm
rw [h_first_sum, h_second_sum]
+/-- The `query_bind` (`p.2 = false`) inductive step: given the per-continuation IH bound
+(parameterized by `q - 1`), combine the triangle inequality, the two `tvDist_bind_*_le`
+bounds, and the algebraic distribution to get th... | {
"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_fa5b083f03c6_23 | 1392317b76dfb7d6 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 1 | [
{
"theorem_name": "tvDist_simulateQ_run_le_queryBound_mul_slack_plus_probEvent_bad_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 48,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Construct a global per-step bound `tvDist ≤ ε` that holds for all q... | [
{
"name": "tvDist_simulateQ_run_free_query_bind_le",
"text": "/-- The `query_bind` step for a \"free\" query (impls pointwise equal on the no-bad branch).\nThe budget `qS` is preserved (no decrement), since a uncharged query doesn't count toward the\ncharged query bound. -/\nprivate theorem tvDist_simulateQ... | [
{
"name": "tvDist_simulateQ_run_le_queryBound_mul_slack_plus_probEvent_bad",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 33,
"n_chars": 1879,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural":... | 6 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -610,6 +610,51 @@
variable {ι' : Type} {spec' : OracleSpec ι'} [IsUniformSpec spec']
variable {α : Type} {σ : Type}
+/-- The `query_bind` step for a "free" query (impls pointwise equal on the no-bad branch).
+The budget `qS` is preserved (no decrement), since a uncharged query doesn't count toward the
+charged 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_fa5b083f03c6_24 | 9f04007bb4b24465 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 24 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 1 | [
{
"theorem_name": "tvDist_simulateQ_run_le_queryBound_mul_slack_plus_probEvent_bad",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n tvDist_simulateQ_run_le_queryBound_mul_slack_plus_probEvent_bad_aux\n impl₁... | [
{
"name": "tvDist_simulateQ_run_le_queryBound_mul_slack_plus_probEvent_bad_aux",
"text": "/-- Auxiliary inductive lemma for the selective ε-perturbed bound.\n\nInducts on `oa` and case-splits each query on whether it is charged\n(use the per-step argument and decrement the budget) or uncharged\n(`tvDist_sim... | [
{
"name": "tvDist_simulateQ_le_queryBound_mul_slack_plus_probEvent_bad",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 39,
"n_chars": 2076,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,... | 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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -655,6 +655,75 @@
(tsum_probOutput_mul_tvDist_le_const_plus_probEvent_bad
(mx := mx) (f₁ := f₁) (f₂ := f₂) (c := ↑qS * ε) h_qSε_nonneg h_summand_le)
+/-- Auxiliary inductive lemma for the selective ε-perturbed bound.
+
+Inducts on `oa` and case-splits each query on whether it is charged
+(use the per-s... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_fa5b083f03c6_25 | 5e165ca1e5bb427e | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 25 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 1 | [
{
"theorem_name": "tvDist_simulateQ_run_le_queryBoundP_mul",
"depth": 1,
"n_commands": 0,
"n_lines": 47,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing qS s₀ with\n | pure x =>\n simp only ... | [
{
"name": "tsum_probOutput_mul_tvDist_le_const",
"text": "/-- Bound the weighted TV sum from `tvDist_bind_left_le` by a uniform pointwise constant:\nthe output weights sum to at most one, so the weighted average of per-continuation TV\ndistances is at most any uniform bound on them. -/\nprivate lemma tsum_p... | [
{
"name": "tvDist_simulateQ_run_le_queryBoundP_mul",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 73,
"n_chars": 4352,
"n_subproofs": 7,
"n_tactics": 47,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 4,
"n_structural": 5,
"automation_onl... | 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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -416,6 +416,34 @@
variable {ι' : Type} {spec' : OracleSpec ι'} [IsUniformSpec spec']
variable {α : Type} {σ : Type}
+/-- Bound the weighted TV sum from `tvDist_bind_left_le` by a uniform pointwise constant:
+the output weights sum to at most one, so the weighted average of per-continuation TV
+distances is at mo... | {
"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_fa5b083f03c6_26 | 6ac8537055f4c990 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 26 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 10 | [
{
"theorem_name": "expectedQuerySlack_bind_eq_of_right_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing qS p with\n | pure x =>\n simp [hzero... | [
{
"name": "expectedQuerySlack_query_bind",
"text": "lemma expectedQuerySlack_query_bind\n (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))\n (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞)\n (t : spec.Domain) (cont : spec.Range t → OracleComp spec α)\n (qS : ℕ) (p : σ × B... | [
{
"name": "expectedQuerySlack_bind_eq_of_right_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 756,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 3,
"automation_onl... | 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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -488,6 +488,14 @@
(qS : ℕ) (p : σ × Bool) :
expectedQuerySlack impl S ε (pure x : OracleComp spec α) qS p = 0 := rfl
+lemma expectedQuerySlack_query_bind
+ (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))
+ (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞)
+ (t : spec.Domai... | {
"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_fa5b083f03c6_27 | 6a4e7cce3646f5cf | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 27 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 10 | [
{
"theorem_name": "expectedQuerySlack_bind_eq_of_right_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing qS p with\n | pure x =>\n simp [hzero... | [
{
"name": "expectedQuerySlack_query_bind",
"text": "lemma expectedQuerySlack_query_bind\n (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))\n (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞)\n (t : spec.Domain) (cont : spec.Range t → OracleComp spec α)\n (qS : ℕ) (p : σ × B... | [
{
"name": "expectedQuerySlack_bad_eq_zero",
"fan_in": 3,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 522,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 1,
"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.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -488,6 +488,14 @@
(qS : ℕ) (p : σ × Bool) :
expectedQuerySlack impl S ε (pure x : OracleComp spec α) qS p = 0 := rfl
+lemma expectedQuerySlack_query_bind
+ (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))
+ (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞)
+ (t : spec.Domai... | {
"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_fa5b083f03c6_28 | 26ee3065e59b950b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 28 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 8 | [
{
"theorem_name": "expectedQuerySlackStep_mono",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases p with ⟨s, b⟩\n cases b with\n | true => simp [expectedQuerySlackStep]\n | false =>\n by_cases ... | [
{
"name": "expectedQuerySlackStep_free",
"text": "lemma expectedQuerySlackStep_free\n (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))\n (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞) (t : spec.Domain)\n (k : spec.Range t → ℕ → (σ × Bool) → ℝ≥0∞)\n (qS : ℕ) (s : σ) (hS :... | [
{
"name": "expectedQuerySlackStep_mono",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 26,
"n_chars": 1108,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 3,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 5,
"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.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -525,6 +525,26 @@
Pr[= z | (impl t).run (s, false)] * k z.1 (qS - 1) z.2 := by
simp [expectedQuerySlackStep, hS, hqS]
+lemma expectedQuerySlackStep_free
+ (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))
+ (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞) (t : spec.Domain)
+... | {
"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_fa5b083f03c6_29 | 519432043f456091 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 29 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 8 | [
{
"theorem_name": "expectedQuerySlackStep_mono",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases p with ⟨s, b⟩\n cases b with\n | true => simp [expectedQuerySlackStep]\n | false =>\n by_cases ... | [
{
"name": "expectedQuerySlackStep_free",
"text": "lemma expectedQuerySlackStep_free\n (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))\n (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞) (t : spec.Domain)\n (k : spec.Range t → ℕ → (σ × Bool) → ℝ≥0∞)\n (qS : ℕ) (s : σ) (hS :... | [
{
"name": "expectedQuerySlack_mono",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 14,
"n_chars": 632,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"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.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -525,6 +525,26 @@
Pr[= z | (impl t).run (s, false)] * k z.1 (qS - 1) z.2 := by
simp [expectedQuerySlackStep, hS, hqS]
+lemma expectedQuerySlackStep_free
+ (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))
+ (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞) (t : spec.Domain)
+... | {
"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_fa5b083f03c6_30 | 73a3389006364522 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 30 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 8 | [
{
"theorem_name": "expectedQuerySlackStep_mono",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases p with ⟨s, b⟩\n cases b with\n | true => simp [expectedQuerySlackStep]\n | false =>\n by_cases ... | [
{
"name": "expectedQuerySlackStep_free",
"text": "lemma expectedQuerySlackStep_free\n (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))\n (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞) (t : spec.Domain)\n (k : spec.Range t → ℕ → (σ × Bool) → ℝ≥0∞)\n (qS : ℕ) (s : σ) (hS :... | [
{
"name": "expectedQuerySlack_eq_of_inv",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 61,
"n_chars": 3038,
"n_subproofs": 3,
"n_tactics": 42,
"cyclomatic": 4,
"n_automation": 6,
"n_rewrites": 7,
"n_structural": 9,
"automation_only": false,
... | 3 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -525,6 +525,26 @@
Pr[= z | (impl t).run (s, false)] * k z.1 (qS - 1) z.2 := by
simp [expectedQuerySlackStep, hS, hqS]
+lemma expectedQuerySlackStep_free
+ (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))
+ (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞) (t : spec.Domain)
+... | {
"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_fa5b083f03c6_31 | e3580987b9686a3b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 31 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 8 | [
{
"theorem_name": "expectedQuerySlackStep_mono",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases p with ⟨s, b⟩\n cases b with\n | true => simp [expectedQuerySlackStep]\n | false =>\n by_cases ... | [
{
"name": "expectedQuerySlackStep_costly_pos",
"text": "lemma expectedQuerySlackStep_costly_pos\n (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))\n (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞) (t : spec.Domain)\n (k : spec.Range t → ℕ → (σ × Bool) → ℝ≥0∞)\n (qS : ℕ) (... | [
{
"name": "ofReal_tvDist_simulateQ_run_costly_query_bind_le_expectedQuerySlack",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 93,
"n_chars": 5769,
"n_subproofs": 9,
"n_tactics": 70,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 9,
"n_structu... | 3 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -515,6 +515,16 @@
| query_bind t cont _ =>
rw [expectedQuerySlack_query_bind, expectedQuerySlackStep_bad_eq_zero]
+lemma expectedQuerySlackStep_costly_pos
+ (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))
+ (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞) (t : spec.Domain)
+... | {
"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_fa5b083f03c6_32 | f23dbc663c69ce4f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 32 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 8 | [
{
"theorem_name": "expectedQuerySlackStep_mono",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases p with ⟨s, b⟩\n cases b with\n | true => simp [expectedQuerySlackStep]\n | false =>\n by_cases ... | [
{
"name": "expectedQuerySlackStep_free",
"text": "lemma expectedQuerySlackStep_free\n (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))\n (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞) (t : spec.Domain)\n (k : spec.Range t → ℕ → (σ × Bool) → ℝ≥0∞)\n (qS : ℕ) (s : σ) (hS :... | [
{
"name": "ofReal_tvDist_simulateQ_run_free_query_bind_le_expectedQuerySlack",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 66,
"n_chars": 4036,
"n_subproofs": 5,
"n_tactics": 41,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structura... | 3 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -515,6 +515,26 @@
| query_bind t cont _ =>
rw [expectedQuerySlack_query_bind, expectedQuerySlackStep_bad_eq_zero]
+lemma expectedQuerySlackStep_free
+ (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))
+ (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞) (t : spec.Domain)
+ (k... | {
"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_fa5b083f03c6_33 | 912c12450173809a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 33 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 8 | [
{
"theorem_name": "expectedQuerySlackStep_mono",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases p with ⟨s, b⟩\n cases b with\n | true => simp [expectedQuerySlackStep]\n | false =>\n by_cases ... | [
{
"name": "expectedQuerySlackStep_free",
"text": "lemma expectedQuerySlackStep_free\n (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))\n (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞) (t : spec.Domain)\n (k : spec.Range t → ℕ → (σ × Bool) → ℝ≥0∞)\n (qS : ℕ) (s : σ) (hS :... | [
{
"name": "ofReal_tvDist_simulateQ_run_le_expectedQuerySlack_plus_probEvent_output_bad_aux",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 11,
"n_lines": 67,
"n_chars": 3823,
"n_subproofs": 6,
"n_tactics": 43,
"cyclomatic": 4,
"n_automation": 4,
"n_rewrites": 2,
... | 8 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -546,6 +546,26 @@
Pr[= z | (impl t).run (s, false)] * k z.1 (qS - 1) z.2 := by
simp [expectedQuerySlackStep, hS, hqS]
+lemma expectedQuerySlackStep_free
+ (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))
+ (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞) (t : spec.Domain)
+... | {
"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_fa5b083f03c6_34 | 6f4fcce872bbd7ea | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 34 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 2 | [
{
"theorem_name": "ofReal_tvDist_simulateQ_run_costly_query_bind_le_expectedQuerySlack",
"depth": 1,
"n_commands": 0,
"n_lines": 70,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n set mx : OracleComp spec' (spec.Range t × σ × Bool) := (impl₁ t).run (... | [
{
"name": "tsum_probOutput_mul_ofReal_tvDist_le_tsum_cost_plus_probEvent_bad",
"text": "/-- Sum bound for the inductive step: from a per-summand `ofReal (tvDist) ≤ cost z + Pr[bad]`\nIH, conclude that `ofReal (∑' z, Pr[=z|mx].toReal · tvDist (f₁ z) (f₂ z))` is bounded by\n`(∑' z, Pr[=z|mx] · cost z) + Pr[ba... | [
{
"name": "ofReal_tvDist_simulateQ_run_le_expectedQuerySlack_plus_probEvent_output_bad",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 12,
"n_lines": 30,
"n_chars": 1829,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n... | 9 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -566,6 +566,63 @@
state-dependent ε by a constant upper bound so the constant-ε bound
`expectedQuerySlack_const_le_queryBudget_mul` applies. -/
+/-- Sum bound for the inductive step: from a per-summand `ofReal (tvDist) ≤ cost z + Pr[bad]`
+IH, conclude that `ofReal (∑' z, Pr[=z|mx].toReal · tvDist (f₁ z) (f₂ z))... | {
"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_fa5b083f03c6_35 | 27aa1fcc5f33774e | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 35 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 1 | [
{
"theorem_name": "ofReal_tvDist_simulateQ_run_le_expectedQuerySlack_plus_probEvent_output_bad_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 43,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing que... | [
{
"name": "ofReal_tvDist_simulateQ_run_costly_query_bind_le_expectedQuerySlack",
"text": "/-- The `query_bind` step for a charged query (`S t ∧ 0 < qS`), state-dep ε version.\nCombines triangle inequality through the coupled mid-distribution `mx >>= f₂` with\n`tvDist_bind_left_le` + the helper lemma to push... | [
{
"name": "ofReal_tvDist_simulateQ_le_expectedQuerySlack_plus_probEvent_output_bad",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 13,
"n_lines": 51,
"n_chars": 2916,
"n_subproofs": 2,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_st... | 10 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -623,6 +623,98 @@
/-! #### Per-step inductive helpers -/
+/-- The `query_bind` step for a charged query (`S t ∧ 0 < qS`), state-dep ε version.
+Combines triangle inequality through the coupled mid-distribution `mx >>= f₂` with
+`tvDist_bind_left_le` + the helper lemma to push the IH through the bind. -/
+privat... | {
"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_fa5b083f03c6_36 | e5c9c79828f947de | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 36 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 8 | [
{
"theorem_name": "expectedQuerySlackStep_mono",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases p with ⟨s, b⟩\n cases b with\n | true => simp [expectedQuerySlackStep]\n | false =>\n by_cases ... | [
{
"name": "expectedQuerySlackStep_free",
"text": "lemma expectedQuerySlackStep_free\n (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))\n (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞) (t : spec.Domain)\n (k : spec.Range t → ℕ → (σ × Bool) → ℝ≥0∞)\n (qS : ℕ) (s : σ) (hS :... | [
{
"name": "expectedQuerySlack_const_le_queryBudget_mul",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 6,
"n_lines": 84,
"n_chars": 4448,
"n_subproofs": 5,
"n_tactics": 76,
"cyclomatic": 4,
"n_automation": 9,
"n_rewrites": 5,
"n_structural": 12,
"automatio... | 3 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -525,6 +525,26 @@
Pr[= z | (impl t).run (s, false)] * k z.1 (qS - 1) z.2 := by
simp [expectedQuerySlackStep, hS, hqS]
+lemma expectedQuerySlackStep_free
+ (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))
+ (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞) (t : spec.Domain)
+... | {
"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_fa5b083f03c6_37 | 55bb13fe2b073490 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 37 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 8 | [
{
"theorem_name": "expectedQuerySlackStep_mono",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases p with ⟨s, b⟩\n cases b with\n | true => simp [expectedQuerySlackStep]\n | false =>\n by_cases ... | [
{
"name": "expectedQuerySlackStep_free",
"text": "lemma expectedQuerySlackStep_free\n (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))\n (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞) (t : spec.Domain)\n (k : spec.Range t → ℕ → (σ × Bool) → ℝ≥0∞)\n (qS : ℕ) (s : σ) (hS :... | [
{
"name": "expectedQuerySlack_resource_le",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 6,
"n_lines": 100,
"n_chars": 5800,
"n_subproofs": 11,
"n_tactics": 84,
"cyclomatic": 5,
"n_automation": 18,
"n_rewrites": 9,
"n_structural": 25,
"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 VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -525,6 +525,26 @@
Pr[= z | (impl t).run (s, false)] * k z.1 (qS - 1) z.2 := by
simp [expectedQuerySlackStep, hS, hqS]
+lemma expectedQuerySlackStep_free
+ (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))
+ (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞) (t : spec.Domain)
+... | {
"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_fa5b083f03c6_38 | 960dc3575b1529e2 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 38 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 8 | [
{
"theorem_name": "expectedQuerySlackStep_mono",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases p with ⟨s, b⟩\n cases b with\n | true => simp [expectedQuerySlackStep]\n | false =>\n by_cases ... | [
{
"name": "expectedQuerySlackStep_free",
"text": "lemma expectedQuerySlackStep_free\n (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))\n (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞) (t : spec.Domain)\n (k : spec.Range t → ℕ → (σ × Bool) → ℝ≥0∞)\n (qS : ℕ) (s : σ) (hS :... | [
{
"name": "expectedQuerySlack_expected_resource_le",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 145,
"n_chars": 8886,
"n_subproofs": 15,
"n_tactics": 116,
"cyclomatic": 7,
"n_automation": 23,
"n_rewrites": 10,
"n_structural": 19,
"automati... | 3 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -525,6 +525,26 @@
Pr[= z | (impl t).run (s, false)] * k z.1 (qS - 1) z.2 := by
simp [expectedQuerySlackStep, hS, hqS]
+lemma expectedQuerySlackStep_free
+ (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))
+ (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞) (t : spec.Domain)
+... | {
"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_fa5b083f03c6_39 | b525fb3059fc0771 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 39 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 8 | [
{
"theorem_name": "expectedQuerySlackStep_mono",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases p with ⟨s, b⟩\n cases b with\n | true => simp [expectedQuerySlackStep]\n | false =>\n by_cases ... | [
{
"name": "expectedQuerySlackStep_free",
"text": "lemma expectedQuerySlackStep_free\n (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))\n (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞) (t : spec.Domain)\n (k : spec.Range t → ℕ → (σ × Bool) → ℝ≥0∞)\n (qS : ℕ) (s : σ) (hS :... | [
{
"name": "expectedQuerySlack_charged_read_expected_growth_le",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 150,
"n_chars": 9352,
"n_subproofs": 13,
"n_tactics": 112,
"cyclomatic": 6,
"n_automation": 31,
"n_rewrites": 11,
"n_structural": 26,
... | 3 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -525,6 +525,26 @@
Pr[= z | (impl t).run (s, false)] * k z.1 (qS - 1) z.2 := by
simp [expectedQuerySlackStep, hS, hqS]
+lemma expectedQuerySlackStep_free
+ (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))
+ (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞) (t : spec.Domain)
+... | {
"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_fa5b083f03c6_40 | 14088ec264b918eb | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 40 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 1 | [
{
"theorem_name": "ofReal_tvDist_simulateQ_run_le_expectedQuerySlack_plus_probEvent_output_bad_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 43,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing que... | [
{
"name": "ofReal_tvDist_simulateQ_run_free_query_bind_le_expectedQuerySlack",
"text": "/-- The `query_bind` step for a free (non-S) query, state-dep ε version. The impls are\npointwise equal at this query, so the only contribution is from the IH; the budget `qS`\nis preserved (no decrement). -/\nprivate th... | [
{
"name": "ofReal_tvDist_simulateQ_run_le_queryBound_mul_slack_plus_probEvent_bad",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 14,
"n_lines": 34,
"n_chars": 2007,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_str... | 11 | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -715,6 +715,71 @@
(simulateQ impl₁ (query t >>= cont)).run (s, false)] := by
rw [h_recurse, ← hmx_def, ← hsim₁_eq]
+/-- The `query_bind` step for a free (non-S) query, state-dep ε version. The impls are
+pointwise equal at this query, so the only contribution is from the IH; the budget `qS`... | {
"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_fa5b083f03c6_41 | b0bce928b352867b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 41 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 1 | [
{
"theorem_name": "probEvent_bad_simulateQ_run_eq_one_of_bad",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [probEvent_eq_one_iff]\n exact ⟨by simp, mem_support_simulateQ_run_of_bad_general impl₁ bad h... | [
{
"name": "mem_support_simulateQ_run_of_bad_general",
"text": "/-- Bad propagation for a general (non-flag) bad predicate: starting the simulation from a\nbad state, every output state stays bad. The heterogeneous-state analogue of\n`mem_support_simulateQ_run_of_bad`. -/\nprivate lemma mem_support_simulateQ... | [
{
"name": "probEvent_bad_simulateQ_run_eq_one_of_bad",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 713,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_onl... | 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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -538,6 +538,30 @@
variable {ι₁ ι₂ : Type} {spec₁ : OracleSpec ι₁} {spec₂ : OracleSpec ι₂}
variable {σ₁ σ₂ : Type}
+/-- Bad propagation for a general (non-flag) bad predicate: starting the simulation from a
+bad state, every output state stays bad. The heterogeneous-state analogue of
+`mem_support_simulateQ_run_o... | {
"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_fa5b083f03c6_42 | 80f659e08c3adaef | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 42 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 1 | [
{
"theorem_name": "probEvent_fst_simulateQ_run_le_add_bad_add_slack",
"depth": 1,
"n_commands": 0,
"n_lines": 66,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing σ₂ with\n | pure x =>\n intr... | [
{
"name": "probEvent_bad_simulateQ_run_eq_one_of_bad",
"text": "/-- A simulation started from a bad state has bad probability exactly `1`. The\nheterogeneous-state analogue of `probEvent_simulateQ_run_bad_eq_one_of_bad`. -/\nprivate lemma probEvent_bad_simulateQ_run_eq_one_of_bad [IsUniformSpec spec₁]\n ... | [
{
"name": "probEvent_fst_simulateQ_run_le_add_bad_add_slack",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 97,
"n_chars": 5912,
"n_subproofs": 10,
"n_tactics": 63,
"cyclomatic": 3,
"n_automation": 4,
"n_rewrites": 10,
"n_structural": 13,
"au... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -562,6 +562,18 @@
obtain ⟨⟨u, s₁'⟩, h_mem, h_z⟩ := hz
exact ih u s₁' (hmono t s₁ hbad (u, s₁') h_mem) z h_z
+/-- A simulation started from a bad state has bad probability exactly `1`. The
+heterogeneous-state analogue of `probEvent_simulateQ_run_bad_eq_one_of_bad`. -/
+private lemma probEvent_bad_sim... | {
"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_fa5b083f03c6_43 | 41137df18bc62fdc | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 43 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 1 | [
{
"theorem_name": "probOutput_simulateQ_run'_le_add_bad_add_slack",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hjoint := probEvent_fst_simulateQ_run_le_add_bad_add_slack\n impl₁ impl₂ R bad char... | [
{
"name": "probEvent_fst_simulateQ_run_le_add_bad_add_slack",
"text": "/-- Inductive core of `probOutput_simulateQ_run'_le_add_bad_add_slack`, stated on the\njoint `run` distribution with the event `fun z => z.1 = true`. -/\nprivate theorem probEvent_fst_simulateQ_run_le_add_bad_add_slack\n [IsUniformSpe... | [
{
"name": "probOutput_simulateQ_run'_le_add_bad_add_slack",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 61,
"n_chars": 3484,
"n_subproofs": 3,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 5,
"n_structural": 1,
"automat... | 3 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -574,6 +574,102 @@
rw [probEvent_eq_one_iff]
exact ⟨by simp, mem_support_simulateQ_run_of_bad_general impl₁ bad hmono oa s₁ hbad⟩
+/-- Inductive core of `probOutput_simulateQ_run'_le_add_bad_add_slack`, stated on the
+joint `run` distribution with the event `fun z => z.1 = true`. -/
+private theorem probEven... | {
"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_fa5b083f03c6_44 | 2c79e8bd98fa4200 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/SimulateQ.lean | SimulateQ | 44 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 8 | [
{
"theorem_name": "expectedQuerySlackStep_mono",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases p with ⟨s, b⟩\n cases b with\n | true => simp [expectedQuerySlackStep]\n | false =>\n by_cases ... | [
{
"name": "expectedQuerySlackStep_free",
"text": "lemma expectedQuerySlackStep_free\n (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))\n (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞) (t : spec.Domain)\n (k : spec.Range t → ℕ → (σ × Bool) → ℝ≥0∞)\n (qS : ℕ) (s : σ) (hS :... | [
{
"name": "probEvent_bad_simulateQ_run_le_expectedQuerySlack",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 88,
"n_chars": 4608,
"n_subproofs": 5,
"n_tactics": 49,
"cyclomatic": 6,
"n_automation": 8,
"n_rewrites": 5,
"n_structural": 10,
"aut... | 4 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Basic
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -525,6 +525,26 @@
Pr[= z | (impl t).run (s, false)] * k z.1 (qS - 1) z.2 := by
simp [expectedQuerySlackStep, hS, hqS]
+lemma expectedQuerySlackStep_free
+ (impl : QueryImpl spec (StateT (σ × Bool) (OracleComp spec')))
+ (S : spec.Domain → Prop) [DecidablePred S] (ε : σ → ℝ≥0∞) (t : spec.Domain)
+... | {
"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_3c474c6b3a97_2 | 25bc5ad9d1f92078 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/CmaToNma.lean | CmaToNma | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 3 | [
{
"theorem_name": "simulatedNmaRoSim_run_hashQueryBound",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases hs : s (.inr mc) with\n | some v => simp [simulatedNmaRoSim, hs, nmaHashQueryBound]\n | none =... | [
{
"name": "simulatedNmaFwd_run_hashQueryBound",
"text": "private theorem simulatedNmaFwd_run_hashQueryBound\n [DecidableEq M] [DecidableEq Commit]\n (t : (fsRoSpec M Commit Chal).Domain) (s : (fsRoSpec M Commit Chal).QueryCache) :\n nmaHashQueryBound (M := M) (Commit := Commit) (Chal := Chal)\n ... | [
{
"name": "simulatedNmaAdv_hashQueryBound",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 39,
"n_chars": 1994,
"n_subproofs": 3,
"n_tactics": 21,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 8,
"automation_only": false... | 3 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma
import VCVio.CryptoFoundations.FiatShamir.Sigma.Fork
import VCVio.CryptoFoundations.FiatShamir.QueryBounds
/-!
# CMA-to-NMA re... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma
import VCVio.CryptoFoundations.FiatShamir.Sigma.Fork
import VCVio.CryptoFoundations.FiatShamir.QueryBounds
/-!
# CMA-to-NMA re... | @@ -137,6 +137,30 @@
omit [Finite Commit] [Finite Resp] [Fintype Chal] [Inhabited Chal] [Inhabited Commit] in
omit [SampleableType Stmt] [SampleableType Wit] in
+private theorem simulatedNmaFwd_run_hashQueryBound
+ [DecidableEq M] [DecidableEq Commit]
+ (t : (fsRoSpec M Commit Chal).Domain) (s : (fsRoSpec M 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_100fbaae4e46_0 | 6033c9eae2cca548 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/OneTimePad/UC.lean | UC | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "probOutput_realCipherObserve",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n change Pr[= () | (do\n let k ← (liftM ($ᵗ BitVec sp) : OptionT ProbComp (BitVec sp))\n guard (P (k ^... | [
{
"name": "probOutput_liftM_bind_guard",
"text": "/-- Local copy of the `OracleComp`-internal lemma relating `Pr[= ()]` on\na `bind` with a `guard` to a `probEvent`. Kept private here to avoid\nexposing internals of `VCVio.OracleComp.EvalDist`. -/\nprivate lemma probOutput_liftM_bind_guard\n {α : Type} (... | [
{
"name": "probOutput_realCipherObserve",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 637,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"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 Examples.OneTimePad.Basic
import VCVio.Interaction.UC.Computational
import PolyFun.Interaction.UC.OpenProcessModel
import VCVio.Interaction.UC.Runtime
import VCVio.Oracl... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Examples.OneTimePad.Basic
import VCVio.Interaction.UC.Computational
import PolyFun.Interaction.UC.OpenProcessModel
import VCVio.Interaction.UC.Runtime
import VCVio.Oracl... | @@ -161,13 +161,33 @@
let c ← ($ᵗ BitVec sp : OptionT ProbComp (BitVec sp))
guard (P c = true)
+/-- Local copy of the `OracleComp`-internal lemma relating `Pr[= ()]` on
+a `bind` with a `guard` to a `probEvent`. Kept private here to avoid
+exposing internals of `VCVio.OracleComp.EvalDist`. -/
+private lemma pro... | {
"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_100fbaae4e46_1 | ed7f0f8a70c4cba1 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/OneTimePad/UC.lean | UC | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "probOutput_realCipherObserve",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n change Pr[= () | (do\n let k ← (liftM ($ᵗ BitVec sp) : OptionT ProbComp (BitVec sp))\n guard (P (k ^... | [
{
"name": "probOutput_liftM_bind_guard",
"text": "/-- Local copy of the `OracleComp`-internal lemma relating `Pr[= ()]` on\na `bind` with a `guard` to a `probEvent`. Kept private here to avoid\nexposing internals of `VCVio.OracleComp.EvalDist`. -/\nprivate lemma probOutput_liftM_bind_guard\n {α : Type} (... | [
{
"name": "probOutput_idealCipherObserve",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 574,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"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 Examples.OneTimePad.Basic
import VCVio.Interaction.UC.Computational
import PolyFun.Interaction.UC.OpenProcessModel
import VCVio.Interaction.UC.Runtime
import VCVio.Oracl... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Examples.OneTimePad.Basic
import VCVio.Interaction.UC.Computational
import PolyFun.Interaction.UC.OpenProcessModel
import VCVio.Interaction.UC.Runtime
import VCVio.Oracl... | @@ -161,12 +161,32 @@
let c ← ($ᵗ BitVec sp : OptionT ProbComp (BitVec sp))
guard (P c = true)
+/-- Local copy of the `OracleComp`-internal lemma relating `Pr[= ()]` on
+a `bind` with a `guard` to a `probEvent`. Kept private here to avoid
+exposing internals of `VCVio.OracleComp.EvalDist`. -/
+private lemma pro... | {
"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_100fbaae4e46_2 | 60d1e054ef8aadde | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/OneTimePad/UC.lean | UC | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "probOutput_realCipherObserve",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n change Pr[= () | (do\n let k ← (liftM ($ᵗ BitVec sp) : OptionT ProbComp (BitVec sp))\n guard (P (k ^... | [
{
"name": "probOutput_liftM_bind_guard",
"text": "/-- Local copy of the `OracleComp`-internal lemma relating `Pr[= ()]` on\na `bind` with a `guard` to a `probEvent`. Kept private here to avoid\nexposing internals of `VCVio.OracleComp.EvalDist`. -/\nprivate lemma probOutput_liftM_bind_guard\n {α : Type} (... | [
{
"name": "probFailure_realCipherObserve",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 684,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"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 Examples.OneTimePad.Basic
import VCVio.Interaction.UC.Computational
import PolyFun.Interaction.UC.OpenProcessModel
import VCVio.Interaction.UC.Runtime
import VCVio.Oracl... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Examples.OneTimePad.Basic
import VCVio.Interaction.UC.Computational
import PolyFun.Interaction.UC.OpenProcessModel
import VCVio.Interaction.UC.Runtime
import VCVio.Oracl... | @@ -161,13 +161,33 @@
let c ← ($ᵗ BitVec sp : OptionT ProbComp (BitVec sp))
guard (P c = true)
+/-- Local copy of the `OracleComp`-internal lemma relating `Pr[= ()]` on
+a `bind` with a `guard` to a `probEvent`. Kept private here to avoid
+exposing internals of `VCVio.OracleComp.EvalDist`. -/
+private lemma pro... | {
"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_100fbaae4e46_3 | dce16c8f38545f92 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/OneTimePad/UC.lean | UC | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "probOutput_realCipherObserve",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n change Pr[= () | (do\n let k ← (liftM ($ᵗ BitVec sp) : OptionT ProbComp (BitVec sp))\n guard (P (k ^... | [
{
"name": "probOutput_liftM_bind_guard",
"text": "/-- Local copy of the `OracleComp`-internal lemma relating `Pr[= ()]` on\na `bind` with a `guard` to a `probEvent`. Kept private here to avoid\nexposing internals of `VCVio.OracleComp.EvalDist`. -/\nprivate lemma probOutput_liftM_bind_guard\n {α : Type} (... | [
{
"name": "probFailure_idealCipherObserve",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 12,
"n_chars": 513,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"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 Examples.OneTimePad.Basic
import VCVio.Interaction.UC.Computational
import PolyFun.Interaction.UC.OpenProcessModel
import VCVio.Interaction.UC.Runtime
import VCVio.Oracl... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Examples.OneTimePad.Basic
import VCVio.Interaction.UC.Computational
import PolyFun.Interaction.UC.OpenProcessModel
import VCVio.Interaction.UC.Runtime
import VCVio.Oracl... | @@ -161,12 +161,32 @@
let c ← ($ᵗ BitVec sp : OptionT ProbComp (BitVec sp))
guard (P c = true)
+/-- Local copy of the `OracleComp`-internal lemma relating `Pr[= ()]` on
+a `bind` with a `guard` to a `probEvent`. Kept private here to avoid
+exposing internals of `VCVio.OracleComp.EvalDist`. -/
+private lemma pro... | {
"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_100fbaae4e46_4 | 92c91e0c5dae2b62 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/OneTimePad/UC.lean | UC | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "probOutput_realCipherObserve",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n change Pr[= () | (do\n let k ← (liftM ($ᵗ BitVec sp) : OptionT ProbComp (BitVec sp))\n guard (P (k ^... | [
{
"name": "probOutput_liftM_bind_guard",
"text": "/-- Local copy of the `OracleComp`-internal lemma relating `Pr[= ()]` on\na `bind` with a `guard` to a `probEvent`. Kept private here to avoid\nexposing internals of `VCVio.OracleComp.EvalDist`. -/\nprivate lemma probOutput_liftM_bind_guard\n {α : Type} (... | [
{
"name": "evalDist_realCipherObserve_eq",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 36,
"n_chars": 1385,
"n_subproofs": 0,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 7,
"n_structural": 8,
"automation_only": false,... | 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 Examples.OneTimePad.Basic
import VCVio.Interaction.UC.Computational
import PolyFun.Interaction.UC.OpenProcessModel
import VCVio.Interaction.UC.Runtime
import VCVio.Oracl... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Examples.OneTimePad.Basic
import VCVio.Interaction.UC.Computational
import PolyFun.Interaction.UC.OpenProcessModel
import VCVio.Interaction.UC.Runtime
import VCVio.Oracl... | @@ -161,20 +161,45 @@
let c ← ($ᵗ BitVec sp : OptionT ProbComp (BitVec sp))
guard (P c = true)
+/-- Local copy of the `OracleComp`-internal lemma relating `Pr[= ()]` on
+a `bind` with a `guard` to a `probEvent`. Kept private here to avoid
+exposing internals of `VCVio.OracleComp.EvalDist`. -/
+private lemma pro... | {
"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_100fbaae4e46_5 | 83b9f9ee58f7d72a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/OneTimePad/UC.lean | UC | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "probOutput_realCipherObserve",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n change Pr[= () | (do\n let k ← (liftM ($ᵗ BitVec sp) : OptionT ProbComp (BitVec sp))\n guard (P (k ^... | [
{
"name": "probOutput_liftM_bind_guard",
"text": "/-- Local copy of the `OracleComp`-internal lemma relating `Pr[= ()]` on\na `bind` with a `guard` to a `probEvent`. Kept private here to avoid\nexposing internals of `VCVio.OracleComp.EvalDist`. -/\nprivate lemma probOutput_liftM_bind_guard\n {α : Type} (... | [
{
"name": "realSmcSemantics_eq_idealSmcSemantics",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 22,
"n_chars": 1049,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only":... | 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 Examples.OneTimePad.Basic
import VCVio.Interaction.UC.Computational
import PolyFun.Interaction.UC.OpenProcessModel
import VCVio.Interaction.UC.Runtime
import VCVio.Oracl... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Examples.OneTimePad.Basic
import VCVio.Interaction.UC.Computational
import PolyFun.Interaction.UC.OpenProcessModel
import VCVio.Interaction.UC.Runtime
import VCVio.Oracl... | @@ -161,20 +161,45 @@
let c ← ($ᵗ BitVec sp : OptionT ProbComp (BitVec sp))
guard (P c = true)
+/-- Local copy of the `OracleComp`-internal lemma relating `Pr[= ()]` on
+a `bind` with a `guard` to a `probEvent`. Kept private here to avoid
+exposing internals of `VCVio.OracleComp.EvalDist`. -/
+private lemma pro... | {
"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_100fbaae4e46_6 | 2abc763e0a2b68ba | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/OneTimePad/UC.lean | UC | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "probOutput_realCipherObserve",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n change Pr[= () | (do\n let k ← (liftM ($ᵗ BitVec sp) : OptionT ProbComp (BitVec sp))\n guard (P (k ^... | [
{
"name": "probOutput_liftM_bind_guard",
"text": "/-- Local copy of the `OracleComp`-internal lemma relating `Pr[= ()]` on\na `bind` with a `guard` to a `probEvent`. Kept private here to avoid\nexposing internals of `VCVio.OracleComp.EvalDist`. -/\nprivate lemma probOutput_liftM_bind_guard\n {α : Type} (... | [
{
"name": "observedCompEmulates_realSmcSemantics",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 30,
"n_chars": 1280,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 1,
"automation_only"... | 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 Examples.OneTimePad.Basic
import VCVio.Interaction.UC.Computational
import PolyFun.Interaction.UC.OpenProcessModel
import VCVio.Interaction.UC.Runtime
import VCVio.Oracl... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Examples.OneTimePad.Basic
import VCVio.Interaction.UC.Computational
import PolyFun.Interaction.UC.OpenProcessModel
import VCVio.Interaction.UC.Runtime
import VCVio.Oracl... | @@ -161,20 +161,45 @@
let c ← ($ᵗ BitVec sp : OptionT ProbComp (BitVec sp))
guard (P c = true)
+/-- Local copy of the `OracleComp`-internal lemma relating `Pr[= ()]` on
+a `bind` with a `guard` to a `probEvent`. Kept private here to avoid
+exposing internals of `VCVio.OracleComp.EvalDist`. -/
+private lemma pro... | {
"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_100fbaae4e46_7 | 9f3d1af285c8f268 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/OneTimePad/UC.lean | UC | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "probOutput_realCipherObserve",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n change Pr[= () | (do\n let k ← (liftM ($ᵗ BitVec sp) : OptionT ProbComp (BitVec sp))\n guard (P (k ^... | [
{
"name": "probOutput_liftM_bind_guard",
"text": "/-- Local copy of the `OracleComp`-internal lemma relating `Pr[= ()]` on\na `bind` with a `guard` to a `probEvent`. Kept private here to avoid\nexposing internals of `VCVio.OracleComp.EvalDist`. -/\nprivate lemma probOutput_liftM_bind_guard\n {α : Type} (... | [
{
"name": "observedCompEmulates_msgClosed",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 15,
"n_chars": 784,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 6 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Examples.OneTimePad.Basic
import VCVio.Interaction.UC.Computational
import PolyFun.Interaction.UC.OpenProcessModel
import VCVio.Interaction.UC.Runtime
import VCVio.Oracl... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Examples.OneTimePad.Basic
import VCVio.Interaction.UC.Computational
import PolyFun.Interaction.UC.OpenProcessModel
import VCVio.Interaction.UC.Runtime
import VCVio.Oracl... | @@ -161,20 +161,45 @@
let c ← ($ᵗ BitVec sp : OptionT ProbComp (BitVec sp))
guard (P c = true)
+/-- Local copy of the `OracleComp`-internal lemma relating `Pr[= ()]` on
+a `bind` with a `guard` to a `probEvent`. Kept private here to avoid
+exposing internals of `VCVio.OracleComp.EvalDist`. -/
+private lemma pro... | {
"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_100fbaae4e46_8 | 9e5e2cd2c5670b85 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/OneTimePad/UC.lean | UC | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "realSmcSemantics_run_distinct",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n have hne : msgClosed sp msg₀ ≠ msgClosed sp msg₁ := msgClosed_ne sp h\n refine ⟨fun W => if W ... | [
{
"name": "msgClosed_ne",
"text": "/-- Distinct plaintexts give distinct closed processes: the two\nprocesses share the state type `BitVec sp` and the `.done` spec and\ndiffer only in what `step.next` returns on the unit transcript. -/\ntheorem msgClosed_ne (sp : ℕ) {msg₀ msg₁ : BitVec sp} (h : msg₀ ≠ msg₁)... | [
{
"name": "realSmcSemantics_run_distinct",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 29,
"n_chars": 1343,
"n_subproofs": 1,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 1,
"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 Examples.OneTimePad.Basic
import VCVio.Interaction.UC.Computational
import PolyFun.Interaction.UC.OpenProcessModel
import VCVio.Interaction.UC.Runtime
import VCVio.Oracl... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Examples.OneTimePad.Basic
import VCVio.Interaction.UC.Computational
import PolyFun.Interaction.UC.OpenProcessModel
import VCVio.Interaction.UC.Runtime
import VCVio.Oracl... | @@ -174,6 +174,23 @@
next := fun _ => msg }
stepSampler := fun _ => ⟨⟩
+/-- Distinct plaintexts give distinct closed processes: the two
+processes share the state type `BitVec sp` and the `.done` spec and
+differ only in what `step.next` returns on the unit transcript. -/
+theorem msgClosed_ne (sp : ℕ) {msg... | {
"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_100fbaae4e46_9 | 2b3b2216913583e2 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/OneTimePad/UC.lean | UC | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "probOutput_realCipherObserve",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n change Pr[= () | (do\n let k ← (liftM ($ᵗ BitVec sp) : OptionT ProbComp (BitVec sp))\n guard (P (k ^... | [
{
"name": "probOutput_liftM_bind_guard",
"text": "/-- Local copy of the `OracleComp`-internal lemma relating `Pr[= ()]` on\na `bind` with a `guard` to a `probEvent`. Kept private here to avoid\nexposing internals of `VCVio.OracleComp.EvalDist`. -/\nprivate lemma probOutput_liftM_bind_guard\n {α : Type} (... | [
{
"name": "observedCompEmulates_realOtp",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 19,
"n_chars": 931,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 6 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Examples.OneTimePad.Basic
import VCVio.Interaction.UC.Computational
import PolyFun.Interaction.UC.OpenProcessModel
import VCVio.Interaction.UC.Runtime
import VCVio.Oracl... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Examples.OneTimePad.Basic
import VCVio.Interaction.UC.Computational
import PolyFun.Interaction.UC.OpenProcessModel
import VCVio.Interaction.UC.Runtime
import VCVio.Oracl... | @@ -161,20 +161,45 @@
let c ← ($ᵗ BitVec sp : OptionT ProbComp (BitVec sp))
guard (P c = true)
+/-- Local copy of the `OracleComp`-internal lemma relating `Pr[= ()]` on
+a `bind` with a `guard` to a `probEvent`. Kept private here to avoid
+exposing internals of `VCVio.OracleComp.EvalDist`. -/
+private lemma pro... | {
"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_e5724d8a43bd_0 | aaa0d7f6922c9ca4 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/Asymptotics/Security.lean | Security | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "secureAgainst_of_hybrid",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction k with\n | zero => exact hsecure\n | succ k ih =>\n exact ih (fun j _ => hconsec j (by omega))\n ... | [
{
"name": "secureAgainst_of_close",
"text": "/-- **Game-hopping step**: if the advantage of `g₁` at every security parameter is at most the\nadvantage of `g₂` plus some negligible `ε`, and `g₂` is secure, then `g₁` is secure.\n\nThis is the fundamental lemma for game-hopping proofs: each \"hop\" from `g₁` t... | [
{
"name": "secureAgainst_of_hybrid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 870,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"ma... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.SecExp
import VCVio.CryptoFoundations.Asymptotics.Negligible
/-!
# Asymptotic Security Experiments and Games
This file defines asymptotic secur... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.SecExp
import VCVio.CryptoFoundations.Asymptotics.Negligible
/-!
# Asymptotic Security Experiments and Games
This file defines asymptotic secur... | @@ -115,6 +115,20 @@
/-! ### Security reductions -/
+/-- **Game-hopping step**: if the advantage of `g₁` at every security parameter is at most the
+advantage of `g₂` plus some negligible `ε`, and `g₂` is secure, then `g₁` is secure.
+
+This is the fundamental lemma for game-hopping proofs: each "hop" from `g₁` to... | {
"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_045c169ebc15_6 | 8d2d4541ca8d33d7 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/RandomOracle/ProbeEps.lean | ProbeEps | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "tsum_probOutput_drawList_eq_one",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n tsum_probOutput_eq_one' (probFailure_drawList oa n)",
"n_chars": 54,
"n_subproofs": 0,
"n_tactics"... | [
{
"name": "probFailure_drawList",
"text": "/-- The front-block draw never fails: it only ever draws from `oa` (which is failure-free) and\nreturns, so `drawList oa n` has zero failure mass. -/\n@[simp] lemma probFailure_drawList (oa : ProbComp R) (n : ℕ) :\n Pr[⊥ | drawList oa n] = 0 := by\n induction n... | [
{
"name": "tsum_probOutput_drawList_eq_one",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 253,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 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 VCVio.OracleComp.ProbComp
/-!
# ε-Cell First-Fire Bound
This file develops the *first-fire bound* for a hidden value drawn from an arbitrary sample... | /-
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.OracleComp.ProbComp
/-!
# ε-Cell First-Fire Bound
This file develops the *first-fire bound* for a hidden value drawn from an arbitrary sample... | @@ -96,9 +96,19 @@
pure (w :: ws)
omit [DecidableEq R] in
+/-- The front-block draw never fails: it only ever draws from `oa` (which is failure-free) and
+returns, so `drawList oa n` has zero failure mass. -/
+@[simp] lemma probFailure_drawList (oa : ProbComp R) (n : ℕ) :
+ Pr[⊥ | drawList oa n] = 0 := 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_3a549bd9829c_0 | beb6d7a53cac4e2f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/C13/Scheme.lean | Scheme | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "slhVerifyInternal_slhSignInternal",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [slhKeygenInternal, slhSignInternal, slhVerifyInternal]\n rw [forsCPkFromSig_forsCSign prims _... | [
{
"name": "htIdxOf_lt",
"text": "theorem htIdxOf_lt (digest : ℕ) : htIdxOf digest < 2 ^ params.h := by\n unfold htIdxOf; exact Nat.mod_lt _ (by positivity)\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 126,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
... | [
{
"name": "slhVerifyInternal_slhSignInternal",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 31,
"n_chars": 1882,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fal... | 1 | /-
Copyright (c) 2026 Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Nicolas Consigny
-/
import HashSig.SLHDSA.C13.ForsC
import HashSig.SLHDSA.C13.Hypertree
/-!
# C13 scheme (composition)
The top-level C13 signature, composing FORS+C with the `d = 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.ForsC
import HashSig.SLHDSA.C13.Hypertree
/-!
# C13 scheme (composition)
The top-level C13 signature, composing FORS+C with the `d = 2... | @@ -49,6 +49,9 @@
/-- The hypertree index: the `h`-bit slice of the digest at bit offset `k·a` (LSB-first). -/
def htIdxOf (digest : ℕ) : ℕ := (digest >>> (params.k * params.a)) % 2 ^ params.h
+theorem htIdxOf_lt (digest : ℕ) : htIdxOf digest < 2 ^ params.h := by
+ unfold htIdxOf; exact Nat.mod_lt _ (by positivity... | {
"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_08e0282e8505_0 | 4d3a81bb6161081c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 2 | [
{
"theorem_name": "bitOf_lt_two_fin_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro _ _; exact bitOf_lt_two _ _",
"n_chars": 39,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
... | [
{
"name": "bitOf_lt_two",
"text": "private theorem bitOf_lt_two (b : UInt8) (j : Nat) : bitOf b j < 2 := by\n unfold bitOf\n rw [UInt8.toNat_and, show (1 : UInt8).toNat = 1 from rfl,\n show (2 : ℕ) = 2 ^ 1 from rfl]\n exact Nat.and_lt_two_pow _ (by norm_num)\n\n",
"fan_in": 2,
"n_lines": 7,
... | [
{
"name": "bitOf_lt_two_fin_aux",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 152,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"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
-/
import LatticeCrypto.MLKEM.Encoding
import Mathlib.Data.List.GetD
import Mathlib.Data.List.OfFn
import Mathlib.Data.Nat.Digits.Lemmas
/-!
# Concrete Encoding for ML-KEM
Pure-... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLKEM.Encoding
import Mathlib.Data.List.GetD
import Mathlib.Data.List.OfFn
import Mathlib.Data.Nat.Digits.Lemmas
/-!
# Concrete Encoding for ML-KEM
Pure-... | @@ -40,8 +40,15 @@
bitOf (packByte fun i => (bits i).val) j.val = (bits j).val := by
intro bits j; fin_cases j <;> revert bits <;> decide
+private theorem bitOf_lt_two (b : UInt8) (j : Nat) : bitOf b j < 2 := by
+ unfold bitOf
+ rw [UInt8.toNat_and, show (1 : UInt8).toNat = 1 from rfl,
+ show (2 : ℕ)... | {
"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_08e0282e8505_1 | 4006cfe3903112cb | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 2 | [
{
"theorem_name": "bitOf_lt_two_fin_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro _ _; exact bitOf_lt_two _ _",
"n_chars": 39,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
... | [
{
"name": "bitOf_lt_two",
"text": "private theorem bitOf_lt_two (b : UInt8) (j : Nat) : bitOf b j < 2 := by\n unfold bitOf\n rw [UInt8.toNat_and, show (1 : UInt8).toNat = 1 from rfl,\n show (2 : ℕ) = 2 ^ 1 from rfl]\n exact Nat.and_lt_two_pow _ (by norm_num)\n\n",
"fan_in": 2,
"n_lines": 7,
... | [
{
"name": "bitOf_lt_two_fin",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 4,
"n_chars": 104,
"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) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLKEM.Encoding
import Mathlib.Data.List.GetD
import Mathlib.Data.List.OfFn
import Mathlib.Data.Nat.Digits.Lemmas
/-!
# Concrete Encoding for ML-KEM
Pure-... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLKEM.Encoding
import Mathlib.Data.List.GetD
import Mathlib.Data.List.OfFn
import Mathlib.Data.Nat.Digits.Lemmas
/-!
# Concrete Encoding for ML-KEM
Pure-... | @@ -40,8 +40,15 @@
bitOf (packByte fun i => (bits i).val) j.val = (bits j).val := by
intro bits j; fin_cases j <;> revert bits <;> decide
-private theorem bitOf_lt_two_fin (b : UInt8) (j : Fin 8) : bitOf b j.val < 2 := sorry
+private theorem bitOf_lt_two (b : UInt8) (j : Nat) : bitOf b j < 2 := by
+ unfold... | {
"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_08e0282e8505_2 | 9c20a8facb5410fc | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 1 | [
{
"theorem_name": "packByte_bitOf_byte",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa using packByte_bitOf_fin ⟨b.toNat, UInt8.toNat_lt b⟩",
"n_chars": 68,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "packByte_bitOf_fin",
"text": "private theorem packByte_bitOf_fin :\n ∀ n : Fin (2 ^ 8), packByte (fun j => bitOf n.val.toUInt8 j.val) = n.val.toUInt8 := by\n intro n; fin_cases n <;> rfl\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 162,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "packByte_bitOf_byte",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 164,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"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
-/
import LatticeCrypto.MLKEM.Encoding
import Mathlib.Data.List.GetD
import Mathlib.Data.List.OfFn
import Mathlib.Data.Nat.Digits.Lemmas
/-!
# Concrete Encoding for ML-KEM
Pure-... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLKEM.Encoding
import Mathlib.Data.List.GetD
import Mathlib.Data.List.OfFn
import Mathlib.Data.Nat.Digits.Lemmas
/-!
# Concrete Encoding for ML-KEM
Pure-... | @@ -40,8 +40,13 @@
bitOf (packByte fun i => (bits i).val) j.val = (bits j).val := by
intro bits j; fin_cases j <;> revert bits <;> decide
+private theorem packByte_bitOf_fin :
+ ∀ n : Fin (2 ^ 8), packByte (fun j => bitOf n.val.toUInt8 j.val) = n.val.toUInt8 := by
+ intro n; fin_cases n <;> rfl
+
priva... | {
"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.