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_52d6bcb5e628_3 | b5bc1f2a5861573b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 3 | [
{
"theorem_name": "isQueryBoundP_iff_isQueryBound_if",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isQueryBound_congr\n (fun t b => by by_cases ht : p t <;> simp [ht])\n (fun _ _ => rfl)",
"n_chars... | [
{
"name": "isQueryBound_congr",
"text": "lemma isQueryBound_congr\n {oa : OracleComp spec α} {b : B}\n {canQuery₁ canQuery₂ : ι → B → Prop} {cost₁ cost₂ : ι → B → B}\n (hcan : ∀ (t : ι) (b : B), canQuery₁ t b ↔ canQuery₂ t b)\n (hcost : ∀ (t : ι) (b : B), cost₁ t b = cost₂ t b) :\n oa.IsQuery... | [
{
"name": "isQueryBoundP_congr_pred",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 399,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"ma... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -86,6 +86,14 @@
IsQueryBound (f <$> oa) b canQuery cost ↔ IsQueryBound oa b canQuery cost :=
PFunctor.FreeM.isRollBound_map_iff oa f b canQuery cost
+lemma isQueryBound_congr
+ {oa : OracleComp spec α} {b : B}
+ {canQuery₁ canQuery₂ : ι → B → Prop} {cost₁ cost₂ : ι → B → B}
+ (hcan : ∀ (t : ι) (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_52d6bcb5e628_4 | 2f9f328dc513288c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 2 | [
{
"theorem_name": "isQueryBoundP_map_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isQueryBound_map_aux oa f _ _",
"n_chars": 32,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n... | [
{
"name": "isQueryBound_map_aux",
"text": "private lemma isQueryBound_map_aux (oa : OracleComp spec α) (f : α → β)\n (canQuery : ι → B → Prop) (cost : ι → B → B) :\n ∀ {b : B}, (f <$> oa).IsQueryBound b canQuery cost ↔\n oa.IsQueryBound b canQuery cost :=\n fun {b} => PFunctor.FreeM.isRollBound_... | [
{
"name": "isQueryBoundP_map_iff",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 184,
"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) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -74,6 +74,12 @@
canQuery t b :=
PFunctor.FreeM.isRollBound_liftA_iff (P := spec.toPFunctor) t b canQuery cost
+private lemma isQueryBound_map_aux (oa : OracleComp spec α) (f : α → β)
+ (canQuery : ι → B → Prop) (cost : ι → B → B) :
+ ∀ {b : B}, (f <$> oa).IsQueryBound b canQuery cost ↔
+ oa.IsQu... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_5 | fd1e4f4a5732d86d | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "IsQueryBoundP.simulateQ_run_StateT_of_step",
"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 s with\n | pure x =>\n simp [sim... | [
{
"name": "isQueryBoundP_bind",
"text": "/-- `oa >>= ob` is `p`-bounded by `n + m` when `oa` is `p`-bounded by `n` and every reachable\ncontinuation `ob x` is `p`-bounded by `m`. -/\nlemma isQueryBoundP_bind\n {oa : OracleComp spec α} {ob : α → OracleComp spec β} {n m : ℕ}\n (h : IsQueryBoundP oa p n)... | [
{
"name": "isQueryBoundP_seq",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 493,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nest... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -159,6 +159,27 @@
refine ⟨h.1.imp id (fun hn => Nat.lt_of_lt_of_le hn hnm), fun u => ?_⟩
exact ih u (h.2 u) (by split <;> omega)
+/-- `oa >>= ob` is `p`-bounded by `n + m` when `oa` is `p`-bounded by `n` and every reachable
+continuation `ob x` is `p`-bounded by `m`. -/
+lemma isQueryBoundP_bind
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_6 | a92d5840acb94bb1 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 2 | [
{
"theorem_name": "isQueryBoundP_map_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isQueryBound_map_aux oa f _ _",
"n_chars": 32,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n... | [
{
"name": "isQueryBound_map_aux",
"text": "private lemma isQueryBound_map_aux (oa : OracleComp spec α) (f : α → β)\n (canQuery : ι → B → Prop) (cost : ι → B → B) :\n ∀ {b : B}, (f <$> oa).IsQueryBound b canQuery cost ↔\n oa.IsQueryBound b canQuery cost :=\n fun {b} => PFunctor.FreeM.isRollBound_... | [
{
"name": "isQueryBoundP_iff_of_map_eq",
"fan_in": 7,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 414,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -74,6 +74,12 @@
canQuery t b :=
PFunctor.FreeM.isRollBound_liftA_iff (P := spec.toPFunctor) t b canQuery cost
+private lemma isQueryBound_map_aux (oa : OracleComp spec α) (f : α → β)
+ (canQuery : ι → B → Prop) (cost : ι → B → B) :
+ ∀ {b : B}, (f <$> oa).IsQueryBound b canQuery cost ↔
+ oa.IsQu... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_7 | 3a5e4a212b00d230 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isPerIndexQueryBound_mono_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn with\n | pure _ => intros; trivial\n | query_bind t mx ih =>\n ... | [
{
"name": "isPerIndexQueryBound_query_bind_iff",
"text": "lemma isPerIndexQueryBound_query_bind_iff (t : ι) (mx : spec t → OracleComp spec α)\n (qb : ι → ℕ) :\n IsPerIndexQueryBound (liftM (spec.query t) >>= mx) qb ↔\n 0 < qb t ∧ ∀ u, IsPerIndexQueryBound (mx u) (Function.update qb t (qb t - 1)) ... | [
{
"name": "isPerIndexQueryBound_mono_aux",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 465,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -169,6 +169,12 @@
lemma isPerIndexQueryBound_pure (x : α) (qb : ι → ℕ) :
IsPerIndexQueryBound (pure x : OracleComp spec α) qb := trivial
+lemma isPerIndexQueryBound_query_bind_iff (t : ι) (mx : spec t → OracleComp spec α)
+ (qb : ι → ℕ) :
+ IsPerIndexQueryBound (liftM (spec.query t) >>= mx) 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_52d6bcb5e628_8 | 40a426914e0456cf | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "isPerIndexQueryBound_mono_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn with\n | pure _ => intros; trivial\n | query_bind t mx ih =>\n ... | [
{
"name": "update_le_update",
"text": "private lemma update_le_update {qb qb' : ι → ℕ} {t : ι} (hle : qb ≤ qb') :\n Function.update qb t (qb t - 1) ≤ Function.update qb' t (qb' t - 1) := fun j => by\n rcases eq_or_ne j t with rfl | hj\n · simpa using Nat.sub_le_sub_right (hle j) 1\n · simpa [Function.... | [
{
"name": "IsPerIndexQueryBound.mono",
"fan_in": 12,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 5,
"n_chars": 211,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"... | 3 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -191,12 +191,21 @@
0 < qb t := by
simp [IsPerIndexQueryBound]
+private lemma update_le_update {qb qb' : ι → ℕ} {t : ι} (hle : qb ≤ qb') :
+ Function.update qb t (qb t - 1) ≤ Function.update qb' t (qb' t - 1) := fun j => by
+ rcases eq_or_ne j t with rfl | hj
+ · simpa using Nat.sub_le_sub_right (hle j... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_9 | d58923a7a50d76e6 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isPerIndexQueryBound_mono_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn with\n | pure _ => intros; trivial\n | query_bind t mx ih =>\n ... | [
{
"name": "isPerIndexQueryBound_query_bind_iff",
"text": "lemma isPerIndexQueryBound_query_bind_iff (t : ι) (mx : spec t → OracleComp spec α)\n (qb : ι → ℕ) :\n IsPerIndexQueryBound (liftM (spec.query t) >>= mx) qb ↔\n 0 < qb t ∧ ∀ u, IsPerIndexQueryBound (mx u) (Function.update qb t (qb t - 1)) ... | [
{
"name": "isPerIndexQueryBound_bind_aux",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 19,
"n_chars": 711,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 6,
"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
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -179,6 +179,12 @@
lemma isPerIndexQueryBound_pure (x : α) (qb : ι → ℕ) :
IsPerIndexQueryBound (pure x : OracleComp spec α) qb := trivial
+lemma isPerIndexQueryBound_query_bind_iff (t : ι) (mx : spec t → OracleComp spec α)
+ (qb : ι → ℕ) :
+ IsPerIndexQueryBound (liftM (spec.query t) >>= mx) 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_52d6bcb5e628_10 | b6a893efa894c1e3 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "isPerIndexQueryBound_bind_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn with\n | pure x =>\n intro qb₁ _\n simp only [monad_norm]\n... | [
{
"name": "update_add_eq_update_add",
"text": "private lemma update_add_eq_update_add {qb₁ qb₂ : ι → ℕ} {t : ι} (ht : 0 < qb₁ t) :\n Function.update qb₁ t (qb₁ t - 1) + qb₂ =\n Function.update (qb₁ + qb₂) t ((qb₁ + qb₂) t - 1) := by\n funext j\n by_cases hj : j = t <;> simp [Function.update_apply,... | [
{
"name": "isPerIndexQueryBound_bind",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 7,
"n_chars": 320,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"m... | 3 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -211,6 +211,13 @@
(h : IsPerIndexQueryBound oa qb) (hle : qb ≤ qb') : IsPerIndexQueryBound oa qb' :=
isPerIndexQueryBound_mono_aux oa hle h
+private lemma update_add_eq_update_add {qb₁ qb₂ : ι → ℕ} {t : ι} (ht : 0 < qb₁ t) :
+ Function.update qb₁ t (qb₁ t - 1) + qb₂ =
+ Function.update (qb₁ + 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_52d6bcb5e628_11 | cbb5957a20b5cbcc | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 3 | [
{
"theorem_name": "isPerIndexQueryBound_seq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [seq_eq_bind_map]\n exact isPerIndexQueryBound_bind h1\n (fun g => (isPerIndexQueryBound_map_iff oa g qb₂).... | [
{
"name": "isPerIndexQueryBound_bind",
"text": "lemma isPerIndexQueryBound_bind {oa : OracleComp spec α} {ob : α → OracleComp spec β}\n {qb₁ qb₂ : ι → ℕ}\n (h1 : IsPerIndexQueryBound oa qb₁) (h2 : ∀ x, IsPerIndexQueryBound (ob x) qb₂) :\n IsPerIndexQueryBound (oa >>= ob) (qb₁ + qb₂) :=\n isPerInde... | [
{
"name": "isPerIndexQueryBound_seq",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 12,
"n_chars": 582,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"m... | 5 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -236,6 +236,12 @@
rw [← update_add_eq_update_add h1.1]
exact ih u (h1.2 u)
+lemma isPerIndexQueryBound_bind {oa : OracleComp spec α} {ob : α → OracleComp spec β}
+ {qb₁ qb₂ : ι → ℕ}
+ (h1 : IsPerIndexQueryBound oa qb₁) (h2 : ∀ x, IsPerIndexQueryBound (ob x) qb₂) :
+ IsPerIndexQueryBound (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_52d6bcb5e628_12 | ee597b882cd8bb3f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 2 | [
{
"theorem_name": "isQueryBoundP_map_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isQueryBound_map_aux oa f _ _",
"n_chars": 32,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n... | [
{
"name": "isQueryBound_map_aux",
"text": "private lemma isQueryBound_map_aux (oa : OracleComp spec α) (f : α → β)\n (canQuery : ι → B → Prop) (cost : ι → B → B) :\n ∀ {b : B}, (f <$> oa).IsQueryBound b canQuery cost ↔\n oa.IsQueryBound b canQuery cost :=\n fun {b} => PFunctor.FreeM.isRollBound_... | [
{
"name": "isPerIndexQueryBound_iff_of_map_eq",
"fan_in": 7,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 515,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": fal... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -74,6 +74,12 @@
canQuery t b :=
PFunctor.FreeM.isRollBound_liftA_iff (P := spec.toPFunctor) t b canQuery cost
+private lemma isQueryBound_map_aux (oa : OracleComp spec α) (f : α → β)
+ (canQuery : ι → B → Prop) (cost : ι → B → B) :
+ ∀ {b : B}, (f <$> oa).IsQueryBound b canQuery cost ↔
+ oa.IsQu... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_13 | e34a9fae0419fbae | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isPerIndexQueryBound_mono_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn with\n | pure _ => intros; trivial\n | query_bind t mx ih =>\n ... | [
{
"name": "isPerIndexQueryBound_query_bind_iff",
"text": "lemma isPerIndexQueryBound_query_bind_iff (t : ι) (mx : spec t → OracleComp spec α)\n (qb : ι → ℕ) :\n IsPerIndexQueryBound (liftM (spec.query t) >>= mx) qb ↔\n 0 < qb t ∧ ∀ u, IsPerIndexQueryBound (mx u) (Function.update qb t (qb t - 1)) ... | [
{
"name": "IsPerIndexQueryBound.counting_bounded",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 43,
"n_chars": 1974,
"n_subproofs": 5,
"n_tactics": 26,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 6,
"n_structural": 7,
"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
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -169,6 +169,12 @@
lemma isPerIndexQueryBound_pure (x : α) (qb : ι → ℕ) :
IsPerIndexQueryBound (pure x : OracleComp spec α) qb := trivial
+lemma isPerIndexQueryBound_query_bind_iff (t : ι) (mx : spec t → OracleComp spec α)
+ (qb : ι → ℕ) :
+ IsPerIndexQueryBound (liftM (spec.query t) >>= mx) 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_52d6bcb5e628_14 | dc0071b2e8161d81 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 3 | [
{
"theorem_name": "isPerIndexQueryBound_seq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [seq_eq_bind_map]\n exact isPerIndexQueryBound_bind h1\n (fun g => (isPerIndexQueryBound_map_iff oa g qb₂).... | [
{
"name": "isPerIndexQueryBound_bind",
"text": "lemma isPerIndexQueryBound_bind {oa : OracleComp spec α} {ob : α → OracleComp spec β}\n {qb₁ qb₂ : ι → ℕ}\n (h1 : IsPerIndexQueryBound oa qb₁) (h2 : ∀ x, IsPerIndexQueryBound (ob x) qb₂) :\n IsPerIndexQueryBound (oa >>= ob) (qb₁ + qb₂) :=\n isPerInde... | [
{
"name": "IsPerIndexQueryBound.simulateQ_run_of_uniform_step",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 28,
"n_chars": 1237,
"n_subproofs": 3,
"n_tactics": 18,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 1,
"aut... | 5 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -244,6 +244,12 @@
rw [← update_add_eq_update_add h1.1]
exact ih u (h1.2 u)
+lemma isPerIndexQueryBound_bind {oa : OracleComp spec α} {ob : α → OracleComp spec β}
+ {qb₁ qb₂ : ι → ℕ}
+ (h1 : IsPerIndexQueryBound oa qb₁) (h2 : ∀ x, IsPerIndexQueryBound (ob x) qb₂) :
+ IsPerIndexQueryBound (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_52d6bcb5e628_15 | e972b546e990b1db | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 3 | [
{
"theorem_name": "isPerIndexQueryBound_seq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [seq_eq_bind_map]\n exact isPerIndexQueryBound_bind h1\n (fun g => (isPerIndexQueryBound_map_iff oa g qb₂).... | [
{
"name": "isPerIndexQueryBound_bind",
"text": "lemma isPerIndexQueryBound_bind {oa : OracleComp spec α} {ob : α → OracleComp spec β}\n {qb₁ qb₂ : ι → ℕ}\n (h1 : IsPerIndexQueryBound oa qb₁) (h2 : ∀ x, IsPerIndexQueryBound (ob x) qb₂) :\n IsPerIndexQueryBound (oa >>= ob) (qb₁ + qb₂) :=\n isPerInde... | [
{
"name": "IsPerIndexQueryBound.simulateQ_of_uniform_step",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 23,
"n_chars": 1130,
"n_subproofs": 2,
"n_tactics": 12,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 2,
"automat... | 5 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -244,6 +244,12 @@
rw [← update_add_eq_update_add h1.1]
exact ih u (h1.2 u)
+lemma isPerIndexQueryBound_bind {oa : OracleComp spec α} {ob : α → OracleComp spec β}
+ {qb₁ qb₂ : ι → ℕ}
+ (h1 : IsPerIndexQueryBound oa qb₁) (h2 : ∀ x, IsPerIndexQueryBound (ob x) qb₂) :
+ IsPerIndexQueryBound (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_52d6bcb5e628_16 | f1f1c410c8877d11 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 13 | [
{
"theorem_name": "IsTotalQueryBound.mono",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing n₁ n₂ with\n | pure _ => trivial\n | query_bind t mx ih =>\... | [
{
"name": "isTotalQueryBound_query_bind_iff",
"text": "lemma isTotalQueryBound_query_bind_iff {t : spec.Domain}\n {mx : spec.Range t → OracleComp spec α} {n : ℕ} :\n IsTotalQueryBound (liftM (query t) >>= mx) n ↔\n 0 < n ∧ ∀ u, IsTotalQueryBound (mx u) (n - 1) :=\n Iff.rfl\n\n",
"fan_in": 13... | [
{
"name": "IsTotalQueryBound.mono",
"fan_in": 12,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 448,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"ma... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -225,12 +225,21 @@
def IsTotalQueryBound (oa : OracleComp spec α) (n : ℕ) : Prop :=
IsQueryBound oa n (fun _ b => 0 < b) (fun _ b => b - 1)
+lemma isTotalQueryBound_query_bind_iff {t : spec.Domain}
+ {mx : spec.Range t → OracleComp spec α} {n : ℕ} :
+ IsTotalQueryBound (liftM (query t) >>= mx) 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_52d6bcb5e628_17 | ae21b16820fbd2cf | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "isTotalQueryBound_bind",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine isQueryBound_bind (combine := fun a b => a + b) ?_ ?_ h1 h2 <;> grind",
"n_chars": 82,
"n_subproofs":... | [
{
"name": "isQueryBound_bind",
"text": "/-- Generic bind composition for `IsQueryBound` parameterised by an arbitrary budget type\n`B` and a binary `combine` operation on it. The natural-number versions\n(`isTotalQueryBound_bind`, `isQueryBoundP_bind`, `isPerIndexQueryBound_bind`) are special\ncases at `com... | [
{
"name": "isTotalQueryBound_bind",
"fan_in": 6,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 502,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"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
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -86,6 +86,30 @@
IsQueryBound (f <$> oa) b canQuery cost ↔ IsQueryBound oa b canQuery cost :=
PFunctor.FreeM.isRollBound_map_iff oa f b canQuery cost
+/-- Generic bind composition for `IsQueryBound` parameterised by an arbitrary budget type
+`B` and a binary `combine` operation on it. The natural-number ver... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_18 | 4c0f32287e1d0648 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 13 | [
{
"theorem_name": "IsTotalQueryBound.mono",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing n₁ n₂ with\n | pure _ => trivial\n | query_bind t mx ih =>\... | [
{
"name": "isTotalQueryBound_query_bind_iff",
"text": "lemma isTotalQueryBound_query_bind_iff {t : spec.Domain}\n {mx : spec.Range t → OracleComp spec α} {n : ℕ} :\n IsTotalQueryBound (liftM (query t) >>= mx) n ↔\n 0 < n ∧ ∀ u, IsTotalQueryBound (mx u) (n - 1) :=\n Iff.rfl\n\n",
"fan_in": 13... | [
{
"name": "IsTotalQueryBound.of_bind_left",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 601,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -189,6 +189,12 @@
def IsTotalQueryBound (oa : OracleComp spec α) (n : ℕ) : Prop :=
IsQueryBound oa n (fun _ b => 0 < b) (fun _ b => b - 1)
+lemma isTotalQueryBound_query_bind_iff {t : spec.Domain}
+ {mx : spec.Range t → OracleComp spec α} {n : ℕ} :
+ IsTotalQueryBound (liftM (query t) >>= mx) 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_52d6bcb5e628_19 | efe392cbe2bd9dbe | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 6 | [
{
"theorem_name": "isTotalQueryBound_seq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [seq_eq_bind_map]\n exact isTotalQueryBound_bind h1\n (fun g => (isQueryBound_map_iff oa g n₂ _ _).mpr h2)",
... | [
{
"name": "isTotalQueryBound_bind",
"text": "/-- `IsTotalQueryBound` instantiates the generic vector-budget bind at `B := ℕ`,\n`combine := (· + ·)`, with the canQuery / cost obligations both discharged by `omega`. -/\nlemma isTotalQueryBound_bind {oa : OracleComp spec α} {ob : α → OracleComp spec β}\n {n... | [
{
"name": "isTotalQueryBound_seq",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 572,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -195,13 +195,24 @@
0 < n ∧ ∀ u, IsTotalQueryBound (mx u) (n - 1) :=
Iff.rfl
+/-- `IsTotalQueryBound` instantiates the generic vector-budget bind at `B := ℕ`,
+`combine := (· + ·)`, with the canQuery / cost obligations both discharged by `omega`. -/
+lemma isTotalQueryBound_bind {oa : 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_52d6bcb5e628_20 | 4441b15aa3cc5d5f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 13 | [
{
"theorem_name": "IsTotalQueryBound.mono",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing n₁ n₂ with\n | pure _ => trivial\n | query_bind t mx ih =>\... | [
{
"name": "isTotalQueryBound_query_bind_iff",
"text": "lemma isTotalQueryBound_query_bind_iff {t : spec.Domain}\n {mx : spec.Range t → OracleComp spec α} {n : ℕ} :\n IsTotalQueryBound (liftM (query t) >>= mx) n ↔\n 0 < n ∧ ∀ u, IsTotalQueryBound (mx u) (n - 1) :=\n Iff.rfl\n\n",
"fan_in": 13... | [
{
"name": "not_isTotalQueryBound_bind_query_prefix_zero",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 503,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
"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
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -189,6 +189,12 @@
def IsTotalQueryBound (oa : OracleComp spec α) (n : ℕ) : Prop :=
IsQueryBound oa n (fun _ b => 0 < b) (fun _ b => b - 1)
+lemma isTotalQueryBound_query_bind_iff {t : spec.Domain}
+ {mx : spec.Range t → OracleComp spec α} {n : ℕ} :
+ IsTotalQueryBound (liftM (query t) >>= mx) 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_52d6bcb5e628_21 | ec335d465dccc721 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 13 | [
{
"theorem_name": "IsTotalQueryBound.mono",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing n₁ n₂ with\n | pure _ => trivial\n | query_bind t mx ih =>\... | [
{
"name": "isTotalQueryBound_query_bind_iff",
"text": "lemma isTotalQueryBound_query_bind_iff {t : spec.Domain}\n {mx : spec.Range t → OracleComp spec α} {n : ℕ} :\n IsTotalQueryBound (liftM (query t) >>= mx) n ↔\n 0 < n ∧ ∀ u, IsTotalQueryBound (mx u) (n - 1) :=\n Iff.rfl\n\n",
"fan_in": 13... | [
{
"name": "IsTotalQueryBound.of_bind_query_prefix",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 22,
"n_chars": 958,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 2,
"automation_only":... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -189,6 +189,12 @@
def IsTotalQueryBound (oa : OracleComp spec α) (n : ℕ) : Prop :=
IsQueryBound oa n (fun _ b => 0 < b) (fun _ b => b - 1)
+lemma isTotalQueryBound_query_bind_iff {t : spec.Domain}
+ {mx : spec.Range t → OracleComp spec α} {n : ℕ} :
+ IsTotalQueryBound (liftM (query t) >>= mx) 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_52d6bcb5e628_22 | f5906583b5fc8bfc | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 6 | [
{
"theorem_name": "isTotalQueryBound_seq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [seq_eq_bind_map]\n exact isTotalQueryBound_bind h1\n (fun g => (isQueryBound_map_iff oa g n₂ _ _).mpr h2)",
... | [
{
"name": "isTotalQueryBound_bind",
"text": "/-- `IsTotalQueryBound` instantiates the generic vector-budget bind at `B := ℕ`,\n`combine := (· + ·)`, with the canQuery / cost obligations both discharged by `omega`. -/\nlemma isTotalQueryBound_bind {oa : OracleComp spec α} {ob : α → OracleComp spec β}\n {n... | [
{
"name": "IsTotalQueryBound.simulateQ_run_of_step",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 25,
"n_chars": 1237,
"n_subproofs": 3,
"n_tactics": 16,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 1,
"automation_onl... | 3 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -299,6 +299,14 @@
exact ⟨Nat.lt_of_lt_of_le h.1 hle,
fun u => ih u (h.2 u) (Nat.sub_le_sub_right hle 1)⟩
+/-- `IsTotalQueryBound` instantiates the generic vector-budget bind at `B := ℕ`,
+`combine := (· + ·)`, with the canQuery / cost obligations both discharged by `omega`. -/
+lemma isTotalQueryBo... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_23 | 0116dec988262217 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 6 | [
{
"theorem_name": "isTotalQueryBound_seq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [seq_eq_bind_map]\n exact isTotalQueryBound_bind h1\n (fun g => (isQueryBound_map_iff oa g n₂ _ _).mpr h2)",
... | [
{
"name": "isTotalQueryBound_bind",
"text": "/-- `IsTotalQueryBound` instantiates the generic vector-budget bind at `B := ℕ`,\n`combine := (· + ·)`, with the canQuery / cost obligations both discharged by `omega`. -/\nlemma isTotalQueryBound_bind {oa : OracleComp spec α} {ob : α → OracleComp spec β}\n {n... | [
{
"name": "IsTotalQueryBound.simulateQ_of_step",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 24,
"n_chars": 1237,
"n_subproofs": 3,
"n_tactics": 13,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 2,
"n_structural": 1,
"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
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -262,6 +262,14 @@
exact ⟨Nat.lt_of_lt_of_le h.1 hle,
fun u => ih u (h.2 u) (Nat.sub_le_sub_right hle 1)⟩
+/-- `IsTotalQueryBound` instantiates the generic vector-budget bind at `B := ℕ`,
+`combine := (· + ·)`, with the canQuery / cost obligations both discharged by `omega`. -/
+lemma isTotalQueryBo... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_24 | 289dfe8049d2fe28 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 24 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 6 | [
{
"theorem_name": "isTotalQueryBound_seq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [seq_eq_bind_map]\n exact isTotalQueryBound_bind h1\n (fun g => (isQueryBound_map_iff oa g n₂ _ _).mpr h2)",
... | [
{
"name": "isTotalQueryBound_bind",
"text": "/-- `IsTotalQueryBound` instantiates the generic vector-budget bind at `B := ℕ`,\n`combine := (· + ·)`, with the canQuery / cost obligations both discharged by `omega`. -/\nlemma isTotalQueryBound_bind {oa : OracleComp spec α} {ob : α → OracleComp spec β}\n {n... | [
{
"name": "IsTotalQueryBound.simulateQ_of_step_le",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 39,
"n_chars": 2002,
"n_subproofs": 2,
"n_tactics": 13,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 1,
"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
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -195,6 +195,14 @@
0 < n ∧ ∀ u, IsTotalQueryBound (mx u) (n - 1) :=
Iff.rfl
+/-- `IsTotalQueryBound` instantiates the generic vector-budget bind at `B := ℕ`,
+`combine := (· + ·)`, with the canQuery / cost obligations both discharged by `omega`. -/
+lemma isTotalQueryBound_bind {oa : OracleComp spec α} {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_52d6bcb5e628_25 | 4349c89f6c7a8caa | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 25 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 6 | [
{
"theorem_name": "isTotalQueryBound_seq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [seq_eq_bind_map]\n exact isTotalQueryBound_bind h1\n (fun g => (isQueryBound_map_iff oa g n₂ _ _).mpr h2)",
... | [
{
"name": "isTotalQueryBound_bind",
"text": "/-- `IsTotalQueryBound` instantiates the generic vector-budget bind at `B := ℕ`,\n`combine := (· + ·)`, with the canQuery / cost obligations both discharged by `omega`. -/\nlemma isTotalQueryBound_bind {oa : OracleComp spec α} {ob : α → OracleComp spec β}\n {n... | [
{
"name": "isTotalQueryBound_simulateQ_postInsert",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 16,
"n_chars": 823,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 3,
"automation_only":... | 4 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -195,6 +195,14 @@
0 < n ∧ ∀ u, IsTotalQueryBound (mx u) (n - 1) :=
Iff.rfl
+/-- `IsTotalQueryBound` instantiates the generic vector-budget bind at `B := ℕ`,
+`combine := (· + ·)`, with the canQuery / cost obligations both discharged by `omega`. -/
+lemma isTotalQueryBound_bind {oa : OracleComp spec α} {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_52d6bcb5e628_26 | a84d848fa15eb6dc | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 26 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 13 | [
{
"theorem_name": "IsTotalQueryBound.mono",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing n₁ n₂ with\n | pure _ => trivial\n | query_bind t mx ih =>\... | [
{
"name": "isTotalQueryBound_query_bind_iff",
"text": "lemma isTotalQueryBound_query_bind_iff {t : spec.Domain}\n {mx : spec.Range t → OracleComp spec α} {n : ℕ} :\n IsTotalQueryBound (liftM (query t) >>= mx) n ↔\n 0 < n ∧ ∀ u, IsTotalQueryBound (mx u) (n - 1) :=\n Iff.rfl\n\n",
"fan_in": 13... | [
{
"name": "IsQueryBoundP.simulateQ_of_step_le_total",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 23,
"n_chars": 1145,
"n_subproofs": 2,
"n_tactics": 12,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 2,
"automation_on... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -246,12 +246,21 @@
def IsTotalQueryBound (oa : OracleComp spec α) (n : ℕ) : Prop :=
IsQueryBound oa n (fun _ b => 0 < b) (fun _ b => b - 1)
+lemma isTotalQueryBound_query_bind_iff {t : spec.Domain}
+ {mx : spec.Range t → OracleComp spec α} {n : ℕ} :
+ IsTotalQueryBound (liftM (query t) >>= mx) 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_52d6bcb5e628_27 | 27210b441c142338 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 27 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 13 | [
{
"theorem_name": "IsTotalQueryBound.mono",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing n₁ n₂ with\n | pure _ => trivial\n | query_bind t mx ih =>\... | [
{
"name": "isTotalQueryBound_query_bind_iff",
"text": "lemma isTotalQueryBound_query_bind_iff {t : spec.Domain}\n {mx : spec.Range t → OracleComp spec α} {n : ℕ} :\n IsTotalQueryBound (liftM (query t) >>= mx) n ↔\n 0 < n ∧ ∀ u, IsTotalQueryBound (mx u) (n - 1) :=\n Iff.rfl\n\n",
"fan_in": 13... | [
{
"name": "isQueryBoundP_simulateQ_preInsert",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 15,
"n_chars": 702,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": fals... | 3 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -246,12 +246,21 @@
def IsTotalQueryBound (oa : OracleComp spec α) (n : ℕ) : Prop :=
IsQueryBound oa n (fun _ b => 0 < b) (fun _ b => b - 1)
+lemma isTotalQueryBound_query_bind_iff {t : spec.Domain}
+ {mx : spec.Range t → OracleComp spec α} {n : ℕ} :
+ IsTotalQueryBound (liftM (query t) >>= mx) 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_52d6bcb5e628_28 | 91827107cde17625 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 28 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 13 | [
{
"theorem_name": "IsTotalQueryBound.mono",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing n₁ n₂ with\n | pure _ => trivial\n | query_bind t mx ih =>\... | [
{
"name": "isTotalQueryBound_query_bind_iff",
"text": "lemma isTotalQueryBound_query_bind_iff {t : spec.Domain}\n {mx : spec.Range t → OracleComp spec α} {n : ℕ} :\n IsTotalQueryBound (liftM (query t) >>= mx) n ↔\n 0 < n ∧ ∀ u, IsTotalQueryBound (mx u) (n - 1) :=\n Iff.rfl\n\n",
"fan_in": 13... | [
{
"name": "isQueryBoundP_simulateQ_postInsert",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 17,
"n_chars": 850,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": fal... | 3 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -246,12 +246,21 @@
def IsTotalQueryBound (oa : OracleComp spec α) (n : ℕ) : Prop :=
IsQueryBound oa n (fun _ b => 0 < b) (fun _ b => b - 1)
+lemma isTotalQueryBound_query_bind_iff {t : spec.Domain}
+ {mx : spec.Range t → OracleComp spec α} {n : ℕ} :
+ IsTotalQueryBound (liftM (query t) >>= mx) 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_52d6bcb5e628_29 | 5bb4b283831821dd | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 29 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 4 | [
{
"theorem_name": "exists_mem_support_simulate_of_mem_support_run_simulateQ_le_cost",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing st₀ z with\n | pu... | [
{
"name": "add_single_mem_support_simulate_queryBind",
"text": "lemma add_single_mem_support_simulate_queryBind [DecidableEq ι]\n [IsUniformSpec spec] {t : spec.Domain}\n {oa : spec.Range t → OracleComp spec α} {u : spec.Range t}\n {z : α × QueryCount ι}\n (hz : z ∈ support (countingOracle.simul... | [
{
"name": "exists_mem_support_simulate_of_mem_support_run_simulateQ_le_cost",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 35,
"n_chars": 1739,
"n_subproofs": 2,
"n_tactics": 22,
"cyclomatic": 3,
"n_automation": 6,
"n_rewrites": 3,
"n_structural... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -275,6 +275,20 @@
namespace countingOracle
+lemma add_single_mem_support_simulate_queryBind [DecidableEq ι]
+ [IsUniformSpec spec] {t : spec.Domain}
+ {oa : spec.Range t → OracleComp spec α} {u : spec.Range t}
+ {z : α × QueryCount ι}
+ (hz : z ∈ support (countingOracle.simulate (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_52d6bcb5e628_30 | 90518e3ee5d96dff | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 30 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 13 | [
{
"theorem_name": "IsTotalQueryBound.mono",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing n₁ n₂ with\n | pure _ => trivial\n | query_bind t mx ih =>\... | [
{
"name": "isTotalQueryBound_query_bind_iff",
"text": "lemma isTotalQueryBound_query_bind_iff {t : spec.Domain}\n {mx : spec.Range t → OracleComp spec α} {n : ℕ} :\n IsTotalQueryBound (liftM (query t) >>= mx) n ↔\n 0 < n ∧ ∀ u, IsTotalQueryBound (mx u) (n - 1) :=\n Iff.rfl\n\n",
"fan_in": 13... | [
{
"name": "IsTotalQueryBound.residual_of_mem_support_counting",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 25,
"n_chars": 1308,
"n_subproofs": 3,
"n_tactics": 16,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 6,
"n_structural": 2,
"aut... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -225,12 +225,21 @@
def IsTotalQueryBound (oa : OracleComp spec α) (n : ℕ) : Prop :=
IsQueryBound oa n (fun _ b => 0 < b) (fun _ b => b - 1)
+lemma isTotalQueryBound_query_bind_iff {t : spec.Domain}
+ {mx : spec.Range t → OracleComp spec α} {n : ℕ} :
+ IsTotalQueryBound (liftM (query t) >>= mx) 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_52d6bcb5e628_32 | ded9fc20ce8cbbd3 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 32 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 4 | [
{
"theorem_name": "exists_mem_support_simulate_of_mem_support_run_simulateQ_le_cost",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing st₀ z with\n | pu... | [
{
"name": "add_single_mem_support_simulate_queryBind",
"text": "lemma add_single_mem_support_simulate_queryBind [DecidableEq ι]\n [IsUniformSpec spec] {t : spec.Domain}\n {oa : spec.Range t → OracleComp spec α} {u : spec.Range t}\n {z : α × QueryCount ι}\n (hz : z ∈ support (countingOracle.simul... | [
{
"name": "countingOracle.support_simulate_nonempty",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 689,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 5,
"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
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -268,6 +268,20 @@
namespace countingOracle
+lemma add_single_mem_support_simulate_queryBind [DecidableEq ι]
+ [IsUniformSpec spec] {t : spec.Domain}
+ {oa : spec.Range t → OracleComp spec α} {u : spec.Range t}
+ {z : α × QueryCount ι}
+ (hz : z ∈ support (countingOracle.simulate (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_52d6bcb5e628_34 | fad9bf4d7faac952 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 34 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 4 | [
{
"theorem_name": "exists_mem_support_simulate_of_mem_support_run_simulateQ_le_cost",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing st₀ z with\n | pu... | [
{
"name": "add_single_mem_support_simulate_queryBind",
"text": "lemma add_single_mem_support_simulate_queryBind [DecidableEq ι]\n [IsUniformSpec spec] {t : spec.Domain}\n {oa : spec.Range t → OracleComp spec α} {u : spec.Range t}\n {z : α × QueryCount ι}\n (hz : z ∈ support (countingOracle.simul... | [
{
"name": "IsTotalQueryBound.residual_of_mem_support_run_simulateQ_le_cost",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 27,
"n_chars": 1462,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural"... | 4 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -321,6 +321,20 @@
namespace countingOracle
+lemma add_single_mem_support_simulate_queryBind [DecidableEq ι]
+ [IsUniformSpec spec] {t : spec.Domain}
+ {oa : spec.Range t → OracleComp spec α} {u : spec.Range t}
+ {z : α × QueryCount ι}
+ (hz : z ∈ support (countingOracle.simulate (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_52d6bcb5e628_35 | 2bfd036eca182465 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 35 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 13 | [
{
"theorem_name": "IsTotalQueryBound.mono",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing n₁ n₂ with\n | pure _ => trivial\n | query_bind t mx ih =>\... | [
{
"name": "isTotalQueryBound_query_bind_iff",
"text": "lemma isTotalQueryBound_query_bind_iff {t : spec.Domain}\n {mx : spec.Range t → OracleComp spec α} {n : ℕ} :\n IsTotalQueryBound (liftM (query t) >>= mx) n ↔\n 0 < n ∧ ∀ u, IsTotalQueryBound (mx u) (n - 1) :=\n Iff.rfl\n\n",
"fan_in": 13... | [
{
"name": "IsTotalQueryBound.of_perIndex",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 19,
"n_chars": 749,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 3,
"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
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -195,6 +195,12 @@
def IsTotalQueryBound (oa : OracleComp spec α) (n : ℕ) : Prop :=
IsQueryBound oa n (fun _ b => 0 < b) (fun _ b => b - 1)
+lemma isTotalQueryBound_query_bind_iff {t : spec.Domain}
+ {mx : spec.Range t → OracleComp spec α} {n : ℕ} :
+ IsTotalQueryBound (liftM (query t) >>= mx) 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_52d6bcb5e628_36 | 8fdeafa4f5a52f9e | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 36 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 13 | [
{
"theorem_name": "IsTotalQueryBound.mono",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn generalizing n₁ n₂ with\n | pure _ => trivial\n | query_bind t mx ih =>\... | [
{
"name": "isTotalQueryBound_query_bind_iff",
"text": "lemma isTotalQueryBound_query_bind_iff {t : spec.Domain}\n {mx : spec.Range t → OracleComp spec α} {n : ℕ} :\n IsTotalQueryBound (liftM (query t) >>= mx) n ↔\n 0 < n ∧ ∀ u, IsTotalQueryBound (mx u) (n - 1) :=\n Iff.rfl\n\n",
"fan_in": 13... | [
{
"name": "IsTotalQueryBound.isQueryBoundP",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 562,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 4,
"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
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -225,12 +225,21 @@
def IsTotalQueryBound (oa : OracleComp spec α) (n : ℕ) : Prop :=
IsQueryBound oa n (fun _ b => 0 < b) (fun _ b => b - 1)
+lemma isTotalQueryBound_query_bind_iff {t : spec.Domain}
+ {mx : spec.Range t → OracleComp spec α} {n : ℕ} :
+ IsTotalQueryBound (liftM (query t) >>= mx) 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_52d6bcb5e628_37 | e8a2568798632c53 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 37 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 3 | [
{
"theorem_name": "isQueryBoundP_iff_isQueryBound_if",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isQueryBound_congr\n (fun t b => by by_cases ht : p t <;> simp [ht])\n (fun _ _ => rfl)",
"n_chars... | [
{
"name": "isQueryBound_congr",
"text": "lemma isQueryBound_congr\n {oa : OracleComp spec α} {b : B}\n {canQuery₁ canQuery₂ : ι → B → Prop} {cost₁ cost₂ : ι → B → B}\n (hcan : ∀ (t : ι) (b : B), canQuery₁ t b ↔ canQuery₂ t b)\n (hcost : ∀ (t : ι) (b : B), cost₁ t b = cost₂ t b) :\n oa.IsQuery... | [
{
"name": "isQueryBoundP_true_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 296,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"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
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -86,6 +86,14 @@
IsQueryBound (f <$> oa) b canQuery cost ↔ IsQueryBound oa b canQuery cost :=
PFunctor.FreeM.isRollBound_map_iff oa f b canQuery cost
+lemma isQueryBound_congr
+ {oa : OracleComp spec α} {b : B}
+ {canQuery₁ canQuery₂ : ι → B → Prop} {cost₁ cost₂ : ι → B → B}
+ (hcan : ∀ (t : ι) (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_52d6bcb5e628_38 | bba59ae7142d060b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 38 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isPerIndexQueryBound_mono_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction oa using OracleComp.inductionOn with\n | pure _ => intros; trivial\n | query_bind t mx ih =>\n ... | [
{
"name": "isPerIndexQueryBound_query_bind_iff",
"text": "lemma isPerIndexQueryBound_query_bind_iff (t : ι) (mx : spec t → OracleComp spec α)\n (qb : ι → ℕ) :\n IsPerIndexQueryBound (liftM (spec.query t) >>= mx) qb ↔\n 0 < qb t ∧ ∀ u, IsPerIndexQueryBound (mx u) (Function.update qb t (qb t - 1)) ... | [
{
"name": "IsPerIndexQueryBound.isQueryBoundP",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 25,
"n_chars": 1065,
"n_subproofs": 0,
"n_tactics": 18,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 6,
"automation_only": f... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -179,6 +179,12 @@
lemma isPerIndexQueryBound_pure (x : α) (qb : ι → ℕ) :
IsPerIndexQueryBound (pure x : OracleComp spec α) qb := trivial
+lemma isPerIndexQueryBound_query_bind_iff (t : ι) (mx : spec t → OracleComp spec α)
+ (qb : ι → ℕ) :
+ IsPerIndexQueryBound (liftM (spec.query t) >>= mx) 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_52d6bcb5e628_39 | 80fadc855b2c56da | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 39 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "isQueryBoundP_iff_counting_filter_le",
"depth": 1,
"n_commands": 0,
"n_lines": 36,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine ⟨fun h _ hz => IsQueryBoundP.counting_bounded h hz, fun h => ?_⟩\n induction oa using OracleC... | [
{
"name": "sum_single_filter_eq_one",
"text": "/-- The `p`-filtered total of a single-query `QueryCount` is one when `t` satisfies `p`. Shared\nby the counting-oracle characterizations that peel off one `QueryCount.single t` per step. -/\nprivate lemma sum_single_filter_eq_one [DecidableEq ι] [Fintype ι] {t... | [
{
"name": "isQueryBoundP_iff_counting_filter_le",
"fan_in": 0,
"n_deps_direct": 6,
"n_deps_transitive": 6,
"n_lines": 45,
"n_chars": 2103,
"n_subproofs": 6,
"n_tactics": 36,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 4,
"n_structural": 9,
"automation_only":... | 4 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -361,6 +361,13 @@
variable {p : ι → Prop} [DecidablePred p]
+/-- The `p`-filtered total of a single-query `QueryCount` is one when `t` satisfies `p`. Shared
+by the counting-oracle characterizations that peel off one `QueryCount.single t` per step. -/
+private lemma sum_single_filter_eq_one [DecidableEq ι] [Fin... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_40 | f6c726c2ec1cf40b | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 40 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "IsQueryBoundP.simulateQ_run_StateT_of_step",
"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 s with\n | pure x =>\n simp [sim... | [
{
"name": "isQueryBoundP_bind",
"text": "/-- `oa >>= ob` is `p`-bounded by `n + m` when `oa` is `p`-bounded by `n` and every reachable\ncontinuation `ob x` is `p`-bounded by `m`. -/\nlemma isQueryBoundP_bind\n {oa : OracleComp spec α} {ob : α → OracleComp spec β} {n m : ℕ}\n (h : IsQueryBoundP oa p n)... | [
{
"name": "IsQueryBoundP.simulateQ_run_of_step",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 32,
"n_chars": 1602,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 2,
"n_structural": 1,
"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
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -196,6 +196,27 @@
refine ⟨h.1.imp id (fun hn => Nat.lt_of_lt_of_le hn hnm), fun u => ?_⟩
exact ih u (h.2 u) (by split <;> omega)
+/-- `oa >>= ob` is `p`-bounded by `n + m` when `oa` is `p`-bounded by `n` and every reachable
+continuation `ob x` is `p`-bounded by `m`. -/
+lemma isQueryBoundP_bind
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_41 | def4c46dbb96f397 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 41 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "IsQueryBoundP.simulateQ_run_StateT_of_step",
"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 s with\n | pure x =>\n simp [sim... | [
{
"name": "isQueryBoundP_bind",
"text": "/-- `oa >>= ob` is `p`-bounded by `n + m` when `oa` is `p`-bounded by `n` and every reachable\ncontinuation `ob x` is `p`-bounded by `m`. -/\nlemma isQueryBoundP_bind\n {oa : OracleComp spec α} {ob : α → OracleComp spec β} {n m : ℕ}\n (h : IsQueryBoundP oa p n)... | [
{
"name": "IsQueryBoundP.simulateQ_of_step",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 26,
"n_chars": 1410,
"n_subproofs": 2,
"n_tactics": 12,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": fals... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -159,6 +159,27 @@
refine ⟨h.1.imp id (fun hn => Nat.lt_of_lt_of_le hn hnm), fun u => ?_⟩
exact ih u (h.2 u) (by split <;> omega)
+/-- `oa >>= ob` is `p`-bounded by `n + m` when `oa` is `p`-bounded by `n` and every reachable
+continuation `ob x` is `p`-bounded by `m`. -/
+lemma isQueryBoundP_bind
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_42 | ff709a7e550ea8a3 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 42 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "IsQueryBoundP.simulateQ_run_StateT_of_step",
"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 s with\n | pure x =>\n simp [sim... | [
{
"name": "isQueryBoundP_bind",
"text": "/-- `oa >>= ob` is `p`-bounded by `n + m` when `oa` is `p`-bounded by `n` and every reachable\ncontinuation `ob x` is `p`-bounded by `m`. -/\nlemma isQueryBoundP_bind\n {oa : OracleComp spec α} {ob : α → OracleComp spec β} {n m : ℕ}\n (h : IsQueryBoundP oa p n)... | [
{
"name": "IsQueryBoundP.simulateQ_run_add_of_step",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 29,
"n_chars": 1547,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 7,
"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
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -196,6 +196,27 @@
refine ⟨h.1.imp id (fun hn => Nat.lt_of_lt_of_le hn hnm), fun u => ?_⟩
exact ih u (h.2 u) (by split <;> omega)
+/-- `oa >>= ob` is `p`-bounded by `n + m` when `oa` is `p`-bounded by `n` and every reachable
+continuation `ob x` is `p`-bounded by `m`. -/
+lemma isQueryBoundP_bind
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_43 | b8a391b79e67be05 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 43 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "IsQueryBoundP.simulateQ_run_StateT_of_step",
"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 s with\n | pure x =>\n simp [sim... | [
{
"name": "isQueryBoundP_bind",
"text": "/-- `oa >>= ob` is `p`-bounded by `n + m` when `oa` is `p`-bounded by `n` and every reachable\ncontinuation `ob x` is `p`-bounded by `m`. -/\nlemma isQueryBoundP_bind\n {oa : OracleComp spec α} {ob : α → OracleComp spec β} {n m : ℕ}\n (h : IsQueryBoundP oa p n)... | [
{
"name": "IsQueryBoundP.simulateQ_run_add_inl_of_step",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 24,
"n_chars": 1317,
"n_subproofs": 0,
"n_tactics": 3,
"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
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -196,6 +196,27 @@
refine ⟨h.1.imp id (fun hn => Nat.lt_of_lt_of_le hn hnm), fun u => ?_⟩
exact ih u (h.2 u) (by split <;> omega)
+/-- `oa >>= ob` is `p`-bounded by `n + m` when `oa` is `p`-bounded by `n` and every reachable
+continuation `ob x` is `p`-bounded by `m`. -/
+lemma isQueryBoundP_bind
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_44 | 7846c9852bf57412 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 44 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "IsQueryBoundP.simulateQ_run_StateT_of_step",
"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 s with\n | pure x =>\n simp [sim... | [
{
"name": "isQueryBoundP_bind",
"text": "/-- `oa >>= ob` is `p`-bounded by `n + m` when `oa` is `p`-bounded by `n` and every reachable\ncontinuation `ob x` is `p`-bounded by `m`. -/\nlemma isQueryBoundP_bind\n {oa : OracleComp spec α} {ob : α → OracleComp spec β} {n m : ℕ}\n (h : IsQueryBoundP oa p n)... | [
{
"name": "IsQueryBoundP.simulateQ_run_add_inr_of_step",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 32,
"n_chars": 1662,
"n_subproofs": 0,
"n_tactics": 4,
"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
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -196,6 +196,27 @@
refine ⟨h.1.imp id (fun hn => Nat.lt_of_lt_of_le hn hnm), fun u => ?_⟩
exact ih u (h.2 u) (by split <;> omega)
+/-- `oa >>= ob` is `p`-bounded by `n + m` when `oa` is `p`-bounded by `n` and every reachable
+continuation `ob x` is `p`-bounded by `m`. -/
+lemma isQueryBoundP_bind
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_45 | 2c9daac30b48648e | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 45 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 6 | [
{
"theorem_name": "isTotalQueryBound_seq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [seq_eq_bind_map]\n exact isTotalQueryBound_bind h1\n (fun g => (isQueryBound_map_iff oa g n₂ _ _).mpr h2)",
... | [
{
"name": "isTotalQueryBound_bind",
"text": "/-- `IsTotalQueryBound` instantiates the generic vector-budget bind at `B := ℕ`,\n`combine := (· + ·)`, with the canQuery / cost obligations both discharged by `omega`. -/\nlemma isTotalQueryBound_bind {oa : OracleComp spec α} {ob : α → OracleComp spec β}\n {n... | [
{
"name": "IsTotalQueryBound.simulateQ_run_add_of_step",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 18,
"n_chars": 873,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 4,
"automation_o... | 3 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -299,6 +299,14 @@
exact ⟨Nat.lt_of_lt_of_le h.1 hle,
fun u => ih u (h.2 u) (Nat.sub_le_sub_right hle 1)⟩
+/-- `IsTotalQueryBound` instantiates the generic vector-budget bind at `B := ℕ`,
+`combine := (· + ·)`, with the canQuery / cost obligations both discharged by `omega`. -/
+lemma isTotalQueryBo... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_46 | 3aebb7cfb99d0bdb | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 46 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 6 | [
{
"theorem_name": "isTotalQueryBound_seq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [seq_eq_bind_map]\n exact isTotalQueryBound_bind h1\n (fun g => (isQueryBound_map_iff oa g n₂ _ _).mpr h2)",
... | [
{
"name": "isTotalQueryBound_bind",
"text": "/-- `IsTotalQueryBound` instantiates the generic vector-budget bind at `B := ℕ`,\n`combine := (· + ·)`, with the canQuery / cost obligations both discharged by `omega`. -/\nlemma isTotalQueryBound_bind {oa : OracleComp spec α} {ob : α → OracleComp spec β}\n {n... | [
{
"name": "IsTotalQueryBound.simulateQ_run_add_inl_of_step",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 18,
"n_chars": 1006,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automat... | 3 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -299,6 +299,14 @@
exact ⟨Nat.lt_of_lt_of_le h.1 hle,
fun u => ih u (h.2 u) (Nat.sub_le_sub_right hle 1)⟩
+/-- `IsTotalQueryBound` instantiates the generic vector-budget bind at `B := ℕ`,
+`combine := (· + ·)`, with the canQuery / cost obligations both discharged by `omega`. -/
+lemma isTotalQueryBo... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_47 | 3bd10e4a61645624 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 47 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 6 | [
{
"theorem_name": "isTotalQueryBound_seq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [seq_eq_bind_map]\n exact isTotalQueryBound_bind h1\n (fun g => (isQueryBound_map_iff oa g n₂ _ _).mpr h2)",
... | [
{
"name": "isTotalQueryBound_bind",
"text": "/-- `IsTotalQueryBound` instantiates the generic vector-budget bind at `B := ℕ`,\n`combine := (· + ·)`, with the canQuery / cost obligations both discharged by `omega`. -/\nlemma isTotalQueryBound_bind {oa : OracleComp spec α} {ob : α → OracleComp spec β}\n {n... | [
{
"name": "IsTotalQueryBound.simulateQ_run_add_inr_of_step",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 25,
"n_chars": 1300,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automat... | 3 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -299,6 +299,14 @@
exact ⟨Nat.lt_of_lt_of_le h.1 hle,
fun u => ih u (h.2 u) (Nat.sub_le_sub_right hle 1)⟩
+/-- `IsTotalQueryBound` instantiates the generic vector-budget bind at `B := ℕ`,
+`combine := (· + ·)`, with the canQuery / cost obligations both discharged by `omega`. -/
+lemma isTotalQueryBo... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_48 | 037e54d61efe6071 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 48 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 3 | [
{
"theorem_name": "isPerIndexQueryBound_seq",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [seq_eq_bind_map]\n exact isPerIndexQueryBound_bind h1\n (fun g => (isPerIndexQueryBound_map_iff oa g qb₂).... | [
{
"name": "isPerIndexQueryBound_bind",
"text": "lemma isPerIndexQueryBound_bind {oa : OracleComp spec α} {ob : α → OracleComp spec β}\n {qb₁ qb₂ : ι → ℕ}\n (h1 : IsPerIndexQueryBound oa qb₁) (h2 : ∀ x, IsPerIndexQueryBound (ob x) qb₂) :\n IsPerIndexQueryBound (oa >>= ob) (qb₁ + qb₂) :=\n isPerInde... | [
{
"name": "IsPerIndexQueryBound.simulateQ_run_add_of_uniform_step",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 21,
"n_chars": 1027,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 4,
"... | 6 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -244,6 +244,12 @@
rw [← update_add_eq_update_add h1.1]
exact ih u (h1.2 u)
+lemma isPerIndexQueryBound_bind {oa : OracleComp spec α} {ob : α → OracleComp spec β}
+ {qb₁ qb₂ : ι → ℕ}
+ (h1 : IsPerIndexQueryBound oa qb₁) (h2 : ∀ x, IsPerIndexQueryBound (ob x) qb₂) :
+ IsPerIndexQueryBound (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_52d6bcb5e628_49 | b1a78e2855b08399 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 49 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "IsPerIndexQueryBound.simulateQ_run_add_of_uniform_step",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine IsPerIndexQueryBound.simulateQ_run_of_uniform_step h ?_ s\n rintro (t | t) s... | [
{
"name": "IsPerIndexQueryBound.simulateQ_run_of_uniform_step",
"text": "theorem IsPerIndexQueryBound.simulateQ_run_of_uniform_step\n {σ : Type u}\n {impl : QueryImpl spec (StateT σ (OracleComp spec))}\n {oa : OracleComp spec α} {qb : ι → ℕ}\n (h : IsPerIndexQueryBound oa qb)\n (hstep : ∀ t :... | [
{
"name": "IsPerIndexQueryBound.simulateQ_run_add_inl_of_uniform_step",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 20,
"n_chars": 1136,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 7 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -255,6 +255,33 @@
IsPerIndexQueryBound (f <$> oa) qb ↔ IsPerIndexQueryBound oa qb :=
isQueryBound_map_aux oa f _ _
+theorem IsPerIndexQueryBound.simulateQ_run_of_uniform_step
+ {σ : Type u}
+ {impl : QueryImpl spec (StateT σ (OracleComp spec))}
+ {oa : OracleComp spec α} {qb : ι → ℕ}
+ (h : IsP... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_51 | a4e50b461a2a1a21 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 51 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isTotalQueryBound_run_simulateQ_countingOracle_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isQueryBound_iff_of_map_eq (countingOracle.fst_map_run_simulateQ oa) _ _",
"n_chars": 7... | [
{
"name": "isQueryBound_iff_of_map_eq",
"text": "/-- If `f <$> oa = ob` for any `f`, the query-bound predicate transfers between them. The\nstandard shape is `oa = (simulateQ wrapped mx).run s` and `ob = simulateQ inner mx` (or\n`(simulateQ inner mx).run s'`), where `wrapped` threads bookkeeping (a state, a... | [
{
"name": "isTotalQueryBound_run_simulateQ_countingOracle_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 346,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automa... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -86,6 +86,18 @@
IsQueryBound (f <$> oa) b canQuery cost ↔ IsQueryBound oa b canQuery cost :=
PFunctor.FreeM.isRollBound_map_iff oa f b canQuery cost
+/-- If `f <$> oa = ob` for any `f`, the query-bound predicate transfers between them. The
+standard shape is `oa = (simulateQ wrapped mx).run s` and `ob = si... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_52 | a8c49c435b530d54 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 52 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isQueryBoundP_run_simulateQ_countingOracle_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isQueryBoundP_iff_of_map_eq (p := p) (countingOracle.fst_map_run_simulateQ oa)",
"n_chars":... | [
{
"name": "isQueryBoundP_iff_of_map_eq",
"text": "/-- Predicate-targeted analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`,\nthen `IsQueryBoundP` transfers between them. -/\nlemma isQueryBoundP_iff_of_map_eq\n {β : Type u} {oa : OracleComp spec α} {ob : OracleComp spec β} {f : α → ... | [
{
"name": "isQueryBoundP_run_simulateQ_countingOracle_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 405,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -154,6 +154,14 @@
IsQueryBoundP (f <$> oa) p n ↔ IsQueryBoundP oa p n :=
isQueryBound_map_aux oa f _ _
+/-- Predicate-targeted analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`,
+then `IsQueryBoundP` transfers between them. -/
+lemma isQueryBoundP_iff_of_map_eq
+ {β : Type u} {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_52d6bcb5e628_53 | 40c649504c0e2a6a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 53 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isTotalQueryBound_run_simulateQ_countingOracle_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isQueryBound_iff_of_map_eq (countingOracle.fst_map_run_simulateQ oa) _ _",
"n_chars": 7... | [
{
"name": "isQueryBound_iff_of_map_eq",
"text": "/-- If `f <$> oa = ob` for any `f`, the query-bound predicate transfers between them. The\nstandard shape is `oa = (simulateQ wrapped mx).run s` and `ob = simulateQ inner mx` (or\n`(simulateQ inner mx).run s'`), where `wrapped` threads bookkeeping (a state, a... | [
{
"name": "isTotalQueryBound_run_simulateQ_withTraceBefore_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 540,
"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
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -86,6 +86,18 @@
IsQueryBound (f <$> oa) b canQuery cost ↔ IsQueryBound oa b canQuery cost :=
PFunctor.FreeM.isRollBound_map_iff oa f b canQuery cost
+/-- If `f <$> oa = ob` for any `f`, the query-bound predicate transfers between them. The
+standard shape is `oa = (simulateQ wrapped mx).run s` and `ob = si... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_54 | 6e85122d75054b0a | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 54 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isQueryBoundP_run_simulateQ_countingOracle_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isQueryBoundP_iff_of_map_eq (p := p) (countingOracle.fst_map_run_simulateQ oa)",
"n_chars":... | [
{
"name": "isQueryBoundP_iff_of_map_eq",
"text": "/-- Predicate-targeted analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`,\nthen `IsQueryBoundP` transfers between them. -/\nlemma isQueryBoundP_iff_of_map_eq\n {β : Type u} {oa : OracleComp spec α} {ob : OracleComp spec β} {f : α → ... | [
{
"name": "isQueryBoundP_run_simulateQ_withTraceBefore_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 579,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automati... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -154,6 +154,14 @@
IsQueryBoundP (f <$> oa) p n ↔ IsQueryBoundP oa p n :=
isQueryBound_map_aux oa f _ _
+/-- Predicate-targeted analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`,
+then `IsQueryBoundP` transfers between them. -/
+lemma isQueryBoundP_iff_of_map_eq
+ {β : Type u} {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_52d6bcb5e628_55 | e1a92e9216c4bece | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 55 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isTotalQueryBound_run_simulateQ_countingOracle_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isQueryBound_iff_of_map_eq (countingOracle.fst_map_run_simulateQ oa) _ _",
"n_chars": 7... | [
{
"name": "isQueryBound_iff_of_map_eq",
"text": "/-- If `f <$> oa = ob` for any `f`, the query-bound predicate transfers between them. The\nstandard shape is `oa = (simulateQ wrapped mx).run s` and `ob = simulateQ inner mx` (or\n`(simulateQ inner mx).run s'`), where `wrapped` threads bookkeeping (a state, a... | [
{
"name": "isTotalQueryBound_run_simulateQ_withTraceAppend_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 606,
"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
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -86,6 +86,18 @@
IsQueryBound (f <$> oa) b canQuery cost ↔ IsQueryBound oa b canQuery cost :=
PFunctor.FreeM.isRollBound_map_iff oa f b canQuery cost
+/-- If `f <$> oa = ob` for any `f`, the query-bound predicate transfers between them. The
+standard shape is `oa = (simulateQ wrapped mx).run s` and `ob = si... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_56 | d52c4e34237ec0c1 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 56 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isQueryBoundP_run_simulateQ_countingOracle_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isQueryBoundP_iff_of_map_eq (p := p) (countingOracle.fst_map_run_simulateQ oa)",
"n_chars":... | [
{
"name": "isQueryBoundP_iff_of_map_eq",
"text": "/-- Predicate-targeted analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`,\nthen `IsQueryBoundP` transfers between them. -/\nlemma isQueryBoundP_iff_of_map_eq\n {β : Type u} {oa : OracleComp spec α} {ob : OracleComp spec β} {f : α → ... | [
{
"name": "isQueryBoundP_run_simulateQ_withTraceAppend_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 645,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automati... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -154,6 +154,14 @@
IsQueryBoundP (f <$> oa) p n ↔ IsQueryBoundP oa p n :=
isQueryBound_map_aux oa f _ _
+/-- Predicate-targeted analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`,
+then `IsQueryBoundP` transfers between them. -/
+lemma isQueryBoundP_iff_of_map_eq
+ {β : Type u} {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_52d6bcb5e628_57 | 66f029eac2f458a4 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 57 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isTotalQueryBound_run_simulateQ_countingOracle_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isQueryBound_iff_of_map_eq (countingOracle.fst_map_run_simulateQ oa) _ _",
"n_chars": 7... | [
{
"name": "isQueryBound_iff_of_map_eq",
"text": "/-- If `f <$> oa = ob` for any `f`, the query-bound predicate transfers between them. The\nstandard shape is `oa = (simulateQ wrapped mx).run s` and `ob = simulateQ inner mx` (or\n`(simulateQ inner mx).run s'`), where `wrapped` threads bookkeeping (a state, a... | [
{
"name": "isTotalQueryBound_run_simulateQ_withTrace_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 549,
"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
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -86,6 +86,18 @@
IsQueryBound (f <$> oa) b canQuery cost ↔ IsQueryBound oa b canQuery cost :=
PFunctor.FreeM.isRollBound_map_iff oa f b canQuery cost
+/-- If `f <$> oa = ob` for any `f`, the query-bound predicate transfers between them. The
+standard shape is `oa = (simulateQ wrapped mx).run s` and `ob = si... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_58 | 05fda9d9d8e0eb10 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 58 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isQueryBoundP_run_simulateQ_countingOracle_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isQueryBoundP_iff_of_map_eq (p := p) (countingOracle.fst_map_run_simulateQ oa)",
"n_chars":... | [
{
"name": "isQueryBoundP_iff_of_map_eq",
"text": "/-- Predicate-targeted analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`,\nthen `IsQueryBoundP` transfers between them. -/\nlemma isQueryBoundP_iff_of_map_eq\n {β : Type u} {oa : OracleComp spec α} {ob : OracleComp spec β} {f : α → ... | [
{
"name": "isQueryBoundP_run_simulateQ_withTrace_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 588,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_onl... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -154,6 +154,14 @@
IsQueryBoundP (f <$> oa) p n ↔ IsQueryBoundP oa p n :=
isQueryBound_map_aux oa f _ _
+/-- Predicate-targeted analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`,
+then `IsQueryBoundP` transfers between them. -/
+lemma isQueryBoundP_iff_of_map_eq
+ {β : Type u} {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_52d6bcb5e628_59 | 26a9db65febbcb23 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 59 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isTotalQueryBound_run_simulateQ_countingOracle_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isQueryBound_iff_of_map_eq (countingOracle.fst_map_run_simulateQ oa) _ _",
"n_chars": 7... | [
{
"name": "isQueryBound_iff_of_map_eq",
"text": "/-- If `f <$> oa = ob` for any `f`, the query-bound predicate transfers between them. The\nstandard shape is `oa = (simulateQ wrapped mx).run s` and `ob = simulateQ inner mx` (or\n`(simulateQ inner mx).run s'`), where `wrapped` threads bookkeeping (a state, a... | [
{
"name": "isTotalQueryBound_run_simulateQ_withTraceAppendBefore_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 597,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -86,6 +86,18 @@
IsQueryBound (f <$> oa) b canQuery cost ↔ IsQueryBound oa b canQuery cost :=
PFunctor.FreeM.isRollBound_map_iff oa f b canQuery cost
+/-- If `f <$> oa = ob` for any `f`, the query-bound predicate transfers between them. The
+standard shape is `oa = (simulateQ wrapped mx).run s` and `ob = si... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_60 | 21fa4dabde4076c6 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 60 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isQueryBoundP_run_simulateQ_countingOracle_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isQueryBoundP_iff_of_map_eq (p := p) (countingOracle.fst_map_run_simulateQ oa)",
"n_chars":... | [
{
"name": "isQueryBoundP_iff_of_map_eq",
"text": "/-- Predicate-targeted analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`,\nthen `IsQueryBoundP` transfers between them. -/\nlemma isQueryBoundP_iff_of_map_eq\n {β : Type u} {oa : OracleComp spec α} {ob : OracleComp spec β} {f : α → ... | [
{
"name": "isQueryBoundP_run_simulateQ_withTraceAppendBefore_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 636,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"au... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -154,6 +154,14 @@
IsQueryBoundP (f <$> oa) p n ↔ IsQueryBoundP oa p n :=
isQueryBound_map_aux oa f _ _
+/-- Predicate-targeted analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`,
+then `IsQueryBoundP` transfers between them. -/
+lemma isQueryBoundP_iff_of_map_eq
+ {β : Type u} {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_52d6bcb5e628_61 | 7c37e88e43800093 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 61 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isTotalQueryBound_run_simulateQ_countingOracle_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isQueryBound_iff_of_map_eq (countingOracle.fst_map_run_simulateQ oa) _ _",
"n_chars": 7... | [
{
"name": "isQueryBound_iff_of_map_eq",
"text": "/-- If `f <$> oa = ob` for any `f`, the query-bound predicate transfers between them. The\nstandard shape is `oa = (simulateQ wrapped mx).run s` and `ob = simulateQ inner mx` (or\n`(simulateQ inner mx).run s'`), where `wrapped` threads bookkeeping (a state, a... | [
{
"name": "isTotalQueryBound_run_simulateQ_withCost_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 516,
"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
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -86,6 +86,18 @@
IsQueryBound (f <$> oa) b canQuery cost ↔ IsQueryBound oa b canQuery cost :=
PFunctor.FreeM.isRollBound_map_iff oa f b canQuery cost
+/-- If `f <$> oa = ob` for any `f`, the query-bound predicate transfers between them. The
+standard shape is `oa = (simulateQ wrapped mx).run s` and `ob = si... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_62 | 19feeec92097534e | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 62 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isQueryBoundP_run_simulateQ_countingOracle_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isQueryBoundP_iff_of_map_eq (p := p) (countingOracle.fst_map_run_simulateQ oa)",
"n_chars":... | [
{
"name": "isQueryBoundP_iff_of_map_eq",
"text": "/-- Predicate-targeted analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`,\nthen `IsQueryBoundP` transfers between them. -/\nlemma isQueryBoundP_iff_of_map_eq\n {β : Type u} {oa : OracleComp spec α} {ob : OracleComp spec β} {f : α → ... | [
{
"name": "isQueryBoundP_run_simulateQ_withCost_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 555,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -154,6 +154,14 @@
IsQueryBoundP (f <$> oa) p n ↔ IsQueryBoundP oa p n :=
isQueryBound_map_aux oa f _ _
+/-- Predicate-targeted analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`,
+then `IsQueryBoundP` transfers between them. -/
+lemma isQueryBoundP_iff_of_map_eq
+ {β : Type u} {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_52d6bcb5e628_63 | 74de10abbe66d008 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 63 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isTotalQueryBound_run_simulateQ_countingOracle_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isQueryBound_iff_of_map_eq (countingOracle.fst_map_run_simulateQ oa) _ _",
"n_chars": 7... | [
{
"name": "isQueryBound_iff_of_map_eq",
"text": "/-- If `f <$> oa = ob` for any `f`, the query-bound predicate transfers between them. The\nstandard shape is `oa = (simulateQ wrapped mx).run s` and `ob = simulateQ inner mx` (or\n`(simulateQ inner mx).run s'`), where `wrapped` threads bookkeeping (a state, a... | [
{
"name": "isTotalQueryBound_run_simulateQ_withCounting_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 471,
"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
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -86,6 +86,18 @@
IsQueryBound (f <$> oa) b canQuery cost ↔ IsQueryBound oa b canQuery cost :=
PFunctor.FreeM.isRollBound_map_iff oa f b canQuery cost
+/-- If `f <$> oa = ob` for any `f`, the query-bound predicate transfers between them. The
+standard shape is `oa = (simulateQ wrapped mx).run s` and `ob = si... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_64 | ff70f5b1e2c93103 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 64 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isQueryBoundP_run_simulateQ_countingOracle_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isQueryBoundP_iff_of_map_eq (p := p) (countingOracle.fst_map_run_simulateQ oa)",
"n_chars":... | [
{
"name": "isQueryBoundP_iff_of_map_eq",
"text": "/-- Predicate-targeted analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`,\nthen `IsQueryBoundP` transfers between them. -/\nlemma isQueryBoundP_iff_of_map_eq\n {β : Type u} {oa : OracleComp spec α} {ob : OracleComp spec β} {f : α → ... | [
{
"name": "isQueryBoundP_run_simulateQ_withCounting_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 542,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -154,6 +154,14 @@
IsQueryBoundP (f <$> oa) p n ↔ IsQueryBoundP oa p n :=
isQueryBound_map_aux oa f _ _
+/-- Predicate-targeted analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`,
+then `IsQueryBoundP` transfers between them. -/
+lemma isQueryBoundP_iff_of_map_eq
+ {β : Type u} {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_52d6bcb5e628_65 | 2658060d3c585171 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 65 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isPerIndexQueryBound_run_simulateQ_countingOracle_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isPerIndexQueryBound_iff_of_map_eq (countingOracle.fst_map_run_simulateQ oa)",
"n_ch... | [
{
"name": "isPerIndexQueryBound_iff_of_map_eq",
"text": "/-- Per-index analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`, then\n`IsPerIndexQueryBound` transfers between them. -/\nlemma isPerIndexQueryBound_iff_of_map_eq\n {β : Type u} {oa : OracleComp spec α} {ob : OracleComp spec ... | [
{
"name": "isPerIndexQueryBound_run_simulateQ_countingOracle_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 394,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"aut... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -180,6 +180,16 @@
IsPerIndexQueryBound (f <$> oa) qb ↔ IsPerIndexQueryBound oa qb :=
isQueryBound_map_aux oa f _ _
+/-- Per-index analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`, then
+`IsPerIndexQueryBound` transfers between them. -/
+lemma isPerIndexQueryBound_iff_of_map_eq
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_66 | 0222946585b9d198 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 66 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isPerIndexQueryBound_run_simulateQ_countingOracle_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isPerIndexQueryBound_iff_of_map_eq (countingOracle.fst_map_run_simulateQ oa)",
"n_ch... | [
{
"name": "isPerIndexQueryBound_iff_of_map_eq",
"text": "/-- Per-index analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`, then\n`IsPerIndexQueryBound` transfers between them. -/\nlemma isPerIndexQueryBound_iff_of_map_eq\n {β : Type u} {oa : OracleComp spec α} {ob : OracleComp spec ... | [
{
"name": "isPerIndexQueryBound_run_simulateQ_withTraceBefore_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 11,
"n_chars": 582,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"a... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -180,6 +180,16 @@
IsPerIndexQueryBound (f <$> oa) qb ↔ IsPerIndexQueryBound oa qb :=
isQueryBound_map_aux oa f _ _
+/-- Per-index analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`, then
+`IsPerIndexQueryBound` transfers between them. -/
+lemma isPerIndexQueryBound_iff_of_map_eq
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_67 | 980a09c10d0be13c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 67 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isPerIndexQueryBound_run_simulateQ_countingOracle_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isPerIndexQueryBound_iff_of_map_eq (countingOracle.fst_map_run_simulateQ oa)",
"n_ch... | [
{
"name": "isPerIndexQueryBound_iff_of_map_eq",
"text": "/-- Per-index analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`, then\n`IsPerIndexQueryBound` transfers between them. -/\nlemma isPerIndexQueryBound_iff_of_map_eq\n {β : Type u} {oa : OracleComp spec α} {ob : OracleComp spec ... | [
{
"name": "isPerIndexQueryBound_run_simulateQ_withTrace_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 591,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automat... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -180,6 +180,16 @@
IsPerIndexQueryBound (f <$> oa) qb ↔ IsPerIndexQueryBound oa qb :=
isQueryBound_map_aux oa f _ _
+/-- Per-index analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`, then
+`IsPerIndexQueryBound` transfers between them. -/
+lemma isPerIndexQueryBound_iff_of_map_eq
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_68 | 79fc261d84af3d67 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 68 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isPerIndexQueryBound_run_simulateQ_countingOracle_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isPerIndexQueryBound_iff_of_map_eq (countingOracle.fst_map_run_simulateQ oa)",
"n_ch... | [
{
"name": "isPerIndexQueryBound_iff_of_map_eq",
"text": "/-- Per-index analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`, then\n`IsPerIndexQueryBound` transfers between them. -/\nlemma isPerIndexQueryBound_iff_of_map_eq\n {β : Type u} {oa : OracleComp spec α} {ob : OracleComp spec ... | [
{
"name": "isPerIndexQueryBound_run_simulateQ_withTraceAppendBefore_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 11,
"n_chars": 639,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -180,6 +180,16 @@
IsPerIndexQueryBound (f <$> oa) qb ↔ IsPerIndexQueryBound oa qb :=
isQueryBound_map_aux oa f _ _
+/-- Per-index analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`, then
+`IsPerIndexQueryBound` transfers between them. -/
+lemma isPerIndexQueryBound_iff_of_map_eq
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_69 | 5c2ded705c51149e | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 69 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isPerIndexQueryBound_run_simulateQ_countingOracle_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isPerIndexQueryBound_iff_of_map_eq (countingOracle.fst_map_run_simulateQ oa)",
"n_ch... | [
{
"name": "isPerIndexQueryBound_iff_of_map_eq",
"text": "/-- Per-index analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`, then\n`IsPerIndexQueryBound` transfers between them. -/\nlemma isPerIndexQueryBound_iff_of_map_eq\n {β : Type u} {oa : OracleComp spec α} {ob : OracleComp spec ... | [
{
"name": "isPerIndexQueryBound_run_simulateQ_withTraceAppend_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 648,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"a... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -180,6 +180,16 @@
IsPerIndexQueryBound (f <$> oa) qb ↔ IsPerIndexQueryBound oa qb :=
isQueryBound_map_aux oa f _ _
+/-- Per-index analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`, then
+`IsPerIndexQueryBound` transfers between them. -/
+lemma isPerIndexQueryBound_iff_of_map_eq
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_70 | 11079479dcc679c9 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 70 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isPerIndexQueryBound_run_simulateQ_countingOracle_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isPerIndexQueryBound_iff_of_map_eq (countingOracle.fst_map_run_simulateQ oa)",
"n_ch... | [
{
"name": "isPerIndexQueryBound_iff_of_map_eq",
"text": "/-- Per-index analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`, then\n`IsPerIndexQueryBound` transfers between them. -/\nlemma isPerIndexQueryBound_iff_of_map_eq\n {β : Type u} {oa : OracleComp spec α} {ob : OracleComp spec ... | [
{
"name": "isPerIndexQueryBound_run_simulateQ_withCost_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 11,
"n_chars": 558,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automati... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -180,6 +180,16 @@
IsPerIndexQueryBound (f <$> oa) qb ↔ IsPerIndexQueryBound oa qb :=
isQueryBound_map_aux oa f _ _
+/-- Per-index analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`, then
+`IsPerIndexQueryBound` transfers between them. -/
+lemma isPerIndexQueryBound_iff_of_map_eq
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_52d6bcb5e628_71 | f40eba65e0cd1ce0 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/QueryBound.lean | QueryBound | 71 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 7 | [
{
"theorem_name": "isPerIndexQueryBound_run_simulateQ_countingOracle_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isPerIndexQueryBound_iff_of_map_eq (countingOracle.fst_map_run_simulateQ oa)",
"n_ch... | [
{
"name": "isPerIndexQueryBound_iff_of_map_eq",
"text": "/-- Per-index analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`, then\n`IsPerIndexQueryBound` transfers between them. -/\nlemma isPerIndexQueryBound_iff_of_map_eq\n {β : Type u} {oa : OracleComp spec α} {ob : OracleComp spec ... | [
{
"name": "isPerIndexQueryBound_run_simulateQ_withCounting_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 10,
"n_chars": 513,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"auto... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma
-/
import Mathlib.Algebra.Polynomial.Eval.Defs
import PolyFun.PFunctor.Bound
import ToMathlib.General
import VCVio.OracleComp.EvalDist
import VCVio.OracleComp.QueryTracking.Coun... | @@ -180,6 +180,16 @@
IsPerIndexQueryBound (f <$> oa) qb ↔ IsPerIndexQueryBound oa qb :=
isQueryBound_map_aux oa f _ _
+/-- Per-index analogue of `isQueryBound_iff_of_map_eq`: if `f <$> oa = ob` for any `f`, then
+`IsPerIndexQueryBound` transfers between them. -/
+lemma isPerIndexQueryBound_iff_of_map_eq
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3cc4a4e89cf8_0 | 9f9f5aa26b77faa2 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/CryptoFoundations/KEMDEM.lean | KEMDEM | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "perfectlyCorrect_composeWithDEM",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro msg\n rw [← hkem]\n simp only [AsymmEncAlg.CorrectExp, composeWithDEM, KEMScheme.CorrectExp, monad... | [
{
"name": "kem_decaps_mem_support",
"text": "/-- From KEM correctness at the monadic probability level, every reachable decapsulation of an\nhonest ciphertext returns the encapsulated key. -/\nprivate lemma kem_decaps_mem_support\n {kem : KEMScheme m K PK SK CKEM}\n (hkem : Pr[= true | kem.CorrectExp]... | [
{
"name": "perfectlyCorrect_composeWithDEM",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 992,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 5,
"automation_only": false... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.DataEncapMech
import VCVio.CryptoFoundations.KeyEncapMech
import VCVio.CryptoFoundations.AsymmEncAlg.INDCPA.OneTime
import VCVio.ProgramLogic.Re... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.CryptoFoundations.DataEncapMech
import VCVio.CryptoFoundations.KeyEncapMech
import VCVio.CryptoFoundations.AsymmEncAlg.INDCPA.OneTime
import VCVio.ProgramLogic.Re... | @@ -45,6 +45,21 @@
[MonadLiftT m SetM] [LawfulMonadLiftT m SetM] [EvalDistCompatible m]
omit [LawfulMonadLiftT m SPMF] in
+/-- From KEM correctness at the monadic probability level, every reachable decapsulation of an
+honest ciphertext returns the encapsulated key. -/
+private lemma kem_decaps_mem_support
+ {... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_7e3a8099404d_0 | 63d770e769fb38da | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/ElGamal/SSP.lean | SSP | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evalDist_runProb_dhToLR_left_link_real_eq_elgamalLR_left",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold QueryImpl.Stateful.runProb\n rw [show dhToLR_left = QueryImpl.Stateful.of... | [
{
"name": "composed_real_left_handler_evalDist",
"text": "/-- Per-(query, state) handler equivalence (under `evalDist`) between the composed\n\"reduction ∘ dhTripleReal\" and the ElGamal LR-left game.\n\nThe `Sum.inl` (GETPK) cases are immediate: both sides return `(sk • gen, some sk)` after\nsampling `sk` ... | [
{
"name": "evalDist_runProb_dhToLR_left_link_real_eq_elgamalLR_left",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 879,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 7,
"n_structural": 1,
... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.StateSeparating.Hybrid
import VCVio.OracleComp.SimSemantics.QueryImpl.Constructions
/-!
# State-Separating Proofs: ElGamal IND-CPA via DDH
A handler-level formul... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.StateSeparating.Hybrid
import VCVio.OracleComp.SimSemantics.QueryImpl.Constructions
/-!
# State-Separating Proofs: ElGamal IND-CPA via DDH
A handler-level formul... | @@ -227,13 +227,56 @@
section ReductionEquivalences
+/-- Per-(query, state) handler equivalence (under `evalDist`) between the composed
+"reduction ∘ dhTripleReal" and the ElGamal LR-left game.
+
+The `Sum.inl` (GETPK) cases are immediate: both sides return `(sk • gen, some sk)` after
+sampling `sk` from `$ᵗ F`. T... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_7e3a8099404d_1 | 7b87f97133895186 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/ElGamal/SSP.lean | SSP | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evalDist_runProb_dhToLR_right_link_real_eq_elgamalLR_right",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold QueryImpl.Stateful.runProb\n rw [show dhToLR_right = QueryImpl.Stateful... | [
{
"name": "composed_real_right_handler_evalDist",
"text": "/-- Per-(query, state) handler equivalence (under `evalDist`) between the composed\n\"reduction ∘ dhTripleReal\" and the ElGamal LR-right game. -/\nprivate theorem composed_real_right_handler_evalDist (gen : G)\n (q : Unit ⊕ (G × G)) (s : Option ... | [
{
"name": "evalDist_runProb_dhToLR_right_link_real_eq_elgamalLR_right",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 846,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 7,
"n_structural": 1,
... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.StateSeparating.Hybrid
import VCVio.OracleComp.SimSemantics.QueryImpl.Constructions
/-!
# State-Separating Proofs: ElGamal IND-CPA via DDH
A handler-level formul... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.StateSeparating.Hybrid
import VCVio.OracleComp.SimSemantics.QueryImpl.Constructions
/-!
# State-Separating Proofs: ElGamal IND-CPA via DDH
A handler-level formul... | @@ -227,13 +227,51 @@
section ReductionEquivalences
+/-- Per-(query, state) handler equivalence (under `evalDist`) between the composed
+"reduction ∘ dhTripleReal" and the ElGamal LR-right game. -/
+private theorem composed_real_right_handler_evalDist (gen : G)
+ (q : Unit ⊕ (G × G)) (s : Option F) :
+ 𝒟[(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_7e3a8099404d_2 | 2df13dfb33faf62f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/ElGamal/SSP.lean | SSP | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evalDist_runProb_dhToLR_link_rand_swap",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold QueryImpl.Stateful.runProb\n rw [show dhToLR_left = QueryImpl.Stateful.ofStateless (dhToLR_... | [
{
"name": "composed_rand_swap_handler_evalDist",
"text": "/-- Per-(query, state) handler equivalence (under `evalDist`) between the composed\n\"left reduction ∘ dhTripleRand\" and \"right reduction ∘ dhTripleRand\". `GETPK` cases are\nidentical on both sides; the `LR` case reduces to the uniform-masking arg... | [
{
"name": "evalDist_runProb_dhToLR_link_rand_swap",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 1292,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 8,
"n_structural": 1,
"automation_only... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.StateSeparating.Hybrid
import VCVio.OracleComp.SimSemantics.QueryImpl.Constructions
/-!
# State-Separating Proofs: ElGamal IND-CPA via DDH
A handler-level formul... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.StateSeparating.Hybrid
import VCVio.OracleComp.SimSemantics.QueryImpl.Constructions
/-!
# State-Separating Proofs: ElGamal IND-CPA via DDH
A handler-level formul... | @@ -245,6 +245,91 @@
variable [Finite F] [SampleableType G]
+/-- Per-(query, state) handler equivalence (under `evalDist`) between the composed
+"left reduction ∘ dhTripleRand" and "right reduction ∘ dhTripleRand". `GETPK` cases are
+identical on both sides; the `LR` case reduces to the uniform-masking argument (`... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_7e3a8099404d_3 | a592af90eccff0c9 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Examples/ElGamal/SSP.lean | SSP | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evalDist_runProb_dhToLR_right_link_real_eq_elgamalLR_right",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold QueryImpl.Stateful.runProb\n rw [show dhToLR_right = QueryImpl.Stateful... | [
{
"name": "composed_real_right_handler_evalDist",
"text": "/-- Per-(query, state) handler equivalence (under `evalDist`) between the composed\n\"reduction ∘ dhTripleReal\" and the ElGamal LR-right game. -/\nprivate theorem composed_real_right_handler_evalDist (gen : G)\n (q : Unit ⊕ (G × G)) (s : Option ... | [
{
"name": "elgamalLR_left_advantage_right_le",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 6,
"n_lines": 76,
"n_chars": 5025,
"n_subproofs": 5,
"n_tactics": 56,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 7,
"n_structural": 7,
"automation_only": fa... | 6 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.StateSeparating.Hybrid
import VCVio.OracleComp.SimSemantics.QueryImpl.Constructions
/-!
# State-Separating Proofs: ElGamal IND-CPA via DDH
A handler-level formul... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.StateSeparating.Hybrid
import VCVio.OracleComp.SimSemantics.QueryImpl.Constructions
/-!
# State-Separating Proofs: ElGamal IND-CPA via DDH
A handler-level formul... | @@ -261,6 +261,35 @@
dsimp only [StateT.run]
simp only [Functor.map_map]
+/-- Per-(query, state) handler equivalence (under `evalDist`) between the composed
+"reduction ∘ dhTripleReal" and the ElGamal LR-right game. -/
+private theorem composed_real_right_handler_evalDist (gen : G)
+ (q : Unit ⊕ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_7f330c3678ff_0 | 31f01800831e1a23 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/HandlerFromUnary.lean | HandlerFromUnary | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "relTriple_simulateQ_run_writerT'_of_triples",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact relTriple_map (relTriple_post_mono (relTriple_simulateQ_run_writerT_of_triples\n impl₁... | [
{
"name": "relTriple_simulateQ_run_writerT_of_triples",
"text": "/-- `WriterT` analogue of `relTriple_simulateQ_run_of_triples` (monoid variant).\n\nGiven matching unary `Std.Do.Triple` specs for two `WriterT`-based\nhandlers, a monoid-congruent writer relation `R_writer` (via `hR_one` and\n`hR_mul`), and a... | [
{
"name": "relTriple_simulateQ_run_writerT'_of_triples",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 33,
"n_chars": 1672,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.FromUnary
import VCVio.ProgramLogic.Relational.SimulateQ
import VCVio.ProgramLogic.Unary.HandlerSpecs
/-!
# Lifting `Std.Do` handler trip... | /-
Copyright (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.FromUnary
import VCVio.ProgramLogic.Relational.SimulateQ
import VCVio.ProgramLogic.Unary.HandlerSpecs
/-!
# Lifting `Std.Do` handler trip... | @@ -158,6 +158,58 @@
(fun ⟨a, w⟩ hmem => h₁ s₁ hP₁ a w hmem)
(fun ⟨b, w⟩ hmem => h₂ s₂ hP₂ b w hmem)
+/-- `WriterT` analogue of `relTriple_simulateQ_run_of_triples` (monoid variant).
+
+Given matching unary `Std.Do.Triple` specs for two `WriterT`-based
+handlers, a monoid-congruent writer relation `R_writer... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_7f330c3678ff_1 | 4e2d37210332bc83 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/HandlerFromUnary.lean | HandlerFromUnary | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "relTriple_simulateQ_run'_of_triples",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact relTriple_map (relTriple_post_mono (relTriple_simulateQ_run_of_triples\n impl₁ impl₂ R_state o... | [
{
"name": "relTriple_simulateQ_run_of_triples",
"text": "/-- Whole-program handler lift: given matching unary handler triples on\ntwo simulators with parametric pre/postconditions and a synchronization\ncondition relating the postconditions, derive a `RelTriple` on the entire\n`simulateQ` outputs.\n\nThe un... | [
{
"name": "relTriple_simulateQ_run'_of_triples",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 44,
"n_chars": 2175,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": f... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.FromUnary
import VCVio.ProgramLogic.Relational.SimulateQ
import VCVio.ProgramLogic.Unary.HandlerSpecs
/-!
# Lifting `Std.Do` handler trip... | /-
Copyright (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.FromUnary
import VCVio.ProgramLogic.Relational.SimulateQ
import VCVio.ProgramLogic.Unary.HandlerSpecs
/-!
# Lifting `Std.Do` handler trip... | @@ -158,6 +158,51 @@
(fun ⟨a, w⟩ hmem => h₁ s₁ hP₁ a w hmem)
(fun ⟨b, w⟩ hmem => h₂ s₂ hP₂ b w hmem)
+/-- Whole-program handler lift: given matching unary handler triples on
+two simulators with parametric pre/postconditions and a synchronization
+condition relating the postconditions, derive a `RelTriple` ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_7f330c3678ff_2 | 9c006999d38f01e8 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/ProgramLogic/Relational/HandlerFromUnary.lean | HandlerFromUnary | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "relTriple_simulateQ_run_of_impl_eq_triple",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n relTriple_simulateQ_run_eqRel_of_impl_eq_preservesInv\n impl₁ impl₂ Inv oa himpl_eq\n (support... | [
{
"name": "support_preservesInv_of_triple",
"text": "/-- Convert a unary `Std.Do.Triple` invariant-preservation spec into the\n`support`-based preservation hypothesis consumed by\n`relTriple_simulateQ_run_of_impl_eq_preservesInv` and friends.\n\nThe `mvcgen` proof style produces invariant-preservation specs... | [
{
"name": "relTriple_simulateQ_run_of_impl_eq_triple",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 30,
"n_chars": 1200,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_on... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import VCVio.ProgramLogic.Relational.FromUnary
import VCVio.ProgramLogic.Relational.SimulateQ
import VCVio.ProgramLogic.Unary.HandlerSpecs
/-!
# Lifting `Std.Do` handler trip... | /-
Copyright (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.FromUnary
import VCVio.ProgramLogic.Relational.SimulateQ
import VCVio.ProgramLogic.Unary.HandlerSpecs
/-!
# Lifting `Std.Do` handler trip... | @@ -158,6 +158,29 @@
(fun ⟨a, w⟩ hmem => h₁ s₁ hP₁ a w hmem)
(fun ⟨b, w⟩ hmem => h₂ s₂ hP₂ b w hmem)
+/-- Convert a unary `Std.Do.Triple` invariant-preservation spec into the
+`support`-based preservation hypothesis consumed by
+`relTriple_simulateQ_run_of_impl_eq_preservesInv` and friends.
+
+The `mvcgen` ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_163d7b6dad0f_0 | c200091ce86e4405 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/EvalDist/Defs/NeverFails.lean | NeverFails | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "bind_of_forall",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " bind_of_mem_support (hx := hx) (fun x _ => hy x)",
"n_chars": 49,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": ... | [
{
"name": "bind_of_mem_support",
"text": "/--\nPrecise bind lemma: if `mx` never fails and for all `x` in the support of `mx` the continuation\n`my x` never fails, then the whole bind never fails.\n\nSketch: using `evalDist_bind` and the identity\n\n `Pr[⊥ | mx >>= my] = Pr[⊥ | mx] + ∑ x, Pr[= x | mx] * Pr... | [
{
"name": "bind_of_forall",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 536,
"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) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.EvalDist.Defs.AlternativeMonad
import VCVio.EvalDist.Monad.Seq
/-!
# Computations that Never Fail
This file defines a predicate-as-typeclass statin... | /-
Copyright (c) 2025 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.EvalDist.Defs.AlternativeMonad
import VCVio.EvalDist.Monad.Seq
/-!
# Computations that Never Fail
This file defines a predicate-as-typeclass statin... | @@ -109,6 +109,24 @@
probFailure_eq_zero := by simp [probFailure]
/--
+Precise bind lemma: if `mx` never fails and for all `x` in the support of `mx` the continuation
+`my x` never fails, then the whole bind never fails.
+
+Sketch: using `evalDist_bind` and the identity
+
+ `Pr[⊥ | mx >>= my] = Pr[⊥ | mx] + ∑ x,... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3d7f31e24a8f_0 | 1bba4d863b17d473 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLDSA/Concrete/Rounding.lean | Rounding | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 2 | [
{
"theorem_name": "power2RoundCoeff_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [power2RoundCoeff] at hdecomp\n have hdam := natCast_div_add_mod r power2Scale\n split_ifs at hdecomp <;> r... | [
{
"name": "natCast_div_add_mod",
"text": "private theorem natCast_div_add_mod (r : Coeff) (s : ℕ) :\n s * ((r.val / s):Coeff) + ((r.val % s): Coeff) = r := by\n rw [← Nat.cast_mul, ← Nat.cast_add]\n nth_rewrite 3 [← ZMod.natCast_zmod_val r]\n congr 1; exact Nat.div_add_mod r.val s\n\n",
"fan_in": ... | [
{
"name": "power2RoundCoeff_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 383,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 4,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"max_ne... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | @@ -188,9 +188,20 @@
end BalancedDecomp
+private theorem natCast_div_add_mod (r : Coeff) (s : ℕ) :
+ s * ((r.val / s):Coeff) + ((r.val % s): Coeff) = r := by
+ rw [← Nat.cast_mul, ← Nat.cast_add]
+ nth_rewrite 3 [← ZMod.natCast_zmod_val r]
+ congr 1; exact Nat.div_add_mod r.val s
+
private theorem power2Rou... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3d7f31e24a8f_1 | be664065bca80116 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLDSA/Concrete/Rounding.lean | Rounding | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 2 | [
{
"theorem_name": "power2RoundCoeff_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [power2RoundCoeff] at hdecomp\n have hdam := natCast_div_add_mod r power2Scale\n split_ifs at hdecomp <;> r... | [
{
"name": "natCast_div_add_mod",
"text": "private theorem natCast_div_add_mod (r : Coeff) (s : ℕ) :\n s * ((r.val / s):Coeff) + ((r.val % s): Coeff) = r := by\n rw [← Nat.cast_mul, ← Nat.cast_add]\n nth_rewrite 3 [← ZMod.natCast_zmod_val r]\n congr 1; exact Nat.div_add_mod r.val s\n\n",
"fan_in": ... | [
{
"name": "decomposeCoeff_eq",
"fan_in": 4,
"n_deps_direct": 5,
"n_deps_transitive": 2,
"n_lines": 21,
"n_chars": 892,
"n_subproofs": 3,
"n_tactics": 25,
"cyclomatic": 6,
"n_automation": 9,
"n_rewrites": 7,
"n_structural": 2,
"automation_only": false,
"max_nes... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | @@ -188,6 +188,12 @@
end BalancedDecomp
+private theorem natCast_div_add_mod (r : Coeff) (s : ℕ) :
+ s * ((r.val / s):Coeff) + ((r.val % s): Coeff) = r := by
+ rw [← Nat.cast_mul, ← Nat.cast_add]
+ nth_rewrite 3 [← ZMod.natCast_zmod_val r]
+ congr 1; exact Nat.div_add_mod r.val s
+
private theorem decompose... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3d7f31e24a8f_2 | 84aef565bd0fcd22 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLDSA/Concrete/Rounding.lean | Rounding | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 5 | [
{
"theorem_name": "centeredRepr_intCast_lowBitsCoeff",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have : (lowBitsCoeff r gamma2).natAbs ≤ gamma2 := by\n simp only [lowBitsCoeff]\n rcases hdec : dec... | [
{
"name": "lowBitsCoeff_bound",
"text": "private theorem lowBitsCoeff_bound (r : Coeff) {r1 gamma2 : ℕ} {r0 : ℤ} (hγ : 0 < gamma2)\n (hdec : decomposeCoeff r gamma2 = (r1, r0)) :\n r0.natAbs ≤ gamma2 := by\n simp only [decomposeCoeff] at hdec\n set alpha : ℕ := 2 * gamma2\n set t : ℕ := r.val % alp... | [
{
"name": "centeredRepr_intCast_lowBitsCoeff",
"fan_in": 2,
"n_deps_direct": 9,
"n_deps_transitive": 4,
"n_lines": 11,
"n_chars": 489,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": fals... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | @@ -188,10 +188,22 @@
end BalancedDecomp
+private theorem lowBitsCoeff_bound (r : Coeff) {r1 gamma2 : ℕ} {r0 : ℤ} (hγ : 0 < gamma2)
+ (hdec : decomposeCoeff r gamma2 = (r1, r0)) :
+ r0.natAbs ≤ gamma2 := by
+ simp only [decomposeCoeff] at hdec
+ set alpha : ℕ := 2 * gamma2
+ set t : ℕ := r.val % alpha
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3d7f31e24a8f_3 | 65ac5b70c0c92530 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLDSA/Concrete/Rounding.lean | Rounding | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "concretePower2Round_high_low_decomp",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Poly.ext_get_eq fun j => by\n rw [Rq.get_add, power2RoundShift_high_get, power2RoundLow_get]\n exact... | [
{
"name": "power2RoundShift_high_get",
"text": "private theorem power2RoundShift_high_get (r : Rq) (i : Fin ringDegree) :\n (power2RoundShift (power2RoundHigh r)).get i =\n (power2Scale : Coeff) * ((power2RoundCoeff (r.get i)).1 : Coeff) := by\n simp [power2RoundShift, power2RoundHigh]\n\n",
"f... | [
{
"name": "concretePower2Round_high_low_decomp",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 5,
"n_lines": 7,
"n_chars": 264,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": fal... | 4 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | @@ -203,12 +203,20 @@
· exact hdam
· ring_nf; exact hdam
+private theorem power2RoundShift_high_get (r : Rq) (i : Fin ringDegree) :
+ (power2RoundShift (power2RoundHigh r)).get i =
+ (power2Scale : Coeff) * ((power2RoundCoeff (r.get i)).1 : Coeff) := by
+ simp [power2RoundShift, power2RoundHigh]
+
pri... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3d7f31e24a8f_4 | b26212e9c6bd492d | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLDSA/Concrete/Rounding.lean | Rounding | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "concretePower2Round_high_low_decomp",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Poly.ext_get_eq fun j => by\n rw [Rq.get_add, power2RoundShift_high_get, power2RoundLow_get]\n exact... | [
{
"name": "power2RoundShift_high_get",
"text": "private theorem power2RoundShift_high_get (r : Rq) (i : Fin ringDegree) :\n (power2RoundShift (power2RoundHigh r)).get i =\n (power2Scale : Coeff) * ((power2RoundCoeff (r.get i)).1 : Coeff) := by\n simp [power2RoundShift, power2RoundHigh]\n\n",
"f... | [
{
"name": "concretePower2Round_remainder_eq_low",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 5,
"n_chars": 192,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": fa... | 5 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | @@ -203,12 +203,20 @@
· exact hdam
· ring_nf; exact hdam
+private theorem power2RoundShift_high_get (r : Rq) (i : Fin ringDegree) :
+ (power2RoundShift (power2RoundHigh r)).get i =
+ (power2Scale : Coeff) * ((power2RoundCoeff (r.get i)).1 : Coeff) := by
+ simp [power2RoundShift, power2RoundHigh]
+
pri... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3d7f31e24a8f_5 | b6989d257ddd0860 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLDSA/Concrete/Rounding.lean | Rounding | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "concretePower2Round_high_low_decomp",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Poly.ext_get_eq fun j => by\n rw [Rq.get_add, power2RoundShift_high_get, power2RoundLow_get]\n exact... | [
{
"name": "power2RoundLow_get",
"text": "private theorem power2RoundLow_get (r : Rq) (i : Fin ringDegree) :\n (power2RoundLow r).get i = (power2RoundCoeff (r.get i)).2 := by\n simp [power2RoundLow]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 160,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "concretePower2Round_bound",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 12,
"n_chars": 488,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"... | 7 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | @@ -217,8 +217,15 @@
(power2Scale : Coeff) * ((power2RoundCoeff (r.get i)).1 : Coeff) := by
simp [power2RoundShift, power2RoundHigh]
+private theorem power2RoundLow_get (r : Rq) (i : Fin ringDegree) :
+ (power2RoundLow r).get i = (power2RoundCoeff (r.get i)).2 := by
+ simp [power2RoundLow]
+
theorem co... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3d7f31e24a8f_6 | 04fc1f90fe8ecdbf | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLDSA/Concrete/Rounding.lean | Rounding | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "concreteRounding_high_low_decomp",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Poly.ext_get_eq fun j => by\n rw [Rq.get_add, highBitsShift_high_get, lowBits_get]\n have : 2 * p.gamma... | [
{
"name": "highBitsShift_high_get",
"text": "private theorem highBitsShift_high_get (p : Params) (r : Rq) (i : Fin ringDegree) :\n (highBitsShift p (highBits p r)).get i =\n ((2 * p.gamma2 : ℕ) : Coeff) * (highBitsCoeff (r.get i) p.gamma2 : Coeff) := by\n simp [highBitsShift, highBits]\n\n",
"f... | [
{
"name": "concreteRounding_high_low_decomp",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 6,
"n_lines": 9,
"n_chars": 378,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 2,
"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 LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | @@ -214,12 +214,22 @@
· rw [← hdam]; ring_nf; rw [← hwrap (q+1) hs]; push_cast; ring_nf
· rw [← hdam]; ring
+private theorem highBitsShift_high_get (p : Params) (r : Rq) (i : Fin ringDegree) :
+ (highBitsShift p (highBits p r)).get i =
+ ((2 * p.gamma2 : ℕ) : Coeff) * (highBitsCoeff (r.get i) p.gamma2 :... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3d7f31e24a8f_7 | 2c0ff5243c36732c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLDSA/Concrete/Rounding.lean | Rounding | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 2 | [
{
"theorem_name": "concreteRounding_lowBits_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine cInfNorm_le_of_coeff_le ?_\n intro i\n rw [lowBits_get]\n rw [centeredRepr_intCast_lowBitsCoeff (r... | [
{
"name": "centeredRepr_intCast_lowBitsCoeff",
"text": "private theorem centeredRepr_intCast_lowBitsCoeff (r : Coeff) {gamma2 : ℕ}\n (hγ : 0 < gamma2) (hq : 2 * gamma2 < modulus) :\n centeredRepr ((lowBitsCoeff r gamma2):Coeff) = lowBitsCoeff r gamma2 := by\n have : (lowBitsCoeff r gamma2).natAbs ≤ g... | [
{
"name": "concreteRounding_lowBits_bound",
"fan_in": 1,
"n_deps_direct": 11,
"n_deps_transitive": 6,
"n_lines": 12,
"n_chars": 439,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 4,
"automation_only": false,... | 3 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | @@ -197,13 +197,30 @@
have htlt : t < alpha := Nat.mod_lt _ (by omega)
grind
+private theorem centeredRepr_intCast_lowBitsCoeff (r : Coeff) {gamma2 : ℕ}
+ (hγ : 0 < gamma2) (hq : 2 * gamma2 < modulus) :
+ centeredRepr ((lowBitsCoeff r gamma2):Coeff) = lowBitsCoeff r gamma2 := by
+ have : (lowBitsCoeff r ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3d7f31e24a8f_8 | c204d97f97dae348 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLDSA/Concrete/Rounding.lean | Rounding | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 5 | [
{
"theorem_name": "centeredRepr_intCast_lowBitsCoeff",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have : (lowBitsCoeff r gamma2).natAbs ≤ gamma2 := by\n simp only [lowBitsCoeff]\n rcases hdec : dec... | [
{
"name": "lowBitsCoeff_bound",
"text": "private theorem lowBitsCoeff_bound (r : Coeff) {r1 gamma2 : ℕ} {r0 : ℤ} (hγ : 0 < gamma2)\n (hdec : decomposeCoeff r gamma2 = (r1, r0)) :\n r0.natAbs ≤ gamma2 := by\n simp only [decomposeCoeff] at hdec\n set alpha : ℕ := 2 * gamma2\n set t : ℕ := r.val % alp... | [
{
"name": "highBitsCoeff_add_eq_of_centeredRepr_lt",
"fan_in": 1,
"n_deps_direct": 6,
"n_deps_transitive": 9,
"n_lines": 44,
"n_chars": 2434,
"n_subproofs": 14,
"n_tactics": 44,
"cyclomatic": 4,
"n_automation": 10,
"n_rewrites": 9,
"n_structural": 13,
"automation_... | 5 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | @@ -214,6 +214,15 @@
· rw [← hdam]; ring_nf; rw [← hwrap (q+1) hs]; push_cast; ring_nf
· rw [← hdam]; ring
+private theorem lowBitsCoeff_bound (r : Coeff) {r1 gamma2 : ℕ} {r0 : ℤ} (hγ : 0 < gamma2)
+ (hdec : decomposeCoeff r gamma2 = (r1, r0)) :
+ r0.natAbs ≤ gamma2 := by
+ simp only [decomposeCoeff] at ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3d7f31e24a8f_9 | 6de001043b0fe332 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLDSA/Concrete/Rounding.lean | Rounding | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 5 | [
{
"theorem_name": "centeredRepr_intCast_lowBitsCoeff",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have : (lowBitsCoeff r gamma2).natAbs ≤ gamma2 := by\n simp only [lowBitsCoeff]\n rcases hdec : dec... | [
{
"name": "lowBitsCoeff_bound",
"text": "private theorem lowBitsCoeff_bound (r : Coeff) {r1 gamma2 : ℕ} {r0 : ℤ} (hγ : 0 < gamma2)\n (hdec : decomposeCoeff r gamma2 = (r1, r0)) :\n r0.natAbs ≤ gamma2 := by\n simp only [decomposeCoeff] at hdec\n set alpha : ℕ := 2 * gamma2\n set t : ℕ := r.val % alp... | [
{
"name": "useHintCoeff_shift_sub_le",
"fan_in": 1,
"n_deps_direct": 7,
"n_deps_transitive": 9,
"n_lines": 48,
"n_chars": 2346,
"n_subproofs": 6,
"n_tactics": 51,
"cyclomatic": 7,
"n_automation": 20,
"n_rewrites": 15,
"n_structural": 14,
"automation_only": false,
... | 5 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | @@ -214,6 +214,15 @@
· rw [← hdam]; ring_nf; rw [← hwrap (q+1) hs]; push_cast; ring_nf
· rw [← hdam]; ring
+private theorem lowBitsCoeff_bound (r : Coeff) {r1 gamma2 : ℕ} {r0 : ℤ} (hγ : 0 < gamma2)
+ (hdec : decomposeCoeff r gamma2 = (r1, r0)) :
+ r0.natAbs ≤ gamma2 := by
+ simp only [decomposeCoeff] at ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3d7f31e24a8f_12 | 92878ddcff2c34a1 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLDSA/Concrete/Rounding.lean | Rounding | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 3 | [
{
"theorem_name": "highBitsCoeff_add_eq_of_centeredRepr_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 38,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases hdecomp_r : decomposeCoeff r (alpha / 2) with ⟨r1, r0⟩\n rcases hdecomp_rs : decomposeCoef... | [
{
"name": "highBitsCoeff_lt_m",
"text": "private theorem highBitsCoeff_lt_m {alpha m : ℕ}\n (ctx : BalancedDecomp alpha m) (r : Coeff) :\n highBitsCoeff r (alpha / 2) < m := by\n simp only [highBitsCoeff, decomposeCoeff, ctx.h2α]\n set t : ℕ := r.val % alpha\n have hle : r.val ≤ alpha * m := by\n ... | [
{
"name": "useHintCoeff_makeHintCoeff_eq_of_small",
"fan_in": 1,
"n_deps_direct": 10,
"n_deps_transitive": 12,
"n_lines": 53,
"n_chars": 2956,
"n_subproofs": 13,
"n_tactics": 54,
"cyclomatic": 4,
"n_automation": 20,
"n_rewrites": 9,
"n_structural": 11,
"automation... | 8 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | @@ -223,6 +223,31 @@
have htlt : t < alpha := Nat.mod_lt _ (by omega)
grind
+private theorem highBitsCoeff_lt_m {alpha m : ℕ}
+ (ctx : BalancedDecomp alpha m) (r : Coeff) :
+ highBitsCoeff r (alpha / 2) < m := by
+ simp only [highBitsCoeff, decomposeCoeff, ctx.h2α]
+ set t : ℕ := r.val % alpha
+ have h... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3d7f31e24a8f_13 | 87b49417be5dd598 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLDSA/Concrete/Rounding.lean | Rounding | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "highBitsShift_injective_of_isApproved",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro x y hxy\n refine Poly.ext_get_eq fun j => ?_\n have hcoeff : (2 * p.gamma2 : ℕ) * x.get j = (... | [
{
"name": "hunit",
"text": "private lemma hunit {ctx : BalancedDecomp alpha m} : IsUnit (alpha : Coeff) :=\n IsUnit.of_mul_eq_one (-(m : Coeff)) (by\n rw[mul_neg, ← Nat.cast_mul, ctx.hqm1, Nat.cast_sub (show 1 ≤ modulus by norm_num [modulus]),\n ZMod.natCast_self, zero_sub, neg_neg]; rfl)\n\n",
... | [
{
"name": "highBitsShift_injective_of_isApproved",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 420,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": ... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | @@ -186,11 +186,21 @@
rw [← ctx.hqm1, mul_comm] at h
exact Nat.pos_of_mul_pos_right h
+private lemma hunit {ctx : BalancedDecomp alpha m} : IsUnit (alpha : Coeff) :=
+ IsUnit.of_mul_eq_one (-(m : Coeff)) (by
+ rw[mul_neg, ← Nat.cast_mul, ctx.hqm1, Nat.cast_sub (show 1 ≤ modulus by norm_num [modulus]),
+ ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3d7f31e24a8f_14 | f76a899c2a8b11f9 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLDSA/Concrete/Rounding.lean | Rounding | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 3 | [
{
"theorem_name": "useHintCoeff_shift_sub_le",
"depth": 1,
"n_commands": 0,
"n_lines": 42,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases hdec : decomposeCoeff r (alpha / 2) with ⟨r1, r0⟩\n have hdecomp : alpha * (r1 : Coeff) + r0 = r := deco... | [
{
"name": "alpha_mul_pred_m_eq",
"text": "private theorem alpha_mul_pred_m_eq {alpha m : ℕ} (ctx : BalancedDecomp alpha m) :\n (alpha: Coeff) * ((m - 1 : ℕ) : Coeff) = (-1 : Coeff) - (alpha : Coeff) := by\n rw [Nat.cast_sub (show 1 ≤ m from ctx.hm), mul_sub, ← Nat.cast_mul,\n ctx.hqm1, Nat.cast_sub (... | [
{
"name": "concreteRounding_useHint_correct_of_isApproved",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 14,
"n_lines": 12,
"n_chars": 520,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 3,
"automati... | 9 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | @@ -248,6 +248,12 @@
have hdiv_le := Nat.add_one_le_of_lt hlt
exact lt_of_le_of_ne hdiv_le fun hm => hs (by rw [hm, ctx.hqm1])
+private theorem alpha_mul_pred_m_eq {alpha m : ℕ} (ctx : BalancedDecomp alpha m) :
+ (alpha: Coeff) * ((m - 1 : ℕ) : Coeff) = (-1 : Coeff) - (alpha : Coeff) := by
+ rw [Nat.cas... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3d7f31e24a8f_15 | 6bae0a8cb1e2aca6 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLDSA/Concrete/Rounding.lean | Rounding | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 3 | [
{
"theorem_name": "highBitsCoeff_add_eq_of_centeredRepr_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 38,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases hdecomp_r : decomposeCoeff r (alpha / 2) with ⟨r1, r0⟩\n rcases hdecomp_rs : decomposeCoef... | [
{
"name": "highBitsCoeff_lt_m",
"text": "private theorem highBitsCoeff_lt_m {alpha m : ℕ}\n (ctx : BalancedDecomp alpha m) (r : Coeff) :\n highBitsCoeff r (alpha / 2) < m := by\n simp only [highBitsCoeff, decomposeCoeff, ctx.h2α]\n set t : ℕ := r.val % alpha\n have hle : r.val ≤ alpha * m := by\n ... | [
{
"name": "concreteRounding_useHint_bound_of_isApproved",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 11,
"n_lines": 10,
"n_chars": 467,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation... | 6 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | @@ -223,6 +223,31 @@
have htlt : t < alpha := Nat.mod_lt _ (by omega)
grind
+private theorem highBitsCoeff_lt_m {alpha m : ℕ}
+ (ctx : BalancedDecomp alpha m) (r : Coeff) :
+ highBitsCoeff r (alpha / 2) < m := by
+ simp only [highBitsCoeff, decomposeCoeff, ctx.h2α]
+ set t : ℕ := r.val % alpha
+ have h... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3d7f31e24a8f_16 | 41505b271962da34 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLDSA/Concrete/Rounding.lean | Rounding | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 3 | [
{
"theorem_name": "concreteRounding_high_low_decomp",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Poly.ext_get_eq fun j => by\n rw [Rq.get_add, highBitsShift_high_get, lowBits_get]\n have : 2 * p.gamma... | [
{
"name": "lowBits_get",
"text": "private theorem lowBits_get (p : Params) (r : Rq) (i : Fin ringDegree) :\n (lowBits p r).get i = lowBitsCoeff (r.get i) p.gamma2 := by\n simp [lowBits]\n\n",
"fan_in": 3,
"n_lines": 5,
"n_chars": 155,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic... | [
{
"name": "concreteRounding_hide_low_of_isApproved",
"fan_in": 1,
"n_deps_direct": 6,
"n_deps_transitive": 13,
"n_lines": 24,
"n_chars": 1061,
"n_subproofs": 4,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 5,
"automation_on... | 8 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | @@ -233,6 +233,10 @@
exact centeredRepr_intCast_eq_of_natAbs_le
(b:=gamma2) (lowBitsCoeff r gamma2) this hq
+private theorem lowBits_get (p : Params) (r : Rq) (i : Fin ringDegree) :
+ (lowBits p r).get i = lowBitsCoeff (r.get i) p.gamma2 := by
+ simp [lowBits]
+
private theorem highBitsCoeff_lt_m {alpha ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3d7f31e24a8f_17 | dc2ae26cd1064923 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLDSA/Concrete/Rounding.lean | Rounding | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "concretePower2Round_high_low_decomp",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Poly.ext_get_eq fun j => by\n rw [Rq.get_add, power2RoundShift_high_get, power2RoundLow_get]\n exact... | [
{
"name": "power2RoundLow_get",
"text": "private theorem power2RoundLow_get (r : Rq) (i : Fin ringDegree) :\n (power2RoundLow r).get i = (power2RoundCoeff (r.get i)).2 := by\n simp [power2RoundLow]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 160,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "concretePower2RoundLaws",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 9,
"n_lines": 5,
"n_chars": 166,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max... | 8 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | @@ -217,8 +217,15 @@
(power2Scale : Coeff) * ((power2RoundCoeff (r.get i)).1 : Coeff) := by
simp [power2RoundShift, power2RoundHigh]
+private theorem power2RoundLow_get (r : Rq) (i : Fin ringDegree) :
+ (power2RoundLow r).get i = (power2RoundCoeff (r.get i)).2 := by
+ simp [power2RoundLow]
+
theorem co... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_3d7f31e24a8f_18 | 1c16f28159ebeed3 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | LatticeCrypto/MLDSA/Concrete/Rounding.lean | Rounding | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 3 | [
{
"theorem_name": "useHintCoeff_shift_sub_le",
"depth": 1,
"n_commands": 0,
"n_lines": 42,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases hdec : decomposeCoeff r (alpha / 2) with ⟨r1, r0⟩\n have hdecomp : alpha * (r1 : Coeff) + r0 = r := deco... | [
{
"name": "alpha_mul_pred_m_eq",
"text": "private theorem alpha_mul_pred_m_eq {alpha m : ℕ} (ctx : BalancedDecomp alpha m) :\n (alpha: Coeff) * ((m - 1 : ℕ) : Coeff) = (-1 : Coeff) - (alpha : Coeff) := by\n rw [Nat.cast_sub (show 1 ≤ m from ctx.hm), mul_sub, ← Nat.cast_mul,\n ctx.hqm1, Nat.cast_sub (... | [
{
"name": "concreteRoundingLaws_of_isApproved",
"fan_in": 0,
"n_deps_direct": 8,
"n_deps_transitive": 29,
"n_lines": 15,
"n_chars": 753,
"n_subproofs": 1,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": f... | 22 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import LatticeCrypto.MLDSA.Arithmetic
import LatticeCrypto.Ring.Norms
import Batteries.Data.Vector.Lemmas
import Mathlib.Data.Int.Lemmas
import Mathlib.Data.Int.NatAbs
import M... | @@ -291,6 +291,12 @@
have hdiv_le := Nat.add_one_le_of_lt hlt
exact lt_of_le_of_ne hdiv_le fun hm => hs (by rw [hm, ctx.hqm1])
+private theorem alpha_mul_pred_m_eq {alpha m : ℕ} (ctx : BalancedDecomp alpha m) :
+ (alpha: Coeff) * ((m - 1 : ℕ) : Coeff) = (-1 : Coeff) - (alpha : Coeff) := by
+ rw [Nat.cas... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_0f2325696f43_0 | 9abb2842b0f15fa4 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Interop/Hax/Division.lean | Division | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "checkedDivLifted_triple",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold checkedDivLifted\n exact triple_liftRustM _ (checkedDiv_triple x y h)",
"n_chars": 82,
"n_subproofs... | [
{
"name": "checkedDiv_triple",
"text": "/-- `RustM`-level Triple for `checkedDiv`. Under the non-zero precondition\n`y ≠ 0`, the function returns `x.toNat / y.toNat`. Proof is a one-liner:\nunfold `checkedDiv`, drive `mvcgen` with the `Div` instance, and close\nthe single vc by `UInt32.haxDiv_spec`. -/\nthe... | [
{
"name": "checkedDivLifted_triple",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 30,
"n_chars": 1280,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"m... | 1 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Interop.Hax.Bridge
import Interop.Rust.Run
import Hax.rust_primitives.ops
import VCVio.OracleComp.ProbComp
import VCVio.EvalDist.Instances.ErrorT
import VCVio.EvalDist.... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Interop.Hax.Bridge
import Interop.Rust.Run
import Hax.rust_primitives.ops
import VCVio.OracleComp.ProbComp
import VCVio.EvalDist.Instances.ErrorT
import VCVio.EvalDist.... | @@ -64,6 +64,17 @@
@[spec]
def checkedDiv (x y : u32) : RustM u32 := x /? y
+/-- `RustM`-level Triple for `checkedDiv`. Under the non-zero precondition
+`y ≠ 0`, the function returns `x.toNat / y.toNat`. Proof is a one-liner:
+unfold `checkedDiv`, drive `mvcgen` with the `Div` instance, and close
+the single vc 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_0f2325696f43_1 | f44c5ed47edf48ac | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Interop/Hax/Division.lean | Division | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "randomDiv_run_run",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold randomDiv\n simp only [checkedDivLifted_fail_of_zero,\n Interop.Rust.RustOracleComp.run_run_bind_liftM,\n a... | [
{
"name": "checkedDivLifted_fail_of_zero",
"text": "/-- When the divisor is zero, the lifted computation reduces to\n`fail .divisionByZero`, i.e. the rebranded hax error constructor\ncoming out of `errorOfHax`. This is the concrete witness that the\nbridge's error translation preserves the `divisionByZero`\... | [
{
"name": "randomDiv_run_run",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 927,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"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 Interop.Hax.Bridge
import Interop.Rust.Run
import Hax.rust_primitives.ops
import VCVio.OracleComp.ProbComp
import VCVio.EvalDist.Instances.ErrorT
import VCVio.EvalDist.... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Interop.Hax.Bridge
import Interop.Rust.Run
import Hax.rust_primitives.ops
import VCVio.OracleComp.ProbComp
import VCVio.EvalDist.Instances.ErrorT
import VCVio.EvalDist.... | @@ -70,6 +70,31 @@
def checkedDivLifted (x y : u32) : Interop.Rust.RustOracleComp spec u32 :=
liftRustM (checkedDiv x y)
+/-- When the divisor is zero, the lifted computation reduces to
+`fail .divisionByZero`, i.e. the rebranded hax error constructor
+coming out of `errorOfHax`. This is the concrete witness that... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_0f2325696f43_2 | 0a842900a2247458 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | Interop/Hax/Division.lean | Division | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "randomDiv_run_run",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold randomDiv\n simp only [checkedDivLifted_fail_of_zero,\n Interop.Rust.RustOracleComp.run_run_bind_liftM,\n a... | [
{
"name": "checkedDivLifted_fail_of_zero",
"text": "/-- When the divisor is zero, the lifted computation reduces to\n`fail .divisionByZero`, i.e. the rebranded hax error constructor\ncoming out of `errorOfHax`. This is the concrete witness that the\nbridge's error translation preserves the `divisionByZero`\... | [
{
"name": "randomDiv_panic_prob",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 710,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_n... | 2 | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Interop.Hax.Bridge
import Interop.Rust.Run
import Hax.rust_primitives.ops
import VCVio.OracleComp.ProbComp
import VCVio.EvalDist.Instances.ErrorT
import VCVio.EvalDist.... | /-
Copyright (c) 2026 Quang Dao. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao
-/
import Interop.Hax.Bridge
import Interop.Rust.Run
import Hax.rust_primitives.ops
import VCVio.OracleComp.ProbComp
import VCVio.EvalDist.Instances.ErrorT
import VCVio.EvalDist.... | @@ -70,6 +70,31 @@
def checkedDivLifted (x y : u32) : Interop.Rust.RustOracleComp spec u32 :=
liftRustM (checkedDiv x y)
+/-- When the divisor is zero, the lifted computation reduces to
+`fail .divisionByZero`, i.e. the rebranded hax error constructor
+coming out of `errorOfHax`. This is the concrete witness that... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_4c529ee26726_0 | 6644eff5aa322178 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/SeededOracle.lean | SeededOracle | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 4 | [
{
"theorem_name": "isQueryBoundP_run_withPregen",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases hseed : seed t with\n | nil =>\n rw [withPregen_run_nil _ hseed]\n exact (OracleComp.isQueryB... | [
{
"name": "withPregen_run_cons",
"text": "/-- Seed-hit: `withPregen` returns the head of the seed list without invoking `so`. -/\nlemma withPregen_run_cons (so : QueryImpl spec m) {t : spec.Domain}\n {seed : QuerySeed spec} {u : spec.Range t} {us : List (spec.Range t)}\n (h : seed t = u :: us) :\n ... | [
{
"name": "isQueryBoundP_run_withPregen",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 14,
"n_chars": 505,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 1,
"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.OracleComp.Coercions.SubSpec
import VCVio.OracleComp.Constructions.GenerateSeed
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Coercions.SubSpec
import VCVio.OracleComp.Constructions.GenerateSeed
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -49,6 +49,14 @@
| u :: us => pure (u, Function.update seed t us)
| [] => (·, seed) <$> so t := rfl
+/-- Seed-hit: `withPregen` returns the head of the seed list without invoking `so`. -/
+lemma withPregen_run_cons (so : QueryImpl spec m) {t : spec.Domain}
+ {seed : QuerySeed spec} {u : spec.Range ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_4c529ee26726_1 | c12f49cc768bef1f | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/SeededOracle.lean | SeededOracle | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 4 | [
{
"theorem_name": "isQueryBoundP_run_withPregen",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases hseed : seed t with\n | nil =>\n rw [withPregen_run_nil _ hseed]\n exact (OracleComp.isQueryB... | [
{
"name": "withPregen_run_cons",
"text": "/-- Seed-hit: `withPregen` returns the head of the seed list without invoking `so`. -/\nlemma withPregen_run_cons (so : QueryImpl spec m) {t : spec.Domain}\n {seed : QuerySeed spec} {u : spec.Range t} {us : List (spec.Range t)}\n (h : seed t = u :: us) :\n ... | [
{
"name": "isTotalQueryBound_run_withPregen",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 466,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 1,
"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.OracleComp.Coercions.SubSpec
import VCVio.OracleComp.Constructions.GenerateSeed
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Coercions.SubSpec
import VCVio.OracleComp.Constructions.GenerateSeed
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -49,6 +49,14 @@
| u :: us => pure (u, Function.update seed t us)
| [] => (·, seed) <$> so t := rfl
+/-- Seed-hit: `withPregen` returns the head of the seed list without invoking `so`. -/
+lemma withPregen_run_cons (so : QueryImpl spec m) {t : spec.Domain}
+ {seed : QuerySeed spec} {u : spec.Range ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_4c529ee26726_2 | 99f5270b04ef56fd | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/SeededOracle.lean | SeededOracle | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 4 | [
{
"theorem_name": "isQueryBoundP_run_withPregen",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases hseed : seed t with\n | nil =>\n rw [withPregen_run_nil _ hseed]\n exact (OracleComp.isQueryB... | [
{
"name": "withPregen_run_cons",
"text": "/-- Seed-hit: `withPregen` returns the head of the seed list without invoking `so`. -/\nlemma withPregen_run_cons (so : QueryImpl spec m) {t : spec.Domain}\n {seed : QuerySeed spec} {u : spec.Range t} {us : List (spec.Range t)}\n (h : seed t = u :: us) :\n ... | [
{
"name": "isPerIndexQueryBound_run_withPregen",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 488,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": fa... | 2 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.Coercions.SubSpec
import VCVio.OracleComp.Constructions.GenerateSeed
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Coercions.SubSpec
import VCVio.OracleComp.Constructions.GenerateSeed
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -49,6 +49,14 @@
| u :: us => pure (u, Function.update seed t us)
| [] => (·, seed) <$> so t := rfl
+/-- Seed-hit: `withPregen` returns the head of the seed list without invoking `so`. -/
+lemma withPregen_run_cons (so : QueryImpl spec m) {t : spec.Domain}
+ {seed : QuerySeed spec} {u : spec.Range ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_4c529ee26726_3 | e29796332f6ada24 | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/SeededOracle.lean | SeededOracle | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 4 | [
{
"theorem_name": "isQueryBoundP_run_withPregen",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases hseed : seed t with\n | nil =>\n rw [withPregen_run_nil _ hseed]\n exact (OracleComp.isQueryB... | [
{
"name": "withPregen_run_cons",
"text": "/-- Seed-hit: `withPregen` returns the head of the seed list without invoking `so`. -/\nlemma withPregen_run_cons (so : QueryImpl spec m) {t : spec.Domain}\n {seed : QuerySeed spec} {u : spec.Range t} {us : List (spec.Range t)}\n (h : seed t = u :: us) :\n ... | [
{
"name": "IsQueryBoundP.simulateQ_run_withPregen",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 15,
"n_chars": 692,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only":... | 3 | /-
Copyright (c) 2024 Devon Tuma. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Devon Tuma, Quang Dao
-/
import VCVio.OracleComp.Coercions.SubSpec
import VCVio.OracleComp.Constructions.GenerateSeed
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Coercions.SubSpec
import VCVio.OracleComp.Constructions.GenerateSeed
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -49,6 +49,14 @@
| u :: us => pure (u, Function.update seed t us)
| [] => (·, seed) <$> so t := rfl
+/-- Seed-hit: `withPregen` returns the head of the seed list without invoking `so`. -/
+lemma withPregen_run_cons (so : QueryImpl spec m) {t : spec.Domain}
+ {seed : QuerySeed spec} {u : spec.Range ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "24fe01dbaf899b7bb2b19453ae2ada61b49b4255",
"lean_toolchain": "leanprover/lean4:v4.30.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-l... |
ablate_4c529ee26726_4 | e8c509a1e6b9cd1c | lean | lean | github.com/Verified-zkEVM/VCV-io | 24fe01dbaf899b7bb2b19453ae2ada61b49b4255 | VCVio/OracleComp/QueryTracking/SeededOracle.lean | SeededOracle | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 23 | 4 | [
{
"theorem_name": "isQueryBoundP_run_withPregen",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases hseed : seed t with\n | nil =>\n rw [withPregen_run_nil _ hseed]\n exact (OracleComp.isQueryB... | [
{
"name": "withPregen_run_cons",
"text": "/-- Seed-hit: `withPregen` returns the head of the seed list without invoking `so`. -/\nlemma withPregen_run_cons (so : QueryImpl spec m) {t : spec.Domain}\n {seed : QuerySeed spec} {u : spec.Range t} {us : List (spec.Range t)}\n (h : seed t = u :: us) :\n ... | [
{
"name": "run_cons",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 334,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
... | 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.Coercions.SubSpec
import VCVio.OracleComp.Constructions.GenerateSeed
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | /-
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.Coercions.SubSpec
import VCVio.OracleComp.Constructions.GenerateSeed
import VCVio.OracleComp.QueryTracking.QueryBound
import VCVio.OracleCo... | @@ -49,6 +49,14 @@
| u :: us => pure (u, Function.update seed t us)
| [] => (·, seed) <$> so t := rfl
+/-- Seed-hit: `withPregen` returns the head of the seed list without invoking `so`. -/
+lemma withPregen_run_cons (so : QueryImpl spec m) {t : spec.Domain}
+ {seed : QuerySeed spec} {u : spec.Range ... | {
"repo": "VCV-io",
"git_repo": "github.com/Verified-zkEVM/VCV-io",
"revision": "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.