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_ddcadb3ad796_6 | c7ebc42a68d07ee1 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FujisakiOkamoto/UTransform.lean | UTransform | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "decaps_expectedQueryCost_le",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n HasQuery.expectedQueryCost_le_of_usesCostAtMost\n (decaps_usesWeightedQueryCostAtMost\n (runtime := runtim... | [
{
"name": "decaps_usesWeightedQueryCostAtMost",
"text": "/-- Under per-family upper bounds on the two U-transform oracle families, decapsulation incurs\nweighted query cost at most the sum of those bounds. -/\ntheorem decaps_usesWeightedQueryCostAtMost {ω : Type}\n [AddCommMonoid ω] [PartialOrder ω] [IsO... | [
{
"name": "decaps_expectedQueryCost_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 26,
"n_chars": 1331,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FujisakiOkamoto.TTransform
import VCVio.CryptoFoundations.KeyEncapMech
import VCVio.CryptoFoundations.PRF
import VCVio.OracleComp.Coercions.Add
i... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FujisakiOkamoto.TTransform
import VCVio.CryptoFoundations.KeyEncapMech
import VCVio.CryptoFoundations.PRF
import VCVio.OracleComp.Coercions.Add
i... | @@ -203,6 +203,47 @@
simp [HasQuery.Program.withAddCost, UTransform, FujisakiOkamoto.scheme, hdec,
AddWriterT.hasCost_iff, AddWriterT.outputs, AddWriterT.costs]
+/-- Under per-family upper bounds on the two U-transform oracle families, decapsulation incurs
+weighted query cost at most the sum of those bounds.... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_ddcadb3ad796_7 | 2fdf1122d3a8311e | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FujisakiOkamoto/UTransform.lean | UTransform | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "decaps_expectedQueryCost_le",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n HasQuery.expectedQueryCost_le_of_usesCostAtMost\n (decaps_usesWeightedQueryCostAtMost\n (runtime := runtim... | [
{
"name": "decaps_usesWeightedQueryCostAtMost",
"text": "/-- Under per-family upper bounds on the two U-transform oracle families, decapsulation incurs\nweighted query cost at most the sum of those bounds. -/\ntheorem decaps_usesWeightedQueryCostAtMost {ω : Type}\n [AddCommMonoid ω] [PartialOrder ω] [IsO... | [
{
"name": "decaps_usesAtMostTwoQueries",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 15,
"n_chars": 875,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FujisakiOkamoto.TTransform
import VCVio.CryptoFoundations.KeyEncapMech
import VCVio.CryptoFoundations.PRF
import VCVio.OracleComp.Coercions.Add
i... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FujisakiOkamoto.TTransform
import VCVio.CryptoFoundations.KeyEncapMech
import VCVio.CryptoFoundations.PRF
import VCVio.OracleComp.Coercions.Add
i... | @@ -203,6 +203,47 @@
simp [HasQuery.Program.withAddCost, UTransform, FujisakiOkamoto.scheme, hdec,
AddWriterT.hasCost_iff, AddWriterT.outputs, AddWriterT.costs]
+/-- Under per-family upper bounds on the two U-transform oracle families, decapsulation incurs
+weighted query cost at most the sum of those bounds.... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_ddcadb3ad796_8 | 2eb3597f2d15fac2 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FujisakiOkamoto/UTransform.lean | UTransform | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "decaps_expectedQueryCost_le",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n HasQuery.expectedQueryCost_le_of_usesCostAtMost\n (decaps_usesWeightedQueryCostAtMost\n (runtime := runtim... | [
{
"name": "decaps_usesWeightedQueryCostAtMost",
"text": "/-- Under per-family upper bounds on the two U-transform oracle families, decapsulation incurs\nweighted query cost at most the sum of those bounds. -/\ntheorem decaps_usesWeightedQueryCostAtMost {ω : Type}\n [AddCommMonoid ω] [PartialOrder ω] [IsO... | [
{
"name": "decaps_expectedQueries_le_two",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 15,
"n_chars": 809,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 3 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FujisakiOkamoto.TTransform
import VCVio.CryptoFoundations.KeyEncapMech
import VCVio.CryptoFoundations.PRF
import VCVio.OracleComp.Coercions.Add
i... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.FujisakiOkamoto.TTransform
import VCVio.CryptoFoundations.KeyEncapMech
import VCVio.CryptoFoundations.PRF
import VCVio.OracleComp.Coercions.Add
i... | @@ -203,6 +203,47 @@
simp [HasQuery.Program.withAddCost, UTransform, FujisakiOkamoto.scheme, hdec,
AddWriterT.hasCost_iff, AddWriterT.outputs, AddWriterT.costs]
+/-- Under per-family upper bounds on the two U-transform oracle families, decapsulation incurs
+weighted query cost at most the sum of those bounds.... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_d63f6480a10e_7 | 48f1895e2cde9b0b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/CommitmentScheme/Hiding/LoggingBounds/QuerySalt.lean | QuerySalt | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "wp_querySaltIndicator_cached_logging_cacheQuery_eq_of_no_other_salt_entries",
"depth": 1,
"n_commands": 0,
"n_lines": 164,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing cache₀... | [
{
"name": "cacheQuery_swap_of_ne",
"text": "lemma cacheQuery_swap_of_ne\n (cache : QueryCache (CMOracle M S C))\n {t₀ t₁ : (CMOracle M S C).Domain}\n (u₀ u₁ : C)\n (hne : t₀ ≠ t₁) :\n (cache.cacheQuery t₀ u₀).cacheQuery t₁ u₁ =\n (cache.cacheQuery t₁ u₁).cacheQuery t₀ u₀ := by\n ext t\n... | [
{
"name": "wp_querySaltIndicator_cached_logging_cacheQuery_eq_of_no_other_salt_entries",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 183,
"n_chars": 10026,
"n_subproofs": 14,
"n_tactics": 164,
"cyclomatic": 3,
"n_automation": 18,
"n_rewrites": 13,
... | 3 | /-
Copyright (c) 2026 James Waters. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: James Waters
-/
import Examples.CommitmentScheme.Hiding.LoggingBounds.Average
/-!
# Query-Salt Logging Bounds
Bounds on the probability that the adversary's salt-specific query count
e... | /-
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.Average
/-!
# Query-Salt Logging Bounds
Bounds on the probability that the adversary's salt-specific query count
e... | @@ -23,6 +23,22 @@
attribute [local instance] Fintype.ofFinite
+lemma cacheQuery_swap_of_ne
+ (cache : QueryCache (CMOracle M S C))
+ {t₀ t₁ : (CMOracle M S C).Domain}
+ (u₀ u₁ : C)
+ (hne : t₀ ≠ t₁) :
+ (cache.cacheQuery t₀ u₀).cacheQuery t₁ u₁ =
+ (cache.cacheQuery t₁ u₁).cacheQuery t₀ u₀ := ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_d63f6480a10e_8 | 14d3acd3dadd43e8 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/CommitmentScheme/Hiding/LoggingBounds/QuerySalt.lean | QuerySalt | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "wp_querySaltIndicator_cached_logging_cacheQuery_eq_of_no_other_salt_entries",
"depth": 1,
"n_commands": 0,
"n_lines": 164,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing cache₀... | [
{
"name": "cacheQuery_swap_of_ne",
"text": "lemma cacheQuery_swap_of_ne\n (cache : QueryCache (CMOracle M S C))\n {t₀ t₁ : (CMOracle M S C).Domain}\n (u₀ u₁ : C)\n (hne : t₀ ≠ t₁) :\n (cache.cacheQuery t₀ u₀).cacheQuery t₁ u₁ =\n (cache.cacheQuery t₁ u₁).cacheQuery t₀ u₀ := by\n ext t\n... | [
{
"name": "wp_querySaltIndicator_cached_logging_freshCache_eq_common",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 33,
"n_chars": 1622,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 4,
... | 4 | /-
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.Average
/-!
# Query-Salt Logging Bounds
Bounds on the probability that the adversary's salt-specific query count
e... | /-
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.Average
/-!
# Query-Salt Logging Bounds
Bounds on the probability that the adversary's salt-specific query count
e... | @@ -23,6 +23,22 @@
attribute [local instance] Fintype.ofFinite
+lemma cacheQuery_swap_of_ne
+ (cache : QueryCache (CMOracle M S C))
+ {t₀ t₁ : (CMOracle M S C).Domain}
+ (u₀ u₁ : C)
+ (hne : t₀ ≠ t₁) :
+ (cache.cacheQuery t₀ u₀).cacheQuery t₁ u₁ =
+ (cache.cacheQuery t₁ u₁).cacheQuery t₀ u₀ := ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e408921c2afe_0 | 376e42f074c8f170 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/OneTimePad/LeakageFree.lean | LeakageFree | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "otp_probLeakFree",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Leakage.traceNoninterference_implies_probLeakFree (otp_traceNoninterference sp msg₀ msg₁)",
"n_chars": 96,
"n_subproo... | [
{
"name": "otp_traceNoninterference",
"text": "/-- The traced OTP satisfies exact trace noninterference: encrypting any two messages\nproduces identical observation traces. -/\ntheorem otp_traceNoninterference (sp : ℕ) (msg₀ msg₁ : BitVec sp) :\n Leakage.TraceNoninterference (tracedEncrypt sp msg₀) (trac... | [
{
"name": "otp_probLeakFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 361,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nestin... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Examples.OneTimePad.Basic
import VCVio.ProgramLogic.Relational.Leakage
/-!
# OTP Side-Channel Leakage Analysis
This file proves that the one-time pad is leak-free unde... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Examples.OneTimePad.Basic
import VCVio.ProgramLogic.Relational.Leakage
/-!
# OTP Side-Channel Leakage Analysis
This file proves that the one-time pad is leak-free unde... | @@ -50,10 +50,19 @@
return (key ^^^ msg, ()) := by
simp [tracedEncrypt, encryptMsg, oneTimePad]
+/-- The traced OTP satisfies exact trace noninterference: encrypting any two messages
+produces identical observation traces. -/
+theorem otp_traceNoninterference (sp : ℕ) (msg₀ msg₁ : BitVec sp) :
+ Leakage.... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e408921c2afe_1 | 32c4e295b2977df5 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/OneTimePad/LeakageFree.lean | LeakageFree | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "otp_probLeakFree",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Leakage.traceNoninterference_implies_probLeakFree (otp_traceNoninterference sp msg₀ msg₁)",
"n_chars": 96,
"n_subproo... | [
{
"name": "otp_traceNoninterference",
"text": "/-- The traced OTP satisfies exact trace noninterference: encrypting any two messages\nproduces identical observation traces. -/\ntheorem otp_traceNoninterference (sp : ℕ) (msg₀ msg₁ : BitVec sp) :\n Leakage.TraceNoninterference (tracedEncrypt sp msg₀) (trac... | [
{
"name": "otp_traceNoninterference_post",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 451,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Examples.OneTimePad.Basic
import VCVio.ProgramLogic.Relational.Leakage
/-!
# OTP Side-Channel Leakage Analysis
This file proves that the one-time pad is leak-free unde... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Examples.OneTimePad.Basic
import VCVio.ProgramLogic.Relational.Leakage
/-!
# OTP Side-Channel Leakage Analysis
This file proves that the one-time pad is leak-free unde... | @@ -50,12 +50,21 @@
return (key ^^^ msg, ()) := by
simp [tracedEncrypt, encryptMsg, oneTimePad]
+/-- The traced OTP satisfies exact trace noninterference: encrypting any two messages
+produces identical observation traces. -/
+theorem otp_traceNoninterference (sp : ℕ) (msg₀ msg₁ : BitVec sp) :
+ Leakage.... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_cc4032cae30b_0 | b2e597130d8b65df | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/StateSeparating/DistEquiv.lean | DistEquiv | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "runProb₀_evalDist_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa only [runProb₀] using run₀_evalDist_eq h A",
"n_chars": 58,
"n_subproofs": 0,
"n_tactics": 2,
"c... | [
{
"name": "run₀_evalDist_eq",
"text": "theorem run₀_evalDist_eq\n {h₀ : QueryImpl.Stateful I E σ₀} {h₁ : QueryImpl.Stateful I E σ₁}\n [Inhabited σ₀] [Inhabited σ₁]\n (h : h₀ ≡ᵈ₀ h₁) {α : Type} (A : OracleComp E α) :\n 𝒟[h₀.run₀ A] = 𝒟[h₁.run₀ A] :=\n h A\n\n",
"fan_in": 1,
"n_lines": ... | [
{
"name": "runProb₀_evalDist_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 347,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nes... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.StateSeparating.Advantage
/-!
# State-separating handlers: distributional equivalence
`QueryImpl.Stateful.DistEquiv h₀ s₀ h₁ s₁` says that two stateful handlers,... | /-
Copyright (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.Advantage
/-!
# State-separating handlers: distributional equivalence
`QueryImpl.Stateful.DistEquiv h₀ s₀ h₁ s₁` says that two stateful handlers,... | @@ -48,11 +48,19 @@
variable {σ σ₀ σ₁ σ₂ : Type}
variable [IsUniformSpec I]
+theorem run₀_evalDist_eq
+ {h₀ : QueryImpl.Stateful I E σ₀} {h₁ : QueryImpl.Stateful I E σ₁}
+ [Inhabited σ₀] [Inhabited σ₁]
+ (h : h₀ ≡ᵈ₀ h₁) {α : Type} (A : OracleComp E α) :
+ 𝒟[h₀.run₀ A] = 𝒟[h₁.run₀ A] :=
+ h A
+
theor... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_cc4032cae30b_1 | 010f8432e3cdb307 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/StateSeparating/DistEquiv.lean | DistEquiv | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "of_step",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro α A\n simp only [QueryImpl.Stateful.run, StateT.run'_eq, evalDist_map]\n exact congrArg _ (simulateQ_StateT_evalDist_congr_... | [
{
"name": "simulateQ_StateT_evalDist_congr_import",
"text": "private lemma simulateQ_StateT_evalDist_congr_import {α : Type}\n {h₀ h₁ : QueryImpl E (StateT σ (OracleComp I))}\n (hh : ∀ (q : E.Domain) (s : σ),\n 𝒟[(h₀ q).run s] = 𝒟[(h₁ q).run s])\n (A : OracleComp E α) (s : σ) :\n 𝒟[(simu... | [
{
"name": "of_step",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 370,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"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.Advantage
/-!
# State-separating handlers: distributional equivalence
`QueryImpl.Stateful.DistEquiv h₀ s₀ h₁ s₁` says that two stateful handlers,... | /-
Copyright (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.Advantage
/-!
# State-separating handlers: distributional equivalence
`QueryImpl.Stateful.DistEquiv h₀ s₀ h₁ s₁` says that two stateful handlers,... | @@ -48,12 +48,30 @@
variable {σ σ₀ σ₁ σ₂ : Type}
variable [IsUniformSpec I]
+private lemma simulateQ_StateT_evalDist_congr_import {α : Type}
+ {h₀ h₁ : QueryImpl E (StateT σ (OracleComp I))}
+ (hh : ∀ (q : E.Domain) (s : σ),
+ 𝒟[(h₀ q).run s] = 𝒟[(h₁ q).run s])
+ (A : OracleComp E α) (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_cc4032cae30b_2 | 7d16223826ef6154 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/StateSeparating/DistEquiv.lean | DistEquiv | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "advantage_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [advantage_left h h₁ s₁ A, advantage_self]",
"n_chars": 55,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic... | [
{
"name": "advantage_left",
"text": "theorem advantage_left\n {h₀ : QueryImpl.Stateful unifSpec E σ₀} {s₀ : σ₀}\n {h₀' : QueryImpl.Stateful unifSpec E σ} {s₀' : σ}\n (h : (h₀, s₀) ≡ᵈ (h₀', s₀'))\n (h₁ : QueryImpl.Stateful unifSpec E σ₁) (s₁ : σ₁) (A : OracleComp E Bool) :\n h₀.advantage s₀ h₁... | [
{
"name": "advantage_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 356,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.StateSeparating.Advantage
/-!
# State-separating handlers: distributional equivalence
`QueryImpl.Stateful.DistEquiv h₀ s₀ h₁ s₁` says that two stateful handlers,... | /-
Copyright (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.Advantage
/-!
# State-separating handlers: distributional equivalence
`QueryImpl.Stateful.DistEquiv h₀ s₀ h₁ s₁` says that two stateful handlers,... | @@ -48,11 +48,20 @@
variable {σ σ₀ σ₁ σ₂ : Type}
variable [IsUniformSpec I]
+theorem advantage_left
+ {h₀ : QueryImpl.Stateful unifSpec E σ₀} {s₀ : σ₀}
+ {h₀' : QueryImpl.Stateful unifSpec E σ} {s₀' : σ}
+ (h : (h₀, s₀) ≡ᵈ (h₀', s₀'))
+ (h₁ : QueryImpl.Stateful unifSpec E σ₁) (s₁ : σ₁) (A : OracleComp 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_cc4032cae30b_3 | 04aa3be57136f847 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/StateSeparating/DistEquiv.lean | DistEquiv | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "parSum_congr",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine of_step ?_ (s₁, s₂)\n intro q s\n rcases q with t | t\n · exact evalDist_map_eq_of_evalDist_eq\n ((evalDist_lif... | [
{
"name": "trans",
"text": "protected theorem trans\n {h₀ : QueryImpl.Stateful I E σ₀} {s₀ : σ₀}\n {h₁ : QueryImpl.Stateful I E σ₁} {s₁ : σ₁}\n {h₂ : QueryImpl.Stateful I E σ₂} {s₂ : σ₂}\n (h₀₁ : (h₀, s₀) ≡ᵈ (h₁, s₁)) (h₁₂ : (h₁, s₁) ≡ᵈ (h₂, s₂)) :\n (h₀, s₀) ≡ᵈ (h₂, s₂) :=\n fun A => (h₀₁ A... | [
{
"name": "parSum_congr",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 19,
"n_chars": 880,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 5,
"automation_only": false,
"max_nesting":... | 3 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.StateSeparating.Advantage
/-!
# State-separating handlers: distributional equivalence
`QueryImpl.Stateful.DistEquiv h₀ s₀ h₁ s₁` says that two stateful handlers,... | /-
Copyright (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.Advantage
/-!
# State-separating handlers: distributional equivalence
`QueryImpl.Stateful.DistEquiv h₀ s₀ h₁ s₁` says that two stateful handlers,... | @@ -69,6 +69,16 @@
(h : (h₀, s₀) ≡ᵈ (h₁, s₁)) : (h₁, s₁) ≡ᵈ (h₀, s₀) :=
fun A => (h A).symm
+protected theorem trans
+ {h₀ : QueryImpl.Stateful I E σ₀} {s₀ : σ₀}
+ {h₁ : QueryImpl.Stateful I E σ₁} {s₁ : σ₁}
+ {h₂ : QueryImpl.Stateful I E σ₂} {s₂ : σ₂}
+ (h₀₁ : (h₀, s₀) ≡ᵈ (h₁, s₁)) (h₁₂ : (h₁, 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_a97c766bf2ba_0 | e8196c06b065e49d | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/ObservationOracle.lean | ObservationOracle | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 4 | [
{
"theorem_name": "probFailure_runObs",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← fst_map_runObs base encode oa, probFailure_map]",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "fst_map_runObs",
"text": "/-- Erasure theorem: projecting away the observation trace recovers the erased computation. -/\ntheorem fst_map_runObs [LawfulMonad m] (base : QueryImpl spec m) (encode : Ev → ω)\n (oa : OracleComp (spec + ObsSpec Ev) α) :\n (fun z : α × ω => z.1) <$> runObs base e... | [
{
"name": "probFailure_runObs",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 397,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nest... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.WriterT
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQuery.Basic
import VCVio.OracleComp.QueryTracking.CountingOracle
/-!
# Observ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.WriterT
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQuery.Basic
import VCVio.OracleComp.QueryTracking.CountingOracle
/-!
# Observ... | @@ -142,10 +142,17 @@
lemma runObs_pure (base : QueryImpl spec m) (encode : Ev → ω) (x : α) :
runObs base encode (pure x) = pure (x, 1) := rfl
+/-- Erasure theorem: projecting away the observation trace recovers the erased computation. -/
+theorem fst_map_runObs [LawfulMonad m] (base : QueryImpl spec m) (encode... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_a97c766bf2ba_1 | 17b0533e6565ff36 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/ObservationOracle.lean | ObservationOracle | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 4 | [
{
"theorem_name": "probFailure_runObs",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← fst_map_runObs base encode oa, probFailure_map]",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "fst_map_runObs",
"text": "/-- Erasure theorem: projecting away the observation trace recovers the erased computation. -/\ntheorem fst_map_runObs [LawfulMonad m] (base : QueryImpl spec m) (encode : Ev → ω)\n (oa : OracleComp (spec + ObsSpec Ev) α) :\n (fun z : α × ω => z.1) <$> runObs base e... | [
{
"name": "evalDist_fst_runObs",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 298,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nes... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.WriterT
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQuery.Basic
import VCVio.OracleComp.QueryTracking.CountingOracle
/-!
# Observ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.WriterT
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQuery.Basic
import VCVio.OracleComp.QueryTracking.CountingOracle
/-!
# Observ... | @@ -142,10 +142,17 @@
lemma runObs_pure (base : QueryImpl spec m) (encode : Ev → ω) (x : α) :
runObs base encode (pure x) = pure (x, 1) := rfl
+/-- Erasure theorem: projecting away the observation trace recovers the erased computation. -/
+theorem fst_map_runObs [LawfulMonad m] (base : QueryImpl spec m) (encode... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_a97c766bf2ba_2 | cbb9c555d7b0508c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/ObservationOracle.lean | ObservationOracle | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 4 | [
{
"theorem_name": "probFailure_runObs",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← fst_map_runObs base encode oa, probFailure_map]",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "fst_map_runObs",
"text": "/-- Erasure theorem: projecting away the observation trace recovers the erased computation. -/\ntheorem fst_map_runObs [LawfulMonad m] (base : QueryImpl spec m) (encode : Ev → ω)\n (oa : OracleComp (spec + ObsSpec Ev) α) :\n (fun z : α × ω => z.1) <$> runObs base e... | [
{
"name": "probOutput_fst_runObs",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 317,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_n... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.WriterT
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQuery.Basic
import VCVio.OracleComp.QueryTracking.CountingOracle
/-!
# Observ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.WriterT
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQuery.Basic
import VCVio.OracleComp.QueryTracking.CountingOracle
/-!
# Observ... | @@ -142,10 +142,17 @@
lemma runObs_pure (base : QueryImpl spec m) (encode : Ev → ω) (x : α) :
runObs base encode (pure x) = pure (x, 1) := rfl
+/-- Erasure theorem: projecting away the observation trace recovers the erased computation. -/
+theorem fst_map_runObs [LawfulMonad m] (base : QueryImpl spec m) (encode... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_a97c766bf2ba_3 | 0f182daa8d74f46b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/ObservationOracle.lean | ObservationOracle | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 4 | [
{
"theorem_name": "probFailure_runObs",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← fst_map_runObs base encode oa, probFailure_map]",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "fst_map_runObs",
"text": "/-- Erasure theorem: projecting away the observation trace recovers the erased computation. -/\ntheorem fst_map_runObs [LawfulMonad m] (base : QueryImpl spec m) (encode : Ev → ω)\n (oa : OracleComp (spec + ObsSpec Ev) α) :\n (fun z : α × ω => z.1) <$> runObs base e... | [
{
"name": "support_fst_runObs",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 322,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nest... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.WriterT
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQuery.Basic
import VCVio.OracleComp.QueryTracking.CountingOracle
/-!
# Observ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.WriterT
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQuery.Basic
import VCVio.OracleComp.QueryTracking.CountingOracle
/-!
# Observ... | @@ -142,10 +142,17 @@
lemma runObs_pure (base : QueryImpl spec m) (encode : Ev → ω) (x : α) :
runObs base encode (pure x) = pure (x, 1) := rfl
+/-- Erasure theorem: projecting away the observation trace recovers the erased computation. -/
+theorem fst_map_runObs [LawfulMonad m] (base : QueryImpl spec m) (encode... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_a97c766bf2ba_4 | 4b4d1943cc0daf7d | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/ObservationOracle.lean | ObservationOracle | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "runObs_liftComp",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n change runObs base encode (liftComp oa (spec + ObsSpec Ev)) = _\n induction oa using OracleComp.inductionOn with\n | pure... | [
{
"name": "runObs_liftM_query_inl",
"text": "/-- `runObs` on a single base-spec query lifted into `spec + ObsSpec Ev`: the trace is `1`. -/\n@[simp]\nlemma runObs_liftM_query_inl [LawfulMonad m] (base : QueryImpl spec m)\n (encode : Ev → ω) (t : spec.Domain) :\n runObs base encode ((liftM (OracleSpec.... | [
{
"name": "runObs_liftComp",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 735,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.WriterT
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQuery.Basic
import VCVio.OracleComp.QueryTracking.CountingOracle
/-!
# Observ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.WriterT
import VCVio.OracleComp.Coercions.Add
import VCVio.OracleComp.HasQuery.Basic
import VCVio.OracleComp.QueryTracking.CountingOracle
/-!
# Observ... | @@ -184,6 +184,17 @@
runObs base encode (f <$> oa) = Prod.map f id <$> runObs base encode oa := by
simp only [runObs, simulateQ_map, WriterT.run_map']
+/-- `runObs` on a single base-spec query lifted into `spec + ObsSpec Ev`: the trace is `1`. -/
+@[simp]
+lemma runObs_liftM_query_inl [LawfulMonad m] (base : ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_dc77018dd1cb_0 | 8872a56fe26fcb39 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/StdDoBridge.lean | StdDoBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "wpProp_iff_forall_support",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [wpProp_iff_probEvent_eq_one]",
"n_chars": 40,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic... | [
{
"name": "wpProp_iff_probEvent_eq_one",
"text": "/-- Adequacy bridge between `wpProp` and event probability `= 1`. -/\ntheorem wpProp_iff_probEvent_eq_one (oa : OracleComp spec α) (p : α → Prop) :\n wpProp (spec := spec) oa p ↔ Pr[ p | oa] = 1 := by\n classical\n simp [wpProp, OracleComp.ProgramLogic.... | [
{
"name": "wpProp_iff_forall_support",
"fan_in": 6,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 271,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"ma... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Std.Tactic.Do
import VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.ProgramLogic.Unary.WriterTBridge
/-!
# `Std.Do` / `mvcgen` bridge for `OracleComp`
This module ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Std.Tactic.Do
import VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.ProgramLogic.Unary.WriterTBridge
/-!
# `Std.Do` / `mvcgen` bridge for `OracleComp`
This module ... | @@ -36,9 +36,16 @@
def tripleProp (pre : Prop) (oa : OracleComp spec α) (post : α → Prop) : Prop :=
pre → wpProp (spec := spec) oa post
+/-- Adequacy bridge between `wpProp` and event probability `= 1`. -/
+theorem wpProp_iff_probEvent_eq_one (oa : OracleComp spec α) (p : α → Prop) :
+ wpProp (spec := spec) oa... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_dc77018dd1cb_1 | 1e23b633a047efba | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/StdDoBridge.lean | StdDoBridge | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 6 | [
{
"theorem_name": "wpProp_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [wpProp_iff_forall_support]",
"n_chars": 38,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_aut... | [
{
"name": "wpProp_iff_forall_support",
"text": "/-- Support-based characterization of almost-sure postconditions for `OracleComp`. -/\ntheorem wpProp_iff_forall_support (oa : OracleComp spec α) (p : α → Prop) :\n wpProp (spec := spec) oa p ↔ ∀ x ∈ support oa, p x := by\n simp [wpProp_iff_probEvent_eq_on... | [
{
"name": "wpProp_pure",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 6,
"n_chars": 190,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": 2
... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Std.Tactic.Do
import VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.ProgramLogic.Unary.WriterTBridge
/-!
# `Std.Do` / `mvcgen` bridge for `OracleComp`
This module ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Std.Tactic.Do
import VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.ProgramLogic.Unary.WriterTBridge
/-!
# `Std.Do` / `mvcgen` bridge for `OracleComp`
This module ... | @@ -42,17 +42,25 @@
classical
simp [wpProp, OracleComp.ProgramLogic.probEvent_eq_wp_indicator (spec := spec) oa p]
+/-- Support-based characterization of almost-sure postconditions for `OracleComp`. -/
+theorem wpProp_iff_forall_support (oa : OracleComp spec α) (p : α → Prop) :
+ wpProp (spec := spec) oa p ↔... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_dc77018dd1cb_2 | 6205cc09c7bc09a2 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/StdDoBridge.lean | StdDoBridge | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 6 | [
{
"theorem_name": "wpProp_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [wpProp_iff_forall_support]",
"n_chars": 38,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_aut... | [
{
"name": "wpProp_iff_forall_support",
"text": "/-- Support-based characterization of almost-sure postconditions for `OracleComp`. -/\ntheorem wpProp_iff_forall_support (oa : OracleComp spec α) (p : α → Prop) :\n wpProp (spec := spec) oa p ↔ ∀ x ∈ support oa, p x := by\n simp [wpProp_iff_probEvent_eq_on... | [
{
"name": "triple_stateT_iff_forall_support",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 18,
"n_chars": 850,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 1,
"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 Std.Tactic.Do
import VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.ProgramLogic.Unary.WriterTBridge
/-!
# `Std.Do` / `mvcgen` bridge for `OracleComp`
This module ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Std.Tactic.Do
import VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.ProgramLogic.Unary.WriterTBridge
/-!
# `Std.Do` / `mvcgen` bridge for `OracleComp`
This module ... | @@ -42,17 +42,25 @@
classical
simp [wpProp, OracleComp.ProgramLogic.probEvent_eq_wp_indicator (spec := spec) oa p]
+/-- Support-based characterization of almost-sure postconditions for `OracleComp`. -/
+theorem wpProp_iff_forall_support (oa : OracleComp spec α) (p : α → Prop) :
+ wpProp (spec := spec) oa p ↔... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_dc77018dd1cb_3 | f5af2c2fd77e20e6 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/StdDoBridge.lean | StdDoBridge | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 6 | [
{
"theorem_name": "wpProp_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [wpProp_iff_forall_support]",
"n_chars": 38,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_aut... | [
{
"name": "wpProp_iff_forall_support",
"text": "/-- Support-based characterization of almost-sure postconditions for `OracleComp`. -/\ntheorem wpProp_iff_forall_support (oa : OracleComp spec α) (p : α → Prop) :\n wpProp (spec := spec) oa p ↔ ∀ x ∈ support oa, p x := by\n simp [wpProp_iff_probEvent_eq_on... | [
{
"name": "triple_writerT_iff_forall_support",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 25,
"n_chars": 1270,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": fal... | 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 Std.Tactic.Do
import VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.ProgramLogic.Unary.WriterTBridge
/-!
# `Std.Do` / `mvcgen` bridge for `OracleComp`
This module ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Std.Tactic.Do
import VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.ProgramLogic.Unary.WriterTBridge
/-!
# `Std.Do` / `mvcgen` bridge for `OracleComp`
This module ... | @@ -42,17 +42,25 @@
classical
simp [wpProp, OracleComp.ProgramLogic.probEvent_eq_wp_indicator (spec := spec) oa p]
+/-- Support-based characterization of almost-sure postconditions for `OracleComp`. -/
+theorem wpProp_iff_forall_support (oa : OracleComp spec α) (p : α → Prop) :
+ wpProp (spec := spec) oa p ↔... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_dc77018dd1cb_4 | b689f6824bc3325f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Unary/StdDoBridge.lean | StdDoBridge | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 6 | [
{
"theorem_name": "wpProp_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [wpProp_iff_forall_support]",
"n_chars": 38,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_aut... | [
{
"name": "wpProp_iff_forall_support",
"text": "/-- Support-based characterization of almost-sure postconditions for `OracleComp`. -/\ntheorem wpProp_iff_forall_support (oa : OracleComp spec α) (p : α → Prop) :\n wpProp (spec := spec) oa p ↔ ∀ x ∈ support oa, p x := by\n simp [wpProp_iff_probEvent_eq_on... | [
{
"name": "triple_writerT_iff_forall_support_monoid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 24,
"n_chars": 1214,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 1,
"automation_onl... | 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 Std.Tactic.Do
import VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.ProgramLogic.Unary.WriterTBridge
/-!
# `Std.Do` / `mvcgen` bridge for `OracleComp`
This module ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Std.Tactic.Do
import VCVio.ProgramLogic.Unary.HoareTriple
import VCVio.ProgramLogic.Unary.WriterTBridge
/-!
# `Std.Do` / `mvcgen` bridge for `OracleComp`
This module ... | @@ -42,17 +42,25 @@
classical
simp [wpProp, OracleComp.ProgramLogic.probEvent_eq_wp_indicator (spec := spec) oa p]
+/-- Support-based characterization of almost-sure postconditions for `OracleComp`. -/
+theorem wpProp_iff_forall_support (oa : OracleComp spec α) (p : α → Prop) :
+ wpProp (spec := spec) oa p ↔... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_9100df511da4_4 | 97b3a077b33cd172 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/CommitmentScheme/Extractability.lean | Extractability | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "extractability_win_le_textbook_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 53,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let commitPart := (simulateQ loggingOracle A.commit).run\n let restPart := fun (x : (C × AUX) × Quer... | [
{
"name": "extractabilityGame_eq",
"text": "/-- The extractability game equals `simulateQ cachingOracle` on `extractabilityInner`. -/\nprivate lemma extractabilityGame_eq {t : ℕ} (A : ExtractAdversary M S C AUX t) :\n extractabilityGame CMExtract A =\n (simulateQ cachingOracle (extractabilityInner A))... | [
{
"name": "extractability_win_le_textbook_bound",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 60,
"n_chars": 3311,
"n_subproofs": 4,
"n_tactics": 53,
"cyclomatic": 2,
"n_automation": 8,
"n_rewrites": 1,
"n_structural": 2,
"automation_only":... | 5 | /-
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.Common
import ToMathlib.Data.ENNReal.Gauss
/-!
# Extractability for the random-oracle commitment scheme
Witness extractability for the ... | /-
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.Common
import ToMathlib.Data.ENNReal.Gauss
/-!
# Extractability for the random-oracle commitment scheme
Witness extractability for the ... | @@ -130,6 +130,11 @@
| some (m', s') => (c == cm) && decide ((m', s') ≠ (m, s))
| none => (c == cm))
+/-- The extractability game equals `simulateQ cachingOracle` on `extractabilityInner`. -/
+private lemma extractabilityGame_eq {t : ℕ} (A : ExtractAdversary M S C AUX t) :
+ extractabilityGame CMExtract ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_9100df511da4_5 | 292a396c4d7bdc12 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/CommitmentScheme/Extractability.lean | Extractability | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "extractability_win_le_textbook_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 53,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let commitPart := (simulateQ loggingOracle A.commit).run\n let restPart := fun (x : (C × AUX) × Quer... | [
{
"name": "extractabilityGame_eq",
"text": "/-- The extractability game equals `simulateQ cachingOracle` on `extractabilityInner`. -/\nprivate lemma extractabilityGame_eq {t : ℕ} (A : ExtractAdversary M S C AUX t) :\n extractabilityGame CMExtract A =\n (simulateQ cachingOracle (extractabilityInner A))... | [
{
"name": "extractability_bound",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 36,
"n_chars": 1822,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_... | 6 | /-
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.Common
import ToMathlib.Data.ENNReal.Gauss
/-!
# Extractability for the random-oracle commitment scheme
Witness extractability for the ... | /-
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.Common
import ToMathlib.Data.ENNReal.Gauss
/-!
# Extractability for the random-oracle commitment scheme
Witness extractability for the ... | @@ -130,6 +130,11 @@
| some (m', s') => (c == cm) && decide ((m', s') ≠ (m, s))
| none => (c == cm))
+/-- The extractability game equals `simulateQ cachingOracle` on `extractabilityInner`. -/
+private lemma extractabilityGame_eq {t : ℕ} (A : ExtractAdversary M S C AUX t) :
+ extractabilityGame CMExtract ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_78258e16ed44_0 | e055faa1ab92657c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Combinatorics/FinPairs.lean | FinPairs | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "card_filter_fst_lt_snd",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [card_filter_fst_lt_snd_eq_sum_range n, Nat.choose_two_right, Finset.sum_range_id]",
"n_chars": 91,
"n_su... | [
{
"name": "card_filter_fst_lt_snd_eq_sum_range",
"text": "/-- The strictly-increasing pairs over `Fin m` are counted by the Gauss sum `∑_{k < m} k`. -/\ntheorem card_filter_fst_lt_snd_eq_sum_range (m : ℕ) :\n (univ.filter (fun p : Fin m × Fin m => p.1 < p.2)).card = ∑ k ∈ range m, k := by\n induction m ... | [
{
"name": "card_filter_fst_lt_snd",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 343,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_... | 1 | /-
Copyright (c) 2026 James Waters. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: James Waters, Bolton Bailey
-/
module
public import Mathlib.Data.Nat.Choose.Basic
public import Mathlib.Algebra.BigOperators.Intervals
public import Mathlib.Order.Fin.Basic
/-!
# Count... | /-
Copyright (c) 2026 James Waters. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: James Waters, Bolton Bailey
-/
module
public import Mathlib.Data.Nat.Choose.Basic
public import Mathlib.Algebra.BigOperators.Intervals
public import Mathlib.Order.Fin.Basic
/-!
# Count... | @@ -24,10 +24,75 @@
namespace Finset
+/-- The strictly-increasing pairs over `Fin m` are counted by the Gauss sum `∑_{k < m} k`. -/
+theorem card_filter_fst_lt_snd_eq_sum_range (m : ℕ) :
+ (univ.filter (fun p : Fin m × Fin m => p.1 < p.2)).card = ∑ k ∈ range m, k := by
+ induction m with
+ | zero => simp
+ |... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_acaeebb9eb3c_0 | e8c172a88ade81ec | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/SecExp.lean | SecExp | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "ProbComp.boolBiasAdvantage_bind_uniformBool_eq_boolDistAdvantage",
"depth": 1,
"n_commands": 0,
"n_lines": 41,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let game : ProbComp Bool := do\n let a ← pref\n let b ← ($ᵗ Bool)\n... | [
{
"name": "ProbComp.boolBiasAdvantage_eq_boolDistAdvantage_uniformBool_branch",
"text": "/-- A hidden-bit guessing game over two Boolean branches has bias exactly equal to the\ndistinguishing advantage between those two branches. -/\nlemma ProbComp.boolBiasAdvantage_eq_boolDistAdvantage_uniformBool_branch\n... | [
{
"name": "ProbComp.boolBiasAdvantage_bind_uniformBool_eq_boolDistAdvantage",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 57,
"n_chars": 1947,
"n_subproofs": 1,
"n_tactics": 42,
"cyclomatic": 3,
"n_automation": 3,
"n_rewrites": 4,
"n_structural... | 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.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.Semantics
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.Constructions.SampleableType
import ... | /-
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.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.Semantics
import VCVio.EvalDist.TVDist
import VCVio.OracleComp.Constructions.SampleableType
import ... | @@ -75,6 +75,19 @@
2 * ((Pr[= true | p]).toReal - 1 / 2) by ring,
abs_mul, abs_two]
+/-- A hidden-bit guessing game over two Boolean branches has bias exactly equal to the
+distinguishing advantage between those two branches. -/
+lemma ProbComp.boolBiasAdvantage_eq_boolDistAdvantage_uniformBool_branch
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_065ca75b6f22_0 | 080de66a7306e4d0 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Probability/ProbabilityMassFunction/TotalVariation.lean | TotalVariation | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 2 | [
{
"theorem_name": "etvDist_ne_top",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n ne_top_of_le_ne_top one_ne_top (etvDist_le_one p q)",
"n_chars": 54,
"n_subproofs": 0,
"n_tactics": 1,
"cycloma... | [
{
"name": "etvDist_le_one",
"text": "lemma etvDist_le_one (p q : PMF α) : p.etvDist q ≤ 1 := by\n calc p.etvDist q = (∑' x, ENNReal.absDiff (p x) (q x)) / 2 := rfl\n _ ≤ (∑' x, (p x + q x)) / 2 :=\n ENNReal.div_le_div_right\n (ENNReal.tsum_le_tsum fun x => ENNReal.absDiff_le_add (p x) (q... | [
{
"name": "etvDist_ne_top",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 4,
"n_chars": 116,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting"... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Monad
public import ToMathlib.Data.ENNReal.AbsDiff
/-!
# Total Variation Distance for PMFs
This file defines... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Monad
public import ToMathlib.Data.ENNReal.AbsDiff
/-!
# Total Variation Distance for PMFs
This file defines... | @@ -69,8 +69,19 @@
_ = ∑' x, ENNReal.absDiff (p x) (q x) + ∑' x, ENNReal.absDiff (q x) (r x) :=
ENNReal.tsum_add) _
-lemma etvDist_ne_top (p q : PMF α) : p.etvDist q ≠ ⊤ := sorry
+lemma etvDist_le_one (p q : PMF α) : p.etvDist q ≤ 1 := by
+ calc p.etvDist q = (∑' x, ENNReal.absDiff (p x) (q x)) / 2... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_065ca75b6f22_1 | 0aecc59d625b9494 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Probability/ProbabilityMassFunction/TotalVariation.lean | TotalVariation | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "tvDist_comm",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [PMF.tvDist, etvDist_comm]",
"n_chars": 42,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n... | [
{
"name": "etvDist_comm",
"text": "lemma etvDist_comm (p q : PMF α) : p.etvDist q = q.etvDist p := by\n simp only [PMF.etvDist, ENNReal.absDiff_comm]\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 117,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rew... | [
{
"name": "tvDist_comm",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 4,
"n_chars": 105,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"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
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Monad
public import ToMathlib.Data.ENNReal.AbsDiff
/-!
# Total Variation Distance for PMFs
This file defines... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Monad
public import ToMathlib.Data.ENNReal.AbsDiff
/-!
# Total Variation Distance for PMFs
This file defines... | @@ -56,6 +56,9 @@
@[simp] lemma etvDist_self (p : PMF α) : p.etvDist p = 0 := by
simp [PMF.etvDist]
+lemma etvDist_comm (p q : PMF α) : p.etvDist q = q.etvDist p := by
+ simp only [PMF.etvDist, ENNReal.absDiff_comm]
+
lemma etvDist_triangle (p q r : PMF α) :
p.etvDist r ≤ p.etvDist q + q.etvDist r := 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_065ca75b6f22_2 | 5398bba7aeaad154 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Probability/ProbabilityMassFunction/TotalVariation.lean | TotalVariation | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 2 | [
{
"theorem_name": "etvDist_ne_top",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n ne_top_of_le_ne_top one_ne_top (etvDist_le_one p q)",
"n_chars": 54,
"n_subproofs": 0,
"n_tactics": 1,
"cycloma... | [
{
"name": "etvDist_le_one",
"text": "lemma etvDist_le_one (p q : PMF α) : p.etvDist q ≤ 1 := by\n calc p.etvDist q = (∑' x, ENNReal.absDiff (p x) (q x)) / 2 := rfl\n _ ≤ (∑' x, (p x + q x)) / 2 :=\n ENNReal.div_le_div_right\n (ENNReal.tsum_le_tsum fun x => ENNReal.absDiff_le_add (p x) (q... | [
{
"name": "tvDist_le_one",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 163,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Monad
public import ToMathlib.Data.ENNReal.AbsDiff
/-!
# Total Variation Distance for PMFs
This file defines... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Monad
public import ToMathlib.Data.ENNReal.AbsDiff
/-!
# Total Variation Distance for PMFs
This file defines... | @@ -69,8 +69,19 @@
_ = ∑' x, ENNReal.absDiff (p x) (q x) + ∑' x, ENNReal.absDiff (q x) (r x) :=
ENNReal.tsum_add) _
-lemma etvDist_ne_top (p q : PMF α) : p.etvDist q ≠ ⊤ := sorry
+lemma etvDist_le_one (p q : PMF α) : p.etvDist q ≤ 1 := by
+ calc p.etvDist q = (∑' x, ENNReal.absDiff (p x) (q x)) / 2... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_065ca75b6f22_3 | 700f941fcf57c60a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Probability/ProbabilityMassFunction/TotalVariation.lean | TotalVariation | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "etvDist_map_le",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n simp only [PMF.etvDist]\n apply ENNReal.div_le_div_right\n calc ∑' y, ENNReal.absDiff ((f <$> p) y) ((f <$> ... | [
{
"name": "map_apply_eq",
"text": "lemma map_apply_eq [DecidableEq β] (f : α' → β) (p : PMF α') (y : β) :\n (f <$> p) y = ∑' x, if f x = y then p x else 0 := by\n simp only [Functor.map, PMF.bind_apply]\n congr 1; ext x; split <;> simp_all [eq_comm]\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars... | [
{
"name": "etvDist_map_le",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 859,
"n_subproofs": 0,
"n_tactics": 21,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 5,
"automation_only": false,
"max_nestin... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Monad
public import ToMathlib.Data.ENNReal.AbsDiff
/-!
# Total Variation Distance for PMFs
This file defines... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Monad
public import ToMathlib.Data.ENNReal.AbsDiff
/-!
# Total Variation Distance for PMFs
This file defines... | @@ -113,8 +113,26 @@
universe u₀
variable {α' : Type u₀} {β : Type u₀}
+lemma map_apply_eq [DecidableEq β] (f : α' → β) (p : PMF α') (y : β) :
+ (f <$> p) y = ∑' x, if f x = y then p x else 0 := by
+ simp only [Functor.map, PMF.bind_apply]
+ congr 1; ext x; split <;> simp_all [eq_comm]
+
lemma etvDist_map_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_065ca75b6f22_4 | a4790a212de011c5 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Probability/ProbabilityMassFunction/TotalVariation.lean | TotalVariation | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "etvDist_map_le",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n simp only [PMF.etvDist]\n apply ENNReal.div_le_div_right\n calc ∑' y, ENNReal.absDiff ((f <$> p) y) ((f <$> ... | [
{
"name": "map_apply_eq",
"text": "lemma map_apply_eq [DecidableEq β] (f : α' → β) (p : PMF α') (y : β) :\n (f <$> p) y = ∑' x, if f x = y then p x else 0 := by\n simp only [Functor.map, PMF.bind_apply]\n congr 1; ext x; split <;> simp_all [eq_comm]\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars... | [
{
"name": "tvDist_map_le",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 7,
"n_chars": 217,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 3 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Monad
public import ToMathlib.Data.ENNReal.AbsDiff
/-!
# Total Variation Distance for PMFs
This file defines... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Monad
public import ToMathlib.Data.ENNReal.AbsDiff
/-!
# Total Variation Distance for PMFs
This file defines... | @@ -113,8 +113,26 @@
universe u₀
variable {α' : Type u₀} {β : Type u₀}
+lemma map_apply_eq [DecidableEq β] (f : α' → β) (p : PMF α') (y : β) :
+ (f <$> p) y = ∑' x, if f x = y then p x else 0 := by
+ simp only [Functor.map, PMF.bind_apply]
+ congr 1; ext x; split <;> simp_all [eq_comm]
+
lemma etvDist_map_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_065ca75b6f22_5 | e59d309e7f8ce736 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Probability/ProbabilityMassFunction/TotalVariation.lean | TotalVariation | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 2 | [
{
"theorem_name": "etvDist_ne_top",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n ne_top_of_le_ne_top one_ne_top (etvDist_le_one p q)",
"n_chars": 54,
"n_subproofs": 0,
"n_tactics": 1,
"cycloma... | [
{
"name": "etvDist_le_one",
"text": "lemma etvDist_le_one (p q : PMF α) : p.etvDist q ≤ 1 := by\n calc p.etvDist q = (∑' x, ENNReal.absDiff (p x) (q x)) / 2 := rfl\n _ ≤ (∑' x, (p x + q x)) / 2 :=\n ENNReal.div_le_div_right\n (ENNReal.tsum_le_tsum fun x => ENNReal.absDiff_le_add (p x) (q... | [
{
"name": "tvDist_bind_right_le",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 6,
"n_chars": 225,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_ne... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Monad
public import ToMathlib.Data.ENNReal.AbsDiff
/-!
# Total Variation Distance for PMFs
This file defines... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Monad
public import ToMathlib.Data.ENNReal.AbsDiff
/-!
# Total Variation Distance for PMFs
This file defines... | @@ -69,8 +69,19 @@
_ = ∑' x, ENNReal.absDiff (p x) (q x) + ∑' x, ENNReal.absDiff (q x) (r x) :=
ENNReal.tsum_add) _
-lemma etvDist_ne_top (p q : PMF α) : p.etvDist q ≠ ⊤ := sorry
+lemma etvDist_le_one (p q : PMF α) : p.etvDist q ≤ 1 := by
+ calc p.etvDist q = (∑' x, ENNReal.absDiff (p x) (q x)) / 2... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_065ca75b6f22_6 | 3e5794845409af54 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Probability/ProbabilityMassFunction/TotalVariation.lean | TotalVariation | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "etvDist_option_punit",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [PMF.etvDist]\n rw [tsum_fintype, Fintype.sum_option, Fintype.sum_unique]\n rw [pmf_none_eq p, pmf_none_e... | [
{
"name": "pmf_none_eq",
"text": "lemma pmf_none_eq (p : PMF (Option PUnit)) :\n p none = 1 - p (some ()) := by\n have h := p.tsum_coe\n rw [tsum_fintype, Fintype.sum_option, Fintype.sum_unique] at h\n exact (ENNReal.sub_eq_of_eq_add (PMF.apply_ne_top p _) h.symm).symm\n\n",
"fan_in": 1,
"n_li... | [
{
"name": "etvDist_option_punit",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 557,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 0,
"automation_only": false,
"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
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Monad
public import ToMathlib.Data.ENNReal.AbsDiff
/-!
# Total Variation Distance for PMFs
This file defines... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Monad
public import ToMathlib.Data.ENNReal.AbsDiff
/-!
# Total Variation Distance for PMFs
This file defines... | @@ -132,8 +132,23 @@
variable (p q : PMF (Option PUnit))
+lemma pmf_none_eq (p : PMF (Option PUnit)) :
+ p none = 1 - p (some ()) := by
+ have h := p.tsum_coe
+ rw [tsum_fintype, Fintype.sum_option, Fintype.sum_unique] at h
+ exact (ENNReal.sub_eq_of_eq_add (PMF.apply_ne_top p _) h.symm).symm
+
lemma etvDis... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_065ca75b6f22_7 | 85a60e653af09042 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | ToMathlib/Probability/ProbabilityMassFunction/TotalVariation.lean | TotalVariation | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "tvDist_option_punit",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [PMF.tvDist, etvDist_option_punit]\n exact ENNReal.absDiff_toReal (ne_top_of_le_ne_top one_ne_top (PMF.coe_l... | [
{
"name": "etvDist_option_punit",
"text": "lemma etvDist_option_punit :\n p.etvDist q = ENNReal.absDiff (p (some ())) (q (some ())) := by\n simp only [PMF.etvDist]\n rw [tsum_fintype, Fintype.sum_option, Fintype.sum_unique]\n rw [pmf_none_eq p, pmf_none_eq q,\n ENNReal.absDiff_tsub_tsub (PMF.coe_le... | [
{
"name": "tvDist_option_punit",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 288,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nes... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Monad
public import ToMathlib.Data.ENNReal.AbsDiff
/-!
# Total Variation Distance for PMFs
This file defines... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
module
public import Mathlib.Probability.ProbabilityMassFunction.Monad
public import ToMathlib.Data.ENNReal.AbsDiff
/-!
# Total Variation Distance for PMFs
This file defines... | @@ -138,8 +138,23 @@
rw [tsum_fintype, Fintype.sum_option, Fintype.sum_unique] at h
exact (ENNReal.sub_eq_of_eq_add (PMF.apply_ne_top p _) h.symm).symm
+lemma etvDist_option_punit :
+ p.etvDist q = ENNReal.absDiff (p (some ())) (q (some ())) := by
+ simp only [PMF.etvDist]
+ rw [tsum_fintype, Fintype.sum_o... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_59534e16272f_0 | d58ec49ff92cf4d8 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/Interaction/UC/AsyncSecurity.lean | AsyncSecurity | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "weakFair_of_strongFair",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n fun hSF ticket => weakFairOn_of_strongFairOn ticketed run ticket (hSF ticket)",
"n_chars": 80,
"n_subproofs": 0... | [
{
"name": "weakFairOn_of_strongFairOn",
"text": "/-- Strong fairness implies weak fairness on the same ticket. -/\ntheorem weakFairOn_of_strongFairOn\n (ticketed : Ticketed Party m Δ Event State)\n (run : AsyncRun ticketed.process.toProcess ticketed.envAction)\n (ticket : ticketed.Ticket) :\n St... | [
{
"name": "weakFair_of_strongFair",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 351,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"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 PolyFun.Interaction.Concurrent.Fairness
import VCVio.Interaction.UC.AsyncRuntime
import VCVio.Interaction.UC.Computational
/-!
# Fair PPT security for asynchronous env-... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import PolyFun.Interaction.Concurrent.Fairness
import VCVio.Interaction.UC.AsyncRuntime
import VCVio.Interaction.UC.Computational
/-!
# Fair PPT security for asynchronous env-... | @@ -273,11 +273,20 @@
(run : AsyncRun ticketed.process.toProcess ticketed.envAction) : Prop :=
∀ ticket, StrongFairOn ticketed run ticket
+/-- Strong fairness implies weak fairness on the same ticket. -/
+theorem weakFairOn_of_strongFairOn
+ (ticketed : Ticketed Party m Δ Event State)
+ (run : AsyncRun ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_7dc54cb1d384_3 | 8b04804773e15236 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/PRFTagReader/PRFReductions/Reductions.lean | Reductions | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "prfRealExp_unlinkToSinglePRFReduction_eq_unlinkSingleExp",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n congr 1\n unfold PRFScheme.prfRealExp unlinkSingleExp unlinkToSinglePRFReduction... | [
{
"name": "simulateQ_prfReal_unlinkToSinglePRFQueryImpl_run",
"text": "/-- Inductive helper, single-session world: simulating the unlinkability adversary through the\nreduction's query implementation and then through the real PRF query implementation is the same,\nstate-by-state, as simulating it directly t... | [
{
"name": "prfRealExp_unlinkToSinglePRFReduction_eq_unlinkSingleExp",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 22,
"n_chars": 1199,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 1,
... | 3 | /-
Copyright (c) 2026 Oleksandr Vovkotrub. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oleksandr Vovkotrub
-/
import Examples.PRFTagReader
import VCVio.OracleComp.QueryTracking.RandomOracle.EagerTable
import VCVio.ProgramLogic.Relational.SimulateQ
/-!
# PRF Tag/Re... | /-
Copyright (c) 2026 Oleksandr Vovkotrub. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oleksandr Vovkotrub
-/
import Examples.PRFTagReader
import VCVio.OracleComp.QueryTracking.RandomOracle.EagerTable
import VCVio.ProgramLogic.Relational.SimulateQ
/-!
# PRF Tag/Re... | @@ -268,6 +268,32 @@
rfl
omit [Nonempty TagId] [DecidableEq Nonce] [SampleableType Digest] [NeZero sessionsPerTag] in
+/-- Inductive helper, single-session world: simulating the unlinkability adversary through the
+reduction's query implementation and then through the real PRF query implementation is the same,
+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_b7fcd730b5f8_0 | 28641f063733ae45 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 7 | [
{
"theorem_name": "relTriple_post_const",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n relTriple_post_mono (relTriple_true oa ob) (fun _ _ _ => h _ _)",
"n_chars": 66,
"n_subproofs": 0,
"n_tactics... | [
{
"name": "relTriple_post_mono",
"text": "/-- Postcondition monotonicity for relational triples. -/\nlemma relTriple_post_mono {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {R R' : RelPost α β}\n (h : RelTriple oa ob R) (hpost : ∀ ⦃x y⦄, R x y → R' x y) :\n RelTriple oa ob R' :=\n relTriple_iff... | [
{
"name": "relTriple_post_const",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 390,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_ne... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -147,6 +147,12 @@
def HasCoupling (oa : OracleComp spec₁ α) (ob : OracleComp spec₂ β) : Prop :=
Nonempty (_root_.SPMF.Coupling (𝒟[oa]) (𝒟[ob]))
+/-- Postcondition monotonicity for relational triples. -/
+lemma relTriple_post_mono {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {R R' : RelPost α β}
+ (... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7fcd730b5f8_1 | f71d5ae9b6adc361 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 3 | [
{
"theorem_name": "relTriple_eqRel_of_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n h ▸ relTriple_refl oa",
"n_chars": 26,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automat... | [
{
"name": "relTriple_refl",
"text": "/-- Reflexivity rule for relational triples on equality. -/\nlemma relTriple_refl (oa : OracleComp spec₁ α) :\n RelTriple (spec₁ := spec₁) (spec₂ := spec₁) oa oa (EqRel α) := by\n refine relTriple_iff_relWP.2 ⟨_root_.SPMF.Coupling.refl (𝒟[oa]), fun z hz => ?_⟩\n ob... | [
{
"name": "relTriple_eqRel_of_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 6,
"n_chars": 253,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_n... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -147,9 +147,18 @@
def HasCoupling (oa : OracleComp spec₁ α) (ob : OracleComp spec₂ β) : Prop :=
Nonempty (_root_.SPMF.Coupling (𝒟[oa]) (𝒟[ob]))
+/-- Reflexivity rule for relational triples on equality. -/
+lemma relTriple_refl (oa : OracleComp spec₁ α) :
+ RelTriple (spec₁ := spec₁) (spec₂ := spec₁) oa oa... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7fcd730b5f8_2 | ed7fdc7edac7d3d9 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 3 | [
{
"theorem_name": "relTriple_eqRel_of_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n h ▸ relTriple_refl oa",
"n_chars": 26,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automat... | [
{
"name": "relTriple_refl",
"text": "/-- Reflexivity rule for relational triples on equality. -/\nlemma relTriple_refl (oa : OracleComp spec₁ α) :\n RelTriple (spec₁ := spec₁) (spec₂ := spec₁) oa oa (EqRel α) := by\n refine relTriple_iff_relWP.2 ⟨_root_.SPMF.Coupling.refl (𝒟[oa]), fun z hz => ?_⟩\n ob... | [
{
"name": "relTriple_eqRel_of_evalDist_eq",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 7,
"n_chars": 307,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -147,6 +147,14 @@
def HasCoupling (oa : OracleComp spec₁ α) (ob : OracleComp spec₂ β) : Prop :=
Nonempty (_root_.SPMF.Coupling (𝒟[oa]) (𝒟[ob]))
+/-- Reflexivity rule for relational triples on equality. -/
+lemma relTriple_refl (oa : OracleComp spec₁ α) :
+ RelTriple (spec₁ := spec₁) (spec₂ := spec₁) oa oa... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7fcd730b5f8_3 | 25e2b1bcec632305 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 7 | [
{
"theorem_name": "relTriple_post_const",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n relTriple_post_mono (relTriple_true oa ob) (fun _ _ _ => h _ _)",
"n_chars": 66,
"n_subproofs": 0,
"n_tactics... | [
{
"name": "relTriple_post_mono",
"text": "/-- Postcondition monotonicity for relational triples. -/\nlemma relTriple_post_mono {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {R R' : RelPost α β}\n (h : RelTriple oa ob R) (hpost : ∀ ⦃x y⦄, R x y → R' x y) :\n RelTriple oa ob R' :=\n relTriple_iff... | [
{
"name": "relTriple_of_evalDist_eq",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 8,
"n_chars": 371,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"ma... | 4 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -155,6 +155,12 @@
simpa [_root_.SPMF.Coupling.refl, support_pure] using hz
rfl
+/-- Postcondition monotonicity for relational triples. -/
+lemma relTriple_post_mono {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {R R' : RelPost α β}
+ (h : RelTriple oa ob R) (hpost : ∀ ⦃x y⦄, R x y → R' x y) :
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7fcd730b5f8_4 | 680dde24c9740856 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 2 | [
{
"theorem_name": "relTriple_eqRel_of_evalDist_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n relTriple_of_evalDist_eq_right h (relTriple_refl oa)",
"n_chars": 55,
"n_subproofs": 0,
"n_tactics"... | [
{
"name": "relTriple_of_evalDist_eq_right",
"text": "/-- Transport a relational triple across equality of the right output distribution. -/\nlemma relTriple_of_evalDist_eq_right\n {ι₃ : Type w} {spec₃ : OracleSpec ι₃} [IsUniformSpec spec₃]\n {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β}\n {ob... | [
{
"name": "relTriple_eqRel_of_probOutput_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 7,
"n_chars": 325,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"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 ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -155,10 +155,21 @@
simpa [_root_.SPMF.Coupling.refl, support_pure] using hz
rfl
+/-- Transport a relational triple across equality of the right output distribution. -/
+lemma relTriple_of_evalDist_eq_right
+ {ι₃ : Type w} {spec₃ : OracleSpec ι₃} [IsUniformSpec spec₃]
+ {oa : OracleComp spec₁ α} {ob :... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7fcd730b5f8_5 | 3135474cea999236 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 2 | [
{
"theorem_name": "relTriple_eqRel_of_evalDist_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n relTriple_of_evalDist_eq_right h (relTriple_refl oa)",
"n_chars": 55,
"n_subproofs": 0,
"n_tactics"... | [
{
"name": "relTriple_of_evalDist_eq_right",
"text": "/-- Transport a relational triple across equality of the right output distribution. -/\nlemma relTriple_of_evalDist_eq_right\n {ι₃ : Type w} {spec₃ : OracleSpec ι₃} [IsUniformSpec spec₃]\n {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β}\n {ob... | [
{
"name": "relTriple_bind_bind_swap_eqRel",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 11,
"n_chars": 427,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 4 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -155,10 +155,21 @@
simpa [_root_.SPMF.Coupling.refl, support_pure] using hz
rfl
+/-- Transport a relational triple across equality of the right output distribution. -/
+lemma relTriple_of_evalDist_eq_right
+ {ι₃ : Type w} {spec₃ : OracleSpec ι₃} [IsUniformSpec spec₃]
+ {oa : OracleComp spec₁ α} {ob :... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7fcd730b5f8_6 | af1d10cf1cd1fd41 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 2 | [
{
"theorem_name": "evalDist_eq_of_relTriple_eqRel",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n evalDist_ext (probOutput_eq_of_relTriple_eqRel h)",
"n_chars": 52,
"n_subproofs": 0,
"n_tactics": 1... | [
{
"name": "probOutput_eq_of_relTriple_eqRel",
"text": "/-- Equality-relation relational triples imply equality of point output probabilities. -/\nlemma probOutput_eq_of_relTriple_eqRel {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ α}\n (h : RelTriple oa ob (EqRel α)) (x : α) : Pr[= x | oa] = Pr[= x | ... | [
{
"name": "evalDist_eq_of_relTriple_eqRel",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 302,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -147,10 +147,21 @@
def HasCoupling (oa : OracleComp spec₁ α) (ob : OracleComp spec₂ β) : Prop :=
Nonempty (_root_.SPMF.Coupling (𝒟[oa]) (𝒟[ob]))
+/-- Equality-relation relational triples imply equality of point output probabilities. -/
+lemma probOutput_eq_of_relTriple_eqRel {oa : OracleComp spec₁ α} {ob : O... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7fcd730b5f8_7 | a2a20a1ea0af3b18 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 3 | [
{
"theorem_name": "relTriple_trans_eqRel_left",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n relTriple_of_evalDist_eq_left (evalDist_eq_of_relTriple_eqRel hleft) hright",
"n_chars": 78,
"n_subproofs":... | [
{
"name": "evalDist_eq_of_relTriple_eqRel",
"text": "/-- Equality-relation relational triples imply equality of evaluation distributions. -/\nlemma evalDist_eq_of_relTriple_eqRel {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ α}\n (h : RelTriple oa ob (EqRel α)) :\n 𝒟[oa] = 𝒟[ob] :=\n evalDist_ex... | [
{
"name": "relTriple_trans_eqRel_left",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 494,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"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 ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -167,13 +167,20 @@
probEvent_ext fun z hz => by rw [hc z hz]
grind
+/-- Equality-relation relational triples imply equality of evaluation distributions. -/
+lemma evalDist_eq_of_relTriple_eqRel {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ α}
+ (h : RelTriple oa ob (EqRel α)) :
+ 𝒟[oa] = 𝒟[ob] :... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7fcd730b5f8_8 | 382e7804a0f5f909 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 3 | [
{
"theorem_name": "relTriple_trans_eqRel_left",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n relTriple_of_evalDist_eq_left (evalDist_eq_of_relTriple_eqRel hleft) hright",
"n_chars": 78,
"n_subproofs":... | [
{
"name": "evalDist_eq_of_relTriple_eqRel",
"text": "/-- Equality-relation relational triples imply equality of evaluation distributions. -/\nlemma evalDist_eq_of_relTriple_eqRel {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ α}\n (h : RelTriple oa ob (EqRel α)) :\n 𝒟[oa] = 𝒟[ob] :=\n evalDist_ex... | [
{
"name": "relTriple_trans_eqRel_right",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 497,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"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 ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -167,13 +167,20 @@
probEvent_ext fun z hz => by rw [hc z hz]
grind
+/-- Equality-relation relational triples imply equality of evaluation distributions. -/
+lemma evalDist_eq_of_relTriple_eqRel {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ α}
+ (h : RelTriple oa ob (EqRel α)) :
+ 𝒟[oa] = 𝒟[ob] :... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7fcd730b5f8_9 | f09724f3dd6098b6 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 3 | [
{
"theorem_name": "relTriple_trans_eqRel_left",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n relTriple_of_evalDist_eq_left (evalDist_eq_of_relTriple_eqRel hleft) hright",
"n_chars": 78,
"n_subproofs":... | [
{
"name": "evalDist_eq_of_relTriple_eqRel",
"text": "/-- Equality-relation relational triples imply equality of evaluation distributions. -/\nlemma evalDist_eq_of_relTriple_eqRel {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ α}\n (h : RelTriple oa ob (EqRel α)) :\n 𝒟[oa] = 𝒟[ob] :=\n evalDist_ex... | [
{
"name": "relTriple_trans_eqRel",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 9,
"n_chars": 451,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"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 ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -167,13 +167,20 @@
probEvent_ext fun z hz => by rw [hc z hz]
grind
+/-- Equality-relation relational triples imply equality of evaluation distributions. -/
+lemma evalDist_eq_of_relTriple_eqRel {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ α}
+ (h : RelTriple oa ob (EqRel α)) :
+ 𝒟[oa] = 𝒟[ob] :... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7fcd730b5f8_10 | af01879022a498e7 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 2 | [
{
"theorem_name": "evalDist_eq_of_relTriple_eqRel",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n evalDist_ext (probOutput_eq_of_relTriple_eqRel h)",
"n_chars": 52,
"n_subproofs": 0,
"n_tactics": 1... | [
{
"name": "probOutput_eq_of_relTriple_eqRel",
"text": "/-- Equality-relation relational triples imply equality of point output probabilities. -/\nlemma probOutput_eq_of_relTriple_eqRel {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ α}\n (h : RelTriple oa ob (EqRel α)) (x : α) : Pr[= x | oa] = Pr[= x | ... | [
{
"name": "probOutput_true_eq_of_relTriple_eqRel",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 364,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": f... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -147,10 +147,21 @@
def HasCoupling (oa : OracleComp spec₁ α) (ob : OracleComp spec₂ β) : Prop :=
Nonempty (_root_.SPMF.Coupling (𝒟[oa]) (𝒟[ob]))
+/-- Equality-relation relational triples imply equality of point output probabilities. -/
+lemma probOutput_eq_of_relTriple_eqRel {oa : OracleComp spec₁ α} {ob : O... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7fcd730b5f8_11 | 0451b8aae34a636f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 3 | [
{
"theorem_name": "relTriple_eqRel_of_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n h ▸ relTriple_refl oa",
"n_chars": 26,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automat... | [
{
"name": "relTriple_refl",
"text": "/-- Reflexivity rule for relational triples on equality. -/\nlemma relTriple_refl (oa : OracleComp spec₁ α) :\n RelTriple (spec₁ := spec₁) (spec₂ := spec₁) oa oa (EqRel α) := by\n refine relTriple_iff_relWP.2 ⟨_root_.SPMF.Coupling.refl (𝒟[oa]), fun z hz => ?_⟩\n ob... | [
{
"name": "relTriple_query",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 440,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nestin... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -147,13 +147,22 @@
def HasCoupling (oa : OracleComp spec₁ α) (ob : OracleComp spec₂ β) : Prop :=
Nonempty (_root_.SPMF.Coupling (𝒟[oa]) (𝒟[ob]))
+/-- Reflexivity rule for relational triples on equality. -/
+lemma relTriple_refl (oa : OracleComp spec₁ α) :
+ RelTriple (spec₁ := spec₁) (spec₂ := spec₁) oa o... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7fcd730b5f8_12 | f339be60b7d60210 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 5 | [
{
"theorem_name": "relTriple_bind_query_bij",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n relTriple_bind (R := fun a b => b = f a)\n (relTriple_post_mono (relTriple_query_bij t hf) fun _ _ h => h.symm)\n ... | [
{
"name": "relTriple_bind",
"text": "/-- Bind composition rule for relational triples. -/\nlemma relTriple_bind\n {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {fa : α → OracleComp spec₁ γ}\n {fb : β → OracleComp spec₂ δ} {R : RelPost α β} {S : RelPost γ δ}\n (hxy : RelTriple oa ob R) (hfg : ... | [
{
"name": "relTriple_bind_query_bij",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 19,
"n_chars": 914,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"ma... | 3 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -153,6 +153,14 @@
RelTriple oa ob R' :=
relTriple_iff_relWP.2 ((relTriple_iff_relWP.1 h).imp fun _ hc z hz => hpost (hc z hz))
+/-- Bind composition rule for relational triples. -/
+lemma relTriple_bind
+ {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {fa : α → OracleComp spec₁ γ}
+ {fb : β → Or... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7fcd730b5f8_13 | 0efe1e6133421d8a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 3 | [
{
"theorem_name": "relTriple_trans_eqRel_left",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n relTriple_of_evalDist_eq_left (evalDist_eq_of_relTriple_eqRel hleft) hright",
"n_chars": 78,
"n_subproofs":... | [
{
"name": "evalDist_eq_of_relTriple_eqRel",
"text": "/-- Equality-relation relational triples imply equality of evaluation distributions. -/\nlemma evalDist_eq_of_relTriple_eqRel {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ α}\n (h : RelTriple oa ob (EqRel α)) :\n 𝒟[oa] = 𝒟[ob] :=\n evalDist_ex... | [
{
"name": "evalDist_map_eq_of_relTriple",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 447,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"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 ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -157,6 +157,12 @@
probEvent_ext fun z hz => by rw [hc z hz]
grind
+/-- Equality-relation relational triples imply equality of evaluation distributions. -/
+lemma evalDist_eq_of_relTriple_eqRel {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ α}
+ (h : RelTriple oa ob (EqRel α)) :
+ 𝒟[oa] = 𝒟[ob] :=... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7fcd730b5f8_14 | 54c4f728d233a6f0 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 5 | [
{
"theorem_name": "relTriple_bind_query_bij",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n relTriple_bind (R := fun a b => b = f a)\n (relTriple_post_mono (relTriple_query_bij t hf) fun _ _ h => h.symm)\n ... | [
{
"name": "relTriple_bind",
"text": "/-- Bind composition rule for relational triples. -/\nlemma relTriple_bind\n {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {fa : α → OracleComp spec₁ γ}\n {fb : β → OracleComp spec₂ δ} {R : RelPost α β} {S : RelPost γ δ}\n (hxy : RelTriple oa ob R) (hfg : ... | [
{
"name": "relTriple_replicate",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 15,
"n_chars": 608,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_ne... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -155,6 +155,14 @@
· obtain rfl : z = (a, b) := by simpa [support_pure] using hz
exact h
+/-- Bind composition rule for relational triples. -/
+lemma relTriple_bind
+ {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {fa : α → OracleComp spec₁ γ}
+ {fb : β → OracleComp spec₂ δ} {R : RelPost α β} {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_b7fcd730b5f8_15 | abab0b1db80b0caf | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 5 | [
{
"theorem_name": "relTriple_bind_query_bij",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n relTriple_bind (R := fun a b => b = f a)\n (relTriple_post_mono (relTriple_query_bij t hf) fun _ _ h => h.symm)\n ... | [
{
"name": "relTriple_bind",
"text": "/-- Bind composition rule for relational triples. -/\nlemma relTriple_bind\n {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {fa : α → OracleComp spec₁ γ}\n {fb : β → OracleComp spec₂ δ} {R : RelPost α β} {S : RelPost γ δ}\n (hxy : RelTriple oa ob R) (hfg : ... | [
{
"name": "relTriple_replicate_eqRel",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 6,
"n_lines": 10,
"n_chars": 376,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"... | 5 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -161,6 +161,14 @@
RelTriple oa ob R' :=
relTriple_iff_relWP.2 ((relTriple_iff_relWP.1 h).imp fun _ hc z hz => hpost (hc z hz))
+/-- Bind composition rule for relational triples. -/
+lemma relTriple_bind
+ {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {fa : α → OracleComp spec₁ γ}
+ {fb : β → Or... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7fcd730b5f8_16 | 5e1faab19cf1f811 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 5 | [
{
"theorem_name": "relTriple_bind_query_bij",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n relTriple_bind (R := fun a b => b = f a)\n (relTriple_post_mono (relTriple_query_bij t hf) fun _ _ h => h.symm)\n ... | [
{
"name": "relTriple_bind",
"text": "/-- Bind composition rule for relational triples. -/\nlemma relTriple_bind\n {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {fa : α → OracleComp spec₁ γ}\n {fb : β → OracleComp spec₂ δ} {R : RelPost α β} {S : RelPost γ δ}\n (hxy : RelTriple oa ob R) (hfg : ... | [
{
"name": "relTriple_list_mapM",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 18,
"n_chars": 804,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_ne... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -155,6 +155,14 @@
· obtain rfl : z = (a, b) := by simpa [support_pure] using hz
exact h
+/-- Bind composition rule for relational triples. -/
+lemma relTriple_bind
+ {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {fa : α → OracleComp spec₁ γ}
+ {fb : β → OracleComp spec₂ δ} {R : RelPost α β} {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_b7fcd730b5f8_17 | 0b25a50ab5074a8c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 5 | [
{
"theorem_name": "relTriple_bind_query_bij",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n relTriple_bind (R := fun a b => b = f a)\n (relTriple_post_mono (relTriple_query_bij t hf) fun _ _ h => h.symm)\n ... | [
{
"name": "relTriple_bind",
"text": "/-- Bind composition rule for relational triples. -/\nlemma relTriple_bind\n {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {fa : α → OracleComp spec₁ γ}\n {fb : β → OracleComp spec₂ δ} {R : RelPost α β} {S : RelPost γ δ}\n (hxy : RelTriple oa ob R) (hfg : ... | [
{
"name": "relTriple_list_mapM_eqRel",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 6,
"n_lines": 13,
"n_chars": 554,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 1,
"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 ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -161,6 +161,14 @@
RelTriple oa ob R' :=
relTriple_iff_relWP.2 ((relTriple_iff_relWP.1 h).imp fun _ hc z hz => hpost (hc z hz))
+/-- Bind composition rule for relational triples. -/
+lemma relTriple_bind
+ {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {fa : α → OracleComp spec₁ γ}
+ {fb : β → Or... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7fcd730b5f8_18 | de2b0c3944be19e1 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 5 | [
{
"theorem_name": "relTriple_bind_query_bij",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n relTriple_bind (R := fun a b => b = f a)\n (relTriple_post_mono (relTriple_query_bij t hf) fun _ _ h => h.symm)\n ... | [
{
"name": "relTriple_bind",
"text": "/-- Bind composition rule for relational triples. -/\nlemma relTriple_bind\n {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {fa : α → OracleComp spec₁ γ}\n {fb : β → OracleComp spec₂ δ} {R : RelPost α β} {S : RelPost γ δ}\n (hxy : RelTriple oa ob R) (hfg : ... | [
{
"name": "relTriple_list_foldlM",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 21,
"n_chars": 903,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 3,
"automation_only": false,
"max_... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -155,6 +155,14 @@
· obtain rfl : z = (a, b) := by simpa [support_pure] using hz
exact h
+/-- Bind composition rule for relational triples. -/
+lemma relTriple_bind
+ {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {fa : α → OracleComp spec₁ γ}
+ {fb : β → OracleComp spec₂ δ} {R : RelPost α β} {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_b7fcd730b5f8_19 | 6cc26537b9e3ebd5 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 5 | [
{
"theorem_name": "relTriple_bind_query_bij",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n relTriple_bind (R := fun a b => b = f a)\n (relTriple_post_mono (relTriple_query_bij t hf) fun _ _ h => h.symm)\n ... | [
{
"name": "relTriple_bind",
"text": "/-- Bind composition rule for relational triples. -/\nlemma relTriple_bind\n {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {fa : α → OracleComp spec₁ γ}\n {fb : β → OracleComp spec₂ δ} {R : RelPost α β} {S : RelPost γ δ}\n (hxy : RelTriple oa ob R) (hfg : ... | [
{
"name": "relTriple_list_foldlM_same",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 22,
"n_chars": 708,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 2,
"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: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -155,6 +155,14 @@
· obtain rfl : z = (a, b) := by simpa [support_pure] using hz
exact h
+/-- Bind composition rule for relational triples. -/
+lemma relTriple_bind
+ {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {fa : α → OracleComp spec₁ γ}
+ {fb : β → OracleComp spec₂ δ} {R : RelPost α β} {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_b7fcd730b5f8_20 | a47ede2a991c940f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 7 | [
{
"theorem_name": "relTriple_post_const",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n relTriple_post_mono (relTriple_true oa ob) (fun _ _ _ => h _ _)",
"n_chars": 66,
"n_subproofs": 0,
"n_tactics... | [
{
"name": "relTriple_post_mono",
"text": "/-- Postcondition monotonicity for relational triples. -/\nlemma relTriple_post_mono {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {R R' : RelPost α β}\n (h : RelTriple oa ob R) (hpost : ∀ ⦃x y⦄, R x y → R' x y) :\n RelTriple oa ob R' :=\n relTriple_iff... | [
{
"name": "relTriple_pure_left",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 375,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nes... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -147,12 +147,19 @@
def HasCoupling (oa : OracleComp spec₁ α) (ob : OracleComp spec₂ β) : Prop :=
Nonempty (_root_.SPMF.Coupling (𝒟[oa]) (𝒟[ob]))
+/-- Postcondition monotonicity for relational triples. -/
+lemma relTriple_post_mono {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {R R' : RelPost α β}
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7fcd730b5f8_21 | 11bf6728e872df51 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 7 | [
{
"theorem_name": "relTriple_post_const",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n relTriple_post_mono (relTriple_true oa ob) (fun _ _ _ => h _ _)",
"n_chars": 66,
"n_subproofs": 0,
"n_tactics... | [
{
"name": "relTriple_post_mono",
"text": "/-- Postcondition monotonicity for relational triples. -/\nlemma relTriple_post_mono {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {R R' : RelPost α β}\n (h : RelTriple oa ob R) (hpost : ∀ ⦃x y⦄, R x y → R' x y) :\n RelTriple oa ob R' :=\n relTriple_iff... | [
{
"name": "relTriple_pure_right",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 378,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_ne... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -147,12 +147,19 @@
def HasCoupling (oa : OracleComp spec₁ α) (ob : OracleComp spec₂ β) : Prop :=
Nonempty (_root_.SPMF.Coupling (𝒟[oa]) (𝒟[ob]))
+/-- Postcondition monotonicity for relational triples. -/
+lemma relTriple_post_mono {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {R R' : RelPost α β}
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7fcd730b5f8_22 | 013136fc88d50636 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 5 | [
{
"theorem_name": "relTriple_bind_query_bij",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n relTriple_bind (R := fun a b => b = f a)\n (relTriple_post_mono (relTriple_query_bij t hf) fun _ _ h => h.symm)\n ... | [
{
"name": "relTriple_bind",
"text": "/-- Bind composition rule for relational triples. -/\nlemma relTriple_bind\n {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {fa : α → OracleComp spec₁ γ}\n {fb : β → OracleComp spec₂ δ} {R : RelPost α β} {S : RelPost γ δ}\n (hxy : RelTriple oa ob R) (hfg : ... | [
{
"name": "relTriple_bind_uniformSample_bij",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 18,
"n_chars": 745,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 3,
"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 ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -147,6 +147,14 @@
def HasCoupling (oa : OracleComp spec₁ α) (ob : OracleComp spec₂ β) : Prop :=
Nonempty (_root_.SPMF.Coupling (𝒟[oa]) (𝒟[ob]))
+/-- Bind composition rule for relational triples. -/
+lemma relTriple_bind
+ {oa : OracleComp spec₁ α} {ob : OracleComp spec₂ β} {fa : α → OracleComp spec₁ γ}
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_b7fcd730b5f8_23 | 195f097c7d330712 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/Basic.lean | Basic | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 2 | [
{
"theorem_name": "relTriple_bind_uniformSample_bij",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine relTriple_bind (R := fun a b => b = f a) ?_ ?_\n · exact relTriple_uniformSample_bij hf _ (fun _ =... | [
{
"name": "relTriple_uniformSample_bij",
"text": "/-- Relational coupling for uniform sampling via bijection.\nGiven a bijection `f : α → α` such that `R x (f x)` for all `x`,\nthe two uniform samples are related by `R`. -/\nlemma relTriple_uniformSample_bij\n {f : α → α} (hf : Function.Bijective f) (R :... | [
{
"name": "relTriple_uniformSample_refl",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 6,
"n_chars": 209,
"n_subproofs": 0,
"n_tactics": 1,
"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 ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import ToMathlib.Control.Monad.RelationalAlgebra
import ToMathlib.ProbabilityTheory.Coupling
import VCVio.EvalDist.Defs.Instances
import VCVio.EvalDist.Defs.NeverFails
import ... | @@ -151,9 +151,29 @@
variable [SampleableType α]
+/-- Relational coupling for uniform sampling via bijection.
+Given a bijection `f : α → α` such that `R x (f x)` for all `x`,
+the two uniform samples are related by `R`. -/
+lemma relTriple_uniformSample_bij
+ {f : α → α} (hf : Function.Bijective f) (R : RelPos... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_1b298258ef70_0 | c70df2778a6bd95b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/Ring/NTTCert.lean | NTTCert | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "applyMatrix_comp",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n suffices h : ∀ row : Fin backend.degree,\n ∑ col, A row col * backend.coeff (applyMatrix backend B f) col =\n ∑... | [
{
"name": "applyMatrix_get",
"text": "theorem applyMatrix_get (M : Fin backend.degree → Fin backend.degree → Coeff)\n (f : backend.Poly) (j : Fin backend.degree) :\n backend.coeff (applyMatrix backend M f) j =\n ∑ col : Fin backend.degree, M j col * backend.coeff f col := by\n simp [applyMatrix]... | [
{
"name": "applyMatrix_comp",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 741,
"n_subproofs": 1,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 5,
"n_structural": 5,
"automation_only": false,
"max_nest... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Mathlib.Algebra.BigOperators.Ring.Finset
import LatticeCrypto.Ring.VectorBackend
/-!
# Shared Matrix Certification Scaffolding For Concrete NTTs
Centralizes the standa... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Mathlib.Algebra.BigOperators.Ring.Finset
import LatticeCrypto.Ring.VectorBackend
/-!
# Shared Matrix Certification Scaffolding For Concrete NTTs
Centralizes the standa... | @@ -51,12 +51,29 @@
def idMatrix (n : Nat) (row col : Fin n) : Coeff :=
if col = row then 1 else 0
+theorem applyMatrix_get (M : Fin backend.degree → Fin backend.degree → Coeff)
+ (f : backend.Poly) (j : Fin backend.degree) :
+ backend.coeff (applyMatrix backend M f) j =
+ ∑ col : Fin backend.degree, 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_1b298258ef70_1 | d1189f81a195f692 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/Ring/NTTCert.lean | NTTCert | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "applyMatrix_add",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine applyMatrix_pointwise M (· + ·) (· + ·) ?_ ?_ ?_ f g\n · intro f' g' i; exact congr_fun (hadd f' g') i\n · intros;... | [
{
"name": "applyMatrix_pointwise",
"text": "/-- Pointwise distributivity of `applyMatrix` over a binary backend operation\n`op` whose coefficient image distributes over multiplication and finite sums.\nSpecializes to `applyMatrix_add` and `applyMatrix_sub`. -/\ntheorem applyMatrix_pointwise\n (M : Fin ba... | [
{
"name": "applyMatrix_add",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 689,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 7,
"automation_only": false,
"max_nestin... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Mathlib.Algebra.BigOperators.Ring.Finset
import LatticeCrypto.Ring.VectorBackend
/-!
# Shared Matrix Certification Scaffolding For Concrete NTTs
Centralizes the standa... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Mathlib.Algebra.BigOperators.Ring.Finset
import LatticeCrypto.Ring.VectorBackend
/-!
# Shared Matrix Certification Scaffolding For Concrete NTTs
Centralizes the standa... | @@ -51,6 +51,37 @@
def idMatrix (n : Nat) (row col : Fin n) : Coeff :=
if col = row then 1 else 0
+/-- Pointwise distributivity of `applyMatrix` over a binary backend operation
+`op` whose coefficient image distributes over multiplication and finite sums.
+Specializes to `applyMatrix_add` and `applyMatrix_sub`. -... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_1b298258ef70_2 | 04028784129cacde | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/Ring/NTTCert.lean | NTTCert | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "applyMatrix_add",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine applyMatrix_pointwise M (· + ·) (· + ·) ?_ ?_ ?_ f g\n · intro f' g' i; exact congr_fun (hadd f' g') i\n · intros;... | [
{
"name": "applyMatrix_pointwise",
"text": "/-- Pointwise distributivity of `applyMatrix` over a binary backend operation\n`op` whose coefficient image distributes over multiplication and finite sums.\nSpecializes to `applyMatrix_add` and `applyMatrix_sub`. -/\ntheorem applyMatrix_pointwise\n (M : Fin ba... | [
{
"name": "applyMatrix_sub",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 714,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 7,
"automation_only": false,
"max_nestin... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Mathlib.Algebra.BigOperators.Ring.Finset
import LatticeCrypto.Ring.VectorBackend
/-!
# Shared Matrix Certification Scaffolding For Concrete NTTs
Centralizes the standa... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Mathlib.Algebra.BigOperators.Ring.Finset
import LatticeCrypto.Ring.VectorBackend
/-!
# Shared Matrix Certification Scaffolding For Concrete NTTs
Centralizes the standa... | @@ -51,6 +51,37 @@
def idMatrix (n : Nat) (row col : Fin n) : Coeff :=
if col = row then 1 else 0
+/-- Pointwise distributivity of `applyMatrix` over a binary backend operation
+`op` whose coefficient image distributes over multiplication and finite sums.
+Specializes to `applyMatrix_add` and `applyMatrix_sub`. -... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_facd5529a156_0 | c029d01003eb55b7 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/Enforcement.lean | Enforcement | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "probEvent_counting_budget_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n calc\n Pr[ fun z => p z.1 ∧ z.2 ≤ qb | countingOracle.simulate oa 0]\n = Pr[ fun z => p z.1 | countin... | [
{
"name": "fst_map_run_simulateQ",
"text": "/-- When the computation is within its query bound, enforcement is transparent:\nthe output distribution is identical to running without enforcement. -/\ntheorem fst_map_run_simulateQ {oa : OracleComp spec α} {qb : ι → ℕ}\n (h : IsPerIndexQueryBound oa qb) :\n ... | [
{
"name": "probEvent_counting_budget_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 19,
"n_chars": 1018,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 4,
"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 VCVio.OracleComp.QueryTracking.QueryBound
/-!
# Enforcement Oracle
Oracle wrapper that enforces a query budget by silently dropping queries beyond
the budget. This imp... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.OracleComp.QueryTracking.QueryBound
/-!
# Enforcement Oracle
Oracle wrapper that enforces a query budget by silently dropping queries beyond
the budget. This imp... | @@ -53,13 +53,42 @@
else
pure (default, budget) := rfl
+/-- When the computation is within its query bound, enforcement is transparent:
+the output distribution is identical to running without enforcement. -/
+theorem fst_map_run_simulateQ {oa : OracleComp spec α} {qb : ι → ℕ}
+ (h : IsPerIndexQuer... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_facd5529a156_1 | efbe219a42d7c8ff | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/Enforcement.lean | Enforcement | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "probEvent_counting_budget_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n calc\n Pr[ fun z => p z.1 ∧ z.2 ≤ qb | countingOracle.simulate oa 0]\n = Pr[ fun z => p z.1 | countin... | [
{
"name": "fst_map_run_simulateQ",
"text": "/-- When the computation is within its query bound, enforcement is transparent:\nthe output distribution is identical to running without enforcement. -/\ntheorem fst_map_run_simulateQ {oa : OracleComp spec α} {qb : ι → ℕ}\n (h : IsPerIndexQueryBound oa qb) :\n ... | [
{
"name": "probEvent_counting_budget_eq_enforce",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 11,
"n_chars": 552,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": f... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.OracleComp.QueryTracking.QueryBound
/-!
# Enforcement Oracle
Oracle wrapper that enforces a query budget by silently dropping queries beyond
the budget. This imp... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.OracleComp.QueryTracking.QueryBound
/-!
# Enforcement Oracle
Oracle wrapper that enforces a query budget by silently dropping queries beyond
the budget. This imp... | @@ -53,13 +53,42 @@
else
pure (default, budget) := rfl
+/-- When the computation is within its query bound, enforcement is transparent:
+the output distribution is identical to running without enforcement. -/
+theorem fst_map_run_simulateQ {oa : OracleComp spec α} {qb : ι → ℕ}
+ (h : IsPerIndexQuer... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_facd5529a156_2 | b0953b48f7c94d61 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/Enforcement.lean | Enforcement | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "probEvent_counting_budget_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n calc\n Pr[ fun z => p z.1 ∧ z.2 ≤ qb | countingOracle.simulate oa 0]\n = Pr[ fun z => p z.1 | countin... | [
{
"name": "fst_map_run_simulateQ",
"text": "/-- When the computation is within its query bound, enforcement is transparent:\nthe output distribution is identical to running without enforcement. -/\ntheorem fst_map_run_simulateQ {oa : OracleComp spec α} {qb : ι → ℕ}\n (h : IsPerIndexQueryBound oa qb) :\n ... | [
{
"name": "probEvent_counting_budget_le_enforce",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 9,
"n_chars": 456,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fa... | 3 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.OracleComp.QueryTracking.QueryBound
/-!
# Enforcement Oracle
Oracle wrapper that enforces a query budget by silently dropping queries beyond
the budget. This imp... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.OracleComp.QueryTracking.QueryBound
/-!
# Enforcement Oracle
Oracle wrapper that enforces a query budget by silently dropping queries beyond
the budget. This imp... | @@ -53,13 +53,42 @@
else
pure (default, budget) := rfl
+/-- When the computation is within its query bound, enforcement is transparent:
+the output distribution is identical to running without enforcement. -/
+theorem fst_map_run_simulateQ {oa : OracleComp spec α} {qb : ι → ℕ}
+ (h : IsPerIndexQuer... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_fa0287baf367_0 | 5033688f71d380a5 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/StateSeparating/IdenticalUntilBad.lean | IdenticalUntilBad | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "advantage_le_queryBound_mul_slack_plus_probEvent_bad",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine (advantage_le_expectedQuerySlack_plus_probEvent_bad\n h₀ h₁ s_init charged... | [
{
"name": "advantage_le_expectedQuerySlack_plus_probEvent_bad",
"text": "/-- State-dependent ε-perturbed identical-until-bad with output bad flag. -/\ntheorem advantage_le_expectedQuerySlack_plus_probEvent_bad\n (h₀ h₁ : QueryImpl.Stateful unifSpec E (σ × Bool))\n (s_init : σ)\n (chargedQuery : E.D... | [
{
"name": "advantage_le_queryBound_mul_slack_plus_probEvent_bad",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 29,
"n_chars": 1433,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"au... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.SimulateQ
import VCVio.StateSeparating.Advantage
/-!
# State-separating handlers: identical-until-bad
Identical-until-bad wrappers for `... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.SimulateQ
import VCVio.StateSeparating.Advantage
/-!
# State-separating handlers: identical-until-bad
Identical-until-bad wrappers for `... | @@ -27,6 +27,46 @@
∀ (t : E.Domain) (p : σ × Bool), p.2 = false → Inv p.1 →
∀ z ∈ support ((h t).run p), Inv z.2.1
+/-- State-dependent ε-perturbed identical-until-bad with output bad flag. -/
+theorem advantage_le_expectedQuerySlack_plus_probEvent_bad
+ (h₀ h₁ : QueryImpl.Stateful unifSpec E (σ × Bool))
+... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_fa0287baf367_1 | 64abfe7667aa49a0 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/StateSeparating/IdenticalUntilBad.lean | IdenticalUntilBad | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "advantage_le_queryBound_mul_slack_plus_probEvent_bad",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine (advantage_le_expectedQuerySlack_plus_probEvent_bad\n h₀ h₁ s_init charged... | [
{
"name": "advantage_le_expectedQuerySlack_plus_probEvent_bad",
"text": "/-- State-dependent ε-perturbed identical-until-bad with output bad flag. -/\ntheorem advantage_le_expectedQuerySlack_plus_probEvent_bad\n (h₀ h₁ : QueryImpl.Stateful unifSpec E (σ × Bool))\n (s_init : σ)\n (chargedQuery : E.D... | [
{
"name": "advantage_le_expectedQuerySlack_plus_probEvent_bad_of_inv",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 36,
"n_chars": 1874,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 2,
"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 VCVio.ProgramLogic.Relational.SimulateQ
import VCVio.StateSeparating.Advantage
/-!
# State-separating handlers: identical-until-bad
Identical-until-bad wrappers for `... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.SimulateQ
import VCVio.StateSeparating.Advantage
/-!
# State-separating handlers: identical-until-bad
Identical-until-bad wrappers for `... | @@ -27,6 +27,46 @@
∀ (t : E.Domain) (p : σ × Bool), p.2 = false → Inv p.1 →
∀ z ∈ support ((h t).run p), Inv z.2.1
+/-- State-dependent ε-perturbed identical-until-bad with output bad flag. -/
+theorem advantage_le_expectedQuerySlack_plus_probEvent_bad
+ (h₀ h₁ : QueryImpl.Stateful unifSpec E (σ × Bool))
+... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_fa0287baf367_2 | 7bc1fd613046674b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/StateSeparating/IdenticalUntilBad.lean | IdenticalUntilBad | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "advantage_le_expectedQuerySlack_plus_probEvent_bad_of_inv_preserved",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n have h_cost_eq :\n expectedQuerySlack h₀ chargedQuer... | [
{
"name": "advantage_le_expectedQuerySlack_plus_probEvent_bad_of_inv",
"text": "/-- Invariant-gated state-dependent ε-perturbed identical-until-bad.\n\nThe costly-step TV hypothesis is required only for states satisfying `Inv`.\nThe generated query-slack function charges the intended `ε s` on invariant stat... | [
{
"name": "advantage_le_expectedQuerySlack_plus_probEvent_bad_of_inv_preserved",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 40,
"n_chars": 2177,
"n_subproofs": 1,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structu... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.SimulateQ
import VCVio.StateSeparating.Advantage
/-!
# State-separating handlers: identical-until-bad
Identical-until-bad wrappers for `... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.SimulateQ
import VCVio.StateSeparating.Advantage
/-!
# State-separating handlers: identical-until-bad
Identical-until-bad wrappers for `... | @@ -67,6 +67,41 @@
h_mono₀ A h_bound s_init
exact (ENNReal.ofReal_le_ofReal h_adv_le_tv).trans h_bridge
+/-- Invariant-gated state-dependent ε-perturbed identical-until-bad.
+
+The costly-step TV hypothesis is required only for states satisfying `Inv`.
+The generated query-slack function charges the inten... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_bf5b99417dc0_0 | c0a9b364c6124e5b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/EvalDist/List.lean | List | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "cons_mem_finSupport_seq_map_cons_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa only [mem_finSupport_iff_mem_support] using cons_mem_support_seq_map_cons_iff mx my x xs\n\nomit... | [
{
"name": "cons_mem_support_seq_map_cons_iff",
"text": "lemma cons_mem_support_seq_map_cons_iff [LawfulMonad m]\n (mx : m α) (my : m (List α)) (x : α) (xs : List α) :\n x :: xs ∈ support (cons <$> mx <*> my) ↔ x ∈ support mx ∧ xs ∈ support my := by\n rw [support_seq_map_eq_image2, Set.mem_image2_iff ... | [
{
"name": "cons_mem_finSupport_seq_map_cons_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 439,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": tr... | 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 ToMathlib.General
import VCVio.EvalDist.Defs.NeverFails
/-!
# Distribution Semantics for Computations with Lists and Vectors
This file contains lemmas for... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import ToMathlib.General
import VCVio.EvalDist.Defs.NeverFails
/-!
# Distribution Semantics for Computations with Lists and Vectors
This file contains lemmas for... | @@ -26,10 +26,19 @@
section cons_append
omit [MonadLiftT m SPMF] [LawfulMonadLiftT m SPMF] [EvalDistCompatible m] in
+lemma cons_mem_support_seq_map_cons_iff [LawfulMonad m]
+ (mx : m α) (my : m (List α)) (x : α) (xs : List α) :
+ x :: xs ∈ support (cons <$> mx <*> my) ↔ x ∈ support mx ∧ xs ∈ support my := 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_54775c566c7b_0 | 330302d180cf9088 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/Fork.lean | Fork | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "queryLog_length_eq_outer_inr_count",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := preservesInv_layered (M := M) (Commit := Commit) (Chal := Chal)\n (Inv := fun s w => s.2.l... | [
{
"name": "support_step_inr",
"text": "/-- Support of one `Sum.inr mc` step: cache hit returns the cached value with no outer\nlog entry; cache miss issues a `Sum.inr ()` query, logs it, caches the response, and\nappends `mc` to the trace's internal `queryLog`. -/\nprivate lemma support_step_inr\n (mc : ... | [
{
"name": "queryLog_length_eq_outer_inr_count",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 37,
"n_chars": 1836,
"n_subproofs": 3,
"n_tactics": 21,
"cyclomatic": 3,
"n_automation": 11,
"n_rewrites": 2,
"n_structural": 4,
"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.CryptoFoundations.FiatShamir.Sigma
import VCVio.CryptoFoundations.FiatShamir.QueryBounds
import VCVio.CryptoFoundations.SeededFork
import VCVio.Crypt... | /-
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
import VCVio.CryptoFoundations.FiatShamir.QueryBounds
import VCVio.CryptoFoundations.SeededFork
import VCVio.Crypt... | @@ -252,6 +252,65 @@
· rintro ⟨_, ⟨u, rfl⟩, hzeq⟩; exact ⟨u, hzeq⟩
· rintro ⟨u, rfl⟩; exact ⟨_, ⟨u, rfl⟩, rfl⟩
+/-- Support of one `Sum.inr mc` step: cache hit returns the cached value with no outer
+log entry; cache miss issues a `Sum.inr ()` query, logs it, caches the response, and
+appends `mc` to the trace'... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_54775c566c7b_1 | 28817a038f88b4a2 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/Fork.lean | Fork | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "inner_prefix_det",
"depth": 1,
"n_commands": 0,
"n_lines": 179,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n induction Y using OracleComp.inductionOn generalizing\n c₀ l₀ z₁ z₂ outerLog₁ outerLog₂ p suffix₁ suff... | [
{
"name": "queryLog_extends_l₀",
"text": "/-- Prefix monotonicity: running `(simulateQ (unifFwd + roImpl) Y).run (c₀, l₀)` produces a\nfinal simulator state whose `queryLog` component extends `l₀`. The resulting list always\nstarts with the initial `l₀`: cache misses only append entries, and cache hits plus... | [
{
"name": "inner_prefix_det",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 204,
"n_chars": 12061,
"n_subproofs": 39,
"n_tactics": 181,
"cyclomatic": 8,
"n_automation": 23,
"n_rewrites": 40,
"n_structural": 30,
"automation_only": false,
"... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma
import VCVio.CryptoFoundations.FiatShamir.QueryBounds
import VCVio.CryptoFoundations.SeededFork
import VCVio.Crypt... | /-
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
import VCVio.CryptoFoundations.FiatShamir.QueryBounds
import VCVio.CryptoFoundations.SeededFork
import VCVio.Crypt... | @@ -224,6 +224,105 @@
one place. The `Sum.inl` step always issues a forwarded uniform query and logs it; the
`Sum.inr` step branches on whether the cache already contains the asked hash point. -/
+/-- Prefix monotonicity: running `(simulateQ (unifFwd + roImpl) Y).run (c₀, l₀)` produces a
+final simulator state whos... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_54775c566c7b_2 | 4713d912dd9e8bb9 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/Fork.lean | Fork | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "inner_prefix_det",
"depth": 1,
"n_commands": 0,
"n_lines": 179,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n induction Y using OracleComp.inductionOn generalizing\n c₀ l₀ z₁ z₂ outerLog₁ outerLog₂ p suffix₁ suff... | [
{
"name": "queryLog_extends_l₀",
"text": "/-- Prefix monotonicity: running `(simulateQ (unifFwd + roImpl) Y).run (c₀, l₀)` produces a\nfinal simulator state whose `queryLog` component extends `l₀`. The resulting list always\nstarts with the initial `l₀`: cache misses only append entries, and cache hits plus... | [
{
"name": "inner_prefix_det_one_more_inr",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 190,
"n_chars": 11227,
"n_subproofs": 36,
"n_tactics": 166,
"cyclomatic": 7,
"n_automation": 21,
"n_rewrites": 35,
"n_structural": 27,
"automation_only":... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma
import VCVio.CryptoFoundations.FiatShamir.QueryBounds
import VCVio.CryptoFoundations.SeededFork
import VCVio.Crypt... | /-
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
import VCVio.CryptoFoundations.FiatShamir.QueryBounds
import VCVio.CryptoFoundations.SeededFork
import VCVio.Crypt... | @@ -224,6 +224,105 @@
one place. The `Sum.inl` step always issues a forwarded uniform query and logs it; the
`Sum.inr` step branches on whether the cache already contains the asked hash point. -/
+/-- Prefix monotonicity: running `(simulateQ (unifFwd + roImpl) Y).run (c₀, l₀)` produces a
+final simulator state whos... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_54775c566c7b_3 | 681a604289ec6314 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/Fork.lean | Fork | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "queryLog_length_eq_outer_inr_count",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := preservesInv_layered (M := M) (Commit := Commit) (Chal := Chal)\n (Inv := fun s w => s.2.l... | [
{
"name": "support_step_inr",
"text": "/-- Support of one `Sum.inr mc` step: cache hit returns the cached value with no outer\nlog entry; cache miss issues a `Sum.inr ()` query, logs it, caches the response, and\nappends `mc` to the trace's internal `queryLog`. -/\nprivate lemma support_step_inr\n (mc : ... | [
{
"name": "runTrace_queryLog_length_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 27,
"n_chars": 1383,
"n_subproofs": 3,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
... | 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.CryptoFoundations.FiatShamir.Sigma
import VCVio.CryptoFoundations.FiatShamir.QueryBounds
import VCVio.CryptoFoundations.SeededFork
import VCVio.Crypt... | /-
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
import VCVio.CryptoFoundations.FiatShamir.QueryBounds
import VCVio.CryptoFoundations.SeededFork
import VCVio.Crypt... | @@ -252,6 +252,65 @@
· rintro ⟨_, ⟨u, rfl⟩, hzeq⟩; exact ⟨u, hzeq⟩
· rintro ⟨u, rfl⟩; exact ⟨_, ⟨u, rfl⟩, rfl⟩
+/-- Support of one `Sum.inr mc` step: cache hit returns the cached value with no outer
+log entry; cache miss issues a `Sum.inr ()` query, logs it, caches the response, and
+appends `mc` to the trace'... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_54775c566c7b_4 | 2c8365ccc1177c38 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/Fork.lean | Fork | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "runTrace_cache_outer_lockstep",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n unfold replayFirstRun runTrace at hx\n simp only [bind_pure_comp, simulateQ_map, WriterT.run_m... | [
{
"name": "queryLog_cache_outer_lockstep",
"text": "/-- Lockstep value invariant for `runTrace`'s inner simulation. Three coupled invariants\ntravel together along the simulation:\n\n* **(prefix)** the trace's internal `queryLog` only ever extends `l₀`;\n* **(monotonicity)** any pre-existing entry in `c₀` i... | [
{
"name": "runTrace_cache_outer_lockstep",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 40,
"n_chars": 1950,
"n_subproofs": 7,
"n_tactics": 25,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 6,
"automation_only": false,... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma
import VCVio.CryptoFoundations.FiatShamir.QueryBounds
import VCVio.CryptoFoundations.SeededFork
import VCVio.Crypt... | /-
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
import VCVio.CryptoFoundations.FiatShamir.QueryBounds
import VCVio.CryptoFoundations.SeededFork
import VCVio.Crypt... | @@ -224,6 +224,187 @@
one place. The `Sum.inl` step always issues a forwarded uniform query and logs it; the
`Sum.inr` step branches on whether the cache already contains the asked hash point. -/
+/-- Lockstep value invariant for `runTrace`'s inner simulation. Three coupled invariants
+travel together along the sim... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_54775c566c7b_5 | e39cd17d41069d3a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/Fork.lean | Fork | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "queryLog_length_eq_outer_inr_count",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := preservesInv_layered (M := M) (Commit := Commit) (Chal := Chal)\n (Inv := fun s w => s.2.l... | [
{
"name": "support_step_inl",
"text": "/-- Support of one `Sum.inl n` step: forward the uniform query, log it, leave the\nsimulator state unchanged. -/\nprivate lemma support_step_inl\n (n : ℕ) (s : simSt M Commit Chal)\n (z : ((unifSpec + (M × Commit →ₒ Chal)).Range (Sum.inl n) × simSt M Commit Chal)... | [
{
"name": "runTrace_forkPoint_CfReachable",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 25,
"n_chars": 1508,
"n_subproofs": 4,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false... | 6 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.CryptoFoundations.FiatShamir.Sigma
import VCVio.CryptoFoundations.FiatShamir.QueryBounds
import VCVio.CryptoFoundations.SeededFork
import VCVio.Crypt... | /-
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
import VCVio.CryptoFoundations.FiatShamir.QueryBounds
import VCVio.CryptoFoundations.SeededFork
import VCVio.Crypt... | @@ -236,6 +236,34 @@
one place. The `Sum.inl` step always issues a forwarded uniform query and logs it; the
`Sum.inr` step branches on whether the cache already contains the asked hash point. -/
+/-- Support of one `Sum.inl n` step: forward the uniform query, log it, leave the
+simulator state unchanged. -/
+privat... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_54775c566c7b_6 | 7830d4b195e77a66 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/Fork.lean | Fork | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "inner_prefix_det",
"depth": 1,
"n_commands": 0,
"n_lines": 179,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n induction Y using OracleComp.inductionOn generalizing\n c₀ l₀ z₁ z₂ outerLog₁ outerLog₂ p suffix₁ suff... | [
{
"name": "queryLog_extends_l₀",
"text": "/-- Prefix monotonicity: running `(simulateQ (unifFwd + roImpl) Y).run (c₀, l₀)` produces a\nfinal simulator state whose `queryLog` component extends `l₀`. The resulting list always\nstarts with the initial `l₀`: cache misses only append entries, and cache hits plus... | [
{
"name": "runTrace_queryLog_take_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 47,
"n_chars": 2631,
"n_subproofs": 7,
"n_tactics": 26,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 2,
"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.CryptoFoundations.FiatShamir.Sigma
import VCVio.CryptoFoundations.FiatShamir.QueryBounds
import VCVio.CryptoFoundations.SeededFork
import VCVio.Crypt... | /-
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
import VCVio.CryptoFoundations.FiatShamir.QueryBounds
import VCVio.CryptoFoundations.SeededFork
import VCVio.Crypt... | @@ -224,6 +224,105 @@
one place. The `Sum.inl` step always issues a forwarded uniform query and logs it; the
`Sum.inr` step branches on whether the cache already contains the asked hash point. -/
+/-- Prefix monotonicity: running `(simulateQ (unifFwd + roImpl) Y).run (c₀, l₀)` produces a
+final simulator state whos... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_54775c566c7b_7 | b7d1fed753301d89 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/FiatShamir/Sigma/Fork.lean | Fork | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "inner_prefix_det",
"depth": 1,
"n_commands": 0,
"n_lines": 179,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n induction Y using OracleComp.inductionOn generalizing\n c₀ l₀ z₁ z₂ outerLog₁ outerLog₂ p suffix₁ suff... | [
{
"name": "queryLog_extends_l₀",
"text": "/-- Prefix monotonicity: running `(simulateQ (unifFwd + roImpl) Y).run (c₀, l₀)` produces a\nfinal simulator state whose `queryLog` component extends `l₀`. The resulting list always\nstarts with the initial `l₀`: cache misses only append entries, and cache hits plus... | [
{
"name": "runTrace_target_eq_of_mem_forkReplay",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 141,
"n_chars": 7886,
"n_subproofs": 33,
"n_tactics": 132,
"cyclomatic": 6,
"n_automation": 9,
"n_rewrites": 25,
"n_structural": 24,
"automation_o... | 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.CryptoFoundations.FiatShamir.Sigma
import VCVio.CryptoFoundations.FiatShamir.QueryBounds
import VCVio.CryptoFoundations.SeededFork
import VCVio.Crypt... | /-
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
import VCVio.CryptoFoundations.FiatShamir.QueryBounds
import VCVio.CryptoFoundations.SeededFork
import VCVio.Crypt... | @@ -236,6 +236,105 @@
one place. The `Sum.inl` step always issues a forwarded uniform query and logs it; the
`Sum.inr` step branches on whether the cache already contains the asked hash point. -/
+/-- Prefix monotonicity: running `(simulateQ (unifFwd + roImpl) Y).run (c₀, l₀)` produces a
+final simulator state whos... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_db6d1ca5e712_0 | f5239fc7791ff86c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/FromUnary.lean | FromUnary | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "relTriple_prod_of_wpProp",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n relTriple_prod\n ((OracleComp.ProgramLogic.StdDo.wpProp_iff_forall_support (spec := spec₁) oa P).1 hP)\n ((Orac... | [
{
"name": "relTriple_prod",
"text": "/-- Core lift: two `support`-style unary postconditions combine into a relational\ncoupling. The product coupling `evalDist oa ⊗ evalDist ob` witnesses the conjunction,\nusing the canonical `MonadLiftT (OracleComp spec) PMF` to ensure neither side has\nfailure mass. -/\n... | [
{
"name": "relTriple_prod_of_wpProp",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 574,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"m... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.ProgramLogic.Unary.StdDoBridge
/-!
# Lifting unary `Std.Do` triples to relational couplings
Two `OracleComp` computat... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.Basic
import VCVio.ProgramLogic.Unary.StdDoBridge
/-!
# Lifting unary `Std.Do` triples to relational couplings
Two `OracleComp` computat... | @@ -40,11 +40,40 @@
variable [IsUniformSpec spec₁] [IsUniformSpec spec₂]
variable {α β : Type}
+/-- Core lift: two `support`-style unary postconditions combine into a relational
+coupling. The product coupling `evalDist oa ⊗ evalDist ob` witnesses the conjunction,
+using the canonical `MonadLiftT (OracleComp spec) ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e29e6dc4dfc4_0 | e8da9af92ac51460 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/NTT.lean | NTT | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 3 | [
{
"theorem_name": "ntt_surjective",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n letI : NeZero modulus := ⟨by norm_num [modulus]⟩\n letI : Fintype Coeff := by\n dsimp [Coeff]\n exact ZMod.fintype mo... | [
{
"name": "ntt_injective",
"text": "private theorem ntt_injective : Function.Injective ntt := by\n intro f g h\n have hInv := congrArg invNTT h\n simpa [invNTT_ntt] using hInv\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 141,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"... | [
{
"name": "ntt_surjective",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 336,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_nesting"... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLKEM.Arithmetic
import LatticeCrypto.Ring.NTTCert
import Mathlib.Algebra.BigOperators.Ring.Finset
/-!
# Concrete NTT for ML-KEM
Pure-Lean executable ker... | /-
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.Arithmetic
import LatticeCrypto.Ring.NTTCert
import Mathlib.Algebra.BigOperators.Ring.Finset
/-!
# Concrete NTT for ML-KEM
Pure-Lean executable ker... | @@ -234,8 +234,19 @@
left_inv _ := rfl
right_inv fHat := by cases fHat; rfl
-private theorem ntt_surjective : Function.Surjective ntt := sorry
+private theorem ntt_injective : Function.Injective ntt := by
+ intro f g h
+ have hInv := congrArg invNTT h
+ simpa [invNTT_ntt] using hInv
+private theorem ntt_su... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e29e6dc4dfc4_1 | 228cea786cc1f0ce | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/NTT.lean | NTT | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "ntt_add_toRq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n LatticeCrypto.NTTCert.applyMatrix_add (backend := polyBackend) nttMatrix hadd_rq f g",
"n_chars": 87,
"n_subproofs": 0,
... | [
{
"name": "hadd_rq",
"text": "private theorem hadd_rq (f g : Rq) :\n polyBackend.coeff (f + g) = fun i => polyBackend.coeff f i + polyBackend.coeff g i := by\n funext i\n change ((LatticeCrypto.vectorNegacyclicRing Coeff ringDegree).add f g).get i = f.get i + g.get i\n simp\n\n",
"fan_in": 1,
... | [
{
"name": "ntt_add_toRq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 254,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": ... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLKEM.Arithmetic
import LatticeCrypto.Ring.NTTCert
import Mathlib.Algebra.BigOperators.Ring.Finset
/-!
# Concrete NTT for ML-KEM
Pure-Lean executable ker... | /-
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.Arithmetic
import LatticeCrypto.Ring.NTTCert
import Mathlib.Algebra.BigOperators.Ring.Finset
/-!
# Concrete NTT for ML-KEM
Pure-Lean executable ker... | @@ -255,6 +255,12 @@
_ = ntt f := by rw [invNTT_ntt]
_ = fHat := hf
+private theorem hadd_rq (f g : Rq) :
+ polyBackend.coeff (f + g) = fun i => polyBackend.coeff f i + polyBackend.coeff g i := by
+ funext i
+ change ((LatticeCrypto.vectorNegacyclicRing Coeff ringDegree).add f g).get i = f.get i + g.ge... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e29e6dc4dfc4_2 | 8ea5a428a93002b3 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLKEM/Concrete/NTT.lean | NTT | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "ntt_sub_toRq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n LatticeCrypto.NTTCert.applyMatrix_sub (backend := polyBackend) nttMatrix hsub_rq f g",
"n_chars": 87,
"n_subproofs": 0,
... | [
{
"name": "hsub_rq",
"text": "private theorem hsub_rq (f g : Rq) :\n polyBackend.coeff (f - g) = fun i => polyBackend.coeff f i - polyBackend.coeff g i := by\n funext i\n change ((LatticeCrypto.vectorNegacyclicRing Coeff ringDegree).sub f g).get i = f.get i - g.get i\n simp\n\n",
"fan_in": 1,
... | [
{
"name": "ntt_sub_toRq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 264,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": ... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLKEM.Arithmetic
import LatticeCrypto.Ring.NTTCert
import Mathlib.Algebra.BigOperators.Ring.Finset
/-!
# Concrete NTT for ML-KEM
Pure-Lean executable ker... | /-
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.Arithmetic
import LatticeCrypto.Ring.NTTCert
import Mathlib.Algebra.BigOperators.Ring.Finset
/-!
# Concrete NTT for ML-KEM
Pure-Lean executable ker... | @@ -261,6 +261,12 @@
change ((LatticeCrypto.vectorNegacyclicRing Coeff ringDegree).add f g).get i = f.get i + g.get i
simp
+private theorem hsub_rq (f g : Rq) :
+ polyBackend.coeff (f - g) = fun i => polyBackend.coeff f i - polyBackend.coeff g i := by
+ funext i
+ change ((LatticeCrypto.vectorNegacyclicRin... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_1e2c192ef09c_10 | bcb792a5f4ed6c8d | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/ProgrammingOracle.lean | ProgrammingOracle | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "isQueryBoundP_run_simulateQ_withProgramming",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n OracleComp.IsQueryBoundP.simulateQ_run_of_step h\n (fun t hp s => isQueryBoundP_run_withProgram... | [
{
"name": "isQueryBoundP_run_withProgramming",
"text": "private lemma isQueryBoundP_run_withProgramming\n (so : QueryImpl spec (OracleComp spec')) (policy : ProgrammingPolicy spec)\n (t : spec.Domain) {q : ι' → Prop} [DecidablePred q] {n : ℕ}\n (h : OracleComp.IsQueryBoundP (so t) q n) (s : spec.Qu... | [
{
"name": "isQueryBoundP_run_simulateQ_withProgramming",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 16,
"n_chars": 815,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_o... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.OracleComp.QueryTracking.CachingOracle
import VCVio.OracleComp.SimSemantics.StateT.StateProjection
/-!
# Programmable Oracles
This file defines combinators for *... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.OracleComp.QueryTracking.CachingOracle
import VCVio.OracleComp.SimSemantics.StateT.StateProjection
/-!
# Programmable Oracles
This file defines combinators for *... | @@ -183,6 +183,22 @@
[IsUniformSpec spec']
omit [IsUniformSpec spec'] in
+private lemma isQueryBoundP_run_withProgramming
+ (so : QueryImpl spec (OracleComp spec')) (policy : ProgrammingPolicy spec)
+ (t : spec.Domain) {q : ι' → Prop} [DecidablePred q] {n : ℕ}
+ (h : OracleComp.IsQueryBoundP (so t) q 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_1e2c192ef09c_11 | dc6a0c60681c857f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/ProgrammingOracle.lean | ProgrammingOracle | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "isPerIndexQueryBound_run_simulateQ_withProgramming",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n OracleComp.IsPerIndexQueryBound.simulateQ_run_of_uniform_step h\n (fun t s => isPerIndex... | [
{
"name": "isPerIndexQueryBound_run_withProgramming",
"text": "private lemma isPerIndexQueryBound_run_withProgramming [IsUniformSpec spec]\n (so : QueryImpl spec (OracleComp spec)) (policy : ProgrammingPolicy spec) (t : spec.Domain)\n {qb : ι → ℕ} (h : OracleComp.IsPerIndexQueryBound (so t) qb) (s : s... | [
{
"name": "isPerIndexQueryBound_run_simulateQ_withProgramming",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 12,
"n_chars": 655,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"autom... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.OracleComp.QueryTracking.CachingOracle
import VCVio.OracleComp.SimSemantics.StateT.StateProjection
/-!
# Programmable Oracles
This file defines combinators for *... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.OracleComp.QueryTracking.CachingOracle
import VCVio.OracleComp.SimSemantics.StateT.StateProjection
/-!
# Programmable Oracles
This file defines combinators for *... | @@ -183,6 +183,21 @@
[IsUniformSpec spec']
omit [IsUniformSpec spec'] in
+private lemma isPerIndexQueryBound_run_withProgramming [IsUniformSpec spec]
+ (so : QueryImpl spec (OracleComp spec)) (policy : ProgrammingPolicy spec) (t : spec.Domain)
+ {qb : ι → ℕ} (h : OracleComp.IsPerIndexQueryBound (so t) qb) (... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6f6b7b675592_0 | 57f669f0b8e18c31 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/LoggingOracle.lean | LoggingOracle | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "probFailure_simulateQ",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loggingOracle, QueryImpl.probFailure_run_simulateQ_withLogging, simulateQ_ofLift_eq_self]",
"n_chars": 99,
... | [
{
"name": "probFailure_run_simulateQ_withLogging",
"text": "/-- Logging preserves failure probability: for any base monad `m` with `MonadLiftT m SPMF`,\nwrapping an oracle implementation with `withLogging` does not change the probability of failure.\nWhen `m = OracleComp spec`, both sides are `0` (trivially... | [
{
"name": "probFailure_simulateQ",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 468,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_... | 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.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
import VCVio.Oracle... | /-
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.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
import VCVio.Oracle... | @@ -73,6 +73,17 @@
simulateQ so mx :=
so.fst_map_run_withTraceAppend (fun (t : spec.Domain) u => ([⟨t, u⟩] : QueryLog spec)) mx
+/-- Logging preserves failure probability: for any base monad `m` with `MonadLiftT m SPMF`,
+wrapping an oracle implementation with `withLogging` does not change the probability of ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6f6b7b675592_1 | d6b4eefd2585c9b0 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/LoggingOracle.lean | LoggingOracle | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 4 | [
{
"theorem_name": "fst_map_run_simulateQ",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loggingOracle, QueryImpl.fst_map_run_withLogging, simulateQ_ofLift_eq_self]",
"n_chars": 85,
"n_subproofs... | [
{
"name": "fst_map_run_withLogging",
"text": "lemma fst_map_run_withLogging [LawfulMonad m] (so : QueryImpl spec m) (mx : OracleComp spec α) :\n Prod.fst <$> (simulateQ (so.withLogging) mx).run =\n simulateQ so mx :=\n so.fst_map_run_withTraceAppend (fun (t : spec.Domain) u => ([⟨t, u⟩] : QueryLog sp... | [
{
"name": "fst_map_run_simulateQ",
"fan_in": 8,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 259,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_n... | 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.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
import VCVio.Oracle... | /-
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.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
import VCVio.Oracle... | @@ -68,6 +68,11 @@
lemma withLogging_apply (so : QueryImpl spec m) (t : spec.Domain) :
so.withLogging t = do let u ← so t; tell [⟨t, u⟩]; return u := rfl
+lemma fst_map_run_withLogging [LawfulMonad m] (so : QueryImpl spec m) (mx : OracleComp spec α) :
+ Prod.fst <$> (simulateQ (so.withLogging) mx).run =
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6f6b7b675592_2 | b68cb2592dd29f87 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/LoggingOracle.lean | LoggingOracle | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "NeverFail_run_simulateQ_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loggingOracle, QueryImpl.NeverFail_run_simulateQ_withLogging_iff, simulateQ_ofLift_eq_self]",
"n_chars"... | [
{
"name": "NeverFail_run_simulateQ_withLogging_iff",
"text": "lemma NeverFail_run_simulateQ_withLogging_iff [LawfulMonad m] [MonadLiftT m SPMF]\n [LawfulMonadLiftT m SPMF]\n (so : QueryImpl spec m) (mx : OracleComp spec α) :\n NeverFail (simulateQ (so.withLogging) mx).run ↔ NeverFail (simulateQ so ... | [
{
"name": "NeverFail_run_simulateQ_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 412,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
import VCVio.Oracle... | /-
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.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
import VCVio.Oracle... | @@ -84,6 +84,13 @@
so.probFailure_run_simulateQ_withTraceAppend
(fun (t : spec.Domain) u => ([⟨t, u⟩] : QueryLog spec)) mx
+lemma NeverFail_run_simulateQ_withLogging_iff [LawfulMonad m] [MonadLiftT m SPMF]
+ [LawfulMonadLiftT m SPMF]
+ (so : QueryImpl spec m) (mx : OracleComp spec α) :
+ NeverFail (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_6f6b7b675592_3 | 90271288cb8f06f3 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/LoggingOracle.lean | LoggingOracle | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 4 | [
{
"theorem_name": "fst_map_run_simulateQ",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loggingOracle, QueryImpl.fst_map_run_withLogging, simulateQ_ofLift_eq_self]",
"n_chars": 85,
"n_subproofs... | [
{
"name": "fst_map_run_withLogging",
"text": "lemma fst_map_run_withLogging [LawfulMonad m] (so : QueryImpl spec m) (mx : OracleComp spec α) :\n Prod.fst <$> (simulateQ (so.withLogging) mx).run =\n simulateQ so mx :=\n so.fst_map_run_withTraceAppend (fun (t : spec.Domain) u => ([⟨t, u⟩] : QueryLog sp... | [
{
"name": "isTotalQueryBound_run_simulateQ_loggingOracle_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 326,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automat... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
import VCVio.Oracle... | /-
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.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
import VCVio.Oracle... | @@ -68,6 +68,11 @@
lemma withLogging_apply (so : QueryImpl spec m) (t : spec.Domain) :
so.withLogging t = do let u ← so t; tell [⟨t, u⟩]; return u := rfl
+lemma fst_map_run_withLogging [LawfulMonad m] (so : QueryImpl spec m) (mx : OracleComp spec α) :
+ Prod.fst <$> (simulateQ (so.withLogging) mx).run =
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6f6b7b675592_4 | c17133d3c701d986 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/LoggingOracle.lean | LoggingOracle | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 4 | [
{
"theorem_name": "fst_map_run_simulateQ",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loggingOracle, QueryImpl.fst_map_run_withLogging, simulateQ_ofLift_eq_self]",
"n_chars": 85,
"n_subproofs... | [
{
"name": "fst_map_run_withLogging",
"text": "lemma fst_map_run_withLogging [LawfulMonad m] (so : QueryImpl spec m) (mx : OracleComp spec α) :\n Prod.fst <$> (simulateQ (so.withLogging) mx).run =\n simulateQ so mx :=\n so.fst_map_run_withTraceAppend (fun (t : spec.Domain) u => ([⟨t, u⟩] : QueryLog sp... | [
{
"name": "isQueryBoundP_run_simulateQ_loggingOracle_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 381,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_... | 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.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
import VCVio.Oracle... | /-
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.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
import VCVio.Oracle... | @@ -68,6 +68,11 @@
lemma withLogging_apply (so : QueryImpl spec m) (t : spec.Domain) :
so.withLogging t = do let u ← so t; tell [⟨t, u⟩]; return u := rfl
+lemma fst_map_run_withLogging [LawfulMonad m] (so : QueryImpl spec m) (mx : OracleComp spec α) :
+ Prod.fst <$> (simulateQ (so.withLogging) mx).run =
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6f6b7b675592_5 | 31acaee73ceea973 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/LoggingOracle.lean | LoggingOracle | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 4 | [
{
"theorem_name": "fst_map_run_simulateQ",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loggingOracle, QueryImpl.fst_map_run_withLogging, simulateQ_ofLift_eq_self]",
"n_chars": 85,
"n_subproofs... | [
{
"name": "fst_map_run_withLogging",
"text": "lemma fst_map_run_withLogging [LawfulMonad m] (so : QueryImpl spec m) (mx : OracleComp spec α) :\n Prod.fst <$> (simulateQ (so.withLogging) mx).run =\n simulateQ so mx :=\n so.fst_map_run_withTraceAppend (fun (t : spec.Domain) u => ([⟨t, u⟩] : QueryLog sp... | [
{
"name": "isTotalQueryBound_run_simulateQ_withLogging_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 437,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automati... | 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.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
import VCVio.Oracle... | /-
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.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
import VCVio.Oracle... | @@ -68,6 +68,11 @@
lemma withLogging_apply (so : QueryImpl spec m) (t : spec.Domain) :
so.withLogging t = do let u ← so t; tell [⟨t, u⟩]; return u := rfl
+lemma fst_map_run_withLogging [LawfulMonad m] (so : QueryImpl spec m) (mx : OracleComp spec α) :
+ Prod.fst <$> (simulateQ (so.withLogging) mx).run =
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6f6b7b675592_6 | b771551f5dd93300 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/LoggingOracle.lean | LoggingOracle | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 4 | [
{
"theorem_name": "fst_map_run_simulateQ",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loggingOracle, QueryImpl.fst_map_run_withLogging, simulateQ_ofLift_eq_self]",
"n_chars": 85,
"n_subproofs... | [
{
"name": "fst_map_run_withLogging",
"text": "lemma fst_map_run_withLogging [LawfulMonad m] (so : QueryImpl spec m) (mx : OracleComp spec α) :\n Prod.fst <$> (simulateQ (so.withLogging) mx).run =\n simulateQ so mx :=\n so.fst_map_run_withTraceAppend (fun (t : spec.Domain) u => ([⟨t, u⟩] : QueryLog sp... | [
{
"name": "isQueryBoundP_run_simulateQ_withLogging_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 498,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_o... | 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.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
import VCVio.Oracle... | /-
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.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
import VCVio.Oracle... | @@ -68,6 +68,11 @@
lemma withLogging_apply (so : QueryImpl spec m) (t : spec.Domain) :
so.withLogging t = do let u ← so t; tell [⟨t, u⟩]; return u := rfl
+lemma fst_map_run_withLogging [LawfulMonad m] (so : QueryImpl spec m) (mx : OracleComp spec α) :
+ Prod.fst <$> (simulateQ (so.withLogging) mx).run =
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6f6b7b675592_7 | 20577ecbe4b1fbcd | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/LoggingOracle.lean | LoggingOracle | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 4 | [
{
"theorem_name": "fst_map_run_simulateQ",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loggingOracle, QueryImpl.fst_map_run_withLogging, simulateQ_ofLift_eq_self]",
"n_chars": 85,
"n_subproofs... | [
{
"name": "fst_map_run_withLogging",
"text": "lemma fst_map_run_withLogging [LawfulMonad m] (so : QueryImpl spec m) (mx : OracleComp spec α) :\n Prod.fst <$> (simulateQ (so.withLogging) mx).run =\n simulateQ so mx :=\n so.fst_map_run_withTraceAppend (fun (t : spec.Domain) u => ([⟨t, u⟩] : QueryLog sp... | [
{
"name": "isPerIndexQueryBound_run_simulateQ_loggingOracle_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 391,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"auto... | 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.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
import VCVio.Oracle... | /-
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.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
import VCVio.Oracle... | @@ -68,6 +68,11 @@
lemma withLogging_apply (so : QueryImpl spec m) (t : spec.Domain) :
so.withLogging t = do let u ← so t; tell [⟨t, u⟩]; return u := rfl
+lemma fst_map_run_withLogging [LawfulMonad m] (so : QueryImpl spec m) (mx : OracleComp spec α) :
+ Prod.fst <$> (simulateQ (so.withLogging) mx).run =
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6f6b7b675592_8 | 1770de7b9d7129bf | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/LoggingOracle.lean | LoggingOracle | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 4 | [
{
"theorem_name": "fst_map_run_simulateQ",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loggingOracle, QueryImpl.fst_map_run_withLogging, simulateQ_ofLift_eq_self]",
"n_chars": 85,
"n_subproofs... | [
{
"name": "fst_map_run_withLogging",
"text": "lemma fst_map_run_withLogging [LawfulMonad m] (so : QueryImpl spec m) (mx : OracleComp spec α) :\n Prod.fst <$> (simulateQ (so.withLogging) mx).run =\n simulateQ so mx :=\n so.fst_map_run_withTraceAppend (fun (t : spec.Domain) u => ([⟨t, u⟩] : QueryLog sp... | [
{
"name": "isPerIndexQueryBound_run_simulateQ_withLogging_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 505,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"autom... | 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.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
import VCVio.Oracle... | /-
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.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
import VCVio.Oracle... | @@ -68,6 +68,11 @@
lemma withLogging_apply (so : QueryImpl spec m) (t : spec.Domain) :
so.withLogging t = do let u ← so t; tell [⟨t, u⟩]; return u := rfl
+lemma fst_map_run_withLogging [LawfulMonad m] (so : QueryImpl spec m) (mx : OracleComp spec α) :
+ Prod.fst <$> (simulateQ (so.withLogging) mx).run =
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6f6b7b675592_9 | 66978be9c9039b96 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/LoggingOracle.lean | LoggingOracle | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "log_length_le_of_mem_support_run_simulateQ",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing n z with\n | pure x =>\n simp only... | [
{
"name": "run_simulateQ_loggingOracle_query_bind",
"text": "lemma run_simulateQ_loggingOracle_query_bind\n {ι : Type} {spec : OracleSpec.{0, 0} ι} {α : Type}\n (t : spec.Domain) (mx : spec.Range t → OracleComp spec α) :\n (simulateQ loggingOracle (liftM (query t) >>= mx)).run =\n (query t : O... | [
{
"name": "log_length_le_of_mem_support_run_simulateQ",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 27,
"n_chars": 1079,
"n_subproofs": 3,
"n_tactics": 15,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 3,
"automation_... | 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.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
import VCVio.Oracle... | /-
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.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
import VCVio.Oracle... | @@ -199,6 +199,15 @@
namespace OracleComp
+lemma run_simulateQ_loggingOracle_query_bind
+ {ι : Type} {spec : OracleSpec.{0, 0} ι} {α : Type}
+ (t : spec.Domain) (mx : spec.Range t → OracleComp spec α) :
+ (simulateQ loggingOracle (liftM (query t) >>= mx)).run =
+ (query t : OracleComp spec _) >>= fun... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_6f6b7b675592_10 | f4815bb71488300a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/LoggingOracle.lean | LoggingOracle | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "withQueryLog_self_log_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 32,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing v l₁ l₂ with\n | pure x =>\n rw [withQueryLog_pure, ... | [
{
"name": "withQueryLog_pure",
"text": "/-- `withQueryLog` of `pure x` produces `(x, [])` — no oracle queries,\nempty log. -/\n@[simp, grind =]\nlemma withQueryLog_pure {ι : Type} {spec : OracleSpec.{0, 0} ι} {α : Type} (x : α) :\n (pure x : OracleComp spec α).withQueryLog = pure (x, []) :=\n rfl\n\n",
... | [
{
"name": "withQueryLog_self_log_eq",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 43,
"n_chars": 2440,
"n_subproofs": 11,
"n_tactics": 30,
"cyclomatic": 2,
"n_automation": 25,
"n_rewrites": 5,
"n_structural": 12,
"automation_only": false,
... | 3 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
import VCVio.Oracle... | /-
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.QueryTracking.QueryBound
import VCVio.OracleComp.QueryTracking.Structures
import VCVio.OracleComp.QueryTracking.Tracing
import VCVio.Oracle... | @@ -216,6 +216,13 @@
mx.withQueryLog >>= fun p => Prod.map id (p.2 ++ ·) <$> (my p.1).withQueryLog := by
simp only [withQueryLog, simulateQ_bind, WriterT.run_bind']
+/-- `withQueryLog` of `pure x` produces `(x, [])` — no oracle queries,
+empty log. -/
+@[simp, grind =]
+lemma withQueryLog_pure {ι : Type} {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_e20c0f2db2e0_0 | 1f71d13e086ad640 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/Falcon/Concrete/ApproxArith.lean | ApproxArith | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "add_result_bounds",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n result_bounds_of_error (self.add_error a b)",
"n_chars": 46,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic":... | [
{
"name": "result_bounds_of_error",
"text": "/-- A relative-error bound `|result - target| ≤ ε · |target|` implies two-sided absolute\nbounds `(1 - ε)·|target| ≤ |result| ≤ (1 + ε)·|target|`. Specialized to each operation\nbelow. -/\nprivate theorem result_bounds_of_error {target result : ℝ}\n (herr : |r... | [
{
"name": "add_result_bounds",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 339,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesti... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.Falcon.Concrete.FloatLike
import LatticeCrypto.Falcon.Concrete.FPRBridge
import Mathlib.Analysis.SpecialFunctions.Pow.Real
/-!
# Approximate Arithmetic Fr... | /-
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.Falcon.Concrete.FloatLike
import LatticeCrypto.Falcon.Concrete.FPRBridge
import Mathlib.Analysis.SpecialFunctions.Pow.Real
/-!
# Approximate Arithmetic Fr... | @@ -72,11 +72,22 @@
/-! ### Derived Bounds -/
+/-- A relative-error bound `|result - target| ≤ ε · |target|` implies two-sided absolute
+bounds `(1 - ε)·|target| ≤ |result| ≤ (1 + ε)·|target|`. Specialized to each operation
+below. -/
+private theorem result_bounds_of_error {target result : ℝ}
+ (herr : |result... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e20c0f2db2e0_1 | 9738bd61699443e3 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/Falcon/Concrete/ApproxArith.lean | ApproxArith | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "add_result_bounds",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n result_bounds_of_error (self.add_error a b)",
"n_chars": 46,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic":... | [
{
"name": "result_bounds_of_error",
"text": "/-- A relative-error bound `|result - target| ≤ ε · |target|` implies two-sided absolute\nbounds `(1 - ε)·|target| ≤ |result| ≤ (1 + ε)·|target|`. Specialized to each operation\nbelow. -/\nprivate theorem result_bounds_of_error {target result : ℝ}\n (herr : |r... | [
{
"name": "mul_result_bounds",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 391,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nest... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.Falcon.Concrete.FloatLike
import LatticeCrypto.Falcon.Concrete.FPRBridge
import Mathlib.Analysis.SpecialFunctions.Pow.Real
/-!
# Approximate Arithmetic Fr... | /-
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.Falcon.Concrete.FloatLike
import LatticeCrypto.Falcon.Concrete.FPRBridge
import Mathlib.Analysis.SpecialFunctions.Pow.Real
/-!
# Approximate Arithmetic Fr... | @@ -72,11 +72,22 @@
/-! ### Derived Bounds -/
+/-- A relative-error bound `|result - target| ≤ ε · |target|` implies two-sided absolute
+bounds `(1 - ε)·|target| ≤ |result| ≤ (1 + ε)·|target|`. Specialized to each operation
+below. -/
+private theorem result_bounds_of_error {target result : ℝ}
+ (herr : |result... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_e20c0f2db2e0_2 | b0fb671227ab729b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/Falcon/Concrete/ApproxArith.lean | ApproxArith | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 4 | [
{
"theorem_name": "compound_add_mul_error",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_mul_ab := self.mul_error a b\n have h_mul_cd := self.mul_error c d\n have h_add := self.add_error (FloatLi... | [
{
"name": "mul_result_bounds",
"text": "/-- The result of a multiplication lies in `[(1-ε)(a·b), (1+ε)(a·b)]`. -/\ntheorem mul_result_bounds (a b : F) :\n (1 - ε) * |self.interp a * self.interp b| ≤ |self.interp (FloatLike.mul a b)| ∧\n |self.interp (FloatLike.mul a b)| ≤\n (1 + ε) * |self.interp... | [
{
"name": "compound_add_mul_error",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 32,
"n_chars": 1700,
"n_subproofs": 11,
"n_tactics": 25,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.Falcon.Concrete.FloatLike
import LatticeCrypto.Falcon.Concrete.FPRBridge
import Mathlib.Analysis.SpecialFunctions.Pow.Real
/-!
# Approximate Arithmetic Fr... | /-
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.Falcon.Concrete.FloatLike
import LatticeCrypto.Falcon.Concrete.FPRBridge
import Mathlib.Analysis.SpecialFunctions.Pow.Real
/-!
# Approximate Arithmetic Fr... | @@ -82,13 +82,45 @@
· linarith [abs_sub_abs_le_abs_sub target result, abs_sub_comm target result]
· linarith [abs_sub_abs_le_abs_sub result target]
+/-- The result of a multiplication lies in `[(1-ε)(a·b), (1+ε)(a·b)]`. -/
+theorem mul_result_bounds (a b : F) :
+ (1 - ε) * |self.interp a * self.interp 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_e20c0f2db2e0_3 | 32a06d7e58f61185 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/Falcon/Concrete/ApproxArith.lean | ApproxArith | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 4 | [
{
"theorem_name": "compound_add_mul_error",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_mul_ab := self.mul_error a b\n have h_mul_cd := self.mul_error c d\n have h_add := self.add_error (FloatLi... | [
{
"name": "mul_result_bounds",
"text": "/-- The result of a multiplication lies in `[(1-ε)(a·b), (1+ε)(a·b)]`. -/\ntheorem mul_result_bounds (a b : F) :\n (1 - ε) * |self.interp a * self.interp b| ≤ |self.interp (FloatLike.mul a b)| ∧\n |self.interp (FloatLike.mul a b)| ≤\n (1 + ε) * |self.interp... | [
{
"name": "horner_step_error",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 28,
"n_chars": 1456,
"n_subproofs": 6,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_ne... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.Falcon.Concrete.FloatLike
import LatticeCrypto.Falcon.Concrete.FPRBridge
import Mathlib.Analysis.SpecialFunctions.Pow.Real
/-!
# Approximate Arithmetic Fr... | /-
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.Falcon.Concrete.FloatLike
import LatticeCrypto.Falcon.Concrete.FPRBridge
import Mathlib.Analysis.SpecialFunctions.Pow.Real
/-!
# Approximate Arithmetic Fr... | @@ -82,13 +82,41 @@
· linarith [abs_sub_abs_le_abs_sub target result, abs_sub_comm target result]
· linarith [abs_sub_abs_le_abs_sub result target]
+/-- The result of a multiplication lies in `[(1-ε)(a·b), (1+ε)(a·b)]`. -/
+theorem mul_result_bounds (a b : F) :
+ (1 - ε) * |self.interp a * self.interp 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_e20c0f2db2e0_4 | 4acf054c234eef76 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/Falcon/Concrete/ApproxArith.lean | ApproxArith | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 4 | [
{
"theorem_name": "compound_add_mul_error",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_mul_ab := self.mul_error a b\n have h_mul_cd := self.mul_error c d\n have h_add := self.add_error (FloatLi... | [
{
"name": "mul_result_bounds",
"text": "/-- The result of a multiplication lies in `[(1-ε)(a·b), (1+ε)(a·b)]`. -/\ntheorem mul_result_bounds (a b : F) :\n (1 - ε) * |self.interp a * self.interp b| ≤ |self.interp (FloatLike.mul a b)| ∧\n |self.interp (FloatLike.mul a b)| ≤\n (1 + ε) * |self.interp... | [
{
"name": "butterfly_add_error",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 27,
"n_chars": 1468,
"n_subproofs": 6,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_... | 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.Falcon.Concrete.FloatLike
import LatticeCrypto.Falcon.Concrete.FPRBridge
import Mathlib.Analysis.SpecialFunctions.Pow.Real
/-!
# Approximate Arithmetic Fr... | /-
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.Falcon.Concrete.FloatLike
import LatticeCrypto.Falcon.Concrete.FPRBridge
import Mathlib.Analysis.SpecialFunctions.Pow.Real
/-!
# Approximate Arithmetic Fr... | @@ -82,13 +82,40 @@
· linarith [abs_sub_abs_le_abs_sub target result, abs_sub_comm target result]
· linarith [abs_sub_abs_le_abs_sub result target]
+/-- The result of a multiplication lies in `[(1-ε)(a·b), (1+ε)(a·b)]`. -/
+theorem mul_result_bounds (a b : F) :
+ (1 - ε) * |self.interp a * self.interp 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_e20c0f2db2e0_5 | ee0b5e5133ff80c3 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/Falcon/Concrete/ApproxArith.lean | ApproxArith | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 4 | [
{
"theorem_name": "compound_add_mul_error",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_mul_ab := self.mul_error a b\n have h_mul_cd := self.mul_error c d\n have h_add := self.add_error (FloatLi... | [
{
"name": "mul_result_bounds",
"text": "/-- The result of a multiplication lies in `[(1-ε)(a·b), (1+ε)(a·b)]`. -/\ntheorem mul_result_bounds (a b : F) :\n (1 - ε) * |self.interp a * self.interp b| ≤ |self.interp (FloatLike.mul a b)| ∧\n |self.interp (FloatLike.mul a b)| ≤\n (1 + ε) * |self.interp... | [
{
"name": "butterfly_sub_error",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 34,
"n_chars": 1835,
"n_subproofs": 7,
"n_tactics": 28,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 2,
"automation_only": false,
"max_... | 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.Falcon.Concrete.FloatLike
import LatticeCrypto.Falcon.Concrete.FPRBridge
import Mathlib.Analysis.SpecialFunctions.Pow.Real
/-!
# Approximate Arithmetic Fr... | /-
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.Falcon.Concrete.FloatLike
import LatticeCrypto.Falcon.Concrete.FPRBridge
import Mathlib.Analysis.SpecialFunctions.Pow.Real
/-!
# Approximate Arithmetic Fr... | @@ -82,11 +82,47 @@
· linarith [abs_sub_abs_le_abs_sub target result, abs_sub_comm target result]
· linarith [abs_sub_abs_le_abs_sub result target]
+/-- The result of a multiplication lies in `[(1-ε)(a·b), (1+ε)(a·b)]`. -/
+theorem mul_result_bounds (a b : F) :
+ (1 - ε) * |self.interp a * self.interp 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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.