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_763fc5d7bae0_3 | 414386ae51715fb8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/Base.lean | Base | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 3 | [
{
"theorem_name": "expIterBodyFullCode_squaring_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expIterBodyFullCode_eq_ofProg, exp_squaring_call_block_code_eq_ofProg]\n exact CodeReq.ofProg_mono_s... | [
{
"name": "expIterBodyFullCode_eq_ofProg",
"text": "theorem expIterBodyFullCode_eq_ofProg (base : Word)\n (mulOff : BitVec 21) (skipOff backOff : BitVec 13) :\n expIterBodyFullCode base mulOff skipOff backOff =\n CodeReq.ofProg base\n (EvmAsm.Evm64.exp_iter_body_full mulOff skipOff backOff... | [
{
"name": "expIterBodyFullCode_squaring_sub",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 840,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": fals... | 1 | /-
EvmAsm.Evm64.Exp.Compose.Base
Shared composition infrastructure for EXP: `expCode` (the union of all
sub-block `CodeReq`s), subsumption helpers tying sub-block codes back to
`expCode`, and shared length lemmas.
GH #92 composition work lands here and in sibling `Compose` modules. This
file keeps the sh... | /-
EvmAsm.Evm64.Exp.Compose.Base
Shared composition infrastructure for EXP: `expCode` (the union of all
sub-block `CodeReq`s), subsumption helpers tying sub-block codes back to
`expCode`, and shared length lemmas.
GH #92 composition work lands here and in sibling `Compose` modules. This
file keeps the sh... | @@ -52,10 +52,63 @@
CodeReq.ofProg (base + 224) (EvmAsm.Evm64.exp_loop_back backOff)
]
+theorem expIterBodyFullCode_eq_ofProg (base : Word)
+ (mulOff : BitVec 21) (skipOff backOff : BitVec 13) :
+ expIterBodyFullCode base mulOff skipOff backOff =
+ CodeReq.ofProg base
+ (EvmAsm.Evm64.exp_ite... | {
"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_763fc5d7bae0_4 | 65a975eb6964101c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/Base.lean | Base | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 3 | [
{
"theorem_name": "expIterBodyFullCode_squaring_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expIterBodyFullCode_eq_ofProg, exp_squaring_call_block_code_eq_ofProg]\n exact CodeReq.ofProg_mono_s... | [
{
"name": "expIterBodyFullCode_eq_ofProg",
"text": "theorem expIterBodyFullCode_eq_ofProg (base : Word)\n (mulOff : BitVec 21) (skipOff backOff : BitVec 13) :\n expIterBodyFullCode base mulOff skipOff backOff =\n CodeReq.ofProg base\n (EvmAsm.Evm64.exp_iter_body_full mulOff skipOff backOff... | [
{
"name": "expIterBodyFullCode_cond_mul_sub",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 24,
"n_chars": 940,
"n_subproofs": 0,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": fals... | 1 | /-
EvmAsm.Evm64.Exp.Compose.Base
Shared composition infrastructure for EXP: `expCode` (the union of all
sub-block `CodeReq`s), subsumption helpers tying sub-block codes back to
`expCode`, and shared length lemmas.
GH #92 composition work lands here and in sibling `Compose` modules. This
file keeps the sh... | /-
EvmAsm.Evm64.Exp.Compose.Base
Shared composition infrastructure for EXP: `expCode` (the union of all
sub-block `CodeReq`s), subsumption helpers tying sub-block codes back to
`expCode`, and shared length lemmas.
GH #92 composition work lands here and in sibling `Compose` modules. This
file keeps the sh... | @@ -52,11 +52,65 @@
CodeReq.ofProg (base + 224) (EvmAsm.Evm64.exp_loop_back backOff)
]
+theorem expIterBodyFullCode_eq_ofProg (base : Word)
+ (mulOff : BitVec 21) (skipOff backOff : BitVec 13) :
+ expIterBodyFullCode base mulOff skipOff backOff =
+ CodeReq.ofProg base
+ (EvmAsm.Evm64.exp_ite... | {
"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_763fc5d7bae0_5 | f916ec5e7cafd08d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/Base.lean | Base | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 3 | [
{
"theorem_name": "expIterBodyFullCode_squaring_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expIterBodyFullCode_eq_ofProg, exp_squaring_call_block_code_eq_ofProg]\n exact CodeReq.ofProg_mono_s... | [
{
"name": "expIterBodyFullCode_eq_ofProg",
"text": "theorem expIterBodyFullCode_eq_ofProg (base : Word)\n (mulOff : BitVec 21) (skipOff backOff : BitVec 13) :\n expIterBodyFullCode base mulOff skipOff backOff =\n CodeReq.ofProg base\n (EvmAsm.Evm64.exp_iter_body_full mulOff skipOff backOff... | [
{
"name": "expIterBodyFullCode_loop_back_sub",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 813,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": fal... | 1 | /-
EvmAsm.Evm64.Exp.Compose.Base
Shared composition infrastructure for EXP: `expCode` (the union of all
sub-block `CodeReq`s), subsumption helpers tying sub-block codes back to
`expCode`, and shared length lemmas.
GH #92 composition work lands here and in sibling `Compose` modules. This
file keeps the sh... | /-
EvmAsm.Evm64.Exp.Compose.Base
Shared composition infrastructure for EXP: `expCode` (the union of all
sub-block `CodeReq`s), subsumption helpers tying sub-block codes back to
`expCode`, and shared length lemmas.
GH #92 composition work lands here and in sibling `Compose` modules. This
file keeps the sh... | @@ -52,11 +52,64 @@
CodeReq.ofProg (base + 224) (EvmAsm.Evm64.exp_loop_back backOff)
]
+theorem expIterBodyFullCode_eq_ofProg (base : Word)
+ (mulOff : BitVec 21) (skipOff backOff : BitVec 13) :
+ expIterBodyFullCode base mulOff skipOff backOff =
+ CodeReq.ofProg base
+ (EvmAsm.Evm64.exp_ite... | {
"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_763fc5d7bae0_6 | b5c1a587e6bf58bd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/Base.lean | Base | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "expIterBodyFullCode_block_subs",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact ⟨expIterBodyFullCode_bit_test_sub, expIterBodyFullCode_squaring_sub,\n expIterBodyFullCode_cond_mul... | [
{
"name": "expIterBodyFullCode_cond_mul_sub",
"text": "theorem expIterBodyFullCode_cond_mul_sub {base : Word}\n {mulOff : BitVec 21} {skipOff backOff : BitVec 13} :\n ∀ a i, (EvmAsm.Evm64.exp_cond_mul_call_with_skip_block_code\n (base + 116) mulOff skipOff) a = some i →\n (expIterBodyFullCod... | [
{
"name": "expIterBodyFullCode_block_subs",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 5,
"n_lines": 16,
"n_chars": 936,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 5 | /-
EvmAsm.Evm64.Exp.Compose.Base
Shared composition infrastructure for EXP: `expCode` (the union of all
sub-block `CodeReq`s), subsumption helpers tying sub-block codes back to
`expCode`, and shared length lemmas.
GH #92 composition work lands here and in sibling `Compose` modules. This
file keeps the sh... | /-
EvmAsm.Evm64.Exp.Compose.Base
Shared composition infrastructure for EXP: `expCode` (the union of all
sub-block `CodeReq`s), subsumption helpers tying sub-block codes back to
`expCode`, and shared length lemmas.
GH #92 composition work lands here and in sibling `Compose` modules. This
file keeps the sh... | @@ -118,6 +118,29 @@
simp only [exp_iter_body_full_len]
norm_num)
+theorem expIterBodyFullCode_cond_mul_sub {base : Word}
+ {mulOff : BitVec 21} {skipOff backOff : BitVec 13} :
+ ∀ a i, (EvmAsm.Evm64.exp_cond_mul_call_with_skip_block_code
+ (base + 116) mulOff skipOff) a = some i →
+ (ex... | {
"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_7ff2a1459c38_0 | 84da641c34e0383d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutCall11.lean | ProductLayoutCall11 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_mulmod_product_layout_call11_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_call11_core_code_sub base)\n (by\n intro a i h\... | [
{
"name": "evm_mulmod_product_layout_call11_core_code_sub",
"text": "/-- Core+finish code for layout call 11 is contained in `evm_mulmod_product_layout`. -/\ntheorem evm_mulmod_product_layout_call11_core_code_sub (base : Word) :\n ∀ a i, (evm_mulmod_product_add_partial_core_finish_code (base + 1364)\n ... | [
{
"name": "evm_mulmod_product_layout_call11_code_sub",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 713,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 3,
"automation_onl... | 2 | /-
EvmAsm.Evm64.MulMod.ProductLayoutCall11
Product-layout call11 suffix composition for MULMOD.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall10
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.ProductLayoutCall11
Product-layout call11 suffix composition for MULMOD.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall10
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
local macro "evm_mulmod_product_layout_slice_rfl" : tactic =>
`(tactic|
first
| rfl
... | @@ -21,6 +21,20 @@
LD SD ADD SLTU OR' MUL MULHU single seq
rfl))
+/-- Core+finish code for layout call 11 is contained in `evm_mulmod_product_layout`. -/
+theorem evm_mulmod_product_layout_call11_core_code_sub (base : Word) :
+ ∀ a i, (evm_mulmod_product_add_partial_core_finish_code (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_89932d7ba7ea_0 | a29ca0a37b8ce890 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStateLoopReloadLimbFrames.lean | SavedBitFixedIterStateLoopReloadLimbFrames | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "expReloadDirectTailFrame_unfold",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expReloadDirectTailFrame, expReloadLimbDirectTailFrame_unfold]",
"n_chars": 72,
"n_subproofs": ... | [
{
"name": "expReloadLimbDirectTailFrame_unfold",
"text": "theorem expReloadLimbDirectTailFrame_unfold\n {ptr nextNextLimb : Word} :\n expReloadLimbDirectTailFrame ptr nextNextLimb =\n (((ptr + signExtend12 (-8 : BitVec 12)) +\n signExtend12 (0 : BitVec 12)) ↦ₘ nextNextLimb) := by\n delta ... | [
{
"name": "expReloadDirectTailFrame_unfold",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 340,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateLoopReloadLimbFrames
Opaque continuation-frame definitions for reload-limb direct adapters.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedControlFrame
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expReloadLimbDirectTailFrame
(ptr... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateLoopReloadLimbFrames
Opaque continuation-frame definitions for reload-limb direct adapters.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedControlFrame
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expReloadLimbDirectTailFrame
(ptr... | @@ -16,6 +16,14 @@
(((ptr + signExtend12 (-8 : BitVec 12)) +
signExtend12 (0 : BitVec 12)) ↦ₘ nextNextLimb)
+theorem expReloadLimbDirectTailFrame_unfold
+ {ptr nextNextLimb : Word} :
+ expReloadLimbDirectTailFrame ptr nextNextLimb =
+ (((ptr + signExtend12 (-8 : BitVec 12)) +
+ signExtend12 ... | {
"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_89932d7ba7ea_1 | d9e0035f2f836850 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStateLoopReloadLimbFrames.lean | SavedBitFixedIterStateLoopReloadLimbFrames | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "expReloadDirectFalseFrame_emp",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expReloadDirectFalseFrame_unfold, expReloadLimbDirectFalseFrame_unfold,\n sepConj_emp_right']",
"n... | [
{
"name": "expReloadLimbDirectFalseFrame_unfold",
"text": "theorem expReloadLimbDirectFalseFrame_unfold\n {controlC6 e iterCount ptr nextLimb : Word} :\n expReloadLimbDirectFalseFrame controlC6 e iterCount ptr nextLimb =\n (((ptr + signExtend12 (0 : BitVec 12)) ↦ₘ nextLimb) **\n ⌜expTwoMul... | [
{
"name": "expReloadDirectFalseFrame_emp",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 356,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateLoopReloadLimbFrames
Opaque continuation-frame definitions for reload-limb direct adapters.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedControlFrame
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expReloadLimbDirectTailFrame
(ptr... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateLoopReloadLimbFrames
Opaque continuation-frame definitions for reload-limb direct adapters.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedControlFrame
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expReloadLimbDirectTailFrame
(ptr... | @@ -30,6 +30,17 @@
⌜(e >>> (63 : BitVec 6).toNat) +
signExtend12 (0 : BitVec 12) = 0⌝)
+theorem expReloadLimbDirectFalseFrame_unfold
+ {controlC6 e iterCount ptr nextLimb : Word} :
+ expReloadLimbDirectFalseFrame controlC6 e iterCount ptr nextLimb =
+ (((ptr + signExtend12 (0 : BitVec 12)) ↦ₘ 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_89932d7ba7ea_2 | 343257ed03c81114 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStateLoopReloadLimbFrames.lean | SavedBitFixedIterStateLoopReloadLimbFrames | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "expReloadDirectTrueFrame_emp",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expReloadDirectTrueFrame_unfold, expReloadLimbDirectTrueFrame_unfold,\n sepConj_emp_right']",
"n_ch... | [
{
"name": "expReloadLimbDirectTrueFrame_unfold",
"text": "theorem expReloadLimbDirectTrueFrame_unfold\n {controlC6 e iterCount ptr nextLimb : Word} :\n expReloadLimbDirectTrueFrame controlC6 e iterCount ptr nextLimb =\n (((ptr + signExtend12 (0 : BitVec 12)) ↦ₘ nextLimb) **\n ⌜expTwoMulIte... | [
{
"name": "expReloadDirectTrueFrame_emp",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 351,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateLoopReloadLimbFrames
Opaque continuation-frame definitions for reload-limb direct adapters.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedControlFrame
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expReloadLimbDirectTailFrame
(ptr... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateLoopReloadLimbFrames
Opaque continuation-frame definitions for reload-limb direct adapters.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedControlFrame
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expReloadLimbDirectTailFrame
(ptr... | @@ -50,6 +50,17 @@
⌜(e >>> (63 : BitVec 6).toNat) +
signExtend12 (0 : BitVec 12) ≠ 0⌝)
+theorem expReloadLimbDirectTrueFrame_unfold
+ {controlC6 e iterCount ptr nextLimb : Word} :
+ expReloadLimbDirectTrueFrame controlC6 e iterCount ptr nextLimb =
+ (((ptr + signExtend12 (0 : BitVec 12)) ↦ₘ nex... | {
"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_4bcafe8887d0_0 | d8da14999e812f8d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/ModPreloopN4V4NoNop.lean | ModPreloopN4V4NoNop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "evm_mod_n4_preloop_max_skip_spec_within_v4",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_modCode_noNop_v4_to_modCode_v4\n (evm_mod_n4_preloop_max_skip_spec_with... | [
{
"name": "evm_mod_n4_preloop_max_skip_spec_within_v4_noNop",
"text": "/-- MOD n=4 pre-loop + max+skip loop body over the no-NOP v4 MOD code bundle. -/\ntheorem evm_mod_n4_preloop_max_skip_spec_within_v4_noNop (sp base : Word)\n (a0 a1 a2 a3 b0 b1 b2 b3 v5 v6 v7 v10 v11Old : Word)\n (q0 q1 q2 q3 u0Old... | [
{
"name": "evm_mod_n4_preloop_max_skip_spec_within_v4",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 35,
"n_chars": 2132,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_o... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.ModPreloopN4V4NoNop
v4/no-NOP MOD n=4 preloop compositions.
-/
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4V4NoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN4
import EvmAsm.Evm64.DivMod.Compose.FullPathN4CallV4NoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN4BeqV4NoNop
open... | /-
EvmAsm.Evm64.DivMod.Compose.ModPreloopN4V4NoNop
v4/no-NOP MOD n=4 preloop compositions.
-/
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4V4NoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN4
import EvmAsm.Evm64.DivMod.Compose.FullPathN4CallV4NoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN4BeqV4NoNop
open... | @@ -15,6 +15,81 @@
open EvmAsm.Rv64
+/-- MOD n=4 pre-loop + max+skip loop body over the no-NOP v4 MOD code bundle. -/
+theorem evm_mod_n4_preloop_max_skip_spec_within_v4_noNop (sp base : Word)
+ (a0 a1 a2 a3 b0 b1 b2 b3 v5 v6 v7 v10 v11Old : Word)
+ (q0 q1 q2 q3 u0Old u1Old u2Old u3Old u4Old u5 u6 u7 nMem sh... | {
"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_4bcafe8887d0_1 | 308eced5cb562e62 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/ModPreloopN4V4NoNop.lean | ModPreloopN4V4NoNop | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "evm_mod_n4_preloop_call_skip_spec_within_v4",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_modCode_noNop_v4_to_modCode_v4\n (evm_mod_n4_preloop_call_skip_spec_wi... | [
{
"name": "evm_mod_n4_preloop_call_skip_spec_within_v4_noNop",
"text": "/-- MOD n=4 pre-loop + call+skip loop body over the no-NOP v4 MOD code bundle. -/\ntheorem evm_mod_n4_preloop_call_skip_spec_within_v4_noNop (sp base : Word)\n (a0 a1 a2 a3 b0 b1 b2 b3 v5 v6 v7 v10 v11Old : Word)\n (q0 q1 q2 q3 u0... | [
{
"name": "evm_mod_n4_preloop_call_skip_spec_within_v4",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 43,
"n_chars": 2652,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.ModPreloopN4V4NoNop
v4/no-NOP MOD n=4 preloop compositions.
-/
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4V4NoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN4
import EvmAsm.Evm64.DivMod.Compose.FullPathN4CallV4NoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN4BeqV4NoNop
open... | /-
EvmAsm.Evm64.DivMod.Compose.ModPreloopN4V4NoNop
v4/no-NOP MOD n=4 preloop compositions.
-/
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4V4NoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN4
import EvmAsm.Evm64.DivMod.Compose.FullPathN4CallV4NoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN4BeqV4NoNop
open... | @@ -15,6 +15,92 @@
open EvmAsm.Rv64
+/-- MOD n=4 pre-loop + call+skip loop body over the no-NOP v4 MOD code bundle. -/
+theorem evm_mod_n4_preloop_call_skip_spec_within_v4_noNop (sp base : Word)
+ (a0 a1 a2 a3 b0 b1 b2 b3 v5 v6 v7 v10 v11Old : Word)
+ (q0 q1 q2 q3 u0Old u1Old u2Old u3Old u4Old u5 u6 u7 nMem ... | {
"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_4bcafe8887d0_2 | 9e3ab50bc29520dc | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/ModPreloopN4V4NoNop.lean | ModPreloopN4V4NoNop | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "evm_mod_n4_preloop_call_addback_beq_spec_within_v4",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_modCode_noNop_v4_to_modCode_v4\n (evm_mod_n4_preloop_call_addba... | [
{
"name": "evm_mod_n4_preloop_call_addback_beq_spec_within_v4_noNop",
"text": "/-- MOD n=4 pre-loop + call+addback BEQ loop body over the no-NOP v4 MOD code bundle. -/\ntheorem evm_mod_n4_preloop_call_addback_beq_spec_within_v4_noNop (sp base : Word)\n (a0 a1 a2 a3 b0 b1 b2 b3 v5 v6 v7 v10 v11Old : Word)... | [
{
"name": "evm_mod_n4_preloop_call_addback_beq_spec_within_v4",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 40,
"n_chars": 2736,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"auto... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.ModPreloopN4V4NoNop
v4/no-NOP MOD n=4 preloop compositions.
-/
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4V4NoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN4
import EvmAsm.Evm64.DivMod.Compose.FullPathN4CallV4NoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN4BeqV4NoNop
open... | /-
EvmAsm.Evm64.DivMod.Compose.ModPreloopN4V4NoNop
v4/no-NOP MOD n=4 preloop compositions.
-/
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4V4NoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN4
import EvmAsm.Evm64.DivMod.Compose.FullPathN4CallV4NoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN4BeqV4NoNop
open... | @@ -15,6 +15,86 @@
open EvmAsm.Rv64
+/-- MOD n=4 pre-loop + call+addback BEQ loop body over the no-NOP v4 MOD code bundle. -/
+theorem evm_mod_n4_preloop_call_addback_beq_spec_within_v4_noNop (sp base : Word)
+ (a0 a1 a2 a3 b0 b1 b2 b3 v5 v6 v7 v10 v11Old : Word)
+ (q0 q1 q2 q3 u0Old u1Old u2Old u3Old u4Old ... | {
"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_e3d7775a2904_0 | 37bd679c550361f1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedAccumulatorRun.lean | SavedBitFixedAccumulatorRun | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "expTwoMulFixedAccumulatorRun_suffix_eq_exp_of_invariant",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold expTwoMulFixedAccumulatorInvariant at hInv\n exact expTwoMulFixedAccumulato... | [
{
"name": "expTwoMulFixedAccumulatorRun_suffix_eq_exp_of_start",
"text": "/-- Running the remaining fixed-loop suffix from a semantically correct prefix\n reaches the full EXP result. -/\ntheorem expTwoMulFixedAccumulatorRun_suffix_eq_exp_of_start\n {baseWord exponentWord accWord : EvmWord} {k : Nat}\... | [
{
"name": "expTwoMulFixedAccumulatorRun_suffix_eq_exp_of_invariant",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 598,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedAccumulatorRun
Small algebraic helpers for composing the pure fixed-loop accumulator run.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
/-- Direct suffix form from the four-limb accumulator invariant. -/
theorem expTwoMu... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedAccumulatorRun
Small algebraic helpers for composing the pure fixed-loop accumulator run.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
/-- Running the remaining fixed-loop suffix from a semantically correct prefix
r... | @@ -8,6 +8,20 @@
namespace EvmAsm.Evm64.Exp.Compose
+/-- Running the remaining fixed-loop suffix from a semantically correct prefix
+ reaches the full EXP result. -/
+theorem expTwoMulFixedAccumulatorRun_suffix_eq_exp_of_start
+ {baseWord exponentWord accWord : EvmWord} {k : Nat}
+ (hk : k ≤ 256)
+ (hS... | {
"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_e3d7775a2904_1 | 64c29b4cc097bbc5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedAccumulatorRun.lean | SavedBitFixedAccumulatorRun | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "expTwoMulFixedAccumulatorRun_suffix_eq_exp_of_invariant",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold expTwoMulFixedAccumulatorInvariant at hInv\n exact expTwoMulFixedAccumulato... | [
{
"name": "expTwoMulFixedAccumulatorRun_suffix_eq_exp_of_start",
"text": "/-- Running the remaining fixed-loop suffix from a semantically correct prefix\n reaches the full EXP result. -/\ntheorem expTwoMulFixedAccumulatorRun_suffix_eq_exp_of_start\n {baseWord exponentWord accWord : EvmWord} {k : Nat}\... | [
{
"name": "expTwoMulFixedAccumulatorInvariant_full_of_suffix_run",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 725,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"au... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedAccumulatorRun
Small algebraic helpers for composing the pure fixed-loop accumulator run.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
/-- The remaining fixed-loop suffix preserves the full semantic invariant. -/
theore... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedAccumulatorRun
Small algebraic helpers for composing the pure fixed-loop accumulator run.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
/-- Running the remaining fixed-loop suffix from a semantically correct prefix
r... | @@ -8,6 +8,20 @@
namespace EvmAsm.Evm64.Exp.Compose
+/-- Running the remaining fixed-loop suffix from a semantically correct prefix
+ reaches the full EXP result. -/
+theorem expTwoMulFixedAccumulatorRun_suffix_eq_exp_of_start
+ {baseWord exponentWord accWord : EvmWord} {k : Nat}
+ (hk : k ≤ 256)
+ (hS... | {
"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_b109e6f8e57c_0 | a0cfb81888523a9c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DivAccumulate.lean | DivAccumulate | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 2 | [
{
"theorem_name": "accumulated_eq_val256_n4",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [val256_zero_upper_3]",
"n_chars": 30,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"... | [
{
"name": "val256_zero_upper_3",
"text": "/-- val256 with upper 3 limbs zero: reduces to single limb. -/\ntheorem val256_zero_upper_3 {q0 : Word} :\n val256 q0 0 0 0 = q0.toNat := by\n unfold val256; simp\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 165,
"n_subproofs": 0,
"n_tactics":... | [
{
"name": "accumulated_eq_val256_n4",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 193,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"ma... | 1 | /-
EvmAsm.Evm64.EvmWordArith.DivAccumulate
Multi-iteration quotient accumulation for Knuth's Algorithm D.
Each loop iteration produces one quotient digit q_j. These lemmas show
that the per-iteration Euclidean equations telescope into a single
Euclidean equation for the full multi-digit quotient.
For n-li... | /-
EvmAsm.Evm64.EvmWordArith.DivAccumulate
Multi-iteration quotient accumulation for Knuth's Algorithm D.
Each loop iteration produces one quotient digit q_j. These lemmas show
that the per-iteration Euclidean equations telescope into a single
Euclidean equation for the full multi-digit quotient.
For n-li... | @@ -30,9 +30,15 @@
-- val256 with trailing zeros (simplification lemmas)
-- ============================================================================
+/-- val256 with upper 3 limbs zero: reduces to single limb. -/
+theorem val256_zero_upper_3 {q0 : Word} :
+ val256 q0 0 0 0 = q0.toNat := by
+ unfold val256; ... | {
"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_b109e6f8e57c_1 | 780cd83edc693ac9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DivAccumulate.lean | DivAccumulate | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "accumulated_eq_val256_n3",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [val256_zero_upper_2]; ring",
"n_chars": 36,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,... | [
{
"name": "val256_zero_upper_2",
"text": "/-- val256 with upper 2 limbs zero: reduces to 2-limb value. -/\ntheorem val256_zero_upper_2 {q0 q1 : Word} :\n val256 q0 q1 0 0 = q0.toNat + q1.toNat * 2^64 := by\n unfold val256; simp\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 188,
"n_subproof... | [
{
"name": "accumulated_eq_val256_n3",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 222,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"ma... | 1 | /-
EvmAsm.Evm64.EvmWordArith.DivAccumulate
Multi-iteration quotient accumulation for Knuth's Algorithm D.
Each loop iteration produces one quotient digit q_j. These lemmas show
that the per-iteration Euclidean equations telescope into a single
Euclidean equation for the full multi-digit quotient.
For n-li... | /-
EvmAsm.Evm64.EvmWordArith.DivAccumulate
Multi-iteration quotient accumulation for Knuth's Algorithm D.
Each loop iteration produces one quotient digit q_j. These lemmas show
that the per-iteration Euclidean equations telescope into a single
Euclidean equation for the full multi-digit quotient.
For n-li... | @@ -30,9 +30,15 @@
-- val256 with trailing zeros (simplification lemmas)
-- ============================================================================
+/-- val256 with upper 2 limbs zero: reduces to 2-limb value. -/
+theorem val256_zero_upper_2 {q0 q1 : Word} :
+ val256 q0 q1 0 0 = q0.toNat + q1.toNat * 2^64 :... | {
"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_b109e6f8e57c_2 | 464d885dced09186 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DivAccumulate.lean | DivAccumulate | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "accumulated_eq_val256_n2",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [val256_zero_upper_1]; ring",
"n_chars": 36,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,... | [
{
"name": "val256_zero_upper_1",
"text": "/-- val256 with upper 1 limb zero: reduces to 3-limb value. -/\ntheorem val256_zero_upper_1 {q0 q1 q2 : Word} :\n val256 q0 q1 q2 0 = q0.toNat + q1.toNat * 2^64 + q2.toNat * 2^128 := by\n unfold val256; simp\n\n-- ================================================... | [
{
"name": "accumulated_eq_val256_n2",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 246,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"ma... | 1 | /-
EvmAsm.Evm64.EvmWordArith.DivAccumulate
Multi-iteration quotient accumulation for Knuth's Algorithm D.
Each loop iteration produces one quotient digit q_j. These lemmas show
that the per-iteration Euclidean equations telescope into a single
Euclidean equation for the full multi-digit quotient.
For n-li... | /-
EvmAsm.Evm64.EvmWordArith.DivAccumulate
Multi-iteration quotient accumulation for Knuth's Algorithm D.
Each loop iteration produces one quotient digit q_j. These lemmas show
that the per-iteration Euclidean equations telescope into a single
Euclidean equation for the full multi-digit quotient.
For n-li... | @@ -30,9 +30,30 @@
-- val256 with trailing zeros (simplification lemmas)
-- ============================================================================
+/-- val256 with upper 1 limb zero: reduces to 3-limb value. -/
+theorem val256_zero_upper_1 {q0 q1 q2 : Word} :
+ val256 q0 q1 q2 0 = q0.toNat + q1.toNat * 2^6... | {
"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_b109e6f8e57c_3 | e40a568eb5202db7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DivAccumulate.lean | DivAccumulate | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 2 | [
{
"theorem_name": "accumulated_eq_val256_n4",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [val256_zero_upper_3]",
"n_chars": 30,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"... | [
{
"name": "val256_zero_upper_3",
"text": "/-- val256 with upper 3 limbs zero: reduces to single limb. -/\ntheorem val256_zero_upper_3 {q0 : Word} :\n val256 q0 0 0 0 = q0.toNat := by\n unfold val256; simp\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 165,
"n_subproofs": 0,
"n_tactics":... | [
{
"name": "div_correct_n4_no_shift",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 27,
"n_chars": 1310,
"n_subproofs": 3,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"m... | 1 | /-
EvmAsm.Evm64.EvmWordArith.DivAccumulate
Multi-iteration quotient accumulation for Knuth's Algorithm D.
Each loop iteration produces one quotient digit q_j. These lemmas show
that the per-iteration Euclidean equations telescope into a single
Euclidean equation for the full multi-digit quotient.
For n-li... | /-
EvmAsm.Evm64.EvmWordArith.DivAccumulate
Multi-iteration quotient accumulation for Knuth's Algorithm D.
Each loop iteration produces one quotient digit q_j. These lemmas show
that the per-iteration Euclidean equations telescope into a single
Euclidean equation for the full multi-digit quotient.
For n-li... | @@ -30,6 +30,11 @@
-- val256 with trailing zeros (simplification lemmas)
-- ============================================================================
+/-- val256 with upper 3 limbs zero: reduces to single limb. -/
+theorem val256_zero_upper_3 {q0 : Word} :
+ val256 q0 0 0 0 = q0.toNat := by
+ unfold val256; ... | {
"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_b109e6f8e57c_4 | f22b08c5634c7419 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DivAccumulate.lean | DivAccumulate | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "accumulated_eq_val256_n3",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [val256_zero_upper_2]; ring",
"n_chars": 36,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,... | [
{
"name": "val256_zero_upper_2",
"text": "/-- val256 with upper 2 limbs zero: reduces to 2-limb value. -/\ntheorem val256_zero_upper_2 {q0 q1 : Word} :\n val256 q0 q1 0 0 = q0.toNat + q1.toNat * 2^64 := by\n unfold val256; simp\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 188,
"n_subproof... | [
{
"name": "div_correct_n3_no_shift",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 30,
"n_chars": 1404,
"n_subproofs": 3,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"... | 2 | /-
EvmAsm.Evm64.EvmWordArith.DivAccumulate
Multi-iteration quotient accumulation for Knuth's Algorithm D.
Each loop iteration produces one quotient digit q_j. These lemmas show
that the per-iteration Euclidean equations telescope into a single
Euclidean equation for the full multi-digit quotient.
For n-li... | /-
EvmAsm.Evm64.EvmWordArith.DivAccumulate
Multi-iteration quotient accumulation for Knuth's Algorithm D.
Each loop iteration produces one quotient digit q_j. These lemmas show
that the per-iteration Euclidean equations telescope into a single
Euclidean equation for the full multi-digit quotient.
For n-li... | @@ -30,9 +30,15 @@
-- val256 with trailing zeros (simplification lemmas)
-- ============================================================================
+/-- val256 with upper 2 limbs zero: reduces to 2-limb value. -/
+theorem val256_zero_upper_2 {q0 q1 : Word} :
+ val256 q0 q1 0 0 = q0.toNat + q1.toNat * 2^64 :... | {
"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_b109e6f8e57c_5 | 65d705340b94f90e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DivAccumulate.lean | DivAccumulate | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "accumulated_eq_val256_n2",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [val256_zero_upper_1]; ring",
"n_chars": 36,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,... | [
{
"name": "val256_zero_upper_1",
"text": "/-- val256 with upper 1 limb zero: reduces to 3-limb value. -/\ntheorem val256_zero_upper_1 {q0 q1 q2 : Word} :\n val256 q0 q1 q2 0 = q0.toNat + q1.toNat * 2^64 + q2.toNat * 2^128 := by\n unfold val256; simp\n\n-- ================================================... | [
{
"name": "div_correct_n2_no_shift",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 28,
"n_chars": 1343,
"n_subproofs": 3,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"... | 2 | /-
EvmAsm.Evm64.EvmWordArith.DivAccumulate
Multi-iteration quotient accumulation for Knuth's Algorithm D.
Each loop iteration produces one quotient digit q_j. These lemmas show
that the per-iteration Euclidean equations telescope into a single
Euclidean equation for the full multi-digit quotient.
For n-li... | /-
EvmAsm.Evm64.EvmWordArith.DivAccumulate
Multi-iteration quotient accumulation for Knuth's Algorithm D.
Each loop iteration produces one quotient digit q_j. These lemmas show
that the per-iteration Euclidean equations telescope into a single
Euclidean equation for the full multi-digit quotient.
For n-li... | @@ -30,9 +30,30 @@
-- val256 with trailing zeros (simplification lemmas)
-- ============================================================================
+/-- val256 with upper 1 limb zero: reduces to 3-limb value. -/
+theorem val256_zero_upper_1 {q0 q1 q2 : Word} :
+ val256 q0 q1 q2 0 = q0.toNat + q1.toNat * 2^6... | {
"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_b109e6f8e57c_6 | 074f322f7a26fffe | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DivAccumulate.lean | DivAccumulate | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "div_correct_n1_no_shift",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro a b q r\n have ⟨_, hr_lt⟩ := remainder_lt_of_ge_floor (val256_pos_of_or_ne_zero hbnz) hmulsub hge\n have h... | [
{
"name": "accumulated_eq_val256_n1",
"text": "/-- For n=1 (4 digits): the accumulated quotient matches val256(q0, q1, q2, q3). -/\ntheorem accumulated_eq_val256_n1 {q0 q1 q2 q3 : Word} :\n q3.toNat * 2^192 + q2.toNat * 2^128 + q1.toNat * 2^64 + q0.toNat =\n val256 q0 q1 q2 q3 := by\n unfold val256; ... | [
{
"name": "div_correct_n1_no_shift",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 33,
"n_chars": 1633,
"n_subproofs": 3,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"... | 1 | /-
EvmAsm.Evm64.EvmWordArith.DivAccumulate
Multi-iteration quotient accumulation for Knuth's Algorithm D.
Each loop iteration produces one quotient digit q_j. These lemmas show
that the per-iteration Euclidean equations telescope into a single
Euclidean equation for the full multi-digit quotient.
For n-li... | /-
EvmAsm.Evm64.EvmWordArith.DivAccumulate
Multi-iteration quotient accumulation for Knuth's Algorithm D.
Each loop iteration produces one quotient digit q_j. These lemmas show
that the per-iteration Euclidean equations telescope into a single
Euclidean equation for the full multi-digit quotient.
For n-li... | @@ -30,6 +30,16 @@
-- val256 with trailing zeros (simplification lemmas)
-- ============================================================================
+/-- For n=1 (4 digits): the accumulated quotient matches val256(q0, q1, q2, q3). -/
+theorem accumulated_eq_val256_n1 {q0 q1 q2 q3 : Word} :
+ q3.toNat * 2^192... | {
"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_b109e6f8e57c_7 | df428d5103a6da81 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DivAccumulate.lean | DivAccumulate | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "mod_of_denormalized_remainder",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n mod_of_val256_eq_mod hbnz (by rw [hr_denorm]; exact hr_mod)",
"n_chars": 62,
"n_subproofs": 0,
"n_ta... | [
{
"name": "mod_of_val256_eq_mod",
"text": "/-- Bridge from val256-level remainder correctness to EvmWord.mod.\n If val256(r_limbs) = val256(a_limbs) % val256(b_limbs), then\n fromLimbs(r_limbs) = EvmWord.mod(fromLimbs(a_limbs), fromLimbs(b_limbs)). -/\ntheorem mod_of_val256_eq_mod\n {a0 a1 a2 a3 b0... | [
{
"name": "mod_of_denormalized_remainder",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 1034,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.EvmWordArith.DivAccumulate
Multi-iteration quotient accumulation for Knuth's Algorithm D.
Each loop iteration produces one quotient digit q_j. These lemmas show
that the per-iteration Euclidean equations telescope into a single
Euclidean equation for the full multi-digit quotient.
For n-li... | /-
EvmAsm.Evm64.EvmWordArith.DivAccumulate
Multi-iteration quotient accumulation for Knuth's Algorithm D.
Each loop iteration produces one quotient digit q_j. These lemmas show
that the per-iteration Euclidean equations telescope into a single
Euclidean equation for the full multi-digit quotient.
For n-li... | @@ -30,6 +30,34 @@
-- val256 with trailing zeros (simplification lemmas)
-- ============================================================================
+/-- Bridge from val256-level remainder correctness to EvmWord.mod.
+ If val256(r_limbs) = val256(a_limbs) % val256(b_limbs), then
+ fromLimbs(r_limbs) = Evm... | {
"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_b109e6f8e57c_8 | a54a6c2c5f7a8693 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DivAccumulate.lean | DivAccumulate | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "div_correct_normalized",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n div_of_val256_eq_div hbnz (div_quotient_of_normalized hmulsub hlt)",
"n_chars": 69,
"n_subproofs": 0,
"n_ta... | [
{
"name": "div_quotient_of_normalized",
"text": "/-- General normalization bridge at the val256 level: accumulated quotient digits\n at normalized level → quotient equals original a/b.\n\n Given the Euclidean equation at the normalized level:\n val256(a) * 2^s = q_val * (val256(b) * 2^s) + r_norm... | [
{
"name": "div_correct_normalized",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 908,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max... | 2 | /-
EvmAsm.Evm64.EvmWordArith.DivAccumulate
Multi-iteration quotient accumulation for Knuth's Algorithm D.
Each loop iteration produces one quotient digit q_j. These lemmas show
that the per-iteration Euclidean equations telescope into a single
Euclidean equation for the full multi-digit quotient.
For n-li... | /-
EvmAsm.Evm64.EvmWordArith.DivAccumulate
Multi-iteration quotient accumulation for Knuth's Algorithm D.
Each loop iteration produces one quotient digit q_j. These lemmas show
that the per-iteration Euclidean equations telescope into a single
Euclidean equation for the full multi-digit quotient.
For n-li... | @@ -30,6 +30,21 @@
-- val256 with trailing zeros (simplification lemmas)
-- ============================================================================
+/-- General normalization bridge at the val256 level: accumulated quotient digits
+ at normalized level → quotient equals original a/b.
+
+ Given the Euclid... | {
"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_b109e6f8e57c_9 | 12fd70fa7c54e06d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DivAccumulate.lean | DivAccumulate | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "mod_of_denormalized_remainder",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n mod_of_val256_eq_mod hbnz (by rw [hr_denorm]; exact hr_mod)",
"n_chars": 62,
"n_subproofs": 0,
"n_ta... | [
{
"name": "mod_of_val256_eq_mod",
"text": "/-- Bridge from val256-level remainder correctness to EvmWord.mod.\n If val256(r_limbs) = val256(a_limbs) % val256(b_limbs), then\n fromLimbs(r_limbs) = EvmWord.mod(fromLimbs(a_limbs), fromLimbs(b_limbs)). -/\ntheorem mod_of_val256_eq_mod\n {a0 a1 a2 a3 b0... | [
{
"name": "mod_correct_normalized",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 20,
"n_chars": 922,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max... | 3 | /-
EvmAsm.Evm64.EvmWordArith.DivAccumulate
Multi-iteration quotient accumulation for Knuth's Algorithm D.
Each loop iteration produces one quotient digit q_j. These lemmas show
that the per-iteration Euclidean equations telescope into a single
Euclidean equation for the full multi-digit quotient.
For n-li... | /-
EvmAsm.Evm64.EvmWordArith.DivAccumulate
Multi-iteration quotient accumulation for Knuth's Algorithm D.
Each loop iteration produces one quotient digit q_j. These lemmas show
that the per-iteration Euclidean equations telescope into a single
Euclidean equation for the full multi-digit quotient.
For n-li... | @@ -37,6 +37,34 @@
r_norm / 2^s = aVal % bVal :=
(norm_euclidean_correct s hmulsub hlt).2
+/-- Bridge from val256-level remainder correctness to EvmWord.mod.
+ If val256(r_limbs) = val256(a_limbs) % val256(b_limbs), then
+ fromLimbs(r_limbs) = EvmWord.mod(fromLimbs(a_limbs), fromLimbs(b_limbs)). -/
+the... | {
"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_31ba745004ce_0 | b4a75446bb044152 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/HandlerBridge.lean | HandlerBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "sdivHandler_codeLenMatches",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold EvmState.codeLenMatches at h_codeLen ⊢\n rw [sdivHandler_codeLen, sdivHandler_code]\n exact h_codeLen",... | [
{
"name": "sdivHandler_codeLen",
"text": "theorem sdivHandler_codeLen\n (state : EvmState) :\n (ArithmeticHandlers.sdivHandler state).codeLen = state.codeLen := by\n cases h_stack : ArithmeticHandlers.binaryStack? EvmWord.sdiv state.stack <;>\n simp [ArithmeticHandlers.sdivHandler, ArithmeticHandl... | [
{
"name": "sdivHandler_codeLenMatches",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 273,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"... | 2 | /-
EvmAsm.Evm64.SDiv.HandlerBridge
Connects the pure SDIV opcode handler to the SDIV stack-execution bridge.
-/
import EvmAsm.Evm64.ArithmeticHandlers
import EvmAsm.Evm64.SDiv.StackExecutionBridge
namespace EvmAsm.Evm64
namespace SDivStackExecutionBridge
theorem sdivHandler_code
(state : EvmState) :
(Ar... | /-
EvmAsm.Evm64.SDiv.HandlerBridge
Connects the pure SDIV opcode handler to the SDIV stack-execution bridge.
-/
import EvmAsm.Evm64.ArithmeticHandlers
import EvmAsm.Evm64.SDiv.StackExecutionBridge
namespace EvmAsm.Evm64
namespace SDivStackExecutionBridge
theorem sdivHandler_code
(state : EvmState) :
(Ar... | @@ -17,9 +17,19 @@
simp [ArithmeticHandlers.sdivHandler, ArithmeticHandlers.binaryHandler,
EvmState.withStack, EvmState.invalid, EvmState.withStatus, h_stack]
+theorem sdivHandler_codeLen
+ (state : EvmState) :
+ (ArithmeticHandlers.sdivHandler state).codeLen = state.codeLen := by
+ cases h_stack :... | {
"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_0a4f285d839b_0 | 3198ea60a2f6df82 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN3V5LaneShift0Mod.lean | FullPathN3V5LaneShift0Mod | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_mod_n3_lane_shift0_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 56,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hb2ge : (b.getLimbN 2).toNat ≥ 2 ^ 63 := clz_zero_imp_msb hshift_z\n obtain ⟨bltu_1, hbltu_1⟩ : ∃ x, x = B... | [
{
"name": "n3_shift0_modPost_to_modStackDispatchPost_v5",
"text": "/-- Shift=0 MOD post bridge: the shift=0 full-path post implies `modStackDispatchPostV5`,\n given the per-limb `mod` facts. MOD mirror of `n3_shift0_fullPost_to_divStackDispatchPostV5`,\n routing through `modConcretePostNoX1ExactRegsF... | [
{
"name": "evm_mod_n3_lane_shift0_v5",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 74,
"n_chars": 4299,
"n_subproofs": 12,
"n_tactics": 61,
"cyclomatic": 1,
"n_automation": 26,
"n_rewrites": 13,
"n_structural": 11,
"automation_only": false,... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5LaneShift0Mod
The v5 n=3 MOD lane, shift=0 case: from the stack-dispatch precondition
`divModStackDispatchPreNoX1` to `modStackDispatchPostV5`, over `modCode_noNop_v5`,
given the normalization shift is zero (`clz b2 = 0`). MOD mirror of
`FullPathN3V5LaneShift0` (DI... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5LaneShift0Mod
The v5 n=3 MOD lane, shift=0 case: from the stack-dispatch precondition
`divModStackDispatchPreNoX1` to `modStackDispatchPostV5`, over `modCode_noNop_v5`,
given the normalization shift is zero (`clz b2 = 0`). MOD mirror of
`FullPathN3V5LaneShift0` (DI... | @@ -65,6 +65,92 @@
· simp only [n3Shift0R0, n3Shift0R1]; rw [hR1u4, ← hword]; exact EvmWord.getLimbN_fromLimbs_2
· simp only [n3Shift0R0, n3Shift0R1]; rw [hR1u4, ← hword]; exact EvmWord.getLimbN_fromLimbs_3
+/-- Shift=0 MOD post bridge: the shift=0 full-path post implies `modStackDispatchPostV5`,
+ given the... | {
"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_b3c4b23c0256_0 | 09e9c1dee43cbc51 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase2LongAcc.lean | Phase2LongAcc | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "rlp_phase2_long_acc_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [rlp_phase2_long_acc_post_unfold]\n -- Reshape the code requirement: a 2-instruction `ofProg` i... | [
{
"name": "rlp_phase2_long_acc_post_unfold",
"text": "theorem rlp_phase2_long_acc_post_unfold {len byte : Word} :\n rlp_phase2_long_acc_post len byte =\n ((.x11 ↦ᵣ ((len <<< 8) + byte)) ** (.x12 ↦ᵣ byte)) := by\n delta rlp_phase2_long_acc_post; rfl\n\n",
"fan_in": 1,
"n_lines": 6,
"n_char... | [
{
"name": "rlp_phase2_long_acc_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 39,
"n_chars": 2051,
"n_subproofs": 3,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 5,
"n_structural": 0,
"automation_only": fals... | 1 | /-
EvmAsm.Rv64.RLP.Phase2LongAcc
EL.3 Phase 2 (long form) — big-endian accumulation step.
For a long-form RLP prefix (`0xB8..0xBF` byte string or `0xF8..0xFF` list),
the payload length is encoded as the next `lenLen` bytes in big-endian.
Decoding loops over those bytes, accumulating:
length = length ... | /-
EvmAsm.Rv64.RLP.Phase2LongAcc
EL.3 Phase 2 (long form) — big-endian accumulation step.
For a long-form RLP prefix (`0xB8..0xBF` byte string or `0xF8..0xFF` list),
the payload length is encoded as the next `lenLen` bytes in big-endian.
Decoding loops over those bytes, accumulating:
length = length ... | @@ -56,6 +56,11 @@
let length' := (len <<< 8) + byte
(.x11 ↦ᵣ length') ** (.x12 ↦ᵣ byte)
+theorem rlp_phase2_long_acc_post_unfold {len byte : Word} :
+ rlp_phase2_long_acc_post len byte =
+ ((.x11 ↦ᵣ ((len <<< 8) + byte)) ** (.x12 ↦ᵣ byte)) := by
+ delta rlp_phase2_long_acc_post; rfl
+
/-- `cpsTripleWit... | {
"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_41d7e082bcfe_0 | 49cae5419adac01d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceInnerStepPrefix.lean | ReduceInnerStepPrefix | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_inner_step_shift_prefix_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hraw :=\n evm_mulmod_reduce512_inner_step_shift_prefix_raw_spec_within\n ... | [
{
"name": "evm_mulmod_reduce512_inner_step_shift_prefix_raw_spec_within",
"text": "theorem evm_mulmod_reduce512_inner_step_shift_prefix_raw_spec_within\n (sp base x17Old r0 r1 r2 r3 v5 v6 v19 v20 : Word) :\n cpsTripleWithin 21 base (base + 84)\n (evm_mulmod_reduce512_inner_step_shift_prefix_code ... | [
{
"name": "evm_mulmod_reduce512_inner_step_shift_prefix_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 18,
"n_chars": 865,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
... | 2 | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepPrefix
CPS spec for the shift-and-insert prefix of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.Program
import EvmAsm.Evm64.MulMod.ReduceCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.R... | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepPrefix
CPS spec for the shift-and-insert prefix of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.Program
import EvmAsm.Evm64.MulMod.ReduceCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.R... | @@ -93,6 +93,66 @@
mulModReduceShiftInBit_getLimbN_one, mulModReduceShiftInBit_getLimbN_two,
mulModReduceShiftInBit_getLimbN_three]
+theorem evm_mulmod_reduce512_inner_step_shift_prefix_raw_spec_within
+ (sp base x17Old r0 r1 r2 r3 v5 v6 v19 v20 : Word) :
+ cpsTripleWithin 21 base (base + 84)
+ (... | {
"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_41d7e082bcfe_1 | 83cb59cfd0156a51 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceInnerStepPrefix.lean | ReduceInnerStepPrefix | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_inner_step_shift_prefix_carry_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 52,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Prefix: 21 instructions, base → base+84, framed with `.x8 ↦ᵣ x8Old`.\n ... | [
{
"name": "inner_step_srli_carry_code_sub",
"text": "/-- The new `SRLI .x8 .x5 63` at byte offset 84 (program index 21) of\n `evm_mulmod_reduce512_inner_step` is subsumed by the full-step CodeReq. -/\nprivate theorem inner_step_srli_carry_code_sub (base : Word) :\n ∀ a i, CodeReq.singleton (base + 84)... | [
{
"name": "evm_mulmod_reduce512_inner_step_shift_prefix_carry_spec_within",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 70,
"n_chars": 3575,
"n_subproofs": 5,
"n_tactics": 48,
"cyclomatic": 3,
"n_automation": 4,
"n_rewrites": 6,
"n_structural":... | 5 | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepPrefix
CPS spec for the shift-and-insert prefix of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.Program
import EvmAsm.Evm64.MulMod.ReduceCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.R... | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepPrefix
CPS spec for the shift-and-insert prefix of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.Program
import EvmAsm.Evm64.MulMod.ReduceCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.R... | @@ -186,6 +186,20 @@
· decide
· decide
+/-- The new `SRLI .x8 .x5 63` at byte offset 84 (program index 21) of
+ `evm_mulmod_reduce512_inner_step` is subsumed by the full-step CodeReq. -/
+private theorem inner_step_srli_carry_code_sub (base : Word) :
+ ∀ a i, CodeReq.singleton (base + 84) (.SRLI .x8 .x5 (... | {
"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_f4458c8ba1eb_0 | 171af6abd7b7597d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6BodyModelBridge.lean | V6BodyModelBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "v6chainQ3_v6n_eq_model",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [v6nU4_eq_normU a0, v6nU3_eq_normU a0,\n v6nD_eq_normV (b1 := b1) (b2 := b2) (b3 := b3),\n v6chainQ3_eq... | [
{
"name": "v6nU4_eq_normU",
"text": "theorem v6nU4_eq_normU (a0 a1 a2 a3 b0 : Word) :\n v6nU4 a3 b0 = (fullDivN1NormU a0 a1 a2 a3 b0).2.2.2.2 := by\n unfold v6nU4 fullDivN1NormU fullDivN1AntiShift fullDivN1Shift\n simp only [AddrNorm.se12_0]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 208,
... | [
{
"name": "v6chainQ3_v6n_eq_model",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 531,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.V6BodyModelBridge
Connects the v6 fast-path body's *concrete* normalized window
(`v6nU{4,3,2,1,0}` / `v6nD`, the `normAFullPost` shift/antiShift limb
expressions produced by CLZ + normA) to the division model's normalized
components (`fullDivN1NormU` / `fullDivN1NormV`). The i... | /-
EvmAsm.Evm64.DivMod.Compose.V6BodyModelBridge
Connects the v6 fast-path body's *concrete* normalized window
(`v6nU{4,3,2,1,0}` / `v6nD`, the `normAFullPost` shift/antiShift limb
expressions produced by CLZ + normA) to the division model's normalized
components (`fullDivN1NormU` / `fullDivN1NormV`). The i... | @@ -27,6 +27,11 @@
-- Window-bridge equalities: body normalized limb = model `NormU`/`NormV` proj.
-- ============================================================================
+theorem v6nU4_eq_normU (a0 a1 a2 a3 b0 : Word) :
+ v6nU4 a3 b0 = (fullDivN1NormU a0 a1 a2 a3 b0).2.2.2.2 := by
+ unfold v6nU4 fullDi... | {
"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_f4458c8ba1eb_1 | 07f2550cc29b5861 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6BodyModelBridge.lean | V6BodyModelBridge | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "v6chainQ3_v6n_eq_model",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [v6nU4_eq_normU a0, v6nU3_eq_normU a0,\n v6nD_eq_normV (b1 := b1) (b2 := b2) (b3 := b3),\n v6chainQ3_eq... | [
{
"name": "v6nU4_eq_normU",
"text": "theorem v6nU4_eq_normU (a0 a1 a2 a3 b0 : Word) :\n v6nU4 a3 b0 = (fullDivN1NormU a0 a1 a2 a3 b0).2.2.2.2 := by\n unfold v6nU4 fullDivN1NormU fullDivN1AntiShift fullDivN1Shift\n simp only [AddrNorm.se12_0]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 208,
... | [
{
"name": "v6chainQ2_v6n_eq_model",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 12,
"n_chars": 566,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max... | 4 | /-
EvmAsm.Evm64.DivMod.Compose.V6BodyModelBridge
Connects the v6 fast-path body's *concrete* normalized window
(`v6nU{4,3,2,1,0}` / `v6nD`, the `normAFullPost` shift/antiShift limb
expressions produced by CLZ + normA) to the division model's normalized
components (`fullDivN1NormU` / `fullDivN1NormV`). The i... | /-
EvmAsm.Evm64.DivMod.Compose.V6BodyModelBridge
Connects the v6 fast-path body's *concrete* normalized window
(`v6nU{4,3,2,1,0}` / `v6nD`, the `normAFullPost` shift/antiShift limb
expressions produced by CLZ + normA) to the division model's normalized
components (`fullDivN1NormU` / `fullDivN1NormV`). The i... | @@ -27,6 +27,11 @@
-- Window-bridge equalities: body normalized limb = model `NormU`/`NormV` proj.
-- ============================================================================
+theorem v6nU4_eq_normU (a0 a1 a2 a3 b0 : Word) :
+ v6nU4 a3 b0 = (fullDivN1NormU a0 a1 a2 a3 b0).2.2.2.2 := by
+ unfold v6nU4 fullDi... | {
"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_f4458c8ba1eb_2 | 3f933a83c635023a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6BodyModelBridge.lean | V6BodyModelBridge | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "v6chainQ3_v6n_eq_model",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [v6nU4_eq_normU a0, v6nU3_eq_normU a0,\n v6nD_eq_normV (b1 := b1) (b2 := b2) (b3 := b3),\n v6chainQ3_eq... | [
{
"name": "v6nU4_eq_normU",
"text": "theorem v6nU4_eq_normU (a0 a1 a2 a3 b0 : Word) :\n v6nU4 a3 b0 = (fullDivN1NormU a0 a1 a2 a3 b0).2.2.2.2 := by\n unfold v6nU4 fullDivN1NormU fullDivN1AntiShift fullDivN1Shift\n simp only [AddrNorm.se12_0]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 208,
... | [
{
"name": "v6chainQ1_v6n_eq_model",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 12,
"n_chars": 607,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max... | 5 | /-
EvmAsm.Evm64.DivMod.Compose.V6BodyModelBridge
Connects the v6 fast-path body's *concrete* normalized window
(`v6nU{4,3,2,1,0}` / `v6nD`, the `normAFullPost` shift/antiShift limb
expressions produced by CLZ + normA) to the division model's normalized
components (`fullDivN1NormU` / `fullDivN1NormV`). The i... | /-
EvmAsm.Evm64.DivMod.Compose.V6BodyModelBridge
Connects the v6 fast-path body's *concrete* normalized window
(`v6nU{4,3,2,1,0}` / `v6nD`, the `normAFullPost` shift/antiShift limb
expressions produced by CLZ + normA) to the division model's normalized
components (`fullDivN1NormU` / `fullDivN1NormV`). The i... | @@ -27,6 +27,11 @@
-- Window-bridge equalities: body normalized limb = model `NormU`/`NormV` proj.
-- ============================================================================
+theorem v6nU4_eq_normU (a0 a1 a2 a3 b0 : Word) :
+ v6nU4 a3 b0 = (fullDivN1NormU a0 a1 a2 a3 b0).2.2.2.2 := by
+ unfold v6nU4 fullDi... | {
"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_f4458c8ba1eb_3 | 96cdae3743bf8834 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6BodyModelBridge.lean | V6BodyModelBridge | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "v6chainQ3_v6n_eq_model",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [v6nU4_eq_normU a0, v6nU3_eq_normU a0,\n v6nD_eq_normV (b1 := b1) (b2 := b2) (b3 := b3),\n v6chainQ3_eq... | [
{
"name": "v6nU3_eq_normU",
"text": "theorem v6nU3_eq_normU (a0 a1 a2 a3 b0 : Word) :\n v6nU3 a3 a2 b0 = (fullDivN1NormU a0 a1 a2 a3 b0).2.2.2.1 := by\n unfold v6nU3 fullDivN1NormU fullDivN1AntiShift fullDivN1Shift\n simp only [AddrNorm.se12_0]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 21... | [
{
"name": "v6chainQ0_v6n_eq_model",
"fan_in": 1,
"n_deps_direct": 6,
"n_deps_transitive": 6,
"n_lines": 17,
"n_chars": 884,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max... | 6 | /-
EvmAsm.Evm64.DivMod.Compose.V6BodyModelBridge
Connects the v6 fast-path body's *concrete* normalized window
(`v6nU{4,3,2,1,0}` / `v6nD`, the `normAFullPost` shift/antiShift limb
expressions produced by CLZ + normA) to the division model's normalized
components (`fullDivN1NormU` / `fullDivN1NormV`). The i... | /-
EvmAsm.Evm64.DivMod.Compose.V6BodyModelBridge
Connects the v6 fast-path body's *concrete* normalized window
(`v6nU{4,3,2,1,0}` / `v6nD`, the `normAFullPost` shift/antiShift limb
expressions produced by CLZ + normA) to the division model's normalized
components (`fullDivN1NormU` / `fullDivN1NormV`). The i... | @@ -32,6 +32,11 @@
unfold v6nU4 fullDivN1NormU fullDivN1AntiShift fullDivN1Shift
simp only [AddrNorm.se12_0]
+theorem v6nU3_eq_normU (a0 a1 a2 a3 b0 : Word) :
+ v6nU3 a3 a2 b0 = (fullDivN1NormU a0 a1 a2 a3 b0).2.2.2.1 := by
+ unfold v6nU3 fullDivN1NormU fullDivN1AntiShift fullDivN1Shift
+ simp only [AddrNo... | {
"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_f4458c8ba1eb_4 | 2651c3a311cf5ce7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6BodyModelBridge.lean | V6BodyModelBridge | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "v6chainQ3_v6n_eq_model",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [v6nU4_eq_normU a0, v6nU3_eq_normU a0,\n v6nD_eq_normV (b1 := b1) (b2 := b2) (b3 := b3),\n v6chainQ3_eq... | [
{
"name": "v6nU3_eq_normU",
"text": "theorem v6nU3_eq_normU (a0 a1 a2 a3 b0 : Word) :\n v6nU3 a3 a2 b0 = (fullDivN1NormU a0 a1 a2 a3 b0).2.2.2.1 := by\n unfold v6nU3 fullDivN1NormU fullDivN1AntiShift fullDivN1Shift\n simp only [AddrNorm.se12_0]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 21... | [
{
"name": "v6n_quotient_word_eq_div",
"fan_in": 4,
"n_deps_direct": 4,
"n_deps_transitive": 10,
"n_lines": 31,
"n_chars": 1968,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 10 | /-
EvmAsm.Evm64.DivMod.Compose.V6BodyModelBridge
Connects the v6 fast-path body's *concrete* normalized window
(`v6nU{4,3,2,1,0}` / `v6nD`, the `normAFullPost` shift/antiShift limb
expressions produced by CLZ + normA) to the division model's normalized
components (`fullDivN1NormU` / `fullDivN1NormV`). The i... | /-
EvmAsm.Evm64.DivMod.Compose.V6BodyModelBridge
Connects the v6 fast-path body's *concrete* normalized window
(`v6nU{4,3,2,1,0}` / `v6nD`, the `normAFullPost` shift/antiShift limb
expressions produced by CLZ + normA) to the division model's normalized
components (`fullDivN1NormU` / `fullDivN1NormV`). The i... | @@ -32,6 +32,11 @@
unfold v6nU4 fullDivN1NormU fullDivN1AntiShift fullDivN1Shift
simp only [AddrNorm.se12_0]
+theorem v6nU3_eq_normU (a0 a1 a2 a3 b0 : Word) :
+ v6nU3 a3 a2 b0 = (fullDivN1NormU a0 a1 a2 a3 b0).2.2.2.1 := by
+ unfold v6nU3 fullDivN1NormU fullDivN1AntiShift fullDivN1Shift
+ simp only [AddrNo... | {
"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_f4458c8ba1eb_5 | 1b8fb5938983dad3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6BodyModelBridge.lean | V6BodyModelBridge | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "v6chainQ3_v6n_eq_model",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [v6nU4_eq_normU a0, v6nU3_eq_normU a0,\n v6nD_eq_normV (b1 := b1) (b2 := b2) (b3 := b3),\n v6chainQ3_eq... | [
{
"name": "v6nU3_eq_normU",
"text": "theorem v6nU3_eq_normU (a0 a1 a2 a3 b0 : Word) :\n v6nU3 a3 a2 b0 = (fullDivN1NormU a0 a1 a2 a3 b0).2.2.2.1 := by\n unfold v6nU3 fullDivN1NormU fullDivN1AntiShift fullDivN1Shift\n simp only [AddrNorm.se12_0]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 21... | [
{
"name": "v6n_div_getLimbN_0",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 11,
"n_lines": 14,
"n_chars": 754,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_ne... | 11 | /-
EvmAsm.Evm64.DivMod.Compose.V6BodyModelBridge
Connects the v6 fast-path body's *concrete* normalized window
(`v6nU{4,3,2,1,0}` / `v6nD`, the `normAFullPost` shift/antiShift limb
expressions produced by CLZ + normA) to the division model's normalized
components (`fullDivN1NormU` / `fullDivN1NormV`). The i... | /-
EvmAsm.Evm64.DivMod.Compose.V6BodyModelBridge
Connects the v6 fast-path body's *concrete* normalized window
(`v6nU{4,3,2,1,0}` / `v6nD`, the `normAFullPost` shift/antiShift limb
expressions produced by CLZ + normA) to the division model's normalized
components (`fullDivN1NormU` / `fullDivN1NormV`). The i... | @@ -32,6 +32,11 @@
unfold v6nU4 fullDivN1NormU fullDivN1AntiShift fullDivN1Shift
simp only [AddrNorm.se12_0]
+theorem v6nU3_eq_normU (a0 a1 a2 a3 b0 : Word) :
+ v6nU3 a3 a2 b0 = (fullDivN1NormU a0 a1 a2 a3 b0).2.2.2.1 := by
+ unfold v6nU3 fullDivN1NormU fullDivN1AntiShift fullDivN1Shift
+ simp only [AddrNo... | {
"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_f4458c8ba1eb_6 | fa272f1114ce607b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6BodyModelBridge.lean | V6BodyModelBridge | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "v6chainQ3_v6n_eq_model",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [v6nU4_eq_normU a0, v6nU3_eq_normU a0,\n v6nD_eq_normV (b1 := b1) (b2 := b2) (b3 := b3),\n v6chainQ3_eq... | [
{
"name": "v6nU3_eq_normU",
"text": "theorem v6nU3_eq_normU (a0 a1 a2 a3 b0 : Word) :\n v6nU3 a3 a2 b0 = (fullDivN1NormU a0 a1 a2 a3 b0).2.2.2.1 := by\n unfold v6nU3 fullDivN1NormU fullDivN1AntiShift fullDivN1Shift\n simp only [AddrNorm.se12_0]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 21... | [
{
"name": "v6n_div_getLimbN_1",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 11,
"n_lines": 14,
"n_chars": 740,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_ne... | 11 | /-
EvmAsm.Evm64.DivMod.Compose.V6BodyModelBridge
Connects the v6 fast-path body's *concrete* normalized window
(`v6nU{4,3,2,1,0}` / `v6nD`, the `normAFullPost` shift/antiShift limb
expressions produced by CLZ + normA) to the division model's normalized
components (`fullDivN1NormU` / `fullDivN1NormV`). The i... | /-
EvmAsm.Evm64.DivMod.Compose.V6BodyModelBridge
Connects the v6 fast-path body's *concrete* normalized window
(`v6nU{4,3,2,1,0}` / `v6nD`, the `normAFullPost` shift/antiShift limb
expressions produced by CLZ + normA) to the division model's normalized
components (`fullDivN1NormU` / `fullDivN1NormV`). The i... | @@ -32,6 +32,11 @@
unfold v6nU4 fullDivN1NormU fullDivN1AntiShift fullDivN1Shift
simp only [AddrNorm.se12_0]
+theorem v6nU3_eq_normU (a0 a1 a2 a3 b0 : Word) :
+ v6nU3 a3 a2 b0 = (fullDivN1NormU a0 a1 a2 a3 b0).2.2.2.1 := by
+ unfold v6nU3 fullDivN1NormU fullDivN1AntiShift fullDivN1Shift
+ simp only [AddrNo... | {
"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_f4458c8ba1eb_7 | a2d5c8a5e19ea2a0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6BodyModelBridge.lean | V6BodyModelBridge | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "v6chainQ3_v6n_eq_model",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [v6nU4_eq_normU a0, v6nU3_eq_normU a0,\n v6nD_eq_normV (b1 := b1) (b2 := b2) (b3 := b3),\n v6chainQ3_eq... | [
{
"name": "v6nU3_eq_normU",
"text": "theorem v6nU3_eq_normU (a0 a1 a2 a3 b0 : Word) :\n v6nU3 a3 a2 b0 = (fullDivN1NormU a0 a1 a2 a3 b0).2.2.2.1 := by\n unfold v6nU3 fullDivN1NormU fullDivN1AntiShift fullDivN1Shift\n simp only [AddrNorm.se12_0]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 21... | [
{
"name": "v6n_div_getLimbN_2",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 11,
"n_lines": 14,
"n_chars": 723,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_ne... | 11 | /-
EvmAsm.Evm64.DivMod.Compose.V6BodyModelBridge
Connects the v6 fast-path body's *concrete* normalized window
(`v6nU{4,3,2,1,0}` / `v6nD`, the `normAFullPost` shift/antiShift limb
expressions produced by CLZ + normA) to the division model's normalized
components (`fullDivN1NormU` / `fullDivN1NormV`). The i... | /-
EvmAsm.Evm64.DivMod.Compose.V6BodyModelBridge
Connects the v6 fast-path body's *concrete* normalized window
(`v6nU{4,3,2,1,0}` / `v6nD`, the `normAFullPost` shift/antiShift limb
expressions produced by CLZ + normA) to the division model's normalized
components (`fullDivN1NormU` / `fullDivN1NormV`). The i... | @@ -32,6 +32,11 @@
unfold v6nU4 fullDivN1NormU fullDivN1AntiShift fullDivN1Shift
simp only [AddrNorm.se12_0]
+theorem v6nU3_eq_normU (a0 a1 a2 a3 b0 : Word) :
+ v6nU3 a3 a2 b0 = (fullDivN1NormU a0 a1 a2 a3 b0).2.2.2.1 := by
+ unfold v6nU3 fullDivN1NormU fullDivN1AntiShift fullDivN1Shift
+ simp only [AddrNo... | {
"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_f4458c8ba1eb_8 | 3995568ef6603346 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6BodyModelBridge.lean | V6BodyModelBridge | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "v6chainQ3_v6n_eq_model",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [v6nU4_eq_normU a0, v6nU3_eq_normU a0,\n v6nD_eq_normV (b1 := b1) (b2 := b2) (b3 := b3),\n v6chainQ3_eq... | [
{
"name": "v6nU3_eq_normU",
"text": "theorem v6nU3_eq_normU (a0 a1 a2 a3 b0 : Word) :\n v6nU3 a3 a2 b0 = (fullDivN1NormU a0 a1 a2 a3 b0).2.2.2.1 := by\n unfold v6nU3 fullDivN1NormU fullDivN1AntiShift fullDivN1Shift\n simp only [AddrNorm.se12_0]\n\n",
"fan_in": 4,
"n_lines": 6,
"n_chars": 21... | [
{
"name": "v6n_div_getLimbN_3",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 11,
"n_lines": 14,
"n_chars": 706,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_ne... | 11 | /-
EvmAsm.Evm64.DivMod.Compose.V6BodyModelBridge
Connects the v6 fast-path body's *concrete* normalized window
(`v6nU{4,3,2,1,0}` / `v6nD`, the `normAFullPost` shift/antiShift limb
expressions produced by CLZ + normA) to the division model's normalized
components (`fullDivN1NormU` / `fullDivN1NormV`). The i... | /-
EvmAsm.Evm64.DivMod.Compose.V6BodyModelBridge
Connects the v6 fast-path body's *concrete* normalized window
(`v6nU{4,3,2,1,0}` / `v6nD`, the `normAFullPost` shift/antiShift limb
expressions produced by CLZ + normA) to the division model's normalized
components (`fullDivN1NormU` / `fullDivN1NormV`). The i... | @@ -32,6 +32,11 @@
unfold v6nU4 fullDivN1NormU fullDivN1AntiShift fullDivN1Shift
simp only [AddrNorm.se12_0]
+theorem v6nU3_eq_normU (a0 a1 a2 a3 b0 : Word) :
+ v6nU3 a3 a2 b0 = (fullDivN1NormU a0 a1 a2 a3 b0).2.2.2.1 := by
+ unfold v6nU3 fullDivN1NormU fullDivN1AntiShift fullDivN1Shift
+ simp only [AddrNo... | {
"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_cbe28f2e42fd_0 | 73bbd851a920b590 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3V5ModRemainder.lean | N3V5ModRemainder | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "fullModN3RemainderWordV5_eq_mod_of_shape",
"depth": 1,
"n_commands": 0,
"n_lines": 53,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h0 : (0 : Word).toNat = 0 := rfl\n have hbnz : b0 ||| b1 ||| b2 ||| b3 ≠ 0 := by\n intro... | [
{
"name": "fullDivN3_normalized_euclidean_of_shape",
"text": "/-- **v5 n=3 normalized Euclidean equation from shape (shift≠0).**\n `val256 a · 2^s = Q · (val256 b · 2^s) + R_norm` (mulsub form) together with the\n remainder bound `R_norm < val256 b · 2^s`, where `Q = R1.1·2^64 + R0.1` and\n `R_norm... | [
{
"name": "fullModN3RemainderWordV5_eq_mod_of_shape",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 73,
"n_chars": 4706,
"n_subproofs": 13,
"n_tactics": 58,
"cyclomatic": 2,
"n_automation": 9,
"n_rewrites": 8,
"n_structural": 9,
"automation_o... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.N3V5ModRemainder
**v5 n=3 MOD remainder correctness from shape (shift≠0):**
`fullModN3RemainderWordV5 = EvmWord.mod a b`.
The MOD analog of `fullDivN3QuotientWordV5_eq_div_of_shape` (N3V5QuotientShape):
the final v5 n=3 remainder, denormalized (funnel-shifted down by `fullDivN3Sh... | /-
EvmAsm.Evm64.DivMod.Spec.N3V5ModRemainder
**v5 n=3 MOD remainder correctness from shape (shift≠0):**
`fullModN3RemainderWordV5 = EvmWord.mod a b`.
The MOD analog of `fullDivN3QuotientWordV5_eq_div_of_shape` (N3V5QuotientShape):
the final v5 n=3 remainder, denormalized (funnel-shifted down by `fullDivN3Sh... | @@ -21,6 +21,75 @@
open EvmWord EvmAsm.Rv64
+/-- **v5 n=3 normalized Euclidean equation from shape (shift≠0).**
+ `val256 a · 2^s = Q · (val256 b · 2^s) + R_norm` (mulsub form) together with the
+ remainder bound `R_norm < val256 b · 2^s`, where `Q = R1.1·2^64 + R0.1` and
+ `R_norm` is the 3-limb normaliz... | {
"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_b1327e334f6b_0 | fad63f78c6c5dd94 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/CallableV4DivShapeSelectedEvidence.lean | CallableV4DivShapeSelectedEvidence | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_div_callable_v4_n1_stack_pre_to_callable_post_scratch_shape_selectedSemanticEvidenceAllPhases_inputHdivRoute",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact evm_div_callable_v4... | [
{
"name": "evm_div_callable_v4_n1_stack_pre_to_callable_post_scratch_shape_selectedIfBorrowSemanticEvidenceAllPhases_inputHdivRoute",
"text": "/-- N1 callable wrapper deriving selected input and semantic facts from the\n selected-if-borrow semantic evidence package, while deriving all-true path\n evid... | [
{
"name": "evm_div_callable_v4_n1_stack_pre_to_callable_post_scratch_shape_selectedSemanticEvidenceAllPhases_inputHdivRoute",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 143,
"n_chars": 7500,
"n_subproofs": 0,
"n_tactics": 18,
"cyclomatic": 1,
"n_autom... | 1 | /-
EvmAsm.Evm64.DivMod.CallableV4DivShapeSelectedEvidence
Follow-on N1 callable shape wrappers that build on CallableV4DivShape without
growing that module past the file-size guardrail.
-/
import EvmAsm.Evm64.DivMod.CallableV4DivShape
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- N1 callable wrapper deriving t... | /-
EvmAsm.Evm64.DivMod.CallableV4DivShapeSelectedEvidence
Follow-on N1 callable shape wrappers that build on CallableV4DivShape without
growing that module past the file-size guardrail.
-/
import EvmAsm.Evm64.DivMod.CallableV4DivShape
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- N1 callable wrapper deriving s... | @@ -11,6 +11,157 @@
open EvmAsm.Rv64
+/-- N1 callable wrapper deriving selected input and semantic facts from the
+ selected-if-borrow semantic evidence package, while deriving all-true path
+ evidence from the public all-phases overestimate/no-wrap surface.
+
+ This removes the explicit selected-input pa... | {
"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_b1327e334f6b_1 | 526333fe27d9c491 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/CallableV4DivShapeSelectedEvidence.lean | CallableV4DivShapeSelectedEvidence | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_div_callable_v4_n1_stack_pre_to_callable_post_scratch_shape_selectedSemanticEvidenceAllPhases_inputHdivRoute",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact evm_div_callable_v4... | [
{
"name": "evm_div_callable_v4_n1_stack_pre_to_callable_post_scratch_shape_selectedIfBorrowSemanticEvidenceAllPhases_inputHdivRoute",
"text": "/-- N1 callable wrapper deriving selected input and semantic facts from the\n selected-if-borrow semantic evidence package, while deriving all-true path\n evid... | [
{
"name": "evm_div_callable_v4_n1_stack_pre_to_callable_post_scratch_shape_selectedInputSemanticFactsAllPhases_inputHdivRoute",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 137,
"n_chars": 7089,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_auto... | 2 | /-
EvmAsm.Evm64.DivMod.CallableV4DivShapeSelectedEvidence
Follow-on N1 callable shape wrappers that build on CallableV4DivShape without
growing that module past the file-size guardrail.
-/
import EvmAsm.Evm64.DivMod.CallableV4DivShape
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- N1 callable wrapper deriving t... | /-
EvmAsm.Evm64.DivMod.CallableV4DivShapeSelectedEvidence
Follow-on N1 callable shape wrappers that build on CallableV4DivShape without
growing that module past the file-size guardrail.
-/
import EvmAsm.Evm64.DivMod.CallableV4DivShape
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- N1 callable wrapper deriving s... | @@ -11,6 +11,157 @@
open EvmAsm.Rv64
+/-- N1 callable wrapper deriving selected input and semantic facts from the
+ selected-if-borrow semantic evidence package, while deriving all-true path
+ evidence from the public all-phases overestimate/no-wrap surface.
+
+ This removes the explicit selected-input pa... | {
"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_ef551ed0faf6_0 | 0f8768be656774c3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFullLoopCanonicalPrefix.lean | SavedBitFullLoopCanonicalPrefix | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "exp_msb_bit_test_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n exp_msb_bit_test_evm_exp_msb_saved_bit_two_mul_canonical_wit... | [
{
"name": "exp_msb_bit_test_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_spec_within",
"text": "/-- Canonical-code view of the saved-bit MSB bit-test block. -/\ntheorem exp_msb_bit_test_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_spec_within\n (e c v10 : Word) (squaringMulOff condMulOff : BitVec... | [
{
"name": "exp_msb_bit_test_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 723,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFullLoopCanonicalPrefix
Canonical-code views of saved-bit EXP full-loop prefix and BEQ gate blocks.
These wrappers pin the skip and loop-back branches to the canonical offsets
used by `evmExpMsbSavedBitTwoMulCanonicalWithMulCode`.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBit... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFullLoopCanonicalPrefix
Canonical-code views of saved-bit EXP full-loop prefix and BEQ gate blocks.
These wrappers pin the skip and loop-back branches to the canonical offsets
used by `evmExpMsbSavedBitTwoMulCanonicalWithMulCode`.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBit... | @@ -12,6 +12,23 @@
open EvmAsm.Rv64
+/-- Canonical-code view of the saved-bit MSB bit-test block. -/
+theorem exp_msb_bit_test_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_spec_within
+ (e c v10 : Word) (squaringMulOff condMulOff : BitVec 21)
+ (base mulTarget : Word) :
+ cpsTripleWithin 3 (base + 28)... | {
"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_ef551ed0faf6_1 | b9fad4f64a28abf7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFullLoopCanonicalPrefix.lean | SavedBitFullLoopCanonicalPrefix | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "exp_save_bit_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n exp_save_bit_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_sp... | [
{
"name": "exp_save_bit_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_spec_within",
"text": "/-- Canonical-code view of the saved-bit copy block. -/\ntheorem exp_save_bit_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_spec_within\n (bit v18 : Word) (squaringMulOff condMulOff : BitVec 21)\n (base ... | [
{
"name": "exp_save_bit_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 616,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFullLoopCanonicalPrefix
Canonical-code views of saved-bit EXP full-loop prefix and BEQ gate blocks.
These wrappers pin the skip and loop-back branches to the canonical offsets
used by `evmExpMsbSavedBitTwoMulCanonicalWithMulCode`.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBit... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFullLoopCanonicalPrefix
Canonical-code views of saved-bit EXP full-loop prefix and BEQ gate blocks.
These wrappers pin the skip and loop-back branches to the canonical offsets
used by `evmExpMsbSavedBitTwoMulCanonicalWithMulCode`.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBit... | @@ -12,13 +12,31 @@
open EvmAsm.Rv64
+/-- Canonical-code view of the saved-bit copy block. -/
+theorem exp_save_bit_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_spec_within
+ (bit v18 : Word) (squaringMulOff condMulOff : BitVec 21)
+ (base mulTarget : Word) :
+ cpsTripleWithin 1 (base + 40) (base + 44... | {
"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_ef551ed0faf6_2 | 90732639e088bfb6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFullLoopCanonicalPrefix.lean | SavedBitFullLoopCanonicalPrefix | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "exp_msb_bit_test_then_save_bit_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n exp_msb_bit_test_then_save_bit_evm_exp_msb_sav... | [
{
"name": "exp_msb_bit_test_then_save_bit_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_spec_within",
"text": "/-- Canonical-code view of the bit-test plus saved-bit prefix. -/\ntheorem exp_msb_bit_test_then_save_bit_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_spec_within\n (e c v10 v18 : Word) (... | [
{
"name": "exp_msb_bit_test_then_save_bit_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 866,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_re... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFullLoopCanonicalPrefix
Canonical-code views of saved-bit EXP full-loop prefix and BEQ gate blocks.
These wrappers pin the skip and loop-back branches to the canonical offsets
used by `evmExpMsbSavedBitTwoMulCanonicalWithMulCode`.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBit... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFullLoopCanonicalPrefix
Canonical-code views of saved-bit EXP full-loop prefix and BEQ gate blocks.
These wrappers pin the skip and loop-back branches to the canonical offsets
used by `evmExpMsbSavedBitTwoMulCanonicalWithMulCode`.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBit... | @@ -12,6 +12,25 @@
open EvmAsm.Rv64
+/-- Canonical-code view of the bit-test plus saved-bit prefix. -/
+theorem exp_msb_bit_test_then_save_bit_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_spec_within
+ (e c v10 v18 : Word) (squaringMulOff condMulOff : BitVec 21)
+ (base mulTarget : Word) :
+ let bit :... | {
"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_ef551ed0faf6_3 | ee83fd5a189d81f2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFullLoopCanonicalPrefix.lean | SavedBitFullLoopCanonicalPrefix | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "exp_cond_mul_saved_bit_beq_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n exp_cond_mul_saved_bit_beq_evm_exp_msb_saved_bit_t... | [
{
"name": "exp_cond_mul_saved_bit_beq_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_spec_within",
"text": "/-- Canonical-code view of the saved-bit conditional-multiply BEQ gate. -/\ntheorem exp_cond_mul_saved_bit_beq_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_spec_within\n (squaringMulOff condM... | [
{
"name": "exp_cond_mul_saved_bit_beq_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 872,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrit... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFullLoopCanonicalPrefix
Canonical-code views of saved-bit EXP full-loop prefix and BEQ gate blocks.
These wrappers pin the skip and loop-back branches to the canonical offsets
used by `evmExpMsbSavedBitTwoMulCanonicalWithMulCode`.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBit... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFullLoopCanonicalPrefix
Canonical-code views of saved-bit EXP full-loop prefix and BEQ gate blocks.
These wrappers pin the skip and loop-back branches to the canonical offsets
used by `evmExpMsbSavedBitTwoMulCanonicalWithMulCode`.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBit... | @@ -12,6 +12,25 @@
open EvmAsm.Rv64
+/-- Canonical-code view of the saved-bit conditional-multiply BEQ gate. -/
+theorem exp_cond_mul_saved_bit_beq_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_spec_within
+ (squaringMulOff condMulOff : BitVec 21) (v18 : Word)
+ (base mulTarget target : Word)
+ (htarge... | {
"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_ef551ed0faf6_4 | db3b710020c5561f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFullLoopCanonicalPrefix.lean | SavedBitFullLoopCanonicalPrefix | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "exp_cond_mul_saved_bit_beq_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n exp_cond_mul_saved_bit_beq_evm_exp_msb_saved_bit_t... | [
{
"name": "exp_cond_mul_saved_bit_beq_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_spec_within",
"text": "/-- Canonical-code view of the saved-bit conditional-multiply BEQ gate. -/\ntheorem exp_cond_mul_saved_bit_beq_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_spec_within\n (squaringMulOff condM... | [
{
"name": "exp_cond_mul_saved_bit_beq_evm_exp_msb_saved_bit_two_mul_canonical_target_with_mul_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 879,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rew... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFullLoopCanonicalPrefix
Canonical-code views of saved-bit EXP full-loop prefix and BEQ gate blocks.
These wrappers pin the skip and loop-back branches to the canonical offsets
used by `evmExpMsbSavedBitTwoMulCanonicalWithMulCode`.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBit... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFullLoopCanonicalPrefix
Canonical-code views of saved-bit EXP full-loop prefix and BEQ gate blocks.
These wrappers pin the skip and loop-back branches to the canonical offsets
used by `evmExpMsbSavedBitTwoMulCanonicalWithMulCode`.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBit... | @@ -12,6 +12,25 @@
open EvmAsm.Rv64
+/-- Canonical-code view of the saved-bit conditional-multiply BEQ gate. -/
+theorem exp_cond_mul_saved_bit_beq_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_spec_within
+ (squaringMulOff condMulOff : BitVec 21) (v18 : Word)
+ (base mulTarget target : Word)
+ (htarge... | {
"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_ef551ed0faf6_5 | fa5b45ddbad1c1e1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFullLoopCanonicalPrefix.lean | SavedBitFullLoopCanonicalPrefix | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "exp_cond_mul_saved_bit_beq_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_target_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n exp_cond_mul_saved_bit_beq_evm_exp_msb_save... | [
{
"name": "exp_cond_mul_saved_bit_beq_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_spec_within",
"text": "/-- Appended-MUL canonical-code view of the saved-bit conditional-multiply\n BEQ gate. -/\ntheorem exp_cond_mul_saved_bit_beq_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_spec_within\... | [
{
"name": "exp_cond_mul_saved_bit_beq_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_target_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 766,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFullLoopCanonicalPrefix
Canonical-code views of saved-bit EXP full-loop prefix and BEQ gate blocks.
These wrappers pin the skip and loop-back branches to the canonical offsets
used by `evmExpMsbSavedBitTwoMulCanonicalWithMulCode`.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBit... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFullLoopCanonicalPrefix
Canonical-code views of saved-bit EXP full-loop prefix and BEQ gate blocks.
These wrappers pin the skip and loop-back branches to the canonical offsets
used by `evmExpMsbSavedBitTwoMulCanonicalWithMulCode`.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBit... | @@ -32,6 +32,22 @@
v18 base mulTarget target htarget
/-- Appended-MUL canonical-code view of the saved-bit conditional-multiply
+ BEQ gate. -/
+theorem exp_cond_mul_saved_bit_beq_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_spec_within
+ (v18 : Word) (base target : Word)
+ (htarget :
+ (ba... | {
"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_e04cb6ec70e7_0 | 097eaf92644e5d4d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV2.lean | CallSkipLowerBoundV2 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "val256_ratio_le_u_total_div_b3_prime",
"depth": 1,
"n_commands": 0,
"n_lines": 76,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only []\n -- Step 1: cancel 2^shift via Nat.mul_div_mul_right.\n have h_pow_pos : (0 : Nat) < ... | [
{
"name": "nat_trunc_div_add_lt",
"text": "/-- **B3.1**: pure Nat truncation-division identity.\n `(A * K + L) / (B * K) = A / B` when `0 < K, 0 < B, L < K`.\n\n Proof: A = B*q + r with r < B. Then A*K + L = B*K*q + (r*K + L) with\n r*K + L < B*K. Apply Nat.add_mul_div_right / Nat.div_eq_of_lt_of_l... | [
{
"name": "val256_ratio_le_u_total_div_b3_prime",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 94,
"n_chars": 4846,
"n_subproofs": 12,
"n_tactics": 67,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 4,
"n_structural": 2,
"automation_only"... | 4 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2
Replacement for PR #1154 (closed). Proves the call-skip exact lower bound
`val256(a)/val256(b) ≤ (div128Quot u4 u3 b3').toNat` under shift_nz + hcall,
via a **GLOBAL Phase 1+2 compensation argument** instead of the per-phase
tight bounds that PR #1154 attempt... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2
Replacement for PR #1154 (closed). Proves the call-skip exact lower bound
`val256(a)/val256(b) ≤ (div128Quot u4 u3 b3').toNat` under shift_nz + hcall,
via a **GLOBAL Phase 1+2 compensation argument** instead of the per-phase
tight bounds that PR #1154 attempt... | @@ -66,6 +66,33 @@
-- §B — Bridge from val256 to 128/64 (normalization)
-- =============================================================================
+/-- **B3.1**: pure Nat truncation-division identity.
+ `(A * K + L) / (B * K) = A / B` when `0 < K, 0 < B, L < K`.
+
+ Proof: A = B*q + r with r < B. Then A... | {
"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_e04cb6ec70e7_1 | 36113fa9d9622909 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV2.lean | CallSkipLowerBoundV2 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "val256_ratio_le_u_total_div_b3_prime",
"depth": 1,
"n_commands": 0,
"n_lines": 76,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only []\n -- Step 1: cancel 2^shift via Nat.mul_div_mul_right.\n have h_pow_pos : (0 : Nat) < ... | [
{
"name": "nat_trunc_div_add_lt",
"text": "/-- **B3.1**: pure Nat truncation-division identity.\n `(A * K + L) / (B * K) = A / B` when `0 < K, 0 < B, L < K`.\n\n Proof: A = B*q + r with r < B. Then A*K + L = B*K*q + (r*K + L) with\n r*K + L < B*K. Apply Nat.add_mul_div_right / Nat.div_eq_of_lt_of_l... | [
{
"name": "q_true_triple_bridge_to_val256_norm",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 19,
"n_chars": 826,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": fa... | 5 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2
Replacement for PR #1154 (closed). Proves the call-skip exact lower bound
`val256(a)/val256(b) ≤ (div128Quot u4 u3 b3').toNat` under shift_nz + hcall,
via a **GLOBAL Phase 1+2 compensation argument** instead of the per-phase
tight bounds that PR #1154 attempt... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2
Replacement for PR #1154 (closed). Proves the call-skip exact lower bound
`val256(a)/val256(b) ≤ (div128Quot u4 u3 b3').toNat` under shift_nz + hcall,
via a **GLOBAL Phase 1+2 compensation argument** instead of the per-phase
tight bounds that PR #1154 attempt... | @@ -66,6 +66,33 @@
-- §B — Bridge from val256 to 128/64 (normalization)
-- =============================================================================
+/-- **B3.1**: pure Nat truncation-division identity.
+ `(A * K + L) / (B * K) = A / B` when `0 < K, 0 < B, L < K`.
+
+ Proof: A = B*q + r with r < B. Then A... | {
"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_e04cb6ec70e7_2 | 7d766e34d1f503bb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV2.lean | CallSkipLowerBoundV2 | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "val256_ratio_le_u_total_div_b3_prime",
"depth": 1,
"n_commands": 0,
"n_lines": 76,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only []\n -- Step 1: cancel 2^shift via Nat.mul_div_mul_right.\n have h_pow_pos : (0 : Nat) < ... | [
{
"name": "nat_trunc_div_add_lt",
"text": "/-- **B3.1**: pure Nat truncation-division identity.\n `(A * K + L) / (B * K) = A / B` when `0 < K, 0 < B, L < K`.\n\n Proof: A = B*q + r with r < B. Then A*K + L = B*K*q + (r*K + L) with\n r*K + L < B*K. Apply Nat.add_mul_div_right / Nat.div_eq_of_lt_of_l... | [
{
"name": "div128Quot_call_skip_ge_val256_div_v2",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 35,
"n_chars": 1589,
"n_subproofs": 6,
"n_tactics": 20,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 6,
"automation_only"... | 6 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2
Replacement for PR #1154 (closed). Proves the call-skip exact lower bound
`val256(a)/val256(b) ≤ (div128Quot u4 u3 b3').toNat` under shift_nz + hcall,
via a **GLOBAL Phase 1+2 compensation argument** instead of the per-phase
tight bounds that PR #1154 attempt... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2
Replacement for PR #1154 (closed). Proves the call-skip exact lower bound
`val256(a)/val256(b) ≤ (div128Quot u4 u3 b3').toNat` under shift_nz + hcall,
via a **GLOBAL Phase 1+2 compensation argument** instead of the per-phase
tight bounds that PR #1154 attempt... | @@ -66,6 +66,33 @@
-- §B — Bridge from val256 to 128/64 (normalization)
-- =============================================================================
+/-- **B3.1**: pure Nat truncation-division identity.
+ `(A * K + L) / (B * K) = A / B` when `0 < K, 0 < B, L < K`.
+
+ Proof: A = B*q + r with r < B. Then A... | {
"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_e04cb6ec70e7_3 | 3117d0a45383271e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV2.lean | CallSkipLowerBoundV2 | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "val256_ratio_le_u_total_div_b3_prime",
"depth": 1,
"n_commands": 0,
"n_lines": 76,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only []\n -- Step 1: cancel 2^shift via Nat.mul_div_mul_right.\n have h_pow_pos : (0 : Nat) < ... | [
{
"name": "nat_trunc_div_add_lt",
"text": "/-- **B3.1**: pure Nat truncation-division identity.\n `(A * K + L) / (B * K) = A / B` when `0 < K, 0 < B, L < K`.\n\n Proof: A = B*q + r with r < B. Then A*K + L = B*K*q + (r*K + L) with\n r*K + L < B*K. Apply Nat.add_mul_div_right / Nat.div_eq_of_lt_of_l... | [
{
"name": "div128Quot_call_skip_eq_val256_div",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 41,
"n_chars": 1746,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": fa... | 7 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2
Replacement for PR #1154 (closed). Proves the call-skip exact lower bound
`val256(a)/val256(b) ≤ (div128Quot u4 u3 b3').toNat` under shift_nz + hcall,
via a **GLOBAL Phase 1+2 compensation argument** instead of the per-phase
tight bounds that PR #1154 attempt... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2
Replacement for PR #1154 (closed). Proves the call-skip exact lower bound
`val256(a)/val256(b) ≤ (div128Quot u4 u3 b3').toNat` under shift_nz + hcall,
via a **GLOBAL Phase 1+2 compensation argument** instead of the per-phase
tight bounds that PR #1154 attempt... | @@ -66,6 +66,33 @@
-- §B — Bridge from val256 to 128/64 (normalization)
-- =============================================================================
+/-- **B3.1**: pure Nat truncation-division identity.
+ `(A * K + L) / (B * K) = A / B` when `0 < K, 0 < B, L < K`.
+
+ Proof: A = B*q + r with r < B. Then A... | {
"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_e04cb6ec70e7_4 | c910f6b5b179cd7d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV2.lean | CallSkipLowerBoundV2 | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "val256_div_q_true_digits_lt_pow32",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro q_true_full\n have h_full_lt : q_true_full < 2^64 :=\n val256_div_val256_lt_pow64 a0 a1 a2 a3 ... | [
{
"name": "val256_div_val256_lt_pow64",
"text": "/-- **Bound `val256(a)/val256(b) < 2^64` under `b3 ≠ 0`** (CLOSED).\n\n The 256-bit true quotient fits in a Word. From `val256(a) < 2^256`\n and `val256(b) ≥ 2^192`, we get `val256(a)/val256(b) < 2^64`.\n\n Used downstream to:\n 1. Show `div128Quo... | [
{
"name": "val256_div_q_true_digits_lt_pow32",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 21,
"n_chars": 890,
"n_subproofs": 2,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": fal... | 1 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2
Replacement for PR #1154 (closed). Proves the call-skip exact lower bound
`val256(a)/val256(b) ≤ (div128Quot u4 u3 b3').toNat` under shift_nz + hcall,
via a **GLOBAL Phase 1+2 compensation argument** instead of the per-phase
tight bounds that PR #1154 attempt... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2
Replacement for PR #1154 (closed). Proves the call-skip exact lower bound
`val256(a)/val256(b) ≤ (div128Quot u4 u3 b3').toNat` under shift_nz + hcall,
via a **GLOBAL Phase 1+2 compensation argument** instead of the per-phase
tight bounds that PR #1154 attempt... | @@ -66,6 +66,35 @@
-- §B — Bridge from val256 to 128/64 (normalization)
-- =============================================================================
+/-- **Bound `val256(a)/val256(b) < 2^64` under `b3 ≠ 0`** (CLOSED).
+
+ The 256-bit true quotient fits in a Word. From `val256(a) < 2^256`
+ and `val256(b) ... | {
"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_e04cb6ec70e7_5 | 5f0b38af90601bf9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV2.lean | CallSkipLowerBoundV2 | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "div128Quot_or_left_ge_q1_prime_shift_existential",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [h_eq]\n exact div128Quot_or_left_ge_q1_prime_shift q1 q0 h_q1_lt",
"n_chars": 74,... | [
{
"name": "div128Quot_or_left_ge_q1_prime_shift",
"text": "/-- **OR-left lower bound**: `((q1' << 32) ||| q0').toNat ≥ q1'.toNat * 2^32`\n when `q1' < 2^32`.\n\n Pure BitVec property: `a OR b ≥ a` (bitwise), and the shift preserves\n the lower bits. Useful primitive for the digit-decomposition\n ... | [
{
"name": "div128Quot_or_left_ge_q1_prime_shift_existential",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 717,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automat... | 1 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2
Replacement for PR #1154 (closed). Proves the call-skip exact lower bound
`val256(a)/val256(b) ≤ (div128Quot u4 u3 b3').toNat` under shift_nz + hcall,
via a **GLOBAL Phase 1+2 compensation argument** instead of the per-phase
tight bounds that PR #1154 attempt... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2
Replacement for PR #1154 (closed). Proves the call-skip exact lower bound
`val256(a)/val256(b) ≤ (div128Quot u4 u3 b3').toNat` under shift_nz + hcall,
via a **GLOBAL Phase 1+2 compensation argument** instead of the per-phase
tight bounds that PR #1154 attempt... | @@ -66,6 +66,30 @@
-- §B — Bridge from val256 to 128/64 (normalization)
-- =============================================================================
+/-- **OR-left lower bound**: `((q1' << 32) ||| q0').toNat ≥ q1'.toNat * 2^32`
+ when `q1' < 2^32`.
+
+ Pure BitVec property: `a OR b ≥ a` (bitwise), and the... | {
"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_e04cb6ec70e7_6 | a04ca0d957324b30 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV2.lean | CallSkipLowerBoundV2 | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "val256_ratio_le_u_total_div_b3_prime",
"depth": 1,
"n_commands": 0,
"n_lines": 76,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only []\n -- Step 1: cancel 2^shift via Nat.mul_div_mul_right.\n have h_pow_pos : (0 : Nat) < ... | [
{
"name": "nat_trunc_div_add_lt",
"text": "/-- **B3.1**: pure Nat truncation-division identity.\n `(A * K + L) / (B * K) = A / B` when `0 < K, 0 < B, L < K`.\n\n Proof: A = B*q + r with r < B. Then A*K + L = B*K*q + (r*K + L) with\n r*K + L < B*K. Apply Nat.add_mul_div_right / Nat.div_eq_of_lt_of_l... | [
{
"name": "div128Quot_q1_prime_le_q_true_top_call_skip",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 11,
"n_lines": 69,
"n_chars": 3283,
"n_subproofs": 5,
"n_tactics": 30,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 2,
"automatio... | 11 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2
Replacement for PR #1154 (closed). Proves the call-skip exact lower bound
`val256(a)/val256(b) ≤ (div128Quot u4 u3 b3').toNat` under shift_nz + hcall,
via a **GLOBAL Phase 1+2 compensation argument** instead of the per-phase
tight bounds that PR #1154 attempt... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2
Replacement for PR #1154 (closed). Proves the call-skip exact lower bound
`val256(a)/val256(b) ≤ (div128Quot u4 u3 b3').toNat` under shift_nz + hcall,
via a **GLOBAL Phase 1+2 compensation argument** instead of the per-phase
tight bounds that PR #1154 attempt... | @@ -66,6 +66,33 @@
-- §B — Bridge from val256 to 128/64 (normalization)
-- =============================================================================
+/-- **B3.1**: pure Nat truncation-division identity.
+ `(A * K + L) / (B * K) = A / B` when `0 < K, 0 < B, L < K`.
+
+ Proof: A = B*q + r with r < B. Then A... | {
"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_e04cb6ec70e7_7 | 654b035e8ed687f8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV2.lean | CallSkipLowerBoundV2 | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "val256_ratio_le_u_total_div_b3_prime",
"depth": 1,
"n_commands": 0,
"n_lines": 76,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only []\n -- Step 1: cancel 2^shift via Nat.mul_div_mul_right.\n have h_pow_pos : (0 : Nat) < ... | [
{
"name": "val256_ge_top_limb_mul_pow192",
"text": "/-- **B3.2**: val256(b_norm) is at least b3' * 2^192.\n Trivial from val256 definition (b3' is the top limb, other limbs ≥ 0). -/\ntheorem val256_ge_top_limb_mul_pow192 (b0 b1 b2 b3 : Word) :\n val256 b0 b1 b2 b3 ≥ b3.toNat * 2^192 := by\n unfold va... | [
{
"name": "div128Quot_q1_prime_mul_pow32_le_val256_div_call_skip",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 12,
"n_lines": 39,
"n_chars": 1902,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 2,
"... | 12 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2
Replacement for PR #1154 (closed). Proves the call-skip exact lower bound
`val256(a)/val256(b) ≤ (div128Quot u4 u3 b3').toNat` under shift_nz + hcall,
via a **GLOBAL Phase 1+2 compensation argument** instead of the per-phase
tight bounds that PR #1154 attempt... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2
Replacement for PR #1154 (closed). Proves the call-skip exact lower bound
`val256(a)/val256(b) ≤ (div128Quot u4 u3 b3').toNat` under shift_nz + hcall,
via a **GLOBAL Phase 1+2 compensation argument** instead of the per-phase
tight bounds that PR #1154 attempt... | @@ -93,6 +93,12 @@
rw [Nat.div_eq_of_lt h_rem_bound]
omega
+/-- **B3.2**: val256(b_norm) is at least b3' * 2^192.
+ Trivial from val256 definition (b3' is the top limb, other limbs ≥ 0). -/
+theorem val256_ge_top_limb_mul_pow192 (b0 b1 b2 b3 : Word) :
+ val256 b0 b1 b2 b3 ≥ b3.toNat * 2^192 := by
+ unfol... | {
"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_e22b155d62ae_0 | 7d9777729eff4b12 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Bn254PairingInputBridge.lean | Bn254PairingInputBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "bn254PairingInputFromMemory_pairs_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [bn254PairingInputFromMemory, pairingPairsFromMemory_length]",
"n_chars": 71,
"n_subp... | [
{
"name": "pairingPairsFromMemory_length",
"text": "theorem pairingPairsFromMemory_length\n (memory : MemoryReader) (pairsStart numPairs : Nat) :\n (pairingPairsFromMemory memory pairsStart numPairs).length = numPairs := by\n simp [pairingPairsFromMemory]\n\n",
"fan_in": 1,
"n_lines": 6,
... | [
{
"name": "bn254PairingInputFromMemory_pairs_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 267,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only"... | 1 | /-
EvmAsm.EL.Bn254PairingInputBridge
Bridge from executable memory to the input payload consumed by the
`zkvm_bn254_pairing` accelerator.
-/
import EvmAsm.EL.KeccakInputBridge
namespace EvmAsm.EL
namespace Bn254PairingInputBridge
/-- A byte-addressed executable memory reader. -/
abbrev MemoryReader := Keccak... | /-
EvmAsm.EL.Bn254PairingInputBridge
Bridge from executable memory to the input payload consumed by the
`zkvm_bn254_pairing` accelerator.
-/
import EvmAsm.EL.KeccakInputBridge
namespace EvmAsm.EL
namespace Bn254PairingInputBridge
/-- A byte-addressed executable memory reader. -/
abbrev MemoryReader := Keccak... | @@ -57,9 +57,15 @@
{ pairs := pairingPairsFromMemory memory pairsStart numPairs
numPairs := numPairs }
+theorem pairingPairsFromMemory_length
+ (memory : MemoryReader) (pairsStart numPairs : Nat) :
+ (pairingPairsFromMemory memory pairsStart numPairs).length = numPairs := by
+ simp [pairingPairsFromMem... | {
"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_5cda58228e31_0 | db7e4c4f39aad1a1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bls12FieldCopyQuadsSAsm.lean | Bls12FieldCopyQuadsSAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "copy_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 39,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hse0 : signExtend12 (0 : BitVec 12) = (0 : Word) := by decide\n have hloadAddr : rf.get .x10 + signExtend12 (0 : BitVec ... | [
{
"name": "src_miss8",
"text": "private theorem src_miss8 (src dst : Word) (ws : List (BitVec 8)) (n k : Nat)\n (hk : k < n) (hws : ws.length = 8 * n) (hfr : frameOkN src dst n) :\n ¬ inRw dst ws (src + BitVec.ofNat 64 (8 * k)) 8 := by\n obtain ⟨hnws, hnwd, hdisj⟩ := hfr\n unfold inRw\n rw [hws]\n ... | [
{
"name": "copy_engine",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 48,
"n_chars": 2297,
"n_subproofs": 6,
"n_tactics": 39,
"cyclomatic": 1,
"n_automation": 11,
"n_rewrites": 14,
"n_structural": 2,
"automation_only": false,
"max_nestin... | 3 | /-
EvmAsm.Codegen.Programs.Bls12FieldCopyQuadsSAsm
Verified SAsm port of `blsf_copy_quads`: copy `a2` aligned 8-byte quads
from `a0` to `a1`. This leaf is used by the BLS12-381 LE point/field
wrappers and accelerator probes.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
import EvmAsm.... | /-
EvmAsm.Codegen.Programs.Bls12FieldCopyQuadsSAsm
Verified SAsm port of `blsf_copy_quads`: copy `a2` aligned 8-byte quads
from `a0` to `a1`. This leaf is used by the BLS12-381 LE point/field
wrappers and accelerator probes.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
import EvmAsm.... | @@ -47,6 +47,14 @@
dsimp only [aluSem, loadSem]
rw [if_neg h]
+private theorem src_miss8 (src dst : Word) (ws : List (BitVec 8)) (n k : Nat)
+ (hk : k < n) (hws : ws.length = 8 * n) (hfr : frameOkN src dst n) :
+ ¬ inRw dst ws (src + BitVec.ofNat 64 (8 * k)) 8 := by
+ obtain ⟨hnws, hnwd, hdisj⟩ := hfr
+ ... | {
"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_5cda58228e31_1 | 60492e6d32b8b5ed | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bls12FieldCopyQuadsSAsm.lean | Bls12FieldCopyQuadsSAsm | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "copy_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 39,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hse0 : signExtend12 (0 : BitVec 12) = (0 : Word) := by decide\n have hloadAddr : rf.get .x10 + signExtend12 (0 : BitVec ... | [
{
"name": "ld_romiss",
"text": "private theorem ld_romiss (reg : Region) (rwb : Word) (rf : RegFile)\n (ws : List (BitVec 8)) (rd rs1 : Reg) (ofs : BitVec 12)\n (h : ¬ inRw rwb ws (rf.get rs1 + signExtend12 ofs) 8) :\n execInstrRF reg rwb rf ws (.LD rd rs1 ofs)\n = (rf.set rd (reg.dwordAt (rf.... | [
{
"name": "copy_blockVCs",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 47,
"n_chars": 2056,
"n_subproofs": 8,
"n_tactics": 40,
"cyclomatic": 2,
"n_automation": 10,
"n_rewrites": 15,
"n_structural": 8,
"automation_only": false,
"max_nest... | 2 | /-
EvmAsm.Codegen.Programs.Bls12FieldCopyQuadsSAsm
Verified SAsm port of `blsf_copy_quads`: copy `a2` aligned 8-byte quads
from `a0` to `a1`. This leaf is used by the BLS12-381 LE point/field
wrappers and accelerator probes.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
import EvmAsm.... | /-
EvmAsm.Codegen.Programs.Bls12FieldCopyQuadsSAsm
Verified SAsm port of `blsf_copy_quads`: copy `a2` aligned 8-byte quads
from `a0` to `a1`. This leaf is used by the BLS12-381 LE point/field
wrappers and accelerator probes.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
import EvmAsm.... | @@ -38,6 +38,15 @@
let r3 := r2.set .x11 (r2.get .x11 + signExtend12 (8 : BitVec 12))
r3.set .x12 (r3.get .x12 + signExtend12 (-1 : BitVec 12))
+private theorem ld_romiss (reg : Region) (rwb : Word) (rf : RegFile)
+ (ws : List (BitVec 8)) (rd rs1 : Reg) (ofs : BitVec 12)
+ (h : ¬ inRw rwb ws (rf.get rs1 +... | {
"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_5cda58228e31_2 | e035a61290800206 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bls12FieldCopyQuadsSAsm.lean | Bls12FieldCopyQuadsSAsm | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "blsfCopyQuadsFn_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 64,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbase : (blsfCopyQuadsFn src dst n srcBytes orig).rw.base = dst := rfl\n vcgen\n case region => exact ⟨hwf, hr... | [
{
"name": "ptr_add8",
"text": "private theorem ptr_add8 (base : Word) (off : Nat) (_hfit : base.toNat + off + 8 < 2 ^ 64) :\n base + BitVec.ofNat 64 off + (8 : Word) = base + BitVec.ofNat 64 (off + 8) := by\n apply BitVec.eq_of_toNat_eq\n simp only [BitVec.toNat_add, BitVec.toNat_ofNat, show ((8 : Word... | [
{
"name": "blsfCopyQuadsFn_spec",
"fan_in": 0,
"n_deps_direct": 11,
"n_deps_transitive": 14,
"n_lines": 68,
"n_chars": 3232,
"n_subproofs": 14,
"n_tactics": 67,
"cyclomatic": 6,
"n_automation": 27,
"n_rewrites": 28,
"n_structural": 21,
"automation_only": false,
... | 14 | /-
EvmAsm.Codegen.Programs.Bls12FieldCopyQuadsSAsm
Verified SAsm port of `blsf_copy_quads`: copy `a2` aligned 8-byte quads
from `a0` to `a1`. This leaf is used by the BLS12-381 LE point/field
wrappers and accelerator probes.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
import EvmAsm.... | /-
EvmAsm.Codegen.Programs.Bls12FieldCopyQuadsSAsm
Verified SAsm port of `blsf_copy_quads`: copy `a2` aligned 8-byte quads
from `a0` to `a1`. This leaf is used by the BLS12-381 LE point/field
wrappers and accelerator probes.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
import EvmAsm.... | @@ -116,6 +116,12 @@
unfold copyStepRf
simp only [RegFile.get_set_self, RegFile.get_set_ne, ne_eq, reduceCtorEq, not_false_eq_true]
+private theorem ptr_add8 (base : Word) (off : Nat) (_hfit : base.toNat + off + 8 < 2 ^ 64) :
+ base + BitVec.ofNat 64 off + (8 : Word) = base + BitVec.ofNat 64 (off + 8) := by
... | {
"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_3d86da9e1ece_0 | d3098f7e0f92cb80 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V5CallableExactMod.lean | FullPathN1V5CallableExactMod | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_mod_n1_full_spec_v5_noNop_preserving_x1",
"depth": 1,
"n_commands": 0,
"n_lines": 43,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hshift_nz' : fullDivN1Shift b0 ≠ 0 := by simp only [fullDivN1Shift]; exact hshift_nz\n h... | [
{
"name": "evm_mod_n1_to_denorm_spec_v5_noNop_preserving_x1",
"text": "/-- x1-preserving twin of `evm_mod_n1_to_denorm_spec_v5_noNop`: entry→denorm over\n `modCode_noNop_v5` with the concrete `x1Val` framed through the preloop and the\n x1-free loop, and a free incoming `x9In`/`x2In`. Op-agnostic thr... | [
{
"name": "evm_mod_n1_full_spec_v5_noNop_preserving_x1",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 95,
"n_chars": 5595,
"n_subproofs": 6,
"n_tactics": 45,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 4,
"n_structural": 2,
"automation... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5CallableExactMod
The n=1 v5 x1-preserving (callable exact-frame) MOD full path over
`modCode_noNop_v5` (shift ≠ 0): the x1-preserving MOD entry→denorm rung + the
MOD remainder denorm-epilogue, carrying the concrete return address `x1 = x1Val`
and a free incoming `x9... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5CallableExactMod
The n=1 v5 x1-preserving (callable exact-frame) MOD full path over
`modCode_noNop_v5` (shift ≠ 0): the x1-preserving MOD entry→denorm rung + the
MOD remainder denorm-epilogue, carrying the concrete return address `x1 = x1Val`
and a free incoming `x9... | @@ -23,6 +23,98 @@
open EvmAsm.Rv64 EvmAsm.Rv64.Tactics
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56 word_add_zero)
+/-- x1-preserving twin of `evm_mod_n1_to_denorm_spec_v5_noNop`: entry→denorm over
+ `modCode_noNop_v5` with the concrete `x1Val` framed through the preloop and the
+ x1-free loop,... | {
"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_b972e00cce8d_0 | a0fe94ffaf6d8d01 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Shift0Dispatcher.lean | Shift0Dispatcher | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 4 | [
{
"theorem_name": "evm_div_n4_shift0_stack_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases h_skip : isSkipBorrowN4Shift0Evm a b\n · exact cpsTripleWithin_mono_nSteps (by decide) <|\n ev... | [
{
"name": "n4_shift0_addback_carry2_nz_of_borrow",
"text": "/-- Under shift=0, `isAddbackCarry2NzN4Shift0Evm` is vacuously true whenever\n `isAddbackBorrowN4Shift0Evm` holds — the first-addback carry is always 1\n (proved in `n4_shift0_addback_carry_nz`), so the implication's premise\n `first-addba... | [
{
"name": "evm_div_n4_shift0_stack_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 44,
"n_chars": 2197,
"n_subproofs": 2,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 3,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Shift0Dispatcher
Top-level n=4 shift=0 stack spec: unifies the call+skip and call+addback-BEQ
sub-paths via runtime dispatch on `isSkipBorrowN4Shift0Evm`. Under shift=0,
the first-addback carry is always 1 (proved in Shift0AddbackMod), so the
`isAddbackCarry2NzN4Shift0Evm` hypothesis r... | /-
EvmAsm.Evm64.DivMod.Shift0Dispatcher
Top-level n=4 shift=0 stack spec: unifies the call+skip and call+addback-BEQ
sub-paths via runtime dispatch on `isSkipBorrowN4Shift0Evm`. Under shift=0,
the first-addback carry is always 1 (proved in Shift0AddbackMod), so the
`isAddbackCarry2NzN4Shift0Evm` hypothesis r... | @@ -17,6 +17,23 @@
open EvmAsm.Rv64
open EvmWord (val256)
+/-- Under shift=0, `isAddbackCarry2NzN4Shift0Evm` is vacuously true whenever
+ `isAddbackBorrowN4Shift0Evm` holds — the first-addback carry is always 1
+ (proved in `n4_shift0_addback_carry_nz`), so the implication's premise
+ `first-addback-carry ... | {
"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_b972e00cce8d_1 | 6739a17b5ecebfe0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Shift0Dispatcher.lean | Shift0Dispatcher | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 4 | [
{
"theorem_name": "evm_div_n4_shift0_stack_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases h_skip : isSkipBorrowN4Shift0Evm a b\n · exact cpsTripleWithin_mono_nSteps (by decide) <|\n ev... | [
{
"name": "n4_shift0_addback_carry2_nz_of_borrow",
"text": "/-- Under shift=0, `isAddbackCarry2NzN4Shift0Evm` is vacuously true whenever\n `isAddbackBorrowN4Shift0Evm` holds — the first-addback carry is always 1\n (proved in `n4_shift0_addback_carry_nz`), so the implication's premise\n `first-addba... | [
{
"name": "evm_div_n4_shift0_stack_spec_exact_x1",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 38,
"n_chars": 1941,
"n_subproofs": 2,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 3,
"automation_only"... | 1 | /-
EvmAsm.Evm64.DivMod.Shift0Dispatcher
Top-level n=4 shift=0 stack spec: unifies the call+skip and call+addback-BEQ
sub-paths via runtime dispatch on `isSkipBorrowN4Shift0Evm`. Under shift=0,
the first-addback carry is always 1 (proved in Shift0AddbackMod), so the
`isAddbackCarry2NzN4Shift0Evm` hypothesis r... | /-
EvmAsm.Evm64.DivMod.Shift0Dispatcher
Top-level n=4 shift=0 stack spec: unifies the call+skip and call+addback-BEQ
sub-paths via runtime dispatch on `isSkipBorrowN4Shift0Evm`. Under shift=0,
the first-addback carry is always 1 (proved in Shift0AddbackMod), so the
`isAddbackCarry2NzN4Shift0Evm` hypothesis r... | @@ -17,6 +17,23 @@
open EvmAsm.Rv64
open EvmWord (val256)
+/-- Under shift=0, `isAddbackCarry2NzN4Shift0Evm` is vacuously true whenever
+ `isAddbackBorrowN4Shift0Evm` holds — the first-addback carry is always 1
+ (proved in `n4_shift0_addback_carry_nz`), so the implication's premise
+ `first-addback-carry ... | {
"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_b972e00cce8d_2 | 28e40cb09d05d2e1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Shift0Dispatcher.lean | Shift0Dispatcher | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 4 | [
{
"theorem_name": "evm_div_n4_shift0_stack_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases h_skip : isSkipBorrowN4Shift0Evm a b\n · exact cpsTripleWithin_mono_nSteps (by decide) <|\n ev... | [
{
"name": "n4_shift0_addback_carry2_nz_of_borrow",
"text": "/-- Under shift=0, `isAddbackCarry2NzN4Shift0Evm` is vacuously true whenever\n `isAddbackBorrowN4Shift0Evm` holds — the first-addback carry is always 1\n (proved in `n4_shift0_addback_carry_nz`), so the implication's premise\n `first-addba... | [
{
"name": "evm_div_n4_shift0_stack_spec_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 35,
"n_chars": 1732,
"n_subproofs": 2,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 3,
"automation_only": f... | 1 | /-
EvmAsm.Evm64.DivMod.Shift0Dispatcher
Top-level n=4 shift=0 stack spec: unifies the call+skip and call+addback-BEQ
sub-paths via runtime dispatch on `isSkipBorrowN4Shift0Evm`. Under shift=0,
the first-addback carry is always 1 (proved in Shift0AddbackMod), so the
`isAddbackCarry2NzN4Shift0Evm` hypothesis r... | /-
EvmAsm.Evm64.DivMod.Shift0Dispatcher
Top-level n=4 shift=0 stack spec: unifies the call+skip and call+addback-BEQ
sub-paths via runtime dispatch on `isSkipBorrowN4Shift0Evm`. Under shift=0,
the first-addback carry is always 1 (proved in Shift0AddbackMod), so the
`isAddbackCarry2NzN4Shift0Evm` hypothesis r... | @@ -17,6 +17,23 @@
open EvmAsm.Rv64
open EvmWord (val256)
+/-- Under shift=0, `isAddbackCarry2NzN4Shift0Evm` is vacuously true whenever
+ `isAddbackBorrowN4Shift0Evm` holds — the first-addback carry is always 1
+ (proved in `n4_shift0_addback_carry_nz`), so the implication's premise
+ `first-addback-carry ... | {
"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_b972e00cce8d_3 | 62e676a5b04660bb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Shift0Dispatcher.lean | Shift0Dispatcher | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 4 | [
{
"theorem_name": "evm_div_n4_shift0_stack_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases h_skip : isSkipBorrowN4Shift0Evm a b\n · exact cpsTripleWithin_mono_nSteps (by decide) <|\n ev... | [
{
"name": "n4_shift0_addback_carry2_nz_of_borrow",
"text": "/-- Under shift=0, `isAddbackCarry2NzN4Shift0Evm` is vacuously true whenever\n `isAddbackBorrowN4Shift0Evm` holds — the first-addback carry is always 1\n (proved in `n4_shift0_addback_carry_nz`), so the implication's premise\n `first-addba... | [
{
"name": "evm_mod_n4_shift0_stack_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 35,
"n_chars": 1730,
"n_subproofs": 2,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 3,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Shift0Dispatcher
Top-level n=4 shift=0 stack spec: unifies the call+skip and call+addback-BEQ
sub-paths via runtime dispatch on `isSkipBorrowN4Shift0Evm`. Under shift=0,
the first-addback carry is always 1 (proved in Shift0AddbackMod), so the
`isAddbackCarry2NzN4Shift0Evm` hypothesis r... | /-
EvmAsm.Evm64.DivMod.Shift0Dispatcher
Top-level n=4 shift=0 stack spec: unifies the call+skip and call+addback-BEQ
sub-paths via runtime dispatch on `isSkipBorrowN4Shift0Evm`. Under shift=0,
the first-addback carry is always 1 (proved in Shift0AddbackMod), so the
`isAddbackCarry2NzN4Shift0Evm` hypothesis r... | @@ -17,6 +17,23 @@
open EvmAsm.Rv64
open EvmWord (val256)
+/-- Under shift=0, `isAddbackCarry2NzN4Shift0Evm` is vacuously true whenever
+ `isAddbackBorrowN4Shift0Evm` holds — the first-addback carry is always 1
+ (proved in `n4_shift0_addback_carry_nz`), so the implication's premise
+ `first-addback-carry ... | {
"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_3dd92f98ec97_0 | 210b02392d6aee2b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Code/CopyMemory.lean | CopyMemory | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "copyWriteByteAt_at_destination_add",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [copyWriteByteAt]\n rw [dif_pos (writesAddress_at_destination_add h)]\n rw [writeIndex_at_destinati... | [
{
"name": "writeIndex_at_destination_add",
"text": "theorem writeIndex_at_destination_add\n (args : CodeCopyArgs.Args) (i : Nat) :\n writeIndex args (destinationStart args + i) = i := by\n unfold writeIndex\n omega\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 168,
"n_subproofs": 0,
... | [
{
"name": "copyWriteByteAt_at_destination_add",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 600,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": fal... | 2 | /-
EvmAsm.Evm64.Code.CopyMemory
Destination-address bridge for CODECOPY copied bytes (GH #107 / GH #118).
-/
import Mathlib.Data.List.GetD
import EvmAsm.Evm64.Code.CopyExec
namespace EvmAsm.Evm64
namespace CodeCopyMemory
/-- First destination memory byte written by CODECOPY. -/
def destinationStart (args : Code... | /-
EvmAsm.Evm64.Code.CopyMemory
Destination-address bridge for CODECOPY copied bytes (GH #107 / GH #118).
-/
import Mathlib.Data.List.GetD
import EvmAsm.Evm64.Code.CopyExec
namespace EvmAsm.Evm64
namespace CodeCopyMemory
/-- First destination memory byte written by CODECOPY. -/
def destinationStart (args : Code... | @@ -49,6 +49,12 @@
CodeCopyArgs.sizeNat
omega
+theorem writeIndex_at_destination_add
+ (args : CodeCopyArgs.Args) (i : Nat) :
+ writeIndex args (destinationStart args + i) = i := by
+ unfold writeIndex
+ omega
+
theorem copyWriteByteAt_outside
{code : List (BitVec 8)} {args : CodeCopyArgs.Args} ... | {
"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_3dd92f98ec97_1 | 7af043cbdca738ff | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Code/CopyMemory.lean | CopyMemory | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "copyWriteByteAt_at_destination_add_eq_codeByte",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [copyWriteByteAt_at_destination_add h]\n exact CodeCopyExec.copiedBytesFromArgs_get h",
... | [
{
"name": "copyWriteByteAt_at_destination_add",
"text": "theorem copyWriteByteAt_at_destination_add\n {code : List (BitVec 8)} {args : CodeCopyArgs.Args} {i : Nat}\n (h : i < args.size.toNat) :\n copyWriteByteAt code args (destinationStart args + i) =\n (CodeCopyExec.copiedBytesFromArgs code a... | [
{
"name": "copyWriteByteAt_at_destination_add_eq_codeByte",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 360,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation... | 3 | /-
EvmAsm.Evm64.Code.CopyMemory
Destination-address bridge for CODECOPY copied bytes (GH #107 / GH #118).
-/
import Mathlib.Data.List.GetD
import EvmAsm.Evm64.Code.CopyExec
namespace EvmAsm.Evm64
namespace CodeCopyMemory
/-- First destination memory byte written by CODECOPY. -/
def destinationStart (args : Code... | /-
EvmAsm.Evm64.Code.CopyMemory
Destination-address bridge for CODECOPY copied bytes (GH #107 / GH #118).
-/
import Mathlib.Data.List.GetD
import EvmAsm.Evm64.Code.CopyExec
namespace EvmAsm.Evm64
namespace CodeCopyMemory
/-- First destination memory byte written by CODECOPY. -/
def destinationStart (args : Code... | @@ -62,11 +62,26 @@
rw [copyWriteByteAt]
rw [dif_neg h]
+theorem copyWriteByteAt_at_destination_add
+ {code : List (BitVec 8)} {args : CodeCopyArgs.Args} {i : Nat}
+ (h : i < args.size.toNat) :
+ copyWriteByteAt code args (destinationStart args + i) =
+ (CodeCopyExec.copiedBytesFromArgs code args)... | {
"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_3dd92f98ec97_2 | 4cead18128ce2cd7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Code/CopyMemory.lean | CopyMemory | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "copyWriteByteAt_at_destination_add_of_in_bounds",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [copyWriteByteAt_at_destination_add_eq_codeByte h]\n exact Code.byte_of_lt hsrc",
"... | [
{
"name": "copyWriteByteAt_at_destination_add_eq_codeByte",
"text": "theorem copyWriteByteAt_at_destination_add_eq_codeByte\n {code : List (BitVec 8)} {args : CodeCopyArgs.Args} {i : Nat}\n (h : i < args.size.toNat) :\n copyWriteByteAt code args (destinationStart args + i) =\n Code.byte code (... | [
{
"name": "copyWriteByteAt_at_destination_add_of_in_bounds",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 397,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automati... | 4 | /-
EvmAsm.Evm64.Code.CopyMemory
Destination-address bridge for CODECOPY copied bytes (GH #107 / GH #118).
-/
import Mathlib.Data.List.GetD
import EvmAsm.Evm64.Code.CopyExec
namespace EvmAsm.Evm64
namespace CodeCopyMemory
/-- First destination memory byte written by CODECOPY. -/
def destinationStart (args : Code... | /-
EvmAsm.Evm64.Code.CopyMemory
Destination-address bridge for CODECOPY copied bytes (GH #107 / GH #118).
-/
import Mathlib.Data.List.GetD
import EvmAsm.Evm64.Code.CopyExec
namespace EvmAsm.Evm64
namespace CodeCopyMemory
/-- First destination memory byte written by CODECOPY. -/
def destinationStart (args : Code... | @@ -75,12 +75,22 @@
(l := CodeCopyExec.copiedBytesFromArgs code args) (d := 0)
(by simpa [CodeCopyExec.copiedBytesFromArgs_length] using h)
+theorem copyWriteByteAt_at_destination_add_eq_codeByte
+ {code : List (BitVec 8)} {args : CodeCopyArgs.Args} {i : Nat}
+ (h : i < args.size.toNat) :
+ copyWri... | {
"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_3dd92f98ec97_3 | f0a0fbd91e47a49e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Code/CopyMemory.lean | CopyMemory | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "copyWriteByteAt_at_destination_add_of_in_bounds",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [copyWriteByteAt_at_destination_add_eq_codeByte h]\n exact Code.byte_of_lt hsrc",
"... | [
{
"name": "copyWriteByteAt_at_destination_add_eq_codeByte",
"text": "theorem copyWriteByteAt_at_destination_add_eq_codeByte\n {code : List (BitVec 8)} {args : CodeCopyArgs.Args} {i : Nat}\n (h : i < args.size.toNat) :\n copyWriteByteAt code args (destinationStart args + i) =\n Code.byte code (... | [
{
"name": "copyWriteByteAt_at_destination_add_of_out_of_bounds",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 9,
"n_chars": 367,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"autom... | 4 | /-
EvmAsm.Evm64.Code.CopyMemory
Destination-address bridge for CODECOPY copied bytes (GH #107 / GH #118).
-/
import Mathlib.Data.List.GetD
import EvmAsm.Evm64.Code.CopyExec
namespace EvmAsm.Evm64
namespace CodeCopyMemory
/-- First destination memory byte written by CODECOPY. -/
def destinationStart (args : Code... | /-
EvmAsm.Evm64.Code.CopyMemory
Destination-address bridge for CODECOPY copied bytes (GH #107 / GH #118).
-/
import Mathlib.Data.List.GetD
import EvmAsm.Evm64.Code.CopyExec
namespace EvmAsm.Evm64
namespace CodeCopyMemory
/-- First destination memory byte written by CODECOPY. -/
def destinationStart (args : Code... | @@ -75,11 +75,21 @@
(l := CodeCopyExec.copiedBytesFromArgs code args) (d := 0)
(by simpa [CodeCopyExec.copiedBytesFromArgs_length] using h)
+theorem copyWriteByteAt_at_destination_add_eq_codeByte
+ {code : List (BitVec 8)} {args : CodeCopyArgs.Args} {i : Nat}
+ (h : i < args.size.toNat) :
+ copyWri... | {
"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_3dd92f98ec97_4 | 4a463c86de0254ba | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Code/CopyMemory.lean | CopyMemory | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "copyWriteByteAt_zero_size",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply copyWriteByteAt_outside\n intro h\n unfold writesAddress destinationEnd destinationStart CodeCopyArgs.des... | [
{
"name": "copyWriteByteAt_outside",
"text": "theorem copyWriteByteAt_outside\n {code : List (BitVec 8)} {args : CodeCopyArgs.Args} {addr : Nat}\n (h : ¬ writesAddress args addr) :\n copyWriteByteAt code args addr = 0 := by\n rw [copyWriteByteAt]\n rw [dif_neg h]\n\n",
"fan_in": 1,
"n_lin... | [
{
"name": "copyWriteByteAt_zero_size",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 412,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"... | 1 | /-
EvmAsm.Evm64.Code.CopyMemory
Destination-address bridge for CODECOPY copied bytes (GH #107 / GH #118).
-/
import Mathlib.Data.List.GetD
import EvmAsm.Evm64.Code.CopyExec
namespace EvmAsm.Evm64
namespace CodeCopyMemory
/-- First destination memory byte written by CODECOPY. -/
def destinationStart (args : Code... | /-
EvmAsm.Evm64.Code.CopyMemory
Destination-address bridge for CODECOPY copied bytes (GH #107 / GH #118).
-/
import Mathlib.Data.List.GetD
import EvmAsm.Evm64.Code.CopyExec
namespace EvmAsm.Evm64
namespace CodeCopyMemory
/-- First destination memory byte written by CODECOPY. -/
def destinationStart (args : Code... | @@ -41,9 +41,22 @@
else
0
+theorem copyWriteByteAt_outside
+ {code : List (BitVec 8)} {args : CodeCopyArgs.Args} {addr : Nat}
+ (h : ¬ writesAddress args addr) :
+ copyWriteByteAt code args addr = 0 := by
+ rw [copyWriteByteAt]
+ rw [dif_neg h]
+
@[simp] theorem copyWriteByteAt_zero_size
(cod... | {
"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_adc5fd7289ae_0 | e56a6bb4834c13fc | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Blake2fPrecompileResultBridge.lean | Blake2fPrecompileResultBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "toPrecompileResult_status_eok",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [toPrecompileResult_eok gasRemaining h_status]\n rfl",
"n_chars": 61,
"n_subproofs": 0,
"n_ta... | [
{
"name": "toPrecompileResult_eok",
"text": "theorem toPrecompileResult_eok\n {result : Blake2fResult} (gasRemaining : Nat)\n (h_status : result.status = .eok) :\n toPrecompileResult gasRemaining result =\n EvmAsm.Evm64.PrecompileResult.ok (outputBytes result) gasRemaining := by\n simp [toPre... | [
{
"name": "toPrecompileResult_status_eok",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 291,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.EL.Blake2fPrecompileResultBridge
Bridge from the zkVM BLAKE2F accelerator ECALL result to the shared EVM
precompile result surface used by CALL/STATICCALL plumbing.
-/
import EvmAsm.EL.Blake2fEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Blake2fPrecompileResultBridge... | /-
EvmAsm.EL.Blake2fPrecompileResultBridge
Bridge from the zkVM BLAKE2F accelerator ECALL result to the shared EVM
precompile result surface used by CALL/STATICCALL plumbing.
-/
import EvmAsm.EL.Blake2fEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Blake2fPrecompileResultBridge... | @@ -25,11 +25,20 @@
| .eok => EvmAsm.Evm64.PrecompileResult.ok (outputBytes result) gasRemaining
| .efail => EvmAsm.Evm64.PrecompileResult.fail gasRemaining
+theorem toPrecompileResult_eok
+ {result : Blake2fResult} (gasRemaining : Nat)
+ (h_status : result.status = .eok) :
+ toPrecompileResult gasRema... | {
"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_adc5fd7289ae_1 | 040b5bed1ef7dad3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Blake2fPrecompileResultBridge.lean | Blake2fPrecompileResultBridge | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "toPrecompileResult_status_efail",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [toPrecompileResult_efail gasRemaining h_status]\n rfl",
"n_chars": 63,
"n_subproofs": 0,
"... | [
{
"name": "toPrecompileResult_efail",
"text": "theorem toPrecompileResult_efail\n {result : Blake2fResult} (gasRemaining : Nat)\n (h_status : result.status = .efail) :\n toPrecompileResult gasRemaining result =\n EvmAsm.Evm64.PrecompileResult.fail gasRemaining := by\n simp [toPrecompileResult... | [
{
"name": "toPrecompileResult_status_efail",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 297,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.EL.Blake2fPrecompileResultBridge
Bridge from the zkVM BLAKE2F accelerator ECALL result to the shared EVM
precompile result surface used by CALL/STATICCALL plumbing.
-/
import EvmAsm.EL.Blake2fEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Blake2fPrecompileResultBridge... | /-
EvmAsm.EL.Blake2fPrecompileResultBridge
Bridge from the zkVM BLAKE2F accelerator ECALL result to the shared EVM
precompile result surface used by CALL/STATICCALL plumbing.
-/
import EvmAsm.EL.Blake2fEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Blake2fPrecompileResultBridge... | @@ -25,11 +25,20 @@
| .eok => EvmAsm.Evm64.PrecompileResult.ok (outputBytes result) gasRemaining
| .efail => EvmAsm.Evm64.PrecompileResult.fail gasRemaining
+theorem toPrecompileResult_efail
+ {result : Blake2fResult} (gasRemaining : Nat)
+ (h_status : result.status = .efail) :
+ toPrecompileResult gas... | {
"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_adc5fd7289ae_2 | be114045a070a895 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Blake2fPrecompileResultBridge.lean | Blake2fPrecompileResultBridge | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "toPrecompileResult_status_eok",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [toPrecompileResult_eok gasRemaining h_status]\n rfl",
"n_chars": 61,
"n_subproofs": 0,
"n_ta... | [
{
"name": "toPrecompileResult_eok",
"text": "theorem toPrecompileResult_eok\n {result : Blake2fResult} (gasRemaining : Nat)\n (h_status : result.status = .eok) :\n toPrecompileResult gasRemaining result =\n EvmAsm.Evm64.PrecompileResult.ok (outputBytes result) gasRemaining := by\n simp [toPre... | [
{
"name": "toPrecompileResult_output_eok",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 266,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.EL.Blake2fPrecompileResultBridge
Bridge from the zkVM BLAKE2F accelerator ECALL result to the shared EVM
precompile result surface used by CALL/STATICCALL plumbing.
-/
import EvmAsm.EL.Blake2fEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Blake2fPrecompileResultBridge... | /-
EvmAsm.EL.Blake2fPrecompileResultBridge
Bridge from the zkVM BLAKE2F accelerator ECALL result to the shared EVM
precompile result surface used by CALL/STATICCALL plumbing.
-/
import EvmAsm.EL.Blake2fEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Blake2fPrecompileResultBridge... | @@ -25,10 +25,19 @@
| .eok => EvmAsm.Evm64.PrecompileResult.ok (outputBytes result) gasRemaining
| .efail => EvmAsm.Evm64.PrecompileResult.fail gasRemaining
+theorem toPrecompileResult_eok
+ {result : Blake2fResult} (gasRemaining : Nat)
+ (h_status : result.status = .eok) :
+ toPrecompileResult gasRema... | {
"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_adc5fd7289ae_3 | a8014167d61a47fd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Blake2fPrecompileResultBridge.lean | Blake2fPrecompileResultBridge | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "toPrecompileResult_status_efail",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [toPrecompileResult_efail gasRemaining h_status]\n rfl",
"n_chars": 63,
"n_subproofs": 0,
"... | [
{
"name": "toPrecompileResult_efail",
"text": "theorem toPrecompileResult_efail\n {result : Blake2fResult} (gasRemaining : Nat)\n (h_status : result.status = .efail) :\n toPrecompileResult gasRemaining result =\n EvmAsm.Evm64.PrecompileResult.fail gasRemaining := by\n simp [toPrecompileResult... | [
{
"name": "toPrecompileResult_output_efail",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 256,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.EL.Blake2fPrecompileResultBridge
Bridge from the zkVM BLAKE2F accelerator ECALL result to the shared EVM
precompile result surface used by CALL/STATICCALL plumbing.
-/
import EvmAsm.EL.Blake2fEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Blake2fPrecompileResultBridge... | /-
EvmAsm.EL.Blake2fPrecompileResultBridge
Bridge from the zkVM BLAKE2F accelerator ECALL result to the shared EVM
precompile result surface used by CALL/STATICCALL plumbing.
-/
import EvmAsm.EL.Blake2fEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Blake2fPrecompileResultBridge... | @@ -25,10 +25,19 @@
| .eok => EvmAsm.Evm64.PrecompileResult.ok (outputBytes result) gasRemaining
| .efail => EvmAsm.Evm64.PrecompileResult.fail gasRemaining
+theorem toPrecompileResult_efail
+ {result : Blake2fResult} (gasRemaining : Nat)
+ (h_status : result.status = .efail) :
+ toPrecompileResult gas... | {
"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_adc5fd7289ae_4 | 8397f6e9d5f7f1d2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Blake2fPrecompileResultBridge.lean | Blake2fPrecompileResultBridge | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "toPrecompileResult_status_eok",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [toPrecompileResult_eok gasRemaining h_status]\n rfl",
"n_chars": 61,
"n_subproofs": 0,
"n_ta... | [
{
"name": "toPrecompileResult_eok",
"text": "theorem toPrecompileResult_eok\n {result : Blake2fResult} (gasRemaining : Nat)\n (h_status : result.status = .eok) :\n toPrecompileResult gasRemaining result =\n EvmAsm.Evm64.PrecompileResult.ok (outputBytes result) gasRemaining := by\n simp [toPre... | [
{
"name": "toPrecompileResult_output_length_eok",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 299,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": fa... | 3 | /-
EvmAsm.EL.Blake2fPrecompileResultBridge
Bridge from the zkVM BLAKE2F accelerator ECALL result to the shared EVM
precompile result surface used by CALL/STATICCALL plumbing.
-/
import EvmAsm.EL.Blake2fEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Blake2fPrecompileResultBridge... | /-
EvmAsm.EL.Blake2fPrecompileResultBridge
Bridge from the zkVM BLAKE2F accelerator ECALL result to the shared EVM
precompile result surface used by CALL/STATICCALL plumbing.
-/
import EvmAsm.EL.Blake2fEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Blake2fPrecompileResultBridge... | @@ -30,10 +30,19 @@
simp [outputBytes, Blake2fEcallBridge.outputBytesList,
Blake2fResultBridge.outputBytesList_length]
+theorem toPrecompileResult_eok
+ {result : Blake2fResult} (gasRemaining : Nat)
+ (h_status : result.status = .eok) :
+ toPrecompileResult gasRemaining result =
+ EvmAsm.Evm64.P... | {
"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_5c45e540d6c8_0 | 876c6c471422bc77 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/DenormEpilogueV5.lean | DenormEpilogueV5 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "evm_div_denorm_epilogue_spec_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 28,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let antiShift := signExtend12 (0 : BitVec 12) - shift\n let u0' := (u0 >>> (shift.toNat % 64)) ||| ... | [
{
"name": "divK_div_epilogue_spec_within_v5_noNop",
"text": "theorem divK_div_epilogue_spec_within_v5_noNop (sp : Word) (base : Word)\n (q0 q1 q2 q3 v5 v6 v7 v10 m0 m8 m16 m24 : Word) :\n cpsTripleWithin 10 (base + epilogueOff) (base + nopOff) (divCode_noNop_v5 base)\n ((.x12 ↦ᵣ sp) ** (.x5 ↦ᵣ v5... | [
{
"name": "evm_div_denorm_epilogue_spec_v5_noNop",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 48,
"n_chars": 2814,
"n_subproofs": 5,
"n_tactics": 29,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only"... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.DenormEpilogueV5
v5 mirror of the DIV denorm preamble+body+div-epilogue tail (denormOff → nopOff).
The denorm block (block 9) and DIV epilogue block (block 10) are byte-identical
across the div128 v4/v5 migration, so these are exact copies of the v4 mirrors
with the code subsum... | /-
EvmAsm.Evm64.DivMod.Compose.DenormEpilogueV5
v5 mirror of the DIV denorm preamble+body+div-epilogue tail (denormOff → nopOff).
The denorm block (block 9) and DIV epilogue block (block 10) are byte-identical
across the div128 v4/v5 migration, so these are exact copies of the v4 mirrors
with the code subsum... | @@ -123,6 +123,48 @@
-- Load q[0..3], ADDI sp+32, store to output, JAL to NOP
-- ============================================================================
+theorem divK_div_epilogue_spec_within_v5_noNop (sp : Word) (base : Word)
+ (q0 q1 q2 q3 v5 v6 v7 v10 m0 m8 m16 m24 : Word) :
+ cpsTripleWithin 10 (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_5c45e540d6c8_1 | ca4f0b7df1d6df04 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/DenormEpilogueV5.lean | DenormEpilogueV5 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "evm_div_preamble_denorm_epilogue_spec_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hPre := divK_denorm_preamble_spec_within_v5_noNop sp shift v5 v6 v7 v2 v10 base hshift... | [
{
"name": "evm_div_denorm_epilogue_spec_v5_noNop",
"text": "theorem evm_div_denorm_epilogue_spec_v5_noNop (sp base : Word)\n (u0 u1 u2 u3 v2 v5 v7 v10 shift : Word)\n (q0 q1 q2 q3 m0 m8 m16 m24 : Word) :\n cpsTripleWithin (23 + 10) (base + denormOff + 8) (base + nopOff) (divCode_noNop_v5 base)\n ... | [
{
"name": "evm_div_preamble_denorm_epilogue_spec_v5_noNop",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 38,
"n_chars": 2143,
"n_subproofs": 5,
"n_tactics": 21,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automat... | 4 | /-
EvmAsm.Evm64.DivMod.Compose.DenormEpilogueV5
v5 mirror of the DIV denorm preamble+body+div-epilogue tail (denormOff → nopOff).
The denorm block (block 9) and DIV epilogue block (block 10) are byte-identical
across the div128 v4/v5 migration, so these are exact copies of the v4 mirrors
with the code subsum... | /-
EvmAsm.Evm64.DivMod.Compose.DenormEpilogueV5
v5 mirror of the DIV denorm preamble+body+div-epilogue tail (denormOff → nopOff).
The denorm block (block 9) and DIV epilogue block (block 10) are byte-identical
across the div128 v4/v5 migration, so these are exact copies of the v4 mirrors
with the code subsum... | @@ -214,6 +214,52 @@
(fun h hq => by xperm_hyp hq)
h12
+theorem evm_div_denorm_epilogue_spec_v5_noNop (sp base : Word)
+ (u0 u1 u2 u3 v2 v5 v7 v10 shift : Word)
+ (q0 q1 q2 q3 m0 m8 m16 m24 : Word) :
+ cpsTripleWithin (23 + 10) (base + denormOff + 8) (base + nopOff) (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_5c45e540d6c8_2 | 9fdf2f98effb9679 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/DenormEpilogueV5.lean | DenormEpilogueV5 | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "evm_div_denorm_epilogue_spec_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 28,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let antiShift := signExtend12 (0 : BitVec 12) - shift\n let u0' := (u0 >>> (shift.toNat % 64)) ||| ... | [
{
"name": "divK_div_epilogue_spec_within_v5_noNop",
"text": "theorem divK_div_epilogue_spec_within_v5_noNop (sp : Word) (base : Word)\n (q0 q1 q2 q3 v5 v6 v7 v10 m0 m8 m16 m24 : Word) :\n cpsTripleWithin 10 (base + epilogueOff) (base + nopOff) (divCode_noNop_v5 base)\n ((.x12 ↦ᵣ sp) ** (.x5 ↦ᵣ v5... | [
{
"name": "evm_div_shift0_epilogue_spec_v5_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 79,
"n_chars": 4474,
"n_subproofs": 13,
"n_tactics": 46,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 3,
"n_structural": 7,
"automation_only... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.DenormEpilogueV5
v5 mirror of the DIV denorm preamble+body+div-epilogue tail (denormOff → nopOff).
The denorm block (block 9) and DIV epilogue block (block 10) are byte-identical
across the div128 v4/v5 migration, so these are exact copies of the v4 mirrors
with the code subsum... | /-
EvmAsm.Evm64.DivMod.Compose.DenormEpilogueV5
v5 mirror of the DIV denorm preamble+body+div-epilogue tail (denormOff → nopOff).
The denorm block (block 9) and DIV epilogue block (block 10) are byte-identical
across the div128 v4/v5 migration, so these are exact copies of the v4 mirrors
with the code subsum... | @@ -18,6 +18,48 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (bv64_4mul_3)
+theorem divK_div_epilogue_spec_within_v5_noNop (sp : Word) (base : Word)
+ (q0 q1 q2 q3 v5 v6 v7 v10 m0 m8 m16 m24 : Word) :
+ cpsTripleWithin 10 (base + epilogueOff) (base + nopOff) (divCode_noNop_v5 base)
+ ((.x12 ↦ᵣ sp) ** (.... | {
"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_d71bc7ed0d77_0 | a1973900332cba81 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/BlockHash/Spec.lean | Spec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "evm_blockhash_stack_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 213,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro code\n by_cases hc : w.getLimbN 1 = 0 ∧ w.getLimbN 2 = 0 ∧ w.getLimbN 3 = 0 ∧\n BitVec.ult (w... | [
{
"name": "evm_blockhash_zero_high1_spec_within",
"text": "/-- Zero path via the first BNE (target limb 1 nonzero → out of range).\n Executes LD, BNE(taken → `base+96`), then the four-SD zero arm. -/\ntheorem evm_blockhash_zero_high1_spec_within\n (envBaseReg tableBaseReg tgtReg tmpReg valReg : Reg)\n... | [
{
"name": "evm_blockhash_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 7,
"n_deps_transitive": 7,
"n_lines": 257,
"n_chars": 14916,
"n_subproofs": 17,
"n_tactics": 206,
"cyclomatic": 1,
"n_automation": 17,
"n_rewrites": 27,
"n_structural": 11,
"automation_only... | 7 | /-
EvmAsm.Evm64.BlockHash.Spec
Stack-level cpsTripleWithin specification for the EVM `BLOCKHASH` opcode
(0x40; see `EvmAsm/Evm64/BlockHash/Program.lean`).
BLOCKHASH pops a target block number `w` and pushes the hash of that block
when it lies within the recent-history window, or zero otherwise. With
`cur`... | /-
EvmAsm.Evm64.BlockHash.Spec
Stack-level cpsTripleWithin specification for the EVM `BLOCKHASH` opcode
(0x40; see `EvmAsm/Evm64/BlockHash/Program.lean`).
BLOCKHASH pops a target block number `w` and pushes the hash of that block
when it lies within the recent-history window, or zero otherwise. With
`cur`... | @@ -70,6 +70,57 @@
-- table-entry cells at `tblAddr + ((count - (cur - i0)) <<< 5) + {0,8,16,24}`.
-- ============================================================================
+/-- Zero path via the first BNE (target limb 1 nonzero → out of range).
+ Executes LD, BNE(taken → `base+96`), then the four-SD zero ... | {
"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_8f83cd88c8b9_0 | 1c8287cbc3345fb4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopDefs/Iter.lean | Iter | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "iterWithDoubleAddback_carry_zero_of_mulsub_c3_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [iterWithDoubleAddback_no_borrow]\n · unfold mulsubN4_c3 at hc3\n rw [hc3, huTop]... | [
{
"name": "iterWithDoubleAddback_no_borrow",
"text": "theorem iterWithDoubleAddback_no_borrow {qHat v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word}\n (hb : ¬BitVec.ult uTop (mulsubN4 qHat v0 v1 v2 v3 u0 u1 u2 u3).2.2.2.2) :\n let ms := mulsubN4 qHat v0 v1 v2 v3 u0 u1 u2 u3\n iterWithDoubleAddback qHat v0 v1 v... | [
{
"name": "iterWithDoubleAddback_carry_zero_of_mulsub_c3_zero",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 594,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 5,
"n_structural": 0,
"autom... | 1 | /-
EvmAsm.Evm64.DivMod.LoopDefs.Iter
Pure computations for the Knuth Algorithm D loop body:
* mulsub / addback limb chains and carry helpers
* div128 trial quotient + scratch helpers (div128Quot/DLo/Un0)
* iterWithDoubleAddback + per-n iterN*Max/iterN*Call wrappers
* Bool-dispatch unifiers iterN1/i... | /-
EvmAsm.Evm64.DivMod.LoopDefs.Iter
Pure computations for the Knuth Algorithm D loop body:
* mulsub / addback limb chains and carry helpers
* div128 trial quotient + scratch helpers (div128Quot/DLo/Un0)
* iterWithDoubleAddback + per-n iterN*Max/iterN*Call wrappers
* Bool-dispatch unifiers iterN1/i... | @@ -297,6 +297,13 @@
-- Equation lemmas for iterWithDoubleAddback in each branch.
-- These avoid expanding the full definition inline; producers `rw` with them.
+theorem iterWithDoubleAddback_no_borrow {qHat v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word}
+ (hb : ¬BitVec.ult uTop (mulsubN4 qHat v0 v1 v2 v3 u0 u1 u2 u3).2.2... | {
"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_8f83cd88c8b9_1 | beab49df20d9d5f2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopDefs/Iter.lean | Iter | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "iterWithDoubleAddback_carry_zero_of_mulsub_c3_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [iterWithDoubleAddback_no_borrow]\n · unfold mulsubN4_c3 at hc3\n rw [hc3, huTop]... | [
{
"name": "iterWithDoubleAddback_no_borrow",
"text": "theorem iterWithDoubleAddback_no_borrow {qHat v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word}\n (hb : ¬BitVec.ult uTop (mulsubN4 qHat v0 v1 v2 v3 u0 u1 u2 u3).2.2.2.2) :\n let ms := mulsubN4 qHat v0 v1 v2 v3 u0 u1 u2 u3\n iterWithDoubleAddback qHat v0 v1 v... | [
{
"name": "iterN1_true_carry_zero_of_mulsub_c3_zero",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 491,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only... | 2 | /-
EvmAsm.Evm64.DivMod.LoopDefs.Iter
Pure computations for the Knuth Algorithm D loop body:
* mulsub / addback limb chains and carry helpers
* div128 trial quotient + scratch helpers (div128Quot/DLo/Un0)
* iterWithDoubleAddback + per-n iterN*Max/iterN*Call wrappers
* Bool-dispatch unifiers iterN1/i... | /-
EvmAsm.Evm64.DivMod.LoopDefs.Iter
Pure computations for the Knuth Algorithm D loop body:
* mulsub / addback limb chains and carry helpers
* div128 trial quotient + scratch helpers (div128Quot/DLo/Un0)
* iterWithDoubleAddback + per-n iterN*Max/iterN*Call wrappers
* Bool-dispatch unifiers iterN1/i... | @@ -297,6 +297,13 @@
-- Equation lemmas for iterWithDoubleAddback in each branch.
-- These avoid expanding the full definition inline; producers `rw` with them.
+theorem iterWithDoubleAddback_no_borrow {qHat v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word}
+ (hb : ¬BitVec.ult uTop (mulsubN4 qHat v0 v1 v2 v3 u0 u1 u2 u3).2.2... | {
"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_8f83cd88c8b9_2 | ea3fbac0c6117ac2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopDefs/Iter.lean | Iter | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "iterWithDoubleAddback_carry_zero_of_mulsub_c3_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [iterWithDoubleAddback_no_borrow]\n · unfold mulsubN4_c3 at hc3\n rw [hc3, huTop]... | [
{
"name": "iterWithDoubleAddback_no_borrow",
"text": "theorem iterWithDoubleAddback_no_borrow {qHat v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word}\n (hb : ¬BitVec.ult uTop (mulsubN4 qHat v0 v1 v2 v3 u0 u1 u2 u3).2.2.2.2) :\n let ms := mulsubN4 qHat v0 v1 v2 v3 u0 u1 u2 u3\n iterWithDoubleAddback qHat v0 v1 v... | [
{
"name": "iterN1_false_carry_zero_of_mulsub_c3_zero",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 16,
"n_chars": 713,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_onl... | 2 | /-
EvmAsm.Evm64.DivMod.LoopDefs.Iter
Pure computations for the Knuth Algorithm D loop body:
* mulsub / addback limb chains and carry helpers
* div128 trial quotient + scratch helpers (div128Quot/DLo/Un0)
* iterWithDoubleAddback + per-n iterN*Max/iterN*Call wrappers
* Bool-dispatch unifiers iterN1/i... | /-
EvmAsm.Evm64.DivMod.LoopDefs.Iter
Pure computations for the Knuth Algorithm D loop body:
* mulsub / addback limb chains and carry helpers
* div128 trial quotient + scratch helpers (div128Quot/DLo/Un0)
* iterWithDoubleAddback + per-n iterN*Max/iterN*Call wrappers
* Bool-dispatch unifiers iterN1/i... | @@ -297,6 +297,13 @@
-- Equation lemmas for iterWithDoubleAddback in each branch.
-- These avoid expanding the full definition inline; producers `rw` with them.
+theorem iterWithDoubleAddback_no_borrow {qHat v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word}
+ (hb : ¬BitVec.ult uTop (mulsubN4 qHat v0 v1 v2 v3 u0 u1 u2 u3).2.2... | {
"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_53aec190debf_0 | 5044917c6fc5a51c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/RwSubwindow.lean | RwSubwindow | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "bytesRegion_window_update",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hlen' : (setBytes ws j win').length = ws.length := length_setBytes _ _ _\n rw [bytesRegion_window_focus B (... | [
{
"name": "window_readback",
"text": "/-- Reading the freshly-written window back out of the spliced arena. -/\ntheorem window_readback (ws ns : List (BitVec 8)) (j : Nat)\n (hfit : j + ns.length ≤ ws.length) :\n ((setBytes ws j ns).drop j).take ns.length = ns := by\n apply List.ext_getElem\n · rw [... | [
{
"name": "bytesRegion_window_update",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 22,
"n_chars": 1131,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 5,
"n_structural": 2,
"automation_only": false,
... | 2 | /-
EvmAsm.Rv64.SAsm.RwSubwindow
**The multi-RW-subwindow callee adapter** (bead evm-asm-4ch8f.38.5) —
the WRITABLE analog of `callAt`'s read-only focusing.
Crypto callers (`bnf_mul_mod_p`, `p256_op_with`, `point_double`'s
converter half) call a SEQUENCE of callees that each write a different
subwindow of ... | /-
EvmAsm.Rv64.SAsm.RwSubwindow
**The multi-RW-subwindow callee adapter** (bead evm-asm-4ch8f.38.5) —
the WRITABLE analog of `callAt`'s read-only focusing.
Crypto callers (`bnf_mul_mod_p`, `p256_op_with`, `point_double`'s
converter half) call a SEQUENCE of callees that each write a different
subwindow of ... | @@ -89,6 +89,30 @@
funext h
exact propext ⟨fun hp => by xperm_hyp hp, fun hp => by xperm_hyp hp⟩
+/-- Reading the freshly-written window back out of the spliced arena. -/
+theorem window_readback (ws ns : List (BitVec 8)) (j : Nat)
+ (hfit : j + ns.length ≤ ws.length) :
+ ((setBytes ws j ns).drop j).take ... | {
"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_53aec190debf_1 | 910c2f9d2d7e4255 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/RwSubwindow.lean | RwSubwindow | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "wsNat256_setBytes_inside",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold wsNat256\n have h0 := wsDword_setBytes_inside (ws := ws) (ns := ns) (j := j) (t := 0)\n (by omega) hfi... | [
{
"name": "wsDword_setBytes_inside",
"text": "/-- A dword read INSIDE the freshly-spliced window is a read of the new\n window's bytes. -/\ntheorem wsDword_setBytes_inside {ws ns : List (BitVec 8)} {j t : Nat}\n (h8 : t + 8 ≤ ns.length) (hfit : j + ns.length ≤ ws.length) :\n wsDword (setBytes ws j ... | [
{
"name": "wsNat256_setBytes_inside",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 813,
"n_subproofs": 4,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 4,
"n_structural": 0,
"automation_only": false,
"... | 1 | /-
EvmAsm.Rv64.SAsm.RwSubwindow
**The multi-RW-subwindow callee adapter** (bead evm-asm-4ch8f.38.5) —
the WRITABLE analog of `callAt`'s read-only focusing.
Crypto callers (`bnf_mul_mod_p`, `p256_op_with`, `point_double`'s
converter half) call a SEQUENCE of callees that each write a different
subwindow of ... | /-
EvmAsm.Rv64.SAsm.RwSubwindow
**The multi-RW-subwindow callee adapter** (bead evm-asm-4ch8f.38.5) —
the WRITABLE analog of `callAt`'s read-only focusing.
Crypto callers (`bnf_mul_mod_p`, `p256_op_with`, `point_double`'s
converter half) call a SEQUENCE of callees that each write a different
subwindow of ... | @@ -60,11 +60,49 @@
bytesRegion B (ws.take j) **
bytesRegion (B + BitVec.ofNat 64 (j + n)) (ws.drop (j + n))
+/-- A dword read INSIDE the freshly-spliced window is a read of the new
+ window's bytes. -/
+theorem wsDword_setBytes_inside {ws ns : List (BitVec 8)} {j t : Nat}
+ (h8 : t + 8 ≤ ns.length) (hfit... | {
"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_53aec190debf_2 | afe3d43cf38ebc8a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/RwSubwindow.lean | RwSubwindow | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "cpsTripleWithin_rwWindow",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hF := cpsTripleWithin_frameR (windowRest B ws j n)\n (pcFree_windowRest B ws j n) h\n refine cpsTripleWit... | [
{
"name": "bytesRegion_window_update",
"text": "/-- **Update**: the SAME rest reassembles the arena around a replaced\n window — a write that stayed inside `[j, j+n)` merges to `setBytes`,\n leaving every other subwindow untouched. -/\ntheorem bytesRegion_window_update (B : Word) (ws win' : List (BitV... | [
{
"name": "cpsTripleWithin_rwWindow",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 26,
"n_chars": 1304,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"... | 4 | /-
EvmAsm.Rv64.SAsm.RwSubwindow
**The multi-RW-subwindow callee adapter** (bead evm-asm-4ch8f.38.5) —
the WRITABLE analog of `callAt`'s read-only focusing.
Crypto callers (`bnf_mul_mod_p`, `p256_op_with`, `point_double`'s
converter half) call a SEQUENCE of callees that each write a different
subwindow of ... | /-
EvmAsm.Rv64.SAsm.RwSubwindow
**The multi-RW-subwindow callee adapter** (bead evm-asm-4ch8f.38.5) —
the WRITABLE analog of `callAt`'s read-only focusing.
Crypto callers (`bnf_mul_mod_p`, `p256_op_with`, `point_double`'s
converter half) call a SEQUENCE of callees that each write a different
subwindow of ... | @@ -117,6 +117,27 @@
rw [hgl, hgr] at hg
exact hg
+/-- **Update**: the SAME rest reassembles the arena around a replaced
+ window — a write that stayed inside `[j, j+n)` merges to `setBytes`,
+ leaving every other subwindow untouched. -/
+theorem bytesRegion_window_update (B : Word) (ws win' : List (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_53aec190debf_3 | 420c090e539a9b8e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/RwSubwindow.lean | RwSubwindow | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "wsNat256_leBytes32",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := wsNat256_setBytes_leBytes32 (bs := leBytes32 v) (j := 0) (v := v)\n hv (by rw [length_leBytes32])\n rwa [s... | [
{
"name": "setBytes_self",
"text": "/-- `setBytes` with the list's own content is the identity. -/\ntheorem setBytes_self (l : List (BitVec 8)) : setBytes l 0 l = l := by\n apply List.ext_getElem (by rw [length_setBytes])\n intro k hk1 hk2\n have hg := getByteAt_setBytes l l 0 k (by omega)\n rw [if_pos ... | [
{
"name": "wsNat256_leBytes32",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 298,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nest... | 1 | /-
EvmAsm.Rv64.SAsm.RwSubwindow
**The multi-RW-subwindow callee adapter** (bead evm-asm-4ch8f.38.5) —
the WRITABLE analog of `callAt`'s read-only focusing.
Crypto callers (`bnf_mul_mod_p`, `p256_op_with`, `point_double`'s
converter half) call a SEQUENCE of callees that each write a different
subwindow of ... | /-
EvmAsm.Rv64.SAsm.RwSubwindow
**The multi-RW-subwindow callee adapter** (bead evm-asm-4ch8f.38.5) —
the WRITABLE analog of `callAt`'s read-only focusing.
Crypto callers (`bnf_mul_mod_p`, `p256_op_with`, `point_double`'s
converter half) call a SEQUENCE of callees that each write a different
subwindow of ... | @@ -60,9 +60,28 @@
bytesRegion B (ws.take j) **
bytesRegion (B + BitVec.ofNat 64 (j + n)) (ws.drop (j + n))
+/-- `setBytes` with the list's own content is the identity. -/
+theorem setBytes_self (l : List (BitVec 8)) : setBytes l 0 l = l := by
+ apply List.ext_getElem (by rw [length_setBytes])
+ intro k hk1 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_53aec190debf_4 | b4d54bca7c7f6168 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/RwSubwindow.lean | RwSubwindow | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "cpsTripleWithin_rwWindow",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hF := cpsTripleWithin_frameR (windowRest B ws j n)\n (pcFree_windowRest B ws j n) h\n refine cpsTripleWit... | [
{
"name": "bytesRegion_window_update",
"text": "/-- **Update**: the SAME rest reassembles the arena around a replaced\n window — a write that stayed inside `[j, j+n)` merges to `setBytes`,\n leaving every other subwindow untouched. -/\ntheorem bytesRegion_window_update (B : Word) (ws win' : List (BitV... | [
{
"name": "pcFree_exists",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 12,
"n_chars": 381,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_nesting"... | 5 | /-
EvmAsm.Rv64.SAsm.RwSubwindow
**The multi-RW-subwindow callee adapter** (bead evm-asm-4ch8f.38.5) —
the WRITABLE analog of `callAt`'s read-only focusing.
Crypto callers (`bnf_mul_mod_p`, `p256_op_with`, `point_double`'s
converter half) call a SEQUENCE of callees that each write a different
subwindow of ... | /-
EvmAsm.Rv64.SAsm.RwSubwindow
**The multi-RW-subwindow callee adapter** (bead evm-asm-4ch8f.38.5) —
the WRITABLE analog of `callAt`'s read-only focusing.
Crypto callers (`bnf_mul_mod_p`, `p256_op_with`, `point_double`'s
converter half) call a SEQUENCE of callees that each write a different
subwindow of ... | @@ -117,6 +117,27 @@
rw [hgl, hgr] at hg
exact hg
+/-- **Update**: the SAME rest reassembles the arena around a replaced
+ window — a write that stayed inside `[j, j+n)` merges to `setBytes`,
+ leaving every other subwindow untouched. -/
+theorem bytesRegion_window_update (B : Word) (ws win' : List (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_901ff50edced_0 | 685b4db7bf9f56c2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN1/CallAddbackV4NoNop.lean | CallAddbackV4NoNop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "divK_loop_body_n1_call_addback_j0_beq_v4_spec_within_noNop_exact_x1_scratch",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_weaken\n (fun h hp => hp)\n (fun h... | [
{
"name": "loopBodyN1CallAddbackBeqJ0PostV4NoX1_eq_scratch",
"text": "theorem loopBodyN1CallAddbackBeqJ0PostV4NoX1_eq_scratch\n (sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem : Word) :\n loopBodyN1CallAddbackBeqJ0PostV4NoX1 sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem =\n loopBodyN1CallAddba... | [
{
"name": "divK_loop_body_n1_call_addback_j0_beq_v4_spec_within_noNop_exact_x1_scratch",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 41,
"n_chars": 2107,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n... | 2 | import EvmAsm.Evm64.DivMod.LoopBody.CorrectionAddbackBeqV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN1.CallV4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
@[irreducible]
def loopBodyN1CallAddbackBeqJ0PostV4
(sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem : Word) : Assertion :=
let dLo... | import EvmAsm.Evm64.DivMod.LoopBody.CorrectionAddbackBeqV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN1.CallV4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
@[irreducible]
def loopBodyN1CallAddbackBeqJ0PostV4
(sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem : Word) : Assertion :=
let dLo... | @@ -49,6 +49,18 @@
(loopBodyN1CallAddbackBeqJ0PostV4NoX1 sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem) :=
⟨loopBodyN1CallAddbackBeqJ0PostV4NoX1_pcFree sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem⟩
+theorem loopBodyN1CallAddbackBeqJ0PostV4NoX1_eq_scratch
+ (sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop scrat... | {
"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_901ff50edced_1 | c68c30f80ce7c5d3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN1/CallAddbackV4NoNop.lean | CallAddbackV4NoNop | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "divK_loop_body_n1_call_addback_j0_beq_v4_spec_within_noNop_exact_x1_scratch",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_weaken\n (fun h hp => hp)\n (fun h... | [
{
"name": "loopBodyN1CallAddbackBeqJ0PostV4NoX1_eq_scratch",
"text": "theorem loopBodyN1CallAddbackBeqJ0PostV4NoX1_eq_scratch\n (sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem : Word) :\n loopBodyN1CallAddbackBeqJ0PostV4NoX1 sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem =\n loopBodyN1CallAddba... | [
{
"name": "divK_loop_body_n1_call_addback_j0_beq_v4_spec_within_noNop_exact_x1_loopIterScratch",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 51,
"n_chars": 2450,
"n_subproofs": 1,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3... | 3 | import EvmAsm.Evm64.DivMod.LoopBody.CorrectionAddbackBeqV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN1.CallV4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
@[irreducible]
def loopBodyN1CallAddbackBeqJ0PostV4
(sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem : Word) : Assertion :=
let dLo... | import EvmAsm.Evm64.DivMod.LoopBody.CorrectionAddbackBeqV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN1.CallV4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
@[irreducible]
def loopBodyN1CallAddbackBeqJ0PostV4
(sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem : Word) : Assertion :=
let dLo... | @@ -49,6 +49,18 @@
(loopBodyN1CallAddbackBeqJ0PostV4NoX1 sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem) :=
⟨loopBodyN1CallAddbackBeqJ0PostV4NoX1_pcFree sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem⟩
+theorem loopBodyN1CallAddbackBeqJ0PostV4NoX1_eq_scratch
+ (sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop scrat... | {
"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_901ff50edced_2 | 9386e69890f65f44 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN1/CallAddbackV4NoNop.lean | CallAddbackV4NoNop | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "divK_loop_body_n1_call_addback_j0_beq_v4_spec_within_noNop_noX1",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_weaken\n (loopBodyN1CallSkipJ0PreV4NoX1_to_loopBo... | [
{
"name": "divK_loop_body_n1_call_addback_j0_beq_v4_spec_within_noNop",
"text": "/-- No-NOP/v4 loop body cpsTripleWithin for n=1, call+addback, j=0. -/\ntheorem divK_loop_body_n1_call_addback_j0_beq_v4_spec_within_noNop\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop q... | [
{
"name": "divK_loop_body_n1_call_addback_j0_beq_v4_spec_within_noNop_noX1",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 39,
"n_chars": 2135,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural"... | 1 | import EvmAsm.Evm64.DivMod.LoopBody.CorrectionAddbackBeqV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN1.CallV4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
@[irreducible]
def loopBodyN1CallAddbackBeqJ0PostV4
(sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem : Word) : Assertion :=
let dLo... | import EvmAsm.Evm64.DivMod.LoopBody.CorrectionAddbackBeqV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN1.CallV4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
@[irreducible]
def loopBodyN1CallAddbackBeqJ0PostV4
(sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem : Word) : Assertion :=
let dLo... | @@ -91,6 +91,118 @@
(loopBodyN1CallAddbackBeqJgt0PostV4NoX1 sp base j v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem) :=
⟨loopBodyN1CallAddbackBeqJgt0PostV4NoX1_pcFree sp base j v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem⟩
+/-- No-NOP/v4 loop body cpsTripleWithin for n=1, call+addback, j=0. -/
+theorem divK_loop_body_... | {
"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_901ff50edced_3 | 0c54834360e193e5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN1/CallAddbackV4NoNop.lean | CallAddbackV4NoNop | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "divK_loop_body_n1_call_addback_jgt0_beq_v4_spec_within_noNop_exact_x1_scratch",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_weaken\n (fun h hp => hp)\n (fun... | [
{
"name": "loopBodyN1CallAddbackBeqJgt0PostV4NoX1_eq_scratch",
"text": "theorem loopBodyN1CallAddbackBeqJgt0PostV4NoX1_eq_scratch\n (sp base j v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem : Word) :\n loopBodyN1CallAddbackBeqJgt0PostV4NoX1 sp base j v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem =\n loopBodyN... | [
{
"name": "divK_loop_body_n1_call_addback_jgt0_beq_v4_spec_within_noNop_exact_x1_scratch",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 42,
"n_chars": 2186,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
... | 2 | import EvmAsm.Evm64.DivMod.LoopBody.CorrectionAddbackBeqV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN1.CallV4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
@[irreducible]
def loopBodyN1CallAddbackBeqJ0PostV4
(sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem : Word) : Assertion :=
let dLo... | import EvmAsm.Evm64.DivMod.LoopBody.CorrectionAddbackBeqV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN1.CallV4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
@[irreducible]
def loopBodyN1CallAddbackBeqJ0PostV4
(sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem : Word) : Assertion :=
let dLo... | @@ -91,6 +91,18 @@
(loopBodyN1CallAddbackBeqJgt0PostV4NoX1 sp base j v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem) :=
⟨loopBodyN1CallAddbackBeqJgt0PostV4NoX1_pcFree sp base j v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem⟩
+theorem loopBodyN1CallAddbackBeqJgt0PostV4NoX1_eq_scratch
+ (sp base j v0 v1 v2 v3 u0 u1 u2 u... | {
"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_901ff50edced_4 | da526813a1428cbf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN1/CallAddbackV4NoNop.lean | CallAddbackV4NoNop | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "divK_loop_body_n1_call_addback_jgt0_beq_v4_spec_within_noNop_exact_x1_scratch",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_weaken\n (fun h hp => hp)\n (fun... | [
{
"name": "loopBodyN1CallAddbackBeqJgt0PostV4NoX1_eq_scratch",
"text": "theorem loopBodyN1CallAddbackBeqJgt0PostV4NoX1_eq_scratch\n (sp base j v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem : Word) :\n loopBodyN1CallAddbackBeqJgt0PostV4NoX1 sp base j v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem =\n loopBodyN... | [
{
"name": "divK_loop_body_n1_call_addback_jgt0_beq_v4_spec_within_noNop_exact_x1_loopIterScratch",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 52,
"n_chars": 2527,
"n_subproofs": 1,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites":... | 3 | import EvmAsm.Evm64.DivMod.LoopBody.CorrectionAddbackBeqV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN1.CallV4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
@[irreducible]
def loopBodyN1CallAddbackBeqJ0PostV4
(sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem : Word) : Assertion :=
let dLo... | import EvmAsm.Evm64.DivMod.LoopBody.CorrectionAddbackBeqV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN1.CallV4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
@[irreducible]
def loopBodyN1CallAddbackBeqJ0PostV4
(sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem : Word) : Assertion :=
let dLo... | @@ -91,6 +91,18 @@
(loopBodyN1CallAddbackBeqJgt0PostV4NoX1 sp base j v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem) :=
⟨loopBodyN1CallAddbackBeqJgt0PostV4NoX1_pcFree sp base j v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem⟩
+theorem loopBodyN1CallAddbackBeqJgt0PostV4NoX1_eq_scratch
+ (sp base j v0 v1 v2 v3 u0 u1 u2 u... | {
"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_901ff50edced_5 | e04156b7fc325c20 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN1/CallAddbackV4NoNop.lean | CallAddbackV4NoNop | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "divK_loop_body_n1_call_addback_jgt0_beq_v4_spec_within_noNop_noX1",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have legacy := divK_loop_body_n1_call_addback_jgt0_beq_v4_spec_within_no... | [
{
"name": "divK_loop_body_n1_call_addback_jgt0_beq_v4_spec_within_noNop",
"text": "/-- No-NOP/v4 loop body cpsTripleWithin for n=1, call+addback, j>0. -/\ntheorem divK_loop_body_n1_call_addback_jgt0_beq_v4_spec_within_noNop (j : Word)\n (hpos : BitVec.slt (j + signExtend12 4095) 0 = false)\n (sp jOld ... | [
{
"name": "divK_loop_body_n1_call_addback_jgt0_beq_v4_spec_within_noNop_noX1",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 42,
"n_chars": 2256,
"n_subproofs": 1,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structura... | 1 | import EvmAsm.Evm64.DivMod.LoopBody.CorrectionAddbackBeqV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN1.CallV4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
@[irreducible]
def loopBodyN1CallAddbackBeqJ0PostV4
(sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem : Word) : Assertion :=
let dLo... | import EvmAsm.Evm64.DivMod.LoopBody.CorrectionAddbackBeqV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN1.CallV4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
@[irreducible]
def loopBodyN1CallAddbackBeqJ0PostV4
(sp base v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem : Word) : Assertion :=
let dLo... | @@ -91,6 +91,133 @@
(loopBodyN1CallAddbackBeqJgt0PostV4NoX1 sp base j v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem) :=
⟨loopBodyN1CallAddbackBeqJgt0PostV4NoX1_pcFree sp base j v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem⟩
+/-- No-NOP/v4 loop body cpsTripleWithin for n=1, call+addback, j>0. -/
+theorem divK_loop_body_... | {
"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_0d97efa05ea6_0 | 28da2fdfd9a52e4f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/LogStackExecutionBridge.lean | LogStackExecutionBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "runLogStack?_log_entries_length",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases (runLogStack?_eq_some_iff kind emitter readByte state out).mp h_run with\n ⟨args, rest, _h_decode... | [
{
"name": "runLogStack?_eq_some_iff",
"text": "theorem runLogStack?_eq_some_iff\n (kind : LogKind) (emitter : Address) (readByte : MemoryReader)\n (state out : LogStackState) :\n runLogStack? kind emitter readByte state = some out ↔\n ∃ args rest,\n EvmAsm.Evm64.LogArgsStackDecode.decod... | [
{
"name": "runLogStack?_log_entries_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 724,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,... | 1 | /-
EvmAsm.EL.LogStackExecutionBridge
Pure stack-to-log execution bridge for LOG0 through LOG4 (GH #112).
-/
import EvmAsm.Evm64.LogArgsStackDecode
import EvmAsm.EL.LogExecutionBridge
namespace EvmAsm.EL
namespace LogStackExecutionBridge
abbrev EvmWord := EvmAsm.Evm64.EvmWord
abbrev LogKind := EvmAsm.Evm64.LogA... | /-
EvmAsm.EL.LogStackExecutionBridge
Pure stack-to-log execution bridge for LOG0 through LOG4 (GH #112).
-/
import EvmAsm.Evm64.LogArgsStackDecode
import EvmAsm.EL.LogExecutionBridge
namespace EvmAsm.EL
namespace LogStackExecutionBridge
abbrev EvmWord := EvmAsm.Evm64.EvmWord
abbrev LogKind := EvmAsm.Evm64.LogA... | @@ -70,6 +70,36 @@
@[simp] theorem stackRestAfterLog?_singleton (kind : LogKind) (offset : EvmWord) :
stackRestAfterLog? kind [offset] = none := rfl
+theorem runLogStack?_eq_some_iff
+ (kind : LogKind) (emitter : Address) (readByte : MemoryReader)
+ (state out : LogStackState) :
+ runLogStack? kind emi... | {
"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_d5440ce2037a_0 | 6e4ee00de15a50fa | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/ParentHeaderFrame.lean | ParentHeaderFrame | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 35 | 2 | [
{
"theorem_name": "ofNat_succ_addr",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [show signExtend12 (1 : BitVec 12) = BitVec.ofNat 64 1 from by decide,\n BitVec.add_assoc, ofNat_add']",
"n_cha... | [
{
"name": "ofNat_add'",
"text": "private theorem ofNat_add' (a b : Nat) :\n BitVec.ofNat 64 a + BitVec.ofNat 64 b = BitVec.ofNat 64 (a + b) := by\n apply BitVec.eq_of_toNat_eq\n simp only [BitVec.toNat_add, BitVec.toNat_ofNat]\n omega\n\n",
"fan_in": 2,
"n_lines": 7,
"n_chars": 205,
"n... | [
{
"name": "ofNat_succ_addr",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 269,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_nesting... | 1 | /-
EvmAsm.Rv64.SAsm.ParentHeaderFrame
**The first real sp-frame guest routine verified through the ABI-frame
construct** (bead evm-asm-ffziu): the re-emitted, verified drop-in for
`parent_header_matches_witness_first`
(`EvmAsm/Codegen/Programs/BlockHashPredicates.lean`).
The routine is a probe-only leaf (... | /-
EvmAsm.Rv64.SAsm.ParentHeaderFrame
**The first real sp-frame guest routine verified through the ABI-frame
construct** (bead evm-asm-ffziu): the re-emitted, verified drop-in for
`parent_header_matches_witness_first`
(`EvmAsm/Codegen/Programs/BlockHashPredicates.lean`).
The routine is a probe-only leaf (... | @@ -232,9 +232,17 @@
-- Arithmetic helpers.
-- ============================================================================
+private theorem ofNat_add' (a b : Nat) :
+ BitVec.ofNat 64 a + BitVec.ofNat 64 b = BitVec.ofNat 64 (a + b) := by
+ apply BitVec.eq_of_toNat_eq
+ simp only [BitVec.toNat_add, BitVec.toNat... | {
"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_d5440ce2037a_1 | dd24005e3f821a3c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/ParentHeaderFrame.lean | ParentHeaderFrame | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 35 | 10 | [
{
"theorem_name": "seg1_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine liftSeg (seg := seg1Prog) 9 (by decide) (by rfl) (by decide) ?_\n show cpsTripleWithin 6 (0xF3C : Word) (0xF54 : Word) (... | [
{
"name": "liftSeg",
"text": "/-- Lift a segment triple proven over its own contiguous `ofProg` slice into\n the routine `CodeReq`. -/\nprivate theorem liftSeg {n : Nat} {A B : Word} {seg : List Instr} {P Q : Assertion}\n (idx : Nat)\n (haddr : A = (0xF18 : Word) + BitVec.ofNat 64 (4 * idx))\n (... | [
{
"name": "seg1_spec",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 31,
"n_chars": 1767,
"n_subproofs": 6,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 10,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 2 | /-
EvmAsm.Rv64.SAsm.ParentHeaderFrame
**The first real sp-frame guest routine verified through the ABI-frame
construct** (bead evm-asm-ffziu): the re-emitted, verified drop-in for
`parent_header_matches_witness_first`
(`EvmAsm/Codegen/Programs/BlockHashPredicates.lean`).
The routine is a probe-only leaf (... | /-
EvmAsm.Rv64.SAsm.ParentHeaderFrame
**The first real sp-frame guest routine verified through the ABI-frame
construct** (bead evm-asm-ffziu): the re-emitted, verified drop-in for
`parent_header_matches_witness_first`
(`EvmAsm/Codegen/Programs/BlockHashPredicates.lean`).
The routine is a probe-only leaf (... | @@ -208,6 +208,19 @@
rw [hget] at m
exact CodeReq.singleton_mono m
+/-- Lift a segment triple proven over its own contiguous `ofProg` slice into
+ the routine `CodeReq`. -/
+private theorem liftSeg {n : Nat} {A B : Word} {seg : List Instr} {P Q : Assertion}
+ (idx : Nat)
+ (haddr : A = (0xF18 : 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_d5440ce2037a_2 | 28ddd681eca2e8a7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/ParentHeaderFrame.lean | ParentHeaderFrame | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 35 | 8 | [
{
"theorem_name": "br6_taken",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbeq := beq_spec_gen_within .x19 .x0 (232 : BitVec 13) v 0 (0xF54 : Word)\n rw [show (0xF54 : Word) + signExtend13 (232 : ... | [
{
"name": "memAt",
"text": "/-- Code-membership: instruction `idx` of the routine sits in `phmwCr`. -/\nprivate theorem memAt (idx : Nat) (addr : Word) (instr : Instr)\n (hk : idx < phmwProgList.length) (hbound : 4 * phmwProgList.length < 2 ^ 64)\n (haddr : addr = (0xF18 : Word) + BitVec.ofNat 64 (4 *... | [
{
"name": "br6_taken",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 793,
"n_subproofs": 2,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 2,
"n_structural": 3,
"automation_only": false,
"max_nesting": 6... | 1 | /-
EvmAsm.Rv64.SAsm.ParentHeaderFrame
**The first real sp-frame guest routine verified through the ABI-frame
construct** (bead evm-asm-ffziu): the re-emitted, verified drop-in for
`parent_header_matches_witness_first`
(`EvmAsm/Codegen/Programs/BlockHashPredicates.lean`).
The routine is a probe-only leaf (... | /-
EvmAsm.Rv64.SAsm.ParentHeaderFrame
**The first real sp-frame guest routine verified through the ABI-frame
construct** (bead evm-asm-ffziu): the re-emitted, verified drop-in for
`parent_header_matches_witness_first`
(`EvmAsm/Codegen/Programs/BlockHashPredicates.lean`).
The routine is a probe-only leaf (... | @@ -198,6 +198,16 @@
`0xF18 + 4·58 = 0x1000`. -/
def phmwCr : CodeReq := CodeReq.ofProg 0xF18 phmwProgList
+/-- Code-membership: instruction `idx` of the routine sits in `phmwCr`. -/
+private theorem memAt (idx : Nat) (addr : Word) (instr : Instr)
+ (hk : idx < phmwProgList.length) (hbound : 4 * phmwProgList... | {
"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_d5440ce2037a_3 | 16531dd30c82bca3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/ParentHeaderFrame.lean | ParentHeaderFrame | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 35 | 3 | [
{
"theorem_name": "seg3_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine liftSeg (seg := seg3Prog) 32 (by decide) (by rfl) (by decide) ?_\n show cpsTripleWithin 2 (0xF98 : Word) (0xFA0 : Word) ... | [
{
"name": "addr_fold",
"text": "/-- Fold `base + ofNat a + ofNat b` into `base + ofNat (a + b)`. -/\nprivate theorem addr_fold (b : Word) (i j : Nat) :\n (b + BitVec.ofNat 64 i) + BitVec.ofNat 64 j = b + BitVec.ofNat 64 (i + j) := by\n rw [BitVec.add_assoc, ofNat_add']\n\n",
"fan_in": 3,
"n_line... | [
{
"name": "phmwCore_spec",
"fan_in": 1,
"n_deps_direct": 16,
"n_deps_transitive": 35,
"n_lines": 446,
"n_chars": 23006,
"n_subproofs": 59,
"n_tactics": 374,
"cyclomatic": 1,
"n_automation": 22,
"n_rewrites": 8,
"n_structural": 5,
"automation_only": false,
"max... | 35 | /-
EvmAsm.Rv64.SAsm.ParentHeaderFrame
**The first real sp-frame guest routine verified through the ABI-frame
construct** (bead evm-asm-ffziu): the re-emitted, verified drop-in for
`parent_header_matches_witness_first`
(`EvmAsm/Codegen/Programs/BlockHashPredicates.lean`).
The routine is a probe-only leaf (... | /-
EvmAsm.Rv64.SAsm.ParentHeaderFrame
**The first real sp-frame guest routine verified through the ABI-frame
construct** (bead evm-asm-ffziu): the re-emitted, verified drop-in for
`parent_header_matches_witness_first`
(`EvmAsm/Codegen/Programs/BlockHashPredicates.lean`).
The routine is a probe-only leaf (... | @@ -256,6 +256,11 @@
rw [BitVec.toNat_add, BitVec.toNat_ofNat, Nat.zero_mod, Nat.add_zero,
Nat.mod_eq_of_lt x.isLt]
+/-- Fold `base + ofNat a + ofNat b` into `base + ofNat (a + b)`. -/
+private theorem addr_fold (b : Word) (i j : Nat) :
+ (b + BitVec.ofNat 64 i) + BitVec.ofNat 64 j = b + BitVec.ofNat 64 ... | {
"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_941ea7a416d6_0 | 41de3b0093e317c7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/LimbSpec.lean | LimbSpec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "mstoreOneLimbCode_eq_ofProg",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mstoreOneLimbCode mstoreOneLimbProg LD single seq\n rw [mstoreByteUnpackEightCode_eq_ofProg]\n change... | [
{
"name": "mstoreByteUnpackEightCode_eq_ofProg",
"text": "theorem mstoreByteUnpackEightCode_eq_ofProg\n (addrReg byteReg accReg : Reg)\n (off0 off1 off2 off3 off4 off5 off6 off7 : BitVec 12)\n (base : Word) :\n mstoreByteUnpackEightCode addrReg byteReg accReg\n off0 off1 off2 off3 off4 off5... | [
{
"name": "mstoreOneLimbCode_eq_ofProg",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 925,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 4,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.MStore.LimbSpec
Level-1 executable specs for MSTORE byte-unpack blocks.
-/
import EvmAsm.Evm64.MStore.ByteAlg
import EvmAsm.Rv64.Program
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmA... | /-
EvmAsm.Evm64.MStore.LimbSpec
Level-1 executable specs for MSTORE byte-unpack blocks.
-/
import EvmAsm.Evm64.MStore.ByteAlg
import EvmAsm.Rv64.Program
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmA... | @@ -81,6 +81,34 @@
mstoreByteUnpackEightProg addrReg byteReg accReg
off0 off1 off2 off3 off4 off5 off6 off7
+theorem mstoreByteUnpackEightCode_eq_ofProg
+ (addrReg byteReg accReg : Reg)
+ (off0 off1 off2 off3 off4 off5 off6 off7 : BitVec 12)
+ (base : Word) :
+ mstoreByteUnpackEightCode addrReg by... | {
"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_941ea7a416d6_1 | e6e84bffa8746908 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/LimbSpec.lean | LimbSpec | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 3 | [
{
"theorem_name": "mstore_byte_unpack_step_pair_low_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro storedByte stored shift cr\n rw [mstoreBytePairStepPre_unfold, mstoreBytePairStepPost_... | [
{
"name": "mstoreBytePairStepPre_unfold",
"text": "theorem mstoreBytePairStepPre_unfold\n (addrReg byteReg accReg : Reg)\n (addrPtr accVal byteOld loVal hiVal loAddr hiAddr : Word) :\n mstoreBytePairStepPre addrReg byteReg accReg\n addrPtr accVal byteOld loVal hiVal loAddr hiAddr =\n ((... | [
{
"name": "mstore_byte_unpack_step_pair_low_spec_within",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 44,
"n_chars": 2062,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 6,
"n_structural": 2,
"automatio... | 3 | /-
EvmAsm.Evm64.MStore.LimbSpec
Level-1 executable specs for MSTORE byte-unpack blocks.
-/
import EvmAsm.Evm64.MStore.ByteAlg
import EvmAsm.Rv64.Program
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmA... | /-
EvmAsm.Evm64.MStore.LimbSpec
Level-1 executable specs for MSTORE byte-unpack blocks.
-/
import EvmAsm.Evm64.MStore.ByteAlg
import EvmAsm.Rv64.Program
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmA... | @@ -164,6 +164,16 @@
(addrReg ↦ᵣ addrPtr) ** (accReg ↦ᵣ accVal) ** (byteReg ↦ᵣ byteOld) **
(loAddr ↦ₘ loVal) ** (hiAddr ↦ₘ hiVal)
+theorem mstoreBytePairStepPre_unfold
+ (addrReg byteReg accReg : Reg)
+ (addrPtr accVal byteOld loVal hiVal loAddr hiAddr : Word) :
+ mstoreBytePairStepPre addrReg byteReg ... | {
"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_941ea7a416d6_2 | 74879b17665287bd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/LimbSpec.lean | LimbSpec | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 3 | [
{
"theorem_name": "mstore_byte_unpack_step_pair_low_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro storedByte stored shift cr\n rw [mstoreBytePairStepPre_unfold, mstoreBytePairStepPost_... | [
{
"name": "mstoreBytePairStepPre_unfold",
"text": "theorem mstoreBytePairStepPre_unfold\n (addrReg byteReg accReg : Reg)\n (addrPtr accVal byteOld loVal hiVal loAddr hiAddr : Word) :\n mstoreBytePairStepPre addrReg byteReg accReg\n addrPtr accVal byteOld loVal hiVal loAddr hiAddr =\n ((... | [
{
"name": "mstore_byte_unpack_step_pair_high_spec_within",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 44,
"n_chars": 2068,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 6,
"n_structural": 2,
"automati... | 3 | /-
EvmAsm.Evm64.MStore.LimbSpec
Level-1 executable specs for MSTORE byte-unpack blocks.
-/
import EvmAsm.Evm64.MStore.ByteAlg
import EvmAsm.Rv64.Program
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmA... | /-
EvmAsm.Evm64.MStore.LimbSpec
Level-1 executable specs for MSTORE byte-unpack blocks.
-/
import EvmAsm.Evm64.MStore.ByteAlg
import EvmAsm.Rv64.Program
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmA... | @@ -164,6 +164,16 @@
(addrReg ↦ᵣ addrPtr) ** (accReg ↦ᵣ accVal) ** (byteReg ↦ᵣ byteOld) **
(loAddr ↦ₘ loVal) ** (hiAddr ↦ₘ hiVal)
+theorem mstoreBytePairStepPre_unfold
+ (addrReg byteReg accReg : Reg)
+ (addrPtr accVal byteOld loVal hiVal loAddr hiAddr : Word) :
+ mstoreBytePairStepPre addrReg byteReg ... | {
"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_941ea7a416d6_3 | 58040c6042da0569 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/LimbSpec.lean | LimbSpec | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 3 | [
{
"theorem_name": "mstore_byte_unpack_step_pair_low_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro storedByte stored shift cr\n rw [mstoreBytePairStepPre_unfold, mstoreBytePairStepPost_... | [
{
"name": "mstoreBytePairStepPost_unfold",
"text": "theorem mstoreBytePairStepPost_unfold\n (addrReg byteReg accReg : Reg)\n (addrPtr accVal storedLo storedHi loAddr hiAddr : Word)\n (k : Nat) :\n mstoreBytePairStepPost addrReg byteReg accReg\n addrPtr accVal storedLo storedHi loAddr hiAd... | [
{
"name": "mstore_byte_unpack_step_pair_spec_within",
"fan_in": 2,
"n_deps_direct": 4,
"n_deps_transitive": 5,
"n_lines": 50,
"n_chars": 2587,
"n_subproofs": 5,
"n_tactics": 21,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 4,
"automation_on... | 5 | /-
EvmAsm.Evm64.MStore.LimbSpec
Level-1 executable specs for MSTORE byte-unpack blocks.
-/
import EvmAsm.Evm64.MStore.ByteAlg
import EvmAsm.Rv64.Program
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmA... | /-
EvmAsm.Evm64.MStore.LimbSpec
Level-1 executable specs for MSTORE byte-unpack blocks.
-/
import EvmAsm.Evm64.MStore.ByteAlg
import EvmAsm.Rv64.Program
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmA... | @@ -187,6 +187,19 @@
(addrReg ↦ᵣ addrPtr) ** (accReg ↦ᵣ accVal) ** (byteReg ↦ᵣ byteVal) **
(loAddr ↦ₘ storedLo) ** (hiAddr ↦ₘ storedHi)
+theorem mstoreBytePairStepPost_unfold
+ (addrReg byteReg accReg : Reg)
+ (addrPtr accVal storedLo storedHi loAddr hiAddr : Word)
+ (k : Nat) :
+ mstoreBytePairStep... | {
"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.