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_08e0282e8505_3 | 5d4620b7bed8c1de | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 4 | [
{
"theorem_name": "bitsToBytes_bytesToBits",
"depth": 1,
"n_commands": 0,
"n_lines": 38,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply ByteArray.ext\n apply Array.ext\n · simp [bitsToBytes, bytesToBits, ByteArray.size_data]\n · intro i hi1 ... | [
{
"name": "array_getD_eq_getElem",
"text": "private theorem array_getD_eq_getElem {α : Type} (a : Array α) {i : Nat}\n {fallback : α} (hi : i < a.size) :\n a.getD i fallback = a[i] := by\n simp [Array.getD, hi]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 175,
"n_subproofs": 0,
"n_... | [
{
"name": "bitsToBytes_bytesToBits",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 41,
"n_chars": 1692,
"n_subproofs": 7,
"n_tactics": 38,
"cyclomatic": 1,
"n_automation": 9,
"n_rewrites": 7,
"n_structural": 6,
"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 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-... | @@ -48,6 +48,11 @@
packByte (fun j => bitOf b j.val) = b := by
simpa using packByte_bitOf_fin ⟨b.toNat, UInt8.toNat_lt b⟩
+private theorem array_getD_eq_getElem {α : Type} (a : Array α) {i : Nat}
+ {fallback : α} (hi : i < a.size) :
+ a.getD i fallback = a[i] := by
+ simp [Array.getD, hi]
+
/-- Total ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"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_4 | 7a34055962c04f79 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 4 | [
{
"theorem_name": "bitsToBytes_bytesToBits",
"depth": 1,
"n_commands": 0,
"n_lines": 38,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply ByteArray.ext\n apply Array.ext\n · simp [bitsToBytes, bytesToBits, ByteArray.size_data]\n · intro i hi1 ... | [
{
"name": "array_getD_eq_getElem",
"text": "private theorem array_getD_eq_getElem {α : Type} (a : Array α) {i : Nat}\n {fallback : α} (hi : i < a.size) :\n a.getD i fallback = a[i] := by\n simp [Array.getD, hi]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 175,
"n_subproofs": 0,
"n_... | [
{
"name": "bytesToBits_getD_lt_two",
"fan_in": 4,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 20,
"n_chars": 729,
"n_subproofs": 2,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
"m... | 3 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import 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-... | @@ -49,6 +49,11 @@
private theorem bitOf_lt_two_fin (b : UInt8) (j : Fin 8) : bitOf b j.val < 2 :=
bitOf_lt_two b j.val
+private theorem array_getD_eq_getElem {α : Type} (a : Array α) {i : Nat}
+ {fallback : α} (hi : i < a.size) :
+ a.getD i fallback = a[i] := by
+ simp [Array.getD, hi]
+
/-- Total byte l... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_08e0282e8505_5 | e821cc5ff1834dfe | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 1 | [
{
"theorem_name": "digitsAppend_two_one_getD_zero_mod",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [Nat.pow_one] using digitsAppend_two_one_getD_zero ⟨n % 2, Nat.mod_lt _ (by decide)⟩",
"n_char... | [
{
"name": "digitsAppend_two_one_getD_zero",
"text": "private theorem digitsAppend_two_one_getD_zero :\n ∀ n : Fin 2, (Nat.digitsAppend 2 1 n.val).getD 0 0 = n.val := by\n decide\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 130,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
... | [
{
"name": "digitsAppend_two_one_getD_zero_mod",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 277,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import 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-... | @@ -60,8 +60,13 @@
exact Nat.div_lt_of_lt_mul this
bitOf (bytes[byteIdx]'hbyte) bitIdx
+private theorem digitsAppend_two_one_getD_zero :
+ ∀ n : Fin 2, (Nat.digitsAppend 2 1 n.val).getD 0 0 = n.val := by
+ decide
+
private theorem digitsAppend_two_one_getD_zero_mod (n : Nat) :
- (Nat.digitsAppend ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"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_6 | db97449fbfed2c0a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 1 | [
{
"theorem_name": "byteDecode_byteEncode_of_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 130,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let bits : Array Nat := Array.ofFn fun idx : Fin (ringDegree * d) =>\n let coeff := idx.val / d\n le... | [
{
"name": "digitsAppend_getD_two_lt",
"text": "private theorem digitsAppend_getD_two_lt {d n bit : Nat} (hn : n < 2 ^ d) (hbit : bit < d) :\n (Nat.digitsAppend 2 d n).getD bit 0 < 2 := by\n rw [List.getD_eq_getElem _ _ (by simpa [Nat.length_digitsAppend (by decide) d hn] using hbit)]\n exact Nat.lt_of_... | [
{
"name": "byteDecode_byteEncode_of_bound",
"fan_in": 3,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 134,
"n_chars": 6203,
"n_subproofs": 34,
"n_tactics": 130,
"cyclomatic": 1,
"n_automation": 21,
"n_rewrites": 12,
"n_structural": 20,
"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 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-... | @@ -118,6 +118,11 @@
Nat.ofDigits 2 (Nat.digitsAppend 2 d n) = n := by
simpa using (Nat.setInvOn_digitsAppend_ofDigits (b := 2) (by decide) d).2 hn
+private theorem digitsAppend_getD_two_lt {d n bit : Nat} (hn : n < 2 ^ d) (hbit : bit < d) :
+ (Nat.digitsAppend 2 d n).getD bit 0 < 2 := by
+ rw [List.getD_... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"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_7 | 9f653bfdb6e7c865 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 4 | [
{
"theorem_name": "byteDecode_one_coeff",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbitMod : (bytesToBits bytes).getD idx.val 0 < modulus :=\n lt_trans (bytesToBits_getD_lt_two bytes idx.val) (... | [
{
"name": "bytesToBits_getD_lt_two",
"text": "private theorem bytesToBits_getD_lt_two (bytes : ByteArray) (i : Nat) :\n (bytesToBits bytes).getD i 0 < 2 := by\n by_cases hi : i < (bytesToBits bytes).size\n · rw [array_getD_eq_getElem (a := bytesToBits bytes) (i := i) (fallback := 0) hi]\n unfold byt... | [
{
"name": "byteDecode_one_coeff",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 14,
"n_chars": 564,
"n_subproofs": 2,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_n... | 4 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import 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-... | @@ -74,6 +74,25 @@
exact Nat.div_lt_of_lt_mul this
bitOf (bytes[byteIdx]'hbyte) bitIdx
+private theorem bytesToBits_getD_lt_two (bytes : ByteArray) (i : Nat) :
+ (bytesToBits bytes).getD i 0 < 2 := by
+ by_cases hi : i < (bytesToBits bytes).size
+ · rw [array_getD_eq_getElem (a := bytesToBits bytes) ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"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_8 | c8c7a12505d0133f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 4 | [
{
"theorem_name": "getByteD_byteEncode12Poly",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hsizeData : j < (byteEncode12Poly f).data.size := by\n simpa [byteEncode12Poly] using hj\n have hsize : ... | [
{
"name": "getByteD_eq_getElem",
"text": "private theorem getByteD_eq_getElem {bytes : ByteArray} {i : Nat} (hi : i < bytes.size) :\n getByteD bytes i = bytes[i] := by\n unfold getByteD\n simp [hi]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 159,
"n_subproofs": 0,
"n_tactics": 3,
... | [
{
"name": "getByteD_byteEncode12Poly",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 455,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 3,
"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 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-... | @@ -150,8 +150,20 @@
(a / 256 + 16 * (b % 16)) / 16 + 16 * (b / 16) = b := by
grind
+private theorem getByteD_eq_getElem {bytes : ByteArray} {i : Nat} (hi : i < bytes.size) :
+ getByteD bytes i = bytes[i] := by
+ unfold getByteD
+ simp [hi]
+
private theorem getByteD_byteEncode12Poly (f : Tq) {j : Nat} ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_08e0282e8505_9 | 1825db0b4a61abdc | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 1 | [
{
"theorem_name": "byteDecode12Poly_byteEncode12Poly",
"depth": 1,
"n_commands": 0,
"n_lines": 121,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hfun :\n (fun idx : Fin ringDegree =>\n let pair := idx.val / 2\n let b0 := (ge... | [
{
"name": "tq_getElem_eq_coeffs",
"text": "private theorem tq_getElem_eq_coeffs (f : Tq) {i : Nat} (hi : i < ringDegree) :\n f[i] = f.coeffs[i] := rfl\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 111,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_... | [
{
"name": "byteDecode12Poly_byteEncode12Poly",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 5,
"n_lines": 124,
"n_chars": 5125,
"n_subproofs": 30,
"n_tactics": 121,
"cyclomatic": 1,
"n_automation": 36,
"n_rewrites": 9,
"n_structural": 18,
"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 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-... | @@ -165,6 +165,9 @@
rw [ByteArray.getElem_eq_getElem_data]
simp [byteEncode12Poly]
+private theorem tq_getElem_eq_coeffs (f : Tq) {i : Nat} (hi : i < ringDegree) :
+ f[i] = f.coeffs[i] := rfl
+
/-- Encode a vector of `k` polynomials with 12-bit coefficients. -/
def byteEncode12Vec {k : Nat} (v : TqVec 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_08e0282e8505_10 | 2d2de75703384357 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 1 | [
{
"theorem_name": "getByteD_byteEncode12Vec_eq_byteEncode12Poly",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [getByteD_byteEncode12Vec (v := v) hpoly hj,\n getByteD_byteEncode12Poly (f := v[poly]... | [
{
"name": "getByteD_byteEncode12Vec",
"text": "private theorem getByteD_byteEncode12Vec {k : Nat} (v : TqVec k) {poly j : Nat}\n (hpoly : poly < k) (hj : j < 384) :\n getByteD (byteEncode12Vec v) (poly * 384 + j) =\n byteEncode12PolyByte (v[poly]'hpoly) ⟨j, hj⟩ := by\n have hidxNat : poly * 384 ... | [
{
"name": "getByteD_byteEncode12Vec_eq_byteEncode12Poly",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 358,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_o... | 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.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-... | @@ -172,6 +172,25 @@
def byteEncode12Vec {k : Nat} (v : TqVec k) : ByteArray :=
ByteArray.mk <| Array.ofFn (byteEncode12VecByte v)
+private theorem getByteD_byteEncode12Vec {k : Nat} (v : TqVec k) {poly j : Nat}
+ (hpoly : poly < k) (hj : j < 384) :
+ getByteD (byteEncode12Vec v) (poly * 384 + j) =
+ 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_08e0282e8505_11 | 924ba338dd5310a5 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 1 | [
{
"theorem_name": "byteDecode12VecPoly_byteEncode12Vec_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 41,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hfun :\n (fun idx : Fin ringDegree =>\n let pair := idx.val / 2\n let base ... | [
{
"name": "getByteD_byteEncode12Vec_eq_byteEncode12Poly",
"text": "private theorem getByteD_byteEncode12Vec_eq_byteEncode12Poly\n {k : Nat} (v : TqVec k) {poly j : Nat} (hpoly : poly < k) (hj : j < 384) :\n getByteD (byteEncode12Vec v) (poly * 384 + j) =\n getByteD (byteEncode12Poly (v[poly]'hpol... | [
{
"name": "byteDecode12VecPoly_byteEncode12Vec_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 45,
"n_chars": 1934,
"n_subproofs": 6,
"n_tactics": 41,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 4,
"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 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-... | @@ -319,9 +319,56 @@
· intro i hi1 hi2
simpa using tq_getElem_eq_coeffs (f := f) (i := i) (hi := by simpa using hi1)
+private theorem getByteD_byteEncode12Vec_eq_byteEncode12Poly
+ {k : Nat} (v : TqVec k) {poly j : Nat} (hpoly : poly < k) (hj : j < 384) :
+ getByteD (byteEncode12Vec v) (poly * 3... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"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_12 | dd65cfa0efd46fcd | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 4 | [
{
"theorem_name": "getByteD_byteEncode12Poly",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hsizeData : j < (byteEncode12Poly f).data.size := by\n simpa [byteEncode12Poly] using hj\n have hsize : ... | [
{
"name": "getByteD_eq_getElem",
"text": "private theorem getByteD_eq_getElem {bytes : ByteArray} {i : Nat} (hi : i < bytes.size) :\n getByteD bytes i = bytes[i] := by\n unfold getByteD\n simp [hi]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 159,
"n_subproofs": 0,
"n_tactics": 3,
... | [
{
"name": "getByteD_byteEncodeVec",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 34,
"n_chars": 1580,
"n_subproofs": 6,
"n_tactics": 29,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 5,
"n_structural": 4,
"automation_only": false,
"m... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import 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-... | @@ -150,8 +150,20 @@
(a / 256 + 16 * (b % 16)) / 16 + 16 * (b / 16) = b := by
grind
+private theorem getByteD_eq_getElem {bytes : ByteArray} {i : Nat} (hi : i < bytes.size) :
+ getByteD bytes i = bytes[i] := by
+ unfold getByteD
+ simp [hi]
+
private theorem getByteD_byteEncode12Poly (f : Tq) {j : Nat} ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_08e0282e8505_13 | 52c4575e2293a62b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 4 | [
{
"theorem_name": "getByteD_byteEncode12Poly",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hsizeData : j < (byteEncode12Poly f).data.size := by\n simpa [byteEncode12Poly] using hj\n have hsize : ... | [
{
"name": "getByteD_eq_getElem",
"text": "private theorem getByteD_eq_getElem {bytes : ByteArray} {i : Nat} (hi : i < bytes.size) :\n getByteD bytes i = bytes[i] := by\n unfold getByteD\n simp [hi]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 159,
"n_subproofs": 0,
"n_tactics": 3,
... | [
{
"name": "byteDecodeVec_byteEncodeVec_of_bound",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 9,
"n_lines": 30,
"n_chars": 1158,
"n_subproofs": 3,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 6,
"automation_only":... | 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 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-... | @@ -369,8 +369,20 @@
(a / 256 + 16 * (b % 16)) / 16 + 16 * (b / 16) = b := by
grind
+private theorem getByteD_eq_getElem {bytes : ByteArray} {i : Nat} (hi : i < bytes.size) :
+ getByteD bytes i = bytes[i] := by
+ unfold getByteD
+ simp [hi]
+
private theorem getByteD_byteEncode12Poly (f : Tq) {j : Nat} ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_08e0282e8505_14 | aa12e109356f2183 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 1 | [
{
"theorem_name": "compressPoly_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro idx\n have hcoeff : (compressPoly d f)[idx.val] = compress d (f[idx.val]) := by\n unfold compressPoly\n exa... | [
{
"name": "compress_val_lt_pow",
"text": "private theorem compress_val_lt_pow {d : Nat} (hpow : (1 <<< d) < modulus) (x : Coeff) :\n (compress d x : Coeff).val < 2 ^ d := by\n let shifted := (x.val * (1 <<< d) + modulus / 2) / modulus\n have hpowPos : 0 < (1 <<< d) := by\n rw [Nat.shiftLeft_eq, Nat.... | [
{
"name": "compressPoly_bound",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 426,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 3,
"automation_only": false,
"max_nes... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import 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-... | @@ -447,8 +447,29 @@
def decompressVec (d : Nat) {k : Nat} (v : RqVec k) : RqVec k :=
v.map (decompressPoly d)
+private theorem compress_val_lt_pow {d : Nat} (hpow : (1 <<< d) < modulus) (x : Coeff) :
+ (compress d x : Coeff).val < 2 ^ d := by
+ let shifted := (x.val * (1 <<< d) + modulus / 2) / modulus
+ ha... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"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_15 | a4a9e84c15ebb5e5 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 2 | [
{
"theorem_name": "compressVec_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro poly coeff\n simpa [compressVec] using compressPoly_bound (d := d) hpow (f := v[poly.val]) coeff",
"n_chars": ... | [
{
"name": "compressPoly_bound",
"text": "private theorem compressPoly_bound {d : Nat} (hpow : (1 <<< d) < modulus) (f : Rq) :\n ∀ idx : Fin ringDegree, (((compressPoly d f)[idx.val] : Coeff).val) < 2 ^ d := by\n intro idx\n have hcoeff : (compressPoly d f)[idx.val] = compress d (f[idx.val]) := by\n ... | [
{
"name": "compressVec_bound",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 332,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import 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-... | @@ -462,9 +462,20 @@
_ < (1 <<< d) := hmod
_ = 2 ^ d := by simp [Nat.shiftLeft_eq]
+private theorem compressPoly_bound {d : Nat} (hpow : (1 <<< d) < modulus) (f : Rq) :
+ ∀ idx : Fin ringDegree, (((compressPoly d f)[idx.val] : Coeff).val) < 2 ^ d := by
+ intro idx
+ have hcoeff : (compressPoly d f)[idx... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_08e0282e8505_16 | 417ca0a62e79496c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 4 | [
{
"theorem_name": "byteDecode_one_coeff",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbitMod : (bytesToBits bytes).getD idx.val 0 < modulus :=\n lt_trans (bytesToBits_getD_lt_two bytes idx.val) (... | [
{
"name": "bytesToBits_getD_lt_two",
"text": "private theorem bytesToBits_getD_lt_two (bytes : ByteArray) (i : Nat) :\n (bytesToBits bytes).getD i 0 < 2 := by\n by_cases hi : i < (bytesToBits bytes).size\n · rw [array_getD_eq_getElem (a := bytesToBits bytes) (i := i) (fallback := 0) hi]\n unfold byt... | [
{
"name": "byteDecode1Msg_val",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 13,
"n_chars": 612,
"n_subproofs": 2,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nes... | 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.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-... | @@ -74,6 +74,25 @@
exact Nat.div_lt_of_lt_mul this
bitOf (bytes[byteIdx]'hbyte) bitIdx
+private theorem bytesToBits_getD_lt_two (bytes : ByteArray) (i : Nat) :
+ (bytesToBits bytes).getD i 0 < 2 := by
+ by_cases hi : i < (bytesToBits bytes).size
+ · rw [array_getD_eq_getElem (a := bytesToBits bytes) ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"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_17 | 2caf5698797e0f89 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 2 | [
{
"theorem_name": "toArray_byteEncode1Msg",
"depth": 1,
"n_commands": 0,
"n_lines": 27,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let bits : Array Nat := Array.ofFn fun idx : Fin ringDegree =>\n (((f.get idx : Coeff).val) % 2)\n have hbitsEq... | [
{
"name": "messageToArray_ofByteArray",
"text": "private theorem messageToArray_ofByteArray (ba : ByteArray) (hsize : ba.size = 32) :\n (Vector.ofFn (n := 32) (fun i => ba[i.val]!)).toArray = ba.data := by\n rw [Vector.toArray_ofFn]\n apply Array.ext\n · simpa [ByteArray.size_data] using hsize.symm\n ... | [
{
"name": "toArray_byteEncode1Msg",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 30,
"n_chars": 1263,
"n_subproofs": 5,
"n_tactics": 27,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
"m... | 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.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-... | @@ -496,8 +496,45 @@
Vector.ofFn fun idx =>
((bits.getD idx.val 0 : Nat) : Coeff)
+private theorem messageToArray_ofByteArray (ba : ByteArray) (hsize : ba.size = 32) :
+ (Vector.ofFn (n := 32) (fun i => ba[i.val]!)).toArray = ba.data := by
+ rw [Vector.toArray_ofFn]
+ apply Array.ext
+ · simpa [ByteArra... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"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_18 | f3df036d83db8b03 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 1 | [
{
"theorem_name": "byteArray_byteEncode1Msg",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply ByteArray.ext\n simpa using toArray_byteEncode1Msg (f := f)",
"n_chars": 71,
"n_subproofs": 0,
... | [
{
"name": "toArray_byteEncode1Msg",
"text": "private theorem toArray_byteEncode1Msg (f : Rq) :\n (byteEncode1Msg f).toArray = (byteEncode 1 f).data := by\n let bits : Array Nat := Array.ofFn fun idx : Fin ringDegree =>\n (((f.get idx : Coeff).val) % 2)\n have hbitsEq :\n (Array.ofFn fun idx : F... | [
{
"name": "byteArray_byteEncode1Msg",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 6,
"n_chars": 188,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"ma... | 5 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import 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-... | @@ -507,8 +507,39 @@
simp [hi, ByteArray.getElem_eq_getElem_data]
rfl
+private theorem toArray_byteEncode1Msg (f : Rq) :
+ (byteEncode1Msg f).toArray = (byteEncode 1 f).data := by
+ let bits : Array Nat := Array.ofFn fun idx : Fin ringDegree =>
+ (((f.get idx : Coeff).val) % 2)
+ have hbitsEq :
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"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_19 | 8cd183e05fd4ffc2 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 3 | [
{
"theorem_name": "byteDecode1Msg_eq_byteDecode1",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n LatticeCrypto.Poly.ext_get_eq fun idx => by\n apply (ZMod.val_injective modulus)\n calc\n (((byteDeco... | [
{
"name": "byteDecode1Msg_val",
"text": "private theorem byteDecode1Msg_val (msg : Message) (idx : Fin ringDegree) :\n ((byteDecode1Msg msg).get idx : Coeff).val =\n (bytesToBits (ByteArray.mk msg.toArray)).getD idx.val 0 := by\n have hbitMod : (bytesToBits (ByteArray.mk msg.toArray)).getD idx.val ... | [
{
"name": "byteDecode1Msg_eq_byteDecode1",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 12,
"n_chars": 547,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"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 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-... | @@ -504,8 +504,28 @@
Vector.ofFn fun idx =>
((bits.getD idx.val 0 : Nat) : Coeff)
+private theorem byteDecode1Msg_val (msg : Message) (idx : Fin ringDegree) :
+ ((byteDecode1Msg msg).get idx : Coeff).val =
+ (bytesToBits (ByteArray.mk msg.toArray)).getD idx.val 0 := by
+ have hbitMod : (bytesToBits (... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"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_20 | c9c6757ef80247ef | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 2 | [
{
"theorem_name": "toArray_byteEncode1Msg",
"depth": 1,
"n_commands": 0,
"n_lines": 27,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let bits : Array Nat := Array.ofFn fun idx : Fin ringDegree =>\n (((f.get idx : Coeff).val) % 2)\n have hbitsEq... | [
{
"name": "messageToArray_ofByteArray",
"text": "private theorem messageToArray_ofByteArray (ba : ByteArray) (hsize : ba.size = 32) :\n (Vector.ofFn (n := 32) (fun i => ba[i.val]!)).toArray = ba.data := by\n rw [Vector.toArray_ofFn]\n apply Array.ext\n · simpa [ByteArray.size_data] using hsize.symm\n ... | [
{
"name": "byteEncode1Msg_byteDecode1Msg",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 9,
"n_lines": 34,
"n_chars": 1674,
"n_subproofs": 7,
"n_tactics": 31,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 5,
"n_structural": 4,
"automation_only": false,... | 9 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import 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-... | @@ -551,8 +551,49 @@
unfold byteDecode1Msg
simpa using hcast
+private theorem messageToArray_ofByteArray (ba : ByteArray) (hsize : ba.size = 32) :
+ (Vector.ofFn (n := 32) (fun i => ba[i.val]!)).toArray = ba.data := by
+ rw [Vector.toArray_ofFn]
+ apply Array.ext
+ · simpa [ByteArray.size_data] using hsiz... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"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_21 | fd742ac2dc0b1c37 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 1 | [
{
"theorem_name": "byteArray_byteEncode1Msg",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply ByteArray.ext\n simpa using toArray_byteEncode1Msg (f := f)",
"n_chars": 71,
"n_subproofs": 0,
... | [
{
"name": "toArray_byteEncode1Msg",
"text": "private theorem toArray_byteEncode1Msg (f : Rq) :\n (byteEncode1Msg f).toArray = (byteEncode 1 f).data := by\n let bits : Array Nat := Array.ofFn fun idx : Fin ringDegree =>\n (((f.get idx : Coeff).val) % 2)\n have hbitsEq :\n (Array.ofFn fun idx : F... | [
{
"name": "byteDecode1Msg_byteEncode1Msg_of_bound",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 18,
"n_lines": 13,
"n_chars": 574,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automation_only"... | 17 | /-
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-... | @@ -751,8 +751,39 @@
simp [hi, ByteArray.getElem_eq_getElem_data]
rfl
+private theorem toArray_byteEncode1Msg (f : Rq) :
+ (byteEncode1Msg f).toArray = (byteEncode 1 f).data := by
+ let bits : Array Nat := Array.ofFn fun idx : Fin ringDegree =>
+ (((f.get idx : Coeff).val) % 2)
+ have hbitsEq :
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"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_22 | a53d25de3c4793fb | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 3 | [
{
"theorem_name": "byteDecode1Msg_eq_byteDecode1",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n LatticeCrypto.Poly.ext_get_eq fun idx => by\n apply (ZMod.val_injective modulus)\n calc\n (((byteDeco... | [
{
"name": "byteDecode1Msg_val",
"text": "private theorem byteDecode1Msg_val (msg : Message) (idx : Fin ringDegree) :\n ((byteDecode1Msg msg).get idx : Coeff).val =\n (bytesToBits (ByteArray.mk msg.toArray)).getD idx.val 0 := by\n have hbitMod : (bytesToBits (ByteArray.mk msg.toArray)).getD idx.val ... | [
{
"name": "byteDecode1_get_val_lt_two",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 10,
"n_chars": 453,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
... | 5 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import 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-... | @@ -491,6 +491,18 @@
Vector.ofFn fun idx =>
((bits.getD idx.val 0 : Nat) : Coeff)
+private theorem byteDecode1Msg_val (msg : Message) (idx : Fin ringDegree) :
+ ((byteDecode1Msg msg).get idx : Coeff).val =
+ (bytesToBits (ByteArray.mk msg.toArray)).getD idx.val 0 := by
+ have hbitMod : (bytesToBits (... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"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_23 | 26d38ada8fb0bd22 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/Encoding.lean | Encoding | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 36 | 1 | [
{
"theorem_name": "byteArray_byteEncode1Msg",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply ByteArray.ext\n simpa using toArray_byteEncode1Msg (f := f)",
"n_chars": 71,
"n_subproofs": 0,
... | [
{
"name": "toArray_byteEncode1Msg",
"text": "private theorem toArray_byteEncode1Msg (f : Rq) :\n (byteEncode1Msg f).toArray = (byteEncode 1 f).data := by\n let bits : Array Nat := Array.ofFn fun idx : Fin ringDegree =>\n (((f.get idx : Coeff).val) % 2)\n have hbitsEq :\n (Array.ofFn fun idx : F... | [
{
"name": "concreteEncodingLaws",
"fan_in": 0,
"n_deps_direct": 6,
"n_deps_transitive": 29,
"n_lines": 29,
"n_chars": 1319,
"n_subproofs": 1,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 0,
"n_structural": 5,
"automation_only": false,
"ma... | 28 | /-
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-... | @@ -891,8 +891,39 @@
simp [hi, ByteArray.getElem_eq_getElem_data]
rfl
+private theorem toArray_byteEncode1Msg (f : Rq) :
+ (byteEncode1Msg f).toArray = (byteEncode 1 f).data := by
+ let bits : Array Nat := Array.ofFn fun idx : Fin ringDegree =>
+ (((f.get idx : Coeff).val) % 2)
+ have hbitsEq :
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_d882124ae594_0 | cf669e1d74016f0e | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/ElGamal/ReductionCost.lean | ReductionCost | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "IND_CPA_OneTime_DDHReduction_openCost_pathwiseCostEqOnSupport",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [IND_CPA_OneTime_DDHReduction_openCost] using\n (IND_CPA_OneTime_DDH... | [
{
"name": "IND_CPA_OneTime_DDHReduction_openProfiled_pathwiseCostEqOnSupport",
"text": "/-- **Canonical cost theorem.** Every reachable execution of the open, resource-profile-instrumented\nDDH reduction carries the same resource profile: the reduction's intrinsic overhead together with\nthe profiles assign... | [
{
"name": "IND_CPA_OneTime_DDHReduction_openCost_pathwiseCostEqOnSupport",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 17,
"n_chars": 930,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Examples.ElGamal.Basic
import VCVio.CryptoFoundations.Asymptotics.ReductionCost
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.OracleComp.QueryTracking.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 Examples.ElGamal.Basic
import VCVio.CryptoFoundations.Asymptotics.ReductionCost
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.OracleComp.QueryTracking.Re... | @@ -297,6 +297,111 @@
variable {F : Type} [Field F] [Fintype F] [DecidableEq F] [SampleableType F]
variable {G : Type} [AddCommGroup G] [Module F G]
+/-- **Canonical cost theorem.** Every reachable execution of the open, resource-profile-instrumented
+DDH reduction carries the same resource profile: the reduction'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_d882124ae594_1 | a3b03944c9cb6f21 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/ElGamal/ReductionCost.lean | ReductionCost | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "IND_CPA_OneTime_DDHReduction_openCost_pathwiseCostEqOnSupport",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [IND_CPA_OneTime_DDHReduction_openCost] using\n (IND_CPA_OneTime_DDH... | [
{
"name": "IND_CPA_OneTime_DDHReduction_openProfiled_pathwiseCostEqOnSupport",
"text": "/-- **Canonical cost theorem.** Every reachable execution of the open, resource-profile-instrumented\nDDH reduction carries the same resource profile: the reduction's intrinsic overhead together with\nthe profiles assign... | [
{
"name": "IND_CPA_OneTime_DDHReduction_profiled_pathwiseCostEqOnSupport",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 21,
"n_chars": 1152,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Examples.ElGamal.Basic
import VCVio.CryptoFoundations.Asymptotics.ReductionCost
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.OracleComp.QueryTracking.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 Examples.ElGamal.Basic
import VCVio.CryptoFoundations.Asymptotics.ReductionCost
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.OracleComp.QueryTracking.Re... | @@ -297,6 +297,111 @@
variable {F : Type} [Field F] [Fintype F] [DecidableEq F] [SampleableType F]
variable {G : Type} [AddCommGroup G] [Module F G]
+/-- **Canonical cost theorem.** Every reachable execution of the open, resource-profile-instrumented
+DDH reduction carries the same resource profile: the reduction'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_d882124ae594_2 | 59e8313db7e3b29d | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/ElGamal/ReductionCost.lean | ReductionCost | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 3 | [
{
"theorem_name": "IND_CPA_OneTime_DDHReduction_modeledCost_pathwiseCostEqOnSupport",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [oneTimeDDHReductionCost] using\n IND_CPA_OneTime_DDHReduction_pr... | [
{
"name": "IND_CPA_OneTime_DDHReduction_profiled_pathwiseCostEqOnSupport",
"text": "/-- Cost-transform theorem for the closed one-time ElGamal DDH reduction.\n\nIf `profile` assigns resource profiles to the two adversary capabilities `chooseMessages` and\n`distinguish`, then the instantiated reduction has e... | [
{
"name": "IND_CPA_OneTime_DDHReduction_modeledCost_pathwiseCostEqOnSupport",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 20,
"n_chars": 1075,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"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 Examples.ElGamal.Basic
import VCVio.CryptoFoundations.Asymptotics.ReductionCost
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.OracleComp.QueryTracking.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 Examples.ElGamal.Basic
import VCVio.CryptoFoundations.Asymptotics.ReductionCost
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.OracleComp.QueryTracking.Re... | @@ -441,6 +441,26 @@
(oneTimeINDCPAImpl (gen := gen) adv)
= IND_CPA_OneTime_DDHReduction (F := F) (G := G) (gen := gen) adv g A B T := rfl
+/-- Cost-transform theorem for the closed one-time ElGamal DDH reduction.
+
+If `profile` assigns resource profiles to the two adversary capabilities `chooseMessage... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_d882124ae594_3 | 8a8adee7bb13f934 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/ElGamal/ReductionCost.lean | ReductionCost | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 3 | [
{
"theorem_name": "IND_CPA_OneTime_DDHReduction_modeledCost_pathwiseCostEqOnSupport",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [oneTimeDDHReductionCost] using\n IND_CPA_OneTime_DDHReduction_pr... | [
{
"name": "IND_CPA_OneTime_DDHReduction_profiled_pathwiseCostEqOnSupport",
"text": "/-- Cost-transform theorem for the closed one-time ElGamal DDH reduction.\n\nIf `profile` assigns resource profiles to the two adversary capabilities `chooseMessages` and\n`distinguish`, then the instantiated reduction has e... | [
{
"name": "IND_CPA_OneTime_DDHReduction_intrinsicProfile_pathwiseCostEqOnSupport",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 31,
"n_chars": 1556,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_struc... | 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.ElGamal.Basic
import VCVio.CryptoFoundations.Asymptotics.ReductionCost
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.OracleComp.QueryTracking.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 Examples.ElGamal.Basic
import VCVio.CryptoFoundations.Asymptotics.ReductionCost
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.OracleComp.QueryTracking.Re... | @@ -441,6 +441,26 @@
(oneTimeINDCPAImpl (gen := gen) adv)
= IND_CPA_OneTime_DDHReduction (F := F) (G := G) (gen := gen) adv g A B T := rfl
+/-- Cost-transform theorem for the closed one-time ElGamal DDH reduction.
+
+If `profile` assigns resource profiles to the two adversary capabilities `chooseMessage... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_d882124ae594_4 | a88a77ec8b1d7c06 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/ElGamal/ReductionCost.lean | ReductionCost | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "oneTimeINDCPA_secureAgainst_of_ddh_secureAgainst_withCost",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine SecurityGame.secureAgainst_of_reduction_withCost\n (R := oneTimeDDHRedu... | [
{
"name": "oneTimeINDCPASecurityGame_advantage_eq_oneTimeDDHReductionSecurityGame_advantage",
"text": "/-- The one-time ElGamal IND-CPA game and the DDH reduction game have the same asymptotic\nadvantage function. This is the security-side analogue of the exact reduction theorem from\n`Examples.ElGamal.Basi... | [
{
"name": "oneTimeINDCPA_secureAgainst_of_ddh_secureAgainst_withCost",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 36,
"n_chars": 1972,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Examples.ElGamal.Basic
import VCVio.CryptoFoundations.Asymptotics.ReductionCost
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.OracleComp.QueryTracking.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 Examples.ElGamal.Basic
import VCVio.CryptoFoundations.Asymptotics.ReductionCost
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.OracleComp.QueryTracking.Re... | @@ -386,6 +386,32 @@
DiffieHellman.ddhDistAdvantage gen
(IND_CPA_OneTime_DDHReduction (F := F) (G := G) (gen := gen) adv)
+/-- The one-time ElGamal IND-CPA game and the DDH reduction game have the same asymptotic
+advantage function. This is the security-side analogue of the exact reduction theorem fr... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_d882124ae594_5 | 579af1b2f672cec0 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/ElGamal/ReductionCost.lean | ReductionCost | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 3 | [
{
"theorem_name": "IND_CPA_OneTime_DDHReduction_modeledCost_pathwiseCostEqOnSupport",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [oneTimeDDHReductionCost] using\n IND_CPA_OneTime_DDHReduction_pr... | [
{
"name": "IND_CPA_OneTime_DDHReduction_profiled_pathwiseCostEqOnSupport",
"text": "/-- Cost-transform theorem for the closed one-time ElGamal DDH reduction.\n\nIf `profile` assigns resource profiles to the two adversary capabilities `chooseMessages` and\n`distinguish`, then the instantiated reduction has e... | [
{
"name": "IND_CPA_OneTime_DDHReduction_costed_pathwiseCostEqOnSupport",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 19,
"n_chars": 1046,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"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 Examples.ElGamal.Basic
import VCVio.CryptoFoundations.Asymptotics.ReductionCost
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.OracleComp.QueryTracking.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 Examples.ElGamal.Basic
import VCVio.CryptoFoundations.Asymptotics.ReductionCost
import VCVio.OracleComp.QueryTracking.QueryCost
import VCVio.OracleComp.QueryTracking.Re... | @@ -441,6 +441,26 @@
(oneTimeINDCPAImpl (gen := gen) adv)
= IND_CPA_OneTime_DDHReduction (F := F) (G := G) (gen := gen) adv g A B T := rfl
+/-- Cost-transform theorem for the closed one-time ElGamal DDH reduction.
+
+If `profile` assigns resource profiles to the two adversary capabilities `chooseMessage... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_f1f41f172197_0 | 41e6dbb2519ffff7 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/Ring/VectorBackend.lean | VectorBackend | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "vectorRing_mul_add_right",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply PolyBackend.ext_coeff; intro k\n -- Split the outer ring addition first, before vectorNegacyclicRing_backen... | [
{
"name": "vectorBackend_add_coeff",
"text": "/-- Coefficient of a sum through the concrete vector backend (`Vector.instAdd`).\nPaired with `vectorNegacyclicRing_backend` so that both variants of `+` on\n`Poly Coeff n` are handled after the backend is normalised. -/\n@[simp] theorem vectorBackend_add_coeff ... | [
{
"name": "vectorRing_mul_add_right",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 11,
"n_chars": 539,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 3,
"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 Init.Data.Vector.Algebra
import LatticeCrypto.Ring.Kernel
/-!
# Vector Backend For Negacyclic Rings
Canonical instantiation of the generic ring layer using `Vector Coe... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Init.Data.Vector.Algebra
import LatticeCrypto.Ring.Kernel
/-!
# Vector Backend For Negacyclic Rings
Canonical instantiation of the generic ring layer using `Vector Coe... | @@ -171,6 +171,15 @@
@[simp] theorem vectorNegacyclicRing_backend :
(vectorNegacyclicRing Coeff n).backend = vectorBackend Coeff n := rfl
+/-- Coefficient of a sum through the concrete vector backend (`Vector.instAdd`).
+Paired with `vectorNegacyclicRing_backend` so that both variants of `+` on
+`Poly Coeff n` ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_578dab8abb18_0 | 30bf93ea645f213d | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/NotationCore.lean | NotationCore | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "probEvent_eq_wp_propInd",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n simpa only [propInd_eq_ite] using probEvent_eq_wp_indicator oa p",
"n_chars": 82,
"n_subproofs... | [
{
"name": "propInd_eq_ite",
"text": "lemma propInd_eq_ite {P : Prop} [Decidable P] : propInd P = if P then 1 else 0 := by simp [propInd]\n\n",
"fan_in": 1,
"n_lines": 3,
"n_chars": 101,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
... | [
{
"name": "probEvent_eq_wp_propInd",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 340,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.EvalDist.TVDist
import VCVio.ProgramLogic.Relational.Basic
import VCVio.ProgramLogic.Relational.QuantitativeDefs
impor... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.EvalDist.TVDist
import VCVio.ProgramLogic.Relational.Basic
import VCVio.ProgramLogic.Relational.QuantitativeDefs
impor... | @@ -81,6 +81,8 @@
@[simp] lemma propInd_true : propInd True = 1 := if_pos trivial
@[simp] lemma propInd_false : propInd False = 0 := if_neg id
+lemma propInd_eq_ite {P : Prop} [Decidable P] : propInd P = if P then 1 else 0 := by simp [propInd]
+
open scoped Classical in
@[simp] lemma propInd_and {P Q : Prop} : pr... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_578dab8abb18_1 | 2aa57c139ede5844 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/NotationCore.lean | NotationCore | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "triple_propInd_iff_probEvent_eq_one",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [triple_iff_le_wp, propInd_true, ← probEvent_eq_wp_propInd]\n exact one_le_probEvent_iff",
"n_c... | [
{
"name": "probEvent_eq_wp_propInd",
"text": "/-- `probEvent` equals WP of propInd postcondition. -/\nlemma probEvent_eq_wp_propInd {ι : Type u} {spec : OracleSpec ι} [IsUniformSpec spec] {α : Type}\n (oa : OracleComp spec α) (p : α → Prop) :\n Pr[ p | oa] = wp oa (fun x => 𝟙⟦p x⟧) := by\n classical... | [
{
"name": "triple_propInd_iff_probEvent_eq_one",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 11,
"n_chars": 469,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": fa... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.EvalDist.TVDist
import VCVio.ProgramLogic.Relational.Basic
import VCVio.ProgramLogic.Relational.QuantitativeDefs
impor... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.EvalDist.TVDist
import VCVio.ProgramLogic.Relational.Basic
import VCVio.ProgramLogic.Relational.QuantitativeDefs
impor... | @@ -157,13 +157,22 @@
/-! ## Bridge lemmas: numeric indicators and existing API -/
+/-- `probEvent` equals WP of propInd postcondition. -/
+lemma probEvent_eq_wp_propInd {ι : Type u} {spec : OracleSpec ι} [IsUniformSpec spec] {α : Type}
+ (oa : OracleComp spec α) (p : α → Prop) :
+ Pr[ p | oa] = wp oa (fun x... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_578dab8abb18_2 | d70aa374d21172ff | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/NotationCore.lean | NotationCore | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "triple_propInd_iff_probEvent_eq_one",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [triple_iff_le_wp, propInd_true, ← probEvent_eq_wp_propInd]\n exact one_le_probEvent_iff",
"n_c... | [
{
"name": "probEvent_eq_wp_propInd",
"text": "/-- `probEvent` equals WP of propInd postcondition. -/\nlemma probEvent_eq_wp_propInd {ι : Type u} {spec : OracleSpec ι} [IsUniformSpec spec] {α : Type}\n (oa : OracleComp spec α) (p : α → Prop) :\n Pr[ p | oa] = wp oa (fun x => 𝟙⟦p x⟧) := by\n classical... | [
{
"name": "triple_propInd_iff_le_probEvent",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 440,
"n_subproofs": 0,
"n_tactics": 2,
"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 VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.EvalDist.TVDist
import VCVio.ProgramLogic.Relational.Basic
import VCVio.ProgramLogic.Relational.QuantitativeDefs
impor... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.EvalDist.TVDist
import VCVio.ProgramLogic.Relational.Basic
import VCVio.ProgramLogic.Relational.QuantitativeDefs
impor... | @@ -157,11 +157,19 @@
/-! ## Bridge lemmas: numeric indicators and existing API -/
+/-- `probEvent` equals WP of propInd postcondition. -/
+lemma probEvent_eq_wp_propInd {ι : Type u} {spec : OracleSpec ι} [IsUniformSpec spec] {α : Type}
+ (oa : OracleComp spec α) (p : α → Prop) :
+ Pr[ p | oa] = wp oa (fun x... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_578dab8abb18_3 | d1aac240e6731af3 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/NotationCore.lean | NotationCore | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "triple_propInd_iff_probEvent_eq_one",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [triple_iff_le_wp, propInd_true, ← probEvent_eq_wp_propInd]\n exact one_le_probEvent_iff",
"n_c... | [
{
"name": "probEvent_eq_wp_propInd",
"text": "/-- `probEvent` equals WP of propInd postcondition. -/\nlemma probEvent_eq_wp_propInd {ι : Type u} {spec : OracleSpec ι} [IsUniformSpec spec] {α : Type}\n (oa : OracleComp spec α) (p : α → Prop) :\n Pr[ p | oa] = wp oa (fun x => 𝟙⟦p x⟧) := by\n classical... | [
{
"name": "wp_propInd_or_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 494,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.EvalDist.TVDist
import VCVio.ProgramLogic.Relational.Basic
import VCVio.ProgramLogic.Relational.QuantitativeDefs
impor... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.EvalDist.TVDist
import VCVio.ProgramLogic.Relational.Basic
import VCVio.ProgramLogic.Relational.QuantitativeDefs
impor... | @@ -157,12 +157,21 @@
/-! ## Bridge lemmas: numeric indicators and existing API -/
+/-- `probEvent` equals WP of propInd postcondition. -/
+lemma probEvent_eq_wp_propInd {ι : Type u} {spec : OracleSpec ι} [IsUniformSpec spec] {α : Type}
+ (oa : OracleComp spec α) (p : α → Prop) :
+ Pr[ p | oa] = wp oa (fun x... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_578dab8abb18_4 | fe61af6dcf120902 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/NotationCore.lean | NotationCore | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "triple_propInd_iff_probEvent_eq_one",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [triple_iff_le_wp, propInd_true, ← probEvent_eq_wp_propInd]\n exact one_le_probEvent_iff",
"n_c... | [
{
"name": "probEvent_eq_wp_propInd",
"text": "/-- `probEvent` equals WP of propInd postcondition. -/\nlemma probEvent_eq_wp_propInd {ι : Type u} {spec : OracleSpec ι} [IsUniformSpec spec] {α : Type}\n (oa : OracleComp spec α) (p : α → Prop) :\n Pr[ p | oa] = wp oa (fun x => 𝟙⟦p x⟧) := by\n classical... | [
{
"name": "markov_bound",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 505,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.EvalDist.TVDist
import VCVio.ProgramLogic.Relational.Basic
import VCVio.ProgramLogic.Relational.QuantitativeDefs
impor... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.EvalDist.TVDist
import VCVio.ProgramLogic.Relational.Basic
import VCVio.ProgramLogic.Relational.QuantitativeDefs
impor... | @@ -157,11 +157,24 @@
/-! ## Bridge lemmas: numeric indicators and existing API -/
+/-- `probEvent` equals WP of propInd postcondition. -/
+lemma probEvent_eq_wp_propInd {ι : Type u} {spec : OracleSpec ι} [IsUniformSpec spec] {α : Type}
+ (oa : OracleComp spec α) (p : α → Prop) :
+ Pr[ p | oa] = wp oa (fun x... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_578dab8abb18_5 | 6125d02c85583046 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/NotationCore.lean | NotationCore | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "triple_propInd_iff_probEvent_eq_one",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [triple_iff_le_wp, propInd_true, ← probEvent_eq_wp_propInd]\n exact one_le_probEvent_iff",
"n_c... | [
{
"name": "probEvent_eq_wp_propInd",
"text": "/-- `probEvent` equals WP of propInd postcondition. -/\nlemma probEvent_eq_wp_propInd {ι : Type u} {spec : OracleSpec ι} [IsUniformSpec spec] {α : Type}\n (oa : OracleComp spec α) (p : α → Prop) :\n Pr[ p | oa] = wp oa (fun x => 𝟙⟦p x⟧) := by\n classical... | [
{
"name": "triple_propInd_of_support",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 11,
"n_chars": 587,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"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.Unary.HoareTriple
import VCVio.EvalDist.TVDist
import VCVio.ProgramLogic.Relational.Basic
import VCVio.ProgramLogic.Relational.QuantitativeDefs
impor... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.EvalDist.TVDist
import VCVio.ProgramLogic.Relational.Basic
import VCVio.ProgramLogic.Relational.QuantitativeDefs
impor... | @@ -157,13 +157,22 @@
/-! ## Bridge lemmas: numeric indicators and existing API -/
+/-- `probEvent` equals WP of propInd postcondition. -/
+lemma probEvent_eq_wp_propInd {ι : Type u} {spec : OracleSpec ι} [IsUniformSpec spec] {α : Type}
+ (oa : OracleComp spec α) (p : α → Prop) :
+ Pr[ p | oa] = wp oa (fun x... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_578dab8abb18_6 | 29240a2bd5021ee5 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/NotationCore.lean | NotationCore | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "GameEquiv.map_uniformSample_bij",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n conv_rhs => rw [← id_map ($ᵗ α : ProbComp α)]\n exact GameEquiv.of_relTriple\n (Relational.relTriple_ma... | [
{
"name": "GameEquiv.of_relTriple",
"text": "/-- Game equivalence from basic pRHL equality coupling. -/\ntheorem GameEquiv.of_relTriple {g₁ g₂ : OracleComp spec₁ α}\n (h : Relational.RelTriple (spec₁ := spec₁) (spec₂ := spec₁) g₁ g₂\n (Relational.EqRel α)) :\n GameEquiv g₁ g₂ :=\n Relational.eva... | [
{
"name": "GameEquiv.map_uniformSample_bij",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 496,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"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 VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.EvalDist.TVDist
import VCVio.ProgramLogic.Relational.Basic
import VCVio.ProgramLogic.Relational.QuantitativeDefs
impor... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.EvalDist.TVDist
import VCVio.ProgramLogic.Relational.Basic
import VCVio.ProgramLogic.Relational.QuantitativeDefs
impor... | @@ -155,11 +155,22 @@
/-! ## Bridge lemmas: numeric indicators and existing API -/
+/-- Game equivalence from basic pRHL equality coupling. -/
+theorem GameEquiv.of_relTriple {g₁ g₂ : OracleComp spec₁ α}
+ (h : Relational.RelTriple (spec₁ := spec₁) (spec₂ := spec₁) g₁ g₂
+ (Relational.EqRel α)) :
+ Game... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_2c09cfeeb060_0 | b80a22f325177a92 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/Security.lean | Security | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "euf_cma_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n haveI : DecidableEq M := Classical.decEq M\n haveI : DecidableEq Commit := Classical.decEq Commit\n obtain ⟨nmaAdv, hAdv⟩ :... | [
{
"name": "euf_nma_bound",
"text": "/-- **NMA-to-extraction via the forking lemma and special soundness.**\n\nFor any managed-RO NMA adversary `B` and any fork slot parameter `qH`, there\nexists a witness-extraction reduction such that:\n\n `Adv^{fork-NMA}_{qH}(B) · (Adv^{fork-NMA}_{qH}(B) / (qH + 1) - 1/|... | [
{
"name": "euf_cma_bound",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 51,
"n_chars": 2420,
"n_subproofs": 2,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 4,
"automation_only": false,
"max_nesting... | 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.CryptoFoundations.FiatShamir.Sigma.Reductions
/-!
# EUF-CMA security of the Fiat-Shamir Σ-protocol transform
End-to-end security reduction, package... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma.Reductions
/-!
# EUF-CMA security of the Fiat-Shamir Σ-protocol transform
End-to-end security reduction, package... | @@ -82,6 +82,36 @@
omit [Finite Stmt] [Finite Commit] [Finite Resp] [Inhabited Stmt] [Inhabited Commit]
[Inhabited Resp] [Fintype Chal] [Inhabited Chal] in
omit [SampleableType Stmt] in
+/-- **NMA-to-extraction via the forking lemma and special soundness.**
+
+For any managed-RO NMA adversary `B` and any fork slot... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_25d73f03e8bd_0 | 62bfbf757a0025df | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/CommitmentScheme/Hiding/Main.lean | Main | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "hiding_bound_finite",
"depth": 1,
"n_commands": 0,
"n_lines": 46,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbind :\n tvDist (hidingMixedReal (M := M) (S := S) (C := C) A)\n (hidingMixedSim (M := M) (S := S)... | [
{
"name": "hiding_bound_avg",
"text": "/-- **Hiding bound (averaged technical form, Lemma cm-hiding).**\n\nFor every `t`-query two-phase hiding adversary `A`, the average statistical\ndistance between real and simulated hiding games, taken over uniformly\nrandom salt `s ← $ᵗ S`, is at most `t / |S|`:\n\n```... | [
{
"name": "hiding_bound_finite",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 66,
"n_chars": 3117,
"n_subproofs": 1,
"n_tactics": 46,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 5,
"n_structural": 4,
"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 Examples.CommitmentScheme.Hiding.LoggingBounds
/-!
# Hiding for the random-oracle commitment scheme — main theorems
The two packaged hiding bounds, both stating ... | /-
Copyright (c) 2026 James Waters. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: James Waters
-/
import Examples.CommitmentScheme.Hiding.LoggingBounds
/-!
# Hiding for the random-oracle commitment scheme — main theorems
The two packaged hiding bounds, both stating ... | @@ -45,6 +45,52 @@
rw [tvDist, tvDist, evalDist_liftComp, evalDist_liftComp]
omit [Fintype M] [DecidableEq C] in
+/-- **Hiding bound (averaged technical form, Lemma cm-hiding).**
+
+For every `t`-query two-phase hiding adversary `A`, the average statistical
+distance between real and simulated hiding games, taken... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_8e1dfce31e4f_0 | 2f1e1c7392d447aa | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/ProbabilityTheory/Coupling.lean | Coupling | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "IsCoupling.exists_bind",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n let d : (a₁ : α₁) → (a₂ : α₂) → SPMF (β₁ × β₂) :=\n fun a₁ a₂ => Classical.choose (h a₁ a₂)\n let hd : ∀ (a₁ : α₁) ... | [
{
"name": "IsCoupling.bind",
"text": "/-- Main theorem about coupling and bind operations -/\ntheorem IsCoupling.bind {α₁ α₂ β₁ β₂ : Type u}\n {p : SPMF α₁} {q : SPMF α₂} {f : α₁ → SPMF β₁} {g : α₂ → SPMF β₂}\n (c : Coupling p q) (d : (a₁ : α₁) → (a₂ : α₂) → SPMF (β₁ × β₂))\n (h : ∀ (a₁ : α₁) (a₂ :... | [
{
"name": "IsCoupling.exists_bind",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 804,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max... | 1 | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Devon Tuma
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import ToMathlib.Control.Monad.Transformer
public import Batteries.Control.Al... | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Devon Tuma
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import ToMathlib.Control.Monad.Transformer
public import Batteries.Control.Al... | @@ -52,12 +52,46 @@
example (f g : α → β) (h : f = g) : ∀ x, f x = g x := by exact fun x ↦ congrFun h x
+/-- Main theorem about coupling and bind operations -/
+theorem IsCoupling.bind {α₁ α₂ β₁ β₂ : Type u}
+ {p : SPMF α₁} {q : SPMF α₂} {f : α₁ → SPMF β₁} {g : α₂ → SPMF β₂}
+ (c : Coupling p q) (d : (a₁ : α... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_8e1dfce31e4f_1 | 091a25e831352b18 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/ProbabilityTheory/Coupling.lean | Coupling | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "IsCoupling.prod",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine ⟨?_, ?_⟩\n · calc\n Prod.fst <$> (p >>= fun a => q >>= fun b => pure (a, b))\n = p >>= fun a => Prod... | [
{
"name": "bind_const_of_toPMF_none_eq_zero",
"text": "/-- Binding against a constant `q` collapses to `q` when the scrutinee has no failure mass. -/\ntheorem bind_const_of_toPMF_none_eq_zero {p : SPMF α} (hp : p.toPMF none = 0) (q : SPMF β) :\n (p >>= fun _ => q) = q := by\n have h := SPMF.tsum_run_som... | [
{
"name": "IsCoupling.prod",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 35,
"n_chars": 1746,
"n_subproofs": 0,
"n_tactics": 40,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 15,
"n_structural": 12,
"automation_only": false,
"max_ne... | 1 | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Devon Tuma
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import ToMathlib.Control.Monad.Transformer
public import Batteries.Control.Al... | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Devon Tuma
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import ToMathlib.Control.Monad.Transformer
public import Batteries.Control.Al... | @@ -61,6 +61,22 @@
noncomputable def Coupling.refl (p : SPMF α) : Coupling p p :=
⟨p >>= fun a => pure (a, a), IsCoupling.refl p⟩
+/-- Binding against a constant `q` collapses to `q` when the scrutinee has no failure mass. -/
+theorem bind_const_of_toPMF_none_eq_zero {p : SPMF α} (hp : p.toPMF none = 0) (q : SPMF... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_8e1dfce31e4f_2 | 54d74d8779c7e6e7 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/ProbabilityTheory/Coupling.lean | Coupling | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "IsCoupling.prod",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine ⟨?_, ?_⟩\n · calc\n Prod.fst <$> (p >>= fun a => q >>= fun b => pure (a, b))\n = p >>= fun a => Prod... | [
{
"name": "bind_const_of_toPMF_none_eq_zero",
"text": "/-- Binding against a constant `q` collapses to `q` when the scrutinee has no failure mass. -/\ntheorem bind_const_of_toPMF_none_eq_zero {p : SPMF α} (hp : p.toPMF none = 0) (q : SPMF β) :\n (p >>= fun _ => q) = q := by\n have h := SPMF.tsum_run_som... | [
{
"name": "IsCoupling.dirac_left",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 21,
"n_chars": 808,
"n_subproofs": 3,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 7,
"n_structural": 5,
"automation_only": false,
"max... | 1 | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Devon Tuma
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import ToMathlib.Control.Monad.Transformer
public import Batteries.Control.Al... | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Devon Tuma
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import ToMathlib.Control.Monad.Transformer
public import Batteries.Control.Al... | @@ -61,6 +61,22 @@
noncomputable def Coupling.refl (p : SPMF α) : Coupling p p :=
⟨p >>= fun a => pure (a, a), IsCoupling.refl p⟩
+/-- Binding against a constant `q` collapses to `q` when the scrutinee has no failure mass. -/
+theorem bind_const_of_toPMF_none_eq_zero {p : SPMF α} (hp : p.toPMF none = 0) (q : SPMF... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_8e1dfce31e4f_3 | f23643afb0460b77 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/ProbabilityTheory/Coupling.lean | Coupling | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "IsCoupling.prod",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine ⟨?_, ?_⟩\n · calc\n Prod.fst <$> (p >>= fun a => q >>= fun b => pure (a, b))\n = p >>= fun a => Prod... | [
{
"name": "bind_const_of_toPMF_none_eq_zero",
"text": "/-- Binding against a constant `q` collapses to `q` when the scrutinee has no failure mass. -/\ntheorem bind_const_of_toPMF_none_eq_zero {p : SPMF α} (hp : p.toPMF none = 0) (q : SPMF β) :\n (p >>= fun _ => q) = q := by\n have h := SPMF.tsum_run_som... | [
{
"name": "IsCoupling.dirac_right",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 21,
"n_chars": 810,
"n_subproofs": 3,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 7,
"n_structural": 5,
"automation_only": false,
"ma... | 1 | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Devon Tuma
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import ToMathlib.Control.Monad.Transformer
public import Batteries.Control.Al... | /-
Copyright (c) 2025 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Devon Tuma
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Constructions
public import ToMathlib.Control.Monad.Transformer
public import Batteries.Control.Al... | @@ -61,6 +61,22 @@
noncomputable def Coupling.refl (p : SPMF α) : Coupling p p :=
⟨p >>= fun a => pure (a, a), IsCoupling.refl p⟩
+/-- Binding against a constant `q` collapses to `q` when the scrutinee has no failure mass. -/
+theorem bind_const_of_toPMF_none_eq_zero {p : SPMF α} (hp : p.toPMF none = 0) (q : SPMF... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3e6e28896fe6_0 | b2de2fa36f70e774 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FujisakiOkamoto/TTransform.lean | TTransform | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "encrypt_expectedQueryCost_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n HasQuery.expectedQueryCost_eq_of_usesCostExactly\n (encrypt_usesExactQueryCost runtime pke pk msg costFn) hval... | [
{
"name": "encrypt_usesExactQueryCost",
"text": "/-- T-transform encryption incurs exactly the weighted cost assigned to the single coins-oracle\nquery on `msg`. -/\ntheorem encrypt_usesExactQueryCost {ω : Type} [AddMonoid ω]\n (runtime : QueryImpl (M →ₒ R) m)\n (pke : AsymmEncAlg.ExplicitCoins ProbCo... | [
{
"name": "encrypt_expectedQueryCost_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 726,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.AsymmEncAlg.INDCPA.Oracle
import VCVio.CryptoFoundations.FujisakiOkamoto.Defs
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQu... | /-
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.AsymmEncAlg.INDCPA.Oracle
import VCVio.CryptoFoundations.FujisakiOkamoto.Defs
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQu... | @@ -91,6 +91,15 @@
variable {m : Type → Type u} [Monad m] [LawfulMonad m]
[MonadLiftT ProbComp m]
+/-- T-transform encryption incurs exactly the weighted cost assigned to the single coins-oracle
+query on `msg`. -/
+theorem encrypt_usesExactQueryCost {ω : Type} [AddMonoid ω]
+ (runtime : QueryImpl (M →ₒ R) 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_3e6e28896fe6_1 | ee7df6debb75a47c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FujisakiOkamoto/TTransform.lean | TTransform | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "encrypt_expectedQueryCost_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n HasQuery.expectedQueryCost_eq_of_usesCostExactly\n (encrypt_usesExactQueryCost runtime pke pk msg costFn) hval... | [
{
"name": "encrypt_usesExactQueryCost",
"text": "/-- T-transform encryption incurs exactly the weighted cost assigned to the single coins-oracle\nquery on `msg`. -/\ntheorem encrypt_usesExactQueryCost {ω : Type} [AddMonoid ω]\n (runtime : QueryImpl (M →ₒ R) m)\n (pke : AsymmEncAlg.ExplicitCoins ProbCo... | [
{
"name": "encrypt_usesExactlyOneQuery",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 447,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.AsymmEncAlg.INDCPA.Oracle
import VCVio.CryptoFoundations.FujisakiOkamoto.Defs
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQu... | /-
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.AsymmEncAlg.INDCPA.Oracle
import VCVio.CryptoFoundations.FujisakiOkamoto.Defs
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQu... | @@ -91,12 +91,23 @@
variable {m : Type → Type u} [Monad m] [LawfulMonad m]
[MonadLiftT ProbComp m]
+/-- T-transform encryption incurs exactly the weighted cost assigned to the single coins-oracle
+query on `msg`. -/
+theorem encrypt_usesExactQueryCost {ω : Type} [AddMonoid ω]
+ (runtime : QueryImpl (M →ₒ R) 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_3e6e28896fe6_2 | b7bb8c4839449a04 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FujisakiOkamoto/TTransform.lean | TTransform | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "decrypt_expectedQueryCost_eq_zero_of_decrypt_eq_none",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n HasQuery.expectedQueryCost_eq_of_usesCostExactly\n (decrypt_usesZeroQueryCost_of_decry... | [
{
"name": "decrypt_usesZeroQueryCost_of_decrypt_eq_none",
"text": "/-- If deterministic decryption fails immediately, the T-transform incurs zero weighted\nquery cost. -/\ntheorem decrypt_usesZeroQueryCost_of_decrypt_eq_none {ω : Type} [AddMonoid ω]\n (runtime : QueryImpl (M →ₒ R) m)\n (pke : AsymmEnc... | [
{
"name": "decrypt_expectedQueryCost_eq_zero_of_decrypt_eq_none",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 822,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"aut... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.AsymmEncAlg.INDCPA.Oracle
import VCVio.CryptoFoundations.FujisakiOkamoto.Defs
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQu... | /-
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.AsymmEncAlg.INDCPA.Oracle
import VCVio.CryptoFoundations.FujisakiOkamoto.Defs
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQu... | @@ -91,6 +91,17 @@
variable {m : Type → Type u} [Monad m] [LawfulMonad m]
[MonadLiftT ProbComp m]
+/-- If deterministic decryption fails immediately, the T-transform incurs zero weighted
+query cost. -/
+theorem decrypt_usesZeroQueryCost_of_decrypt_eq_none {ω : Type} [AddMonoid ω]
+ (runtime : QueryImpl (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_3e6e28896fe6_3 | dc81c80d1f5ac002 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FujisakiOkamoto/TTransform.lean | TTransform | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "decrypt_expectedQueryCost_eq_of_decrypt_eq_some",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n HasQuery.expectedQueryCost_eq_of_usesCostExactly\n (decrypt_usesExactQueryCost_of_decrypt_e... | [
{
"name": "decrypt_usesExactQueryCost_of_decrypt_eq_some",
"text": "/-- If deterministic decryption returns a message, the T-transform incurs exactly the weighted\ncost of querying that message to re-derive the coins. -/\ntheorem decrypt_usesExactQueryCost_of_decrypt_eq_some {ω : Type} [AddMonoid ω]\n (r... | [
{
"name": "decrypt_expectedQueryCost_eq_of_decrypt_eq_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 884,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automati... | 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.AsymmEncAlg.INDCPA.Oracle
import VCVio.CryptoFoundations.FujisakiOkamoto.Defs
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQu... | /-
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.AsymmEncAlg.INDCPA.Oracle
import VCVio.CryptoFoundations.FujisakiOkamoto.Defs
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQu... | @@ -91,6 +91,17 @@
variable {m : Type → Type u} [Monad m] [LawfulMonad m]
[MonadLiftT ProbComp m]
+/-- If deterministic decryption returns a message, the T-transform incurs exactly the weighted
+cost of querying that message to re-derive the coins. -/
+theorem decrypt_usesExactQueryCost_of_decrypt_eq_some {ω : Ty... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3e6e28896fe6_4 | 2ed14cc34bc1a1f9 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FujisakiOkamoto/TTransform.lean | TTransform | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "decrypt_expectedQueryCost_eq_zero_of_decrypt_eq_none",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n HasQuery.expectedQueryCost_eq_of_usesCostExactly\n (decrypt_usesZeroQueryCost_of_decry... | [
{
"name": "decrypt_usesZeroQueryCost_of_decrypt_eq_none",
"text": "/-- If deterministic decryption fails immediately, the T-transform incurs zero weighted\nquery cost. -/\ntheorem decrypt_usesZeroQueryCost_of_decrypt_eq_none {ω : Type} [AddMonoid ω]\n (runtime : QueryImpl (M →ₒ R) m)\n (pke : AsymmEnc... | [
{
"name": "decrypt_usesNoQueries_of_decrypt_eq_none",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 536,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.AsymmEncAlg.INDCPA.Oracle
import VCVio.CryptoFoundations.FujisakiOkamoto.Defs
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQu... | /-
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.AsymmEncAlg.INDCPA.Oracle
import VCVio.CryptoFoundations.FujisakiOkamoto.Defs
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQu... | @@ -91,6 +91,17 @@
variable {m : Type → Type u} [Monad m] [LawfulMonad m]
[MonadLiftT ProbComp m]
+/-- If deterministic decryption fails immediately, the T-transform incurs zero weighted
+query cost. -/
+theorem decrypt_usesZeroQueryCost_of_decrypt_eq_none {ω : Type} [AddMonoid ω]
+ (runtime : QueryImpl (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_3e6e28896fe6_5 | 41df5581ea923ba0 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FujisakiOkamoto/TTransform.lean | TTransform | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "decrypt_expectedQueryCost_eq_of_decrypt_eq_some",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n HasQuery.expectedQueryCost_eq_of_usesCostExactly\n (decrypt_usesExactQueryCost_of_decrypt_e... | [
{
"name": "decrypt_usesExactQueryCost_of_decrypt_eq_some",
"text": "/-- If deterministic decryption returns a message, the T-transform incurs exactly the weighted\ncost of querying that message to re-derive the coins. -/\ntheorem decrypt_usesExactQueryCost_of_decrypt_eq_some {ω : Type} [AddMonoid ω]\n (r... | [
{
"name": "decrypt_usesExactlyOneQuery_of_decrypt_eq_some",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 587,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automatio... | 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.AsymmEncAlg.INDCPA.Oracle
import VCVio.CryptoFoundations.FujisakiOkamoto.Defs
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQu... | /-
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.AsymmEncAlg.INDCPA.Oracle
import VCVio.CryptoFoundations.FujisakiOkamoto.Defs
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQu... | @@ -91,6 +91,17 @@
variable {m : Type → Type u} [Monad m] [LawfulMonad m]
[MonadLiftT ProbComp m]
+/-- If deterministic decryption returns a message, the T-transform incurs exactly the weighted
+cost of querying that message to re-derive the coins. -/
+theorem decrypt_usesExactQueryCost_of_decrypt_eq_some {ω : Ty... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3e6e28896fe6_6 | ae418a4cb38f5d7a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FujisakiOkamoto/TTransform.lean | TTransform | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "decrypt_usesAtMostOneQuery",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases hdec : pke.decrypt sk c with\n | none =>\n exact HasQuery.usesAtMostQueries_of_usesExactlyQueries\n ... | [
{
"name": "decrypt_usesExactlyOneQuery_of_decrypt_eq_some",
"text": "/-- If deterministic decryption returns a message, the T-transform makes exactly one\nhash-oracle query to re-derive the coins. -/\ntheorem decrypt_usesExactlyOneQuery_of_decrypt_eq_some\n (runtime : QueryImpl (M →ₒ R) m)\n (pke : As... | [
{
"name": "decrypt_usesAtMostOneQuery",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 15,
"n_chars": 757,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
... | 4 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.AsymmEncAlg.INDCPA.Oracle
import VCVio.CryptoFoundations.FujisakiOkamoto.Defs
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQu... | /-
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.AsymmEncAlg.INDCPA.Oracle
import VCVio.CryptoFoundations.FujisakiOkamoto.Defs
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQu... | @@ -124,6 +124,17 @@
simpa [HasQuery.UsesExactlyQueries] using
decrypt_usesZeroQueryCost_of_decrypt_eq_none (ω := ℕ) runtime pke pk sk c (fun _ => 1) hdec
+/-- If deterministic decryption returns a message, the T-transform makes exactly one
+hash-oracle query to re-derive the coins. -/
+theorem decrypt_usesEx... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7bc8cb8e8a3_0 | 510f8d3943b063c6 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/StateSeparating/IndistAt.lean | IndistAt | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "mono",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " fun A => (h A).trans h_le",
"n_chars": 26,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_... | [
{
"name": "trans",
"text": "protected theorem trans\n {h₀ : QueryImpl.Stateful unifSpec E σ₀} {s₀ : σ₀}\n {h₁ : QueryImpl.Stateful unifSpec E σ₁} {s₁ : σ₁}\n {h₂ : QueryImpl.Stateful unifSpec E σ₂} {s₂ : σ₂} {ε₀ ε₁ : ℝ}\n (h₀₁ : (h₀, s₀) ≈ᵈ[ε₀] (h₁, s₁)) (h₁₂ : (h₁, s₁) ≈ᵈ[ε₁] (h₂, s₂)) :\n (... | [
{
"name": "mono",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 297,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": 1
}
] | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.StateSeparating.Hybrid
/-!
# State-separating handlers: ε-indistinguishability
`QueryImpl.Stateful.IndistAt h₀ s₀ h₁ s₁ ε` bounds the Boolean
distinguishing adva... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.StateSeparating.Hybrid
/-!
# State-separating handlers: ε-indistinguishability
`QueryImpl.Stateful.IndistAt h₀ s₀ h₁ s₁ ε` bounds the Boolean
distinguishing adva... | @@ -36,11 +36,21 @@
variable {σ σ₀ σ₁ σ₂ : Type}
+protected theorem trans
+ {h₀ : QueryImpl.Stateful unifSpec E σ₀} {s₀ : σ₀}
+ {h₁ : QueryImpl.Stateful unifSpec E σ₁} {s₁ : σ₁}
+ {h₂ : QueryImpl.Stateful unifSpec E σ₂} {s₂ : σ₂} {ε₀ ε₁ : ℝ}
+ (h₀₁ : (h₀, s₀) ≈ᵈ[ε₀] (h₁, s₁)) (h₁₂ : (h₁, s₁) ≈ᵈ[ε₁] (h₂... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7bc8cb8e8a3_1 | 122aa2717308e720 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/StateSeparating/IndistAt.lean | IndistAt | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "refl_le",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " mono hε (IndistAt.refl h s)",
"n_chars": 29,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
... | [
{
"name": "mono",
"text": "theorem mono\n {h₀ : QueryImpl.Stateful unifSpec E σ₀} {s₀ : σ₀}\n {h₁ : QueryImpl.Stateful unifSpec E σ₁} {s₁ : σ₁} {ε ε' : ℝ}\n (h_le : ε ≤ ε') (h : (h₀, s₀) ≈ᵈ[ε] (h₁, s₁)) :\n (h₀, s₀) ≈ᵈ[ε'] (h₁, s₁) := fun A => (h A).trans h_le\n\n",
"fan_in": 1,
"n_lines... | [
{
"name": "refl_le",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 6,
"n_chars": 191,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": 1
}... | 3 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.StateSeparating.Hybrid
/-!
# State-separating handlers: ε-indistinguishability
`QueryImpl.Stateful.IndistAt h₀ s₀ h₁ s₁ ε` bounds the Boolean
distinguishing adva... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.StateSeparating.Hybrid
/-!
# State-separating handlers: ε-indistinguishability
`QueryImpl.Stateful.IndistAt h₀ s₀ h₁ s₁ ε` bounds the Boolean
distinguishing adva... | @@ -49,8 +49,14 @@
/-! ## ε-monotonicity -/
+theorem mono
+ {h₀ : QueryImpl.Stateful unifSpec E σ₀} {s₀ : σ₀}
+ {h₁ : QueryImpl.Stateful unifSpec E σ₁} {s₁ : σ₁} {ε ε' : ℝ}
+ (h_le : ε ≤ ε') (h : (h₀, s₀) ≈ᵈ[ε] (h₁, s₁)) :
+ (h₀, s₀) ≈ᵈ[ε'] (h₁, s₁) := fun A => (h A).trans h_le
+
theorem refl_le {ε : ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7bc8cb8e8a3_2 | 5e87978cbb6038a9 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/StateSeparating/IndistAt.lean | IndistAt | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "mono",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " fun A => (h A).trans h_le",
"n_chars": 26,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_... | [
{
"name": "trans",
"text": "protected theorem trans\n {h₀ : QueryImpl.Stateful unifSpec E σ₀} {s₀ : σ₀}\n {h₁ : QueryImpl.Stateful unifSpec E σ₁} {s₁ : σ₁}\n {h₂ : QueryImpl.Stateful unifSpec E σ₂} {s₂ : σ₂} {ε₀ ε₁ : ℝ}\n (h₀₁ : (h₀, s₀) ≈ᵈ[ε₀] (h₁, s₁)) (h₁₂ : (h₁, s₁) ≈ᵈ[ε₁] (h₂, s₂)) :\n (... | [
{
"name": "hybrid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 393,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
}
... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.StateSeparating.Hybrid
/-!
# State-separating handlers: ε-indistinguishability
`QueryImpl.Stateful.IndistAt h₀ s₀ h₁ s₁ ε` bounds the Boolean
distinguishing adva... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.StateSeparating.Hybrid
/-!
# State-separating handlers: ε-indistinguishability
`QueryImpl.Stateful.IndistAt h₀ s₀ h₁ s₁ ε` bounds the Boolean
distinguishing adva... | @@ -36,10 +36,21 @@
variable {σ σ₀ σ₁ σ₂ : Type}
+protected theorem trans
+ {h₀ : QueryImpl.Stateful unifSpec E σ₀} {s₀ : σ₀}
+ {h₁ : QueryImpl.Stateful unifSpec E σ₁} {s₁ : σ₁}
+ {h₂ : QueryImpl.Stateful unifSpec E σ₂} {s₂ : σ₂} {ε₀ ε₁ : ℝ}
+ (h₀₁ : (h₀, s₀) ≈ᵈ[ε₀] (h₁, s₁)) (h₁₂ : (h₁, s₁) ≈ᵈ[ε₁] (h₂... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_1c512df3762b_0 | a0f5c6dcc928dad1 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/EvalDist/Monad/Map.lean | Map | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "probOutput_map_eq_of_evalDist_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n evalDist_ext_iff.mp (evalDist_map_eq_of_evalDist_eq h f) y",
"n_chars": 61,
"n_subproofs": 0,
"n_... | [
{
"name": "evalDist_map_eq_of_evalDist_eq",
"text": "lemma evalDist_map_eq_of_evalDist_eq [MonadLiftT m SPMF] [LawfulMonadLiftT m SPMF] [LawfulMonad m]\n {mx my : m α} (h : 𝒟[mx] = 𝒟[my]) (f : α → β) :\n 𝒟[f <$> mx] = 𝒟[f <$> my] := by\n simpa [evalDist_map] using congrArg (fun p => f <$> p) h\n\... | [
{
"name": "probOutput_map_eq_of_evalDist_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 6,
"n_chars": 282,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,... | 1 | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import VCVio.EvalDist.Monad.Basic
/-!
# Evaluation Distributions of Computations with `map`
File for lemmas about `evalDist` and `support` involving the monadic `map`.
Not... | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import VCVio.EvalDist.Monad.Basic
/-!
# Evaluation Distributions of Computations with `map`
File for lemmas about `evalDist` and `support` involving the monadic `map`.
Not... | @@ -41,9 +41,15 @@
(mx : m α) (f : α → β) :
𝒟[f <$> mx] = f <$> (𝒟[mx]) := by simp [monad_norm]
+lemma evalDist_map_eq_of_evalDist_eq [MonadLiftT m SPMF] [LawfulMonadLiftT m SPMF] [LawfulMonad m]
+ {mx my : m α} (h : 𝒟[mx] = 𝒟[my]) (f : α → β) :
+ 𝒟[f <$> mx] = 𝒟[f <$> my] := by
+ simpa [evalDi... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_1c512df3762b_1 | 00ec6a379dfa058e | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/EvalDist/Monad/Map.lean | Map | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "probOutput_map_eq_single",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [probOutput_map_eq_tsum]\n refine (tsum_eq_single x fun x' hx' => ?_).trans (by rw [h', probOutput_pure_self, ... | [
{
"name": "probOutput_map_eq_tsum",
"text": "lemma probOutput_map_eq_tsum (y : β) :\n Pr[= y | f <$> mx] = ∑' x, Pr[= x | mx] * Pr[= y | (pure (f x) : m β)] := by\n simp [monad_norm, probOutput_bind_eq_tsum]\n\n",
"fan_in": 2,
"n_lines": 5,
"n_chars": 170,
"n_subproofs": 0,
"n_tactic... | [
{
"name": "probOutput_map_eq_single",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 558,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"m... | 1 | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import VCVio.EvalDist.Monad.Basic
/-!
# Evaluation Distributions of Computations with `map`
File for lemmas about `evalDist` and `support` involving the monadic `map`.
Not... | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import VCVio.EvalDist.Monad.Basic
/-!
# Evaluation Distributions of Computations with `map`
File for lemmas about `evalDist` and `support` involving the monadic `map`.
Not... | @@ -57,6 +57,10 @@
variable [LawfulMonad m]
+lemma probOutput_map_eq_tsum (y : β) :
+ Pr[= y | f <$> mx] = ∑' x, Pr[= x | mx] * Pr[= y | (pure (f x) : m β)] := by
+ simp [monad_norm, probOutput_bind_eq_tsum]
+
@[grind =]
lemma probOutput_map_eq_tsum_ite [DecidableEq β] (y : β) :
Pr[= y | f <$> mx] = ∑' ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_eef98d7e5053_0 | 2aaa7c1c2c87b498 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/Fors.lean | Fors | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "forsPkFromSig_forsSign",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold forsPkFromSig forsPkGen\n refine congrArg (prims.Tl pk (forsPkAdrs adrs)) (List.map_congr_left fun i _ => ?... | [
{
"name": "forsIdx_lt",
"text": "theorem forsIdx_lt (p : Params) (md : List Byte) (i : ℕ) : forsIdx p md i < 2 ^ p.a := by\n unfold forsIdx\n rw [List.getD_eq_getElem?_getD]\n rcases lt_or_ge i (base2b md p.a p.k).length with h | h\n · rw [List.getElem?_eq_getElem h]\n simpa using base2b_lt md p.a p.... | [
{
"name": "forsPkFromSig_forsSign",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 1028,
"n_subproofs": 2,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
"m... | 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.Xmss
/-!
# FORS (FIPS 205 §8)
The few-time forest signature: `k` Merkle trees of height `a`, with leaves `F(secret)` and the
`k` roots com... | /-
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.Xmss
/-!
# FORS (FIPS 205 §8)
The few-time forest signature: `k` Merkle trees of height `a`, with leaves `F(secret)` and the
`k` roots com... | @@ -31,6 +31,18 @@
/-- The selected leaf index in FORS tree `i`: the `i`-th base-`2^a` digit of the digest. -/
def forsIdx (p : Params) (md : List Byte) (i : ℕ) : ℕ := (base2b md p.a p.k).getD i 0
+theorem forsIdx_lt (p : Params) (md : List Byte) (i : ℕ) : forsIdx p md i < 2 ^ p.a := by
+ unfold forsIdx
+ rw [Lis... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_810f9b07f66c_0 | 8b491e1f07beefaf | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/Traversal.lean | Traversal | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "allOutputsSatisfyWhen_bind_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [allOutputsSatisfyWhen, allPathsSatisfy_bind_iff]",
"n_chars": 65,
"n_subproofs": 0,
"... | [
{
"name": "allPathsSatisfy_bind_iff",
"text": "/-- A bind satisfies a universal path property exactly when every path of the first computation\nleads to a continuation that also satisfies that path property. -/\n@[simp]\nlemma allPathsSatisfy_bind_iff\n (queryPred : spec.Domain → Prop) (outputPred : β → ... | [
{
"name": "allOutputsSatisfyWhen_bind_iff",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 12,
"n_chars": 548,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
/-!
# Traversing Possible Paths of a Computation
This file defines structural predicates for checking whether all or some reacha... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
/-!
# Traversing Possible Paths of a Computation
This file defines structural predicates for checking whether all or some reacha... | @@ -87,6 +87,20 @@
∃ x ∈ possibleOutputs q, (oa x).somePathSatisfies queryPred outputPred possibleOutputs :=
Iff.rfl
+/-- A bind satisfies a universal path property exactly when every path of the first computation
+leads to a continuation that also satisfies that path property. -/
+@[simp]
+lemma allPaths... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_810f9b07f66c_1 | 7e058cacfa9d6fd4 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/Traversal.lean | Traversal | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "someOutputSatisfiesWhen_bind_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [someOutputSatisfiesWhen, somePathSatisfies_bind_iff]",
"n_chars": 69,
"n_subproofs": 0,... | [
{
"name": "somePathSatisfies_bind_iff",
"text": "/-- A bind satisfies an existential path property exactly when either the first computation\nalready satisfies it on some path, or one reachable continuation does. -/\n@[simp]\nlemma somePathSatisfies_bind_iff\n (queryPred : spec.Domain → Prop) (outputPred... | [
{
"name": "someOutputSatisfiesWhen_bind_iff",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 12,
"n_chars": 562,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
/-!
# Traversing Possible Paths of a Computation
This file defines structural predicates for checking whether all or some reacha... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
/-!
# Traversing Possible Paths of a Computation
This file defines structural predicates for checking whether all or some reacha... | @@ -101,6 +101,20 @@
induction oa using OracleComp.inductionOn <;>
simp [monad_norm, OracleComp.allPathsSatisfy_query_bind, *]
+/-- A bind satisfies an existential path property exactly when either the first computation
+already satisfies it on some path, or one reachable continuation does. -/
+@[simp]
+lemma... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_810f9b07f66c_2 | 8e98a458df2c2b1d | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/Traversal.lean | Traversal | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "allOutputsSatisfyWhen_bind_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [allOutputsSatisfyWhen, allPathsSatisfy_bind_iff]",
"n_chars": 65,
"n_subproofs": 0,
"... | [
{
"name": "allPathsSatisfy_bind_iff",
"text": "/-- A bind satisfies a universal path property exactly when every path of the first computation\nleads to a continuation that also satisfies that path property. -/\n@[simp]\nlemma allPathsSatisfy_bind_iff\n (queryPred : spec.Domain → Prop) (outputPred : β → ... | [
{
"name": "allOutputsSatisfyWhen_bind_iff_supportWhen",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 11,
"n_chars": 591,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_on... | 3 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
/-!
# Traversing Possible Paths of a Computation
This file defines structural predicates for checking whether all or some reacha... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
/-!
# Traversing Possible Paths of a Computation
This file defines structural predicates for checking whether all or some reacha... | @@ -100,6 +100,20 @@
true_and, OracleComp.supportWhen_query_bind, Set.mem_iUnion, exists_prop] at ih ⊢
grind
+/-- A bind satisfies a universal path property exactly when every path of the first computation
+leads to a continuation that also satisfies that path property. -/
+@[simp]
+lemma allPathsSati... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_810f9b07f66c_3 | bb4a1daefdd2e8ca | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/Traversal.lean | Traversal | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "someOutputSatisfiesWhen_bind_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [someOutputSatisfiesWhen, somePathSatisfies_bind_iff]",
"n_chars": 69,
"n_subproofs": 0,... | [
{
"name": "somePathSatisfies_bind_iff",
"text": "/-- A bind satisfies an existential path property exactly when either the first computation\nalready satisfies it on some path, or one reachable continuation does. -/\n@[simp]\nlemma somePathSatisfies_bind_iff\n (queryPred : spec.Domain → Prop) (outputPred... | [
{
"name": "someOutputSatisfiesWhen_bind_iff_supportWhen",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 11,
"n_chars": 608,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_... | 3 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
/-!
# Traversing Possible Paths of a Computation
This file defines structural predicates for checking whether all or some reacha... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
/-!
# Traversing Possible Paths of a Computation
This file defines structural predicates for checking whether all or some reacha... | @@ -114,6 +114,20 @@
induction oa using OracleComp.inductionOn <;>
simp [monad_norm, OracleComp.allPathsSatisfy_query_bind, *]
+/-- A bind satisfies an existential path property exactly when either the first computation
+already satisfies it on some path, or one reachable continuation does. -/
+@[simp]
+lemma... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b81d61d62572_0 | 1fcd7829a0b346d2 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Interop/Hax/Computation.lean | Computation | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "computationLifted_triple",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold computationLifted\n exact triple_liftRustM _ (computation_triple x)",
"n_chars": 80,
"n_subproofs"... | [
{
"name": "computation_triple",
"text": "/-- `RustM`-level Triple for `computation`. Under the no-overflow\nprecondition `2 * x.toNat + 1 < 2^32`, the function returns\n`2 * x.toNat + 1` in `Nat` representation.\n\nBoth internal additions are discharged by hax's own\n`UInt32.haxAdd_spec` (registered with `@... | [
{
"name": "computationLifted_triple",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 698,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"m... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Interop.Hax.Bridge
import Hax.rust_primitives.ops
/-!
# End-to-end hax example: `const fn computation(x: u32) -> u32`
This file takes a real hax-generated Lean functi... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Interop.Hax.Bridge
import Hax.rust_primitives.ops
/-!
# End-to-end hax example: `const fn computation(x: u32) -> u32`
This file takes a real hax-generated Lean functi... | @@ -73,6 +73,30 @@
@[spec]
def computation (x : u32) : RustM u32 := do ((← (x +? x)) +? (1 : u32))
+/-- `RustM`-level Triple for `computation`. Under the no-overflow
+precondition `2 * x.toNat + 1 < 2^32`, the function returns
+`2 * x.toNat + 1` in `Nat` representation.
+
+Both internal additions are discharged 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_770e6cee82ba_0 | a31e4313452a60ee | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CountingOracle.lean | CountingOracle | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "fst_map_run_withCounting",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n fst_map_run_withCost so _ mx",
"n_chars": 31,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
... | [
{
"name": "fst_map_run_withCost",
"text": "lemma fst_map_run_withCost [LawfulMonad m]\n (so : QueryImpl spec m) (costFn : spec.Domain → ω) (mx : OracleComp spec α) :\n Prod.fst <$> (simulateQ (so.withCost costFn) mx).run = simulateQ so mx :=\n fst_map_run_withTraceBefore so costFn mx\n\n",
"fan_i... | [
{
"name": "fst_map_run_withCounting",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 227,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"ma... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | @@ -69,6 +69,11 @@
(t : spec.Domain) :
so.withCost costFn t = (do tell (costFn t); so t) := rfl
+lemma fst_map_run_withCost [LawfulMonad m]
+ (so : QueryImpl spec m) (costFn : spec.Domain → ω) (mx : OracleComp spec α) :
+ Prod.fst <$> (simulateQ (so.withCost costFn) mx).run = simulateQ so mx :=
+ fst... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_770e6cee82ba_1 | 0eb4e409b9383813 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CountingOracle.lean | CountingOracle | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "probFailure_run_simulateQ",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [countingOracle, QueryImpl.withCounting_eq_withCost,\n QueryImpl.probFailure_run_simulateQ_withCost,... | [
{
"name": "withCounting_eq_withCost",
"text": "lemma withCounting_eq_withCost [DecidableEq ι] (so : QueryImpl spec m) :\n so.withCounting = so.withCost (QueryCount.single ·) := rfl\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 139,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
... | [
{
"name": "probFailure_run_simulateQ",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 496,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"ma... | 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.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | @@ -116,6 +116,9 @@
lemma withCounting_apply [DecidableEq ι] (so : QueryImpl spec m) (t : spec.Domain) :
so.withCounting t = (do tell (QueryCount.single t); so t) := rfl
+lemma withCounting_eq_withCost [DecidableEq ι] (so : QueryImpl spec m) :
+ so.withCounting = so.withCost (QueryCount.single ·) := rfl
+
l... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_770e6cee82ba_2 | a87be635772b8d79 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CountingOracle.lean | CountingOracle | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "mem_support_simulate_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [support_simulate]\n aesop",
"n_chars": 35,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,... | [
{
"name": "support_simulate",
"text": "/-- We can always reduce simulation with counting to start with `0`,\nand add the initial count back at the end. -/\nlemma support_simulate (oa : OracleComp spec α) (qc : QueryCount ι) :\n support (simulate oa qc) = Prod.map id (qc + ·) '' support (simulate oa 0) :=... | [
{
"name": "mem_support_simulate_iff",
"fan_in": 9,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 358,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"ma... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | @@ -244,11 +244,20 @@
@[deprecated (since := "2026-06-25")]
alias run_simulateT_eq_run_simulateT_zero := simulate_eq_map_simulate_zero
+/-- We can always reduce simulation with counting to start with `0`,
+and add the initial count back at the end. -/
+lemma support_simulate (oa : OracleComp spec α) (qc : QueryCoun... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_770e6cee82ba_3 | 543dcb98436e38b3 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CountingOracle.lean | CountingOracle | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 9 | [
{
"theorem_name": "mem_support_simulate_iff_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mem_support_simulate_iff oa qc z]\n refine ⟨?_, ?_⟩\n · rintro ⟨qc', hmem, hq⟩\n convert hmem usin... | [
{
"name": "mem_support_simulate_iff",
"text": "/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/\nlemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)\n (z : α × QueryCount ι) :\n z ∈ support (simulate oa qc) ↔\n ∃ qc', (z.1, q... | [
{
"name": "mem_support_simulate_iff_of_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 15,
"n_chars": 612,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 5,
"automation_only": false,... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | @@ -251,9 +251,27 @@
rw [simulate_eq_map_simulate_zero]
simp [support_map]
+/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/
+lemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)
+ (z : α × QueryCount ι) :
+ z ∈ support (simulate oa qc... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_770e6cee82ba_4 | d10a45470ff8b1a7 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CountingOracle.lean | CountingOracle | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 9 | [
{
"theorem_name": "mem_support_simulate_iff_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mem_support_simulate_iff oa qc z]\n refine ⟨?_, ?_⟩\n · rintro ⟨qc', hmem, hq⟩\n convert hmem usin... | [
{
"name": "mem_support_simulate_iff",
"text": "/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/\nlemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)\n (z : α × QueryCount ι) :\n z ∈ support (simulate oa qc) ↔\n ∃ qc', (z.1, q... | [
{
"name": "le_of_mem_support_simulate",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 6,
"n_chars": 306,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | @@ -251,8 +251,18 @@
rw [simulate_eq_map_simulate_zero]
simp [support_map]
+/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/
+lemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)
+ (z : α × QueryCount ι) :
+ z ∈ support (simulate oa qc... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_770e6cee82ba_5 | 34789c0985d727b8 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CountingOracle.lean | CountingOracle | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 9 | [
{
"theorem_name": "mem_support_simulate_iff_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mem_support_simulate_iff oa qc z]\n refine ⟨?_, ?_⟩\n · rintro ⟨qc', hmem, hq⟩\n convert hmem usin... | [
{
"name": "mem_support_simulate_iff",
"text": "/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/\nlemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)\n (z : α × QueryCount ι) :\n z ∈ support (simulate oa qc) ↔\n ∃ qc', (z.1, q... | [
{
"name": "mem_support_snd_map_simulate_iff",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 653,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 4,
"automation_only": false... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | @@ -251,6 +251,14 @@
rw [simulate_eq_map_simulate_zero]
simp [support_map]
+/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/
+lemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)
+ (z : α × QueryCount ι) :
+ z ∈ support (simulate oa qc... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_770e6cee82ba_6 | fa07356ff21de00f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CountingOracle.lean | CountingOracle | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 9 | [
{
"theorem_name": "mem_support_simulate_iff_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mem_support_simulate_iff oa qc z]\n refine ⟨?_, ?_⟩\n · rintro ⟨qc', hmem, hq⟩\n convert hmem usin... | [
{
"name": "mem_support_simulate_iff",
"text": "/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/\nlemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)\n (z : α × QueryCount ι) :\n z ∈ support (simulate oa qc) ↔\n ∃ qc', (z.1, q... | [
{
"name": "mem_support_snd_map_simulate_iff_of_le",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 16,
"n_chars": 756,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 3,
"automation_only":... | 3 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | @@ -251,6 +251,14 @@
rw [simulate_eq_map_simulate_zero]
simp [support_map]
+/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/
+lemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)
+ (z : α × QueryCount ι) :
+ z ∈ support (simulate oa qc... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_770e6cee82ba_7 | 71c59d0fc4999e0c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CountingOracle.lean | CountingOracle | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 9 | [
{
"theorem_name": "mem_support_simulate_iff_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mem_support_simulate_iff oa qc z]\n refine ⟨?_, ?_⟩\n · rintro ⟨qc', hmem, hq⟩\n convert hmem usin... | [
{
"name": "mem_support_simulate_iff",
"text": "/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/\nlemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)\n (z : α × QueryCount ι) :\n z ∈ support (simulate oa qc) ↔\n ∃ qc', (z.1, q... | [
{
"name": "le_of_mem_support_snd_map_simulate",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 395,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": fals... | 3 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | @@ -251,6 +251,14 @@
rw [simulate_eq_map_simulate_zero]
simp [support_map]
+/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/
+lemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)
+ (z : α × QueryCount ι) :
+ z ∈ support (simulate oa qc... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_770e6cee82ba_8 | dcef2df1285607ae | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CountingOracle.lean | CountingOracle | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 9 | [
{
"theorem_name": "mem_support_simulate_iff_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mem_support_simulate_iff oa qc z]\n refine ⟨?_, ?_⟩\n · rintro ⟨qc', hmem, hq⟩\n convert hmem usin... | [
{
"name": "mem_support_simulate_iff",
"text": "/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/\nlemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)\n (z : α × QueryCount ι) :\n z ∈ support (simulate oa qc) ↔\n ∃ qc', (z.1, q... | [
{
"name": "sub_mem_support_snd_map_simulate",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 10,
"n_chars": 458,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false... | 5 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | @@ -251,6 +251,14 @@
rw [simulate_eq_map_simulate_zero]
simp [support_map]
+/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/
+lemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)
+ (z : α × QueryCount ι) :
+ z ∈ support (simulate oa qc... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_770e6cee82ba_9 | 04c1c5594398827f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CountingOracle.lean | CountingOracle | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 9 | [
{
"theorem_name": "mem_support_simulate_iff_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mem_support_simulate_iff oa qc z]\n refine ⟨?_, ?_⟩\n · rintro ⟨qc', hmem, hq⟩\n convert hmem usin... | [
{
"name": "mem_support_simulate_iff",
"text": "/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/\nlemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)\n (z : α × QueryCount ι) :\n z ∈ support (simulate oa qc) ↔\n ∃ qc', (z.1, q... | [
{
"name": "add_mem_support_simulate",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 536,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 4,
"automation_only": false,
"m... | 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.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | @@ -251,18 +251,35 @@
rw [simulate_eq_map_simulate_zero]
simp [support_map]
+/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/
+lemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)
+ (z : α × QueryCount ι) :
+ z ∈ support (simulate oa 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_770e6cee82ba_10 | e6961a08a660712c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CountingOracle.lean | CountingOracle | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 9 | [
{
"theorem_name": "mem_support_simulate_iff_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mem_support_simulate_iff oa qc z]\n refine ⟨?_, ?_⟩\n · rintro ⟨qc', hmem, hq⟩\n convert hmem usin... | [
{
"name": "mem_support_simulate_iff",
"text": "/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/\nlemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)\n (z : α × QueryCount ι) :\n z ∈ support (simulate oa qc) ↔\n ∃ qc', (z.1, q... | [
{
"name": "add_right_mem_support_simulate_iff",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 250,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fals... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | @@ -251,6 +251,14 @@
rw [simulate_eq_map_simulate_zero]
simp [support_map]
+/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/
+lemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)
+ (z : α × QueryCount ι) :
+ z ∈ support (simulate oa qc... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_770e6cee82ba_11 | 44fa6e9adb4d5bbf | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CountingOracle.lean | CountingOracle | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 9 | [
{
"theorem_name": "mem_support_simulate_iff_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mem_support_simulate_iff oa qc z]\n refine ⟨?_, ?_⟩\n · rintro ⟨qc', hmem, hq⟩\n convert hmem usin... | [
{
"name": "mem_support_simulate_iff",
"text": "/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/\nlemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)\n (z : α × QueryCount ι) :\n z ∈ support (simulate oa qc) ↔\n ∃ qc', (z.1, q... | [
{
"name": "apply_ne_zero_of_mem_support_simulate_queryBind",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 15,
"n_chars": 742,
"n_subproofs": 4,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 2,
"automat... | 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.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | @@ -251,6 +251,14 @@
rw [simulate_eq_map_simulate_zero]
simp [support_map]
+/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/
+lemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)
+ (z : α × QueryCount ι) :
+ z ∈ support (simulate oa qc... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_770e6cee82ba_12 | 6888275ddf49e4f7 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CountingOracle.lean | CountingOracle | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 9 | [
{
"theorem_name": "mem_support_simulate_iff_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mem_support_simulate_iff oa qc z]\n refine ⟨?_, ?_⟩\n · rintro ⟨qc', hmem, hq⟩\n convert hmem usin... | [
{
"name": "mem_support_simulate_iff",
"text": "/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/\nlemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)\n (z : α × QueryCount ι) :\n z ∈ support (simulate oa qc) ↔\n ∃ qc', (z.1, q... | [
{
"name": "exists_mem_support_of_mem_support_simulate_queryBind",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 23,
"n_chars": 1221,
"n_subproofs": 5,
"n_tactics": 18,
"cyclomatic": 2,
"n_automation": 8,
"n_rewrites": 0,
"n_structural": 5,
"a... | 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.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | @@ -251,6 +251,14 @@
rw [simulate_eq_map_simulate_zero]
simp [support_map]
+/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/
+lemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)
+ (z : α × QueryCount ι) :
+ z ∈ support (simulate oa qc... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_770e6cee82ba_13 | 532d3a76d9eb8fc8 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CountingOracle.lean | CountingOracle | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 9 | [
{
"theorem_name": "mem_support_simulate_iff_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mem_support_simulate_iff oa qc z]\n refine ⟨?_, ?_⟩\n · rintro ⟨qc', hmem, hq⟩\n convert hmem usin... | [
{
"name": "mem_support_simulate_iff",
"text": "/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/\nlemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)\n (z : α × QueryCount ι) :\n z ∈ support (simulate oa qc) ↔\n ∃ qc', (z.1, q... | [
{
"name": "mem_support_simulate_queryBind_iff",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 6,
"n_lines": 40,
"n_chars": 2068,
"n_subproofs": 7,
"n_tactics": 34,
"cyclomatic": 5,
"n_automation": 10,
"n_rewrites": 0,
"n_structural": 9,
"automation_only": ... | 4 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | @@ -251,6 +251,14 @@
rw [simulate_eq_map_simulate_zero]
simp [support_map]
+/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/
+lemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)
+ (z : α × QueryCount ι) :
+ z ∈ support (simulate oa qc... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_770e6cee82ba_14 | 3203464148dd2dc3 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/CountingOracle.lean | CountingOracle | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 9 | [
{
"theorem_name": "mem_support_simulate_iff_of_le",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mem_support_simulate_iff oa qc z]\n refine ⟨?_, ?_⟩\n · rintro ⟨qc', hmem, hq⟩\n convert hmem usin... | [
{
"name": "mem_support_simulate_iff",
"text": "/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/\nlemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)\n (z : α × QueryCount ι) :\n z ∈ support (simulate oa qc) ↔\n ∃ qc', (z.1, q... | [
{
"name": "exists_mem_support_of_mem_support",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 12,
"n_chars": 547,
"n_subproofs": 2,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 3,
"automation_only": fals... | 3 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
/-!
# Counting Queries Made by a C... | @@ -251,6 +251,14 @@
rw [simulate_eq_map_simulate_zero]
simp [support_map]
+/-- Reduce membership in support of simulation with counting to simulation starting from `0`. -/
+lemma mem_support_simulate_iff (oa : OracleComp spec α) (qc : QueryCount ι)
+ (z : α × QueryCount ι) :
+ z ∈ support (simulate oa qc... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_935b273daef0_0 | a81841eec5adba6f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/ElGamal/Basic.lean | Basic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "elGamal_oneTime_signedAdvantageReal_abs_eq_two_mul_ddhGuessAdvantage",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_real :\n |AsymmEncAlg.IND_CPA_OneTime_signedAdvantageReal... | [
{
"name": "IND_CPA_OneTime_game_evalDist_eq_ddhExpReal",
"text": "/-- Real-branch identification for the one-time ElGamal reduction. After unfolding\n`IND_CPA_OneTime_Game_ProbComp`, `elGamalAsymmEnc`, `DiffieHellman.ddhExpReal`, and\n`IND_CPA_OneTime_DDHReduction`, both sides normalize to the same sample s... | [
{
"name": "elGamal_oneTime_signedAdvantageReal_abs_eq_two_mul_ddhGuessAdvantage",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 34,
"n_chars": 1913,
"n_subproofs": 3,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_struct... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import Examples.ElGamal.Common
import VCVio.CryptoFoundations.AsymmEncAlg.INDCPA
import VCVio.CryptoFoundations.HardnessAssumptions.DiffieHellman
/-!
# ElGamal Enc... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import Examples.ElGamal.Common
import VCVio.CryptoFoundations.AsymmEncAlg.INDCPA
import VCVio.CryptoFoundations.HardnessAssumptions.DiffieHellman
/-!
# ElGamal Enc... | @@ -89,6 +89,42 @@
pure (bit == bit')
omit [DecidableEq G] in
+/-- Real-branch identification for the one-time ElGamal reduction. After unfolding
+`IND_CPA_OneTime_Game_ProbComp`, `elGamalAsymmEnc`, `DiffieHellman.ddhExpReal`, and
+`IND_CPA_OneTime_DDHReduction`, both sides normalize to the same sample space. -/
... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_935b273daef0_1 | c163ff8b1e0fde11 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/ElGamal/Basic.lean | Basic | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "elGamal_oneTime_signedAdvantageReal_abs_eq_two_mul_ddhGuessAdvantage",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_real :\n |AsymmEncAlg.IND_CPA_OneTime_signedAdvantageReal... | [
{
"name": "IND_CPA_OneTime_game_evalDist_eq_ddhExpReal",
"text": "/-- Real-branch identification for the one-time ElGamal reduction. After unfolding\n`IND_CPA_OneTime_Game_ProbComp`, `elGamalAsymmEnc`, `DiffieHellman.ddhExpReal`, and\n`IND_CPA_OneTime_DDHReduction`, both sides normalize to the same sample s... | [
{
"name": "elGamal_IND_CPA_le_q_mul_ddh",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 26,
"n_chars": 1315,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 3,
"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: Devon Tuma, Quang Dao
-/
import Examples.ElGamal.Common
import VCVio.CryptoFoundations.AsymmEncAlg.INDCPA
import VCVio.CryptoFoundations.HardnessAssumptions.DiffieHellman
/-!
# ElGamal Enc... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import Examples.ElGamal.Common
import VCVio.CryptoFoundations.AsymmEncAlg.INDCPA
import VCVio.CryptoFoundations.HardnessAssumptions.DiffieHellman
/-!
# ElGamal Enc... | @@ -89,6 +89,42 @@
pure (bit == bit')
omit [DecidableEq G] in
+/-- Real-branch identification for the one-time ElGamal reduction. After unfolding
+`IND_CPA_OneTime_Game_ProbComp`, `elGamalAsymmEnc`, `DiffieHellman.ddhExpReal`, and
+`IND_CPA_OneTime_DDHReduction`, both sides normalize to the same sample space. -/
... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_62377e2d1bb1_0 | a034ba280a23414c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Inductive/Extractability.lean | Extractability | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 1 | [
{
"theorem_name": "extractabilityGame_isTotalQueryBound",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [extractabilityGame_eq_bind_verifyProof]\n exact isTotalQueryBound_bind (n₁ := qb) (n₂ := s.depth)... | [
{
"name": "extractabilityGame_eq_bind_verifyProof",
"text": "/--\nUnfold `extractabilityGame` into a nested `bind` whose outer prefix logs the committing\nadversary's queries alongside the opening adversary's output, and whose continuation runs\n`verifyProof` and assembles the transcript. This is the defini... | [
{
"name": "extractabilityGame_isTotalQueryBound",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 19,
"n_chars": 978,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": f... | 2 | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | @@ -161,6 +161,27 @@
∨ not (proof.toList.map Option.some = extractedProof.toList))
/--
+Unfold `extractabilityGame` into a nested `bind` whose outer prefix logs the committing
+adversary's queries alongside the opening adversary's output, and whose continuation runs
+`verifyProof` and assembles the transcript. ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_62377e2d1bb1_1 | 4a6d774434728e05 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Inductive/Extractability.lean | Extractability | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 1 | [
{
"theorem_name": "extractor_internal_get_eq_none_of_find?_eq_none",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [extractor, optionPopulateDown_internal, extractorChildren_eq_none_of_find?_eq_no... | [
{
"name": "extractorChildren_eq_none_of_find?_eq_none",
"text": "private lemma extractorChildren_eq_none_of_find?_eq_none\n {log_c : (spec α).QueryLog} {a : α} (hf : log_c.find? (fun ⟨_, r⟩ => r == a) = none) :\n extractorChildren log_c a = none := by\n simp only [extractorChildren, hf]\n\n",
"fa... | [
{
"name": "extractor_internal_get_eq_none_of_find?_eq_none",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 699,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 2,
"automati... | 1 | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | @@ -160,6 +160,11 @@
(not (leaf = extractedTree.get idx.toNodeIndex)
∨ not (proof.toList.map Option.some = extractedProof.toList))
+private lemma extractorChildren_eq_none_of_find?_eq_none
+ {log_c : (spec α).QueryLog} {a : α} (hf : log_c.find? (fun ⟨_, r⟩ => r == a) = none) :
+ extractorChildren log_... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_62377e2d1bb1_2 | 66ddfc3909350b91 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Inductive/Extractability.lean | Extractability | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 1 | [
{
"theorem_name": "getPutativeRoot_step_withQueryLog_decompose",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [OracleComp.withQueryLog_bind, singleHash_withQueryLog] at hmem\n grind",
"n_cha... | [
{
"name": "singleHash_withQueryLog",
"text": "private lemma singleHash_withQueryLog (a b : α) :\n (singleHash (m := OracleComp (spec α)) a b).withQueryLog =\n (liftM ((spec α).query (a, b)) : OracleComp (spec α) α) >>=\n fun u => pure (u, ([⟨(a, b), u⟩] : (spec α).QueryLog)) := by\n simp [si... | [
{
"name": "getPutativeRoot_step_withQueryLog_decompose",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 478,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_o... | 1 | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | @@ -162,13 +162,21 @@
end ExtractabilityGame
+private lemma singleHash_withQueryLog (a b : α) :
+ (singleHash (m := OracleComp (spec α)) a b).withQueryLog =
+ (liftM ((spec α).query (a, b)) : OracleComp (spec α) α) >>=
+ fun u => pure (u, ([⟨(a, b), u⟩] : (spec α).QueryLog)) := by
+ simp [singleHas... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_62377e2d1bb1_3 | eb45373214b961e4 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Inductive/Extractability.lean | Extractability | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 1 | [
{
"theorem_name": "chainInLog_of_mem_support_getPutativeRoot",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction idx generalizing r log_v with\n | ofLeaf =>\n rw [show (getPutativeRoot (m := Orac... | [
{
"name": "getPutativeRoot_step_withQueryLog_decompose",
"text": "private lemma getPutativeRoot_step_withQueryLog_decompose\n (prog : OracleComp (spec α) α) (mkPair : α → α × α)\n (r : α) (log_v : (spec α).QueryLog)\n (hmem : (r, log_v) ∈ support\n (prog >>= fun a => let (l, r') := mkPair a; s... | [
{
"name": "chainInLog_of_mem_support_getPutativeRoot",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 30,
"n_chars": 1395,
"n_subproofs": 3,
"n_tactics": 22,
"cyclomatic": 2,
"n_automation": 8,
"n_rewrites": 2,
"n_structural": 6,
"automation_o... | 3 | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | @@ -168,6 +168,16 @@
fun u => pure (u, ([⟨(a, b), u⟩] : (spec α).QueryLog)) := by
simp [singleHash, bind_pure, OracleComp.withQueryLog_query]
+private lemma getPutativeRoot_step_withQueryLog_decompose
+ (prog : OracleComp (spec α) α) (mkPair : α → α × α)
+ (r : α) (log_v : (spec α).QueryLog)
+ (h... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_62377e2d1bb1_4 | 55d80075533e3522 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Inductive/Extractability.lean | Extractability | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 2 | [
{
"theorem_name": "chainInLog_of_mem_support_getPutativeRoot",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction idx generalizing r log_v with\n | ofLeaf =>\n rw [show (getPutativeRoot (m := Orac... | [
{
"name": "chainInLog_mono",
"text": "private lemma chainInLog_mono {s : Skeleton} (idx : SkeletonLeafIndex s)\n {log1 log2 : (spec α).QueryLog} {root leaf : α}\n {proof : List.Vector α idx.depth}\n (h_sub : ∀ q, q ∈ log1 → q ∈ log2)\n (h_chain : ChainInLog log1 leaf root idx proof) :\n Chain... | [
{
"name": "chainInLog_of_mem_support_verifyProof",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 16,
"n_chars": 653,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": ... | 4 | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | @@ -194,6 +194,18 @@
(⟨(proof.head, ancestor), root⟩ : (_i : (α × α)) × α) ∈ log ∧
ChainInLog log leaf ancestor idxRight proof.tail
+private lemma chainInLog_mono {s : Skeleton} (idx : SkeletonLeafIndex s)
+ {log1 log2 : (spec α).QueryLog} {root leaf : α}
+ {proof : List.Vector α idx.depth}
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_62377e2d1bb1_5 | 0d8ca3434c8fccab | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Inductive/Extractability.lean | Extractability | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 3 | [
{
"theorem_name": "chainInLog_of_extractor_internal_step_left",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨extLeaf, extProof, h_extLeaf, h_extProof, h_chain⟩ := h_rec\n rw [extractor_internal_eq... | [
{
"name": "extractor_internal_eq_of_find?_eq",
"text": "/-- If the query log's first entry with response `root` is the pair `⟨(x, y), root⟩`,\nthen the extractor at an internal skeleton unfolds to that node's two children using\n`x` and `y` as the new \"ancestor\" values for the left and right subtrees. -/\... | [
{
"name": "chainInLog_of_extractor_internal_step_left",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 28,
"n_chars": 1809,
"n_subproofs": 2,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_o... | 1 | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | @@ -160,6 +160,17 @@
(not (leaf = extractedTree.get idx.toNodeIndex)
∨ not (proof.toList.map Option.some = extractedProof.toList))
+/-- If the query log's first entry with response `root` is the pair `⟨(x, y), root⟩`,
+then the extractor at an internal skeleton unfolds to that node's two children using
+`x`... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_62377e2d1bb1_6 | eec20a77778b9eab | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Inductive/Extractability.lean | Extractability | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 3 | [
{
"theorem_name": "chainInLog_of_extractor_internal_step_left",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨extLeaf, extProof, h_extLeaf, h_extProof, h_chain⟩ := h_rec\n rw [extractor_internal_eq... | [
{
"name": "extractor_internal_eq_of_find?_eq",
"text": "/-- If the query log's first entry with response `root` is the pair `⟨(x, y), root⟩`,\nthen the extractor at an internal skeleton unfolds to that node's two children using\n`x` and `y` as the new \"ancestor\" values for the left and right subtrees. -/\... | [
{
"name": "chainInLog_of_extractor_internal_step_right",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 28,
"n_chars": 1779,
"n_subproofs": 2,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_... | 1 | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | @@ -160,6 +160,17 @@
(not (leaf = extractedTree.get idx.toNodeIndex)
∨ not (proof.toList.map Option.some = extractedProof.toList))
+/-- If the query log's first entry with response `root` is the pair `⟨(x, y), root⟩`,
+then the extractor at an internal skeleton unfolds to that node's two children using
+`x`... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_62377e2d1bb1_7 | 6db19dacdbec92ca | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Inductive/Extractability.lean | Extractability | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 1 | [
{
"theorem_name": "extractor_internal_get_eq_none_of_find?_eq_none",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [extractor, optionPopulateDown_internal, extractorChildren_eq_none_of_find?_eq_no... | [
{
"name": "extractorChildren_eq_none_of_find?_eq_none",
"text": "private lemma extractorChildren_eq_none_of_find?_eq_none\n {log_c : (spec α).QueryLog} {a : α} (hf : log_c.find? (fun ⟨_, r⟩ => r == a) = none) :\n extractorChildren log_c a = none := by\n simp only [extractorChildren, hf]\n\n",
"fa... | [
{
"name": "chainInLog_of_extractor_get_ne_none",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 5,
"n_lines": 34,
"n_chars": 2008,
"n_subproofs": 0,
"n_tactics": 21,
"cyclomatic": 4,
"n_automation": 6,
"n_rewrites": 6,
"n_structural": 10,
"automation_only":... | 5 | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | @@ -171,6 +171,11 @@
simp only [extractor, optionPopulateDown_internal, extractorChildren, h_find]
rfl
+private lemma extractorChildren_eq_none_of_find?_eq_none
+ {log_c : (spec α).QueryLog} {a : α} (hf : log_c.find? (fun ⟨_, r⟩ => r == a) = none) :
+ extractorChildren log_c a = none := by
+ simp only [e... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_62377e2d1bb1_8 | 0e957286bcde469a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Inductive/Extractability.lean | Extractability | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 1 | [
{
"theorem_name": "chainInLog_of_mem_support_getPutativeRoot",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction idx generalizing r log_v with\n | ofLeaf =>\n rw [show (getPutativeRoot (m := Orac... | [
{
"name": "getPutativeRoot_step_withQueryLog_decompose",
"text": "private lemma getPutativeRoot_step_withQueryLog_decompose\n (prog : OracleComp (spec α) α) (mkPair : α → α × α)\n (r : α) (log_v : (spec α).QueryLog)\n (hmem : (r, log_v) ∈ support\n (prog >>= fun a => let (l, r') := mkPair a; s... | [
{
"name": "extractabilityGame_not_logHasCollision_match",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 13,
"n_lines": 29,
"n_chars": 1560,
"n_subproofs": 3,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 5,
"automati... | 13 | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | @@ -244,6 +244,16 @@
fun u => pure (u, ([⟨(a, b), u⟩] : (spec α).QueryLog)) := by
simp [singleHash, bind_pure, OracleComp.withQueryLog_query]
+private lemma getPutativeRoot_step_withQueryLog_decompose
+ (prog : OracleComp (spec α) α) (mkPair : α → α × α)
+ (r : α) (log_v : (spec α).QueryLog)
+ (h... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_62377e2d1bb1_9 | 2f46dc04b8afaf01 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Inductive/Extractability.lean | Extractability | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 1 | [
{
"theorem_name": "probOutput_getPutativeRoot_eq_inv_card_of_pos_depth",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases idx with\n | ofLeaf => exact absurd h_pos (Nat.lt_irrefl _)\n | @ofLeft sl sr ... | [
{
"name": "probOutput_singleHash_eq_inv_card",
"text": "/--\nThe probability that a single hash evaluates to a specific root value\n(without any prior queries)\nis the reciprocal of the range size.\n-/\nprivate lemma probOutput_singleHash_eq_inv_card\n [Fintype α] [Inhabited α]\n (a b root : α) :\n ... | [
{
"name": "probOutput_getPutativeRoot_eq_inv_card_of_pos_depth",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 27,
"n_chars": 1411,
"n_subproofs": 0,
"n_tactics": 15,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 2,
"au... | 1 | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | @@ -179,6 +179,21 @@
ChainInLog log leaf ancestor idxRight proof.tail
/--
+The probability that a single hash evaluates to a specific root value
+(without any prior queries)
+is the reciprocal of the range size.
+-/
+private lemma probOutput_singleHash_eq_inv_card
+ [Fintype α] [Inhabited α]
+ (a b ro... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_62377e2d1bb1_10 | d5a28ac15cf5b342 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Inductive/Extractability.lean | Extractability | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 1 | [
{
"theorem_name": "probOutput_getPutativeRoot_eq_inv_card_of_pos_depth",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases idx with\n | ofLeaf => exact absurd h_pos (Nat.lt_irrefl _)\n | @ofLeft sl sr ... | [
{
"name": "probOutput_singleHash_eq_inv_card",
"text": "/--\nThe probability that a single hash evaluates to a specific root value\n(without any prior queries)\nis the reciprocal of the range size.\n-/\nprivate lemma probOutput_singleHash_eq_inv_card\n [Fintype α] [Inhabited α]\n (a b root : α) :\n ... | [
{
"name": "probEvent_verifyProof_eq_true_eq_inv_card_of_pos_depth",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 19,
"n_chars": 960,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
"a... | 2 | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | @@ -179,6 +179,21 @@
ChainInLog log leaf ancestor idxRight proof.tail
/--
+The probability that a single hash evaluates to a specific root value
+(without any prior queries)
+is the reciprocal of the range size.
+-/
+private lemma probOutput_singleHash_eq_inv_card
+ [Fintype α] [Inhabited α]
+ (a b ro... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_62377e2d1bb1_11 | d18fdc40fdfe1045 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Inductive/Extractability.lean | Extractability | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 1 | [
{
"theorem_name": "probEvent_verifyProof_eq_true_eq_inv_card_of_pos_depth",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [show (verifyProof (m := OracleComp (spec α)) idx leaf root proof :\n ... | [
{
"name": "probOutput_getPutativeRoot_eq_inv_card_of_pos_depth",
"text": "/--\nThe probability that `getPutativeRoot` evaluates to a specific root value at a positive-depth index\n(without any prior queries) is the reciprocal of the range size.\n-/\nprivate lemma probOutput_getPutativeRoot_eq_inv_card_of_po... | [
{
"name": "probEvent_verifyProof_extractor_none_le_inv_card",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 17,
"n_chars": 960,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 4,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 5,
"automat... | 3 | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | @@ -194,6 +194,32 @@
probOutput_query (spec := spec α) (a, b) root]
/--
+The probability that `getPutativeRoot` evaluates to a specific root value at a positive-depth index
+(without any prior queries) is the reciprocal of the range size.
+-/
+private lemma probOutput_getPutativeRoot_eq_inv_card_of_pos_depth
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_62377e2d1bb1_12 | 77aabdfd8c40a17e | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Inductive/Extractability.lean | Extractability | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 1 | [
{
"theorem_name": "probEvent_verifyProof_eq_true_eq_inv_card_of_pos_depth",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [show (verifyProof (m := OracleComp (spec α)) idx leaf root proof :\n ... | [
{
"name": "probOutput_getPutativeRoot_eq_inv_card_of_pos_depth",
"text": "/--\nThe probability that `getPutativeRoot` evaluates to a specific root value at a positive-depth index\n(without any prior queries) is the reciprocal of the range size.\n-/\nprivate lemma probOutput_getPutativeRoot_eq_inv_card_of_po... | [
{
"name": "extractabilityGame_verified_extractor_none_le_inv_card",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 28,
"n_chars": 1547,
"n_subproofs": 0,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 6,
"n_structural": 3,
... | 4 | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | @@ -194,6 +194,32 @@
probOutput_query (spec := spec α) (a, b) root]
/--
+The probability that `getPutativeRoot` evaluates to a specific root value at a positive-depth index
+(without any prior queries) is the reciprocal of the range size.
+-/
+private lemma probOutput_getPutativeRoot_eq_inv_card_of_pos_depth
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_62377e2d1bb1_13 | 222c4883007817d5 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Inductive/Extractability.lean | Extractability | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 1 | [
{
"theorem_name": "chainInLog_of_mem_support_verifyProof",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n grind [ChainInLog, OracleComp.withQueryLog_bind, chainInLog_of_mem_support_getPutativeRoot]",
"n_... | [
{
"name": "chainInLog_of_mem_support_getPutativeRoot",
"text": "private lemma chainInLog_of_mem_support_getPutativeRoot\n {s : Skeleton} (idx : SkeletonLeafIndex s)\n (leaf : α) (proof : List.Vector α idx.depth) (r : α)\n (log_v : (spec α).QueryLog)\n (hmem : (r, log_v) ∈ support\n (getPu... | [
{
"name": "extractabilityGame_not_logHasCollision_wins_le_inv_card",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 19,
"n_lines": 19,
"n_chars": 905,
"n_subproofs": 3,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 6,
... | 19 | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | @@ -282,6 +282,35 @@
obtain ⟨ancestor, h_mem, h_rec⟩ := h_chain
exact ⟨ancestor, h_sub _ h_mem, ih h_rec⟩
+private lemma chainInLog_of_mem_support_getPutativeRoot
+ {s : Skeleton} (idx : SkeletonLeafIndex s)
+ (leaf : α) (proof : List.Vector α idx.depth) (r : α)
+ (log_v : (spec α).QueryLog)
+ (... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_62377e2d1bb1_14 | 31a0b9897a56f572 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Inductive/Extractability.lean | Extractability | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 2 | [
{
"theorem_name": "chainInLog_of_mem_support_getPutativeRoot",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction idx generalizing r log_v with\n | ofLeaf =>\n rw [show (getPutativeRoot (m := Orac... | [
{
"name": "chainInLog_mono",
"text": "private lemma chainInLog_mono {s : Skeleton} (idx : SkeletonLeafIndex s)\n {log1 log2 : (spec α).QueryLog} {root leaf : α}\n {proof : List.Vector α idx.depth}\n (h_sub : ∀ q, q ∈ log1 → q ∈ log2)\n (h_chain : ChainInLog log1 leaf root idx proof) :\n Chain... | [
{
"name": "extractability",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 23,
"n_lines": 54,
"n_chars": 2425,
"n_subproofs": 1,
"n_tactics": 31,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nest... | 23 | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | /-
Copyright (c) 2026 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Bolton Bailey
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.QueryBound
import VCVio.OracleComp.QueryTracking.Birthday
import ToMathlib.Data.IndexedBinaryTree.... | @@ -325,6 +325,18 @@
(⟨(proof.head, ancestor), root⟩ : (_i : (α × α)) × α) ∈ log ∧
ChainInLog log leaf ancestor idxRight proof.tail
+private lemma chainInLog_mono {s : Skeleton} (idx : SkeletonLeafIndex s)
+ {log1 log2 : (spec α).QueryLog} {root leaf : α}
+ {proof : List.Vector α idx.depth}
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_2c7fc6b3fd0d_0 | 9fc9e2f75f1f4c0d | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/EvalDist/Instances/ErrorT.lean | ErrorT | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "probOutput_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa only [probOutput_def] using toSPMF'_apply_eq mx x",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 2,
"c... | [
{
"name": "toSPMF'_apply_eq",
"text": "private lemma toSPMF'_apply_eq [MonadLiftT m PMF] [LawfulMonadLiftT m PMF]\n (mx : ExceptT ε m α) (x : α) :\n ExceptT.toSPMF' mx x = (liftM mx.run : SPMF _) (Except.ok x) := by\n simp only [ExceptT.toSPMF', SPMF.bind_apply_eq_tsum]\n refine (tsum_eq_single (Exc... | [
{
"name": "probOutput_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 176,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": ... | 1 | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.EvalDist.Monad.Map
import Mathlib.Control.Lawful
/-!
# Evaluation Semantics for ExceptT (ErrorT)
This file provides evaluation semantics for `ExceptT ε m` compu... | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.EvalDist.Monad.Map
import Mathlib.Control.Lawful
/-!
# Evaluation Semantics for ExceptT (ErrorT)
This file provides evaluation semantics for `ExceptT ε m` compu... | @@ -142,6 +142,16 @@
congr 1; funext r
cases r <;> simp [ExceptT.bindCont, ExceptT.run]
+private lemma toSPMF'_apply_eq [MonadLiftT m PMF] [LawfulMonadLiftT m PMF]
+ (mx : ExceptT ε m α) (x : α) :
+ ExceptT.toSPMF' mx x = (liftM mx.run : SPMF _) (Except.ok x) := by
+ simp only [ExceptT.toSPMF', SPMF.... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_2c7fc6b3fd0d_1 | e4f962dd8ea4e33d | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/EvalDist/Instances/ErrorT.lean | ErrorT | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "probOutput_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa only [probOutput_def] using toSPMF'_apply_eq mx x",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 2,
"c... | [
{
"name": "toSPMF'_apply_eq",
"text": "private lemma toSPMF'_apply_eq [MonadLiftT m PMF] [LawfulMonadLiftT m PMF]\n (mx : ExceptT ε m α) (x : α) :\n ExceptT.toSPMF' mx x = (liftM mx.run : SPMF _) (Except.ok x) := by\n simp only [ExceptT.toSPMF', SPMF.bind_apply_eq_tsum]\n refine (tsum_eq_single (Exc... | [
{
"name": "probOutput_liftM",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 6,
"n_chars": 217,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"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: Quang Dao
-/
import VCVio.EvalDist.Monad.Map
import Mathlib.Control.Lawful
/-!
# Evaluation Semantics for ExceptT (ErrorT)
This file provides evaluation semantics for `ExceptT ε m` compu... | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.EvalDist.Monad.Map
import Mathlib.Control.Lawful
/-!
# Evaluation Semantics for ExceptT (ErrorT)
This file provides evaluation semantics for `ExceptT ε m` compu... | @@ -142,6 +142,16 @@
congr 1; funext r
cases r <;> simp [ExceptT.bindCont, ExceptT.run]
+private lemma toSPMF'_apply_eq [MonadLiftT m PMF] [LawfulMonadLiftT m PMF]
+ (mx : ExceptT ε m α) (x : α) :
+ ExceptT.toSPMF' mx x = (liftM mx.run : SPMF _) (Except.ok x) := by
+ simp only [ExceptT.toSPMF', SPMF.... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_2c7fc6b3fd0d_2 | b87dc5e5b0ab49b8 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/EvalDist/Instances/ErrorT.lean | ErrorT | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "evalDist_liftM",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n SPMF.ext (probOutput_liftM mx)",
"n_chars": 33,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_autom... | [
{
"name": "probOutput_liftM",
"text": "lemma probOutput_liftM [LawfulMonad m] (mx : m α) (x : α) :\n Pr[= x | (liftM mx : ExceptT ε m α)] = Pr[= x | mx] := by\n rw [probOutput_eq]\n exact probOutput_map_injective mx (fun a b h => by cases h; rfl) x\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars"... | [
{
"name": "evalDist_liftM",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 5,
"n_chars": 146,
"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) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.EvalDist.Monad.Map
import Mathlib.Control.Lawful
/-!
# Evaluation Semantics for ExceptT (ErrorT)
This file provides evaluation semantics for `ExceptT ε m` compu... | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.EvalDist.Monad.Map
import Mathlib.Control.Lawful
/-!
# Evaluation Semantics for ExceptT (ErrorT)
This file provides evaluation semantics for `ExceptT ε m` compu... | @@ -209,8 +209,14 @@
refine tsum_congr fun r => ?_
cases r <;> simp
+lemma probOutput_liftM [LawfulMonad m] (mx : m α) (x : α) :
+ Pr[= x | (liftM mx : ExceptT ε m α)] = Pr[= x | mx] := by
+ rw [probOutput_eq]
+ exact probOutput_map_injective mx (fun a b h => by cases h; rfl) x
+
private lemma evalDist_li... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_2c7fc6b3fd0d_3 | d95fec4528518b3c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/EvalDist/Instances/ErrorT.lean | ErrorT | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "probFailure_liftM",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [probFailure_def, evalDist_liftM]",
"n_chars": 49,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomati... | [
{
"name": "evalDist_liftM",
"text": "private lemma evalDist_liftM [LawfulMonad m] (mx : m α) :\n 𝒟[(liftM mx : ExceptT ε m α)] = 𝒟[mx] :=\n SPMF.ext (probOutput_liftM mx)\n\n",
"fan_in": 2,
"n_lines": 5,
"n_chars": 146,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_... | [
{
"name": "probFailure_liftM",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 5,
"n_chars": 165,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nestin... | 3 | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.EvalDist.Monad.Map
import Mathlib.Control.Lawful
/-!
# Evaluation Semantics for ExceptT (ErrorT)
This file provides evaluation semantics for `ExceptT ε m` compu... | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.EvalDist.Monad.Map
import Mathlib.Control.Lawful
/-!
# Evaluation Semantics for ExceptT (ErrorT)
This file provides evaluation semantics for `ExceptT ε m` compu... | @@ -214,8 +214,13 @@
rw [probOutput_eq]
exact probOutput_map_injective mx (fun a b h => by cases h; rfl) x
+private lemma evalDist_liftM [LawfulMonad m] (mx : m α) :
+ 𝒟[(liftM mx : ExceptT ε m α)] = 𝒟[mx] :=
+ SPMF.ext (probOutput_liftM mx)
+
lemma probFailure_liftM [LawfulMonad m] (mx : m α) :
- Pr[... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_2c7fc6b3fd0d_4 | d4e0150becc5adb8 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/EvalDist/Instances/ErrorT.lean | ErrorT | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "probFailure_liftM",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [probFailure_def, evalDist_liftM]",
"n_chars": 49,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomati... | [
{
"name": "evalDist_liftM",
"text": "private lemma evalDist_liftM [LawfulMonad m] (mx : m α) :\n 𝒟[(liftM mx : ExceptT ε m α)] = 𝒟[mx] :=\n SPMF.ext (probOutput_liftM mx)\n\n",
"fan_in": 2,
"n_lines": 5,
"n_chars": 146,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_... | [
{
"name": "probEvent_liftM",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 5,
"n_chars": 172,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting"... | 3 | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.EvalDist.Monad.Map
import Mathlib.Control.Lawful
/-!
# Evaluation Semantics for ExceptT (ErrorT)
This file provides evaluation semantics for `ExceptT ε m` compu... | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.EvalDist.Monad.Map
import Mathlib.Control.Lawful
/-!
# Evaluation Semantics for ExceptT (ErrorT)
This file provides evaluation semantics for `ExceptT ε m` compu... | @@ -214,8 +214,13 @@
rw [probOutput_eq]
exact probOutput_map_injective mx (fun a b h => by cases h; rfl) x
+private lemma evalDist_liftM [LawfulMonad m] (mx : m α) :
+ 𝒟[(liftM mx : ExceptT ε m α)] = 𝒟[mx] :=
+ SPMF.ext (probOutput_liftM mx)
+
lemma probEvent_liftM [LawfulMonad m] (mx : m α) (p : α → 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_3788043f2f3e_0 | 54a73f9c84c0e429 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/OneTimePad/HeapPar.lean | HeapPar | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evalDist_run_encOncePair_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n QueryImpl.Stateful.DistEquiv.run₀_evalDist_eq\n (pairRealImpl_distEquiv_pairIdealImpl sp) (encOncePair sp m₁ m₂... | [
{
"name": "pairRealImpl_distEquiv_pairIdealImpl",
"text": "/-- **OTP two-channel unconditional distributional equivalence.**\nThe parallel real and ideal handlers produce identical output\ndistributions against every two-channel adversary.\n\nProof: feed the per-(query, heap) handler equality from\n`realImp... | [
{
"name": "evalDist_run_encOncePair_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 637,
"n_subproofs": 0,
"n_tactics": 2,
"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 Examples.OneTimePad.HeapBasic
import VCVio.StateSeparating.DistEquiv
/-!
# Two parallel OTP channels via `QueryImpl.Stateful.parSum`
Pilot demonstration of 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 Examples.OneTimePad.HeapBasic
import VCVio.StateSeparating.DistEquiv
/-!
# Two parallel OTP channels via `QueryImpl.Stateful.parSum`
Pilot demonstration of state-separ... | @@ -139,6 +139,22 @@
adversary, not just `encOncePair`. The one-call corollary is then
a `QueryImpl.Stateful.DistEquiv.run_evalDist_eq` specialisation. -/
+/-- **OTP two-channel unconditional distributional equivalence.**
+The parallel real and ideal handlers produce identical output
+distributions against every tw... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_1686ee1d432f_0 | 9b71eeb4ab7da01a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/MerkleTree/Inductive/Uniqueness.lean | Uniqueness | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "getPutativeRootWithHash_roots_ne_of_ne",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n fun heq => hne (getPutativeRootWithHash_unique h hinj idx proof₁ proof₂ x y heq).1",
"n_chars": 89,... | [
{
"name": "getPutativeRootWithHash_unique",
"text": "/-- **Merkle opening uniqueness.** When `h` is injective, two openings at the\n same leaf index that produce the same root must agree on both the leaf\n value and the entire authentication path.\n\n Proof: induction on the index. At each internal... | [
{
"name": "getPutativeRootWithHash_roots_ne_of_ne",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 609,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only":... | 1 | /-
Copyright (c) 2026 XC0R. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: XC0R
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.Binding
/-!
# Merkle Opening Uniqueness
When the hash function is injective (`Function.Injective2 h`), any two
openings at the same ... | /-
Copyright (c) 2026 XC0R. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: XC0R
-/
import VCVio.CryptoFoundations.MerkleTree.Inductive.Binding
/-!
# Merkle Opening Uniqueness
When the hash function is injective (`Function.Injective2 h`), any two
openings at the same ... | @@ -41,6 +41,37 @@
variable {α : Type _}
+/-- **Merkle opening uniqueness.** When `h` is injective, two openings at the
+ same leaf index that produce the same root must agree on both the leaf
+ value and the entire authentication path.
+
+ Proof: induction on the index. At each internal node, injectivity... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_4383d4b1e185_2 | 0c05995e66dc7e09 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Probability/ProbabilityMassFunction/RenyiDivergence.lean | RenyiDivergence | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 6 | [
{
"theorem_name": "renyiDiv_map_le",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [renyiDiv_eq_rpow ha]\n exact ENNReal.rpow_le_rpow (renyiMGF_map_le a ha.le f p q)\n (inv_nonneg.mpr (sub_non... | [
{
"name": "renyiDiv_eq_rpow",
"text": "theorem renyiDiv_eq_rpow {a : ℝ} (ha : 1 < a) (p q : PMF α) :\n p.renyiDiv a q = (p.renyiMGF a q) ^ ((a - 1)⁻¹ : ℝ) := by\n simp [PMF.renyiDiv, not_le.mpr ha]\n\n/-! ### Max-Divergence (Rényi order ∞) -/\n\n",
"fan_in": 6,
"n_lines": 7,
"n_chars": 216,
... | [
{
"name": "renyiDiv_prod",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 620,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting":... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Mathlib.Probability.ProbabilityMassFunction.Constructions
import Mathlib.Analysis.SpecialFunctions.Pow.NNReal
import ToMathlib.Analysis.MeanInequalities
import ToMathlib... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Mathlib.Probability.ProbabilityMassFunction.Constructions
import Mathlib.Analysis.SpecialFunctions.Pow.NNReal
import ToMathlib.Analysis.MeanInequalities
import ToMathlib... | @@ -98,6 +98,12 @@
· rfl
· simp
+theorem renyiDiv_eq_rpow {a : ℝ} (ha : 1 < a) (p q : PMF α) :
+ p.renyiDiv a q = (p.renyiMGF a q) ^ ((a - 1)⁻¹ : ℝ) := by
+ simp [PMF.renyiDiv, not_le.mpr ha]
+
+/-! ### Max-Divergence (Rényi order ∞) -/
+
/-- The max-divergence (Rényi divergence of order `∞`): `⨆ x, p(x) /... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_10b2270a7777_0 | a2155ef05d8ef84a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | HashSig/SLHDSA/WotsChecksum.lean | WotsChecksum | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 2 | [
{
"theorem_name": "fromBaseW_cons",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n change List.foldl (fun acc x => acc * w + x) 0 (d :: ds)\n = d * w ^ ds.length + List.foldl (fun acc x => acc * w + x) 0 ... | [
{
"name": "foldl_mul_add_shift",
"text": "private theorem foldl_mul_add_shift (w a : ℕ) (ds : List ℕ) :\n List.foldl (fun acc x => acc * w + x) a ds\n = a * w ^ ds.length + List.foldl (fun acc x => acc * w + x) 0 ds := by\n induction ds generalizing a with\n | nil => simp\n | cons d ds ih =>\n ... | [
{
"name": "fromBaseW_cons",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 327,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_nesting"... | 1 | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | /-
Copyright (c) 2026 Vitalik Buterin, Nicolas Consigny. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Vitalik Buterin, Nicolas Consigny
-/
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Tactic.Ring
/-!
# WOTS+ Checksum Incomparability
The combi... | @@ -42,9 +42,23 @@
@[simp]
theorem fromBaseW_nil (w : ℕ) : fromBaseW w [] = 0 := rfl
+private theorem foldl_mul_add_shift (w a : ℕ) (ds : List ℕ) :
+ List.foldl (fun acc x => acc * w + x) a ds
+ = a * w ^ ds.length + List.foldl (fun acc x => acc * w + x) 0 ds := by
+ induction ds generalizing a with
+ | n... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "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.