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_b5c3a849beed_1 | 9237d79c3f16e091 | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Clear/JumpLemmas.lean | JumpLemmas | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "isJump_initcall",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n isJump_initcall'.symm ▸ h",
"n_chars": 30,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automatio... | [
{
"name": "isJump_initcall'",
"text": "/--\n Call initialization preserves jumps.\n-/\n@[simp]\nlemma isJump_initcall' : isJump c (initcall params xs s) = isJump c s := by unfold initcall; aesop\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 154,
"n_subproofs": 0,
"n_tactics": 2,
"cycl... | [
{
"name": "isJump_initcall",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 133,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting... | 1 | import Clear.OutOfFuelLemmas
-- TODO(chore): Tag with appropriate aesops, not the general ones.
namespace Clear.JumpLemmas
open Clear Ast Expr Stmt State EVMState PrimOps Interpreter SizeLemmas ExecLemmas OutOfFuelLemmas
section
variable {s s₁ s₂ : State}
{expr rhs cond : Expr}
{args : List Expr}... | import Clear.OutOfFuelLemmas
-- TODO(chore): Tag with appropriate aesops, not the general ones.
namespace Clear.JumpLemmas
open Clear Ast Expr Stmt State EVMState PrimOps Interpreter SizeLemmas ExecLemmas OutOfFuelLemmas
section
variable {s s₁ s₂ : State}
{expr rhs cond : Expr}
{args : List Expr}... | @@ -59,6 +59,12 @@
rw [←ih]
/--
+ Call initialization preserves jumps.
+-/
+@[simp]
+lemma isJump_initcall' : isJump c (initcall params xs s) = isJump c s := by unfold initcall; aesop
+
+/--
Running out of fuel preserves jumps.
-/
@[aesop unsafe 10% apply]
@@ -99,7 +105,8 @@
isJump_multifill'.symm ▸ h
... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_b5c3a849beed_2 | 0bde7229ba983dea | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Clear/JumpLemmas.lean | JumpLemmas | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "evalArgs_Jump_ih",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction args generalizing s with\n | nil => unfold evalArgs; exact h\n | cons x xs ih =>\n unfold evalArgs\n ... | [
{
"name": "evalTail_Jump_ih",
"text": "lemma evalTail_Jump_ih\n {inputs : State × Literal}\n (h : isJump c inputs.1)\n (hsize : sizeOf args < sizeOf expr)\n (ih : ∀ {s : State}, isJump c s → sizeOf args < sizeOf expr → isJump c (evalArgs fuel args s).1) :\n isJump c (evalTail fuel args inputs).1 := by ... | [
{
"name": "evalArgs_Jump_ih",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 479,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 3,
"automation_only": false,
"max_nesti... | 1 | import Clear.OutOfFuelLemmas
-- TODO(chore): Tag with appropriate aesops, not the general ones.
namespace Clear.JumpLemmas
open Clear Ast Expr Stmt State EVMState PrimOps Interpreter SizeLemmas ExecLemmas OutOfFuelLemmas
section
variable {s s₁ s₂ : State}
{expr rhs cond : Expr}
{args : List Expr}... | import Clear.OutOfFuelLemmas
-- TODO(chore): Tag with appropriate aesops, not the general ones.
namespace Clear.JumpLemmas
open Clear Ast Expr Stmt State EVMState PrimOps Interpreter SizeLemmas ExecLemmas OutOfFuelLemmas
section
variable {s s₁ s₂ : State}
{expr rhs cond : Expr}
{args : List Expr}... | @@ -228,6 +228,13 @@
isJump c (List.mapAccumr (eval fuel) args s).1 := by
induction args generalizing s <;> aesop
+lemma evalTail_Jump_ih
+ {inputs : State × Literal}
+ (h : isJump c inputs.1)
+ (hsize : sizeOf args < sizeOf expr)
+ (ih : ∀ {s : State}, isJump c s → sizeOf args < sizeOf expr → isJump c ... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_b5c3a849beed_3 | a7bb8933e34b812c | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Clear/JumpLemmas.lean | JumpLemmas | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "evalCall_Jump",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold evalCall; exact call_Jump h",
"n_chars": 40,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n... | [
{
"name": "call_Jump",
"text": "/--\n The `call` helper function for user-defined function calls preserves jumps.\n-/\n@[aesop unsafe 10% apply]\nlemma call_Jump (h : isJump c s) : isJump c (call fuel xs fdef s).1 := by unfold call; aesop\n\n",
"fan_in": 2,
"n_lines": 7,
"n_chars": 205,
"n_... | [
{
"name": "evalCall_Jump",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 279,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 1 | import Clear.OutOfFuelLemmas
-- TODO(chore): Tag with appropriate aesops, not the general ones.
namespace Clear.JumpLemmas
open Clear Ast Expr Stmt State EVMState PrimOps Interpreter SizeLemmas ExecLemmas OutOfFuelLemmas
section
variable {s s₁ s₂ : State}
{expr rhs cond : Expr}
{args : List Expr}... | import Clear.OutOfFuelLemmas
-- TODO(chore): Tag with appropriate aesops, not the general ones.
namespace Clear.JumpLemmas
open Clear Ast Expr Stmt State EVMState PrimOps Interpreter SizeLemmas ExecLemmas OutOfFuelLemmas
section
variable {s s₁ s₂ : State}
{expr rhs cond : Expr}
{args : List Expr}... | @@ -249,18 +249,26 @@
linarith
/--
+ The `call` helper function for user-defined function calls preserves jumps.
+-/
+@[aesop unsafe 10% apply]
+lemma call_Jump (h : isJump c s) : isJump c (call fuel xs fdef s).1 := by unfold call; aesop
+
+/--
The `evalCall` helper function for user-defined function call... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_b5c3a849beed_5 | a38a631e5bdc6ed5 | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Clear/JumpLemmas.lean | JumpLemmas | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 4 | [
{
"theorem_name": "execPrimCall_evalArgs_Jump_ih",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply execPrimCall_Jump (evalArgs_Jump_ih _ _ _) <;> aesop",
"n_chars": 64,
"n_subproofs": 0,
"n_... | [
{
"name": "execPrimCall_Jump",
"text": "/--\n An `execPrimCall` preserves error states.\n-/\n@[aesop unsafe 10% apply]\nlemma execPrimCall_Jump\n (h : isJump c s) : isJump c (primCall s prim xs).1 := by\n -- Performance issues, need to break some abstraction by creating\n -- 'equivalence classes' on fun... | [
{
"name": "execPrimCall_evalArgs_Jump_ih",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 384,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 3 | import Clear.OutOfFuelLemmas
-- TODO(chore): Tag with appropriate aesops, not the general ones.
namespace Clear.JumpLemmas
open Clear Ast Expr Stmt State EVMState PrimOps Interpreter SizeLemmas ExecLemmas OutOfFuelLemmas
section
variable {s s₁ s₂ : State}
{expr rhs cond : Expr}
{args : List Expr}... | import Clear.OutOfFuelLemmas
-- TODO(chore): Tag with appropriate aesops, not the general ones.
namespace Clear.JumpLemmas
open Clear Ast Expr Stmt State EVMState PrimOps Interpreter SizeLemmas ExecLemmas OutOfFuelLemmas
section
variable {s s₁ s₂ : State}
{expr rhs cond : Expr}
{args : List Expr}... | @@ -201,6 +201,17 @@
-- ============================================================================
/--
+ An `execPrimCall` preserves error states.
+-/
+@[aesop unsafe 10% apply]
+lemma execPrimCall_Jump
+ (h : isJump c s) : isJump c (primCall s prim xs).1 := by
+ -- Performance issues, need to break some abstr... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_23828e7bc30e_0 | 696c464d85d7664b | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Generated/peano/Peano/Common/for_727972558926940900_user.lean | for_727972558926940900_user | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "fin_eq_lem",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have : 1 ≤ a := by rcases a with ⟨_ | a, ha⟩ <;> [simp at h; (simp [Fin.le_iff_val_le_val])]\n rw [coe_sub] <;> simp_all",
... | [
{
"name": "coe_sub",
"text": "lemma coe_sub {a b : UInt256} (h : a ≤ b) : (((b - a) : UInt256) : ℕ) = b.val - a.val :=\n Fin.coe_sub_iff_le.mpr h\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 121,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrite... | [
{
"name": "fin_eq_lem",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 207,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 4,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
... | 1 | import Clear.ReasoningPrinciple
import Generated.peano.Peano.Common.if_6183625948864629624
import Generated.peano.Peano.mulk
import Generated.peano.Peano.Common.for_727972558926940900_gen
namespace Peano.Common
set_option autoImplicit false
section
open Clear EVMState Ast Expr Stmt FunctionDefinition State Interp... | import Clear.ReasoningPrinciple
import Generated.peano.Peano.Common.if_6183625948864629624
import Generated.peano.Peano.mulk
import Generated.peano.Peano.Common.for_727972558926940900_gen
namespace Peano.Common
set_option autoImplicit false
section
open Clear EVMState Ast Expr Stmt FunctionDefinition State Interp... | @@ -30,8 +30,13 @@
unfold for_727972558926940900_body_concrete_of_code ABody_for_727972558926940900 A_if_6183625948864629624 A_mulk
apply spec_eq; simp; aesop_spec
-lemma fin_eq_lem {a : UInt256} (h : a ≠ 0) : (a - 1).val = a.val - 1 := sorry
+lemma coe_sub {a b : UInt256} (h : a ≤ b) : (((b - a) : UInt256) : ℕ... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_23828e7bc30e_1 | e9374deb1fb31ee0 | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Generated/peano/Peano/Common/for_727972558926940900_user.lean | for_727972558926940900_user | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "fin_eq_lem",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have : 1 ≤ a := by rcases a with ⟨_ | a, ha⟩ <;> [simp at h; (simp [Fin.le_iff_val_le_val])]\n rw [coe_sub] <;> simp_all",
... | [
{
"name": "coe_sub",
"text": "lemma coe_sub {a b : UInt256} (h : a ≤ b) : (((b - a) : UInt256) : ℕ) = b.val - a.val :=\n Fin.coe_sub_iff_le.mpr h\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 121,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrite... | [
{
"name": "AOk_for_727972558926940900",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 1000,
"n_subproofs": 2,
"n_tactics": 26,
"cyclomatic": 6,
"n_automation": 7,
"n_rewrites": 4,
"n_structural": 2,
"automation_only": false,
... | 2 | import Clear.ReasoningPrinciple
import Generated.peano.Peano.Common.if_6183625948864629624
import Generated.peano.Peano.mulk
import Generated.peano.Peano.Common.for_727972558926940900_gen
namespace Peano.Common
set_option autoImplicit false
section
open Clear EVMState Ast Expr Stmt FunctionDefinition State Interp... | import Clear.ReasoningPrinciple
import Generated.peano.Peano.Common.if_6183625948864629624
import Generated.peano.Peano.mulk
import Generated.peano.Peano.Common.for_727972558926940900_gen
namespace Peano.Common
set_option autoImplicit false
section
open Clear EVMState Ast Expr Stmt FunctionDefinition State Interp... | @@ -30,8 +30,13 @@
unfold for_727972558926940900_body_concrete_of_code ABody_for_727972558926940900 A_if_6183625948864629624 A_mulk
apply spec_eq; simp; aesop_spec
-lemma fin_eq_lem {a : UInt256} (h : a ≠ 0) : (a - 1).val = a.val - 1 := sorry
+lemma coe_sub {a b : UInt256} (h : a ≤ b) : (((b - a) : UInt256) : ℕ... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_06e6d29a2d74_0 | 55b928fcb4b30044 | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Clear/State.lean | State | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "isOk_multifill",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold multifill\n rcases s <;> simp at *\n generalize hpairs : List.zip vars args = xs\n induction xs generalizing vars... | [
{
"name": "Prod.zip_map",
"text": "lemma Prod.zip_map {α β : Type} {ys : List (α × β)} : List.zip (List.map Prod.fst ys) (List.map Prod.snd ys) = ys\n:= by\n induction ys with\n | nil => simp\n | cons z zs ih =>\n simp\n apply ih\n\n",
"fan_in": 2,
"n_lines": 9,
"n_chars": 212,
... | [
{
"name": "isOk_multifill",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 374,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 4,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 3,
"automation_only": false,
"max_nestin... | 1 | import Clear.Ast
import Clear.EVMState
import Clear.Wheels
namespace Clear
open Ast
-- | A mapping from variable names to literals (`UInt256`s).
abbrev VarStore := Finmap (λ _ : Identifier ↦ Literal)
-- | A jump in control flow containing a checkpoint of the state at jump-time.
inductive Jump where
| Continue : EVM... | import Clear.Ast
import Clear.EVMState
import Clear.Wheels
namespace Clear
open Ast
-- | A mapping from variable names to literals (`UInt256`s).
abbrev VarStore := Finmap (λ _ : Identifier ↦ Literal)
-- | A jump in control flow containing a checkpoint of the state at jump-time.
inductive Jump where
| Continue : EVM... | @@ -283,6 +283,14 @@
@[aesop unsafe 10% apply]
lemma isOk_mkOk_of_isOk (h : isOk s) : isOk (mkOk s) := by unfold mkOk; aesop
+lemma Prod.zip_map {α β : Type} {ys : List (α × β)} : List.zip (List.map Prod.fst ys) (List.map Prod.snd ys) = ys
+:= by
+ induction ys with
+ | nil => simp
+ | cons z zs ih =>
+ ... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_06e6d29a2d74_1 | 513ec7cec8d0b091 | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Clear/State.lean | State | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "mkOk_initcall_Ok",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have : isOk (initcall vars args (Ok evm store)) := by apply isOk_initcall_of_isOk; simp\n have ⟨evm, store, hh⟩ := State_... | [
{
"name": "State_of_isOk",
"text": "lemma State_of_isOk (h : isOk s) : ∃ evm store, s = Ok evm store\n:= by\n unfold isOk at h\n rcases s <;> simp at *\n\n-- | We can unpack an infinite loop state.\n",
"fan_in": 2,
"n_lines": 7,
"n_chars": 161,
"n_subproofs": 0,
"n_tactics": 4,
"cy... | [
{
"name": "mkOk_initcall_Ok",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 288,
"n_subproofs": 2,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 1 | import Clear.Ast
import Clear.EVMState
import Clear.Wheels
namespace Clear
open Ast
-- | A mapping from variable names to literals (`UInt256`s).
abbrev VarStore := Finmap (λ _ : Identifier ↦ Literal)
-- | A jump in control flow containing a checkpoint of the state at jump-time.
inductive Jump where
| Continue : EVM... | import Clear.Ast
import Clear.EVMState
import Clear.Wheels
namespace Clear
open Ast
-- | A mapping from variable names to literals (`UInt256`s).
abbrev VarStore := Finmap (λ _ : Identifier ↦ Literal)
-- | A jump in control flow containing a checkpoint of the state at jump-time.
inductive Jump where
| Continue : EVM... | @@ -268,6 +268,12 @@
-- | If a state is Ok, we can write it as `Ok _ _`.
-- @[aesop norm 0 simp (rule_sets := [Clear.aesop_spec])]
+lemma State_of_isOk (h : isOk s) : ∃ evm store, s = Ok evm store
+:= by
+ unfold isOk at h
+ rcases s <;> simp at *
+
+-- | We can unpack an infinite loop state.
@[simp]
lemma isOk... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_7c868c99abfb_0 | 78766837cc2b8ced | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Generated/peano/Peano/Common/for_84821961910748561.lean | for_84821961910748561 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "for_84821961910748561_abs_of_code",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intros s₉\n intros hcode\n apply reasoning_principle_3 for_84821961910748561_cond for_84821961910748561... | [
{
"name": "for_84821961910748561_body_abs_of_code",
"text": "lemma for_84821961910748561_body_abs_of_code {s₀ : State} {fuel : Nat} :\n ∀ s₉, exec fuel (Block for_84821961910748561_body) s₀ = s₉ →\n Spec ABody_for_84821961910748561 s₀ s₉ :=\n λ _ h ↦ for_84821961910748561_concrete_of_body_abs (fo... | [
{
"name": "for_84821961910748561_abs_of_code",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 6,
"n_chars": 682,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false... | 2 | import Clear.ReasoningPrinciple
import Generated.peano.Peano.Common.if_6183625948864629624
import Generated.peano.Peano.Common.for_84821961910748561_gen
import Generated.peano.Peano.Common.for_84821961910748561_user
namespace Peano.Common
set_option autoImplicit false
section
open Clear EVMState Ast Expr Stmt Fu... | import Clear.ReasoningPrinciple
import Generated.peano.Peano.Common.if_6183625948864629624
import Generated.peano.Peano.Common.for_84821961910748561_gen
import Generated.peano.Peano.Common.for_84821961910748561_user
namespace Peano.Common
set_option autoImplicit false
section
open Clear EVMState Ast Expr Stmt Fu... | @@ -19,8 +19,17 @@
Spec APost_for_84821961910748561 s₀ s₉ :=
λ _ h ↦ for_84821961910748561_concrete_of_post_abs (for_84821961910748561_post_concrete_of_code.2 h)
-lemma for_84821961910748561_abs_of_code {s₀ fuel} : ∀ s₉, exec fuel for_84821961910748561 s₀ = s₉ → Spec AFor_for_84821961910748561 s₀ s₉ := ... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_d008bc273e9a_0 | 30c6783647bb359e | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Clear/ReasoningPrinciple.lean | ReasoningPrinciple | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "reasoning_principle_3",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intros hcode\n apply @reasoning_principle_2 _ _ fuel ACond APost ABody AFor AZero AOk AContinue ABreak ALeave\n app... | [
{
"name": "reasoning_principle_1",
"text": "lemma reasoning_principle_1\n (cond : Expr)\n (post : List Stmt)\n (body : List Stmt)\n (ACond : State → Literal)\n (APost : State → State → Prop)\n (ABody : State → State → Prop)\n -- TODO: This will need to change to handle function calls, but one thing a... | [
{
"name": "reasoning_principle_3",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 25,
"n_chars": 1672,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max... | 1 | import Mathlib.Tactic
import Clear.Abstraction
import Clear.Utilities
open Clear Ast Expr Stmt State Interpreter ExecLemmas OutOfFuelLemmas JumpLemmas Abstraction PrimOps
namespace Clear.ReasoningPrinciple
variable {s₀ s₉ : State}
{fuel : ℕ}
-- | "Concrete" spec of a loop.
--
-- This recursive predicate is a... | import Mathlib.Tactic
import Clear.Abstraction
import Clear.Utilities
open Clear Ast Expr Stmt State Interpreter ExecLemmas OutOfFuelLemmas JumpLemmas Abstraction PrimOps
namespace Clear.ReasoningPrinciple
variable {s₀ s₉ : State}
{fuel : ℕ}
-- | "Concrete" spec of a loop.
--
-- This recursive predicate is a... | @@ -34,6 +34,38 @@
) = s₉
-- | Proof that the code of a `For` loop entails `C`, our recursive predicate for loops.
+lemma reasoning_principle_1
+ (cond : Expr)
+ (post : List Stmt)
+ (body : List Stmt)
+ (ACond : State → Literal)
+ (APost : State → State → Prop)
+ (ABody : State → State → Prop)
+ -- ... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_a48de81266df_0 | adb0af8007a2e3dd | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Clear/UInt256.lean | UInt256 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "fromBytes'_UInt256_le",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h' := @fromBytes'_le bs\n rw [h] at h'\n exact h'",
"n_chars": 66,
"n_subproofs": 1,
"n_tact... | [
{
"name": "fromBytes'_le",
"text": "private lemma fromBytes'_le : fromBytes' bs < 2^(8 * bs.length) := by\n induction bs with\n | nil => unfold fromBytes'; simp\n | cons b bs ih =>\n unfold fromBytes'\n have h := b.val.isLt\n simp only [List.length_cons, Nat.mul_succ, Nat.add_comm, Nat.pow_add]\... | [
{
"name": "fromBytes'_UInt256_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 203,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_n... | 1 | import Init.Data.Nat.Div
import Mathlib.Data.Nat.Defs
import Mathlib.Data.Fin.Basic
import Mathlib.Data.Vector.Basic
import Mathlib.Algebra.Group.Defs
import Mathlib.Algebra.GroupWithZero.Defs
import Mathlib.Algebra.Ring.Basic
import Mathlib.Algebra.Order.Floor
import Mathlib.Data.ZMod.Defs
import Mathlib.Tactic
-- 2^... | import Init.Data.Nat.Div
import Mathlib.Data.Nat.Defs
import Mathlib.Data.Fin.Basic
import Mathlib.Data.Vector.Basic
import Mathlib.Algebra.Group.Defs
import Mathlib.Algebra.GroupWithZero.Defs
import Mathlib.Algebra.Ring.Basic
import Mathlib.Algebra.Order.Floor
import Mathlib.Data.ZMod.Defs
import Mathlib.Tactic
-- 2^... | @@ -126,8 +126,25 @@
{n : ℕ}
-- | A bound for the natural number value of a list of bytes.
-private lemma fromBytes'_UInt256_le (h : bs.length = 32) : fromBytes' bs < 2^256 := sorry
+private lemma fromBytes'_le : fromBytes' bs < 2^(8 * bs.length) := by
+ induction bs with
+ | nil => unfold fromBytes'; si... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_a48de81266df_1 | 2efe722ce0b88307 | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Clear/UInt256.lean | UInt256 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "toBytes'_UInt256_le",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " toBytes'_le h",
"n_chars": 14,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
... | [
{
"name": "toBytes'_le",
"text": "private lemma toBytes'_le {k : ℕ} (h : n < 2 ^ (8 * k)) : (toBytes' n).length ≤ k := by\n induction k generalizing n with\n | zero =>\n simp at h\n rw [h]\n simp [toBytes']\n | succ e ih =>\n match n with\n | .zero => simp [toBytes']\n | .succ n =>\n ... | [
{
"name": "toBytes'_UInt256_le",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 4,
"n_chars": 185,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nes... | 1 | import Init.Data.Nat.Div
import Mathlib.Data.Nat.Defs
import Mathlib.Data.Fin.Basic
import Mathlib.Data.Vector.Basic
import Mathlib.Algebra.Group.Defs
import Mathlib.Algebra.GroupWithZero.Defs
import Mathlib.Algebra.Ring.Basic
import Mathlib.Algebra.Order.Floor
import Mathlib.Data.ZMod.Defs
import Mathlib.Tactic
-- 2^... | import Init.Data.Nat.Div
import Mathlib.Data.Nat.Defs
import Mathlib.Data.Fin.Basic
import Mathlib.Data.Vector.Basic
import Mathlib.Algebra.Group.Defs
import Mathlib.Algebra.GroupWithZero.Defs
import Mathlib.Algebra.Ring.Basic
import Mathlib.Algebra.Order.Floor
import Mathlib.Data.ZMod.Defs
import Mathlib.Tactic
-- 2^... | @@ -151,8 +151,25 @@
byte :: toBytes' (n / UInt8.size)
-- | If n < 2⁸ᵏ, then (toBytes' n).length ≤ k.
-private lemma toBytes'_UInt256_le (h : n < UInt256.size) : (toBytes' n).length ≤ 32 := sorry
+private lemma toBytes'_le {k : ℕ} (h : n < 2 ^ (8 * k)) : (toBytes' n).length ≤ k := by
+ induction k generalizing... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_a48de81266df_2 | 617c4279f392009c | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Clear/UInt256.lean | UInt256 | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "fromBytes'_UInt256_le",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h' := @fromBytes'_le bs\n rw [h] at h'\n exact h'",
"n_chars": 66,
"n_subproofs": 1,
"n_tact... | [
{
"name": "fromBytes'_le",
"text": "private lemma fromBytes'_le : fromBytes' bs < 2^(8 * bs.length) := by\n induction bs with\n | nil => unfold fromBytes'; simp\n | cons b bs ih =>\n unfold fromBytes'\n have h := b.val.isLt\n simp only [List.length_cons, Nat.mul_succ, Nat.add_comm, Nat.pow_add]\... | [
{
"name": "fromBytes_was_good_all_year_long",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 303,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,... | 1 | import Init.Data.Nat.Div
import Mathlib.Data.Nat.Defs
import Mathlib.Data.Fin.Basic
import Mathlib.Data.Vector.Basic
import Mathlib.Algebra.Group.Defs
import Mathlib.Algebra.GroupWithZero.Defs
import Mathlib.Algebra.Ring.Basic
import Mathlib.Algebra.Order.Floor
import Mathlib.Data.ZMod.Defs
import Mathlib.Tactic
-- 2^... | import Init.Data.Nat.Div
import Mathlib.Data.Nat.Defs
import Mathlib.Data.Fin.Basic
import Mathlib.Data.Vector.Basic
import Mathlib.Algebra.Group.Defs
import Mathlib.Algebra.GroupWithZero.Defs
import Mathlib.Algebra.Ring.Basic
import Mathlib.Algebra.Order.Floor
import Mathlib.Data.ZMod.Defs
import Mathlib.Tactic
-- 2^... | @@ -126,6 +126,20 @@
{n : ℕ}
-- | A bound for the natural number value of a list of bytes.
+private lemma fromBytes'_le : fromBytes' bs < 2^(8 * bs.length) := by
+ induction bs with
+ | nil => unfold fromBytes'; simp
+ | cons b bs ih =>
+ unfold fromBytes'
+ have h := b.val.isLt
+ simp only [Li... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_a48de81266df_3 | 36600d90e92ab6ac | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Clear/UInt256.lean | UInt256 | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "UInt256_pow_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [UInt256_pow_def, UInt256_pow_def]\n have : (↑(b + 1) : ℕ) = (b + 1 : ℕ) := by rw [Fin.val_add, Nat.mod_eq_of_lt (by n... | [
{
"name": "UInt256_pow_def",
"text": "lemma UInt256_pow_def {a b : UInt256} : a ^ b = a ^ b.val := by\n rfl\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 71,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"auto... | [
{
"name": "UInt256_pow_succ",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 267,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 0,
"automation_only": false,
"max_nestin... | 1 | import Init.Data.Nat.Div
import Mathlib.Data.Nat.Defs
import Mathlib.Data.Fin.Basic
import Mathlib.Data.Vector.Basic
import Mathlib.Algebra.Group.Defs
import Mathlib.Algebra.GroupWithZero.Defs
import Mathlib.Algebra.Ring.Basic
import Mathlib.Algebra.Order.Floor
import Mathlib.Data.ZMod.Defs
import Mathlib.Tactic
-- 2^... | import Init.Data.Nat.Div
import Mathlib.Data.Nat.Defs
import Mathlib.Data.Fin.Basic
import Mathlib.Data.Vector.Basic
import Mathlib.Algebra.Group.Defs
import Mathlib.Algebra.GroupWithZero.Defs
import Mathlib.Algebra.Ring.Basic
import Mathlib.Algebra.Order.Floor
import Mathlib.Data.ZMod.Defs
import Mathlib.Tactic
-- 2^... | @@ -229,7 +229,14 @@
@[simp]
lemma length_toBytes! {n : UInt256} : (toBytes! n).length = 32 := zeroPadBytes_len (toBytes'_UInt256_le n.2)
-lemma UInt256_pow_succ {a b : UInt256} (h : b.val + 1 < UInt256.size) : a * a ^ b = a ^ (b + 1) := sorry
+lemma UInt256_pow_def {a b : UInt256} : a ^ b = a ^ b.val := by
+ rfl
... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_440bbd56ff40_0 | 07212ef9daab5463 | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Clear/OutOfFuelLemmas.lean | OutOfFuelLemmas | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 38 | 1 | [
{
"theorem_name": "isOutOfFuel_reviveJump",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [isOutOfFuel_reviveJump']\n exact h",
"n_chars": 44,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomat... | [
{
"name": "isOutOfFuel_reviveJump'",
"text": "/--\n Reviving an old checkpoint (saved jump state) preserves infinite loops.\n-/\n@[simp]\nlemma isOutOfFuel_reviveJump' : isOutOfFuel (reviveJump s) = isOutOfFuel s := by\n unfold reviveJump revive; aesop\n\n",
"fan_in": 1,
"n_lines": 8,
"n_chars... | [
{
"name": "isOutOfFuel_reviveJump",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 152,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_... | 1 | import Clear.ExecLemmas
import Clear.SizeLemmas
@[simp]
lemma List.mapAccumr_nil {α β σ : Type} {f : α → σ → σ × β} {s : σ} :
List.mapAccumr f [] s = (s, []) := by
conv_lhs => unfold List.mapAccumr
@[simp]
lemma List.mapAccumr_cons {α β σ : Type} {f : α → σ → σ × β} {x : α} {xs : List α} {s : σ} :
List.mapAccum... | import Clear.ExecLemmas
import Clear.SizeLemmas
@[simp]
lemma List.mapAccumr_nil {α β σ : Type} {f : α → σ → σ × β} {s : σ} :
List.mapAccumr f [] s = (s, []) := by
conv_lhs => unfold List.mapAccumr
@[simp]
lemma List.mapAccumr_cons {α β σ : Type} {f : α → σ → σ × β} {x : α} {xs : List α} {s : σ} :
List.mapAccum... | @@ -66,6 +66,13 @@
unfold setEvm isOutOfFuel; aesop
/--
+ Reviving an old checkpoint (saved jump state) preserves infinite loops.
+-/
+@[simp]
+lemma isOutOfFuel_reviveJump' : isOutOfFuel (reviveJump s) = isOutOfFuel s := by
+ unfold reviveJump revive; aesop
+
+/--
Continues preserves infinite loops.
-/
@[... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_440bbd56ff40_2 | a5c2dbeef18470b1 | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Clear/OutOfFuelLemmas.lean | OutOfFuelLemmas | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 38 | 1 | [
{
"theorem_name": "isOutOfFuel_initcall",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [isOutOfFuel_initcall']; assumption",
"n_chars": 44,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic"... | [
{
"name": "isOutOfFuel_initcall'",
"text": "/--\n Call initialization preserves infinite loops.\n-/\n@[simp]\nlemma isOutOfFuel_initcall' : isOutOfFuel (initcall params xs s) = isOutOfFuel s := by\n unfold initcall; aesop\n\n",
"fan_in": 1,
"n_lines": 8,
"n_chars": 176,
"n_subproofs": 0,
... | [
{
"name": "isOutOfFuel_initcall",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 332,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_ne... | 1 | import Clear.ExecLemmas
import Clear.SizeLemmas
@[simp]
lemma List.mapAccumr_nil {α β σ : Type} {f : α → σ → σ × β} {s : σ} :
List.mapAccumr f [] s = (s, []) := by
conv_lhs => unfold List.mapAccumr
@[simp]
lemma List.mapAccumr_cons {α β σ : Type} {f : α → σ → σ × β} {x : α} {xs : List α} {s : σ} :
List.mapAccum... | import Clear.ExecLemmas
import Clear.SizeLemmas
@[simp]
lemma List.mapAccumr_nil {α β σ : Type} {f : α → σ → σ × β} {s : σ} :
List.mapAccumr f [] s = (s, []) := by
conv_lhs => unfold List.mapAccumr
@[simp]
lemma List.mapAccumr_cons {α β σ : Type} {f : α → σ → σ × β} {x : α} {xs : List α} {s : σ} :
List.mapAccum... | @@ -117,6 +117,13 @@
induction List.zip vars vals <;> aesop
/--
+ Call initialization preserves infinite loops.
+-/
+@[simp]
+lemma isOutOfFuel_initcall' : isOutOfFuel (initcall params xs s) = isOutOfFuel s := by
+ unfold initcall; aesop
+
+/--
Running out of fuel preserves infinite loops.
-/
@[aesop unsaf... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_440bbd56ff40_3 | 1a1097191548a096 | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Clear/OutOfFuelLemmas.lean | OutOfFuelLemmas | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 38 | 1 | [
{
"theorem_name": "execPrimCall_Inf",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Performance issues, need to break some abstraction by creating\n -- 'equivalence classes' on function arity, among ot... | [
{
"name": "isOutOfFuel_execPrimCall1",
"text": "lemma isOutOfFuel_execPrimCall1 (h : isOutOfFuel s) : isOutOfFuel (primCall s prim [x]).1 := by\n unfold primCall\n cases prim <;> aesop\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 138,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": ... | [
{
"name": "execPrimCall_Inf",
"fan_in": 4,
"n_deps_direct": 9,
"n_deps_transitive": 9,
"n_lines": 19,
"n_chars": 781,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 10,
"automation_only": false,
"max_nes... | 9 | import Clear.ExecLemmas
import Clear.SizeLemmas
@[simp]
lemma List.mapAccumr_nil {α β σ : Type} {f : α → σ → σ × β} {s : σ} :
List.mapAccumr f [] s = (s, []) := by
conv_lhs => unfold List.mapAccumr
@[simp]
lemma List.mapAccumr_cons {α β σ : Type} {f : α → σ → σ × β} {x : α} {xs : List α} {s : σ} :
List.mapAccum... | import Clear.ExecLemmas
import Clear.SizeLemmas
@[simp]
lemma List.mapAccumr_nil {α β σ : Type} {f : α → σ → σ × β} {s : σ} :
List.mapAccumr f [] s = (s, []) := by
conv_lhs => unfold List.mapAccumr
@[simp]
lemma List.mapAccumr_cons {α β σ : Type} {f : α → σ → σ × β} {x : α} {xs : List α} {s : σ} :
List.mapAccum... | @@ -210,6 +210,10 @@
unfold primCall
cases prim <;> aesop
+lemma isOutOfFuel_execPrimCall1 (h : isOutOfFuel s) : isOutOfFuel (primCall s prim [x]).1 := by
+ unfold primCall
+ cases prim <;> aesop
+
lemma isOutOfFuel_execPrimCall2 (h : isOutOfFuel s) : isOutOfFuel (primCall s prim [x, y]).1 := by
unfold pr... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_440bbd56ff40_4 | 2d6ff53b879fefe1 | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Clear/OutOfFuelLemmas.lean | OutOfFuelLemmas | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 38 | 2 | [
{
"theorem_name": "evalCall_Inf",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold evalCall\n exact call_Inf h",
"n_chars": 40,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n... | [
{
"name": "call_Inf",
"text": "/--\n The `call` helper function for user-defined function calls preserves infinite loops.\n-/\n@[aesop unsafe 10% apply]\nlemma call_Inf (h : isOutOfFuel s) : isOutOfFuel (call fuel xs fdef s).1 := by\n unfold call\n apply isOutOfFuel_setStore\n apply isOutOfFuel_overwrit... | [
{
"name": "evalCall_Inf",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 10,
"n_chars": 293,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 1 | import Clear.ExecLemmas
import Clear.SizeLemmas
@[simp]
lemma List.mapAccumr_nil {α β σ : Type} {f : α → σ → σ × β} {s : σ} :
List.mapAccumr f [] s = (s, []) := by
conv_lhs => unfold List.mapAccumr
@[simp]
lemma List.mapAccumr_cons {α β σ : Type} {f : α → σ → σ × β} {x : α} {xs : List α} {s : σ} :
List.mapAccum... | import Clear.ExecLemmas
import Clear.SizeLemmas
@[simp]
lemma List.mapAccumr_nil {α β σ : Type} {f : α → σ → σ × β} {s : σ} :
List.mapAccumr f [] s = (s, []) := by
conv_lhs => unfold List.mapAccumr
@[simp]
lemma List.mapAccumr_cons {α β σ : Type} {f : α → σ → σ × β} {x : α} {xs : List α} {s : σ} :
List.mapAccum... | @@ -281,18 +281,32 @@
aesop
/--
+ The `call` helper function for user-defined function calls preserves infinite loops.
+-/
+@[aesop unsafe 10% apply]
+lemma call_Inf (h : isOutOfFuel s) : isOutOfFuel (call fuel xs fdef s).1 := by
+ unfold call
+ apply isOutOfFuel_setStore
+ apply isOutOfFuel_overwrite?
+ ... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_440bbd56ff40_5 | 9125290604591c79 | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Clear/OutOfFuelLemmas.lean | OutOfFuelLemmas | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 38 | 1 | [
{
"theorem_name": "execPrimCall_Inf",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Performance issues, need to break some abstraction by creating\n -- 'equivalence classes' on function arity, among ot... | [
{
"name": "isOutOfFuel_execPrimCall2",
"text": "lemma isOutOfFuel_execPrimCall2 (h : isOutOfFuel s) : isOutOfFuel (primCall s prim [x, y]).1 := by\n unfold primCall\n cases prim <;> aesop\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 141,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic... | [
{
"name": "execPrimCall_evalArgs_Inf_ih",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 11,
"n_lines": 8,
"n_chars": 370,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 11 | import Clear.ExecLemmas
import Clear.SizeLemmas
@[simp]
lemma List.mapAccumr_nil {α β σ : Type} {f : α → σ → σ × β} {s : σ} :
List.mapAccumr f [] s = (s, []) := by
conv_lhs => unfold List.mapAccumr
@[simp]
lemma List.mapAccumr_cons {α β σ : Type} {f : α → σ → σ × β} {x : α} {xs : List α} {s : σ} :
List.mapAccum... | import Clear.ExecLemmas
import Clear.SizeLemmas
@[simp]
lemma List.mapAccumr_nil {α β σ : Type} {f : α → σ → σ × β} {s : σ} :
List.mapAccumr f [] s = (s, []) := by
conv_lhs => unfold List.mapAccumr
@[simp]
lemma List.mapAccumr_cons {α β σ : Type} {f : α → σ → σ × β} {x : α} {xs : List α} {s : σ} :
List.mapAccum... | @@ -214,6 +214,10 @@
unfold primCall
cases prim <;> aesop
+lemma isOutOfFuel_execPrimCall2 (h : isOutOfFuel s) : isOutOfFuel (primCall s prim [x, y]).1 := by
+ unfold primCall
+ cases prim <;> aesop
+
lemma isOutOfFuel_execPrimCall3 (h : isOutOfFuel s) : isOutOfFuel (primCall s prim [x, y, z]).1 := by
unf... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_440bbd56ff40_6 | cf4969470b4ace05 | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Clear/OutOfFuelLemmas.lean | OutOfFuelLemmas | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 38 | 1 | [
{
"theorem_name": "evalTail_Inf_ih'",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold evalTail\n apply cons'_Inf\n apply ih h",
"n_chars": 52,
"n_subproofs": 0,
"n_tactics": 4,
"cyclo... | [
{
"name": "cons'_Inf",
"text": "lemma cons'_Inf {inputs : State × List Literal}\n (h : isOutOfFuel inputs.1) : isOutOfFuel (cons' x inputs).1 := by aesop\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 124,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n... | [
{
"name": "evalTail_Inf_ih'",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 263,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nesti... | 1 | import Clear.ExecLemmas
import Clear.SizeLemmas
@[simp]
lemma List.mapAccumr_nil {α β σ : Type} {f : α → σ → σ × β} {s : σ} :
List.mapAccumr f [] s = (s, []) := by
conv_lhs => unfold List.mapAccumr
@[simp]
lemma List.mapAccumr_cons {α β σ : Type} {f : α → σ → σ × β} {x : α} {xs : List α} {s : σ} :
List.mapAccum... | import Clear.ExecLemmas
import Clear.SizeLemmas
@[simp]
lemma List.mapAccumr_nil {α β σ : Type} {f : α → σ → σ × β} {s : σ} :
List.mapAccumr f [] s = (s, []) := by
conv_lhs => unfold List.mapAccumr
@[simp]
lemma List.mapAccumr_cons {α β σ : Type} {f : α → σ → σ × β} {x : α} {xs : List α} {s : σ} :
List.mapAccum... | @@ -264,6 +264,9 @@
· exact isOutOfFuel_execPrimCall7 h
· exact isOutOfFuel_execPrimCall8 h
+lemma cons'_Inf {inputs : State × List Literal}
+ (h : isOutOfFuel inputs.1) : isOutOfFuel (cons' x inputs).1 := by aesop
+
lemma evalArgs_Inf_ih
(h : isOutOfFuel s)
(hsize : sizeOf args < sizeOf expr)
@@ -371,7... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_440bbd56ff40_7 | 6435e1d0534addbb | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Clear/OutOfFuelLemmas.lean | OutOfFuelLemmas | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 38 | 1 | [
{
"theorem_name": "execPrimCall_Inf",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Performance issues, need to break some abstraction by creating\n -- 'equivalence classes' on function arity, among ot... | [
{
"name": "isOutOfFuel_execPrimCall3",
"text": "lemma isOutOfFuel_execPrimCall3 (h : isOutOfFuel s) : isOutOfFuel (primCall s prim [x, y, z]).1 := by\n unfold primCall\n cases prim <;> aesop\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 144,
"n_subproofs": 0,
"n_tactics": 4,
"cycloma... | [
{
"name": "Call_Inf",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 25,
"n_lines": 10,
"n_chars": 223,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nesting": 2
... | 21 | import Clear.ExecLemmas
import Clear.SizeLemmas
@[simp]
lemma List.mapAccumr_nil {α β σ : Type} {f : α → σ → σ × β} {s : σ} :
List.mapAccumr f [] s = (s, []) := by
conv_lhs => unfold List.mapAccumr
@[simp]
lemma List.mapAccumr_cons {α β σ : Type} {f : α → σ → σ × β} {x : α} {xs : List α} {s : σ} :
List.mapAccum... | import Clear.ExecLemmas
import Clear.SizeLemmas
@[simp]
lemma List.mapAccumr_nil {α β σ : Type} {f : α → σ → σ × β} {s : σ} :
List.mapAccumr f [] s = (s, []) := by
conv_lhs => unfold List.mapAccumr
@[simp]
lemma List.mapAccumr_cons {α β σ : Type} {f : α → σ → σ × β} {x : α} {xs : List α} {s : σ} :
List.mapAccum... | @@ -218,6 +218,10 @@
unfold primCall
cases prim <;> aesop
+lemma isOutOfFuel_execPrimCall3 (h : isOutOfFuel s) : isOutOfFuel (primCall s prim [x, y, z]).1 := by
+ unfold primCall
+ cases prim <;> aesop
+
lemma isOutOfFuel_execPrimCall4 (h : isOutOfFuel s) : isOutOfFuel (primCall s prim [w, x, y, z]).1 := by
... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_440bbd56ff40_8 | 801815299db16764 | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Clear/OutOfFuelLemmas.lean | OutOfFuelLemmas | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 38 | 1 | [
{
"theorem_name": "For_Inf",
"depth": 1,
"n_commands": 0,
"n_lines": 48,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [For']\n rcases fuel with _ | _ | fuel <;> dsimp (config := {zeta := false}) only\n · apply isOutOfFuel_diverge h\n · apply ... | [
{
"name": "isOutOfFuel_diverge",
"text": "/--\n Running out of fuel preserves infinite loops.\n-/\n@[aesop unsafe 10% apply]\nlemma isOutOfFuel_diverge (h : isOutOfFuel s) : isOutOfFuel (diverge s) := by\n unfold isOutOfFuel at *; unfold diverge\n aesop\n\n",
"fan_in": 1,
"n_lines": 9,
"n_cha... | [
{
"name": "For_Inf",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 54,
"n_chars": 1905,
"n_subproofs": 2,
"n_tactics": 53,
"cyclomatic": 14,
"n_automation": 18,
"n_rewrites": 6,
"n_structural": 20,
"automation_only": false,
"max_nesting":... | 1 | import Clear.ExecLemmas
import Clear.SizeLemmas
@[simp]
lemma List.mapAccumr_nil {α β σ : Type} {f : α → σ → σ × β} {s : σ} :
List.mapAccumr f [] s = (s, []) := by
conv_lhs => unfold List.mapAccumr
@[simp]
lemma List.mapAccumr_cons {α β σ : Type} {f : α → σ → σ × β} {x : α} {xs : List α} {s : σ} :
List.mapAccum... | import Clear.ExecLemmas
import Clear.SizeLemmas
@[simp]
lemma List.mapAccumr_nil {α β σ : Type} {f : α → σ → σ × β} {s : σ} :
List.mapAccumr f [] s = (s, []) := by
conv_lhs => unfold List.mapAccumr
@[simp]
lemma List.mapAccumr_cons {α β σ : Type} {f : α → σ → σ × β} {x : α} {xs : List α} {s : σ} :
List.mapAccum... | @@ -124,6 +124,14 @@
unfold initcall; aesop
/--
+ Running out of fuel preserves infinite loops.
+-/
+@[aesop unsafe 10% apply]
+lemma isOutOfFuel_diverge (h : isOutOfFuel s) : isOutOfFuel (diverge s) := by
+ unfold isOutOfFuel at *; unfold diverge
+ aesop
+
+/--
A diverged state is an infinite loop if the o... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_440bbd56ff40_9 | 713affb668df314a | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Clear/OutOfFuelLemmas.lean | OutOfFuelLemmas | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 38 | 1 | [
{
"theorem_name": "execPrimCall_Inf",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Performance issues, need to break some abstraction by creating\n -- 'equivalence classes' on function arity, among ot... | [
{
"name": "isOutOfFuel_execPrimCall5",
"text": "lemma isOutOfFuel_execPrimCall5 (h : isOutOfFuel s) : isOutOfFuel (primCall s prim [v, w, x, y, z]).1 := by\n unfold primCall\n cases prim <;> aesop\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 150,
"n_subproofs": 0,
"n_tactics": 4,
"c... | [
{
"name": "exec_Inf",
"fan_in": 0,
"n_deps_direct": 18,
"n_deps_transitive": 44,
"n_lines": 63,
"n_chars": 2044,
"n_subproofs": 2,
"n_tactics": 59,
"cyclomatic": 6,
"n_automation": 1,
"n_rewrites": 6,
"n_structural": 24,
"automation_only": false,
"max_nesting"... | 36 | import Clear.ExecLemmas
import Clear.SizeLemmas
@[simp]
lemma List.mapAccumr_nil {α β σ : Type} {f : α → σ → σ × β} {s : σ} :
List.mapAccumr f [] s = (s, []) := by
conv_lhs => unfold List.mapAccumr
@[simp]
lemma List.mapAccumr_cons {α β σ : Type} {f : α → σ → σ × β} {x : α} {xs : List α} {s : σ} :
List.mapAccum... | import Clear.ExecLemmas
import Clear.SizeLemmas
@[simp]
lemma List.mapAccumr_nil {α β σ : Type} {f : α → σ → σ × β} {s : σ} :
List.mapAccumr f [] s = (s, []) := by
conv_lhs => unfold List.mapAccumr
@[simp]
lemma List.mapAccumr_cons {α β σ : Type} {f : α → σ → σ × β} {x : α} {xs : List α} {s : σ} :
List.mapAccum... | @@ -226,6 +226,10 @@
unfold primCall
cases prim <;> aesop
+lemma isOutOfFuel_execPrimCall5 (h : isOutOfFuel s) : isOutOfFuel (primCall s prim [v, w, x, y, z]).1 := by
+ unfold primCall
+ cases prim <;> aesop
+
lemma isOutOfFuel_execPrimCall6 (h : isOutOfFuel s) : isOutOfFuel (primCall s prim [u, v, w, x, y, ... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_1d10488e8af0_0 | 0868330863b766ee | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Generated/peano/Peano/Common/for_727972558926940900.lean | for_727972558926940900 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "for_727972558926940900_abs_of_code",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intros s₉\n intros hcode\n apply reasoning_principle_3 for_727972558926940900_cond for_727972558926940... | [
{
"name": "for_727972558926940900_body_abs_of_code",
"text": "lemma for_727972558926940900_body_abs_of_code {s₀ : State} {fuel : Nat} :\n ∀ s₉, exec fuel (Block for_727972558926940900_body) s₀ = s₉ →\n Spec ABody_for_727972558926940900 s₀ s₉ :=\n λ _ h ↦ for_727972558926940900_concrete_of_body_ab... | [
{
"name": "for_727972558926940900_abs_of_code",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 6,
"n_chars": 700,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": fals... | 2 | import Clear.ReasoningPrinciple
import Generated.peano.Peano.Common.if_6183625948864629624
import Generated.peano.Peano.mulk
import Generated.peano.Peano.Common.for_727972558926940900_gen
import Generated.peano.Peano.Common.for_727972558926940900_user
namespace Peano.Common
set_option autoImplicit false
section
... | import Clear.ReasoningPrinciple
import Generated.peano.Peano.Common.if_6183625948864629624
import Generated.peano.Peano.mulk
import Generated.peano.Peano.Common.for_727972558926940900_gen
import Generated.peano.Peano.Common.for_727972558926940900_user
namespace Peano.Common
set_option autoImplicit false
section
... | @@ -20,8 +20,17 @@
Spec APost_for_727972558926940900 s₀ s₉ :=
λ _ h ↦ for_727972558926940900_concrete_of_post_abs (for_727972558926940900_post_concrete_of_code.2 h)
-lemma for_727972558926940900_abs_of_code {s₀ fuel} : ∀ s₉, exec fuel for_727972558926940900 s₀ = s₉ → Spec AFor_for_727972558926940900 s₀ ... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_966575be73cf_0 | 1b2e6ef47c026825 | lean | lean | github.com/NethermindEth/Clear | 6ef2e7eda01080e5d5fd7474354c1a71adab5071 | Generated/peano/Peano/Common/for_4806375509446804985.lean | for_4806375509446804985 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "for_4806375509446804985_abs_of_code",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intros s₉\n intros hcode\n apply reasoning_principle_3 for_4806375509446804985_cond for_4806375509446... | [
{
"name": "for_4806375509446804985_body_abs_of_code",
"text": "lemma for_4806375509446804985_body_abs_of_code {s₀ : State} {fuel : Nat} :\n ∀ s₉, exec fuel (Block for_4806375509446804985_body) s₀ = s₉ →\n Spec ABody_for_4806375509446804985 s₀ s₉ :=\n λ _ h ↦ for_4806375509446804985_concrete_of_bo... | [
{
"name": "for_4806375509446804985_abs_of_code",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 6,
"n_chars": 718,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": fal... | 2 | import Clear.ReasoningPrinciple
import Generated.peano.Peano.Common.if_6183625948864629624
import Generated.peano.Peano.addk
import Generated.peano.Peano.Common.for_4806375509446804985_gen
import Generated.peano.Peano.Common.for_4806375509446804985_user
namespace Peano.Common
set_option autoImplicit false
section... | import Clear.ReasoningPrinciple
import Generated.peano.Peano.Common.if_6183625948864629624
import Generated.peano.Peano.addk
import Generated.peano.Peano.Common.for_4806375509446804985_gen
import Generated.peano.Peano.Common.for_4806375509446804985_user
namespace Peano.Common
set_option autoImplicit false
section... | @@ -20,8 +20,17 @@
Spec APost_for_4806375509446804985 s₀ s₉ :=
λ _ h ↦ for_4806375509446804985_concrete_of_post_abs (for_4806375509446804985_post_concrete_of_code.2 h)
-lemma for_4806375509446804985_abs_of_code {s₀ fuel} : ∀ s₉, exec fuel for_4806375509446804985 s₀ = s₉ → Spec AFor_for_48063755094468049... | {
"repo": "Clear",
"git_repo": "github.com/NethermindEth/Clear",
"revision": "6ef2e7eda01080e5d5fd7474354c1a71adab5071",
"lean_toolchain": "leanprover/lean4:v4.9.1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemma... |
ablate_b1dd1155cc48_0 | b49fe1e703cc5740 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/Binary/Common.lean | Common | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "eq_of_associated_ZMod2",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases h with ⟨u, h_eq⟩\n -- 1. Get the unit as a polynomial\n let u_poly : Polynomial (ZMod 2) := u\n -- 2. Pro... | [
{
"name": "ZMod2_value_eq_zero_or_one",
"text": "lemma ZMod2_value_eq_zero_or_one (x : ZMod 2) : x = 0 ∨ x = 1 := by\n fin_cases x\n · left; rfl;\n · right; rfl\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 117,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": ... | [
{
"name": "eq_of_associated_ZMod2",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 37,
"n_chars": 1497,
"n_subproofs": 6,
"n_tactics": 23,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 5,
"n_structural": 7,
"automation_only": false,
"m... | 1 | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao, Derek Sorensen, Dimitris Mitsios
-/
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.RingTheory.Polynomial.Basic
import Mathlib.RingTheor... | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao, Derek Sorensen, Dimitris Mitsios
-/
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.RingTheory.Polynomial.Basic
import Mathlib.RingTheor... | @@ -44,12 +44,47 @@
have : CharP (Polynomial (ZMod 2)) 2 := inferInstance
exact CharP.cast_eq_mod (Polynomial (ZMod 2)) 2 n
+lemma ZMod2_value_eq_zero_or_one (x : ZMod 2) : x = 0 ∨ x = 1 := by
+ fin_cases x
+ · left; rfl;
+ · right; rfl
+
/--
Helper: In Polynomial (ZMod 2), the only unit is 1.
Therefore, ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_b1dd1155cc48_1 | a19638c790bb710c | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/Binary/Common.lean | Common | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "ZMod2Poly.euclidean_gcd_comm",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n letI : GCDMonoid (Polynomial (ZMod 2)) := by apply EuclideanDomain.gcdMonoid\n have h_assoc := gcd_comm' a b\... | [
{
"name": "eq_of_associated_ZMod2",
"text": "/--\nHelper: In Polynomial (ZMod 2), the only unit is 1.\nTherefore, if two polynomials are Associated (differ by a unit), they must be Equal.\n-/\nlemma eq_of_associated_ZMod2 {a b : Polynomial (ZMod 2)} (h : Associated a b) : a = b := by\n rcases h with ⟨u, h_... | [
{
"name": "ZMod2Poly.euclidean_gcd_comm",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 492,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
... | 2 | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao, Derek Sorensen, Dimitris Mitsios
-/
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.RingTheory.Polynomial.Basic
import Mathlib.RingTheor... | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao, Derek Sorensen, Dimitris Mitsios
-/
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.RingTheory.Polynomial.Basic
import Mathlib.RingTheor... | @@ -50,12 +50,52 @@
· right; rfl
/--
+Helper: In Polynomial (ZMod 2), the only unit is 1.
+Therefore, if two polynomials are Associated (differ by a unit), they must be Equal.
+-/
+lemma eq_of_associated_ZMod2 {a b : Polynomial (ZMod 2)} (h : Associated a b) : a = b := by
+ rcases h with ⟨u, h_eq⟩
+ -- 1. Get t... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_b1dd1155cc48_2 | 122d7a2dd1e61075 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/Binary/Common.lean | Common | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 3 | [
{
"theorem_name": "toPoly_ne_zero_iff_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 61,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · intro hToPoly_ne_zero\n by_contra h_v_eq_zero\n have h_toPoly_zero : toPoly v = 0 := by\... | [
{
"name": "toPoly_zero_eq_zero",
"text": "lemma toPoly_zero_eq_zero {w : Nat} : toPoly (BitVec.ofNat w 0) = 0 := by\n unfold toPoly\n apply Finset.sum_eq_zero\n intro i hi_mem_univ\n simp only [BitVec.getLsb_eq_getElem, Fin.getElem_fin, BitVec.getElem_zero, Bool.false_eq_true,\n ↓reduceIte]\n\n",
... | [
{
"name": "toPoly_ne_zero_iff_ne_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 64,
"n_chars": 2874,
"n_subproofs": 10,
"n_tactics": 61,
"cyclomatic": 2,
"n_automation": 10,
"n_rewrites": 10,
"n_structural": 14,
"automation_only": false... | 1 | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao, Derek Sorensen, Dimitris Mitsios
-/
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.RingTheory.Polynomial.Basic
import Mathlib.RingTheor... | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao, Derek Sorensen, Dimitris Mitsios
-/
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.RingTheory.Polynomial.Basic
import Mathlib.RingTheor... | @@ -111,12 +111,20 @@
noncomputable def toPoly {w : Nat} (v : BitVec w) : (ZMod 2)[X] :=
∑ i : Fin w, if v.getLsb i then X^i.val else 0
+lemma toPoly_zero_eq_zero {w : Nat} : toPoly (BitVec.ofNat w 0) = 0 := by
+ unfold toPoly
+ apply Finset.sum_eq_zero
+ intro i hi_mem_univ
+ simp only [BitVec.getLsb_eq_getE... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_b1dd1155cc48_3 | 2d70f44c12478919 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/Binary/Common.lean | Common | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 3 | [
{
"theorem_name": "toPoly_ne_zero_iff_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 61,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · intro hToPoly_ne_zero\n by_contra h_v_eq_zero\n have h_toPoly_zero : toPoly v = 0 := by\... | [
{
"name": "toPoly_zero_eq_zero",
"text": "lemma toPoly_zero_eq_zero {w : Nat} : toPoly (BitVec.ofNat w 0) = 0 := by\n unfold toPoly\n apply Finset.sum_eq_zero\n intro i hi_mem_univ\n simp only [BitVec.getLsb_eq_getElem, Fin.getElem_fin, BitVec.getElem_zero, Bool.false_eq_true,\n ↓reduceIte]\n\n",
... | [
{
"name": "toPoly_fold_xor",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 418,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 2 | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao, Derek Sorensen, Dimitris Mitsios
-/
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.RingTheory.Polynomial.Basic
import Mathlib.RingTheor... | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao, Derek Sorensen, Dimitris Mitsios
-/
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.RingTheory.Polynomial.Basic
import Mathlib.RingTheor... | @@ -111,6 +111,13 @@
noncomputable def toPoly {w : Nat} (v : BitVec w) : (ZMod 2)[X] :=
∑ i : Fin w, if v.getLsb i then X^i.val else 0
+lemma toPoly_zero_eq_zero {w : Nat} : toPoly (BitVec.ofNat w 0) = 0 := by
+ unfold toPoly
+ apply Finset.sum_eq_zero
+ intro i hi_mem_univ
+ simp only [BitVec.getLsb_eq_getEl... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_b1dd1155cc48_4 | 6ad1632994077e47 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/Binary/Common.lean | Common | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 2 | [
{
"theorem_name": "toPoly_128_extend_256",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold toPoly\n -- 1. Split the sum of B256 (0..255) into (0..127) and (128..255)\n let f : Fin 256 → Polynomial (... | [
{
"name": "to256_toNat",
"text": "lemma to256_toNat (v : B128) : (to256 v).toNat = v.toNat := by\n simp only [to256, BitVec.truncate_eq_setWidth, BitVec.toNat_setWidth, Nat.reducePow,\n Nat.mod_succ_eq_iff_lt, Nat.succ_eq_add_one, Nat.reduceAdd]\n change BitVec.toNat v < 2^256\n have h_toNat_lt := Bit... | [
{
"name": "toPoly_128_extend_256",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 25,
"n_chars": 993,
"n_subproofs": 3,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
"max... | 1 | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao, Derek Sorensen, Dimitris Mitsios
-/
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.RingTheory.Polynomial.Basic
import Mathlib.RingTheor... | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao, Derek Sorensen, Dimitris Mitsios
-/
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.RingTheory.Polynomial.Basic
import Mathlib.RingTheor... | @@ -72,6 +72,14 @@
-- Extend 128 to 256
def to256 (v : B128) : B256 := BitVec.zeroExtend 256 v
+lemma to256_toNat (v : B128) : (to256 v).toNat = v.toNat := by
+ simp only [to256, BitVec.truncate_eq_setWidth, BitVec.toNat_setWidth, Nat.reducePow,
+ Nat.mod_succ_eq_iff_lt, Nat.succ_eq_add_one, Nat.reduceAdd]
+ c... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_b1dd1155cc48_5 | 0a75d861e7bdd2a3 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/Binary/Common.lean | Common | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "BitVec_getElem_eq_false_of_toNat_lt_two_pow",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n -- Convert `a[n]` to `a.getLsb ⟨n, hn⟩` and use the `getLsb` lemma.\n simpa [BitV... | [
{
"name": "BitVec_getLsb_eq_false_of_toNat_lt_two_pow",
"text": "theorem BitVec_getLsb_eq_false_of_toNat_lt_two_pow {w d : ℕ} (a : BitVec w) (ha : a.toNat < 2 ^ d)\n (i : Fin w) (hd : d ≤ (i : ℕ)) : a.getLsb i = false := by\n have hlt : a.toNat < 2 ^ (i : ℕ) := by\n apply lt_of_lt_of_le ha\n exact... | [
{
"name": "BitVec_getElem_eq_false_of_toNat_lt_two_pow",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 369,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_on... | 1 | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao, Derek Sorensen, Dimitris Mitsios
-/
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.RingTheory.Polynomial.Basic
import Mathlib.RingTheor... | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao, Derek Sorensen, Dimitris Mitsios
-/
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.RingTheory.Polynomial.Basic
import Mathlib.RingTheor... | @@ -111,8 +111,20 @@
noncomputable def toPoly {w : Nat} (v : BitVec w) : (ZMod 2)[X] :=
∑ i : Fin w, if v.getLsb i then X^i.val else 0
+theorem BitVec_getLsb_eq_false_of_toNat_lt_two_pow {w d : ℕ} (a : BitVec w) (ha : a.toNat < 2 ^ d)
+ (i : Fin w) (hd : d ≤ (i : ℕ)) : a.getLsb i = false := by
+ have hlt : a.... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_b1dd1155cc48_6 | 218debc429f6fb2a | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/Binary/Common.lean | Common | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "toPoly_shiftLeft_no_overflow",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n classical\n -- Shadowing guard: prevents accidental use of any existing lemma with this name\n have toPoly_... | [
{
"name": "BitVec_getElem_eq_false_of_toNat_lt_two_pow",
"text": "theorem BitVec_getElem_eq_false_of_toNat_lt_two_pow {w d : ℕ} (a : BitVec w) (ha : a.toNat < 2 ^ d)\n (n : ℕ) (hn : n < w) (hd : d ≤ n) : a[n] = false := by\n classical\n -- Convert `a[n]` to `a.getLsb ⟨n, hn⟩` and use the `getLsb` lemma... | [
{
"name": "toPoly_shiftLeft_no_overflow",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 29,
"n_chars": 1222,
"n_subproofs": 6,
"n_tactics": 25,
"cyclomatic": 1,
"n_automation": 9,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
... | 3 | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao, Derek Sorensen, Dimitris Mitsios
-/
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.RingTheory.Polynomial.Basic
import Mathlib.RingTheor... | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao, Derek Sorensen, Dimitris Mitsios
-/
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.RingTheory.Polynomial.Basic
import Mathlib.RingTheor... | @@ -119,6 +119,13 @@
have hbit : a.toNat.testBit (i : ℕ) = false := Nat.testBit_eq_false_of_lt hlt
simpa [BitVec.getLsb] using hbit
+theorem BitVec_getElem_eq_false_of_toNat_lt_two_pow {w d : ℕ} (a : BitVec w) (ha : a.toNat < 2 ^ d)
+ (n : ℕ) (hn : n < w) (hd : d ≤ n) : a[n] = false := by
+ classical
+ -- ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_b1dd1155cc48_7 | bf6cf0c60885acac | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/Binary/Common.lean | Common | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 2 | [
{
"theorem_name": "toPoly_clMul",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [clMul_unfold]\n rw [toPoly_fold_xor (f := fun k => if a.getLsbD k = true then to256 b <<< k else 0)]\n conv_rhs =... | [
{
"name": "toPoly_128_extend_256",
"text": "lemma toPoly_128_extend_256 (a : B128) :\n toPoly (to256 a) = toPoly a := by\n unfold toPoly\n -- 1. Split the sum of B256 (0..255) into (0..127) and (128..255)\n let f : Fin 256 → Polynomial (ZMod 2) :=\n fun i => if (to256 a).getLsb i then X ^ i.val els... | [
{
"name": "toPoly_clMul",
"fan_in": 0,
"n_deps_direct": 6,
"n_deps_transitive": 10,
"n_lines": 28,
"n_chars": 987,
"n_subproofs": 2,
"n_tactics": 26,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 10,
"n_structural": 3,
"automation_only": false,
"max_nestin... | 10 | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao, Derek Sorensen, Dimitris Mitsios
-/
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.RingTheory.Polynomial.Basic
import Mathlib.RingTheor... | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao, Derek Sorensen, Dimitris Mitsios
-/
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.RingTheory.Polynomial.Basic
import Mathlib.RingTheor... | @@ -200,6 +200,30 @@
simp only [Fin.val_castSucc, ih]
simp [Finset.sum_range_succ]
+lemma toPoly_128_extend_256 (a : B128) :
+ toPoly (to256 a) = toPoly a := by
+ unfold toPoly
+ -- 1. Split the sum of B256 (0..255) into (0..127) and (128..255)
+ let f : Fin 256 → Polynomial (ZMod 2) :=
... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_b1dd1155cc48_8 | a5f1ecf529b832c1 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/Binary/Common.lean | Common | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 2 | [
{
"theorem_name": "toPoly_clMul",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [clMul_unfold]\n rw [toPoly_fold_xor (f := fun k => if a.getLsbD k = true then to256 b <<< k else 0)]\n conv_rhs =... | [
{
"name": "toPoly_128_extend_256",
"text": "lemma toPoly_128_extend_256 (a : B128) :\n toPoly (to256 a) = toPoly a := by\n unfold toPoly\n -- 1. Split the sum of B256 (0..255) into (0..127) and (128..255)\n let f : Fin 256 → Polynomial (ZMod 2) :=\n fun i => if (to256 a).getLsb i then X ^ i.val els... | [
{
"name": "chain_step",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 17,
"n_chars": 881,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 8,
"n_structural": 0,
"automation_only": false,
"max_nesting": ... | 2 | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao, Derek Sorensen, Dimitris Mitsios
-/
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.RingTheory.Polynomial.Basic
import Mathlib.RingTheor... | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao, Derek Sorensen, Dimitris Mitsios
-/
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.RingTheory.Polynomial.Basic
import Mathlib.RingTheor... | @@ -119,12 +119,45 @@
noncomputable def toPoly {w : Nat} (v : BitVec w) : (ZMod 2)[X] :=
∑ i : Fin w, if v.getLsb i then X^i.val else 0
+lemma toPoly_128_extend_256 (a : B128) :
+ toPoly (to256 a) = toPoly a := by
+ unfold toPoly
+ -- 1. Split the sum of B256 (0..255) into (0..127) and (128..255)
+ let f : ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_b1dd1155cc48_9 | 0533f77b88b5821f | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/Binary/Common.lean | Common | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "ZMod2Poly.euclidean_gcd_comm",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n letI : GCDMonoid (Polynomial (ZMod 2)) := by apply EuclideanDomain.gcdMonoid\n have h_assoc := gcd_comm' a b\... | [
{
"name": "eq_of_associated_ZMod2",
"text": "/--\nHelper: In Polynomial (ZMod 2), the only unit is 1.\nTherefore, if two polynomials are Associated (differ by a unit), they must be Equal.\n-/\nlemma eq_of_associated_ZMod2 {a b : Polynomial (ZMod 2)} (h : Associated a b) : a = b := by\n rcases h with ⟨u, h_... | [
{
"name": "gcd_eq_gcd_next_step",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 611,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 6,
"n_structural": 0,
"automation_only": false,
"max_n... | 3 | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao, Derek Sorensen, Dimitris Mitsios
-/
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.RingTheory.Polynomial.Basic
import Mathlib.RingTheor... | /-
Copyright (c) 2024-2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao, Derek Sorensen, Dimitris Mitsios
-/
import Mathlib.FieldTheory.Finite.Basic
import Mathlib.RingTheory.Polynomial.Basic
import Mathlib.RingTheor... | @@ -50,12 +50,52 @@
· right; rfl
/--
+Helper: In Polynomial (ZMod 2), the only unit is 1.
+Therefore, if two polynomials are Associated (differ by a unit), they must be Equal.
+-/
+lemma eq_of_associated_ZMod2 {a b : Polynomial (ZMod 2)} (h : Associated a b) : a = b := by
+ rcases h with ⟨u, h_eq⟩
+ -- 1. Get t... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_146486bbe777_0 | 1eeb4b093735189a | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/FactorMonic.lean | FactorMonic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 3 | [
{
"theorem_name": "linearYDivisor_monic",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hpoly := linearYDivisor_toPoly (R := R) f\n have hmonic : (CPolynomial.toPoly (linearYDivisor f)).Monic := by\n ... | [
{
"name": "linearYDivisor_toPoly",
"text": "/-- `toPoly` sends the linear divisor `Y - f` to `X - C f` in `(CPolynomial R)[Y]`. -/\ntheorem linearYDivisor_toPoly [CommRing R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]\n (f : CPolynomial R) :\n CPolynomial.toPoly (linearYDivisor f) = Polynomi... | [
{
"name": "linearYDivisor_monic",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 456,
"n_subproofs": 2,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_n... | 1 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Dimitris Mitsios
-/
import CompPoly.Bivariate.Factor
import CompPoly.Univariate.DivisionCorrectness
/-!
# Bridge: synthetic linear division equals general monic division
Proves that the be... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Dimitris Mitsios
-/
import CompPoly.Bivariate.Factor
import CompPoly.Univariate.DivisionCorrectness
/-!
# Bridge: synthetic linear division equals general monic division
Proves that the be... | @@ -39,10 +39,23 @@
-- `CPolynomial.X` at this nested type is `Y`; it is defeq to `CBivariate.X`.
(CPolynomial.X : CPolynomial (CPolynomial R)) - CPolynomial.C f
+/-- `toPoly` sends the linear divisor `Y - f` to `X - C f` in `(CPolynomial R)[Y]`. -/
+theorem linearYDivisor_toPoly [CommRing R] [BEq R] [LawfulBEq... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_146486bbe777_1 | 1390e716d4ae9f75 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/FactorMonic.lean | FactorMonic | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 3 | [
{
"theorem_name": "linearYDivisor_monic",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hpoly := linearYDivisor_toPoly (R := R) f\n have hmonic : (CPolynomial.toPoly (linearYDivisor f)).Monic := by\n ... | [
{
"name": "linearYDivisor_toPoly",
"text": "/-- `toPoly` sends the linear divisor `Y - f` to `X - C f` in `(CPolynomial R)[Y]`. -/\ntheorem linearYDivisor_toPoly [CommRing R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]\n (f : CPolynomial R) :\n CPolynomial.toPoly (linearYDivisor f) = Polynomi... | [
{
"name": "divByLinearY_euclid_toPoly",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 979,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Dimitris Mitsios
-/
import CompPoly.Bivariate.Factor
import CompPoly.Univariate.DivisionCorrectness
/-!
# Bridge: synthetic linear division equals general monic division
Proves that the be... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Dimitris Mitsios
-/
import CompPoly.Bivariate.Factor
import CompPoly.Univariate.DivisionCorrectness
/-!
# Bridge: synthetic linear division equals general monic division
Proves that the be... | @@ -39,6 +39,14 @@
-- `CPolynomial.X` at this nested type is `Y`; it is defeq to `CBivariate.X`.
(CPolynomial.X : CPolynomial (CPolynomial R)) - CPolynomial.C f
+/-- `toPoly` sends the linear divisor `Y - f` to `X - C f` in `(CPolynomial R)[Y]`. -/
+theorem linearYDivisor_toPoly [CommRing R] [BEq R] [LawfulBEq ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_146486bbe777_2 | 10899b32bc12f9c4 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/FactorMonic.lean | FactorMonic | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 3 | [
{
"theorem_name": "linearYDivisor_monic",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hpoly := linearYDivisor_toPoly (R := R) f\n have hmonic : (CPolynomial.toPoly (linearYDivisor f)).Monic := by\n ... | [
{
"name": "linearYDivisor_toPoly",
"text": "/-- `toPoly` sends the linear divisor `Y - f` to `X - C f` in `(CPolynomial R)[Y]`. -/\ntheorem linearYDivisor_toPoly [CommRing R] [BEq R] [LawfulBEq R] [Nontrivial R] [DecidableEq R]\n (f : CPolynomial R) :\n CPolynomial.toPoly (linearYDivisor f) = Polynomi... | [
{
"name": "divByLinearY_eq_divByMonic",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 43,
"n_chars": 2169,
"n_subproofs": 9,
"n_tactics": 35,
"cyclomatic": 3,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 7,
"automation_only": false,
... | 3 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Dimitris Mitsios
-/
import CompPoly.Bivariate.Factor
import CompPoly.Univariate.DivisionCorrectness
/-!
# Bridge: synthetic linear division equals general monic division
Proves that the be... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Dimitris Mitsios
-/
import CompPoly.Bivariate.Factor
import CompPoly.Univariate.DivisionCorrectness
/-!
# Bridge: synthetic linear division equals general monic division
Proves that the be... | @@ -39,10 +39,23 @@
-- `CPolynomial.X` at this nested type is `Y`; it is defeq to `CBivariate.X`.
(CPolynomial.X : CPolynomial (CPolynomial R)) - CPolynomial.C f
+/-- `toPoly` sends the linear divisor `Y - f` to `X - C f` in `(CPolynomial R)[Y]`. -/
+theorem linearYDivisor_toPoly [CommRing R] [BEq R] [LawfulBEq... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5c1232f4e7c_0 | c4b5bf1de182de8b | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTT/Interpolation.lean | Interpolation | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "raw_toPoly_natDegree_lt_size_of_size_pos",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hzero : p.toPoly = 0\n · rw [hzero, Polynomial.natDegree_zero]\n exact hp\n · exact ... | [
{
"name": "raw_toPoly_degree_lt_size",
"text": "private theorem raw_toPoly_degree_lt_size (p : CPolynomial.Raw R) :\n p.toPoly.degree < p.size := by\n rw [Polynomial.degree_lt_iff_coeff_zero]\n intro i hi\n rw [CPolynomial.Raw.coeff_toPoly]\n simp [CPolynomial.Raw.coeff]\n simp [Nat.not_lt.mpr hi]\n... | [
{
"name": "raw_toPoly_natDegree_lt_size_of_size_pos",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 323,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_only"... | 1 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Lagrange
import CompPoly.Univariate.NTT.Evaluation
import CompPoly.Univariate.NTT.Inverse
import CompPoly.Univariate.NTT.Kernel
import Init.Data.... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Lagrange
import CompPoly.Univariate.NTT.Evaluation
import CompPoly.Univariate.NTT.Inverse
import CompPoly.Univariate.NTT.Kernel
import Init.Data.... | @@ -24,13 +24,21 @@
open scoped BigOperators
+private theorem raw_toPoly_degree_lt_size (p : CPolynomial.Raw R) :
+ p.toPoly.degree < p.size := by
+ rw [Polynomial.degree_lt_iff_coeff_zero]
+ intro i hi
+ rw [CPolynomial.Raw.coeff_toPoly]
+ simp [CPolynomial.Raw.coeff]
+ simp [Nat.not_lt.mpr hi]
+
private... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5c1232f4e7c_1 | 366e47dd79d26d64 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTT/Interpolation.lean | Interpolation | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "inverseSpec_eval_node_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hdeg : (CPolynomial.Raw.toPoly (inverseSpec D values)).natDegree < D.n := by\n simpa [inverseSpec] using\n... | [
{
"name": "raw_toPoly_natDegree_lt_size_of_size_pos",
"text": "private theorem raw_toPoly_natDegree_lt_size_of_size_pos\n (p : CPolynomial.Raw R) (hp : 0 < p.size) :\n p.toPoly.natDegree < p.size := by\n by_cases hzero : p.toPoly = 0\n · rw [hzero, Polynomial.natDegree_zero]\n exact hp\n · exact... | [
{
"name": "inverseSpec_eval_node_eq",
"fan_in": 3,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 637,
"n_subproofs": 3,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"m... | 3 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Lagrange
import CompPoly.Univariate.NTT.Evaluation
import CompPoly.Univariate.NTT.Inverse
import CompPoly.Univariate.NTT.Kernel
import Init.Data.... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Lagrange
import CompPoly.Univariate.NTT.Evaluation
import CompPoly.Univariate.NTT.Inverse
import CompPoly.Univariate.NTT.Kernel
import Init.Data.... | @@ -32,6 +32,14 @@
simp [CPolynomial.Raw.coeff]
simp [Nat.not_lt.mpr hi]
+private theorem raw_toPoly_natDegree_lt_size_of_size_pos
+ (p : CPolynomial.Raw R) (hp : 0 < p.size) :
+ p.toPoly.natDegree < p.size := by
+ by_cases hzero : p.toPoly = 0
+ · rw [hzero, Polynomial.natDegree_zero]
+ exact hp
+ ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5c1232f4e7c_2 | fd38a4760f730fa1 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTT/Interpolation.lean | Interpolation | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "inverseSpec_evalOnDomain_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Array.ext\n · simp [evalOnDomain, loadNaturalArray]\n · intro i hi₁ hi₂\n let k : D.Idx := ⟨i, by si... | [
{
"name": "inverseSpec_eval_node_eq",
"text": "/-- Pointwise form of `inverseSpec_interpolatePow_eq`. -/\ntheorem inverseSpec_eval_node_eq (D : Domain R) (values : Array R) (k : D.Idx) :\n CPolynomial.Raw.eval (D.node k) (inverseSpec D values) = values.getD k.1 0 := by\n have hdeg : (CPolynomial.Raw.toP... | [
{
"name": "inverseSpec_evalOnDomain_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 480,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
... | 4 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Lagrange
import CompPoly.Univariate.NTT.Evaluation
import CompPoly.Univariate.NTT.Inverse
import CompPoly.Univariate.NTT.Kernel
import Init.Data.... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Lagrange
import CompPoly.Univariate.NTT.Evaluation
import CompPoly.Univariate.NTT.Inverse
import CompPoly.Univariate.NTT.Kernel
import Init.Data.... | @@ -98,12 +98,26 @@
· intro hii
exact (hii (Finset.mem_univ i)).elim
+/-- Pointwise form of `inverseSpec_interpolatePow_eq`. -/
+theorem inverseSpec_eval_node_eq (D : Domain R) (values : Array R) (k : D.Idx) :
+ CPolynomial.Raw.eval (D.node k) (inverseSpec D values) = values.getD k.1 0 := b... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5c1232f4e7c_3 | 7061d29a45393179 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTT/Interpolation.lean | Interpolation | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "inverseSpec_evalOnDomain_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Array.ext\n · simp [evalOnDomain, loadNaturalArray]\n · intro i hi₁ hi₂\n let k : D.Idx := ⟨i, by si... | [
{
"name": "inverseSpec_eval_node_eq",
"text": "/-- Pointwise form of `inverseSpec_interpolatePow_eq`. -/\ntheorem inverseSpec_eval_node_eq (D : Domain R) (values : Array R) (k : D.Idx) :\n CPolynomial.Raw.eval (D.node k) (inverseSpec D values) = values.getD k.1 0 := by\n have hdeg : (CPolynomial.Raw.toP... | [
{
"name": "inverseSpec_interpolatePow_eq",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 61,
"n_chars": 2969,
"n_subproofs": 11,
"n_tactics": 55,
"cyclomatic": 1,
"n_automation": 10,
"n_rewrites": 9,
"n_structural": 10,
"automation_only": fal... | 4 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Lagrange
import CompPoly.Univariate.NTT.Evaluation
import CompPoly.Univariate.NTT.Inverse
import CompPoly.Univariate.NTT.Kernel
import Init.Data.... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Lagrange
import CompPoly.Univariate.NTT.Evaluation
import CompPoly.Univariate.NTT.Inverse
import CompPoly.Univariate.NTT.Kernel
import Init.Data.... | @@ -98,6 +98,18 @@
· intro hii
exact (hii (Finset.mem_univ i)).elim
+/-- Pointwise form of `inverseSpec_interpolatePow_eq`. -/
+theorem inverseSpec_eval_node_eq (D : Domain R) (values : Array R) (k : D.Idx) :
+ CPolynomial.Raw.eval (D.node k) (inverseSpec D values) = values.getD k.1 0 := by... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5c1232f4e7c_4 | 66908c0e7225c98e | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTT/Interpolation.lean | Interpolation | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "inverseSpec_evalOnDomain_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Array.ext\n · simp [evalOnDomain, loadNaturalArray]\n · intro i hi₁ hi₂\n let k : D.Idx := ⟨i, by si... | [
{
"name": "inverseSpec_eval_node_eq",
"text": "/-- Pointwise form of `inverseSpec_interpolatePow_eq`. -/\ntheorem inverseSpec_eval_node_eq (D : Domain R) (values : Array R) (k : D.Idx) :\n CPolynomial.Raw.eval (D.node k) (inverseSpec D values) = values.getD k.1 0 := by\n have hdeg : (CPolynomial.Raw.toP... | [
{
"name": "inverseImpl_interpolatePow_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 9,
"n_chars": 392,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 5 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Lagrange
import CompPoly.Univariate.NTT.Evaluation
import CompPoly.Univariate.NTT.Inverse
import CompPoly.Univariate.NTT.Kernel
import Init.Data.... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Lagrange
import CompPoly.Univariate.NTT.Evaluation
import CompPoly.Univariate.NTT.Inverse
import CompPoly.Univariate.NTT.Kernel
import Init.Data.... | @@ -98,6 +98,18 @@
· intro hii
exact (hii (Finset.mem_univ i)).elim
+/-- Pointwise form of `inverseSpec_interpolatePow_eq`. -/
+theorem inverseSpec_eval_node_eq (D : Domain R) (values : Array R) (k : D.Idx) :
+ CPolynomial.Raw.eval (D.node k) (inverseSpec D values) = values.getD k.1 0 := by... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5c1232f4e7c_5 | 41958d804849d41c | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTT/Interpolation.lean | Interpolation | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "inverseSpec_evalOnDomain_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Array.ext\n · simp [evalOnDomain, loadNaturalArray]\n · intro i hi₁ hi₂\n let k : D.Idx := ⟨i, by si... | [
{
"name": "inverseSpec_eval_node_eq",
"text": "/-- Pointwise form of `inverseSpec_interpolatePow_eq`. -/\ntheorem inverseSpec_eval_node_eq (D : Domain R) (values : Array R) (k : D.Idx) :\n CPolynomial.Raw.eval (D.node k) (inverseSpec D values) = values.getD k.1 0 := by\n have hdeg : (CPolynomial.Raw.toP... | [
{
"name": "inverseImpl_eval_node_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 7,
"n_chars": 296,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"ma... | 4 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Lagrange
import CompPoly.Univariate.NTT.Evaluation
import CompPoly.Univariate.NTT.Inverse
import CompPoly.Univariate.NTT.Kernel
import Init.Data.... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Lagrange
import CompPoly.Univariate.NTT.Evaluation
import CompPoly.Univariate.NTT.Inverse
import CompPoly.Univariate.NTT.Kernel
import Init.Data.... | @@ -98,9 +98,23 @@
· intro hii
exact (hii (Finset.mem_univ i)).elim
+/-- Pointwise form of `inverseSpec_interpolatePow_eq`. -/
+theorem inverseSpec_eval_node_eq (D : Domain R) (values : Array R) (k : D.Idx) :
+ CPolynomial.Raw.eval (D.node k) (inverseSpec D values) = values.getD k.1 0 := by... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5c1232f4e7c_6 | 126d080717a184ac | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTT/Interpolation.lean | Interpolation | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "inverseSpec_evalOnDomain_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Array.ext\n · simp [evalOnDomain, loadNaturalArray]\n · intro i hi₁ hi₂\n let k : D.Idx := ⟨i, by si... | [
{
"name": "inverseSpec_eval_node_eq",
"text": "/-- Pointwise form of `inverseSpec_interpolatePow_eq`. -/\ntheorem inverseSpec_eval_node_eq (D : Domain R) (values : Array R) (k : D.Idx) :\n CPolynomial.Raw.eval (D.node k) (inverseSpec D values) = values.getD k.1 0 := by\n have hdeg : (CPolynomial.Raw.toP... | [
{
"name": "inverseImpl_evalOnDomain_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 7,
"n_chars": 313,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 5 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Lagrange
import CompPoly.Univariate.NTT.Evaluation
import CompPoly.Univariate.NTT.Inverse
import CompPoly.Univariate.NTT.Kernel
import Init.Data.... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Univariate.Lagrange
import CompPoly.Univariate.NTT.Evaluation
import CompPoly.Univariate.NTT.Inverse
import CompPoly.Univariate.NTT.Kernel
import Init.Data.... | @@ -98,12 +98,26 @@
· intro hii
exact (hii (Finset.mem_univ i)).elim
+/-- Pointwise form of `inverseSpec_interpolatePow_eq`. -/
+theorem inverseSpec_eval_node_eq (D : Domain R) (values : Array R) (k : D.Idx) :
+ CPolynomial.Raw.eval (D.node k) (inverseSpec D values) = values.getD k.1 0 := b... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_9f2267616fed_0 | e7a2ae590539df3c | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefShape.lean | RrefShape | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "list_forIn_addScaledRow_get_row_mem",
"depth": 1,
"n_commands": 0,
"n_lines": 86,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction rows generalizing out with\n | nil =>\n simp at hmem\n | cons r rows ih =>\n hav... | [
{
"name": "list_forIn_addScaledRow_get_of_not_mem",
"text": "theorem list_forIn_addScaledRow_get_of_not_mem [Field F]\n (rows : List Nat) {out : DenseMatrix F} {row col pivotRow pivotCol : Nat}\n (hcol : col < out.cols) (hnot : row ∉ rows) :\n (Id.run (forIn rows out fun r M ↦\n if r = pivotRo... | [
{
"name": "list_forIn_addScaledRow_get_row_mem",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 100,
"n_chars": 4998,
"n_subproofs": 17,
"n_tactics": 87,
"cyclomatic": 3,
"n_automation": 16,
"n_rewrites": 5,
"n_structural": 11,
"automation_onl... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | @@ -23,6 +23,60 @@
i < M.rows ∧ pivots.getD i 0 < M.cols ∧
∀ row, row < M.rows → M.get row (pivots.getD i 0) = if row = i then 1 else 0
+theorem list_forIn_addScaledRow_get_of_not_mem [Field F]
+ (rows : List Nat) {out : DenseMatrix F} {row col pivotRow pivotCol : Nat}
+ (hcol : col < out.cols) (hno... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_9f2267616fed_1 | b33e23d4f299967e | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefShape.lean | RrefShape | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "normalizeAndEliminate_get_pivot",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold normalizeAndEliminate\n by_cases hp : M.get pivotRow pivotCol == 0\n · exact (hpivot (beq_iff_eq.... | [
{
"name": "list_forIn_addScaledRow_get_pivotRow",
"text": "theorem list_forIn_addScaledRow_get_pivotRow [Field F]\n (rows : List Nat) {out : DenseMatrix F} {pivotRow pivotCol : Nat}\n (hcol : pivotCol < out.cols) (hpivot : out.get pivotRow pivotCol = 1) :\n (Id.run (forIn rows out fun row M ↦\n ... | [
{
"name": "normalizeAndEliminate_get_pivot",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 25,
"n_chars": 1142,
"n_subproofs": 2,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": fals... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | @@ -23,6 +23,35 @@
i < M.rows ∧ pivots.getD i 0 < M.cols ∧
∀ row, row < M.rows → M.get row (pivots.getD i 0) = if row = i then 1 else 0
+theorem list_forIn_addScaledRow_get_pivotRow [Field F]
+ (rows : List Nat) {out : DenseMatrix F} {pivotRow pivotCol : Nat}
+ (hcol : pivotCol < out.cols) (hpivot :... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_9f2267616fed_2 | 6dea6d085ca8f8ff | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefShape.lean | RrefShape | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "normalizeAndEliminate_get_row_pivot",
"depth": 1,
"n_commands": 0,
"n_lines": 42,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold normalizeAndEliminate\n by_cases hp : M.get pivotRow pivotCol == 0\n · exact (hpivot (beq_iff... | [
{
"name": "list_forIn_addScaledRow_get_row_mem",
"text": "theorem list_forIn_addScaledRow_get_row_mem [Field F]\n (rows : List Nat) {out : DenseMatrix F} {row pivotRow pivotCol : Nat}\n (hout : WellFormed out) (hpivotRow : pivotRow < out.rows)\n (hcol : pivotCol < out.cols) (hpivot : out.get pivotR... | [
{
"name": "normalizeAndEliminate_get_row_pivot",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 49,
"n_chars": 2225,
"n_subproofs": 8,
"n_tactics": 42,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 4,
"n_structural": 4,
"automation_only": ... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | @@ -77,6 +77,105 @@
hstepCol hnotTail
_ = out.get row col := hstepGet
+theorem list_forIn_addScaledRow_get_row_mem [Field F]
+ (rows : List Nat) {out : DenseMatrix F} {row pivotRow pivotCol : Nat}
+ (hout : WellFormed out) (hpivotRow : pivotRow < out.rows)
+ (hcol : pivotCol < o... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_9f2267616fed_3 | ea856bb72b39f81b | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefShape.lean | RrefShape | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "normalizeAndEliminate_get_of_pivotRow_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 53,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold normalizeAndEliminate\n by_cases hp : M.get pivotRow pivotCol == 0\n · simp [hp]\n · ... | [
{
"name": "list_forIn_addScaledRow_get_of_source_zero",
"text": "theorem list_forIn_addScaledRow_get_of_source_zero [Field F]\n (rows : List Nat) {out : DenseMatrix F} {row pivotRow oldCol pivotCol : Nat}\n (hout : WellFormed out) (hcol : oldCol < out.cols)\n (hrows : ∀ r, r ∈ rows → r < out.rows)\... | [
{
"name": "normalizeAndEliminate_get_of_pivotRow_zero",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 59,
"n_chars": 2603,
"n_subproofs": 6,
"n_tactics": 54,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 8,
"n_structural": 5,
"automation_... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | @@ -23,6 +23,77 @@
i < M.rows ∧ pivots.getD i 0 < M.cols ∧
∀ row, row < M.rows → M.get row (pivots.getD i 0) = if row = i then 1 else 0
+theorem list_forIn_addScaledRow_get_of_source_zero [Field F]
+ (rows : List Nat) {out : DenseMatrix F} {row pivotRow oldCol pivotCol : Nat}
+ (hout : WellFormed ou... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_9f2267616fed_4 | 5e0f8b9e3b29321b | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefShape.lean | RrefShape | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "rref_pivots_size_le_rows",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold rref\n simpa using (rrefLoop_pivots_size_le_rows (fuel := M.cols + 1) (col := 0)\n (row := 0) (M := M) ... | [
{
"name": "rrefLoop_pivots_size_le_rows",
"text": "theorem rrefLoop_pivots_size_le_rows [Field F] [BEq F] :\n ∀ fuel col row (M : DenseMatrix F) pivots,\n row ≤ M.rows →\n (rrefLoop fuel col row M pivots).pivots.size ≤\n pivots.size + (M.rows - row) := by\n intro fuel\n induction f... | [
{
"name": "rref_pivots_size_le_rows",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 263,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"ma... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | @@ -23,8 +23,51 @@
i < M.rows ∧ pivots.getD i 0 < M.cols ∧
∀ row, row < M.rows → M.get row (pivots.getD i 0) = if row = i then 1 else 0
+theorem rrefLoop_pivots_size_le_rows [Field F] [BEq F] :
+ ∀ fuel col row (M : DenseMatrix F) pivots,
+ row ≤ M.rows →
+ (rrefLoop fuel col row M pivots).... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_9f2267616fed_5 | d9d4cc6a57f7b9ad | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefShape.lean | RrefShape | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "rref_pivots_getD_lt_cols",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold rref\n exact rrefLoop_pivots_getD_lt_cols _ _ _ _ _ (by\n intro i hi\n simp at hi)",
"n_chars": ... | [
{
"name": "rrefLoop_pivots_getD_lt_cols",
"text": "theorem rrefLoop_pivots_getD_lt_cols [Field F] [BEq F] :\n ∀ fuel col row (M : DenseMatrix F) pivots,\n (∀ i, i < pivots.size → pivots.getD i 0 < M.cols) →\n ∀ i, i < (rrefLoop fuel col row M pivots).pivots.size →\n (rrefLoop fuel co... | [
{
"name": "rref_pivots_getD_lt_cols",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 250,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"ma... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | @@ -32,8 +32,63 @@
∀ i j, i < pivots.size → j < pivots.size → i < j →
pivots.getD i 0 < pivots.getD j 0
+theorem rrefLoop_pivots_getD_lt_cols [Field F] [BEq F] :
+ ∀ fuel col row (M : DenseMatrix F) pivots,
+ (∀ i, i < pivots.size → pivots.getD i 0 < M.cols) →
+ ∀ i, i < (rrefLoop fuel col row ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_9f2267616fed_6 | b6c0958faa9b4e50 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefShape.lean | RrefShape | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "rrefLoop_pivotColumnsStrict",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro fuel\n induction fuel with\n | zero =>\n intro col row M pivots _ hstrict\n exact hstrict\n ... | [
{
"name": "pivotColumnsStrict_push",
"text": "theorem pivotColumnsStrict_push {pivots : Array Nat} {col : Nat}\n (hstrict : PivotColumnsStrict pivots) (hbefore : PivotColumnsBefore pivots col) :\n PivotColumnsStrict (pivots.push col) := by\n intro i j hi hj hij\n by_cases hjlast : j = pivots.size\n ... | [
{
"name": "rrefLoop_pivotColumnsStrict",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 28,
"n_chars": 1053,
"n_subproofs": 0,
"n_tactics": 23,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 9,
"automation_only": false,
... | 3 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | @@ -54,6 +54,32 @@
rw [Array.getD_eq_getD_getElem?, Array.getElem?_eq_getElem hiOld] at hold
exact Nat.lt_trans hold hcol
+theorem pivotColumnsStrict_push {pivots : Array Nat} {col : Nat}
+ (hstrict : PivotColumnsStrict pivots) (hbefore : PivotColumnsBefore pivots col) :
+ PivotColumnsStrict (pivots.p... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_9f2267616fed_7 | e052fb5a0a8fec88 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefShape.lean | RrefShape | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "rrefLoop_pivotColumnsStrict",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro fuel\n induction fuel with\n | zero =>\n intro col row M pivots _ hstrict\n exact hstrict\n ... | [
{
"name": "pivotColumnsStrict_push",
"text": "theorem pivotColumnsStrict_push {pivots : Array Nat} {col : Nat}\n (hstrict : PivotColumnsStrict pivots) (hbefore : PivotColumnsBefore pivots col) :\n PivotColumnsStrict (pivots.push col) := by\n intro i j hi hj hij\n by_cases hjlast : j = pivots.size\n ... | [
{
"name": "rref_pivotColumnsStrict",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 6,
"n_lines": 7,
"n_chars": 236,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max... | 6 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | @@ -63,6 +63,32 @@
rw [Array.getD_eq_getD_getElem?, Array.getElem?_eq_getElem hiOld] at hold
exact Nat.lt_trans hold hcol
+theorem pivotColumnsStrict_push {pivots : Array Nat} {col : Nat}
+ (hstrict : PivotColumnsStrict pivots) (hbefore : PivotColumnsBefore pivots col) :
+ PivotColumnsStrict (pivots.p... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_9f2267616fed_8 | 682de7375c27ee1b | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefShape.lean | RrefShape | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "rrefLoop_pivotColumnsStrict",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro fuel\n induction fuel with\n | zero =>\n intro col row M pivots _ hstrict\n exact hstrict\n ... | [
{
"name": "pivotColumnsBefore_mono",
"text": "theorem pivotColumnsBefore_mono {pivots : Array Nat} {col next : Nat}\n (h : PivotColumnsBefore pivots col) (hcol : col < next) :\n PivotColumnsBefore pivots next := by\n intro i hi\n exact Nat.lt_trans (h i hi) hcol\n\n",
"fan_in": 2,
"n_lines":... | [
{
"name": "rrefLoop_pivotColumnsShaped",
"fan_in": 1,
"n_deps_direct": 6,
"n_deps_transitive": 10,
"n_lines": 137,
"n_chars": 6594,
"n_subproofs": 27,
"n_tactics": 128,
"cyclomatic": 3,
"n_automation": 17,
"n_rewrites": 33,
"n_structural": 28,
"automation_only": f... | 10 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | @@ -441,6 +441,12 @@
∀ i j, i < pivots.size → j < pivots.size → i < j →
pivots.getD i 0 < pivots.getD j 0
+theorem pivotColumnsBefore_mono {pivots : Array Nat} {col next : Nat}
+ (h : PivotColumnsBefore pivots col) (hcol : col < next) :
+ PivotColumnsBefore pivots next := by
+ intro i hi
+ exact Nat.l... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_9f2267616fed_9 | b4d81f17ff574dd1 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefShape.lean | RrefShape | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "rrefLoop_pivotColumnsStrict",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro fuel\n induction fuel with\n | zero =>\n intro col row M pivots _ hstrict\n exact hstrict\n ... | [
{
"name": "pivotColumnsBefore_mono",
"text": "theorem pivotColumnsBefore_mono {pivots : Array Nat} {col next : Nat}\n (h : PivotColumnsBefore pivots col) (hcol : col < next) :\n PivotColumnsBefore pivots next := by\n intro i hi\n exact Nat.lt_trans (h i hi) hcol\n\n",
"fan_in": 2,
"n_lines":... | [
{
"name": "rref_pivotColumnsShaped",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 13,
"n_lines": 8,
"n_chars": 301,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"ma... | 13 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | @@ -451,6 +451,12 @@
intro i hi
simp at hi
+theorem pivotColumnsBefore_mono {pivots : Array Nat} {col next : Nat}
+ (h : PivotColumnsBefore pivots col) (hcol : col < next) :
+ PivotColumnsBefore pivots next := by
+ intro i hi
+ exact Nat.lt_trans (h i hi) hcol
+
theorem pivotColumnsBefore_push {pivots ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_9f2267616fed_10 | 9b12865e910dff42 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefShape.lean | RrefShape | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "rrefLoop_pivotColumnsShaped",
"depth": 1,
"n_commands": 0,
"n_lines": 128,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro fuel\n induction fuel with\n | zero =>\n intro col row M pivots _ _ _ hshape\n exact hshape... | [
{
"name": "normalizeAndEliminate_get_of_pivotRow_zero",
"text": "theorem normalizeAndEliminate_get_of_pivotRow_zero [Field F] [BEq F] [LawfulBEq F]\n {M : DenseMatrix F} (hM : WellFormed M) {pivotRow pivotCol oldCol row : Nat}\n (hpivotRow : pivotRow < M.rows) (holdCol : oldCol < M.cols)\n (hpivotZ... | [
{
"name": "processedColumnsZeroBelow_pivot_step",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 58,
"n_chars": 2274,
"n_subproofs": 11,
"n_tactics": 47,
"cyclomatic": 1,
"n_automation": 9,
"n_rewrites": 12,
"n_structural": 10,
"automation_onl... | 5 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | @@ -295,6 +295,64 @@
[:(scaleRow M pivotRow (M.get pivotRow pivotCol)⁻¹).rows]))
hmem hne
+theorem normalizeAndEliminate_get_of_pivotRow_zero [Field F] [BEq F] [LawfulBEq F]
+ {M : DenseMatrix F} (hM : WellFormed M) {pivotRow pivotCol oldCol row : Nat}
+ (hpivotRow : pivotRow < M.rows) (ho... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_9f2267616fed_11 | 3ca03cff1f9fd6ca | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefShape.lean | RrefShape | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "rrefLoop_pivotColumnsShaped",
"depth": 1,
"n_commands": 0,
"n_lines": 128,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro fuel\n induction fuel with\n | zero =>\n intro col row M pivots _ _ _ hshape\n exact hshape... | [
{
"name": "normalizeAndEliminate_get_of_pivotRow_zero",
"text": "theorem normalizeAndEliminate_get_of_pivotRow_zero [Field F] [BEq F] [LawfulBEq F]\n {M : DenseMatrix F} (hM : WellFormed M) {pivotRow pivotCol oldCol row : Nat}\n (hpivotRow : pivotRow < M.rows) (holdCol : oldCol < M.cols)\n (hpivotZ... | [
{
"name": "rrefLoop_processedColumnsZeroBelow",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 83,
"n_chars": 3830,
"n_subproofs": 19,
"n_tactics": 73,
"cyclomatic": 3,
"n_automation": 20,
"n_rewrites": 8,
"n_structural": 19,
"automation_only"... | 6 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | @@ -295,6 +295,64 @@
[:(scaleRow M pivotRow (M.get pivotRow pivotCol)⁻¹).rows]))
hmem hne
+theorem normalizeAndEliminate_get_of_pivotRow_zero [Field F] [BEq F] [LawfulBEq F]
+ {M : DenseMatrix F} (hM : WellFormed M) {pivotRow pivotCol oldCol row : Nat}
+ (hpivotRow : pivotRow < M.rows) (ho... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_9f2267616fed_12 | 4910d20f2c7f7b1a | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefShape.lean | RrefShape | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "rrefLoop_processedColumnsZeroBelow",
"depth": 1,
"n_commands": 0,
"n_lines": 71,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro fuel\n induction fuel with\n | zero =>\n intro col row M pivots _hM hrowEq _hrowLe hbound ... | [
{
"name": "processedColumnsZeroBelow_pivot_step",
"text": "theorem processedColumnsZeroBelow_pivot_step\n [Field F] [BEq F] [LawfulBEq F]\n {M : DenseMatrix F} (hM : WellFormed M) {row col pivotRow : Nat}\n (hrow : row < M.rows) (hcol : col < M.cols)\n (hpivotLt : pivotRow < M.rows) (hpivotGe : ... | [
{
"name": "rref_processedColumnsZeroBelow",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 12,
"n_chars": 411,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
... | 7 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RrefSemantics
/-!
# Dense RREF Shape Correctness
Pivot-column and processed-column invariants for dense row reduction.
-... | @@ -367,6 +367,63 @@
(activeRow col : Nat) : Prop :=
∀ row c, activeRow ≤ row → row < M.rows → c < col → M.get row c = 0
+theorem processedColumnsZeroBelow_pivot_step
+ [Field F] [BEq F] [LawfulBEq F]
+ {M : DenseMatrix F} (hM : WellFormed M) {row col pivotRow : Nat}
+ (hrow : row < M.rows) (hcol : c... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_30d1ff5ce8c7_0 | 8a157cf16c189b05 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/PolynomialMatrix/RowSpan.lean | RowSpan | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "rowAdd_zeroRow_right",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Array.ext\n · simp [rowAdd, zeroRow, hsize]\n · intro j hj _hjRow\n have hjrow : j < row.size := by\n ... | [
{
"name": "rowGet_zeroRow",
"text": "private theorem rowGet_zeroRow [Semiring F] [BEq F] [LawfulBEq F]\n (width j : Nat) :\n rowGet (zeroRow (F := F) width) j = 0 := by\n unfold rowGet zeroRow\n by_cases hj : j < (Array.replicate width (0 : CPolynomial F)).size\n · rw [Array.getD_eq_getD_getElem?, ... | [
{
"name": "rowAdd_zeroRow_right",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 534,
"n_subproofs": 2,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
"max_... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Shifted
import CompPoly.Univariate.ToPoly
/-!
# Row Span for Polynomial Matrices
-/
namespace CompPoly
names... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Shifted
import CompPoly.Univariate.ToPoly
/-!
# Row Span for Polynomial Matrices
-/
namespace CompPoly
names... | @@ -33,9 +33,32 @@
{ row | ∃ coeffs : Array (CPolynomial F),
coeffs.size = M.size ∧ row = rowLinearCombination coeffs M }
+private theorem rowGet_zeroRow [Semiring F] [BEq F] [LawfulBEq F]
+ (width j : Nat) :
+ rowGet (zeroRow (F := F) width) j = 0 := by
+ unfold rowGet zeroRow
+ by_cases hj : j < (... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_30d1ff5ce8c7_1 | 3907880e2b416775 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/PolynomialMatrix/RowSpan.lean | RowSpan | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "rowAdd_zeroRow_right",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Array.ext\n · simp [rowAdd, zeroRow, hsize]\n · intro j hj _hjRow\n have hjrow : j < row.size := by\n ... | [
{
"name": "rowGet_zeroRow",
"text": "private theorem rowGet_zeroRow [Semiring F] [BEq F] [LawfulBEq F]\n (width j : Nat) :\n rowGet (zeroRow (F := F) width) j = 0 := by\n unfold rowGet zeroRow\n by_cases hj : j < (Array.replicate width (0 : CPolynomial F)).size\n · rw [Array.getD_eq_getD_getElem?, ... | [
{
"name": "rowAdd_zeroRow_left",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 533,
"n_subproofs": 2,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
"max_n... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Shifted
import CompPoly.Univariate.ToPoly
/-!
# Row Span for Polynomial Matrices
-/
namespace CompPoly
names... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Shifted
import CompPoly.Univariate.ToPoly
/-!
# Row Span for Polynomial Matrices
-/
namespace CompPoly
names... | @@ -33,9 +33,32 @@
{ row | ∃ coeffs : Array (CPolynomial F),
coeffs.size = M.size ∧ row = rowLinearCombination coeffs M }
+private theorem rowGet_zeroRow [Semiring F] [BEq F] [LawfulBEq F]
+ (width j : Nat) :
+ rowGet (zeroRow (F := F) width) j = 0 := by
+ unfold rowGet zeroRow
+ by_cases hj : j < (... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_30d1ff5ce8c7_2 | a306031f4f0e7b77 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/PolynomialMatrix/RowSpan.lean | RowSpan | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "rowScalePolynomial_C_one",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Array.ext\n · simp [rowScalePolynomial]\n · intro j _hj hjRow\n simp [rowScalePolynomial, C_one_mul]",
... | [
{
"name": "C_one_mul",
"text": "private theorem C_one_mul [Semiring F] [BEq F] [LawfulBEq F]\n (p : CPolynomial F) :\n CPolynomial.C (1 : F) * p = p := by\n apply (CPolynomial.eq_iff_coeff).2\n intro i\n have hpoly := congrArg (fun P : Polynomial F ↦ P.coeff i)\n (CPolynomial.toPoly_mul (CPolyno... | [
{
"name": "rowScalePolynomial_C_one",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 283,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"ma... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Shifted
import CompPoly.Univariate.ToPoly
/-!
# Row Span for Polynomial Matrices
-/
namespace CompPoly
names... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Shifted
import CompPoly.Univariate.ToPoly
/-!
# Row Span for Polynomial Matrices
-/
namespace CompPoly
names... | @@ -33,12 +33,24 @@
{ row | ∃ coeffs : Array (CPolynomial F),
coeffs.size = M.size ∧ row = rowLinearCombination coeffs M }
+private theorem C_one_mul [Semiring F] [BEq F] [LawfulBEq F]
+ (p : CPolynomial F) :
+ CPolynomial.C (1 : F) * p = p := by
+ apply (CPolynomial.eq_iff_coeff).2
+ intro i
+ hav... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_30d1ff5ce8c7_3 | 1e6ee6351811364c | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/PolynomialMatrix/RowSpan.lean | RowSpan | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "rowScalePolynomial_C_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Array.ext\n · simp [rowScalePolynomial, zeroRow]\n · intro j hj _hjZero\n have hjRow : j < row.size :=... | [
{
"name": "C_zero_mul",
"text": "private theorem C_zero_mul [Semiring F] [BEq F] [LawfulBEq F]\n (p : CPolynomial F) :\n CPolynomial.C (0 : F) * p = 0 := by\n apply (CPolynomial.eq_iff_coeff).2\n intro i\n have hpoly := congrArg (fun P : Polynomial F ↦ P.coeff i)\n (CPolynomial.toPoly_mul (CPoly... | [
{
"name": "rowScalePolynomial_C_zero",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 443,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Shifted
import CompPoly.Univariate.ToPoly
/-!
# Row Span for Polynomial Matrices
-/
namespace CompPoly
names... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Shifted
import CompPoly.Univariate.ToPoly
/-!
# Row Span for Polynomial Matrices
-/
namespace CompPoly
names... | @@ -33,9 +33,27 @@
{ row | ∃ coeffs : Array (CPolynomial F),
coeffs.size = M.size ∧ row = rowLinearCombination coeffs M }
+private theorem C_zero_mul [Semiring F] [BEq F] [LawfulBEq F]
+ (p : CPolynomial F) :
+ CPolynomial.C (0 : F) * p = 0 := by
+ apply (CPolynomial.eq_iff_coeff).2
+ intro i
+ hav... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_30d1ff5ce8c7_4 | fe337f169f2eb4fd | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/PolynomialMatrix/RowSpan.lean | RowSpan | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "rowScalePolynomial_C_zero_of_wellFormed",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [rowScalePolynomial_C_zero]\n rw [matrix_getD_size_of_wellFormed hM hi]",
"n_chars": 80,
... | [
{
"name": "rowScalePolynomial_C_zero",
"text": "private theorem rowScalePolynomial_C_zero [Semiring F] [BEq F] [LawfulBEq F]\n (row : PolynomialRow F) :\n rowScalePolynomial (CPolynomial.C (0 : F)) row = zeroRow row.size := by\n apply Array.ext\n · simp [rowScalePolynomial, zeroRow]\n · intro j hj ... | [
{
"name": "rowScalePolynomial_C_zero_of_wellFormed",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 352,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only":... | 3 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Shifted
import CompPoly.Univariate.ToPoly
/-!
# Row Span for Polynomial Matrices
-/
namespace CompPoly
names... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Shifted
import CompPoly.Univariate.ToPoly
/-!
# Row Span for Polynomial Matrices
-/
namespace CompPoly
names... | @@ -44,6 +44,17 @@
rw [CPolynomial.coeff_toPoly, CPolynomial.coeff_toPoly]
simpa [CPolynomial.toPoly_zero] using hpoly
+private theorem rowScalePolynomial_C_zero [Semiring F] [BEq F] [LawfulBEq F]
+ (row : PolynomialRow F) :
+ rowScalePolynomial (CPolynomial.C (0 : F)) row = zeroRow row.size := by
+ appl... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_30d1ff5ce8c7_5 | c26d8c56e8ba9eb0 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/PolynomialMatrix/RowSpan.lean | RowSpan | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "unitRowCoeffs_getD",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hk : k < height\n · have hksize : k < (unitRowCoeffs (F := F) height i).size := by\n simpa [unitRowCoeff... | [
{
"name": "unitRowCoeffs_size",
"text": "private theorem unitRowCoeffs_size [Semiring F] [BEq F] [LawfulBEq F]\n (height i : Nat) :\n (unitRowCoeffs (F := F) height i).size = height := by\n simp [unitRowCoeffs]\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 175,
"n_subproofs": 0,
"n_... | [
{
"name": "unitRowCoeffs_getD",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 764,
"n_subproofs": 2,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
"max_ne... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Shifted
import CompPoly.Univariate.ToPoly
/-!
# Row Span for Polynomial Matrices
-/
namespace CompPoly
names... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Shifted
import CompPoly.Univariate.ToPoly
/-!
# Row Span for Polynomial Matrices
-/
namespace CompPoly
names... | @@ -38,13 +38,27 @@
Array.ofFn (fun j : Fin height ↦
if j.val = i then CPolynomial.C (1 : F) else CPolynomial.C (0 : F))
+private theorem unitRowCoeffs_size [Semiring F] [BEq F] [LawfulBEq F]
+ (height i : Nat) :
+ (unitRowCoeffs (F := F) height i).size = height := by
+ simp [unitRowCoeffs]
+
private ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_30d1ff5ce8c7_6 | 79fabcb6a7efeddd | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/PolynomialMatrix/RowSpan.lean | RowSpan | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "unitRowCoeffs_getD",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hk : k < height\n · have hksize : k < (unitRowCoeffs (F := F) height i).size := by\n simpa [unitRowCoeff... | [
{
"name": "unitRowCoeffs_size",
"text": "private theorem unitRowCoeffs_size [Semiring F] [BEq F] [LawfulBEq F]\n (height i : Nat) :\n (unitRowCoeffs (F := F) height i).size = height := by\n simp [unitRowCoeffs]\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 175,
"n_subproofs": 0,
"n_... | [
{
"name": "unitRowCoeffs_getD_self",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 232,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Shifted
import CompPoly.Univariate.ToPoly
/-!
# Row Span for Polynomial Matrices
-/
namespace CompPoly
names... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Shifted
import CompPoly.Univariate.ToPoly
/-!
# Row Span for Polynomial Matrices
-/
namespace CompPoly
names... | @@ -38,13 +38,27 @@
Array.ofFn (fun j : Fin height ↦
if j.val = i then CPolynomial.C (1 : F) else CPolynomial.C (0 : F))
+private theorem unitRowCoeffs_size [Semiring F] [BEq F] [LawfulBEq F]
+ (height i : Nat) :
+ (unitRowCoeffs (F := F) height i).size = height := by
+ simp [unitRowCoeffs]
+
private ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_30d1ff5ce8c7_7 | fb57a345bf3a144b | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/PolynomialMatrix/RowSpan.lean | RowSpan | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "unitRowCoeffs_getD",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hk : k < height\n · have hksize : k < (unitRowCoeffs (F := F) height i).size := by\n simpa [unitRowCoeff... | [
{
"name": "unitRowCoeffs_size",
"text": "private theorem unitRowCoeffs_size [Semiring F] [BEq F] [LawfulBEq F]\n (height i : Nat) :\n (unitRowCoeffs (F := F) height i).size = height := by\n simp [unitRowCoeffs]\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 175,
"n_subproofs": 0,
"n_... | [
{
"name": "unitRowCoeffs_getD_ne",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 231,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_n... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Shifted
import CompPoly.Univariate.ToPoly
/-!
# Row Span for Polynomial Matrices
-/
namespace CompPoly
names... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Shifted
import CompPoly.Univariate.ToPoly
/-!
# Row Span for Polynomial Matrices
-/
namespace CompPoly
names... | @@ -38,13 +38,27 @@
Array.ofFn (fun j : Fin height ↦
if j.val = i then CPolynomial.C (1 : F) else CPolynomial.C (0 : F))
+private theorem unitRowCoeffs_size [Semiring F] [BEq F] [LawfulBEq F]
+ (height i : Nat) :
+ (unitRowCoeffs (F := F) height i).size = height := by
+ simp [unitRowCoeffs]
+
private ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_30d1ff5ce8c7_8 | d4a98f64f351fad3 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/PolynomialMatrix/RowSpan.lean | RowSpan | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "rowLinearCombination_unit_range",
"depth": 1,
"n_commands": 0,
"n_lines": 36,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hrowWidth : row.size = MatrixWidth M := by\n rw [← hrow]\n exact matrix_getD_size_of_wellFormed... | [
{
"name": "rowAdd_zeroRow_right",
"text": "private theorem rowAdd_zeroRow_right [Semiring F] [BEq F] [LawfulBEq F]\n {width : Nat} (row : PolynomialRow F) (hsize : row.size = width) :\n rowAdd row (zeroRow (F := F) width) = row := by\n apply Array.ext\n · simp [rowAdd, zeroRow, hsize]\n · intro j h... | [
{
"name": "rowLinearCombination_unit_range",
"fan_in": 1,
"n_deps_direct": 7,
"n_deps_transitive": 13,
"n_lines": 50,
"n_chars": 1829,
"n_subproofs": 5,
"n_tactics": 36,
"cyclomatic": 2,
"n_automation": 9,
"n_rewrites": 15,
"n_structural": 8,
"automation_only": fa... | 13 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Shifted
import CompPoly.Univariate.ToPoly
/-!
# Row Span for Polynomial Matrices
-/
namespace CompPoly
names... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Shifted
import CompPoly.Univariate.ToPoly
/-!
# Row Span for Polynomial Matrices
-/
namespace CompPoly
names... | @@ -67,6 +67,21 @@
rw [Array.getD_eq_getD_getElem?, Array.getElem?_eq_none hle]
simp
+private theorem rowAdd_zeroRow_right [Semiring F] [BEq F] [LawfulBEq F]
+ {width : Nat} (row : PolynomialRow F) (hsize : row.size = width) :
+ rowAdd row (zeroRow (F := F) width) = row := by
+ apply Array.ext
+ · s... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_30d1ff5ce8c7_9 | 2a8feb3e57d99ca2 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/PolynomialMatrix/RowSpan.lean | RowSpan | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "rowLinearCombination_unit_range",
"depth": 1,
"n_commands": 0,
"n_lines": 36,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hrowWidth : row.size = MatrixWidth M := by\n rw [← hrow]\n exact matrix_getD_size_of_wellFormed... | [
{
"name": "rowAdd_zeroRow_right",
"text": "private theorem rowAdd_zeroRow_right [Semiring F] [BEq F] [LawfulBEq F]\n {width : Nat} (row : PolynomialRow F) (hsize : row.size = width) :\n rowAdd row (zeroRow (F := F) width) = row := by\n apply Array.ext\n · simp [rowAdd, zeroRow, hsize]\n · intro j h... | [
{
"name": "matrix_row_mem_rowSpan",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 14,
"n_lines": 21,
"n_chars": 832,
"n_subproofs": 3,
"n_tactics": 13,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
"m... | 14 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Shifted
import CompPoly.Univariate.ToPoly
/-!
# Row Span for Polynomial Matrices
-/
namespace CompPoly
names... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.PolynomialMatrix.Shifted
import CompPoly.Univariate.ToPoly
/-!
# Row Span for Polynomial Matrices
-/
namespace CompPoly
names... | @@ -67,6 +67,21 @@
rw [Array.getD_eq_getD_getElem?, Array.getElem?_eq_none hle]
simp
+private theorem rowAdd_zeroRow_right [Semiring F] [BEq F] [LawfulBEq F]
+ {width : Nat} (row : PolynomialRow F) (hsize : row.size = width) :
+ rowAdd row (zeroRow (F := F) width) = row := by
+ apply Array.ext
+ · s... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_e3bb2fc6116f_0 | 86cc483f42158292 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Fields/Binary/Tower/Concrete/Field.lean | Field | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "concrete_mul_inv_cancel",
"depth": 1,
"n_commands": 0,
"n_lines": 84,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n letI : Field (ConcreteBTField (k - 1)) := mkFieldInstance prevBTFieldResult.toConcreteBTFieldProps\n have hmul : ... | [
{
"name": "norm_of_ne_zero_is_ne_zero",
"text": "lemma norm_of_ne_zero_is_ne_zero {k : ℕ}\n {h_k_gt_0 : k > 0} (prevBTFieldResult : ConcreteBTFStepResult (k := k - 1))\n (a : ConcreteBTField k) (h_a_ne_zero : a ≠ 0) :\n let a₁ := (split h_k_gt_0 a).1\n let a₀ := (split h_k_gt_0 a).2\n concrete_mul a₀... | [
{
"name": "concrete_mul_inv_cancel",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 89,
"n_chars": 4598,
"n_subproofs": 16,
"n_tactics": 84,
"cyclomatic": 7,
"n_automation": 6,
"n_rewrites": 41,
"n_structural": 5,
"automation_only": false,
... | 1 | /-
Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao
-/
import CompPoly.Fields.Binary.Tower.Concrete.Core
/-!
# Concrete Binary Tower Field
Field-structure lemmas for successive levels of the c... | /-
Copyright (c) 2024 - 2025 ArkLib Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Chung Thai Nguyen, Quang Dao
-/
import CompPoly.Fields.Binary.Tower.Concrete.Core
/-!
# Concrete Binary Tower Field
Field-structure lemmas for successive levels of the c... | @@ -313,6 +313,86 @@
rw [concrete_mul_comm prevBTFieldProps (h_k:=h_k) (a:=b) (b:=c)]
exact concrete_mul_left_distrib prevBTFieldProps (h_k:=h_k) (a:=c) (b:=a) (c:=b)
+lemma norm_of_ne_zero_is_ne_zero {k : ℕ}
+ {h_k_gt_0 : k > 0} (prevBTFieldResult : ConcreteBTFStepResult (k := k - 1))
+ (a : ConcreteBTFiel... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5a1a2e1453b_0 | 52e96bc4bdaf62cc | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefSemantics.lean | RrefSemantics | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 3 | [
{
"theorem_name": "findPivotRow_fold_mem",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction xs with\n | nil =>\n simp at h\n | cons row xs ih =>\n change List.foldl (findPivotRowStep M c... | [
{
"name": "findPivotRowStep_fold_some",
"text": "theorem findPivotRowStep_fold_some [Zero F] [BEq F]\n (M : DenseMatrix F) (col : Nat) (xs : List Nat) (pivot : Nat) :\n xs.foldl (findPivotRowStep M col) (some pivot) = some pivot := by\n induction xs generalizing pivot with\n | nil => rfl\n | cons r... | [
{
"name": "findPivotRow_fold_mem",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 867,
"n_subproofs": 2,
"n_tactics": 19,
"cyclomatic": 4,
"n_automation": 5,
"n_rewrites": 4,
"n_structural": 3,
"automation_only": false,
"max... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | @@ -23,6 +23,14 @@
(out : Option Nat) (row : Nat) : Option Nat :=
if out.isNone && !(M.get row col == 0) then some row else out
+theorem findPivotRowStep_fold_some [Zero F] [BEq F]
+ (M : DenseMatrix F) (col : Nat) (xs : List Nat) (pivot : Nat) :
+ xs.foldl (findPivotRowStep M col) (some pivot) = some p... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5a1a2e1453b_1 | c2007e1d2f56f14f | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefSemantics.lean | RrefSemantics | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 3 | [
{
"theorem_name": "findPivotRow_fold_mem",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction xs with\n | nil =>\n simp at h\n | cons row xs ih =>\n change List.foldl (findPivotRowStep M c... | [
{
"name": "findPivotRowStep_fold_some",
"text": "theorem findPivotRowStep_fold_some [Zero F] [BEq F]\n (M : DenseMatrix F) (col : Nat) (xs : List Nat) (pivot : Nat) :\n xs.foldl (findPivotRowStep M col) (some pivot) = some pivot := by\n induction xs generalizing pivot with\n | nil => rfl\n | cons r... | [
{
"name": "findPivotRow_fold_get_ne_zero",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 869,
"n_subproofs": 2,
"n_tactics": 19,
"cyclomatic": 4,
"n_automation": 4,
"n_rewrites": 4,
"n_structural": 4,
"automation_only": false,
... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | @@ -23,6 +23,14 @@
(out : Option Nat) (row : Nat) : Option Nat :=
if out.isNone && !(M.get row col == 0) then some row else out
+theorem findPivotRowStep_fold_some [Zero F] [BEq F]
+ (M : DenseMatrix F) (col : Nat) (xs : List Nat) (pivot : Nat) :
+ xs.foldl (findPivotRowStep M col) (some pivot) = some p... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5a1a2e1453b_2 | 65129f26a9cee158 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefSemantics.lean | RrefSemantics | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 3 | [
{
"theorem_name": "findPivotRow_fold_mem",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction xs with\n | nil =>\n simp at h\n | cons row xs ih =>\n change List.foldl (findPivotRowStep M c... | [
{
"name": "findPivotRowStep_fold_some",
"text": "theorem findPivotRowStep_fold_some [Zero F] [BEq F]\n (M : DenseMatrix F) (col : Nat) (xs : List Nat) (pivot : Nat) :\n xs.foldl (findPivotRowStep M col) (some pivot) = some pivot := by\n induction xs generalizing pivot with\n | nil => rfl\n | cons r... | [
{
"name": "findPivotRow_fold_none_get_eq_zero",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 30,
"n_chars": 1089,
"n_subproofs": 2,
"n_tactics": 25,
"cyclomatic": 6,
"n_automation": 6,
"n_rewrites": 4,
"n_structural": 6,
"automation_only": f... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | @@ -23,6 +23,14 @@
(out : Option Nat) (row : Nat) : Option Nat :=
if out.isNone && !(M.get row col == 0) then some row else out
+theorem findPivotRowStep_fold_some [Zero F] [BEq F]
+ (M : DenseMatrix F) (col : Nat) (xs : List Nat) (pivot : Nat) :
+ xs.foldl (findPivotRowStep M col) (some pivot) = some p... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5a1a2e1453b_3 | c72cdd0a5c95e2ee | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefSemantics.lean | RrefSemantics | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 1 | [
{
"theorem_name": "findPivotRow_eq_fold",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [findPivotRow, Std.Legacy.Range.forIn_eq_forIn_range',\n list_forIn_findPivotRowStep_eq_foldl]",
"n_chars"... | [
{
"name": "list_forIn_findPivotRowStep_eq_foldl",
"text": "theorem list_forIn_findPivotRowStep_eq_foldl [Zero F] [BEq F]\n (M : DenseMatrix F) (col : Nat) (xs : List Nat) (out : Option Nat) :\n (Id.run (forIn xs out fun row out ↦\n if out = none ∧ (M.get row col == 0) = false then\n pure (... | [
{
"name": "findPivotRow_eq_fold",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 311,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nes... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | @@ -23,10 +23,41 @@
(out : Option Nat) (row : Nat) : Option Nat :=
if out.isNone && !(M.get row col == 0) then some row else out
+theorem list_forIn_findPivotRowStep_eq_foldl [Zero F] [BEq F]
+ (M : DenseMatrix F) (col : Nat) (xs : List Nat) (out : Option Nat) :
+ (Id.run (forIn xs out fun row out ↦
+ ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5a1a2e1453b_4 | 11f6751e84cb9d1f | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefSemantics.lean | RrefSemantics | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 1 | [
{
"theorem_name": "findPivotRow_eq_fold",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [findPivotRow, Std.Legacy.Range.forIn_eq_forIn_range',\n list_forIn_findPivotRowStep_eq_foldl]",
"n_chars"... | [
{
"name": "list_forIn_findPivotRowStep_eq_foldl",
"text": "theorem list_forIn_findPivotRowStep_eq_foldl [Zero F] [BEq F]\n (M : DenseMatrix F) (col : Nat) (xs : List Nat) (out : Option Nat) :\n (Id.run (forIn xs out fun row out ↦\n if out = none ∧ (M.get row col == 0) = false then\n pure (... | [
{
"name": "findPivotRow_some_lt",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 299,
"n_subproofs": 2,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_n... | 4 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | @@ -31,6 +31,35 @@
| cons row xs ih =>
simp [List.foldl, findPivotRowStep, ih]
+theorem list_forIn_findPivotRowStep_eq_foldl [Zero F] [BEq F]
+ (M : DenseMatrix F) (col : Nat) (xs : List Nat) (out : Option Nat) :
+ (Id.run (forIn xs out fun row out ↦
+ if out = none ∧ (M.get row col == 0) = false... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5a1a2e1453b_5 | b4746c517bedc3de | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefSemantics.lean | RrefSemantics | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 1 | [
{
"theorem_name": "findPivotRow_eq_fold",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [findPivotRow, Std.Legacy.Range.forIn_eq_forIn_range',\n list_forIn_findPivotRowStep_eq_foldl]",
"n_chars"... | [
{
"name": "list_forIn_findPivotRowStep_eq_foldl",
"text": "theorem list_forIn_findPivotRowStep_eq_foldl [Zero F] [BEq F]\n (M : DenseMatrix F) (col : Nat) (xs : List Nat) (out : Option Nat) :\n (Id.run (forIn xs out fun row out ↦\n if out = none ∧ (M.get row col == 0) = false then\n pure (... | [
{
"name": "findPivotRow_some_ge",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 300,
"n_subproofs": 2,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_n... | 4 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | @@ -31,6 +31,35 @@
| cons row xs ih =>
simp [List.foldl, findPivotRowStep, ih]
+theorem list_forIn_findPivotRowStep_eq_foldl [Zero F] [BEq F]
+ (M : DenseMatrix F) (col : Nat) (xs : List Nat) (out : Option Nat) :
+ (Id.run (forIn xs out fun row out ↦
+ if out = none ∧ (M.get row col == 0) = false... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5a1a2e1453b_6 | 30069f1b005222bc | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefSemantics.lean | RrefSemantics | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 3 | [
{
"theorem_name": "findPivotRow_fold_mem",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction xs with\n | nil =>\n simp at h\n | cons row xs ih =>\n change List.foldl (findPivotRowStep M c... | [
{
"name": "findPivotRowStep_fold_some",
"text": "theorem findPivotRowStep_fold_some [Zero F] [BEq F]\n (M : DenseMatrix F) (col : Nat) (xs : List Nat) (pivot : Nat) :\n xs.foldl (findPivotRowStep M col) (some pivot) = some pivot := by\n induction xs generalizing pivot with\n | nil => rfl\n | cons r... | [
{
"name": "findPivotRow_some_ne_zero",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 309,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"... | 4 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | @@ -23,6 +23,14 @@
(out : Option Nat) (row : Nat) : Option Nat :=
if out.isNone && !(M.get row col == 0) then some row else out
+theorem findPivotRowStep_fold_some [Zero F] [BEq F]
+ (M : DenseMatrix F) (col : Nat) (xs : List Nat) (pivot : Nat) :
+ xs.foldl (findPivotRowStep M col) (some pivot) = some p... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5a1a2e1453b_7 | 4f773b9959a19f18 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefSemantics.lean | RrefSemantics | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 3 | [
{
"theorem_name": "findPivotRow_fold_mem",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction xs with\n | nil =>\n simp at h\n | cons row xs ih =>\n change List.foldl (findPivotRowStep M c... | [
{
"name": "findPivotRowStep_fold_some",
"text": "theorem findPivotRowStep_fold_some [Zero F] [BEq F]\n (M : DenseMatrix F) (col : Nat) (xs : List Nat) (pivot : Nat) :\n xs.foldl (findPivotRowStep M col) (some pivot) = some pivot := by\n induction xs generalizing pivot with\n | nil => rfl\n | cons r... | [
{
"name": "findPivotRow_none_get_eq_zero",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 9,
"n_chars": 360,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
... | 4 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | @@ -23,6 +23,14 @@
(out : Option Nat) (row : Nat) : Option Nat :=
if out.isNone && !(M.get row col == 0) then some row else out
+theorem findPivotRowStep_fold_some [Zero F] [BEq F]
+ (M : DenseMatrix F) (col : Nat) (xs : List Nat) (pivot : Nat) :
+ xs.foldl (findPivotRowStep M col) (some pivot) = some p... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5a1a2e1453b_8 | 0ea3b393f4ed4508 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefSemantics.lean | RrefSemantics | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 1 | [
{
"theorem_name": "normalizeAndEliminate_wf",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold normalizeAndEliminate\n by_cases hp : M.get pivotRow pivotCol == 0\n · simp [hp, hM]\n · simp only [hp]... | [
{
"name": "list_forIn_addScaledRow_wf",
"text": "theorem list_forIn_addScaledRow_wf [Field F]\n (rows : List Nat) {out : DenseMatrix F} (pivotRow pivotCol : Nat)\n (hout : WellFormed out) :\n WellFormed\n (Id.run (forIn rows out fun row r ↦\n if row = pivotRow then\n pure (ForI... | [
{
"name": "normalizeAndEliminate_wf",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 726,
"n_subproofs": 1,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | @@ -23,13 +23,45 @@
(out : Option Nat) (row : Nat) : Option Nat :=
if out.isNone && !(M.get row col == 0) then some row else out
+theorem list_forIn_addScaledRow_wf [Field F]
+ (rows : List Nat) {out : DenseMatrix F} (pivotRow pivotCol : Nat)
+ (hout : WellFormed out) :
+ WellFormed
+ (Id.run (f... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5a1a2e1453b_9 | 91807f73051350cd | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefSemantics.lean | RrefSemantics | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 1 | [
{
"theorem_name": "isHomogeneousSolution_normalizeAndEliminate_of_solution",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold normalizeAndEliminate\n by_cases hp : M.get pivotRow pivotCol == 0\n · si... | [
{
"name": "list_forIn_addScaledRow_solution_of_solution",
"text": "theorem list_forIn_addScaledRow_solution_of_solution [Field F]\n (rows : List Nat) {out : DenseMatrix F} {v : Array F}\n (pivotRow pivotCol : Nat) (hpivot : pivotRow < out.rows)\n (hout : WellFormed out) (hsol : IsHomogeneousSolutio... | [
{
"name": "isHomogeneousSolution_normalizeAndEliminate_of_solution",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 27,
"n_chars": 1279,
"n_subproofs": 3,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 0,
... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | @@ -23,6 +23,51 @@
(out : Option Nat) (row : Nat) : Option Nat :=
if out.isNone && !(M.get row col == 0) then some row else out
+theorem list_forIn_addScaledRow_solution_of_solution [Field F]
+ (rows : List Nat) {out : DenseMatrix F} {v : Array F}
+ (pivotRow pivotCol : Nat) (hpivot : pivotRow < out.row... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5a1a2e1453b_10 | f36187ff035f1520 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefSemantics.lean | RrefSemantics | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 1 | [
{
"theorem_name": "isHomogeneousSolution_of_normalizeAndEliminate_solution",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold normalizeAndEliminate at hsol\n by_cases hp : M.get pivotRow pivotCol == 0... | [
{
"name": "list_forIn_addScaledRow_solution_reflect",
"text": "theorem list_forIn_addScaledRow_solution_reflect [Field F]\n (rows : List Nat) {out : DenseMatrix F} {v : Array F}\n (pivotRow pivotCol : Nat) (hpivot : pivotRow < out.rows)\n (hout : WellFormed out)\n (hsol :\n IsHomogeneousSol... | [
{
"name": "isHomogeneousSolution_of_normalizeAndEliminate_solution",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 30,
"n_chars": 1430,
"n_subproofs": 4,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 3,
... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | @@ -23,6 +23,53 @@
(out : Option Nat) (row : Nat) : Option Nat :=
if out.isNone && !(M.get row col == 0) then some row else out
+theorem list_forIn_addScaledRow_solution_reflect [Field F]
+ (rows : List Nat) {out : DenseMatrix F} {v : Array F}
+ (pivotRow pivotCol : Nat) (hpivot : pivotRow < out.rows)
+... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5a1a2e1453b_11 | 8870c5cfc92cbd41 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefSemantics.lean | RrefSemantics | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 1 | [
{
"theorem_name": "rref_cols",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold rref\n exact rrefLoop_cols _ _ _ _ _",
"n_chars": 49,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
... | [
{
"name": "rrefLoop_cols",
"text": "theorem rrefLoop_cols [Field F] [BEq F] :\n ∀ fuel col row (M : DenseMatrix F) pivots,\n ((rrefLoop fuel col row M pivots).matrix).cols = M.cols := by\n intro fuel\n induction fuel with\n | zero =>\n intro col row M pivots\n rfl\n | succ fuel ih =>\n... | [
{
"name": "rref_cols",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 145,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | @@ -23,8 +23,34 @@
(out : Option Nat) (row : Nat) : Option Nat :=
if out.isNone && !(M.get row col == 0) then some row else out
+theorem rrefLoop_cols [Field F] [BEq F] :
+ ∀ fuel col row (M : DenseMatrix F) pivots,
+ ((rrefLoop fuel col row M pivots).matrix).cols = M.cols := by
+ intro fuel
+ induc... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5a1a2e1453b_12 | 83f6408444c7ca86 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefSemantics.lean | RrefSemantics | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 1 | [
{
"theorem_name": "rref_rows",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold rref\n exact rrefLoop_rows _ _ _ _ _",
"n_chars": 49,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
... | [
{
"name": "rrefLoop_rows",
"text": "theorem rrefLoop_rows [Field F] [BEq F] :\n ∀ fuel col row (M : DenseMatrix F) pivots,\n ((rrefLoop fuel col row M pivots).matrix).rows = M.rows := by\n intro fuel\n induction fuel with\n | zero =>\n intro col row M pivots\n rfl\n | succ fuel ih =>\n... | [
{
"name": "rref_rows",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 145,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | @@ -23,8 +23,34 @@
(out : Option Nat) (row : Nat) : Option Nat :=
if out.isNone && !(M.get row col == 0) then some row else out
+theorem rrefLoop_rows [Field F] [BEq F] :
+ ∀ fuel col row (M : DenseMatrix F) pivots,
+ ((rrefLoop fuel col row M pivots).matrix).rows = M.rows := by
+ intro fuel
+ induc... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5a1a2e1453b_13 | b382c299f785cc8c | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefSemantics.lean | RrefSemantics | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 3 | [
{
"theorem_name": "rrefLoop_wf",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro fuel\n induction fuel with\n | zero =>\n intro col row M pivots hM\n exact hM\n | succ fuel ih =>\n in... | [
{
"name": "normalizeAndEliminate_wf",
"text": "theorem normalizeAndEliminate_wf [Field F] [BEq F]\n {M : DenseMatrix F} (hM : WellFormed M) (pivotRow pivotCol : Nat) :\n WellFormed (normalizeAndEliminate M pivotRow pivotCol) := by\n unfold normalizeAndEliminate\n by_cases hp : M.get pivotRow pivotCo... | [
{
"name": "rrefLoop_wf",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 28,
"n_chars": 1019,
"n_subproofs": 2,
"n_tactics": 24,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 8,
"automation_only": false,
"max_nesting"... | 2 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | @@ -46,6 +46,23 @@
ih (out := addScaledRow out row pivotRow (-(out.get row pivotCol)))
hstep
+theorem normalizeAndEliminate_wf [Field F] [BEq F]
+ {M : DenseMatrix F} (hM : WellFormed M) (pivotRow pivotCol : Nat) :
+ WellFormed (normalizeAndEliminate M pivotRow pivotCol) := by
+ unfold ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5a1a2e1453b_14 | 8a3fdd0a2f78383b | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefSemantics.lean | RrefSemantics | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 3 | [
{
"theorem_name": "rrefLoop_wf",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro fuel\n induction fuel with\n | zero =>\n intro col row M pivots hM\n exact hM\n | succ fuel ih =>\n in... | [
{
"name": "normalizeAndEliminate_wf",
"text": "theorem normalizeAndEliminate_wf [Field F] [BEq F]\n {M : DenseMatrix F} (hM : WellFormed M) (pivotRow pivotCol : Nat) :\n WellFormed (normalizeAndEliminate M pivotRow pivotCol) := by\n unfold normalizeAndEliminate\n by_cases hp : M.get pivotRow pivotCo... | [
{
"name": "rref_wf",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 6,
"n_chars": 161,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
}... | 3 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | @@ -46,6 +46,23 @@
ih (out := addScaledRow out row pivotRow (-(out.get row pivotCol)))
hstep
+theorem normalizeAndEliminate_wf [Field F] [BEq F]
+ {M : DenseMatrix F} (hM : WellFormed M) (pivotRow pivotCol : Nat) :
+ WellFormed (normalizeAndEliminate M pivotRow pivotCol) := by
+ unfold ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5a1a2e1453b_15 | e5b6a7f327f70b13 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefSemantics.lean | RrefSemantics | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 2 | [
{
"theorem_name": "findPivotRow_some_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [findPivotRow_eq_fold] at h\n have hmem := findPivotRow_fold_mem M col h\n have hrange := List.mem_range'_1.mp hm... | [
{
"name": "findPivotRow_fold_mem",
"text": "theorem findPivotRow_fold_mem [Zero F] [BEq F]\n (M : DenseMatrix F) (col : Nat) {xs : List Nat} {pivot : Nat}\n (h : xs.foldl (findPivotRowStep M col) none = some pivot) :\n pivot ∈ xs := by\n induction xs with\n | nil =>\n simp at h\n | cons row... | [
{
"name": "isHomogeneousSolution_rrefLoop_of_solution",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 9,
"n_lines": 43,
"n_chars": 1978,
"n_subproofs": 9,
"n_tactics": 36,
"cyclomatic": 3,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 8,
"automation_... | 9 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | @@ -60,6 +60,28 @@
simp [findPivotRowStep]
simpa [List.forIn_cons, List.foldl_cons, h, hstep] using ih out
+theorem findPivotRow_fold_mem [Zero F] [BEq F]
+ (M : DenseMatrix F) (col : Nat) {xs : List Nat} {pivot : Nat}
+ (h : xs.foldl (findPivotRowStep M col) none = some pivot) :
+ pi... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5a1a2e1453b_16 | 219b3c6f71de0645 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefSemantics.lean | RrefSemantics | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 4 | [
{
"theorem_name": "findPivotRow_some_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [findPivotRow_eq_fold] at h\n have hmem := findPivotRow_fold_mem M col h\n have hrange := List.mem_range'_1.mp hm... | [
{
"name": "findPivotRow_eq_fold",
"text": "theorem findPivotRow_eq_fold [Zero F] [BEq F]\n (M : DenseMatrix F) (start col : Nat) :\n findPivotRow M start col =\n (List.range' start (M.rows - start)).foldl (findPivotRowStep M col) none := by\n simp [findPivotRow, Std.Legacy.Range.forIn_eq_forIn_r... | [
{
"name": "isHomogeneousSolution_rref",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 10,
"n_lines": 8,
"n_chars": 300,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 10 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | @@ -82,10 +82,21 @@
rw [hstep] at h
exact List.mem_cons.mpr (Or.inr (ih h))
+theorem findPivotRow_eq_fold [Zero F] [BEq F]
+ (M : DenseMatrix F) (start col : Nat) :
+ findPivotRow M start col =
+ (List.range' start (M.rows - start)).foldl (findPivotRowStep M col) none := by
+ simp [findP... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5a1a2e1453b_17 | c99b3d1b1945f690 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefSemantics.lean | RrefSemantics | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 1 | [
{
"theorem_name": "findPivotRow_some_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [findPivotRow_eq_fold] at h\n have hb := findPivotRow_fold_get_ne_zero M col h\n intro hz\n simp [hz] at hb... | [
{
"name": "findPivotRow_fold_get_ne_zero",
"text": "theorem findPivotRow_fold_get_ne_zero [Zero F] [BEq F]\n (M : DenseMatrix F) (col : Nat) {xs : List Nat} {pivot : Nat}\n (h : xs.foldl (findPivotRowStep M col) none = some pivot) :\n (M.get pivot col == 0) = false := by\n induction xs with\n | n... | [
{
"name": "isHomogeneousSolution_of_rrefLoop_solution",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 11,
"n_lines": 46,
"n_chars": 2239,
"n_subproofs": 10,
"n_tactics": 39,
"cyclomatic": 3,
"n_automation": 5,
"n_rewrites": 2,
"n_structural": 9,
"automatio... | 11 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | @@ -82,6 +82,28 @@
rw [hstep] at h
exact List.mem_cons.mpr (Or.inr (ih h))
+theorem findPivotRow_fold_get_ne_zero [Zero F] [BEq F]
+ (M : DenseMatrix F) (col : Nat) {xs : List Nat} {pivot : Nat}
+ (h : xs.foldl (findPivotRowStep M col) none = some pivot) :
+ (M.get pivot col == 0) = false :... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_d5a1a2e1453b_18 | c19c5a05decfa32b | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/LinearAlgebra/Dense/RrefSemantics.lean | RrefSemantics | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 1 | [
{
"theorem_name": "findPivotRow_some_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [findPivotRow_eq_fold] at h\n have hb := findPivotRow_fold_get_ne_zero M col h\n intro hz\n simp [hz] at hb... | [
{
"name": "findPivotRow_fold_get_ne_zero",
"text": "theorem findPivotRow_fold_get_ne_zero [Zero F] [BEq F]\n (M : DenseMatrix F) (col : Nat) {xs : List Nat} {pivot : Nat}\n (h : xs.foldl (findPivotRowStep M col) none = some pivot) :\n (M.get pivot col == 0) = false := by\n induction xs with\n | n... | [
{
"name": "isHomogeneousSolution_of_rref",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 12,
"n_lines": 8,
"n_chars": 311,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 12 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.LinearAlgebra.Dense.RowOpsCorrectness
import Init.Data.List.Monadic
import Init.Data.Range.Lemmas
import Mathlib.Algebra.GroupWithZero.NeZero
... | @@ -82,6 +82,28 @@
rw [hstep] at h
exact List.mem_cons.mpr (Or.inr (ih h))
+theorem findPivotRow_fold_get_ne_zero [Zero F] [BEq F]
+ (M : DenseMatrix F) (col : Nat) {xs : List Nat} {pivot : Nat}
+ (h : xs.foldl (findPivotRowStep M col) none = some pivot) :
+ (M.get pivot col == 0) = false :... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_26c9e7e39411_0 | 81ff8a858017d97d | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Interpolation/LeeOSullivan/Correctness/Completeness.lean | Completeness | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "leeOSullivanPositiveInterpolate_complete_of_span",
"depth": 1,
"n_commands": 0,
"n_lines": 34,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let G := V.vanishingPolynomial (points.map fun point ↦ point.1)\n let R := CPolynomial.i... | [
{
"name": "leeOSullivanPositiveInterpolate_complete_of_row",
"text": "theorem leeOSullivanPositiveInterpolate_complete_of_row\n (V : CPolynomial.VanishingPolynomialContext F)\n (E : CPolynomial.BatchEvalContext F)\n (reducer : ShiftedRowReducerContext F)\n {points : Array (F × F)} {params : GSIn... | [
{
"name": "leeOSullivanPositiveInterpolate_complete_of_span",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 49,
"n_chars": 2362,
"n_subproofs": 6,
"n_tactics": 32,
"cyclomatic": 3,
"n_automation": 5,
"n_rewrites": 0,
"n_structural": 4,
"autom... | 1 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.LeeOSullivan.Correctness.Divisibility
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.LeeOSulliv... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.LeeOSullivan.Correctness.Divisibility
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.LeeOSulliv... | @@ -23,6 +23,99 @@
variable {F : Type*} [Field F] [BEq F] [LawfulBEq F] [DecidableEq F]
+theorem leeOSullivanPositiveInterpolate_complete_of_row
+ (V : CPolynomial.VanishingPolynomialContext F)
+ (E : CPolynomial.BatchEvalContext F)
+ (reducer : ShiftedRowReducerContext F)
+ {points : Array (F × F)} {p... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_26c9e7e39411_2 | 91c9133c2bc239cc | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Bivariate/GuruswamiSudan/Interpolation/LeeOSullivan/Correctness/Completeness.lean | Completeness | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "leeOSullivanBasisSpanContains_of_multiplicity_yDegree_le",
"depth": 1,
"n_commands": 0,
"n_lines": 66,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let G := V.vanishingPolynomial (points.map fun point ↦ point.1)\n let basis := l... | [
{
"name": "koetterBasisSpanContains_zero",
"text": "private theorem koetterBasisSpanContains_zero (basis : Array (CBivariate F)) :\n koetterBasisSpanContains basis 0 := by\n refine ⟨fun _ ↦ 0, ?_⟩\n exact koetterBasisCombination_eq_zero_of_weights_zero (fun _ ↦ 0) basis\n (by intro idx hidx; rfl)\n\... | [
{
"name": "leeOSullivanBasisSpanContains_of_multiplicity_yDegree_le",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 80,
"n_chars": 3674,
"n_subproofs": 15,
"n_tactics": 66,
"cyclomatic": 5,
"n_automation": 11,
"n_rewrites": 5,
"n_structural": 14,... | 4 | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.LeeOSullivan.Correctness.Divisibility
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.LeeOSulliv... | /-
Copyright (c) 2026 CompPoly Contributors. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Valerii Huhnin
-/
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.LeeOSullivan.Correctness.Divisibility
import CompPoly.Bivariate.GuruswamiSudan.Interpolation.LeeOSulliv... | @@ -276,6 +276,13 @@
exact ⟨hcoeffIdx, hhigher,
satisfiesMultiplicityConstraints_sub hmult htermMult, htermSpan⟩
+private theorem koetterBasisSpanContains_zero (basis : Array (CBivariate F)) :
+ koetterBasisSpanContains basis 0 := by
+ refine ⟨fun _ ↦ 0, ?_⟩
+ exact koetterBasisCombination_eq_zero_of... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_b72370ded937_0 | a96c39babaffd1d3 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Lagrange.lean | Lagrange | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "toPoly_basisListRaw",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction l with\n | nil =>\n show (Raw.C 1).toPoly = (1 : Polynomial R)\n rw [Raw.toPoly_C, Polynomial.C_1... | [
{
"name": "cbasisDivisor_eq_basisDivisor",
"text": "lemma cbasisDivisor_eq_basisDivisor {xᵢ xⱼ : R} :\n (basisDivisor xᵢ xⱼ).toPoly = Lagrange.basisDivisor xᵢ xⱼ := by\n unfold basisDivisor Lagrange.basisDivisor\n simp only [toPoly_mul, C_toPoly, toPoly_sub, X_toPoly]\n\n/-! ### Helpers for deferred-tr... | [
{
"name": "toPoly_basisListRaw",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 879,
"n_subproofs": 2,
"n_tactics": 14,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 5,
"n_structural": 2,
"automation_only": false,
"max_n... | 1 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen, Katerina Hristova, Julian Sutherland
-/
import Mathlib.LinearAlgebra.Lagrange
import CompPoly.Univariate.Basic
import CompPoly.Univariate.ToP... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen, Katerina Hristova, Julian Sutherland
-/
import Mathlib.LinearAlgebra.Lagrange
import CompPoly.Univariate.Basic
import CompPoly.Univariate.ToP... | @@ -27,6 +27,20 @@
def basisDivisor (xᵢ xⱼ : R) : CPolynomial R :=
C (xᵢ - xⱼ)⁻¹ * (X - C xⱼ)
+lemma cbasisDivisor_eq_basisDivisor {xᵢ xⱼ : R} :
+ (basisDivisor xᵢ xⱼ).toPoly = Lagrange.basisDivisor xᵢ xⱼ := by
+ unfold basisDivisor Lagrange.basisDivisor
+ simp only [toPoly_mul, C_toPoly, toPoly_sub, X_toPol... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_b72370ded937_1 | c59633f02ed26178 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Lagrange.lean | Lagrange | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "basisListRaw_trim_perm",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Raw.Trim.isCanonical_ext (Raw.Trim.isCanonical_trim _) (Raw.Trim.isCanonical_trim _)\n intro k\n rw [Raw.Tri... | [
{
"name": "toPoly_basisListRaw",
"text": "private lemma toPoly_basisListRaw {ι : Type*} (x : ι → R) (i : ι) (l : List ι) :\n (basisListRaw x i l).toPoly =\n (l.map (fun j => Lagrange.basisDivisor (x i) (x j))).prod := by\n induction l with\n | nil =>\n show (Raw.C 1).toPoly = (1 : Polynomial ... | [
{
"name": "basisListRaw_trim_perm",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 522,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"max... | 2 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen, Katerina Hristova, Julian Sutherland
-/
import Mathlib.LinearAlgebra.Lagrange
import CompPoly.Univariate.Basic
import CompPoly.Univariate.ToP... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen, Katerina Hristova, Julian Sutherland
-/
import Mathlib.LinearAlgebra.Lagrange
import CompPoly.Univariate.Basic
import CompPoly.Univariate.ToP... | @@ -47,9 +47,32 @@
CPolynomial.Raw R :=
l.foldr (fun j acc => Raw.mulRaw (basisDivisor (x i) (x j)).val acc) (Raw.C 1)
+private lemma toPoly_basisListRaw {ι : Type*} (x : ι → R) (i : ι) (l : List ι) :
+ (basisListRaw x i l).toPoly =
+ (l.map (fun j => Lagrange.basisDivisor (x i) (x j))).prod := by
+ ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_b72370ded937_2 | 3c4cfa284335ff7b | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Lagrange.lean | Lagrange | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "toPoly_interpolateListRaw",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction l with\n | nil =>\n show (Raw.mk #[] : CPolynomial.Raw R).toPoly = 0\n change (0 : CPolynom... | [
{
"name": "cbasis_eq_basis",
"text": "lemma cbasis_eq_basis {ι : Type*} [DecidableEq ι] (s : Finset ι) (x : ι → R) (i : ι) :\n (basis s x i).toPoly = Lagrange.basis s x i := by\n obtain ⟨l, hl⟩ := Quotient.exists_rep (s.erase i).val\n have hbasis : basis s x i =\n ⟨(basisListRaw x i l).trim, Raw.T... | [
{
"name": "toPoly_interpolateListRaw",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 23,
"n_chars": 993,
"n_subproofs": 1,
"n_tactics": 18,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 9,
"n_structural": 3,
"automation_only": false,
... | 3 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen, Katerina Hristova, Julian Sutherland
-/
import Mathlib.LinearAlgebra.Lagrange
import CompPoly.Univariate.Basic
import CompPoly.Univariate.ToP... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen, Katerina Hristova, Julian Sutherland
-/
import Mathlib.LinearAlgebra.Lagrange
import CompPoly.Univariate.Basic
import CompPoly.Univariate.ToP... | @@ -87,6 +87,26 @@
(fun l => ⟨(basisListRaw x i l).trim, Raw.Trim.isCanonical_trim _⟩)
(fun _ _ h => Subtype.ext (basisListRaw_trim_perm x i h))
+lemma cbasis_eq_basis {ι : Type*} [DecidableEq ι] (s : Finset ι) (x : ι → R) (i : ι) :
+ (basis s x i).toPoly = Lagrange.basis s x i := by
+ obtain ⟨l, hl⟩ :=... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_b72370ded937_3 | 2166ebbf303f122a | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Lagrange.lean | Lagrange | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "interpolateListRaw_trim_perm",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Raw.Trim.isCanonical_ext (Raw.Trim.isCanonical_trim _) (Raw.Trim.isCanonical_trim _)\n intro k\n rw [R... | [
{
"name": "toPoly_interpolateListRaw",
"text": "private lemma toPoly_interpolateListRaw {ι : Type*} [DecidableEq ι]\n (s : Finset ι) (x : ι → R) (y : ι → R) (l : List ι) :\n (interpolateListRaw s x y l).toPoly =\n (l.map (fun i => Polynomial.C (y i) * Lagrange.basis s x i)).sum := by\n induction... | [
{
"name": "interpolateListRaw_trim_perm",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 11,
"n_chars": 594,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
... | 4 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen, Katerina Hristova, Julian Sutherland
-/
import Mathlib.LinearAlgebra.Lagrange
import CompPoly.Univariate.Basic
import CompPoly.Univariate.ToP... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen, Katerina Hristova, Julian Sutherland
-/
import Mathlib.LinearAlgebra.Lagrange
import CompPoly.Univariate.Basic
import CompPoly.Univariate.ToP... | @@ -113,9 +113,37 @@
(fun i acc => Raw.addRaw (Raw.mulRaw (Raw.C (y i)) (basis s x i).val) acc)
(Raw.mk #[])
+private lemma toPoly_interpolateListRaw {ι : Type*} [DecidableEq ι]
+ (s : Finset ι) (x : ι → R) (y : ι → R) (l : List ι) :
+ (interpolateListRaw s x y l).toPoly =
+ (l.map (fun i => Poly... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_b72370ded937_4 | c23278a42082b65d | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Lagrange.lean | Lagrange | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "interpolateListRaw_trim_perm",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply Raw.Trim.isCanonical_ext (Raw.Trim.isCanonical_trim _) (Raw.Trim.isCanonical_trim _)\n intro k\n rw [R... | [
{
"name": "toPoly_interpolateListRaw",
"text": "private lemma toPoly_interpolateListRaw {ι : Type*} [DecidableEq ι]\n (s : Finset ι) (x : ι → R) (y : ι → R) (l : List ι) :\n (interpolateListRaw s x y l).toPoly =\n (l.map (fun i => Polynomial.C (y i) * Lagrange.basis s x i)).sum := by\n induction... | [
{
"name": "cinterpolate_eq_interpolate",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 7,
"n_chars": 283,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 5 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen, Katerina Hristova, Julian Sutherland
-/
import Mathlib.LinearAlgebra.Lagrange
import CompPoly.Univariate.Basic
import CompPoly.Univariate.ToP... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen, Katerina Hristova, Julian Sutherland
-/
import Mathlib.LinearAlgebra.Lagrange
import CompPoly.Univariate.Basic
import CompPoly.Univariate.ToP... | @@ -113,9 +113,37 @@
(fun i acc => Raw.addRaw (Raw.mulRaw (Raw.C (y i)) (basis s x i).val) acc)
(Raw.mk #[])
+private lemma toPoly_interpolateListRaw {ι : Type*} [DecidableEq ι]
+ (s : Finset ι) (x : ι → R) (y : ι → R) (l : List ι) :
+ (interpolateListRaw s x y l).toPoly =
+ (l.map (fun i => Poly... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_b72370ded937_5 | b14c25758fa9f974 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/Lagrange.lean | Lagrange | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "interpolateRaw_eq_sum",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply CPolynomial.ext\n apply Raw.Trim.isCanonical_ext (interpolateRaw s x y).property\n (∑ i ∈ s, C (y i) * bas... | [
{
"name": "toPoly_interpolateRaw",
"text": "private lemma toPoly_interpolateRaw {ι : Type*} [DecidableEq ι]\n {s : Finset ι} {x : ι → R} {y : ι → R} :\n (interpolateRaw s x y).toPoly =\n ∑ i ∈ s, Polynomial.C (y i) * Lagrange.basis s x i := by\n obtain ⟨l, hl⟩ := Quotient.exists_rep s.val\n hav... | [
{
"name": "eval_interpolatePow_at_node",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 28,
"n_chars": 863,
"n_subproofs": 4,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 5,
"automation_only": false,
... | 7 | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen, Katerina Hristova, Julian Sutherland
-/
import Mathlib.LinearAlgebra.Lagrange
import CompPoly.Univariate.Basic
import CompPoly.Univariate.ToP... | /-
Copyright (c) 2025 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Quang Dao, Gregor Mitscha-Baude, Derek Sorensen, Katerina Hristova, Julian Sutherland
-/
import Mathlib.LinearAlgebra.Lagrange
import CompPoly.Univariate.Basic
import CompPoly.Univariate.ToP... | @@ -153,9 +153,36 @@
(fun l => ⟨(interpolateListRaw s x y l).trim, Raw.Trim.isCanonical_trim _⟩)
(fun _ _ h => Subtype.ext (interpolateListRaw_trim_perm s x y h))
+private lemma toPoly_interpolateRaw {ι : Type*} [DecidableEq ι]
+ {s : Finset ι} {x : ι → R} {y : ι → R} :
+ (interpolateRaw s x y).toPoly... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_72213d59b68c_0 | 7b4e5e1cffacb651 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTT/Forward.lean | Forward | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 37 | 1 | [
{
"theorem_name": "omega_pow_add_domain_mul",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [pow_add, omega_pow_domain_mul D k, mul_one]",
"n_chars": 53,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "omega_pow_domain_mul",
"text": "private theorem omega_pow_domain_mul (D : Domain R) (k : Nat) :\n D.omega ^ (D.n * k) = 1 := by\n have h : D.omega ^ D.n = 1 := by\n simpa [Domain.n] using D.primitive.pow_eq_one\n rw [pow_mul, h, one_pow]\n\n",
"fan_in": 1,
"n_lines": 7,
"n_cha... | [
{
"name": "omega_pow_add_domain_mul",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 169,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"ma... | 1 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Salih Erdem Koçak, Doran Pamukçu
-/
import CompPoly.Univariate.NTT.Transform
/-!
# Forward NTT
This file provides spec-level forward NTT definitions together with an
iterative radix-2 impl... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Salih Erdem Koçak, Doran Pamukçu
-/
import CompPoly.Univariate.NTT.Transform
/-!
# Forward NTT
This file provides spec-level forward NTT definitions together with an
iterative radix-2 impl... | @@ -149,8 +149,15 @@
rw [size_butterflyStageSpec]
exact ih
+private theorem omega_pow_domain_mul (D : Domain R) (k : Nat) :
+ D.omega ^ (D.n * k) = 1 := by
+ have h : D.omega ^ D.n = 1 := by
+ simpa [Domain.n] using D.primitive.pow_eq_one
+ rw [pow_mul, h, one_pow]
+
private theorem omega_pow_a... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_72213d59b68c_1 | 1b091b332adf0fc3 | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTT/Forward.lean | Forward | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 37 | 4 | [
{
"theorem_name": "forwardMathPairsSpec_get_lower_current",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [forwardMathPairsSpec, forwardMathValueAt,\n butterfly_lower_div_block stage block j hj,\n ... | [
{
"name": "butterfly_lower_mod_half",
"text": "private theorem butterfly_lower_mod_half (stage block j : Nat) (hj : j < 2 ^ stage) :\n (block * 2 ^ (stage + 1) + j) % 2 ^ stage = j := by\n rw [show block * 2 ^ (stage + 1) + j = (block * 2) * 2 ^ stage + j by\n rw [pow_succ]\n ring]\n rw [Nat.mul_... | [
{
"name": "forwardMathPairsSpec_get_lower_current",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 513,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only":... | 2 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Salih Erdem Koçak, Doran Pamukçu
-/
import CompPoly.Univariate.NTT.Transform
/-!
# Forward NTT
This file provides spec-level forward NTT definitions together with an
iterative radix-2 impl... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Salih Erdem Koçak, Doran Pamukçu
-/
import CompPoly.Univariate.NTT.Transform
/-!
# Forward NTT
This file provides spec-level forward NTT definitions together with an
iterative radix-2 impl... | @@ -157,11 +157,22 @@
Nat.lt_trans hj (Nat.pow_lt_pow_right (by omega) (Nat.lt_succ_self stage))
rw [Nat.div_eq_of_lt hlt, add_zero]
+private theorem butterfly_lower_mod_half (stage block j : Nat) (hj : j < 2 ^ stage) :
+ (block * 2 ^ (stage + 1) + j) % 2 ^ stage = j := by
+ rw [show block * 2 ^ (stage + ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_72213d59b68c_2 | d7da0db2309951ca | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTT/Forward.lean | Forward | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 37 | 4 | [
{
"theorem_name": "forwardMathPairsSpec_get_upper_current",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [forwardMathPairsSpec, forwardMathValueAt,\n butterfly_upper_div_block stage block j hj,\n ... | [
{
"name": "butterfly_upper_mod_half",
"text": "private theorem butterfly_upper_mod_half (stage block j : Nat) (hj : j < 2 ^ stage) :\n (block * 2 ^ (stage + 1) + j + 2 ^ stage) % 2 ^ stage = j := by\n rw [show block * 2 ^ (stage + 1) + j + 2 ^ stage =\n (block * 2 + 1) * 2 ^ stage + j by\n rw [p... | [
{
"name": "forwardMathPairsSpec_get_upper_current",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 555,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only":... | 2 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Salih Erdem Koçak, Doran Pamukçu
-/
import CompPoly.Univariate.NTT.Transform
/-!
# Forward NTT
This file provides spec-level forward NTT definitions together with an
iterative radix-2 impl... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Salih Erdem Koçak, Doran Pamukçu
-/
import CompPoly.Univariate.NTT.Transform
/-!
# Forward NTT
This file provides spec-level forward NTT definitions together with an
iterative radix-2 impl... | @@ -160,12 +160,24 @@
omega
rw [Nat.div_eq_of_lt hlt, add_zero]
+private theorem butterfly_upper_mod_half (stage block j : Nat) (hj : j < 2 ^ stage) :
+ (block * 2 ^ (stage + 1) + j + 2 ^ stage) % 2 ^ stage = j := by
+ rw [show block * 2 ^ (stage + 1) + j + 2 ^ stage =
+ (block * 2 + 1) * 2 ^ stage +... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
ablate_72213d59b68c_3 | b0fbe54a5eccffdc | lean | lean | github.com/Verified-zkEVM/CompPoly | e95ba1b1cac21ac3e980725abcfb2a0c707d1062 | CompPoly/Univariate/NTT/Forward.lean | Forward | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 37 | 4 | [
{
"theorem_name": "forwardMathPairsSpec_get_lower_current",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [forwardMathPairsSpec, forwardMathValueAt,\n butterfly_lower_div_block stage block j hj,\n ... | [
{
"name": "butterfly_lower_mod_half",
"text": "private theorem butterfly_lower_mod_half (stage block j : Nat) (hj : j < 2 ^ stage) :\n (block * 2 ^ (stage + 1) + j) % 2 ^ stage = j := by\n rw [show block * 2 ^ (stage + 1) + j = (block * 2) * 2 ^ stage + j by\n rw [pow_succ]\n ring]\n rw [Nat.mul_... | [
{
"name": "forwardMathPairsSpec_get_lower_next",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 528,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": tr... | 2 | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Salih Erdem Koçak, Doran Pamukçu
-/
import CompPoly.Univariate.NTT.Transform
/-!
# Forward NTT
This file provides spec-level forward NTT definitions together with an
iterative radix-2 impl... | /-
Copyright (c) 2026 CompPoly. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Salih Erdem Koçak, Doran Pamukçu
-/
import CompPoly.Univariate.NTT.Transform
/-!
# Forward NTT
This file provides spec-level forward NTT definitions together with an
iterative radix-2 impl... | @@ -157,11 +157,22 @@
Nat.lt_trans hj (Nat.pow_lt_pow_right (by omega) (Nat.lt_succ_self stage))
rw [Nat.div_eq_of_lt hlt, add_zero]
+private theorem butterfly_lower_mod_half (stage block j : Nat) (hj : j < 2 ^ stage) :
+ (block * 2 ^ (stage + 1) + j) % 2 ^ stage = j := by
+ rw [show block * 2 ^ (stage + ... | {
"repo": "CompPoly",
"git_repo": "github.com/Verified-zkEVM/CompPoly",
"revision": "e95ba1b1cac21ac3e980725abcfb2a0c707d1062",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-dele... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.