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_27d4e1c88bfd_1 | 65fe762080b8eba6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN4.lean | LoopIterN4 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "divK_loop_body_n4_max_skip_j0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 79,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hborrow\n rw [loopBodyN4MaxSkipJ0Pre_unfold, loopBodyN4MaxSkipJ0Post_unfold]\n let uBase... | [
{
"name": "loopBodyN4MaxSkipJ0Post_unfold",
"text": "theorem loopBodyN4MaxSkipJ0Post_unfold\n (sp v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :\n loopBodyN4MaxSkipJ0Post sp v0 v1 v2 v3 u0 u1 u2 u3 uTop =\n loopBodyN4SkipPost sp (0 : Word) (signExtend12 4095 : Word)\n v0 v1 v2 v3 u0 u1 u2 u3 uTop ... | [
{
"name": "divK_loop_body_n4_max_skip_j0_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 84,
"n_chars": 4291,
"n_subproofs": 7,
"n_tactics": 79,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 7,
"n_structural": 2,
"automa... | 2 | /-
EvmAsm.Evm64.DivMod.LoopIterN4
Loop body cpsTripleWithin specs for n=4 at j=0.
These are the j=0-specialized versions of the LoopBodyN4 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
-/
import EvmAsm.Ev... | /-
EvmAsm.Evm64.DivMod.LoopIterN4
Loop body cpsTripleWithin specs for n=4 at j=0.
These are the j=0-specialized versions of the LoopBodyN4 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
-/
import EvmAsm.Ev... | @@ -60,6 +60,18 @@
loopBodyN4SkipPost sp (0 : Word) (signExtend12 4095 : Word)
v0 v1 v2 v3 u0 u1 u2 u3 uTop
+theorem loopBodyN4MaxSkipJ0Post_unfold
+ (sp v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :
+ loopBodyN4MaxSkipJ0Post sp v0 v1 v2 v3 u0 u1 u2 u3 uTop =
+ loopBodyN4SkipPost sp (0 : Word) (signExtend... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_27d4e1c88bfd_2 | e58c4c5de1c145bf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN4.lean | LoopIterN4 | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "divK_loop_body_n4_call_skip_j0_spec_within_bundled",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_weaken\n (fun _ hp => by rw [loopBodyN4CallSkipJ0Pre_unfold] at hp; exac... | [
{
"name": "loopBodyN4CallSkipJ0Post_unfold",
"text": "/-- Named unfold for `loopBodyN4CallSkipJ0Post`. -/\ntheorem loopBodyN4CallSkipJ0Post_unfold\n (sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :\n loopBodyN4CallSkipJ0Post sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop =\n (let qHat := div128Quot uTop u3 v3... | [
{
"name": "divK_loop_body_n4_call_skip_j0_spec_within_bundled",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 24,
"n_chars": 1335,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 2,
"auto... | 3 | /-
EvmAsm.Evm64.DivMod.LoopIterN4
Loop body cpsTripleWithin specs for n=4 at j=0.
These are the j=0-specialized versions of the LoopBodyN4 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
-/
import EvmAsm.Ev... | /-
EvmAsm.Evm64.DivMod.LoopIterN4
Loop body cpsTripleWithin specs for n=4 at j=0.
These are the j=0-specialized versions of the LoopBodyN4 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
-/
import EvmAsm.Ev... | @@ -244,6 +244,20 @@
(sp + signExtend12 3952 ↦ₘ dLo) **
(sp + signExtend12 3944 ↦ₘ div_un0) ** regOwn .x1
+/-- Named unfold for `loopBodyN4CallSkipJ0Post`. -/
+theorem loopBodyN4CallSkipJ0Post_unfold
+ (sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :
+ loopBodyN4CallSkipJ0Post sp base v0 v1 v2 v3 u0 u1 u2 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_27d4e1c88bfd_3 | cd7681028473d7ac | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN4.lean | LoopIterN4 | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "divK_loop_body_n4_call_skip_j0_spec_within_bundled",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_weaken\n (fun _ hp => by rw [loopBodyN4CallSkipJ0Pre_unfold] at hp; exac... | [
{
"name": "loopBodyN4CallSkipJ0Post_unfold",
"text": "/-- Named unfold for `loopBodyN4CallSkipJ0Post`. -/\ntheorem loopBodyN4CallSkipJ0Post_unfold\n (sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :\n loopBodyN4CallSkipJ0Post sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop =\n (let qHat := div128Quot uTop u3 v3... | [
{
"name": "divK_loop_body_n4_call_skip_j0_spec_within_noNop_bundled",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 24,
"n_chars": 1350,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 2,
... | 3 | /-
EvmAsm.Evm64.DivMod.LoopIterN4
Loop body cpsTripleWithin specs for n=4 at j=0.
These are the j=0-specialized versions of the LoopBodyN4 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
-/
import EvmAsm.Ev... | /-
EvmAsm.Evm64.DivMod.LoopIterN4
Loop body cpsTripleWithin specs for n=4 at j=0.
These are the j=0-specialized versions of the LoopBodyN4 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
-/
import EvmAsm.Ev... | @@ -239,6 +239,20 @@
(sp + signExtend12 3952 ↦ₘ dLo) **
(sp + signExtend12 3944 ↦ₘ div_un0) ** regOwn .x1
+/-- Named unfold for `loopBodyN4CallSkipJ0Post`. -/
+theorem loopBodyN4CallSkipJ0Post_unfold
+ (sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :
+ loopBodyN4CallSkipJ0Post sp base v0 v1 v2 v3 u0 u1 u2 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_27d4e1c88bfd_4 | dbedd3622d62c1e5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN4.lean | LoopIterN4 | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "divK_loop_body_n4_call_addback_j0_beq_spec_within_bundled",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_weaken\n (fun _ hp => by rw [loopBodyN4CallSkipJ0Pre_unfold] at h... | [
{
"name": "loopBodyN4CallAddbackBeqJ0Post_unfold",
"text": "/-- Named unfold for `loopBodyN4CallAddbackBeqJ0Post`. -/\ntheorem loopBodyN4CallAddbackBeqJ0Post_unfold\n (sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :\n loopBodyN4CallAddbackBeqJ0Post sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop =\n (let qHat ... | [
{
"name": "divK_loop_body_n4_call_addback_j0_beq_spec_within_bundled",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 25,
"n_chars": 1453,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 2,
... | 3 | /-
EvmAsm.Evm64.DivMod.LoopIterN4
Loop body cpsTripleWithin specs for n=4 at j=0.
These are the j=0-specialized versions of the LoopBodyN4 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
-/
import EvmAsm.Ev... | /-
EvmAsm.Evm64.DivMod.LoopIterN4
Loop body cpsTripleWithin specs for n=4 at j=0.
These are the j=0-specialized versions of the LoopBodyN4 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
-/
import EvmAsm.Ev... | @@ -256,6 +256,25 @@
(sp + signExtend12 3952 ↦ₘ dLo) **
(sp + signExtend12 3944 ↦ₘ div_un0) ** regOwn .x1
+/-- Named unfold for `loopBodyN4CallAddbackBeqJ0Post`. -/
+theorem loopBodyN4CallAddbackBeqJ0Post_unfold
+ (sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :
+ loopBodyN4CallAddbackBeqJ0Post sp base v0 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_27d4e1c88bfd_5 | bbbced773138dfa2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN4.lean | LoopIterN4 | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "divK_loop_body_n4_call_addback_j0_beq_spec_within_bundled",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_weaken\n (fun _ hp => by rw [loopBodyN4CallSkipJ0Pre_unfold] at h... | [
{
"name": "loopBodyN4CallAddbackBeqJ0Post_unfold",
"text": "/-- Named unfold for `loopBodyN4CallAddbackBeqJ0Post`. -/\ntheorem loopBodyN4CallAddbackBeqJ0Post_unfold\n (sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :\n loopBodyN4CallAddbackBeqJ0Post sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop =\n (let qHat ... | [
{
"name": "divK_loop_body_n4_call_addback_j0_beq_spec_within_noNop_bundled",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 25,
"n_chars": 1468,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural":... | 3 | /-
EvmAsm.Evm64.DivMod.LoopIterN4
Loop body cpsTripleWithin specs for n=4 at j=0.
These are the j=0-specialized versions of the LoopBodyN4 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
-/
import EvmAsm.Ev... | /-
EvmAsm.Evm64.DivMod.LoopIterN4
Loop body cpsTripleWithin specs for n=4 at j=0.
These are the j=0-specialized versions of the LoopBodyN4 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
-/
import EvmAsm.Ev... | @@ -248,6 +248,25 @@
(sp + signExtend12 3952 ↦ₘ dLo) **
(sp + signExtend12 3944 ↦ₘ div_un0) ** regOwn .x1
+/-- Named unfold for `loopBodyN4CallAddbackBeqJ0Post`. -/
+theorem loopBodyN4CallAddbackBeqJ0Post_unfold
+ (sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :
+ loopBodyN4CallAddbackBeqJ0Post sp base v0 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a72c272b8017_0 | be6e87936250917b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutCall14.lean | ProductLayoutCall14 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_mulmod_product_layout_call14_code_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n CodeReq.union_sub (evm_mulmod_product_layout_call14_core_code_sub base)\n (by\n intro a i h\... | [
{
"name": "evm_mulmod_product_layout_call14_carry_code_sub",
"text": "/-- Carry-propagation code for layout call 14 is contained in `evm_mulmod_product_layout`. -/\ntheorem evm_mulmod_product_layout_call14_carry_code_sub (base : Word) :\n ∀ a i, (evm_mulmod_product_propagate_carry_code (base + 1684) [399... | [
{
"name": "evm_mulmod_product_layout_call14_code_sub",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 707,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 3,
"automation_onl... | 2 | /-
EvmAsm.Evm64.MulMod.ProductLayoutCall14
Product-layout call14 suffix composition for MULMOD.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall13
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
local macro "evm_mulmod_product_layout_slice_rfl" : tactic =>
`(tactic|
first
| rfl
... | /-
EvmAsm.Evm64.MulMod.ProductLayoutCall14
Product-layout call14 suffix composition for MULMOD.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall13
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
local macro "evm_mulmod_product_layout_slice_rfl" : tactic =>
`(tactic|
first
| rfl
... | @@ -35,12 +35,31 @@
· rw [evm_mulmod_product_layout_length]
decide
+/-- Carry-propagation code for layout call 14 is contained in `evm_mulmod_product_layout`. -/
+theorem evm_mulmod_product_layout_call14_carry_code_sub (base : Word) :
+ ∀ a i, (evm_mulmod_product_propagate_carry_code (base + 1684) [3992]) ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_eb11c84391aa_0 | 8ac415294a42e7ac | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/LoopSetupV5.lean | LoopSetupV5 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "blt_loopSetup_sub_divCode_noNop_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro a i h\n have hlookup := CodeReq.ofProg_lookup (base + loopSetupOff) (divK_loopSetup 464) 3\n (... | [
{
"name": "divK_loopSetup_code_sub_divCode_noNop_v5",
"text": "/-- The loop-setup block instructions are subsumed by `divCode_noNop_v5`. -/\nprivate theorem divK_loopSetup_code_sub_divCode_noNop_v5 {base : Word} :\n ∀ a i, (divK_loopSetup_code 464 (base + loopSetupOff)) a = some i →\n (divCode_noNop... | [
{
"name": "blt_loopSetup_sub_divCode_noNop_v5",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 597,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": fal... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.LoopSetupV5
v5 loop-setup brick: the BLT-not-taken fall-through into the loop body, over
`divCode_noNop_v5`. Mirror of `divK_loopSetup_ntaken_spec_within_v4_noNop`
(NormA.lean) — the loop-setup instructions do not touch div128, so the same
version-agnostic instruction bodies a... | /-
EvmAsm.Evm64.DivMod.Compose.LoopSetupV5
v5 loop-setup brick: the BLT-not-taken fall-through into the loop body, over
`divCode_noNop_v5`. Mirror of `divK_loopSetup_ntaken_spec_within_v4_noNop`
(NormA.lean) — the loop-setup instructions do not touch div128, so the same
version-agnostic instruction bodies a... | @@ -16,10 +16,23 @@
open EvmAsm.Rv64
+/-- The loop-setup block instructions are subsumed by `divCode_noNop_v5`. -/
+private theorem divK_loopSetup_code_sub_divCode_noNop_v5 {base : Word} :
+ ∀ a i, (divK_loopSetup_code 464 (base + loopSetupOff)) a = some i →
+ (divCode_noNop_v5 base) a = some i := by
+ in... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_eb11c84391aa_1 | 3faa37aefd68dbf7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/LoopSetupV5.lean | LoopSetupV5 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "blt_loopSetup_sub_divCode_noNop_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro a i h\n have hlookup := CodeReq.ofProg_lookup (base + loopSetupOff) (divK_loopSetup 464) 3\n (... | [
{
"name": "divK_loopSetup_code_sub_divCode_noNop_v5",
"text": "/-- The loop-setup block instructions are subsumed by `divCode_noNop_v5`. -/\nprivate theorem divK_loopSetup_code_sub_divCode_noNop_v5 {base : Word} :\n ∀ a i, (divK_loopSetup_code 464 (base + loopSetupOff)) a = some i →\n (divCode_noNop... | [
{
"name": "divK_loopSetup_ntaken_spec_within_v5_noNop",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 31,
"n_chars": 1748,
"n_subproofs": 8,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 4,
"automation_... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.LoopSetupV5
v5 loop-setup brick: the BLT-not-taken fall-through into the loop body, over
`divCode_noNop_v5`. Mirror of `divK_loopSetup_ntaken_spec_within_v4_noNop`
(NormA.lean) — the loop-setup instructions do not touch div128, so the same
version-agnostic instruction bodies a... | /-
EvmAsm.Evm64.DivMod.Compose.LoopSetupV5
v5 loop-setup brick: the BLT-not-taken fall-through into the loop body, over
`divCode_noNop_v5`. Mirror of `divK_loopSetup_ntaken_spec_within_v4_noNop`
(NormA.lean) — the loop-setup instructions do not touch div128, so the same
version-agnostic instruction bodies a... | @@ -16,10 +16,23 @@
open EvmAsm.Rv64
+/-- The loop-setup block instructions are subsumed by `divCode_noNop_v5`. -/
+private theorem divK_loopSetup_code_sub_divCode_noNop_v5 {base : Word} :
+ ∀ a i, (divK_loopSetup_code 464 (base + loopSetupOff)) a = some i →
+ (divCode_noNop_v5 base) a = some i := by
+ in... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a2e9fe6d0ac2_0 | e406ac078328a271 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Byte/LimbSpec.lean | LimbSpec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 5 | [
{
"theorem_name": "byte_pc_sub_0",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n byte_pc_instr_sub base base _ 0 (by decide) (by bv_omega) (by decide)",
"n_chars": 72,
"n_subproofs": 0,
"n_tactics"... | [
{
"name": "byte_pc_instr_sub",
"text": "/-- Each singleton instruction in byte_phase_c is subsumed by the full program CodeReq. -/\nprivate theorem byte_pc_instr_sub (base addr : Word) (instr : Instr) (k : Nat)\n (hk : k < byte_phase_c.length)\n (h_addr : addr = base + BitVec.ofNat 64 (4 * k))\n (h... | [
{
"name": "byte_pc_sub_0",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 233,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": ... | 1 | /-
EvmAsm.Evm64.Byte.LimbSpec
CPS specifications for the 256-bit EVM BYTE program (64-bit).
Modular decomposition:
- Phase B: byte_phase_b_spec (5 instrs): compute bit_shift and limbFromMsb
- body_3: extract from limb 0 at sp+32, JAL to store (4 instrs)
- body_2: extract from limb 1 at sp+40, JAL to store ... | /-
EvmAsm.Evm64.Byte.LimbSpec
CPS specifications for the 256-bit EVM BYTE program (64-bit).
Modular decomposition:
- Phase B: byte_phase_b_spec (5 instrs): compute bit_shift and limbFromMsb
- body_3: extract from limb 0 at sp+32, JAL to store (4 instrs)
- body_2: extract from limb 1 at sp+40, JAL to store ... | @@ -56,9 +56,20 @@
abbrev byte_phase_c_code (base : Word) : CodeReq :=
CodeReq.ofProg base byte_phase_c
+/-- Each singleton instruction in byte_phase_c is subsumed by the full program CodeReq. -/
+private theorem byte_pc_instr_sub (base addr : Word) (instr : Instr) (k : Nat)
+ (hk : k < byte_phase_c.length)
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a2e9fe6d0ac2_1 | cf86c5ba8f7f8733 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Byte/LimbSpec.lean | LimbSpec | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 5 | [
{
"theorem_name": "byte_pc_sub_0",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n byte_pc_instr_sub base base _ 0 (by decide) (by bv_omega) (by decide)",
"n_chars": 72,
"n_subproofs": 0,
"n_tactics"... | [
{
"name": "byte_pc_instr_sub",
"text": "/-- Each singleton instruction in byte_phase_c is subsumed by the full program CodeReq. -/\nprivate theorem byte_pc_instr_sub (base addr : Word) (instr : Instr) (k : Nat)\n (hk : k < byte_phase_c.length)\n (h_addr : addr = base + BitVec.ofNat 64 (4 * k))\n (h... | [
{
"name": "byte_pc_sub_1",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 246,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": ... | 1 | /-
EvmAsm.Evm64.Byte.LimbSpec
CPS specifications for the 256-bit EVM BYTE program (64-bit).
Modular decomposition:
- Phase B: byte_phase_b_spec (5 instrs): compute bit_shift and limbFromMsb
- body_3: extract from limb 0 at sp+32, JAL to store (4 instrs)
- body_2: extract from limb 1 at sp+40, JAL to store ... | /-
EvmAsm.Evm64.Byte.LimbSpec
CPS specifications for the 256-bit EVM BYTE program (64-bit).
Modular decomposition:
- Phase B: byte_phase_b_spec (5 instrs): compute bit_shift and limbFromMsb
- body_3: extract from limb 0 at sp+32, JAL to store (4 instrs)
- body_2: extract from limb 1 at sp+40, JAL to store ... | @@ -56,9 +56,20 @@
abbrev byte_phase_c_code (base : Word) : CodeReq :=
CodeReq.ofProg base byte_phase_c
+/-- Each singleton instruction in byte_phase_c is subsumed by the full program CodeReq. -/
+private theorem byte_pc_instr_sub (base addr : Word) (instr : Instr) (k : Nat)
+ (hk : k < byte_phase_c.length)
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a2e9fe6d0ac2_2 | 4a8ae19a35c741a0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Byte/LimbSpec.lean | LimbSpec | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 5 | [
{
"theorem_name": "byte_pc_sub_0",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n byte_pc_instr_sub base base _ 0 (by decide) (by bv_omega) (by decide)",
"n_chars": 72,
"n_subproofs": 0,
"n_tactics"... | [
{
"name": "byte_pc_instr_sub",
"text": "/-- Each singleton instruction in byte_phase_c is subsumed by the full program CodeReq. -/\nprivate theorem byte_pc_instr_sub (base addr : Word) (instr : Instr) (k : Nat)\n (hk : k < byte_phase_c.length)\n (h_addr : addr = base + BitVec.ofNat 64 (4 * k))\n (h... | [
{
"name": "byte_pc_sub_2",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 246,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": ... | 1 | /-
EvmAsm.Evm64.Byte.LimbSpec
CPS specifications for the 256-bit EVM BYTE program (64-bit).
Modular decomposition:
- Phase B: byte_phase_b_spec (5 instrs): compute bit_shift and limbFromMsb
- body_3: extract from limb 0 at sp+32, JAL to store (4 instrs)
- body_2: extract from limb 1 at sp+40, JAL to store ... | /-
EvmAsm.Evm64.Byte.LimbSpec
CPS specifications for the 256-bit EVM BYTE program (64-bit).
Modular decomposition:
- Phase B: byte_phase_b_spec (5 instrs): compute bit_shift and limbFromMsb
- body_3: extract from limb 0 at sp+32, JAL to store (4 instrs)
- body_2: extract from limb 1 at sp+40, JAL to store ... | @@ -56,9 +56,20 @@
abbrev byte_phase_c_code (base : Word) : CodeReq :=
CodeReq.ofProg base byte_phase_c
+/-- Each singleton instruction in byte_phase_c is subsumed by the full program CodeReq. -/
+private theorem byte_pc_instr_sub (base addr : Word) (instr : Instr) (k : Nat)
+ (hk : k < byte_phase_c.length)
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a2e9fe6d0ac2_3 | a12b0d98b1e2cf3a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Byte/LimbSpec.lean | LimbSpec | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 5 | [
{
"theorem_name": "byte_pc_sub_0",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n byte_pc_instr_sub base base _ 0 (by decide) (by bv_omega) (by decide)",
"n_chars": 72,
"n_subproofs": 0,
"n_tactics"... | [
{
"name": "byte_pc_instr_sub",
"text": "/-- Each singleton instruction in byte_phase_c is subsumed by the full program CodeReq. -/\nprivate theorem byte_pc_instr_sub (base addr : Word) (instr : Instr) (k : Nat)\n (hk : k < byte_phase_c.length)\n (h_addr : addr = base + BitVec.ofNat 64 (4 * k))\n (h... | [
{
"name": "byte_pc_sub_3",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 248,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": ... | 1 | /-
EvmAsm.Evm64.Byte.LimbSpec
CPS specifications for the 256-bit EVM BYTE program (64-bit).
Modular decomposition:
- Phase B: byte_phase_b_spec (5 instrs): compute bit_shift and limbFromMsb
- body_3: extract from limb 0 at sp+32, JAL to store (4 instrs)
- body_2: extract from limb 1 at sp+40, JAL to store ... | /-
EvmAsm.Evm64.Byte.LimbSpec
CPS specifications for the 256-bit EVM BYTE program (64-bit).
Modular decomposition:
- Phase B: byte_phase_b_spec (5 instrs): compute bit_shift and limbFromMsb
- body_3: extract from limb 0 at sp+32, JAL to store (4 instrs)
- body_2: extract from limb 1 at sp+40, JAL to store ... | @@ -56,9 +56,20 @@
abbrev byte_phase_c_code (base : Word) : CodeReq :=
CodeReq.ofProg base byte_phase_c
+/-- Each singleton instruction in byte_phase_c is subsumed by the full program CodeReq. -/
+private theorem byte_pc_instr_sub (base addr : Word) (instr : Instr) (k : Nat)
+ (hk : k < byte_phase_c.length)
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a2e9fe6d0ac2_4 | 39fd130829ef446b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Byte/LimbSpec.lean | LimbSpec | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 5 | [
{
"theorem_name": "byte_pc_sub_0",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n byte_pc_instr_sub base base _ 0 (by decide) (by bv_omega) (by decide)",
"n_chars": 72,
"n_subproofs": 0,
"n_tactics"... | [
{
"name": "byte_pc_instr_sub",
"text": "/-- Each singleton instruction in byte_phase_c is subsumed by the full program CodeReq. -/\nprivate theorem byte_pc_instr_sub (base addr : Word) (instr : Instr) (k : Nat)\n (hk : k < byte_phase_c.length)\n (h_addr : addr = base + BitVec.ofNat 64 (4 * k))\n (h... | [
{
"name": "byte_pc_sub_4",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 248,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": ... | 1 | /-
EvmAsm.Evm64.Byte.LimbSpec
CPS specifications for the 256-bit EVM BYTE program (64-bit).
Modular decomposition:
- Phase B: byte_phase_b_spec (5 instrs): compute bit_shift and limbFromMsb
- body_3: extract from limb 0 at sp+32, JAL to store (4 instrs)
- body_2: extract from limb 1 at sp+40, JAL to store ... | /-
EvmAsm.Evm64.Byte.LimbSpec
CPS specifications for the 256-bit EVM BYTE program (64-bit).
Modular decomposition:
- Phase B: byte_phase_b_spec (5 instrs): compute bit_shift and limbFromMsb
- body_3: extract from limb 0 at sp+32, JAL to store (4 instrs)
- body_2: extract from limb 1 at sp+40, JAL to store ... | @@ -56,9 +56,20 @@
abbrev byte_phase_c_code (base : Word) : CodeReq :=
CodeReq.ofProg base byte_phase_c
+/-- Each singleton instruction in byte_phase_c is subsumed by the full program CodeReq. -/
+private theorem byte_pc_instr_sub (base addr : Word) (instr : Instr) (k : Nat)
+ (hk : k < byte_phase_c.length)
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a2e9fe6d0ac2_5 | 0041a0dd14134971 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Byte/LimbSpec.lean | LimbSpec | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "byte_phase_c_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 128,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro code\n let cr := byte_phase_c_code base\n -- Step 0: BEQ x5 x0 68 at base — extend to cr, frame with x10... | [
{
"name": "byte_pc_sub_3",
"text": "private theorem byte_pc_sub_3 {base : Word} :\n ∀ a i, CodeReq.singleton (base + 12) (.ADDI .x10 .x0 2) a = some i →\n (byte_phase_c_code base) a = some i :=\n byte_pc_instr_sub base (base + 12) _ 3 (by decide) (by bv_omega) (by decide)\n\n",
"fan_in": 1,
... | [
{
"name": "byte_phase_c_spec_within",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 6,
"n_lines": 146,
"n_chars": 9202,
"n_subproofs": 37,
"n_tactics": 104,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 11,
"n_structural": 6,
"automation_only": false,
... | 6 | /-
EvmAsm.Evm64.Byte.LimbSpec
CPS specifications for the 256-bit EVM BYTE program (64-bit).
Modular decomposition:
- Phase B: byte_phase_b_spec (5 instrs): compute bit_shift and limbFromMsb
- body_3: extract from limb 0 at sp+32, JAL to store (4 instrs)
- body_2: extract from limb 1 at sp+40, JAL to store ... | /-
EvmAsm.Evm64.Byte.LimbSpec
CPS specifications for the 256-bit EVM BYTE program (64-bit).
Modular decomposition:
- Phase B: byte_phase_b_spec (5 instrs): compute bit_shift and limbFromMsb
- body_3: extract from limb 0 at sp+32, JAL to store (4 instrs)
- body_2: extract from limb 1 at sp+40, JAL to store ... | @@ -81,6 +81,11 @@
(byte_phase_c_code base) a = some i :=
byte_pc_instr_sub base (base + 8) _ 2 (by decide) (by bv_omega) (by decide)
+private theorem byte_pc_sub_3 {base : Word} :
+ ∀ a i, CodeReq.singleton (base + 12) (.ADDI .x10 .x0 2) a = some i →
+ (byte_phase_c_code base) a = some i :=
+ byte... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_60c87d8b0bc5_0 | 2fb0883ea3c41505 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/ArithmeticHandlers.lean | ArithmeticHandlers | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "dispatchOpcode_arithmeticHandlerTable_ADD_status_of_some",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatchOpcode_arithmeticHandlerTable_ADD state]\n simp [addHandler, binaryHa... | [
{
"name": "dispatchOpcode_arithmeticHandlerTable_ADD",
"text": "theorem dispatchOpcode_arithmeticHandlerTable_ADD\n (state : EvmState) :\n HandlerTable.dispatchOpcode arithmeticHandlerTable .ADD state =\n addHandler state := by\n exact HandlerTable.dispatchOpcode_some arithmeticHandler?_ADD stat... | [
{
"name": "dispatchOpcode_arithmeticHandlerTable_ADD_status_of_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 410,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"... | 1 | /-
EvmAsm.Evm64.ArithmeticHandlers
Pure handler-table entries for basic arithmetic opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.EvmWordArith.SDiv
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
namespace ArithmeticHandlers
/-- Pure stack transform for binary arithmetic... | /-
EvmAsm.Evm64.ArithmeticHandlers
Pure handler-table entries for basic arithmetic opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.EvmWordArith.SDiv
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
namespace ArithmeticHandlers
/-- Pure stack transform for binary arithmetic... | @@ -131,11 +131,19 @@
smodHandler = handler ↔ handler = smodHandler := by
constructor <;> intro h_eq <;> exact h_eq.symm
+theorem dispatchOpcode_arithmeticHandlerTable_ADD
+ (state : EvmState) :
+ HandlerTable.dispatchOpcode arithmeticHandlerTable .ADD state =
+ addHandler state := by
+ exact Hand... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_60c87d8b0bc5_1 | 0e354653ad9616d2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/ArithmeticHandlers.lean | ArithmeticHandlers | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "dispatchOpcode_arithmeticHandlerTable_SUB_status_of_some",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatchOpcode_arithmeticHandlerTable_SUB state]\n simp [subHandler, binaryHa... | [
{
"name": "dispatchOpcode_arithmeticHandlerTable_SUB",
"text": "theorem dispatchOpcode_arithmeticHandlerTable_SUB\n (state : EvmState) :\n HandlerTable.dispatchOpcode arithmeticHandlerTable .SUB state =\n subHandler state := by\n exact HandlerTable.dispatchOpcode_some arithmeticHandler?_SUB stat... | [
{
"name": "dispatchOpcode_arithmeticHandlerTable_SUB_status_of_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 410,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"... | 1 | /-
EvmAsm.Evm64.ArithmeticHandlers
Pure handler-table entries for basic arithmetic opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.EvmWordArith.SDiv
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
namespace ArithmeticHandlers
/-- Pure stack transform for binary arithmetic... | /-
EvmAsm.Evm64.ArithmeticHandlers
Pure handler-table entries for basic arithmetic opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.EvmWordArith.SDiv
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
namespace ArithmeticHandlers
/-- Pure stack transform for binary arithmetic... | @@ -131,11 +131,19 @@
smodHandler = handler ↔ handler = smodHandler := by
constructor <;> intro h_eq <;> exact h_eq.symm
+theorem dispatchOpcode_arithmeticHandlerTable_SUB
+ (state : EvmState) :
+ HandlerTable.dispatchOpcode arithmeticHandlerTable .SUB state =
+ subHandler state := by
+ exact Hand... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_60c87d8b0bc5_2 | b89f4c1e5702aa2c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/ArithmeticHandlers.lean | ArithmeticHandlers | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "dispatchOpcode_arithmeticHandlerTable_MUL_status_of_some",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatchOpcode_arithmeticHandlerTable_MUL state]\n simp [mulHandler, binaryHa... | [
{
"name": "dispatchOpcode_arithmeticHandlerTable_MUL",
"text": "theorem dispatchOpcode_arithmeticHandlerTable_MUL\n (state : EvmState) :\n HandlerTable.dispatchOpcode arithmeticHandlerTable .MUL state =\n mulHandler state := by\n exact HandlerTable.dispatchOpcode_some arithmeticHandler?_MUL stat... | [
{
"name": "dispatchOpcode_arithmeticHandlerTable_MUL_status_of_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 410,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"... | 1 | /-
EvmAsm.Evm64.ArithmeticHandlers
Pure handler-table entries for basic arithmetic opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.EvmWordArith.SDiv
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
namespace ArithmeticHandlers
/-- Pure stack transform for binary arithmetic... | /-
EvmAsm.Evm64.ArithmeticHandlers
Pure handler-table entries for basic arithmetic opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.EvmWordArith.SDiv
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
namespace ArithmeticHandlers
/-- Pure stack transform for binary arithmetic... | @@ -131,11 +131,19 @@
smodHandler = handler ↔ handler = smodHandler := by
constructor <;> intro h_eq <;> exact h_eq.symm
+theorem dispatchOpcode_arithmeticHandlerTable_MUL
+ (state : EvmState) :
+ HandlerTable.dispatchOpcode arithmeticHandlerTable .MUL state =
+ mulHandler state := by
+ exact Hand... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_60c87d8b0bc5_3 | 24775576f4a7e174 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/ArithmeticHandlers.lean | ArithmeticHandlers | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "dispatchOpcode_arithmeticHandlerTable_SDIV_status_of_some",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatchOpcode_arithmeticHandlerTable_SDIV state]\n simp [sdivHandler, binar... | [
{
"name": "dispatchOpcode_arithmeticHandlerTable_SDIV",
"text": "theorem dispatchOpcode_arithmeticHandlerTable_SDIV\n (state : EvmState) :\n HandlerTable.dispatchOpcode arithmeticHandlerTable .SDIV state =\n sdivHandler state := by\n exact HandlerTable.dispatchOpcode_some arithmeticHandler?_SDIV... | [
{
"name": "dispatchOpcode_arithmeticHandlerTable_SDIV_status_of_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 408,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.ArithmeticHandlers
Pure handler-table entries for basic arithmetic opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.EvmWordArith.SDiv
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
namespace ArithmeticHandlers
/-- Pure stack transform for binary arithmetic... | /-
EvmAsm.Evm64.ArithmeticHandlers
Pure handler-table entries for basic arithmetic opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.EvmWordArith.SDiv
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
namespace ArithmeticHandlers
/-- Pure stack transform for binary arithmetic... | @@ -131,11 +131,19 @@
smodHandler = handler ↔ handler = smodHandler := by
constructor <;> intro h_eq <;> exact h_eq.symm
+theorem dispatchOpcode_arithmeticHandlerTable_SDIV
+ (state : EvmState) :
+ HandlerTable.dispatchOpcode arithmeticHandlerTable .SDIV state =
+ sdivHandler state := by
+ exact H... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_60c87d8b0bc5_4 | 0ef1392e3d935190 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/ArithmeticHandlers.lean | ArithmeticHandlers | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "dispatchOpcode_arithmeticHandlerTable_SMOD_status_of_some",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatchOpcode_arithmeticHandlerTable_SMOD state]\n simp [smodHandler, binar... | [
{
"name": "dispatchOpcode_arithmeticHandlerTable_SMOD",
"text": "theorem dispatchOpcode_arithmeticHandlerTable_SMOD\n (state : EvmState) :\n HandlerTable.dispatchOpcode arithmeticHandlerTable .SMOD state =\n smodHandler state := by\n exact HandlerTable.dispatchOpcode_some arithmeticHandler?_SMOD... | [
{
"name": "dispatchOpcode_arithmeticHandlerTable_SMOD_status_of_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 408,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.ArithmeticHandlers
Pure handler-table entries for basic arithmetic opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.EvmWordArith.SDiv
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
namespace ArithmeticHandlers
/-- Pure stack transform for binary arithmetic... | /-
EvmAsm.Evm64.ArithmeticHandlers
Pure handler-table entries for basic arithmetic opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.EvmWordArith.SDiv
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
namespace ArithmeticHandlers
/-- Pure stack transform for binary arithmetic... | @@ -131,11 +131,19 @@
smodHandler = handler ↔ handler = smodHandler := by
constructor <;> intro h_eq <;> exact h_eq.symm
+theorem dispatchOpcode_arithmeticHandlerTable_SMOD
+ (state : EvmState) :
+ HandlerTable.dispatchOpcode arithmeticHandlerTable .SMOD state =
+ smodHandler state := by
+ exact H... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4ee7f6d15bc3_0 | 482ea5f6879cf61f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedReloadResidualRepartition.lean | SavedBitFixedReloadResidualRepartition | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "expTwoMulFixedIterSkipCondScratchFrame_to_iterPreRelaxedBlock3_frame",
"depth": 1,
"n_commands": 0,
"n_lines": 40,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro squareW rw\n have h_pures := expTwoMulFixedIterSkipCondScratch... | [
{
"name": "expTwoMulFixedIterSkipCondScratchFrame_relaxedBlock3_pures",
"text": "/-- Relaxed (block-3) variant of `expTwoMulFixedIterSkipCondScratchFrame_pures`:\n the loop pointer frame is the concrete `x16 ↦ evmSp+se(-40)` (no separate\n pointer cell), but the pures (`exitCond`, `c6New≠0`, `bit≠0`) ... | [
{
"name": "expTwoMulFixedIterSkipCondScratchFrame_to_iterPreRelaxedBlock3_frame",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 74,
"n_chars": 3396,
"n_subproofs": 1,
"n_tactics": 40,
"cyclomatic": 2,
"n_automation": 8,
"n_rewrites": 14,
"n_struc... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedReloadResidualRepartition
Reload-boundary re-partition: combine the merged loop-back reload `CountPost`
with the exponent residual `expTwoMulFixedExpResidual` to produce the next
iteration's `expTwoMulFixedIterPre`, with the residual shrunk by one block.
This package... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedReloadResidualRepartition
Reload-boundary re-partition: combine the merged loop-back reload `CountPost`
with the exponent residual `expTwoMulFixedExpResidual` to produce the next
iteration's `expTwoMulFixedIterPre`, with the residual shrunk by one block.
This package... | @@ -19,6 +19,52 @@
open EvmAsm.Rv64
+/-- Relaxed (block-3) variant of `expTwoMulFixedIterSkipCondScratchFrame_pures`:
+ the loop pointer frame is the concrete `x16 ↦ evmSp+se(-40)` (no separate
+ pointer cell), but the pures (`exitCond`, `c6New≠0`, `bit≠0`) live in the
+ scratch prefix/suffix and are extr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4ee7f6d15bc3_1 | d5be8e2ee70133ac | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedReloadResidualRepartition.lean | SavedBitFixedReloadResidualRepartition | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "expTwoMulFixedIterSkipCondCountPost_residual_repartition_block3",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨psA, psR, hdisj, hunion, hA, hR⟩ := h\n obtain ⟨psC, psP, hdisjCP... | [
{
"name": "expTwoMulFixedIterSkipCondScratchFrame_to_iterPreRelaxedBlock3_frame",
"text": "/-- Relaxed (block-3) variant of\n `expTwoMulFixedIterSkipCondScratchFrame_to_iterPre_frame`: assemble the cond\n scratch decomposition plus the concrete `x16 ↦ evmSp+se(-40)` pointer\n register (no pointer c... | [
{
"name": "expTwoMulFixedIterSkipCondCountPost_residual_repartition_block3",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 54,
"n_chars": 3072,
"n_subproofs": 4,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural"... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedReloadResidualRepartition
Reload-boundary re-partition: combine the merged loop-back reload `CountPost`
with the exponent residual `expTwoMulFixedExpResidual` to produce the next
iteration's `expTwoMulFixedIterPre`, with the residual shrunk by one block.
This package... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedReloadResidualRepartition
Reload-boundary re-partition: combine the merged loop-back reload `CountPost`
with the exponent residual `expTwoMulFixedExpResidual` to produce the next
iteration's `expTwoMulFixedIterPre`, with the residual shrunk by one block.
This package... | @@ -65,6 +65,79 @@
obtain ⟨_, h_bit⟩ := ((sepConj_pure_left _).1 hPureTail).2
exact ⟨h_exit, h_c6, h_bit⟩
+/-- Relaxed (block-3) variant of
+ `expTwoMulFixedIterSkipCondScratchFrame_to_iterPre_frame`: assemble the cond
+ scratch decomposition plus the concrete `x16 ↦ evmSp+se(-40)` pointer
+ register (... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4ee7f6d15bc3_2 | ec01c00aa5c11954 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedReloadResidualRepartition.lean | SavedBitFixedReloadResidualRepartition | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "expTwoMulFixedIterSkipScratchFrame_to_iterPreRelaxedBlock3_frame",
"depth": 1,
"n_commands": 0,
"n_lines": 38,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro squareW\n have h_pures := expTwoMulFixedIterSkipScratchFrame_relax... | [
{
"name": "expTwoMulFixedIterSkipScratchFrame_relaxedBlock3_pures",
"text": "/-- Relaxed (block-3) variant of `expTwoMulFixedIterSkipScratchFrame_pures`. -/\ntheorem expTwoMulFixedIterSkipScratchFrame_relaxedBlock3_pures\n {iterCount e c6 sp evmSp\n r0 r1 r2 r3 a0 a1 a2 a3 base : Word}\n {exitCon... | [
{
"name": "expTwoMulFixedIterSkipScratchFrame_to_iterPreRelaxedBlock3_frame",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 71,
"n_chars": 3082,
"n_subproofs": 1,
"n_tactics": 38,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 11,
"n_structura... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedReloadResidualRepartition
Reload-boundary re-partition: combine the merged loop-back reload `CountPost`
with the exponent residual `expTwoMulFixedExpResidual` to produce the next
iteration's `expTwoMulFixedIterPre`, with the residual shrunk by one block.
This package... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedReloadResidualRepartition
Reload-boundary re-partition: combine the merged loop-back reload `CountPost`
with the exponent residual `expTwoMulFixedExpResidual` to produce the next
iteration's `expTwoMulFixedIterPre`, with the residual shrunk by one block.
This package... | @@ -19,6 +19,51 @@
open EvmAsm.Rv64
+/-- Relaxed (block-3) variant of `expTwoMulFixedIterSkipScratchFrame_pures`. -/
+theorem expTwoMulFixedIterSkipScratchFrame_relaxedBlock3_pures
+ {iterCount e c6 sp evmSp
+ r0 r1 r2 r3 a0 a1 a2 a3 base : Word}
+ {exitCond : Prop} {v6 v7 v10 v11 d0 d1 d2 d3 : Word}
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4ee7f6d15bc3_3 | 8a82c1cf71a1c372 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedReloadResidualRepartition.lean | SavedBitFixedReloadResidualRepartition | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "expTwoMulFixedIterSkipCountPost_residual_repartition_block3",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨psA, psR, hdisj, hunion, hA, hR⟩ := h\n obtain ⟨psC, psP, hdisjCP, hu... | [
{
"name": "expTwoMulFixedIterSkipScratchFrame_to_iterPreRelaxedBlock3_frame",
"text": "/-- Relaxed (block-3) variant of\n `expTwoMulFixedIterSkipScratchFrame_to_iterPre_frame`. -/\ntheorem expTwoMulFixedIterSkipScratchFrame_to_iterPreRelaxedBlock3_frame\n {iterCount e c6 sp evmSp\n r0 r1 r2 r3 a0... | [
{
"name": "expTwoMulFixedIterSkipCountPost_residual_repartition_block3",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 52,
"n_chars": 2572,
"n_subproofs": 4,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 5,... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedReloadResidualRepartition
Reload-boundary re-partition: combine the merged loop-back reload `CountPost`
with the exponent residual `expTwoMulFixedExpResidual` to produce the next
iteration's `expTwoMulFixedIterPre`, with the residual shrunk by one block.
This package... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedReloadResidualRepartition
Reload-boundary re-partition: combine the merged loop-back reload `CountPost`
with the exponent residual `expTwoMulFixedExpResidual` to produce the next
iteration's `expTwoMulFixedIterPre`, with the residual shrunk by one block.
This package... | @@ -64,6 +64,76 @@
obtain ⟨_, h_bit⟩ := ((sepConj_pure_left _).1 hPureTail).2
exact ⟨h_exit, h_c6, h_bit⟩
+/-- Relaxed (block-3) variant of
+ `expTwoMulFixedIterSkipScratchFrame_to_iterPre_frame`. -/
+theorem expTwoMulFixedIterSkipScratchFrame_to_iterPreRelaxedBlock3_frame
+ {iterCount e c6 sp evmSp
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc5055573ba8_0 | 2a8f8b77805e0f63 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Callable.lean | Callable | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_div_callable_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_div_callable_length]",
"n_chars": 34,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": ... | [
{
"name": "evm_div_callable_length",
"text": "theorem evm_div_callable_length : evm_div_callable.length = 343 := by\n unfold evm_div_callable\n simp only [seq, Program.length_append, divK_phaseA_len, divK_phaseB_len, divK_clz_len,\n divK_phaseC2_len,\n divK_normB_len, divK_normA_len, divK_copyAU_len... | [
{
"name": "evm_div_callable_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 4,
"n_chars": 112,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Callable
LP64-callable shims around `evm_div` / `evm_mod`.
Per `docs/sdiv-smod-design.md` §3 (corrected layout, PR #2376), the
shim is **not** `evm_div ;; cc_ret`: appending `cc_ret` to the program
text would place it at byte 1268, unreachable from `evm_div`'s exit
PC. Instead we **... | /-
EvmAsm.Evm64.DivMod.Callable
LP64-callable shims around `evm_div` / `evm_mod`.
Per `docs/sdiv-smod-design.md` §3 (corrected layout, PR #2376), the
shim is **not** `evm_div ;; cc_ret`: appending `cc_ret` to the program
text would place it at byte 1268, unreachable from `evm_div`'s exit
PC. Instead we **... | @@ -124,8 +124,17 @@
/-- `cc_ret = JALR x0 x1 0` is exactly one instruction. -/
theorem cc_ret_len : cc_ret.length = 1 := by decide
-theorem evm_div_callable_byte_length : 4 * evm_div_callable.length = 1372 := sorry
+theorem evm_div_callable_length : evm_div_callable.length = 343 := by
+ unfold evm_div_callable
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc5055573ba8_1 | 72dd98e7713c19ee | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Callable.lean | Callable | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_mod_callable_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mod_callable_length]",
"n_chars": 34,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": ... | [
{
"name": "evm_mod_callable_length",
"text": "theorem evm_mod_callable_length : evm_mod_callable.length = 343 := by\n unfold evm_mod_callable\n simp only [seq, Program.length_append, divK_phaseA_len, divK_phaseB_len, divK_clz_len,\n divK_phaseC2_len,\n divK_normB_len, divK_normA_len, divK_copyAU_len... | [
{
"name": "evm_mod_callable_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 4,
"n_chars": 112,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Callable
LP64-callable shims around `evm_div` / `evm_mod`.
Per `docs/sdiv-smod-design.md` §3 (corrected layout, PR #2376), the
shim is **not** `evm_div ;; cc_ret`: appending `cc_ret` to the program
text would place it at byte 1268, unreachable from `evm_div`'s exit
PC. Instead we **... | /-
EvmAsm.Evm64.DivMod.Callable
LP64-callable shims around `evm_div` / `evm_mod`.
Per `docs/sdiv-smod-design.md` §3 (corrected layout, PR #2376), the
shim is **not** `evm_div ;; cc_ret`: appending `cc_ret` to the program
text would place it at byte 1268, unreachable from `evm_div`'s exit
PC. Instead we **... | @@ -124,8 +124,17 @@
/-- `cc_ret = JALR x0 x1 0` is exactly one instruction. -/
theorem cc_ret_len : cc_ret.length = 1 := by decide
-theorem evm_mod_callable_byte_length : 4 * evm_mod_callable.length = 1372 := sorry
+theorem evm_mod_callable_length : evm_mod_callable.length = 343 := by
+ unfold evm_mod_callable
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc5055573ba8_2 | 872c602ccddd1ff1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Callable.lean | Callable | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_div_callable_v4_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_div_callable_v4_length]",
"n_chars": 37,
"n_subproofs": 0,
"n_tactics": 2,
"cycloma... | [
{
"name": "evm_div_callable_v4_length",
"text": "theorem evm_div_callable_v4_length : evm_div_callable_v4.length = 343 := by\n unfold evm_div_callable_v4\n simp only [seq, Program.length_append, divK_phaseA_len, divK_phaseB_len, divK_clz_len,\n divK_phaseC2_len,\n divK_normB_len, divK_normA_len, div... | [
{
"name": "evm_div_callable_v4_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 125,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Callable
LP64-callable shims around `evm_div` / `evm_mod`.
Per `docs/sdiv-smod-design.md` §3 (corrected layout, PR #2376), the
shim is **not** `evm_div ;; cc_ret`: appending `cc_ret` to the program
text would place it at byte 1268, unreachable from `evm_div`'s exit
PC. Instead we **... | /-
EvmAsm.Evm64.DivMod.Callable
LP64-callable shims around `evm_div` / `evm_mod`.
Per `docs/sdiv-smod-design.md` §3 (corrected layout, PR #2376), the
shim is **not** `evm_div ;; cc_ret`: appending `cc_ret` to the program
text would place it at byte 1268, unreachable from `evm_div`'s exit
PC. Instead we **... | @@ -124,8 +124,17 @@
/-- `cc_ret = JALR x0 x1 0` is exactly one instruction. -/
theorem cc_ret_len : cc_ret.length = 1 := by decide
+theorem evm_div_callable_v4_length : evm_div_callable_v4.length = 343 := by
+ unfold evm_div_callable_v4
+ simp only [seq, Program.length_append, divK_phaseA_len, divK_phaseB_len, d... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc5055573ba8_3 | 8fd643b2c27d1df8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Callable.lean | Callable | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_mod_callable_v4_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mod_callable_v4_length]",
"n_chars": 37,
"n_subproofs": 0,
"n_tactics": 2,
"cycloma... | [
{
"name": "evm_mod_callable_v4_length",
"text": "theorem evm_mod_callable_v4_length : evm_mod_callable_v4.length = 343 := by\n unfold evm_mod_callable_v4\n simp only [seq, Program.length_append, divK_phaseA_len, divK_phaseB_len, divK_clz_len,\n divK_phaseC2_len,\n divK_normB_len, divK_normA_len, div... | [
{
"name": "evm_mod_callable_v4_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 311,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Callable
LP64-callable shims around `evm_div` / `evm_mod`.
Per `docs/sdiv-smod-design.md` §3 (corrected layout, PR #2376), the
shim is **not** `evm_div ;; cc_ret`: appending `cc_ret` to the program
text would place it at byte 1268, unreachable from `evm_div`'s exit
PC. Instead we **... | /-
EvmAsm.Evm64.DivMod.Callable
LP64-callable shims around `evm_div` / `evm_mod`.
Per `docs/sdiv-smod-design.md` §3 (corrected layout, PR #2376), the
shim is **not** `evm_div ;; cc_ret`: appending `cc_ret` to the program
text would place it at byte 1268, unreachable from `evm_div`'s exit
PC. Instead we **... | @@ -124,8 +124,17 @@
/-- `cc_ret = JALR x0 x1 0` is exactly one instruction. -/
theorem cc_ret_len : cc_ret.length = 1 := by decide
+theorem evm_mod_callable_v4_length : evm_mod_callable_v4.length = 343 := by
+ unfold evm_mod_callable_v4
+ simp only [seq, Program.length_append, divK_phaseA_len, divK_phaseB_len, d... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc5055573ba8_4 | 5281d987ef9d1538 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Callable.lean | Callable | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_div_callable_v5_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_div_callable_v5_length]",
"n_chars": 37,
"n_subproofs": 0,
"n_tactics": 2,
"cycloma... | [
{
"name": "evm_div_callable_v5_length",
"text": "theorem evm_div_callable_v5_length : evm_div_callable_v5.length = 353 := by\n unfold evm_div_callable_v5\n simp only [seq, Program.length_append, divK_phaseA_len, divK_phaseB_len, divK_clz_len,\n divK_phaseC2_len,\n divK_normB_len, divK_normA_len, div... | [
{
"name": "evm_div_callable_v5_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 125,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Callable
LP64-callable shims around `evm_div` / `evm_mod`.
Per `docs/sdiv-smod-design.md` §3 (corrected layout, PR #2376), the
shim is **not** `evm_div ;; cc_ret`: appending `cc_ret` to the program
text would place it at byte 1268, unreachable from `evm_div`'s exit
PC. Instead we **... | /-
EvmAsm.Evm64.DivMod.Callable
LP64-callable shims around `evm_div` / `evm_mod`.
Per `docs/sdiv-smod-design.md` §3 (corrected layout, PR #2376), the
shim is **not** `evm_div ;; cc_ret`: appending `cc_ret` to the program
text would place it at byte 1268, unreachable from `evm_div`'s exit
PC. Instead we **... | @@ -355,8 +355,17 @@
cc_ret ;;
divK_div128_v5
+theorem evm_div_callable_v5_length : evm_div_callable_v5.length = 353 := by
+ unfold evm_div_callable_v5
+ simp only [seq, Program.length_append, divK_phaseA_len, divK_phaseB_len, divK_clz_len,
+ divK_phaseC2_len,
+ divK_normB_len, divK_normA_len, divK_copy... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc5055573ba8_5 | 627245982ab78206 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Callable.lean | Callable | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_mod_callable_v5_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mod_callable_v5_length]",
"n_chars": 37,
"n_subproofs": 0,
"n_tactics": 2,
"cycloma... | [
{
"name": "evm_mod_callable_v5_length",
"text": "theorem evm_mod_callable_v5_length : evm_mod_callable_v5.length = 353 := by\n unfold evm_mod_callable_v5\n simp only [seq, Program.length_append, divK_phaseA_len, divK_phaseB_len, divK_clz_len,\n divK_phaseC2_len,\n divK_normB_len, divK_normA_len, div... | [
{
"name": "evm_mod_callable_v5_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 125,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Callable
LP64-callable shims around `evm_div` / `evm_mod`.
Per `docs/sdiv-smod-design.md` §3 (corrected layout, PR #2376), the
shim is **not** `evm_div ;; cc_ret`: appending `cc_ret` to the program
text would place it at byte 1268, unreachable from `evm_div`'s exit
PC. Instead we **... | /-
EvmAsm.Evm64.DivMod.Callable
LP64-callable shims around `evm_div` / `evm_mod`.
Per `docs/sdiv-smod-design.md` §3 (corrected layout, PR #2376), the
shim is **not** `evm_div ;; cc_ret`: appending `cc_ret` to the program
text would place it at byte 1268, unreachable from `evm_div`'s exit
PC. Instead we **... | @@ -355,8 +355,17 @@
cc_ret ;;
divK_div128_v5
+theorem evm_mod_callable_v5_length : evm_mod_callable_v5.length = 353 := by
+ unfold evm_mod_callable_v5
+ simp only [seq, Program.length_append, divK_phaseA_len, divK_phaseB_len, divK_clz_len,
+ divK_phaseC2_len,
+ divK_normB_len, divK_normA_len, divK_copy... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_099ff724e7b3_0 | e81c17b26703b8d2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseC2V5.lean | PhaseC2V5 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "beq_shift_sub_divCode_noNop_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro a i h\n have hlookup := CodeReq.ofProg_lookup (base + phaseC2Off) (divK_phaseC2 172) 3\n (by decid... | [
{
"name": "divK_phaseC2_code_sub_divCode_noNop_v5",
"text": "/-- Phase-C2 block instructions are subsumed by `divCode_noNop_v5`. -/\nprivate theorem divK_phaseC2_code_sub_divCode_noNop_v5 {base : Word} :\n ∀ a i, (divK_phaseC2_code 172 (base + phaseC2Off)) a = some i →\n (divCode_noNop_v5 base) a = ... | [
{
"name": "beq_shift_sub_divCode_noNop_v5",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 568,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseC2V5
v5 phase-C2 brick (4 steps, phaseC2Off → normBOff, shift ≠ 0 / BEQ-not-taken)
over `divCode_noNop_v5`. Mirror of `divK_phaseC2_ntaken_spec_within_v4_noNop`
(Norm.lean): phase-C2 doesn't touch div128, so its body extends to the v5 code
via the v5 block subsumption `sh... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseC2V5
v5 phase-C2 brick (4 steps, phaseC2Off → normBOff, shift ≠ 0 / BEQ-not-taken)
over `divCode_noNop_v5`. Mirror of `divK_phaseC2_ntaken_spec_within_v4_noNop`
(Norm.lean): phase-C2 doesn't touch div128, so its body extends to the v5 code
via the v5 block subsumption `sh... | @@ -15,10 +15,24 @@
open EvmAsm.Rv64
+/-- Phase-C2 block instructions are subsumed by `divCode_noNop_v5`. -/
+private theorem divK_phaseC2_code_sub_divCode_noNop_v5 {base : Word} :
+ ∀ a i, (divK_phaseC2_code 172 (base + phaseC2Off)) a = some i →
+ (divCode_noNop_v5 base) a = some i := by
+ unfold divK_ph... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_099ff724e7b3_1 | 284960504ce440c4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseC2V5.lean | PhaseC2V5 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "beq_shift_sub_divCode_noNop_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro a i h\n have hlookup := CodeReq.ofProg_lookup (base + phaseC2Off) (divK_phaseC2 172) 3\n (by decid... | [
{
"name": "divK_phaseC2_code_sub_divCode_noNop_v5",
"text": "/-- Phase-C2 block instructions are subsumed by `divCode_noNop_v5`. -/\nprivate theorem divK_phaseC2_code_sub_divCode_noNop_v5 {base : Word} :\n ∀ a i, (divK_phaseC2_code 172 (base + phaseC2Off)) a = some i →\n (divCode_noNop_v5 base) a = ... | [
{
"name": "divK_phaseC2_body_divCode_noNop_v5_within",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 703,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_onl... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseC2V5
v5 phase-C2 brick (4 steps, phaseC2Off → normBOff, shift ≠ 0 / BEQ-not-taken)
over `divCode_noNop_v5`. Mirror of `divK_phaseC2_ntaken_spec_within_v4_noNop`
(Norm.lean): phase-C2 doesn't touch div128, so its body extends to the v5 code
via the v5 block subsumption `sh... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseC2V5
v5 phase-C2 brick (4 steps, phaseC2Off → normBOff, shift ≠ 0 / BEQ-not-taken)
over `divCode_noNop_v5`. Mirror of `divK_phaseC2_ntaken_spec_within_v4_noNop`
(Norm.lean): phase-C2 doesn't touch div128, so its body extends to the v5 code
via the v5 block subsumption `sh... | @@ -15,13 +15,23 @@
open EvmAsm.Rv64
+/-- Phase-C2 block instructions are subsumed by `divCode_noNop_v5`. -/
+private theorem divK_phaseC2_code_sub_divCode_noNop_v5 {base : Word} :
+ ∀ a i, (divK_phaseC2_code 172 (base + phaseC2Off)) a = some i →
+ (divCode_noNop_v5 base) a = some i := by
+ unfold divK_ph... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_099ff724e7b3_2 | 0831eff8f11da24f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseC2V5.lean | PhaseC2V5 | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "divK_phaseC2_ntaken_spec_within_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbody := divK_phaseC2_body_divCode_noNop_v5_within sp shift v2 shiftMem base\n have hbeq_ra... | [
{
"name": "beq_shift_sub_divCode_noNop_v5",
"text": "/-- BEQ x6 x0 172 singleton subsumed by `divCode_noNop_v5`. -/\nprivate theorem beq_shift_sub_divCode_noNop_v5 {base : Word} :\n ∀ a i, (CodeReq.singleton (base + phaseC2Off + 12) (.BEQ .x6 .x0 172)) a = some i →\n (divCode_noNop_v5 base) a = some... | [
{
"name": "divK_phaseC2_ntaken_spec_within_v5_noNop",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 29,
"n_chars": 1750,
"n_subproofs": 7,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 3,
"automation_on... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseC2V5
v5 phase-C2 brick (4 steps, phaseC2Off → normBOff, shift ≠ 0 / BEQ-not-taken)
over `divCode_noNop_v5`. Mirror of `divK_phaseC2_ntaken_spec_within_v4_noNop`
(Norm.lean): phase-C2 doesn't touch div128, so its body extends to the v5 code
via the v5 block subsumption `sh... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseC2V5
v5 phase-C2 brick (4 steps, phaseC2Off → normBOff, shift ≠ 0 / BEQ-not-taken)
over `divCode_noNop_v5`. Mirror of `divK_phaseC2_ntaken_spec_within_v4_noNop`
(Norm.lean): phase-C2 doesn't touch div128, so its body extends to the v5 code
via the v5 block subsumption `sh... | @@ -23,6 +23,17 @@
intro a i h
exact sharedNoNop_v5_b3_div a i h
+/-- BEQ x6 x0 172 singleton subsumed by `divCode_noNop_v5`. -/
+private theorem beq_shift_sub_divCode_noNop_v5 {base : Word} :
+ ∀ a i, (CodeReq.singleton (base + phaseC2Off + 12) (.BEQ .x6 .x0 172)) a = some i →
+ (divCode_noNop_v5 base)... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_099ff724e7b3_3 | 6a84290917322904 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseC2V5.lean | PhaseC2V5 | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "divK_phaseC2_ntaken_spec_within_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbody := divK_phaseC2_body_divCode_noNop_v5_within sp shift v2 shiftMem base\n have hbeq_ra... | [
{
"name": "beq_shift_sub_divCode_noNop_v5",
"text": "/-- BEQ x6 x0 172 singleton subsumed by `divCode_noNop_v5`. -/\nprivate theorem beq_shift_sub_divCode_noNop_v5 {base : Word} :\n ∀ a i, (CodeReq.singleton (base + phaseC2Off + 12) (.BEQ .x6 .x0 172)) a = some i →\n (divCode_noNop_v5 base) a = some... | [
{
"name": "divK_phaseC2_taken_spec_within_v5_noNop",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 32,
"n_chars": 1943,
"n_subproofs": 7,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 3,
"automation_onl... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseC2V5
v5 phase-C2 brick (4 steps, phaseC2Off → normBOff, shift ≠ 0 / BEQ-not-taken)
over `divCode_noNop_v5`. Mirror of `divK_phaseC2_ntaken_spec_within_v4_noNop`
(Norm.lean): phase-C2 doesn't touch div128, so its body extends to the v5 code
via the v5 block subsumption `sh... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseC2V5
v5 phase-C2 brick (4 steps, phaseC2Off → normBOff, shift ≠ 0 / BEQ-not-taken)
over `divCode_noNop_v5`. Mirror of `divK_phaseC2_ntaken_spec_within_v4_noNop`
(Norm.lean): phase-C2 doesn't touch div128, so its body extends to the v5 code
via the v5 block subsumption `sh... | @@ -23,6 +23,17 @@
intro a i h
exact sharedNoNop_v5_b3_div a i h
+/-- BEQ x6 x0 172 singleton subsumed by `divCode_noNop_v5`. -/
+private theorem beq_shift_sub_divCode_noNop_v5 {base : Word} :
+ ∀ a i, (CodeReq.singleton (base + phaseC2Off + 12) (.BEQ .x6 .x0 172)) a = some i →
+ (divCode_noNop_v5 base)... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8952a1c6d2f6_0 | 6bbd4a23a1bcae45 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/ByteCopyChainInfra.lean | ByteCopyChainInfra | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "copyIterCR_disjoint",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro a\n by_cases hin : ∀ k, k < 5 → a ≠ base1 + BitVec.ofNat 64 (4 * k)\n · exact Or.inl (copyIterCR_none base1 a h... | [
{
"name": "copyIterCR_none",
"text": "/-- A copy iteration maps to `none` outside its 5 instruction slots `{base+4k : k<5}`. -/\ntheorem copyIterCR_none (base a : Word)\n (h : ∀ k, k < 5 → a ≠ base + BitVec.ofNat 64 (4 * k)) :\n copyIterCR base a = none := by\n have s0 : CodeReq.singleton base (.LBU ... | [
{
"name": "copyIterCR_disjoint",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 603,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 4,
"automation_only": false,
"max_ne... | 1 | /-
EvmAsm.Rv64.RLP.ByteCopyChainInfra
Infrastructure for the unrolled byte-array copy chain: copying N bytes is N
`rlp_copy_iter` blocks in sequence (block `j` at `base + 20*j`), the destination
region evolving one byte per block. (Field sizes are fixed — 20-byte address,
32-byte hash — so unrolling avoids t... | /-
EvmAsm.Rv64.RLP.ByteCopyChainInfra
Infrastructure for the unrolled byte-array copy chain: copying N bytes is N
`rlp_copy_iter` blocks in sequence (block `j` at `base + 20*j`), the destination
region evolving one byte per block. (Field sizes are fixed — 20-byte address,
32-byte hash — so unrolling avoids t... | @@ -29,6 +29,22 @@
(CodeReq.singleton (base + 12) (.ADDI .x14 .x14 1))).union
(CodeReq.singleton (base + 16) (.ADDI .x15 .x15 (-1)))
+/-- A copy iteration maps to `none` outside its 5 instruction slots `{base+4k : k<5}`. -/
+theorem copyIterCR_none (base a : Word)
+ (h : ∀ k, k < 5 → a ≠ base + BitVe... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8952a1c6d2f6_1 | 46d9f8f2bad4efc9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/ByteCopyChainInfra.lean | ByteCopyChainInfra | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "copyIterCR_disjoint_chainCR",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction N generalizing bw with\n | zero => simpa [byteCopyChainCR] using CodeReq.Disjoint.empty_right (copy... | [
{
"name": "copyIterCR_disjoint",
"text": "/-- **Reusable copy-iteration disjointness.** Two iterations whose 20-byte code ranges\n don't overlap (`base2 ≥ base1 + 20`) have disjoint CodeReqs. -/\ntheorem copyIterCR_disjoint (base1 base2 : Word)\n (hsep : base1.toNat + 20 ≤ base2.toNat) (hov : base2.to... | [
{
"name": "copyIterCR_disjoint_chainCR",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 22,
"n_chars": 981,
"n_subproofs": 4,
"n_tactics": 16,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
... | 2 | /-
EvmAsm.Rv64.RLP.ByteCopyChainInfra
Infrastructure for the unrolled byte-array copy chain: copying N bytes is N
`rlp_copy_iter` blocks in sequence (block `j` at `base + 20*j`), the destination
region evolving one byte per block. (Field sizes are fixed — 20-byte address,
32-byte hash — so unrolling avoids t... | /-
EvmAsm.Rv64.RLP.ByteCopyChainInfra
Infrastructure for the unrolled byte-array copy chain: copying N bytes is N
`rlp_copy_iter` blocks in sequence (block `j` at `base + 20*j`), the destination
region evolving one byte per block. (Field sizes are fixed — 20-byte address,
32-byte hash — so unrolling avoids t... | @@ -45,6 +45,18 @@
CodeReq.singleton_miss (by have := h 4 (by omega); bv_omega)
simp only [copyIterCR, CodeReq.union, s0, s1, s2, s3, s4]
+/-- **Reusable copy-iteration disjointness.** Two iterations whose 20-byte code ranges
+ don't overlap (`base2 ≥ base1 + 20`) have disjoint CodeReqs. -/
+theorem copyIt... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6288b7a44a08_0 | 6018ee275279f13e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/Log.lean | Log | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "logDataSliceVector_passed",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n checkVector_value_passed runLogData\n \"log-data-slice\"\n { memory := [(0xaa : Byte), 0xbb, 0xcc, 0xdd]\n ... | [
{
"name": "runLogData_slice",
"text": "theorem runLogData_slice :\n runLogData\n { memory := [(0xaa : Byte), 0xbb, 0xcc, 0xdd]\n args := mkLogArgs 1 2 [(0x01 : EvmWord)] } =\n [(0xbb : Byte), 0xcc] := rfl\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 183,
"n_subproofs": 0,
... | [
{
"name": "logDataSliceVector_passed",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 301,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"... | 1 | /-
EvmAsm.EL.Conformance.Log
Compact Lean-side conformance vectors for LOG data memory helpers
(GH #125 / GH #112).
-/
import EvmAsm.EL.Conformance
import EvmAsm.EL.LogDataBridge
namespace EvmAsm.EL
namespace Conformance
namespace Log
abbrev Byte := EvmAsm.EL.Byte
abbrev EvmWord := EvmAsm.Evm64.EvmWord
abbrev... | /-
EvmAsm.EL.Conformance.Log
Compact Lean-side conformance vectors for LOG data memory helpers
(GH #125 / GH #112).
-/
import EvmAsm.EL.Conformance
import EvmAsm.EL.LogDataBridge
namespace EvmAsm.EL
namespace Conformance
namespace Log
abbrev Byte := EvmAsm.EL.Byte
abbrev EvmWord := EvmAsm.Evm64.EvmWord
abbrev... | @@ -49,8 +49,20 @@
args := mkLogArgs 1 0 [] }
expected := .value [] }
+theorem runLogData_slice :
+ runLogData
+ { memory := [(0xaa : Byte), 0xbb, 0xcc, 0xdd]
+ args := mkLogArgs 1 2 [(0x01 : EvmWord)] } =
+ [(0xbb : Byte), 0xcc] := rfl
+
theorem logDataSliceVector_passed :
- che... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6288b7a44a08_1 | 9b9fb6518f52fc5c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/Log.lean | Log | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "logDataZeroSizeVector_passed",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n checkVector_value_passed runLogData\n \"log-data-zero-size\"\n { memory := [(0xaa : Byte), 0xbb]\n arg... | [
{
"name": "runLogData_zeroSize",
"text": "theorem runLogData_zeroSize :\n runLogData\n { memory := [(0xaa : Byte), 0xbb]\n args := mkLogArgs 1 0 [] } = [] := rfl\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 133,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_... | [
{
"name": "logDataZeroSizeVector_passed",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 267,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.EL.Conformance.Log
Compact Lean-side conformance vectors for LOG data memory helpers
(GH #125 / GH #112).
-/
import EvmAsm.EL.Conformance
import EvmAsm.EL.LogDataBridge
namespace EvmAsm.EL
namespace Conformance
namespace Log
abbrev Byte := EvmAsm.EL.Byte
abbrev EvmWord := EvmAsm.Evm64.EvmWord
abbrev... | /-
EvmAsm.EL.Conformance.Log
Compact Lean-side conformance vectors for LOG data memory helpers
(GH #125 / GH #112).
-/
import EvmAsm.EL.Conformance
import EvmAsm.EL.LogDataBridge
namespace EvmAsm.EL
namespace Conformance
namespace Log
abbrev Byte := EvmAsm.EL.Byte
abbrev EvmWord := EvmAsm.Evm64.EvmWord
abbrev... | @@ -49,8 +49,19 @@
args := mkLogArgs 1 0 [] }
expected := .value [] }
+theorem runLogData_zeroSize :
+ runLogData
+ { memory := [(0xaa : Byte), 0xbb]
+ args := mkLogArgs 1 0 [] } = [] := rfl
+
theorem logDataZeroSizeVector_passed :
- checkVector runLogData logDataZeroSizeVector = .pas... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6288b7a44a08_2 | aa90e6d4956dd391 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/Log.lean | Log | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "logDataSliceVector_passed",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n checkVector_value_passed runLogData\n \"log-data-slice\"\n { memory := [(0xaa : Byte), 0xbb, 0xcc, 0xdd]\n ... | [
{
"name": "runLogData_slice",
"text": "theorem runLogData_slice :\n runLogData\n { memory := [(0xaa : Byte), 0xbb, 0xcc, 0xdd]\n args := mkLogArgs 1 2 [(0x01 : EvmWord)] } =\n [(0xbb : Byte), 0xcc] := rfl\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 183,
"n_subproofs": 0,
... | [
{
"name": "logDataConformanceVectors_passed",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 6,
"n_chars": 197,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 4 | /-
EvmAsm.EL.Conformance.Log
Compact Lean-side conformance vectors for LOG data memory helpers
(GH #125 / GH #112).
-/
import EvmAsm.EL.Conformance
import EvmAsm.EL.LogDataBridge
namespace EvmAsm.EL
namespace Conformance
namespace Log
abbrev Byte := EvmAsm.EL.Byte
abbrev EvmWord := EvmAsm.Evm64.EvmWord
abbrev... | /-
EvmAsm.EL.Conformance.Log
Compact Lean-side conformance vectors for LOG data memory helpers
(GH #125 / GH #112).
-/
import EvmAsm.EL.Conformance
import EvmAsm.EL.LogDataBridge
namespace EvmAsm.EL
namespace Conformance
namespace Log
abbrev Byte := EvmAsm.EL.Byte
abbrev EvmWord := EvmAsm.Evm64.EvmWord
abbrev... | @@ -49,13 +49,25 @@
args := mkLogArgs 1 0 [] }
expected := .value [] }
+theorem runLogData_slice :
+ runLogData
+ { memory := [(0xaa : Byte), 0xbb, 0xcc, 0xdd]
+ args := mkLogArgs 1 2 [(0x01 : EvmWord)] } =
+ [(0xbb : Byte), 0xcc] := rfl
+
theorem runLogData_zeroSize :
runLogDa... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_0 | dbe7d2db22e9142e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulBoundaryPreFixed_unfold_scratch",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulBoundaryPreFixed_unfold, expTwoMulScratchFrame_unfold]",
"n_chars": 73,
"n_su... | [
{
"name": "expTwoMulBoundaryPreFixed_unfold",
"text": "theorem expTwoMulBoundaryPreFixed_unfold\n {sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 m2 m3 vOld v18 : Word}\n {baseWord exponentWord : EvmWord} {rest : List EvmWord} :\n expTwoMulBoundaryPreFixed sp evmSp cOld tOld c6Old c16Old c19Old\n ... | [
{
"name": "expTwoMulBoundaryPreFixed_unfold_scratch",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 1000,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_onl... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -29,6 +29,23 @@
expTwoMulScratchFrame vOld v18 **
evmStackIs evmSp (baseWord :: exponentWord :: rest))
+theorem expTwoMulBoundaryPreFixed_unfold
+ {sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 m2 m3 vOld v18 : Word}
+ {baseWord exponentWord : EvmWord} {rest : List EvmWord} :
+ expTwoMulBoundaryPre... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_1 | 33ff44b69ca7f6bf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulBoundaryPreFixed_unfold_scratch",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulBoundaryPreFixed_unfold, expTwoMulScratchFrame_unfold]",
"n_chars": 73,
"n_su... | [
{
"name": "expTwoMulBoundaryPreFixed_unfold",
"text": "theorem expTwoMulBoundaryPreFixed_unfold\n {sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 m2 m3 vOld v18 : Word}\n {baseWord exponentWord : EvmWord} {rest : List EvmWord} :\n expTwoMulBoundaryPreFixed sp evmSp cOld tOld c6Old c16Old c19Old\n ... | [
{
"name": "expTwoMulBoundaryPreFixed_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 364,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -29,11 +29,30 @@
expTwoMulScratchFrame vOld v18 **
evmStackIs evmSp (baseWord :: exponentWord :: rest))
+theorem expTwoMulBoundaryPreFixed_unfold
+ {sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 m2 m3 vOld v18 : Word}
+ {baseWord exponentWord : EvmWord} {rest : List EvmWord} :
+ expTwoMulBoundaryPr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_2 | 53f596939d6f4463 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulFixedFullLoopBoundaryBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedFullLoopBoundaryBound, expTwoMulFixedBoundaryLoopBound_eq,\n expTwoMulFixedFull... | [
{
"name": "expTwoMulFixedBoundaryLoopBound_eq",
"text": "theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :\n expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by\n unfold expTwoMulFixedBoundaryLoopBound expTwoMulFixedBoundaryPrefixBound\n expTwoMulBoundarySuffixBound\n omega\n\n",
... | [
{
"name": "expTwoMulFixedFullLoopBoundaryBound_eq",
"fan_in": 7,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 223,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": ... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -70,13 +70,21 @@
abbrev expTwoMulFixedBoundaryLoopBound (nSteps : Nat) : Nat :=
(expTwoMulFixedBoundaryPrefixBound + nSteps) + expTwoMulBoundarySuffixBound
+theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :
+ expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by
+ unfold expTwoMulFixedBounda... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_3 | fc87a392b47696d4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulBoundaryPreFixed_unfold_scratch",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulBoundaryPreFixed_unfold, expTwoMulScratchFrame_unfold]",
"n_chars": 73,
"n_su... | [
{
"name": "expTwoMulBoundaryPreFixed_unfold",
"text": "theorem expTwoMulBoundaryPreFixed_unfold\n {sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 m2 m3 vOld v18 : Word}\n {baseWord exponentWord : EvmWord} {rest : List EvmWord} :\n expTwoMulBoundaryPreFixed sp evmSp cOld tOld c6Old c16Old c19Old\n ... | [
{
"name": "exp_two_mul_fixed_boundary_loop_epilogue_of_loop_general_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 55,
"n_chars": 2798,
"n_subproofs": 3,
"n_tactics": 32,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_struct... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -29,11 +29,30 @@
expTwoMulScratchFrame vOld v18 **
evmStackIs evmSp (baseWord :: exponentWord :: rest))
+theorem expTwoMulBoundaryPreFixed_unfold
+ {sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 m2 m3 vOld v18 : Word}
+ {baseWord exponentWord : EvmWord} {rest : List EvmWord} :
+ expTwoMulBoundaryPr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_4 | fd52ceeb7bf54af3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulBoundaryPreFixed_unfold_scratch",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulBoundaryPreFixed_unfold, expTwoMulScratchFrame_unfold]",
"n_chars": 73,
"n_su... | [
{
"name": "expTwoMulBoundaryPreFixed_unfold",
"text": "theorem expTwoMulBoundaryPreFixed_unfold\n {sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 m2 m3 vOld v18 : Word}\n {baseWord exponentWord : EvmWord} {rest : List EvmWord} :\n expTwoMulBoundaryPreFixed sp evmSp cOld tOld c6Old c16Old c19Old\n ... | [
{
"name": "exp_two_mul_fixed_boundary_loop_epilogue_of_loop_general_named_bound_spec_within",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 30,
"n_chars": 1506,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -29,11 +29,30 @@
expTwoMulScratchFrame vOld v18 **
evmStackIs evmSp (baseWord :: exponentWord :: rest))
+theorem expTwoMulBoundaryPreFixed_unfold
+ {sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 m2 m3 vOld v18 : Word}
+ {baseWord exponentWord : EvmWord} {rest : List EvmWord} :
+ expTwoMulBoundaryPr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_5 | 57112a504f4d6cab | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulBoundaryPreFixed_unfold_scratch",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulBoundaryPreFixed_unfold, expTwoMulScratchFrame_unfold]",
"n_chars": 73,
"n_su... | [
{
"name": "expTwoMulBoundaryPreFixed_unfold",
"text": "theorem expTwoMulBoundaryPreFixed_unfold\n {sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 m2 m3 vOld v18 : Word}\n {baseWord exponentWord : EvmWord} {rest : List EvmWord} :\n expTwoMulBoundaryPreFixed sp evmSp cOld tOld c6Old c16Old c19Old\n ... | [
{
"name": "exp_two_mul_fixed_boundary_loop_epilogue_of_loop_general_bounded_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 29,
"n_chars": 1449,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n... | 4 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -29,11 +29,30 @@
expTwoMulScratchFrame vOld v18 **
evmStackIs evmSp (baseWord :: exponentWord :: rest))
+theorem expTwoMulBoundaryPreFixed_unfold
+ {sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 m2 m3 vOld v18 : Word}
+ {baseWord exponentWord : EvmWord} {rest : List EvmWord} :
+ expTwoMulBoundaryPr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_6 | 39d59a2d1110eba5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulBoundaryPreFixed_unfold_scratch",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulBoundaryPreFixed_unfold, expTwoMulScratchFrame_unfold]",
"n_chars": 73,
"n_su... | [
{
"name": "expTwoMulBoundaryPreFixed_unfold",
"text": "theorem expTwoMulBoundaryPreFixed_unfold\n {sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 m2 m3 vOld v18 : Word}\n {baseWord exponentWord : EvmWord} {rest : List EvmWord} :\n expTwoMulBoundaryPreFixed sp evmSp cOld tOld c6Old c16Old c19Old\n ... | [
{
"name": "exp_two_mul_fixed_boundary_loop_epilogue_of_loop_general_closed_bound_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 30,
"n_chars": 1443,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
... | 5 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -29,11 +29,30 @@
expTwoMulScratchFrame vOld v18 **
evmStackIs evmSp (baseWord :: exponentWord :: rest))
+theorem expTwoMulBoundaryPreFixed_unfold
+ {sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 m2 m3 vOld v18 : Word}
+ {baseWord exponentWord : EvmWord} {rest : List EvmWord} :
+ expTwoMulBoundaryPr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_7 | 2e29be81808ae6a5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulBoundaryPreFixed_unfold_scratch",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulBoundaryPreFixed_unfold, expTwoMulScratchFrame_unfold]",
"n_chars": 73,
"n_su... | [
{
"name": "expTwoMulBoundaryPreFixed_unfold",
"text": "theorem expTwoMulBoundaryPreFixed_unfold\n {sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 m2 m3 vOld v18 : Word}\n {baseWord exponentWord : EvmWord} {rest : List EvmWord} :\n expTwoMulBoundaryPreFixed sp evmSp cOld tOld c6Old c16Old c19Old\n ... | [
{
"name": "exp_two_mul_fixed_boundary_loop_epilogue_of_loop_general_exact_closed_bound_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 27,
"n_chars": 1362,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites"... | 6 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -29,11 +29,30 @@
expTwoMulScratchFrame vOld v18 **
evmStackIs evmSp (baseWord :: exponentWord :: rest))
+theorem expTwoMulBoundaryPreFixed_unfold
+ {sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 m2 m3 vOld v18 : Word}
+ {baseWord exponentWord : EvmWord} {rest : List EvmWord} :
+ expTwoMulBoundaryPr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_8 | 46c3a22b4fb22a7a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulBoundaryPreFixed_unfold_scratch",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulBoundaryPreFixed_unfold, expTwoMulScratchFrame_unfold]",
"n_chars": 73,
"n_su... | [
{
"name": "expTwoMulBoundaryPreFixed_unfold",
"text": "theorem expTwoMulBoundaryPreFixed_unfold\n {sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 m2 m3 vOld v18 : Word}\n {baseWord exponentWord : EvmWord} {rest : List EvmWord} :\n expTwoMulBoundaryPreFixed sp evmSp cOld tOld c6Old c16Old c19Old\n ... | [
{
"name": "exp_two_mul_fixed_full_loop_boundary_of_body_general_spec_within",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 27,
"n_chars": 1420,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural"... | 4 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -29,11 +29,30 @@
expTwoMulScratchFrame vOld v18 **
evmStackIs evmSp (baseWord :: exponentWord :: rest))
+theorem expTwoMulBoundaryPreFixed_unfold
+ {sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 m2 m3 vOld v18 : Word}
+ {baseWord exponentWord : EvmWord} {rest : List EvmWord} :
+ expTwoMulBoundaryPr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_9 | 81a85260351c93ea | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulBoundaryPreFixed_unfold_scratch",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulBoundaryPreFixed_unfold, expTwoMulScratchFrame_unfold]",
"n_chars": 73,
"n_su... | [
{
"name": "expTwoMulBoundaryPreFixed_unfold",
"text": "theorem expTwoMulBoundaryPreFixed_unfold\n {sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 m2 m3 vOld v18 : Word}\n {baseWord exponentWord : EvmWord} {rest : List EvmWord} :\n expTwoMulBoundaryPreFixed sp evmSp cOld tOld c6Old c16Old c19Old\n ... | [
{
"name": "exp_two_mul_fixed_full_loop_boundary_of_entry_body_general_spec_within",
"fan_in": 5,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 54,
"n_chars": 2433,
"n_subproofs": 2,
"n_tactics": 26,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_stru... | 5 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -29,11 +29,30 @@
expTwoMulScratchFrame vOld v18 **
evmStackIs evmSp (baseWord :: exponentWord :: rest))
+theorem expTwoMulBoundaryPreFixed_unfold
+ {sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 m2 m3 vOld v18 : Word}
+ {baseWord exponentWord : EvmWord} {rest : List EvmWord} :
+ expTwoMulBoundaryPr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_10 | a34e0a80d1d6c7d6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulFixedFullLoopBoundaryBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedFullLoopBoundaryBound, expTwoMulFixedBoundaryLoopBound_eq,\n expTwoMulFixedFull... | [
{
"name": "expTwoMulFixedBoundaryLoopBound_eq",
"text": "theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :\n expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by\n unfold expTwoMulFixedBoundaryLoopBound expTwoMulFixedBoundaryPrefixBound\n expTwoMulBoundarySuffixBound\n omega\n\n",
... | [
{
"name": "exp_two_mul_fixed_full_loop_boundary_of_entry_body_general_closed_bound_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 42,
"n_chars": 1874,
"n_subproofs": 1,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2... | 7 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -70,13 +70,21 @@
abbrev expTwoMulFixedBoundaryLoopBound (nSteps : Nat) : Nat :=
(expTwoMulFixedBoundaryPrefixBound + nSteps) + expTwoMulBoundarySuffixBound
+theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :
+ expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by
+ unfold expTwoMulFixedBounda... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_11 | c94d239841c10e93 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulFixedFullLoopBoundaryBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedFullLoopBoundaryBound, expTwoMulFixedBoundaryLoopBound_eq,\n expTwoMulFixedFull... | [
{
"name": "expTwoMulFixedBoundaryLoopBound_eq",
"text": "theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :\n expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by\n unfold expTwoMulFixedBoundaryLoopBound expTwoMulFixedBoundaryPrefixBound\n expTwoMulBoundarySuffixBound\n omega\n\n",
... | [
{
"name": "exp_two_mul_fixed_full_loop_boundary_of_entry_tail_case_posts_spec_within",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 63,
"n_chars": 3117,
"n_subproofs": 1,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_s... | 6 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -70,6 +70,12 @@
abbrev expTwoMulFixedBoundaryLoopBound (nSteps : Nat) : Nat :=
(expTwoMulFixedBoundaryPrefixBound + nSteps) + expTwoMulBoundarySuffixBound
+theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :
+ expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by
+ unfold expTwoMulFixedBoundar... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_12 | 1d13693dfda67e83 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulFixedFullLoopBoundaryBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedFullLoopBoundaryBound, expTwoMulFixedBoundaryLoopBound_eq,\n expTwoMulFixedFull... | [
{
"name": "expTwoMulFixedBoundaryLoopBound_eq",
"text": "theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :\n expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by\n unfold expTwoMulFixedBoundaryLoopBound expTwoMulFixedBoundaryPrefixBound\n expTwoMulBoundarySuffixBound\n omega\n\n",
... | [
{
"name": "exp_two_mul_fixed_full_loop_boundary_of_entry_tail_case_posts_closed_bound_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 58,
"n_chars": 2736,
"n_subproofs": 1,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites"... | 8 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -70,13 +70,21 @@
abbrev expTwoMulFixedBoundaryLoopBound (nSteps : Nat) : Nat :=
(expTwoMulFixedBoundaryPrefixBound + nSteps) + expTwoMulBoundarySuffixBound
+theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :
+ expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by
+ unfold expTwoMulFixedBounda... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_13 | b7b596d0e7c217d8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulFixedFullLoopBoundaryBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedFullLoopBoundaryBound, expTwoMulFixedBoundaryLoopBound_eq,\n expTwoMulFixedFull... | [
{
"name": "expTwoMulFixedBoundaryLoopBound_eq",
"text": "theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :\n expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by\n unfold expTwoMulFixedBoundaryLoopBound expTwoMulFixedBoundaryPrefixBound\n expTwoMulBoundarySuffixBound\n omega\n\n",
... | [
{
"name": "exp_two_mul_fixed_full_loop_boundary_of_entry_tail_case_posts_iter_sp_spec_within",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 62,
"n_chars": 3101,
"n_subproofs": 1,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
... | 6 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -70,6 +70,12 @@
abbrev expTwoMulFixedBoundaryLoopBound (nSteps : Nat) : Nat :=
(expTwoMulFixedBoundaryPrefixBound + nSteps) + expTwoMulBoundarySuffixBound
+theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :
+ expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by
+ unfold expTwoMulFixedBoundar... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_14 | 71bf42d4ad48b56d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulFixedFullLoopBoundaryBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedFullLoopBoundaryBound, expTwoMulFixedBoundaryLoopBound_eq,\n expTwoMulFixedFull... | [
{
"name": "expTwoMulFixedBoundaryLoopBound_eq",
"text": "theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :\n expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by\n unfold expTwoMulFixedBoundaryLoopBound expTwoMulFixedBoundaryPrefixBound\n expTwoMulBoundarySuffixBound\n omega\n\n",
... | [
{
"name": "exp_two_mul_fixed_full_loop_boundary_of_entry_tail_case_posts_iter_sp_closed_bound_spec_within",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 58,
"n_chars": 2778,
"n_subproofs": 1,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 0,
"n_r... | 8 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -70,13 +70,21 @@
abbrev expTwoMulFixedBoundaryLoopBound (nSteps : Nat) : Nat :=
(expTwoMulFixedBoundaryPrefixBound + nSteps) + expTwoMulBoundarySuffixBound
+theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :
+ expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by
+ unfold expTwoMulFixedBounda... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_15 | 145ae4f91da96eda | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 7 | [
{
"theorem_name": "exp_two_mul_fixed_full_loop_boundary_of_entry_body_general_closed_bound_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hBodyNamed :\n cpsTripleWithin expTwoMulFixe... | [
{
"name": "expTwoMulFixedFullLoopBoundaryBound_eq",
"text": "theorem expTwoMulFixedFullLoopBoundaryBound_eq :\n expTwoMulFixedFullLoopBoundaryBound = 49429 := by\n rw [expTwoMulFixedFullLoopBoundaryBound, expTwoMulFixedBoundaryLoopBound_eq,\n expTwoMulFixedFullLoopBodyBound_eq]\n\n",
"fan_in": 7,... | [
{
"name": "exp_two_mul_fixed_full_loop_boundary_of_entry_tail_case_posts_iter_sp_bounded_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 9,
"n_lines": 49,
"n_chars": 2324,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrite... | 9 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -81,6 +81,11 @@
abbrev expTwoMulFixedFullLoopBoundaryBound : Nat :=
expTwoMulFixedBoundaryLoopBound expTwoMulFixedFullLoopBodyBound
+theorem expTwoMulFixedFullLoopBoundaryBound_eq :
+ expTwoMulFixedFullLoopBoundaryBound = 49429 := by
+ rw [expTwoMulFixedFullLoopBoundaryBound, expTwoMulFixedBoundaryLoopBoun... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_16 | aa3e5407bf1dfadf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulFixedFullLoopBoundaryBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedFullLoopBoundaryBound, expTwoMulFixedBoundaryLoopBound_eq,\n expTwoMulFixedFull... | [
{
"name": "expTwoMulFixedBoundaryLoopBound_eq",
"text": "theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :\n expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by\n unfold expTwoMulFixedBoundaryLoopBound expTwoMulFixedBoundaryPrefixBound\n expTwoMulBoundarySuffixBound\n omega\n\n",
... | [
{
"name": "exp_two_mul_fixed_full_loop_boundary_of_entry_tail_case_nonfinal_iter_sp_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 45,
"n_chars": 2215,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0... | 7 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -70,6 +70,12 @@
abbrev expTwoMulFixedBoundaryLoopBound (nSteps : Nat) : Nat :=
(expTwoMulFixedBoundaryPrefixBound + nSteps) + expTwoMulBoundarySuffixBound
+theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :
+ expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by
+ unfold expTwoMulFixedBoundar... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_17 | be4e440965a49444 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 7 | [
{
"theorem_name": "exp_two_mul_fixed_full_loop_boundary_of_entry_body_general_closed_bound_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hBodyNamed :\n cpsTripleWithin expTwoMulFixe... | [
{
"name": "expTwoMulFixedFullLoopBoundaryBound_eq",
"text": "theorem expTwoMulFixedFullLoopBoundaryBound_eq :\n expTwoMulFixedFullLoopBoundaryBound = 49429 := by\n rw [expTwoMulFixedFullLoopBoundaryBound, expTwoMulFixedBoundaryLoopBound_eq,\n expTwoMulFixedFullLoopBodyBound_eq]\n\n",
"fan_in": 7,... | [
{
"name": "exp_two_mul_fixed_full_loop_boundary_of_entry_tail_case_nonfinal_iter_sp_closed_bound_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 9,
"n_lines": 43,
"n_chars": 2040,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n... | 9 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -81,6 +81,11 @@
abbrev expTwoMulFixedFullLoopBoundaryBound : Nat :=
expTwoMulFixedBoundaryLoopBound expTwoMulFixedFullLoopBodyBound
+theorem expTwoMulFixedFullLoopBoundaryBound_eq :
+ expTwoMulFixedFullLoopBoundaryBound = 49429 := by
+ rw [expTwoMulFixedFullLoopBoundaryBound, expTwoMulFixedBoundaryLoopBoun... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_18 | c96484b95ec373d9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulFixedFullLoopBoundaryBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedFullLoopBoundaryBound, expTwoMulFixedBoundaryLoopBound_eq,\n expTwoMulFixedFull... | [
{
"name": "expTwoMulFixedBoundaryLoopBound_eq",
"text": "theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :\n expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by\n unfold expTwoMulFixedBoundaryLoopBound expTwoMulFixedBoundaryPrefixBound\n expTwoMulBoundarySuffixBound\n omega\n\n",
... | [
{
"name": "exp_two_mul_fixed_full_loop_boundary_of_entry_tail_case_final_iter_sp_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 56,
"n_chars": 2761,
"n_subproofs": 1,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
... | 6 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -70,6 +70,12 @@
abbrev expTwoMulFixedBoundaryLoopBound (nSteps : Nat) : Nat :=
(expTwoMulFixedBoundaryPrefixBound + nSteps) + expTwoMulBoundarySuffixBound
+theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :
+ expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by
+ unfold expTwoMulFixedBoundar... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_19 | e5ba2e4c1ee2222e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulFixedFullLoopBoundaryBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedFullLoopBoundaryBound, expTwoMulFixedBoundaryLoopBound_eq,\n expTwoMulFixedFull... | [
{
"name": "expTwoMulFixedBoundaryLoopBound_eq",
"text": "theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :\n expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by\n unfold expTwoMulFixedBoundaryLoopBound expTwoMulFixedBoundaryPrefixBound\n expTwoMulBoundarySuffixBound\n omega\n\n",
... | [
{
"name": "exp_two_mul_fixed_full_loop_boundary_of_entry_tail_case_final_iter_sp_closed_bound_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 41,
"n_chars": 1937,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_re... | 8 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -70,13 +70,21 @@
abbrev expTwoMulFixedBoundaryLoopBound (nSteps : Nat) : Nat :=
(expTwoMulFixedBoundaryPrefixBound + nSteps) + expTwoMulBoundarySuffixBound
+theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :
+ expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by
+ unfold expTwoMulFixedBounda... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_20 | c5b1553224d9da83 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulFixedFullLoopBoundaryBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedFullLoopBoundaryBound, expTwoMulFixedBoundaryLoopBound_eq,\n expTwoMulFixedFull... | [
{
"name": "expTwoMulFixedBoundaryLoopBound_eq",
"text": "theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :\n expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by\n unfold expTwoMulFixedBoundaryLoopBound expTwoMulFixedBoundaryPrefixBound\n expTwoMulBoundarySuffixBound\n omega\n\n",
... | [
{
"name": "exp_two_mul_fixed_full_loop_boundary_of_entry_tail_case_nonfinal_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 44,
"n_chars": 2127,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n... | 7 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -70,6 +70,12 @@
abbrev expTwoMulFixedBoundaryLoopBound (nSteps : Nat) : Nat :=
(expTwoMulFixedBoundaryPrefixBound + nSteps) + expTwoMulBoundarySuffixBound
+theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :
+ expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by
+ unfold expTwoMulFixedBoundar... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_21 | b5a9cf409fa86d83 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 7 | [
{
"theorem_name": "exp_two_mul_fixed_full_loop_boundary_of_entry_body_general_closed_bound_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hBodyNamed :\n cpsTripleWithin expTwoMulFixe... | [
{
"name": "expTwoMulFixedFullLoopBoundaryBound_eq",
"text": "theorem expTwoMulFixedFullLoopBoundaryBound_eq :\n expTwoMulFixedFullLoopBoundaryBound = 49429 := by\n rw [expTwoMulFixedFullLoopBoundaryBound, expTwoMulFixedBoundaryLoopBound_eq,\n expTwoMulFixedFullLoopBodyBound_eq]\n\n",
"fan_in": 7,... | [
{
"name": "exp_two_mul_fixed_full_loop_boundary_of_entry_tail_case_nonfinal_closed_bound_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 9,
"n_lines": 43,
"n_chars": 2000,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrite... | 9 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -81,6 +81,11 @@
abbrev expTwoMulFixedFullLoopBoundaryBound : Nat :=
expTwoMulFixedBoundaryLoopBound expTwoMulFixedFullLoopBodyBound
+theorem expTwoMulFixedFullLoopBoundaryBound_eq :
+ expTwoMulFixedFullLoopBoundaryBound = 49429 := by
+ rw [expTwoMulFixedFullLoopBoundaryBound, expTwoMulFixedBoundaryLoopBoun... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_22 | 6108e5eccb2ddf49 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulFixedFullLoopBoundaryBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedFullLoopBoundaryBound, expTwoMulFixedBoundaryLoopBound_eq,\n expTwoMulFixedFull... | [
{
"name": "expTwoMulFixedBoundaryLoopBound_eq",
"text": "theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :\n expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by\n unfold expTwoMulFixedBoundaryLoopBound expTwoMulFixedBoundaryPrefixBound\n expTwoMulBoundarySuffixBound\n omega\n\n",
... | [
{
"name": "exp_two_mul_fixed_full_loop_boundary_of_entry_tail_case_final_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 55,
"n_chars": 2681,
"n_subproofs": 1,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_s... | 6 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -70,6 +70,12 @@
abbrev expTwoMulFixedBoundaryLoopBound (nSteps : Nat) : Nat :=
(expTwoMulFixedBoundaryPrefixBound + nSteps) + expTwoMulBoundarySuffixBound
+theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :
+ expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by
+ unfold expTwoMulFixedBoundar... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_23 | 765804552e0d1b73 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulFixedFullLoopBoundaryBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedFullLoopBoundaryBound, expTwoMulFixedBoundaryLoopBound_eq,\n expTwoMulFixedFull... | [
{
"name": "expTwoMulFixedBoundaryLoopBound_eq",
"text": "theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :\n expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by\n unfold expTwoMulFixedBoundaryLoopBound expTwoMulFixedBoundaryPrefixBound\n expTwoMulBoundarySuffixBound\n omega\n\n",
... | [
{
"name": "exp_two_mul_fixed_full_loop_boundary_of_entry_tail_case_final_closed_bound_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 41,
"n_chars": 1897,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites":... | 8 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -70,13 +70,21 @@
abbrev expTwoMulFixedBoundaryLoopBound (nSteps : Nat) : Nat :=
(expTwoMulFixedBoundaryPrefixBound + nSteps) + expTwoMulBoundarySuffixBound
+theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :
+ expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by
+ unfold expTwoMulFixedBounda... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_24 | f62488b504620a5b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 24 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulBoundaryPreFixed_unfold_scratch",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulBoundaryPreFixed_unfold, expTwoMulScratchFrame_unfold]",
"n_chars": 73,
"n_su... | [
{
"name": "expTwoMulBoundaryPreFixed_unfold",
"text": "theorem expTwoMulBoundaryPreFixed_unfold\n {sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 m2 m3 vOld v18 : Word}\n {baseWord exponentWord : EvmWord} {rest : List EvmWord} :\n expTwoMulBoundaryPreFixed sp evmSp cOld tOld c6Old c16Old c19Old\n ... | [
{
"name": "exp_two_mul_fixed_full_loop_boundary_of_bounded_body_general_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 30,
"n_chars": 1492,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_str... | 5 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -29,11 +29,30 @@
expTwoMulScratchFrame vOld v18 **
evmStackIs evmSp (baseWord :: exponentWord :: rest))
+theorem expTwoMulBoundaryPreFixed_unfold
+ {sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 m2 m3 vOld v18 : Word}
+ {baseWord exponentWord : EvmWord} {rest : List EvmWord} :
+ expTwoMulBoundaryPr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_25 | 591fe7d37cc754c8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 25 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulFixedFullLoopBoundaryBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedFullLoopBoundaryBound, expTwoMulFixedBoundaryLoopBound_eq,\n expTwoMulFixedFull... | [
{
"name": "expTwoMulFixedBoundaryLoopBound_eq",
"text": "theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :\n expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by\n unfold expTwoMulFixedBoundaryLoopBound expTwoMulFixedBoundaryPrefixBound\n expTwoMulBoundarySuffixBound\n omega\n\n",
... | [
{
"name": "exp_two_mul_fixed_full_loop_boundary_of_bounded_body_general_closed_bound_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 34,
"n_chars": 1627,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites":... | 7 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -70,13 +70,21 @@
abbrev expTwoMulFixedBoundaryLoopBound (nSteps : Nat) : Nat :=
(expTwoMulFixedBoundaryPrefixBound + nSteps) + expTwoMulBoundarySuffixBound
+theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :
+ expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by
+ unfold expTwoMulFixedBounda... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_26 | 083478e6d3f2d354 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 26 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulBoundaryPreFixed_unfold_scratch",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulBoundaryPreFixed_unfold, expTwoMulScratchFrame_unfold]",
"n_chars": 73,
"n_su... | [
{
"name": "expTwoMulBoundaryPreFixed_unfold",
"text": "theorem expTwoMulBoundaryPreFixed_unfold\n {sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 m2 m3 vOld v18 : Word}\n {baseWord exponentWord : EvmWord} {rest : List EvmWord} :\n expTwoMulBoundaryPreFixed sp evmSp cOld tOld c6Old c16Old c19Old\n ... | [
{
"name": "exp_two_mul_fixed_full_loop_boundary_of_body_general_bounded_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 30,
"n_chars": 1475,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_str... | 5 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -29,11 +29,30 @@
expTwoMulScratchFrame vOld v18 **
evmStackIs evmSp (baseWord :: exponentWord :: rest))
+theorem expTwoMulBoundaryPreFixed_unfold
+ {sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 m2 m3 vOld v18 : Word}
+ {baseWord exponentWord : EvmWord} {rest : List EvmWord} :
+ expTwoMulBoundaryPr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_27 | eff743ec57e7d3c6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 27 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulFixedFullLoopBoundaryBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedFullLoopBoundaryBound, expTwoMulFixedBoundaryLoopBound_eq,\n expTwoMulFixedFull... | [
{
"name": "expTwoMulFixedBoundaryLoopBound_eq",
"text": "theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :\n expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by\n unfold expTwoMulFixedBoundaryLoopBound expTwoMulFixedBoundaryPrefixBound\n expTwoMulBoundarySuffixBound\n omega\n\n",
... | [
{
"name": "exp_two_mul_fixed_full_loop_boundary_of_body_general_closed_bound_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 36,
"n_chars": 1819,
"n_subproofs": 1,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
... | 6 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -70,13 +70,21 @@
abbrev expTwoMulFixedBoundaryLoopBound (nSteps : Nat) : Nat :=
(expTwoMulFixedBoundaryPrefixBound + nSteps) + expTwoMulBoundarySuffixBound
+theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :
+ expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by
+ unfold expTwoMulFixedBounda... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c15fb060f960_28 | b611be7118c93103 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoopFixed.lean | SavedBitBoundaryLoopFixed | 28 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "expTwoMulFixedFullLoopBoundaryBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedFullLoopBoundaryBound, expTwoMulFixedBoundaryLoopBound_eq,\n expTwoMulFixedFull... | [
{
"name": "expTwoMulFixedBoundaryLoopBound_eq",
"text": "theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :\n expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by\n unfold expTwoMulFixedBoundaryLoopBound expTwoMulFixedBoundaryPrefixBound\n expTwoMulBoundarySuffixBound\n omega\n\n",
... | [
{
"name": "exp_two_mul_fixed_full_loop_boundary_of_body_general_closed_bounded_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 30,
"n_chars": 1431,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
... | 7 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoopFixed
Boundary composition for the fixed x19 two-MUL saved-bit EXP code bundle.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
import EvmAsm.E... | @@ -70,13 +70,21 @@
abbrev expTwoMulFixedBoundaryLoopBound (nSteps : Nat) : Nat :=
(expTwoMulFixedBoundaryPrefixBound + nSteps) + expTwoMulBoundarySuffixBound
+theorem expTwoMulFixedBoundaryLoopBound_eq (nSteps : Nat) :
+ expTwoMulFixedBoundaryLoopBound nSteps = nSteps + 21 := by
+ unfold expTwoMulFixedBounda... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b2ae61f543f_0 | 5dca8ebfa8ec0c35 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/NoWrapChainDHiPow32.lean | NoWrapChainDHiPow32 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "div128Quot_v4_le_q_true_plus_one_of_no_wrap_of_uHi_lt_dHi_pow32",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hUn21_lt_vTop : (divKTrialCallV4Un21 uHi uLo vTop).toNat < vTop.toNat... | [
{
"name": "divKTrialCallV4Un21_eq_r1_of_no_wrap_of_uHi_lt_dHi_pow32",
"text": "/-- Wider-premise `un21 = r1` discharge from Phase-1b no-wrap. Identical to\n `divKTrialCallV4Un21_eq_r1_of_no_wrap` except the only use of\n `Q1dd = q_true_1` is via PR #7059's wider `_of_uHi_lt_dHi_pow32`\n variant. -... | [
{
"name": "div128Quot_v4_le_q_true_plus_one_of_no_wrap_of_uHi_lt_dHi_pow32",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 32,
"n_chars": 1562,
"n_subproofs": 2,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural"... | 1 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.NoWrapChainDHiPow32
Wider-premise no-wrap chain on the V4 Knuth-A `+1` upper-bound path.
Composes PR #7059's `divKTrialCallV4Q1dd_eq_q_true_1_of_uHi_lt_dHi_pow32`
and PR #7060's wider Q0dd UB / +1-floor-bound to land:
* `divKTrialCallV4Un21_eq_r1_of_no_wr... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.NoWrapChainDHiPow32
Wider-premise no-wrap chain on the V4 Knuth-A `+1` upper-bound path.
Composes PR #7059's `divKTrialCallV4Q1dd_eq_q_true_1_of_uHi_lt_dHi_pow32`
and PR #7060's wider Q0dd UB / +1-floor-bound to land:
* `divKTrialCallV4Un21_eq_r1_of_no_wr... | @@ -30,6 +30,95 @@
open EvmAsm.Rv64 EvmWord
+/-- Wider-premise `un21 = r1` discharge from Phase-1b no-wrap. Identical to
+ `divKTrialCallV4Un21_eq_r1_of_no_wrap` except the only use of
+ `Q1dd = q_true_1` is via PR #7059's wider `_of_uHi_lt_dHi_pow32`
+ variant. -/
+theorem divKTrialCallV4Un21_eq_r1_of_n... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b2ae61f543f_1 | 9c7bbc56bac6e346 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/NoWrapChainDHiPow32.lean | NoWrapChainDHiPow32 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "div128Quot_v4_le_q_true_plus_one_of_no_wrap_of_uHi_lt_dHi_pow32",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hUn21_lt_vTop : (divKTrialCallV4Un21 uHi uLo vTop).toNat < vTop.toNat... | [
{
"name": "divKTrialCallV4Un21_eq_r1_of_no_wrap_of_uHi_lt_dHi_pow32",
"text": "/-- Wider-premise `un21 = r1` discharge from Phase-1b no-wrap. Identical to\n `divKTrialCallV4Un21_eq_r1_of_no_wrap` except the only use of\n `Q1dd = q_true_1` is via PR #7059's wider `_of_uHi_lt_dHi_pow32`\n variant. -... | [
{
"name": "div128Quot_v4_le_q_true_plus_one_of_rhatdd_hi_zero_of_uHi_lt_dHi_pow32",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 24,
"n_chars": 1153,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_struc... | 2 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.NoWrapChainDHiPow32
Wider-premise no-wrap chain on the V4 Knuth-A `+1` upper-bound path.
Composes PR #7059's `divKTrialCallV4Q1dd_eq_q_true_1_of_uHi_lt_dHi_pow32`
and PR #7060's wider Q0dd UB / +1-floor-bound to land:
* `divKTrialCallV4Un21_eq_r1_of_no_wr... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.NoWrapChainDHiPow32
Wider-premise no-wrap chain on the V4 Knuth-A `+1` upper-bound path.
Composes PR #7059's `divKTrialCallV4Q1dd_eq_q_true_1_of_uHi_lt_dHi_pow32`
and PR #7060's wider Q0dd UB / +1-floor-bound to land:
* `divKTrialCallV4Un21_eq_r1_of_no_wr... | @@ -30,6 +30,95 @@
open EvmAsm.Rv64 EvmWord
+/-- Wider-premise `un21 = r1` discharge from Phase-1b no-wrap. Identical to
+ `divKTrialCallV4Un21_eq_r1_of_no_wrap` except the only use of
+ `Q1dd = q_true_1` is via PR #7059's wider `_of_uHi_lt_dHi_pow32`
+ variant. -/
+theorem divKTrialCallV4Un21_eq_r1_of_n... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_0 | 31da1e4ca83a1ae3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 1 | [
{
"theorem_name": "mulModAddPartialHiCarry_eq_add",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_carry : (mulModAddPartialLoCarry lo a b).toNat ≤ 1 := by\n unfold mulModAddPartialLoCarry\n spl... | [
{
"name": "carryOrEqAdd",
"text": "private theorem carryOrEqAdd {x y cin : Word} (hcin : cin.toNat ≤ 1) :\n let psum := x + y\n let ca := if BitVec.ult psum y then (1 : Word) else 0\n let res := psum + cin\n let cb := if BitVec.ult res cin then (1 : Word) else 0\n ca ||| cb = ca + cb := by\n ... | [
{
"name": "mulModAddPartialHiCarry_eq_add",
"fan_in": 5,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 752,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,... | 1 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -14,11 +14,38 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
+private theorem carryOrEqAdd {x y cin : Word} (hcin : cin.toNat ≤ 1) :
+ let psum := x + y
+ let ca := if BitVec.ult psum y then (1 : Word) else 0
+ let res := psum + cin
+ let cb := if BitVec.ult res cin then (1 : Word) else ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_1 | 9403947a01c7eb4a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 5 | [
{
"theorem_name": "mulModAddPartialHiCarry_eq_singleCarry",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [mulModAddPartialHiCarry_eq_add]\n rw [BitVec.toNat_add]\n simp... | [
{
"name": "mulModAddPartialHiCarry_eq_add",
"text": "/-- The RV64 `OR` used to combine the two carry bits of an add-partial high limb\n agrees with ordinary Word addition. -/\ntheorem mulModAddPartialHiCarry_eq_add (hi lo a b : Word) :\n mulModAddPartialHiCarry hi lo a b =\n mulModAddPartialHiBas... | [
{
"name": "mulModAddPartialHiCarry_eq_singleCarry",
"fan_in": 6,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 36,
"n_chars": 1868,
"n_subproofs": 4,
"n_tactics": 27,
"cyclomatic": 3,
"n_automation": 4,
"n_rewrites": 10,
"n_structural": 1,
"automation_onl... | 3 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -33,6 +33,20 @@
have hmod : (x.toNat + y.toNat) % 2^64 < 2^64 := Nat.mod_lt _ (by omega)
omega
+/-- The RV64 `OR` used to combine the two carry bits of an add-partial high limb
+ agrees with ordinary Word addition. -/
+theorem mulModAddPartialHiCarry_eq_add (hi lo a b : Word) :
+ mulModAddPartialHiCarr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_2 | adfb03c4d606a16e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 6 | [
{
"theorem_name": "mulModAddPartialHiCarry_eq_singleCarry_right",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mulModAddPartialHiCarry_eq_singleCarry]\n rw [BitVec.add_comm hi]",
"n_chars": 75,
... | [
{
"name": "mulModAddPartialHiCarry_eq_singleCarry",
"text": "/-- The two-step high carry of an add-partial is the same carry bit as adding\n the high product and incoming low carry before checking overflow. -/\ntheorem mulModAddPartialHiCarry_eq_singleCarry (hi lo a b : Word) :\n mulModAddPartialHiCar... | [
{
"name": "mulModAddPartialHiCarry_eq_singleCarry_right",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 13,
"n_chars": 551,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_... | 4 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -60,6 +60,41 @@
exact Nat.le_trans (Nat.div_le_div_right h3) (Nat.le_of_eq this)
norm_num
+/-- The two-step high carry of an add-partial is the same carry bit as adding
+ the high product and incoming low carry before checking overflow. -/
+theorem mulModAddPartialHiCarry_eq_singleCarry (hi lo a b : Wor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_3 | 829ab5a6175bc9f8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 6 | [
{
"theorem_name": "mulModAddPartialHiCarry_eq_singleCarry_right",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mulModAddPartialHiCarry_eq_singleCarry]\n rw [BitVec.add_comm hi]",
"n_chars": 75,
... | [
{
"name": "mulModAddPartialHiCarry_eq_singleCarry",
"text": "/-- The two-step high carry of an add-partial is the same carry bit as adding\n the high product and incoming low carry before checking overflow. -/\ntheorem mulModAddPartialHiCarry_eq_singleCarry (hi lo a b : Word) :\n mulModAddPartialHiCar... | [
{
"name": "mulModAddPartialHiCarry_zero_zero",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 7,
"n_chars": 279,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false... | 4 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -60,8 +60,46 @@
exact Nat.le_trans (Nat.div_le_div_right h3) (Nat.le_of_eq this)
norm_num
+/-- The two-step high carry of an add-partial is the same carry bit as adding
+ the high product and incoming low carry before checking overflow. -/
+theorem mulModAddPartialHiCarry_eq_singleCarry (hi lo a b : Wor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_4 | 1adb3a32dcc5210d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 6 | [
{
"theorem_name": "mulModAddPartialHiCarry_eq_singleCarry_right",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mulModAddPartialHiCarry_eq_singleCarry]\n rw [BitVec.add_comm hi]",
"n_chars": 75,
... | [
{
"name": "mulModAddPartialHiCarry_eq_singleCarry",
"text": "/-- The two-step high carry of an add-partial is the same carry bit as adding\n the high product and incoming low carry before checking overflow. -/\ntheorem mulModAddPartialHiCarry_eq_singleCarry (hi lo a b : Word) :\n mulModAddPartialHiCar... | [
{
"name": "mulModProductLayoutCall00Carry104_zero",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 6,
"n_chars": 233,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": ... | 5 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -60,8 +60,46 @@
exact Nat.le_trans (Nat.div_le_div_right h3) (Nat.le_of_eq this)
norm_num
+/-- The two-step high carry of an add-partial is the same carry bit as adding
+ the high product and incoming low carry before checking overflow. -/
+theorem mulModAddPartialHiCarry_eq_singleCarry (hi lo a b : Wor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_5 | 24d431e5fda96e9b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 6 | [
{
"theorem_name": "mulModAddPartialHiCarry_eq_singleCarry_right",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mulModAddPartialHiCarry_eq_singleCarry]\n rw [BitVec.add_comm hi]",
"n_chars": 75,
... | [
{
"name": "mulModAddPartialHiCarry_eq_singleCarry",
"text": "/-- The two-step high carry of an add-partial is the same carry bit as adding\n the high product and incoming low carry before checking overflow. -/\ntheorem mulModAddPartialHiCarry_eq_singleCarry (hi lo a b : Word) :\n mulModAddPartialHiCar... | [
{
"name": "mulModProductLayoutCall00Carry112_zero",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 7,
"n_chars": 246,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": ... | 7 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -60,8 +60,46 @@
exact Nat.le_trans (Nat.div_le_div_right h3) (Nat.le_of_eq this)
norm_num
+/-- The two-step high carry of an add-partial is the same carry bit as adding
+ the high product and incoming low carry before checking overflow. -/
+theorem mulModAddPartialHiCarry_eq_singleCarry (hi lo a b : Wor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_6 | 508555c9ffdcd935 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 6 | [
{
"theorem_name": "mulModAddPartialHiCarry_eq_singleCarry_right",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mulModAddPartialHiCarry_eq_singleCarry]\n rw [BitVec.add_comm hi]",
"n_chars": 75,
... | [
{
"name": "mulModAddPartialHiCarry_eq_singleCarry",
"text": "/-- The two-step high carry of an add-partial is the same carry bit as adding\n the high product and incoming low carry before checking overflow. -/\ntheorem mulModAddPartialHiCarry_eq_singleCarry (hi lo a b : Word) :\n mulModAddPartialHiCar... | [
{
"name": "mulModProductLayoutCall00P112_zero",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 7,
"n_chars": 222,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": fals... | 6 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -60,8 +60,46 @@
exact Nat.le_trans (Nat.div_le_div_right h3) (Nat.le_of_eq this)
norm_num
+/-- The two-step high carry of an add-partial is the same carry bit as adding
+ the high product and incoming low carry before checking overflow. -/
+theorem mulModAddPartialHiCarry_eq_singleCarry (hi lo a b : Wor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_7 | 3bc5d44e2bf869bb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 6 | [
{
"theorem_name": "mulModAddPartialHiCarry_eq_singleCarry_right",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mulModAddPartialHiCarry_eq_singleCarry]\n rw [BitVec.add_comm hi]",
"n_chars": 75,
... | [
{
"name": "mulModAddPartialHiCarry_eq_singleCarry",
"text": "/-- The two-step high carry of an add-partial is the same carry bit as adding\n the high product and incoming low carry before checking overflow. -/\ntheorem mulModAddPartialHiCarry_eq_singleCarry (hi lo a b : Word) :\n mulModAddPartialHiCar... | [
{
"name": "mulModProductLayoutCall00P120_zero",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 7,
"n_chars": 222,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": fals... | 8 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -60,8 +60,46 @@
exact Nat.le_trans (Nat.div_le_div_right h3) (Nat.le_of_eq this)
norm_num
+/-- The two-step high carry of an add-partial is the same carry bit as adding
+ the high product and incoming low carry before checking overflow. -/
+theorem mulModAddPartialHiCarry_eq_singleCarry (hi lo a b : Wor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_8 | 70db8b1dc6577a35 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 1 | [
{
"theorem_name": "mulModProductLayoutCall00P104_eq_mulhu",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mulModProductLayoutCall00P104 mulModAddPartialHiValue mulModAddPartialHiBaseValue\n rw [mulM... | [
{
"name": "mulModAddPartialLoCarry_zero",
"text": "theorem mulModAddPartialLoCarry_zero (a b : Word) :\n mulModAddPartialLoCarry 0 a b = 0 := by\n unfold mulModAddPartialLoCarry mulModAddPartialLoValue mulModAddPartialLoProduct\n simp [BitVec.ult]\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars":... | [
{
"name": "mulModProductLayoutCall00P104_eq_mulhu",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 315,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": ... | 1 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -14,8 +14,16 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
+theorem mulModAddPartialLoCarry_zero (a b : Word) :
+ mulModAddPartialLoCarry 0 a b = 0 := by
+ unfold mulModAddPartialLoCarry mulModAddPartialLoValue mulModAddPartialLoProduct
+ simp [BitVec.ult]
+
theorem mulModProductLayoutCall00P... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_9 | b787233b516f1ad0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 6 | [
{
"theorem_name": "mulModAddPartialHiCarry_eq_singleCarry_right",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mulModAddPartialHiCarry_eq_singleCarry]\n rw [BitVec.add_comm hi]",
"n_chars": 75,
... | [
{
"name": "mulModAddPartialHiCarry_eq_singleCarry",
"text": "/-- The two-step high carry of an add-partial is the same carry bit as adding\n the high product and incoming low carry before checking overflow. -/\ntheorem mulModAddPartialHiCarry_eq_singleCarry (hi lo a b : Word) :\n mulModAddPartialHiCar... | [
{
"name": "mulModProductLayoutCall01Carry112_zero",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 9,
"n_lines": 8,
"n_chars": 344,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": ... | 9 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -60,13 +60,51 @@
exact Nat.le_trans (Nat.div_le_div_right h3) (Nat.le_of_eq this)
norm_num
+/-- The two-step high carry of an add-partial is the same carry bit as adding
+ the high product and incoming low carry before checking overflow. -/
+theorem mulModAddPartialHiCarry_eq_singleCarry (hi lo a b : Wo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_10 | 730eb65bd01a1a57 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 3 | [
{
"theorem_name": "mulModProductLayoutCall00Carry112_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mulModProductLayoutCall00Carry112\n rw [mulModProductLayoutCall00Carry104_zero]\n exact mul... | [
{
"name": "mulModCarryStepCarry_zero_zero",
"text": "theorem mulModCarryStepCarry_zero_zero :\n mulModCarryStepCarry 0 0 = (0 : Word) := by\n unfold mulModCarryStepCarry\n decide\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 129,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
... | [
{
"name": "mulModProductLayoutCall01P120_zero",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 13,
"n_lines": 7,
"n_chars": 258,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": fal... | 13 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -106,13 +106,21 @@
unfold mulModAddPartialHiProduct mulModAddPartialLoCarry mulModAddPartialLoValue mulModAddPartialLoProduct
simp [BitVec.ult]
+theorem mulModCarryStepCarry_zero_zero :
+ mulModCarryStepCarry 0 0 = (0 : Word) := by
+ unfold mulModCarryStepCarry
+ decide
+
theorem mulModProductLayoutCal... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_11 | 221cea172cc8e36b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 6 | [
{
"theorem_name": "mulModAddPartialHiCarry_eq_singleCarry_right",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mulModAddPartialHiCarry_eq_singleCarry]\n rw [BitVec.add_comm hi]",
"n_chars": 75,
... | [
{
"name": "mulModAddPartialHiCarry_eq_singleCarry",
"text": "/-- The two-step high carry of an add-partial is the same carry bit as adding\n the high product and incoming low carry before checking overflow. -/\ntheorem mulModAddPartialHiCarry_eq_singleCarry (hi lo a b : Word) :\n mulModAddPartialHiCar... | [
{
"name": "mulModProductLayoutCall00Carry120_zero",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 7,
"n_chars": 246,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": ... | 8 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -60,8 +60,46 @@
exact Nat.le_trans (Nat.div_le_div_right h3) (Nat.le_of_eq this)
norm_num
+/-- The two-step high carry of an add-partial is the same carry bit as adding
+ the high product and incoming low carry before checking overflow. -/
+theorem mulModAddPartialHiCarry_eq_singleCarry (hi lo a b : Wor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_12 | f645e2078da9c99c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 6 | [
{
"theorem_name": "mulModAddPartialHiCarry_eq_singleCarry_right",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mulModAddPartialHiCarry_eq_singleCarry]\n rw [BitVec.add_comm hi]",
"n_chars": 75,
... | [
{
"name": "mulModAddPartialHiCarry_eq_singleCarry",
"text": "/-- The two-step high carry of an add-partial is the same carry bit as adding\n the high product and incoming low carry before checking overflow. -/\ntheorem mulModAddPartialHiCarry_eq_singleCarry (hi lo a b : Word) :\n mulModAddPartialHiCar... | [
{
"name": "mulModProductLayoutCall00P128_zero",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 9,
"n_lines": 7,
"n_chars": 222,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": fals... | 9 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -60,8 +60,46 @@
exact Nat.le_trans (Nat.div_le_div_right h3) (Nat.le_of_eq this)
norm_num
+/-- The two-step high carry of an add-partial is the same carry bit as adding
+ the high product and incoming low carry before checking overflow. -/
+theorem mulModAddPartialHiCarry_eq_singleCarry (hi lo a b : Wor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_13 | 4ecea1e1546b572e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 3 | [
{
"theorem_name": "mulModProductLayoutCall00Carry112_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mulModProductLayoutCall00Carry112\n rw [mulModProductLayoutCall00Carry104_zero]\n exact mul... | [
{
"name": "mulModCarryStepCarry_zero_zero",
"text": "theorem mulModCarryStepCarry_zero_zero :\n mulModCarryStepCarry 0 0 = (0 : Word) := by\n unfold mulModCarryStepCarry\n decide\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 129,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
... | [
{
"name": "mulModProductLayoutCall01Carry120_zero",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 13,
"n_lines": 7,
"n_chars": 282,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only":... | 13 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -106,13 +106,21 @@
unfold mulModAddPartialHiProduct mulModAddPartialLoCarry mulModAddPartialLoValue mulModAddPartialLoProduct
simp [BitVec.ult]
+theorem mulModCarryStepCarry_zero_zero :
+ mulModCarryStepCarry 0 0 = (0 : Word) := by
+ unfold mulModCarryStepCarry
+ decide
+
theorem mulModProductLayoutCal... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_14 | 4142999f2ee52906 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 3 | [
{
"theorem_name": "mulModProductLayoutCall00Carry112_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mulModProductLayoutCall00Carry112\n rw [mulModProductLayoutCall00Carry104_zero]\n exact mul... | [
{
"name": "mulModCarryStepCarry_zero_zero",
"text": "theorem mulModCarryStepCarry_zero_zero :\n mulModCarryStepCarry 0 0 = (0 : Word) := by\n unfold mulModCarryStepCarry\n decide\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 129,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
... | [
{
"name": "mulModProductLayoutCall01P128_zero",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 16,
"n_lines": 7,
"n_chars": 258,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": fal... | 16 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -106,13 +106,21 @@
unfold mulModAddPartialHiProduct mulModAddPartialLoCarry mulModAddPartialLoValue mulModAddPartialLoProduct
simp [BitVec.ult]
+theorem mulModCarryStepCarry_zero_zero :
+ mulModCarryStepCarry 0 0 = (0 : Word) := by
+ unfold mulModCarryStepCarry
+ decide
+
theorem mulModProductLayoutCal... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_15 | 243ea6c08bb0da9f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 6 | [
{
"theorem_name": "mulModAddPartialHiCarry_eq_singleCarry_right",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mulModAddPartialHiCarry_eq_singleCarry]\n rw [BitVec.add_comm hi]",
"n_chars": 75,
... | [
{
"name": "mulModAddPartialHiCarry_eq_singleCarry",
"text": "/-- The two-step high carry of an add-partial is the same carry bit as adding\n the high product and incoming low carry before checking overflow. -/\ntheorem mulModAddPartialHiCarry_eq_singleCarry (hi lo a b : Word) :\n mulModAddPartialHiCar... | [
{
"name": "mulModProductLayoutCall02Carry112_eq_singleCarry_right",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 15,
"n_chars": 692,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"a... | 5 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -60,6 +60,41 @@
exact Nat.le_trans (Nat.div_le_div_right h3) (Nat.le_of_eq this)
norm_num
+/-- The two-step high carry of an add-partial is the same carry bit as adding
+ the high product and incoming low carry before checking overflow. -/
+theorem mulModAddPartialHiCarry_eq_singleCarry (hi lo a b : Wor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_16 | 3291070b111e6817 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 2 | [
{
"theorem_name": "mulModProductLayoutCall02P112_eq_expanded",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [mulModProductLayoutCall02P112, mulModProductLayoutCall01P112,\n mulModProductLayoutCall... | [
{
"name": "mulModAddPartialHiCarry_bvzero_zero",
"text": "theorem mulModAddPartialHiCarry_bvzero_zero (a b : Word) :\n mulModAddPartialHiCarry (0#64) (0#64) a b = 0 := by\n unfold mulModAddPartialHiCarry mulModAddPartialHiBaseCarry mulModAddPartialHiCarryFromLo\n unfold mulModAddPartialHiValue mulModAd... | [
{
"name": "mulModProductLayoutCall02P112_eq_expanded",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 26,
"n_chars": 1119,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_o... | 1 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -14,6 +14,13 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
+theorem mulModAddPartialHiCarry_bvzero_zero (a b : Word) :
+ mulModAddPartialHiCarry (0#64) (0#64) a b = 0 := by
+ unfold mulModAddPartialHiCarry mulModAddPartialHiBaseCarry mulModAddPartialHiCarryFromLo
+ unfold mulModAddPartialHiVal... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_17 | 9580385969fcf583 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 3 | [
{
"theorem_name": "mulModProductLayoutCall00Carry112_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mulModProductLayoutCall00Carry112\n rw [mulModProductLayoutCall00Carry104_zero]\n exact mul... | [
{
"name": "mulModCarryStepCarry_zero_zero",
"text": "theorem mulModCarryStepCarry_zero_zero :\n mulModCarryStepCarry 0 0 = (0 : Word) := by\n unfold mulModCarryStepCarry\n decide\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 129,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
... | [
{
"name": "mulModProductLayoutCall02Carry120_zero",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 16,
"n_lines": 14,
"n_chars": 738,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 0,
"automation_only... | 16 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -118,13 +118,21 @@
unfold mulModAddPartialHiProduct mulModAddPartialLoCarry mulModAddPartialLoValue mulModAddPartialLoProduct
simp [BitVec.ult]
+theorem mulModCarryStepCarry_zero_zero :
+ mulModCarryStepCarry 0 0 = (0 : Word) := by
+ unfold mulModCarryStepCarry
+ decide
+
theorem mulModProductLayoutCal... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_18 | a6333338088a3fe7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 2 | [
{
"theorem_name": "mulModProductLayoutCall00P120_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mulModProductLayoutCall00P120 mulModCarryStepValue\n rw [mulModProductLayoutCall00Carry112_zero]... | [
{
"name": "mulModProductLayoutCall00Carry112_zero",
"text": "theorem mulModProductLayoutCall00Carry112_zero (a b : EvmWord) :\n mulModProductLayoutCall00Carry112 a b = 0 := by\n unfold mulModProductLayoutCall00Carry112\n rw [mulModProductLayoutCall00Carry104_zero]\n exact mulModCarryStepCarry_zero_zer... | [
{
"name": "mulModProductLayoutCall02P128_zero",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 21,
"n_lines": 7,
"n_chars": 258,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": fal... | 21 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -128,6 +128,12 @@
unfold mulModProductLayoutCall00Carry104
exact mulModAddPartialHiCarry_zero_zero (a.getLimbN 0) (b.getLimbN 0)
+theorem mulModProductLayoutCall00Carry112_zero (a b : EvmWord) :
+ mulModProductLayoutCall00Carry112 a b = 0 := by
+ unfold mulModProductLayoutCall00Carry112
+ rw [mulModProd... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_19 | bcbbb53bfb6b3366 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 3 | [
{
"theorem_name": "mulModProductLayoutCall00Carry112_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mulModProductLayoutCall00Carry112\n rw [mulModProductLayoutCall00Carry104_zero]\n exact mul... | [
{
"name": "mulModCarryStepCarry_zero_zero",
"text": "theorem mulModCarryStepCarry_zero_zero :\n mulModCarryStepCarry 0 0 = (0 : Word) := by\n unfold mulModCarryStepCarry\n decide\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 129,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
... | [
{
"name": "mulModProductLayoutCall02P120_eq_carry112",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 14,
"n_lines": 7,
"n_chars": 262,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_onl... | 14 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -106,13 +106,21 @@
unfold mulModAddPartialHiProduct mulModAddPartialLoCarry mulModAddPartialLoValue mulModAddPartialLoProduct
simp [BitVec.ult]
+theorem mulModCarryStepCarry_zero_zero :
+ mulModCarryStepCarry 0 0 = (0 : Word) := by
+ unfold mulModCarryStepCarry
+ decide
+
theorem mulModProductLayoutCal... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_20 | af5e3b89689e7ea5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 2 | [
{
"theorem_name": "mulModProductLayoutCall02P112_eq_expanded",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [mulModProductLayoutCall02P112, mulModProductLayoutCall01P112,\n mulModProductLayoutCall... | [
{
"name": "mulModAddPartialHiCarry_bvzero_zero",
"text": "theorem mulModAddPartialHiCarry_bvzero_zero (a b : Word) :\n mulModAddPartialHiCarry (0#64) (0#64) a b = 0 := by\n unfold mulModAddPartialHiCarry mulModAddPartialHiBaseCarry mulModAddPartialHiCarryFromLo\n unfold mulModAddPartialHiValue mulModAd... | [
{
"name": "mulModProductLayoutCall02P120_eq_expanded",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 18,
"n_lines": 38,
"n_chars": 1668,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_... | 18 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -123,6 +123,13 @@
unfold mulModCarryStepCarry
decide
+theorem mulModAddPartialHiCarry_bvzero_zero (a b : Word) :
+ mulModAddPartialHiCarry (0#64) (0#64) a b = 0 := by
+ unfold mulModAddPartialHiCarry mulModAddPartialHiBaseCarry mulModAddPartialHiCarryFromLo
+ unfold mulModAddPartialHiValue mulModAddPart... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_21 | b7fa59a5a6a18d95 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 5 | [
{
"theorem_name": "mulModAddPartialHiCarry_eq_singleCarry",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [mulModAddPartialHiCarry_eq_add]\n rw [BitVec.toNat_add]\n simp... | [
{
"name": "mulModAddPartialHiCarry_eq_add",
"text": "/-- The RV64 `OR` used to combine the two carry bits of an add-partial high limb\n agrees with ordinary Word addition. -/\ntheorem mulModAddPartialHiCarry_eq_add (hi lo a b : Word) :\n mulModAddPartialHiCarry hi lo a b =\n mulModAddPartialHiBas... | [
{
"name": "mulModProductLayoutCall02Carry112_eq_add",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 464,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only... | 2 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -33,12 +33,28 @@
have hmod : (x.toNat + y.toNat) % 2^64 < 2^64 := Nat.mod_lt _ (by omega)
omega
+/-- The RV64 `OR` used to combine the two carry bits of an add-partial high limb
+ agrees with ordinary Word addition. -/
+theorem mulModAddPartialHiCarry_eq_add (hi lo a b : Word) :
+ mulModAddPartialHiCar... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_22 | d12fc14b46fc9b4a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 5 | [
{
"theorem_name": "mulModAddPartialHiCarry_eq_singleCarry",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [mulModAddPartialHiCarry_eq_add]\n rw [BitVec.toNat_add]\n simp... | [
{
"name": "mulModAddPartialHiCarry_eq_add",
"text": "/-- The RV64 `OR` used to combine the two carry bits of an add-partial high limb\n agrees with ordinary Word addition. -/\ntheorem mulModAddPartialHiCarry_eq_add (hi lo a b : Word) :\n mulModAddPartialHiCarry hi lo a b =\n mulModAddPartialHiBas... | [
{
"name": "mulModProductLayoutCall03Carry120_eq_add",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 464,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only... | 2 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -33,12 +33,28 @@
have hmod : (x.toNat + y.toNat) % 2^64 < 2^64 := Nat.mod_lt _ (by omega)
omega
+/-- The RV64 `OR` used to combine the two carry bits of an add-partial high limb
+ agrees with ordinary Word addition. -/
+theorem mulModAddPartialHiCarry_eq_add (hi lo a b : Word) :
+ mulModAddPartialHiCar... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_23 | 13419677a3b508c4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 5 | [
{
"theorem_name": "mulModAddPartialHiCarry_eq_singleCarry",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [mulModAddPartialHiCarry_eq_add]\n rw [BitVec.toNat_add]\n simp... | [
{
"name": "mulModAddPartialHiCarry_eq_add",
"text": "/-- The RV64 `OR` used to combine the two carry bits of an add-partial high limb\n agrees with ordinary Word addition. -/\ntheorem mulModAddPartialHiCarry_eq_add (hi lo a b : Word) :\n mulModAddPartialHiCarry hi lo a b =\n mulModAddPartialHiBas... | [
{
"name": "mulModProductLayoutCall04Carry120_eq_add",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 464,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only... | 2 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -33,12 +33,28 @@
have hmod : (x.toNat + y.toNat) % 2^64 < 2^64 := Nat.mod_lt _ (by omega)
omega
+/-- The RV64 `OR` used to combine the two carry bits of an add-partial high limb
+ agrees with ordinary Word addition. -/
+theorem mulModAddPartialHiCarry_eq_add (hi lo a b : Word) :
+ mulModAddPartialHiCar... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_24 | 7c4478ca674bca7d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 24 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 5 | [
{
"theorem_name": "mulModAddPartialHiCarry_eq_singleCarry",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [mulModAddPartialHiCarry_eq_add]\n rw [BitVec.toNat_add]\n simp... | [
{
"name": "mulModAddPartialHiCarry_eq_add",
"text": "/-- The RV64 `OR` used to combine the two carry bits of an add-partial high limb\n agrees with ordinary Word addition. -/\ntheorem mulModAddPartialHiCarry_eq_add (hi lo a b : Word) :\n mulModAddPartialHiCarry hi lo a b =\n mulModAddPartialHiBas... | [
{
"name": "mulModProductLayoutCall05Carry120_eq_add",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 464,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only... | 2 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -33,12 +33,28 @@
have hmod : (x.toNat + y.toNat) % 2^64 < 2^64 := Nat.mod_lt _ (by omega)
omega
+/-- The RV64 `OR` used to combine the two carry bits of an add-partial high limb
+ agrees with ordinary Word addition. -/
+theorem mulModAddPartialHiCarry_eq_add (hi lo a b : Word) :
+ mulModAddPartialHiCar... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_25 | d798ccfec835de03 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 25 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 3 | [
{
"theorem_name": "mulModProductLayoutCall03P112_eq_expanded",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mulModProductLayoutCall03P112_eq_add]\n rw [mulModProductLayoutCall02P112_eq_expanded]\n si... | [
{
"name": "mulModProductLayoutCall02P112_eq_expanded",
"text": "theorem mulModProductLayoutCall02P112_eq_expanded (a b : EvmWord) :\n mulModProductLayoutCall02P112 a b =\n rv64_mulhu (a.getLimbN 0) (b.getLimbN 1) +\n rv64_mulhu (a.getLimbN 1) (b.getLimbN 0) +\n (if BitVec.ult (rv64_mul... | [
{
"name": "mulModProductLayoutCall03P112_eq_expanded",
"fan_in": 3,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 21,
"n_chars": 826,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_onl... | 3 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -21,6 +21,31 @@
unfold mulModAddPartialLoValue mulModAddPartialLoProduct mulModAddPartialHiProduct
simp [BitVec.ult]
+theorem mulModProductLayoutCall02P112_eq_expanded (a b : EvmWord) :
+ mulModProductLayoutCall02P112 a b =
+ rv64_mulhu (a.getLimbN 0) (b.getLimbN 1) +
+ rv64_mulhu (a.getLimbN ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_26 | 7085d6341c8783f9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 26 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 1 | [
{
"theorem_name": "mulModProductLayoutCall03P112_eq_expanded",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mulModProductLayoutCall03P112_eq_add]\n rw [mulModProductLayoutCall02P112_eq_expanded]\n si... | [
{
"name": "mulModProductLayoutCall03P112_eq_add",
"text": "theorem mulModProductLayoutCall03P112_eq_add (a b : EvmWord) :\n mulModProductLayoutCall03P112 a b =\n mulModProductLayoutCall02P112 a b +\n mulModAddPartialLoProduct (a.getLimbN 2) (b.getLimbN 0) := by\n unfold mulModProductLayoutCa... | [
{
"name": "mulModProductLayoutCall04P112_eq_expanded",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 22,
"n_chars": 864,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_onl... | 5 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -46,6 +46,13 @@
mulModCarryStepValue, BitVec.ult]
ac_rfl
+theorem mulModProductLayoutCall03P112_eq_add (a b : EvmWord) :
+ mulModProductLayoutCall03P112 a b =
+ mulModProductLayoutCall02P112 a b +
+ mulModAddPartialLoProduct (a.getLimbN 2) (b.getLimbN 0) := by
+ unfold mulModProductLayoutCa... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_27 | b77513fd31f49cb7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 27 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 3 | [
{
"theorem_name": "mulModProductLayoutCall03P112_eq_expanded",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mulModProductLayoutCall03P112_eq_add]\n rw [mulModProductLayoutCall02P112_eq_expanded]\n si... | [
{
"name": "mulModProductLayoutCall02P112_eq_expanded",
"text": "theorem mulModProductLayoutCall02P112_eq_expanded (a b : EvmWord) :\n mulModProductLayoutCall02P112 a b =\n rv64_mulhu (a.getLimbN 0) (b.getLimbN 1) +\n rv64_mulhu (a.getLimbN 1) (b.getLimbN 0) +\n (if BitVec.ult (rv64_mul... | [
{
"name": "mulModProductLayoutCall03LoCarry_eq_expanded",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 26,
"n_chars": 1081,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation... | 2 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -21,6 +21,31 @@
unfold mulModAddPartialLoValue mulModAddPartialLoProduct mulModAddPartialHiProduct
simp [BitVec.ult]
+theorem mulModProductLayoutCall02P112_eq_expanded (a b : EvmWord) :
+ mulModProductLayoutCall02P112 a b =
+ rv64_mulhu (a.getLimbN 0) (b.getLimbN 1) +
+ rv64_mulhu (a.getLimbN ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_28 | d02e9e3c0fb0c820 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 28 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 1 | [
{
"theorem_name": "mulModProductLayoutCall03P112_eq_expanded",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mulModProductLayoutCall03P112_eq_add]\n rw [mulModProductLayoutCall02P112_eq_expanded]\n si... | [
{
"name": "mulModProductLayoutCall03P112_eq_add",
"text": "theorem mulModProductLayoutCall03P112_eq_add (a b : EvmWord) :\n mulModProductLayoutCall03P112 a b =\n mulModProductLayoutCall02P112 a b +\n mulModAddPartialLoProduct (a.getLimbN 2) (b.getLimbN 0) := by\n unfold mulModProductLayoutCa... | [
{
"name": "mulModProductLayoutCall04LoCarry_eq_expanded",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 27,
"n_chars": 1125,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation... | 4 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -46,6 +46,13 @@
mulModCarryStepValue, BitVec.ult]
ac_rfl
+theorem mulModProductLayoutCall03P112_eq_add (a b : EvmWord) :
+ mulModProductLayoutCall03P112 a b =
+ mulModProductLayoutCall02P112 a b +
+ mulModAddPartialLoProduct (a.getLimbN 2) (b.getLimbN 0) := by
+ unfold mulModProductLayoutCa... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_29 | 5272d55d23cc3a99 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 29 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 1 | [
{
"theorem_name": "mulModProductLayoutCall04P112_eq_expanded",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mulModProductLayoutCall04P112_eq_add]\n rw [mulModProductLayoutCall03P112_eq_expanded]\n si... | [
{
"name": "mulModProductLayoutCall04P112_eq_add",
"text": "theorem mulModProductLayoutCall04P112_eq_add (a b : EvmWord) :\n mulModProductLayoutCall04P112 a b =\n mulModProductLayoutCall03P112 a b +\n mulModAddPartialLoProduct (a.getLimbN 1) (b.getLimbN 1) := by\n unfold mulModProductLayoutCa... | [
{
"name": "mulModProductLayoutCall05LoCarry_eq_expanded",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 28,
"n_chars": 1169,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation... | 6 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -53,6 +53,13 @@
unfold mulModProductLayoutCall03P112 mulModAddPartialLoValue
ac_rfl
+theorem mulModProductLayoutCall04P112_eq_add (a b : EvmWord) :
+ mulModProductLayoutCall04P112 a b =
+ mulModProductLayoutCall03P112 a b +
+ mulModAddPartialLoProduct (a.getLimbN 1) (b.getLimbN 1) := by
+ unf... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ea76f6f49464_30 | a82a99457d35114e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutPublicAlgebra.lean | ProductLayoutPublicAlgebra | 30 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 75 | 3 | [
{
"theorem_name": "mulModProductLayoutCall09P120_eq_expanded",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mulModProductLayoutCall09P120_eq_add]\n rw [mulModProductLayoutCall08P120_eq_add]\n rw [mul... | [
{
"name": "mulModProductLayoutCall07P120_eq_add",
"text": "theorem mulModProductLayoutCall07P120_eq_add (a b : EvmWord) :\n mulModProductLayoutCall07P120 a b =\n mulModProductLayoutCall06P120 a b +\n mulModAddPartialLoProduct (a.getLimbN 2) (b.getLimbN 1) := by\n unfold mulModProductLayoutCa... | [
{
"name": "mulModProductLayoutCall09P120_eq_expanded",
"fan_in": 1,
"n_deps_direct": 7,
"n_deps_transitive": 7,
"n_lines": 25,
"n_chars": 1273,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 7,
"n_structural": 0,
"automation_on... | 7 | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | /-
EvmAsm.Evm64.MulMod.ProductLayoutPublicAlgebra
Algebra bridges from the concrete product-layout aliases to the public
low-limb postcondition cells.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall15
import EvmAsm.Evm64.MulMod.ProductLayoutCarryChain
import EvmAsm.Evm64.MulMod.ProductAlgebra
namespace EvmAsm.... | @@ -48,6 +48,13 @@
unfold mulModProductLayoutCall06P120 mulModAddPartialLoValue
ac_rfl
+theorem mulModProductLayoutCall07P120_eq_add (a b : EvmWord) :
+ mulModProductLayoutCall07P120 a b =
+ mulModProductLayoutCall06P120 a b +
+ mulModAddPartialLoProduct (a.getLimbN 2) (b.getLimbN 1) := by
+ unf... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.