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_50c871053dee_0 | f93525daca4a154d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulIter.lean | SavedBitBaseTwoMulIter | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 5 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulCode_bit_test_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expIterBodyFullMsbSavedBitTwoMulCode_eq_ofProg]\n exact CodeReq.ofProg_mono_sub bas... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulCode_eq_ofProg",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulCode_eq_ofProg (base : Word)\n (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :\n expIterBodyFullMsbSavedBitTwoMulCode\n base squaringMulOff condMulOff skipOff bac... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulCode_bit_test_sub",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 26,
"n_chars": 1009,
"n_subproofs": 0,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 1,
"auto... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
Two-MUL saved-bit EXP iteration CodeReq decomposition.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseIter
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
/-- CodeReq decomposition for the corrected saved-bit iteration with separat... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
Two-MUL saved-bit EXP iteration CodeReq decomposition.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseIter
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
/-- CodeReq decomposition for the corrected saved-bit iteration with separat... | @@ -25,12 +25,76 @@
CodeReq.ofProg (base + 228) (EvmAsm.Evm64.exp_loop_back backOff)
]
+theorem expIterBodyFullMsbSavedBitTwoMulCode_eq_ofProg (base : Word)
+ (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :
+ expIterBodyFullMsbSavedBitTwoMulCode
+ base squaringMulOff condM... | {
"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_50c871053dee_1 | e8ceadea30a8415f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulIter.lean | SavedBitBaseTwoMulIter | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 5 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulCode_bit_test_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expIterBodyFullMsbSavedBitTwoMulCode_eq_ofProg]\n exact CodeReq.ofProg_mono_sub bas... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulCode_eq_ofProg",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulCode_eq_ofProg (base : Word)\n (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :\n expIterBodyFullMsbSavedBitTwoMulCode\n base squaringMulOff condMulOff skipOff bac... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulCode_save_bit_sub",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 26,
"n_chars": 1016,
"n_subproofs": 0,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 1,
"auto... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
Two-MUL saved-bit EXP iteration CodeReq decomposition.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseIter
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
/-- CodeReq decomposition for the corrected saved-bit iteration with separat... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
Two-MUL saved-bit EXP iteration CodeReq decomposition.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseIter
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
/-- CodeReq decomposition for the corrected saved-bit iteration with separat... | @@ -25,12 +25,76 @@
CodeReq.ofProg (base + 228) (EvmAsm.Evm64.exp_loop_back backOff)
]
+theorem expIterBodyFullMsbSavedBitTwoMulCode_eq_ofProg (base : Word)
+ (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :
+ expIterBodyFullMsbSavedBitTwoMulCode
+ base squaringMulOff condM... | {
"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_50c871053dee_2 | e74d4684a4a51ae6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulIter.lean | SavedBitBaseTwoMulIter | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 5 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulCode_bit_test_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expIterBodyFullMsbSavedBitTwoMulCode_eq_ofProg]\n exact CodeReq.ofProg_mono_sub bas... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulCode_eq_ofProg",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulCode_eq_ofProg (base : Word)\n (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :\n expIterBodyFullMsbSavedBitTwoMulCode\n base squaringMulOff condMulOff skipOff bac... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulCode_squaring_sub",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 27,
"n_chars": 1085,
"n_subproofs": 0,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 1,
"auto... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
Two-MUL saved-bit EXP iteration CodeReq decomposition.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseIter
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
/-- CodeReq decomposition for the corrected saved-bit iteration with separat... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
Two-MUL saved-bit EXP iteration CodeReq decomposition.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseIter
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
/-- CodeReq decomposition for the corrected saved-bit iteration with separat... | @@ -25,12 +25,77 @@
CodeReq.ofProg (base + 228) (EvmAsm.Evm64.exp_loop_back backOff)
]
+theorem expIterBodyFullMsbSavedBitTwoMulCode_eq_ofProg (base : Word)
+ (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :
+ expIterBodyFullMsbSavedBitTwoMulCode
+ base squaringMulOff condM... | {
"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_50c871053dee_3 | 80c9cb9ab5706047 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulIter.lean | SavedBitBaseTwoMulIter | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 5 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulCode_bit_test_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expIterBodyFullMsbSavedBitTwoMulCode_eq_ofProg]\n exact CodeReq.ofProg_mono_sub bas... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulCode_eq_ofProg",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulCode_eq_ofProg (base : Word)\n (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :\n expIterBodyFullMsbSavedBitTwoMulCode\n base squaringMulOff condMulOff skipOff bac... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulCode_cond_mul_sub",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 28,
"n_chars": 1212,
"n_subproofs": 0,
"n_tactics": 21,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 1,
"auto... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
Two-MUL saved-bit EXP iteration CodeReq decomposition.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseIter
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
/-- CodeReq decomposition for the corrected saved-bit iteration with separat... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
Two-MUL saved-bit EXP iteration CodeReq decomposition.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseIter
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
/-- CodeReq decomposition for the corrected saved-bit iteration with separat... | @@ -25,12 +25,78 @@
CodeReq.ofProg (base + 228) (EvmAsm.Evm64.exp_loop_back backOff)
]
+theorem expIterBodyFullMsbSavedBitTwoMulCode_eq_ofProg (base : Word)
+ (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :
+ expIterBodyFullMsbSavedBitTwoMulCode
+ base squaringMulOff condM... | {
"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_50c871053dee_4 | 723a9f02a5dc5414 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulIter.lean | SavedBitBaseTwoMulIter | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 5 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulCode_bit_test_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expIterBodyFullMsbSavedBitTwoMulCode_eq_ofProg]\n exact CodeReq.ofProg_mono_sub bas... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulCode_eq_ofProg",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulCode_eq_ofProg (base : Word)\n (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :\n expIterBodyFullMsbSavedBitTwoMulCode\n base squaringMulOff condMulOff skipOff bac... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulCode_loop_back_sub",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 26,
"n_chars": 1031,
"n_subproofs": 0,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 1,
"aut... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
Two-MUL saved-bit EXP iteration CodeReq decomposition.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseIter
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
/-- CodeReq decomposition for the corrected saved-bit iteration with separat... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
Two-MUL saved-bit EXP iteration CodeReq decomposition.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseIter
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
/-- CodeReq decomposition for the corrected saved-bit iteration with separat... | @@ -25,12 +25,76 @@
CodeReq.ofProg (base + 228) (EvmAsm.Evm64.exp_loop_back backOff)
]
+theorem expIterBodyFullMsbSavedBitTwoMulCode_eq_ofProg (base : Word)
+ (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :
+ expIterBodyFullMsbSavedBitTwoMulCode
+ base squaringMulOff condM... | {
"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_fb28f3c0976f_0 | 75cfab166c67fb15 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MSize/Program.lean | Program | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_msize_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_msize_length]",
"n_chars": 27,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_auto... | [
{
"name": "evm_msize_length",
"text": "/-- Concrete instruction length of `evm_msize`. -/\ntheorem evm_msize_length (sizeReg tempReg : Reg) :\n (evm_msize sizeReg tempReg).length = 6 := by\n simp [evm_msize, LD, ADDI, SD, single, seq, Program.length_append]\n\n",
"fan_in": 1,
"n_lines": 6,
"... | [
{
"name": "evm_msize_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 211,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_n... | 1 | /-
EvmAsm.Evm64.MSize.Program
256-bit EVM MSIZE: push the current memory high-water mark (in bytes,
already 32-byte aligned) onto the EVM stack.
The high-water mark is held in a single 8-byte cell at the address held
in `sizeReg`, modelled by `evmMemSizeIs sizeLoc sizeBytes` in
`Evm64/Memory.lean` (issue ... | /-
EvmAsm.Evm64.MSize.Program
256-bit EVM MSIZE: push the current memory high-water mark (in bytes,
already 32-byte aligned) onto the EVM stack.
The high-water mark is held in a single 8-byte cell at the address held
in `sizeReg`, modelled by `evmMemSizeIs sizeLoc sizeBytes` in
`Evm64/Memory.lean` (issue ... | @@ -49,9 +49,15 @@
abbrev evm_msize_code (sizeReg tempReg : Reg) (base : Word) : CodeReq :=
CodeReq.ofProg base (evm_msize sizeReg tempReg)
+/-- Concrete instruction length of `evm_msize`. -/
+theorem evm_msize_length (sizeReg tempReg : Reg) :
+ (evm_msize sizeReg tempReg).length = 6 := by
+ simp [evm_msize, ... | {
"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_cd7d4b4de2f3_0 | 60077108e0dd52e4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/SwdWriteBe8SAsm.lean | SwdWriteBe8SAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "step_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have haddr : (rf.get .x11 + rf.get .x5 + signExtend12 (0 : BitVec 12) - dst).toNat = i := by\n rw [hx11, hx5, show signExte... | [
{
"name": "store_val_eq_beByte",
"text": "/-- The value the routine computes and stores at iteration `i` is exactly the\n `i`-th big-endian byte of `v`. -/\ntheorem store_val_eq_beByte (v : Word) (i : Nat) (hi : i < 8) :\n BitVec.truncate 8\n ((v >>> ((56 - BitVec.ofNat 64 i <<< (3 : BitVec 6).... | [
{
"name": "step_engine",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 1009,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
"max_nesting"... | 1 | /-
EvmAsm.Codegen.Programs.SwdWriteBe8SAsm
Verified SAsm port of `swd_write_be8` (bead evm-asm-4ch8f.12.8): write the
u64 in `a0` big-endian into the 8 bytes at `a1`.
Source (`swdWriteBe8_prog` in SystemWrites.lean): a fixed 8-iteration loop
(`i = x5 : 0 → 8`) that, for each `i`, extracts the `i`-th big-end... | /-
EvmAsm.Codegen.Programs.SwdWriteBe8SAsm
Verified SAsm port of `swd_write_be8` (bead evm-asm-4ch8f.12.8): write the
u64 in `a0` big-endian into the 8 bytes at `a1`.
Source (`swdWriteBe8_prog` in SystemWrites.lean): a fixed 8-iteration loop
(`i = x5 : 0 → 8`) that, for each `i`, extracts the `i`-th big-end... | @@ -110,6 +110,19 @@
let r6 := r5.set .x30 (r5.get .x11 + r5.get .x5)
r6.set .x5 (r6.get .x5 + signExtend12 (1 : BitVec 12))
+/-- The value the routine computes and stores at iteration `i` is exactly the
+ `i`-th big-endian byte of `v`. -/
+theorem store_val_eq_beByte (v : Word) (i : Nat) (hi : i < 8) :
+ ... | {
"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_cd7d4b4de2f3_1 | dac84a2169073960 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/SwdWriteBe8SAsm.lean | SwdWriteBe8SAsm | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "swdWriteBe8Fn_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 57,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hnowrap : dst.toNat + 8 < 2 ^ 64 := hwf.2.1\n vcgen\n case region => exact ⟨Region.empty_wf, hwf⟩\n case swdWri... | [
{
"name": "stepRf_get_x10",
"text": "theorem stepRf_get_x10 (rf : RegFile) : (stepRf rf).get .x10 = rf.get .x10 := by\n unfold stepRf\n simp only [RegFile.get_set_ne _ _ _ _ (by decide : Reg.x10 ≠ .x5),\n RegFile.get_set_ne _ _ _ _ (by decide : Reg.x10 ≠ .x30),\n RegFile.get_set_ne _ _ _ _ (by decid... | [
{
"name": "swdWriteBe8Fn_spec",
"fan_in": 0,
"n_deps_direct": 8,
"n_deps_transitive": 9,
"n_lines": 61,
"n_chars": 3110,
"n_subproofs": 7,
"n_tactics": 62,
"cyclomatic": 6,
"n_automation": 31,
"n_rewrites": 19,
"n_structural": 16,
"automation_only": false,
"ma... | 9 | /-
EvmAsm.Codegen.Programs.SwdWriteBe8SAsm
Verified SAsm port of `swd_write_be8` (bead evm-asm-4ch8f.12.8): write the
u64 in `a0` big-endian into the 8 bytes at `a1`.
Source (`swdWriteBe8_prog` in SystemWrites.lean): a fixed 8-iteration loop
(`i = x5 : 0 → 8`) that, for each `i`, extracts the `i`-th big-end... | /-
EvmAsm.Codegen.Programs.SwdWriteBe8SAsm
Verified SAsm port of `swd_write_be8` (bead evm-asm-4ch8f.12.8): write the
u64 in `a0` big-endian into the 8 bytes at `a1`.
Source (`swdWriteBe8_prog` in SystemWrites.lean): a fixed 8-iteration loop
(`i = x5 : 0 → 8`) that, for each `i`, extracts the `i`-th big-end... | @@ -148,6 +148,14 @@
RegFile.get_set_ne _ _ _ _ (by decide : Reg.x6 ≠ .x7),
RegFile.get_set_ne _ _ _ _ (by decide : Reg.x6 ≠ .x28)]
+theorem stepRf_get_x10 (rf : RegFile) : (stepRf rf).get .x10 = rf.get .x10 := by
+ unfold stepRf
+ simp only [RegFile.get_set_ne _ _ _ _ (by decide : Reg.x10 ≠ .x5),
+ Re... | {
"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_ee6c2195f44d_0 | 7ce18619e81a1e8c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoop.lean | SavedBitBoundaryLoop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "exp_two_mul_boundary_loop_epilogue_of_loop_bounded_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n cpsTripleWithin_mono_nSteps hBound\n (exp_two_mul_boundary_l... | [
{
"name": "exp_two_mul_boundary_loop_epilogue_of_loop_spec_within",
"text": "/-- Compose the named prologue boundary, any loop proof over the named\n loop-entry/loop-exit surface, and the named epilogue boundary. The future\n 256-iteration proof can instantiate `hLoop`. -/\ntheorem exp_two_mul_boundar... | [
{
"name": "exp_two_mul_boundary_loop_epilogue_of_loop_bounded_spec_within",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 30,
"n_chars": 1419,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": ... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | @@ -15,6 +15,37 @@
open EvmAsm.Rv64
+/-- Compose the named prologue boundary, any loop proof over the named
+ loop-entry/loop-exit surface, and the named epilogue boundary. The future
+ 256-iteration proof can instantiate `hLoop`. -/
+theorem exp_two_mul_boundary_loop_epilogue_of_loop_spec_within
+ {nStep... | {
"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_ee6c2195f44d_1 | 77de0fb81adc3b7e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoop.lean | SavedBitBoundaryLoop | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "exp_two_mul_boundary_loop_epilogue_of_loop_closed_bound_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n exp_two_mul_boundary_loop_epilogue_of_loop_bounded_spec_with... | [
{
"name": "exp_two_mul_boundary_loop_epilogue_of_loop_bounded_spec_within",
"text": "/-- Bounded variant of\n `exp_two_mul_boundary_loop_epilogue_of_loop_spec_within`. This packages\n the prologue/loop/epilogue boundary into a caller-chosen closed-form bound\n for the later full-loop theorem. -/\nt... | [
{
"name": "exp_two_mul_boundary_loop_epilogue_of_loop_closed_bound_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 30,
"n_chars": 1373,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structur... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | @@ -46,6 +46,35 @@
(exp_pointer_restore_then_epilogue_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_named_loop_exit_spec_within
sp evmSp iterCountNew tOld r0 r1 r2 r3 baseWord rest exitCond base)
+/-- Bounded variant of
+ `exp_two_mul_boundary_loop_epilogue_of_loop_spec_within`. This package... | {
"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_ee6c2195f44d_2 | 8db8398c328bd951 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoop.lean | SavedBitBoundaryLoop | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "exp_two_mul_boundary_loop_epilogue_of_loop_closed_bound_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n exp_two_mul_boundary_loop_epilogue_of_loop_bounded_spec_with... | [
{
"name": "exp_two_mul_boundary_loop_epilogue_of_loop_bounded_spec_within",
"text": "/-- Bounded variant of\n `exp_two_mul_boundary_loop_epilogue_of_loop_spec_within`. This packages\n the prologue/loop/epilogue boundary into a caller-chosen closed-form bound\n for the later full-loop theorem. -/\nt... | [
{
"name": "exp_two_mul_boundary_loop_epilogue_of_loop_exact_closed_bound_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 26,
"n_chars": 1231,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_st... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | @@ -46,6 +46,35 @@
(exp_pointer_restore_then_epilogue_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_named_loop_exit_spec_within
sp evmSp iterCountNew tOld r0 r1 r2 r3 baseWord rest exitCond base)
+/-- Bounded variant of
+ `exp_two_mul_boundary_loop_epilogue_of_loop_spec_within`. This package... | {
"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_ee6c2195f44d_3 | 3c379e87e0e5dbe6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoop.lean | SavedBitBoundaryLoop | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "exp_two_mul_boundary_loop_epilogue_of_loop_closed_bound_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n exp_two_mul_boundary_loop_epilogue_of_loop_bounded_spec_with... | [
{
"name": "exp_two_mul_boundary_loop_epilogue_of_loop_bounded_spec_within",
"text": "/-- Bounded variant of\n `exp_two_mul_boundary_loop_epilogue_of_loop_spec_within`. This packages\n the prologue/loop/epilogue boundary into a caller-chosen closed-form bound\n for the later full-loop theorem. -/\nt... | [
{
"name": "exp_two_mul_full_loop_boundary_of_body_spec_within",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 28,
"n_chars": 1355,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"auto... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | @@ -46,6 +46,35 @@
(exp_pointer_restore_then_epilogue_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_named_loop_exit_spec_within
sp evmSp iterCountNew tOld r0 r1 r2 r3 baseWord rest exitCond base)
+/-- Bounded variant of
+ `exp_two_mul_boundary_loop_epilogue_of_loop_spec_within`. This package... | {
"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_ee6c2195f44d_4 | 815e438d18daaf9a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoop.lean | SavedBitBoundaryLoop | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 4 | [
{
"theorem_name": "exp_two_mul_full_loop_boundary_of_entry_tail_exit_cases_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 37,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hEntryTriple :\n cpsTripleWithin 0 (base + 28) (base + 28)\n... | [
{
"name": "exp_two_mul_full_loop_boundary_of_body_spec_within",
"text": "/-- Specialization of the named boundary composition to the 256-iteration\n saved-bit two-MUL loop body bound. This is the outer shell expected by the\n eventual full-loop proof once the loop proof itself is available. -/\ntheore... | [
{
"name": "exp_two_mul_full_loop_boundary_of_entry_tail_exit_cases_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 84,
"n_chars": 4012,
"n_subproofs": 3,
"n_tactics": 37,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structu... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | @@ -75,6 +75,33 @@
sp evmSp cOld tOld m0 m1 m2 m3 vOld v18 iterCountNew
r0 r1 r2 r3 baseWord exponentWord rest exitCond base hLoop)
+/-- Specialization of the named boundary composition to the 256-iteration
+ saved-bit two-MUL loop body bound. This is the outer shell expected by the
+ eventual... | {
"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_ee6c2195f44d_5 | 23683cb8bfc4c600 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoop.lean | SavedBitBoundaryLoop | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 4 | [
{
"theorem_name": "exp_two_mul_full_loop_boundary_of_entry_tail_exit_cases_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 37,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hEntryTriple :\n cpsTripleWithin 0 (base + 28) (base + 28)\n... | [
{
"name": "exp_two_mul_full_loop_boundary_of_body_spec_within",
"text": "/-- Specialization of the named boundary composition to the 256-iteration\n saved-bit two-MUL loop body bound. This is the outer shell expected by the\n eventual full-loop proof once the loop proof itself is available. -/\ntheore... | [
{
"name": "exp_two_mul_full_loop_boundary_of_entry_tail_exit_cases_closed_bound_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 67,
"n_chars": 3181,
"n_subproofs": 1,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
... | 4 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | @@ -75,6 +75,33 @@
sp evmSp cOld tOld m0 m1 m2 m3 vOld v18 iterCountNew
r0 r1 r2 r3 baseWord exponentWord rest exitCond base hLoop)
+/-- Specialization of the named boundary composition to the 256-iteration
+ saved-bit two-MUL loop body bound. This is the outer shell expected by the
+ eventual... | {
"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_ee6c2195f44d_6 | ea469428487bd55e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoop.lean | SavedBitBoundaryLoop | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 4 | [
{
"theorem_name": "exp_two_mul_full_loop_boundary_of_entry_tail_exit_cases_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 37,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hEntryTriple :\n cpsTripleWithin 0 (base + 28) (base + 28)\n... | [
{
"name": "exp_two_mul_full_loop_boundary_of_body_spec_within",
"text": "/-- Specialization of the named boundary composition to the 256-iteration\n saved-bit two-MUL loop body bound. This is the outer shell expected by the\n eventual full-loop proof once the loop proof itself is available. -/\ntheore... | [
{
"name": "exp_two_mul_full_loop_boundary_of_entry_body_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 50,
"n_chars": 2166,
"n_subproofs": 2,
"n_tactics": 24,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 3,
... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | @@ -75,6 +75,33 @@
sp evmSp cOld tOld m0 m1 m2 m3 vOld v18 iterCountNew
r0 r1 r2 r3 baseWord exponentWord rest exitCond base hLoop)
+/-- Specialization of the named boundary composition to the 256-iteration
+ saved-bit two-MUL loop body bound. This is the outer shell expected by the
+ eventual... | {
"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_ee6c2195f44d_7 | 8ac8f0781cafb2c6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoop.lean | SavedBitBoundaryLoop | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 4 | [
{
"theorem_name": "exp_two_mul_full_loop_boundary_of_entry_tail_exit_cases_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 37,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hEntryTriple :\n cpsTripleWithin 0 (base + 28) (base + 28)\n... | [
{
"name": "exp_two_mul_full_loop_boundary_of_body_spec_within",
"text": "/-- Specialization of the named boundary composition to the 256-iteration\n saved-bit two-MUL loop body bound. This is the outer shell expected by the\n eventual full-loop proof once the loop proof itself is available. -/\ntheore... | [
{
"name": "exp_two_mul_full_loop_boundary_of_entry_body_closed_bound_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 40,
"n_chars": 1640,
"n_subproofs": 1,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_struc... | 4 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | @@ -75,6 +75,33 @@
sp evmSp cOld tOld m0 m1 m2 m3 vOld v18 iterCountNew
r0 r1 r2 r3 baseWord exponentWord rest exitCond base hLoop)
+/-- Specialization of the named boundary composition to the 256-iteration
+ saved-bit two-MUL loop body bound. This is the outer shell expected by the
+ eventual... | {
"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_ee6c2195f44d_8 | c9495b15cc115461 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoop.lean | SavedBitBoundaryLoop | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 4 | [
{
"theorem_name": "exp_two_mul_full_loop_boundary_of_entry_tail_exit_cases_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 37,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hEntryTriple :\n cpsTripleWithin 0 (base + 28) (base + 28)\n... | [
{
"name": "exp_two_mul_full_loop_boundary_of_body_spec_within",
"text": "/-- Specialization of the named boundary composition to the 256-iteration\n saved-bit two-MUL loop body bound. This is the outer shell expected by the\n eventual full-loop proof once the loop proof itself is available. -/\ntheore... | [
{
"name": "exp_two_mul_full_loop_boundary_of_bounded_body_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 29,
"n_chars": 1414,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | @@ -75,6 +75,33 @@
sp evmSp cOld tOld m0 m1 m2 m3 vOld v18 iterCountNew
r0 r1 r2 r3 baseWord exponentWord rest exitCond base hLoop)
+/-- Specialization of the named boundary composition to the 256-iteration
+ saved-bit two-MUL loop body bound. This is the outer shell expected by the
+ eventual... | {
"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_ee6c2195f44d_9 | 966680d0d43279f2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoop.lean | SavedBitBoundaryLoop | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 4 | [
{
"theorem_name": "exp_two_mul_full_loop_boundary_of_entry_tail_exit_cases_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 37,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hEntryTriple :\n cpsTripleWithin 0 (base + 28) (base + 28)\n... | [
{
"name": "exp_two_mul_full_loop_boundary_of_body_spec_within",
"text": "/-- Specialization of the named boundary composition to the 256-iteration\n saved-bit two-MUL loop body bound. This is the outer shell expected by the\n eventual full-loop proof once the loop proof itself is available. -/\ntheore... | [
{
"name": "exp_two_mul_full_loop_boundary_of_bounded_body_closed_bound_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 32,
"n_chars": 1424,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_str... | 4 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | @@ -75,6 +75,33 @@
sp evmSp cOld tOld m0 m1 m2 m3 vOld v18 iterCountNew
r0 r1 r2 r3 baseWord exponentWord rest exitCond base hLoop)
+/-- Specialization of the named boundary composition to the 256-iteration
+ saved-bit two-MUL loop body bound. This is the outer shell expected by the
+ eventual... | {
"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_ee6c2195f44d_10 | 1793e3db35ea30dd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoop.lean | SavedBitBoundaryLoop | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 4 | [
{
"theorem_name": "exp_two_mul_full_loop_boundary_of_entry_tail_exit_cases_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 37,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hEntryTriple :\n cpsTripleWithin 0 (base + 28) (base + 28)\n... | [
{
"name": "exp_two_mul_full_loop_boundary_of_body_spec_within",
"text": "/-- Specialization of the named boundary composition to the 256-iteration\n saved-bit two-MUL loop body bound. This is the outer shell expected by the\n eventual full-loop proof once the loop proof itself is available. -/\ntheore... | [
{
"name": "exp_two_mul_full_loop_boundary_of_body_closed_bound_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 35,
"n_chars": 1740,
"n_subproofs": 1,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural"... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | @@ -75,6 +75,33 @@
sp evmSp cOld tOld m0 m1 m2 m3 vOld v18 iterCountNew
r0 r1 r2 r3 baseWord exponentWord rest exitCond base hLoop)
+/-- Specialization of the named boundary composition to the 256-iteration
+ saved-bit two-MUL loop body bound. This is the outer shell expected by the
+ eventual... | {
"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_ee6c2195f44d_11 | 916ef3136cb9f9cc | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoop.lean | SavedBitBoundaryLoop | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "exp_two_mul_boundary_loop_epilogue_of_loop_general_bounded_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n cpsTripleWithin_mono_nSteps hBound\n (exp_two_mul_bo... | [
{
"name": "exp_two_mul_boundary_loop_epilogue_of_loop_general_spec_within",
"text": "/-- Generalised boundary composition that accepts the full-stack loop-exit\n pre-frame directly, with `d0..d3` as a separate parameters (not forced to\n equal `r0..r3`).\n\n This is the correct target for the 256-i... | [
{
"name": "exp_two_mul_boundary_loop_epilogue_of_loop_general_bounded_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 28,
"n_chars": 1363,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_struc... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | @@ -15,6 +15,58 @@
open EvmAsm.Rv64
+/-- Generalised boundary composition that accepts the full-stack loop-exit
+ pre-frame directly, with `d0..d3` as a separate parameters (not forced to
+ equal `r0..r3`).
+
+ This is the correct target for the 256-iteration loop body proof because
+ at the loop exit ... | {
"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_ee6c2195f44d_12 | 6f24f3af9ca883c6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoop.lean | SavedBitBoundaryLoop | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "exp_two_mul_boundary_loop_epilogue_of_loop_general_closed_bound_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n exp_two_mul_boundary_loop_epilogue_of_loop_general_b... | [
{
"name": "exp_two_mul_boundary_loop_epilogue_of_loop_general_bounded_spec_within",
"text": "/-- Bounded variant of\n `exp_two_mul_boundary_loop_epilogue_of_loop_general_spec_within`. -/\ntheorem exp_two_mul_boundary_loop_epilogue_of_loop_general_bounded_spec_within\n {nSteps nBound : Nat}\n (sp ev... | [
{
"name": "exp_two_mul_boundary_loop_epilogue_of_loop_general_closed_bound_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 30,
"n_chars": 1447,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | @@ -67,6 +67,33 @@
expTwoMulBoundarySuffixBound; omega)
(cpsTripleWithin_seq_same_cr hPrefix hEpilogue)
+/-- Bounded variant of
+ `exp_two_mul_boundary_loop_epilogue_of_loop_general_spec_within`. -/
+theorem exp_two_mul_boundary_loop_epilogue_of_loop_general_bounded_spec_within
+ {nSteps nBoun... | {
"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_ee6c2195f44d_13 | 3d96a80dc207b38c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoop.lean | SavedBitBoundaryLoop | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "exp_two_mul_boundary_loop_epilogue_of_loop_general_closed_bound_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n exp_two_mul_boundary_loop_epilogue_of_loop_general_b... | [
{
"name": "exp_two_mul_boundary_loop_epilogue_of_loop_general_bounded_spec_within",
"text": "/-- Bounded variant of\n `exp_two_mul_boundary_loop_epilogue_of_loop_general_spec_within`. -/\ntheorem exp_two_mul_boundary_loop_epilogue_of_loop_general_bounded_spec_within\n {nSteps nBound : Nat}\n (sp ev... | [
{
"name": "exp_two_mul_boundary_loop_epilogue_of_loop_general_exact_closed_bound_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 26,
"n_chars": 1305,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | @@ -67,6 +67,33 @@
expTwoMulBoundarySuffixBound; omega)
(cpsTripleWithin_seq_same_cr hPrefix hEpilogue)
+/-- Bounded variant of
+ `exp_two_mul_boundary_loop_epilogue_of_loop_general_spec_within`. -/
+theorem exp_two_mul_boundary_loop_epilogue_of_loop_general_bounded_spec_within
+ {nSteps nBoun... | {
"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_ee6c2195f44d_14 | 544e7e2c26c7a5ab | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoop.lean | SavedBitBoundaryLoop | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "exp_two_mul_boundary_loop_epilogue_of_loop_general_bounded_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n cpsTripleWithin_mono_nSteps hBound\n (exp_two_mul_bo... | [
{
"name": "exp_two_mul_boundary_loop_epilogue_of_loop_general_spec_within",
"text": "/-- Generalised boundary composition that accepts the full-stack loop-exit\n pre-frame directly, with `d0..d3` as a separate parameters (not forced to\n equal `r0..r3`).\n\n This is the correct target for the 256-i... | [
{
"name": "exp_two_mul_full_loop_boundary_of_body_general_spec_within",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 30,
"n_chars": 1569,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | @@ -15,6 +15,58 @@
open EvmAsm.Rv64
+/-- Generalised boundary composition that accepts the full-stack loop-exit
+ pre-frame directly, with `d0..d3` as a separate parameters (not forced to
+ equal `r0..r3`).
+
+ This is the correct target for the 256-iteration loop body proof because
+ at the loop exit ... | {
"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_ee6c2195f44d_15 | 25364d1aff5e79a5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoop.lean | SavedBitBoundaryLoop | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "exp_two_mul_full_loop_boundary_of_entry_body_general_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hEntryTriple :\n cpsTripleWithin 0 (base + 28) (base + 28)\n ... | [
{
"name": "exp_two_mul_full_loop_boundary_of_body_general_spec_within",
"text": "/-- Full-loop boundary wrapper for the generalized loop-exit pre-frame.\n\n This is the named-bound version of\n `exp_two_mul_boundary_loop_epilogue_of_loop_general_spec_within` at the\n full 256-iteration body bound. ... | [
{
"name": "exp_two_mul_full_loop_boundary_of_entry_body_general_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 53,
"n_chars": 2359,
"n_subproofs": 2,
"n_tactics": 24,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | @@ -67,6 +67,35 @@
expTwoMulBoundarySuffixBound; omega)
(cpsTripleWithin_seq_same_cr hPrefix hEpilogue)
+/-- Full-loop boundary wrapper for the generalized loop-exit pre-frame.
+
+ This is the named-bound version of
+ `exp_two_mul_boundary_loop_epilogue_of_loop_general_spec_within` at 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_ee6c2195f44d_16 | 21344cd1174c1929 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoop.lean | SavedBitBoundaryLoop | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "exp_two_mul_full_loop_boundary_of_entry_body_general_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hEntryTriple :\n cpsTripleWithin 0 (base + 28) (base + 28)\n ... | [
{
"name": "exp_two_mul_full_loop_boundary_of_body_general_spec_within",
"text": "/-- Full-loop boundary wrapper for the generalized loop-exit pre-frame.\n\n This is the named-bound version of\n `exp_two_mul_boundary_loop_epilogue_of_loop_general_spec_within` at the\n full 256-iteration body bound. ... | [
{
"name": "exp_two_mul_full_loop_boundary_of_entry_body_general_closed_bound_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 40,
"n_chars": 1740,
"n_subproofs": 1,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | @@ -67,6 +67,35 @@
expTwoMulBoundarySuffixBound; omega)
(cpsTripleWithin_seq_same_cr hPrefix hEpilogue)
+/-- Full-loop boundary wrapper for the generalized loop-exit pre-frame.
+
+ This is the named-bound version of
+ `exp_two_mul_boundary_loop_epilogue_of_loop_general_spec_within` at 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_ee6c2195f44d_17 | bbd59a7db193deba | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBoundaryLoop.lean | SavedBitBoundaryLoop | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "exp_two_mul_full_loop_boundary_of_entry_body_general_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hEntryTriple :\n cpsTripleWithin 0 (base + 28) (base + 28)\n ... | [
{
"name": "exp_two_mul_full_loop_boundary_of_body_general_spec_within",
"text": "/-- Full-loop boundary wrapper for the generalized loop-exit pre-frame.\n\n This is the named-bound version of\n `exp_two_mul_boundary_loop_epilogue_of_loop_general_spec_within` at the\n full 256-iteration body bound. ... | [
{
"name": "exp_two_mul_full_loop_boundary_of_body_general_closed_bound_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 34,
"n_chars": 1700,
"n_subproofs": 1,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_str... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBoundaryLoop
Generic composition scaffold for the two-MUL saved-bit EXP boundary:
prologue/pointer-advance, an externally supplied loop proof, and
pointer-restore/epilogue.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopExit
import EvmAsm.Evm64.Exp.Compose.SavedBitLoopBound... | @@ -67,6 +67,35 @@
expTwoMulBoundarySuffixBound; omega)
(cpsTripleWithin_seq_same_cr hPrefix hEpilogue)
+/-- Full-loop boundary wrapper for the generalized loop-exit pre-frame.
+
+ This is the named-bound version of
+ `exp_two_mul_boundary_loop_epilogue_of_loop_general_spec_within` at 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_d67864411d61_0 | c9883b816abca25d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Stateless/SpecRef/Runtime.lean | Runtime | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "mem_validJumpDestinations",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n validJDaux_mem code code.length 0 h",
"n_chars": 38,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic":... | [
{
"name": "validJDaux_mem",
"text": "/-! ## Characterization\n\nEvery position the walk records is in-bounds and holds the `JUMPDEST` opcode.\nThis is the load-bearing fact for the JUMP/JUMPI validity tail (`.55`): a\ndestination that passes the O(1) bitmap test is necessarily a `0x5b` byte at an\ninstructi... | [
{
"name": "mem_validJumpDestinations",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 21,
"n_chars": 1132,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Stateless.SpecRef.Runtime
Lean functional *reference port* of `execution-specs @ tests-zkevm@v0.4.0`
`src/ethereum/forks/amsterdam/vm/runtime.py` — the runtime helpers used
while executing EVM code. Feeder for bead `evm-asm-4ch8f.49.2`: it is the
mathematical spec anchor for the dispatcher's jumpd... | /-
EvmAsm.Stateless.SpecRef.Runtime
Lean functional *reference port* of `execution-specs @ tests-zkevm@v0.4.0`
`src/ethereum/forks/amsterdam/vm/runtime.py` — the runtime helpers used
while executing EVM code. Feeder for bead `evm-asm-4ch8f.49.2`: it is the
mathematical spec anchor for the dispatcher's jumpd... | @@ -94,10 +94,35 @@
def isValidJumpDest (code : List Byte) (idx : Nat) : Bool :=
idx ∈ validJumpDestinations code
+/-! ## Characterization
+
+Every position the walk records is in-bounds and holds the `JUMPDEST` opcode.
+This is the load-bearing fact for the JUMP/JUMPI validity tail (`.55`): a
+destination that 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_d67864411d61_1 | d1840d4cad6c60b4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Stateless/SpecRef/Runtime.lean | Runtime | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 5 | [
{
"theorem_name": "mem_walkFrom_ge",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [walkFrom_unfold] at h\n split at h\n · have hrec : ∀ y ∈ walkFrom code (s + jdAdvance code s), s ≤ y := fun y hy => ... | [
{
"name": "walkFrom_unfold",
"text": "theorem walkFrom_unfold (code : List Byte) (pc : Nat) :\n walkFrom code pc =\n if pc < code.length then\n (if (code.getD pc 0).toNat = 0x5b then pc :: walkFrom code (pc + jdAdvance code pc)\n else walkFrom code (pc + jdAdvance code pc))\n els... | [
{
"name": "mem_walkFrom_ge",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 16,
"n_chars": 595,
"n_subproofs": 3,
"n_tactics": 15,
"cyclomatic": 4,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
"max_nesti... | 1 | /-
EvmAsm.Stateless.SpecRef.Runtime
Lean functional *reference port* of `execution-specs @ tests-zkevm@v0.4.0`
`src/ethereum/forks/amsterdam/vm/runtime.py` — the runtime helpers used
while executing EVM code. Feeder for bead `evm-asm-4ch8f.49.2`: it is the
mathematical spec anchor for the dispatcher's jumpd... | /-
EvmAsm.Stateless.SpecRef.Runtime
Lean functional *reference port* of `execution-specs @ tests-zkevm@v0.4.0`
`src/ethereum/forks/amsterdam/vm/runtime.py` — the runtime helpers used
while executing EVM code. Feeder for bead `evm-asm-4ch8f.49.2`: it is the
mathematical spec anchor for the dispatcher's jumpd... | @@ -104,8 +104,27 @@
termination_by code.length - pc
decreasing_by have := jdAdvance_pos code pc; omega
+theorem walkFrom_unfold (code : List Byte) (pc : Nat) :
+ walkFrom code pc =
+ if pc < code.length then
+ (if (code.getD pc 0).toNat = 0x5b then pc :: walkFrom code (pc + jdAdvance code pc)
+ ... | {
"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_d67864411d61_2 | 3b8926194234865c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Stateless/SpecRef/Runtime.lean | Runtime | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "Reaches_zero_le",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have aux : ∀ {s t : Nat}, Reaches code s t → t ≤ s ∨ t ≤ code.length + 32 := by\n intro s t h\n induction h with\n ... | [
{
"name": "jdAdvance_le",
"text": "/-- The boundary step advances by at most 33 (a `PUSH32` opcode plus its 32\n immediates). -/\ntheorem jdAdvance_le (code : List Byte) (pc : Nat) : jdAdvance code pc ≤ 33 := by\n simp only [jdAdvance]\n repeat' split\n all_goals omega\n\n",
"fan_in": 1,
"n_li... | [
{
"name": "Reaches_zero_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 675,
"n_subproofs": 2,
"n_tactics": 12,
"cyclomatic": 5,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 7,
"automation_only": false,
"max_nesti... | 1 | /-
EvmAsm.Stateless.SpecRef.Runtime
Lean functional *reference port* of `execution-specs @ tests-zkevm@v0.4.0`
`src/ethereum/forks/amsterdam/vm/runtime.py` — the runtime helpers used
while executing EVM code. Feeder for bead `evm-asm-4ch8f.49.2`: it is the
mathematical spec anchor for the dispatcher's jumpd... | /-
EvmAsm.Stateless.SpecRef.Runtime
Lean functional *reference port* of `execution-specs @ tests-zkevm@v0.4.0`
`src/ethereum/forks/amsterdam/vm/runtime.py` — the runtime helpers used
while executing EVM code. Feeder for bead `evm-asm-4ch8f.49.2`: it is the
mathematical spec anchor for the dispatcher's jumpd... | @@ -110,11 +110,28 @@
| step (s t : Nat) (h : s < code.length) (hr : Reaches code (s + jdAdvance code s) t) :
Reaches code s t
+/-- The boundary step advances by at most 33 (a `PUSH32` opcode plus its 32
+ immediates). -/
+theorem jdAdvance_le (code : List Byte) (pc : Nat) : jdAdvance code pc ≤ 33 := 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_d67864411d61_3 | db057712b469b8ae | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Stateless/SpecRef/Runtime.lean | Runtime | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 5 | [
{
"theorem_name": "mem_walkFrom_ge",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [walkFrom_unfold] at h\n split at h\n · have hrec : ∀ y ∈ walkFrom code (s + jdAdvance code s), s ≤ y := fun y hy => ... | [
{
"name": "walkFrom_unfold",
"text": "theorem walkFrom_unfold (code : List Byte) (pc : Nat) :\n walkFrom code pc =\n if pc < code.length then\n (if (code.getD pc 0).toNat = 0x5b then pc :: walkFrom code (pc + jdAdvance code pc)\n else walkFrom code (pc + jdAdvance code pc))\n els... | [
{
"name": "splitWalk",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 753,
"n_subproofs": 3,
"n_tactics": 16,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 7,
"automation_only": false,
"max_nesting": 8... | 1 | /-
EvmAsm.Stateless.SpecRef.Runtime
Lean functional *reference port* of `execution-specs @ tests-zkevm@v0.4.0`
`src/ethereum/forks/amsterdam/vm/runtime.py` — the runtime helpers used
while executing EVM code. Feeder for bead `evm-asm-4ch8f.49.2`: it is the
mathematical spec anchor for the dispatcher's jumpd... | /-
EvmAsm.Stateless.SpecRef.Runtime
Lean functional *reference port* of `execution-specs @ tests-zkevm@v0.4.0`
`src/ethereum/forks/amsterdam/vm/runtime.py` — the runtime helpers used
while executing EVM code. Feeder for bead `evm-asm-4ch8f.49.2`: it is the
mathematical spec anchor for the dispatcher's jumpd... | @@ -104,6 +104,13 @@
termination_by code.length - pc
decreasing_by have := jdAdvance_pos code pc; omega
+theorem walkFrom_unfold (code : List Byte) (pc : Nat) :
+ walkFrom code pc =
+ if pc < code.length then
+ (if (code.getD pc 0).toNat = 0x5b then pc :: walkFrom code (pc + jdAdvance code pc)
+ ... | {
"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_d67864411d61_4 | aea27c81080ee332 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Stateless/SpecRef/Runtime.lean | Runtime | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 5 | [
{
"theorem_name": "mem_walkFrom_ge",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [walkFrom_unfold] at h\n split at h\n · have hrec : ∀ y ∈ walkFrom code (s + jdAdvance code s), s ≤ y := fun y hy => ... | [
{
"name": "walkFrom_unfold",
"text": "theorem walkFrom_unfold (code : List Byte) (pc : Nat) :\n walkFrom code pc =\n if pc < code.length then\n (if (code.getD pc 0).toNat = 0x5b then pc :: walkFrom code (pc + jdAdvance code pc)\n else walkFrom code (pc + jdAdvance code pc))\n els... | [
{
"name": "walkFrom_subset",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 430,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 5,
"automation_only": false,
"max_nestin... | 1 | /-
EvmAsm.Stateless.SpecRef.Runtime
Lean functional *reference port* of `execution-specs @ tests-zkevm@v0.4.0`
`src/ethereum/forks/amsterdam/vm/runtime.py` — the runtime helpers used
while executing EVM code. Feeder for bead `evm-asm-4ch8f.49.2`: it is the
mathematical spec anchor for the dispatcher's jumpd... | /-
EvmAsm.Stateless.SpecRef.Runtime
Lean functional *reference port* of `execution-specs @ tests-zkevm@v0.4.0`
`src/ethereum/forks/amsterdam/vm/runtime.py` — the runtime helpers used
while executing EVM code. Feeder for bead `evm-asm-4ch8f.49.2`: it is the
mathematical spec anchor for the dispatcher's jumpd... | @@ -104,6 +104,13 @@
termination_by code.length - pc
decreasing_by have := jdAdvance_pos code pc; omega
+theorem walkFrom_unfold (code : List Byte) (pc : Nat) :
+ walkFrom code pc =
+ if pc < code.length then
+ (if (code.getD pc 0).toNat = 0x5b then pc :: walkFrom code (pc + jdAdvance code pc)
+ ... | {
"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_d67864411d61_5 | aeca9ba9ba7711eb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Stateless/SpecRef/Runtime.lean | Runtime | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 5 | [
{
"theorem_name": "mem_walkFrom_ge",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [walkFrom_unfold] at h\n split at h\n · have hrec : ∀ y ∈ walkFrom code (s + jdAdvance code s), s ≤ y := fun y hy => ... | [
{
"name": "walkFrom_unfold",
"text": "theorem walkFrom_unfold (code : List Byte) (pc : Nat) :\n walkFrom code pc =\n if pc < code.length then\n (if (code.getD pc 0).toNat = 0x5b then pc :: walkFrom code (pc + jdAdvance code pc)\n else walkFrom code (pc + jdAdvance code pc))\n els... | [
{
"name": "validJDaux_eq_walkFrom",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 530,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 3,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"max... | 1 | /-
EvmAsm.Stateless.SpecRef.Runtime
Lean functional *reference port* of `execution-specs @ tests-zkevm@v0.4.0`
`src/ethereum/forks/amsterdam/vm/runtime.py` — the runtime helpers used
while executing EVM code. Feeder for bead `evm-asm-4ch8f.49.2`: it is the
mathematical spec anchor for the dispatcher's jumpd... | /-
EvmAsm.Stateless.SpecRef.Runtime
Lean functional *reference port* of `execution-specs @ tests-zkevm@v0.4.0`
`src/ethereum/forks/amsterdam/vm/runtime.py` — the runtime helpers used
while executing EVM code. Feeder for bead `evm-asm-4ch8f.49.2`: it is the
mathematical spec anchor for the dispatcher's jumpd... | @@ -104,6 +104,13 @@
termination_by code.length - pc
decreasing_by have := jdAdvance_pos code pc; omega
+theorem walkFrom_unfold (code : List Byte) (pc : Nat) :
+ walkFrom code pc =
+ if pc < code.length then
+ (if (code.getD pc 0).toNat = 0x5b then pc :: walkFrom code (pc + jdAdvance code pc)
+ ... | {
"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_d67864411d61_6 | 06ac8868e419f6fd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Stateless/SpecRef/Runtime.lean | Runtime | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 5 | [
{
"theorem_name": "mem_walkFrom_ge",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [walkFrom_unfold] at h\n split at h\n · have hrec : ∀ y ∈ walkFrom code (s + jdAdvance code s), s ≤ y := fun y hy => ... | [
{
"name": "walkFrom_unfold",
"text": "theorem walkFrom_unfold (code : List Byte) (pc : Nat) :\n walkFrom code pc =\n if pc < code.length then\n (if (code.getD pc 0).toNat = 0x5b then pc :: walkFrom code (pc + jdAdvance code pc)\n else walkFrom code (pc + jdAdvance code pc))\n els... | [
{
"name": "walkFrom_zero_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 6,
"n_chars": 238,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nestin... | 2 | /-
EvmAsm.Stateless.SpecRef.Runtime
Lean functional *reference port* of `execution-specs @ tests-zkevm@v0.4.0`
`src/ethereum/forks/amsterdam/vm/runtime.py` — the runtime helpers used
while executing EVM code. Feeder for bead `evm-asm-4ch8f.49.2`: it is the
mathematical spec anchor for the dispatcher's jumpd... | /-
EvmAsm.Stateless.SpecRef.Runtime
Lean functional *reference port* of `execution-specs @ tests-zkevm@v0.4.0`
`src/ethereum/forks/amsterdam/vm/runtime.py` — the runtime helpers used
while executing EVM code. Feeder for bead `evm-asm-4ch8f.49.2`: it is the
mathematical spec anchor for the dispatcher's jumpd... | @@ -104,6 +104,13 @@
termination_by code.length - pc
decreasing_by have := jdAdvance_pos code pc; omega
+theorem walkFrom_unfold (code : List Byte) (pc : Nat) :
+ walkFrom code pc =
+ if pc < code.length then
+ (if (code.getD pc 0).toNat = 0x5b then pc :: walkFrom code (pc + jdAdvance code pc)
+ ... | {
"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_d67864411d61_7 | 82f844204fc7497e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Stateless/SpecRef/Runtime.lean | Runtime | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 5 | [
{
"theorem_name": "mem_walkFrom_ge",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [walkFrom_unfold] at h\n split at h\n · have hrec : ∀ y ∈ walkFrom code (s + jdAdvance code s), s ≤ y := fun y hy => ... | [
{
"name": "walkFrom_unfold",
"text": "theorem walkFrom_unfold (code : List Byte) (pc : Nat) :\n walkFrom code pc =\n if pc < code.length then\n (if (code.getD pc 0).toNat = 0x5b then pc :: walkFrom code (pc + jdAdvance code pc)\n else walkFrom code (pc + jdAdvance code pc))\n els... | [
{
"name": "vjd_lt_step",
"fan_in": 0,
"n_deps_direct": 6,
"n_deps_transitive": 7,
"n_lines": 29,
"n_chars": 1390,
"n_subproofs": 2,
"n_tactics": 20,
"cyclomatic": 7,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 12,
"automation_only": false,
"max_nesting... | 6 | /-
EvmAsm.Stateless.SpecRef.Runtime
Lean functional *reference port* of `execution-specs @ tests-zkevm@v0.4.0`
`src/ethereum/forks/amsterdam/vm/runtime.py` — the runtime helpers used
while executing EVM code. Feeder for bead `evm-asm-4ch8f.49.2`: it is the
mathematical spec anchor for the dispatcher's jumpd... | /-
EvmAsm.Stateless.SpecRef.Runtime
Lean functional *reference port* of `execution-specs @ tests-zkevm@v0.4.0`
`src/ethereum/forks/amsterdam/vm/runtime.py` — the runtime helpers used
while executing EVM code. Feeder for bead `evm-asm-4ch8f.49.2`: it is the
mathematical spec anchor for the dispatcher's jumpd... | @@ -104,8 +104,27 @@
termination_by code.length - pc
decreasing_by have := jdAdvance_pos code pc; omega
+theorem walkFrom_unfold (code : List Byte) (pc : Nat) :
+ walkFrom code pc =
+ if pc < code.length then
+ (if (code.getD pc 0).toNat = 0x5b then pc :: walkFrom code (pc + jdAdvance code pc)
+ ... | {
"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_b98f0212dc19_0 | 520d57c39babe562 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/DivCallAbsComponents.lean | DivCallAbsComponents | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 5 | [
{
"theorem_name": "sdivAbsDividendWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sdivAbsDividendWord_eq_components, EvmWord.getLimbN_lt _ 0 (by decide)]\n exact EvmWord.getLimb_fromLim... | [
{
"name": "sdivAbsDividendWord_eq_components",
"text": "theorem sdivAbsDividendWord_eq_components\n (limb0 limb1 limb2 top : Word) :\n sdivAbsDividendWord limb0 limb1 limb2 top =\n EvmWord.fromLimbs fun i : Fin 4 =>\n match i with\n | 0 => sdivAbsSum0 limb0 top\n | 1 => sdivA... | [
{
"name": "sdivAbsDividendWord_getLimbN_0",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 284,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.SDiv.Compose.DivCallAbsComponents
Shared signed-absolute-value component abbreviations for SDIV div-call
handoff proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallResultSignFix
namespace EvmAsm.Evm64.SDiv.Compose
abbrev sdivAbsSign (top : Word) : Word :=
top >>> (63 : BitVec 6).toNat
abbre... | /-
EvmAsm.Evm64.SDiv.Compose.DivCallAbsComponents
Shared signed-absolute-value component abbreviations for SDIV div-call
handoff proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallResultSignFix
namespace EvmAsm.Evm64.SDiv.Compose
abbrev sdivAbsSign (top : Word) : Word :=
top >>> (63 : BitVec 6).toNat
abbre... | @@ -50,6 +50,17 @@
else
0
+theorem sdivAbsDividendWord_eq_components
+ (limb0 limb1 limb2 top : Word) :
+ sdivAbsDividendWord limb0 limb1 limb2 top =
+ EvmWord.fromLimbs fun i : Fin 4 =>
+ match i with
+ | 0 => sdivAbsSum0 limb0 top
+ | 1 => sdivAbsSum1 limb0 limb1 top
+ ... | {
"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_b98f0212dc19_1 | f774e75a200f6a01 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/DivCallAbsComponents.lean | DivCallAbsComponents | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 5 | [
{
"theorem_name": "sdivAbsDividendWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sdivAbsDividendWord_eq_components, EvmWord.getLimbN_lt _ 0 (by decide)]\n exact EvmWord.getLimb_fromLim... | [
{
"name": "sdivAbsDividendWord_eq_components",
"text": "theorem sdivAbsDividendWord_eq_components\n (limb0 limb1 limb2 top : Word) :\n sdivAbsDividendWord limb0 limb1 limb2 top =\n EvmWord.fromLimbs fun i : Fin 4 =>\n match i with\n | 0 => sdivAbsSum0 limb0 top\n | 1 => sdivA... | [
{
"name": "sdivAbsDividendWord_getLimbN_1",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 290,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.SDiv.Compose.DivCallAbsComponents
Shared signed-absolute-value component abbreviations for SDIV div-call
handoff proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallResultSignFix
namespace EvmAsm.Evm64.SDiv.Compose
abbrev sdivAbsSign (top : Word) : Word :=
top >>> (63 : BitVec 6).toNat
abbre... | /-
EvmAsm.Evm64.SDiv.Compose.DivCallAbsComponents
Shared signed-absolute-value component abbreviations for SDIV div-call
handoff proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallResultSignFix
namespace EvmAsm.Evm64.SDiv.Compose
abbrev sdivAbsSign (top : Word) : Word :=
top >>> (63 : BitVec 6).toNat
abbre... | @@ -50,6 +50,17 @@
else
0
+theorem sdivAbsDividendWord_eq_components
+ (limb0 limb1 limb2 top : Word) :
+ sdivAbsDividendWord limb0 limb1 limb2 top =
+ EvmWord.fromLimbs fun i : Fin 4 =>
+ match i with
+ | 0 => sdivAbsSum0 limb0 top
+ | 1 => sdivAbsSum1 limb0 limb1 top
+ ... | {
"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_b98f0212dc19_2 | 001914974830def8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/DivCallAbsComponents.lean | DivCallAbsComponents | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 5 | [
{
"theorem_name": "sdivAbsDividendWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sdivAbsDividendWord_eq_components, EvmWord.getLimbN_lt _ 0 (by decide)]\n exact EvmWord.getLimb_fromLim... | [
{
"name": "sdivAbsDividendWord_eq_components",
"text": "theorem sdivAbsDividendWord_eq_components\n (limb0 limb1 limb2 top : Word) :\n sdivAbsDividendWord limb0 limb1 limb2 top =\n EvmWord.fromLimbs fun i : Fin 4 =>\n match i with\n | 0 => sdivAbsSum0 limb0 top\n | 1 => sdivA... | [
{
"name": "sdivAbsDividendWord_getLimbN_2",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 296,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.SDiv.Compose.DivCallAbsComponents
Shared signed-absolute-value component abbreviations for SDIV div-call
handoff proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallResultSignFix
namespace EvmAsm.Evm64.SDiv.Compose
abbrev sdivAbsSign (top : Word) : Word :=
top >>> (63 : BitVec 6).toNat
abbre... | /-
EvmAsm.Evm64.SDiv.Compose.DivCallAbsComponents
Shared signed-absolute-value component abbreviations for SDIV div-call
handoff proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallResultSignFix
namespace EvmAsm.Evm64.SDiv.Compose
abbrev sdivAbsSign (top : Word) : Word :=
top >>> (63 : BitVec 6).toNat
abbre... | @@ -50,6 +50,17 @@
else
0
+theorem sdivAbsDividendWord_eq_components
+ (limb0 limb1 limb2 top : Word) :
+ sdivAbsDividendWord limb0 limb1 limb2 top =
+ EvmWord.fromLimbs fun i : Fin 4 =>
+ match i with
+ | 0 => sdivAbsSum0 limb0 top
+ | 1 => sdivAbsSum1 limb0 limb1 top
+ ... | {
"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_b98f0212dc19_3 | 1f2a87c257d04ec1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/DivCallAbsComponents.lean | DivCallAbsComponents | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 5 | [
{
"theorem_name": "sdivAbsDividendWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sdivAbsDividendWord_eq_components, EvmWord.getLimbN_lt _ 0 (by decide)]\n exact EvmWord.getLimb_fromLim... | [
{
"name": "sdivAbsDividendWord_eq_components",
"text": "theorem sdivAbsDividendWord_eq_components\n (limb0 limb1 limb2 top : Word) :\n sdivAbsDividendWord limb0 limb1 limb2 top =\n EvmWord.fromLimbs fun i : Fin 4 =>\n match i with\n | 0 => sdivAbsSum0 limb0 top\n | 1 => sdivA... | [
{
"name": "sdivAbsDividendWord_getLimbN_3",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 296,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.SDiv.Compose.DivCallAbsComponents
Shared signed-absolute-value component abbreviations for SDIV div-call
handoff proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallResultSignFix
namespace EvmAsm.Evm64.SDiv.Compose
abbrev sdivAbsSign (top : Word) : Word :=
top >>> (63 : BitVec 6).toNat
abbre... | /-
EvmAsm.Evm64.SDiv.Compose.DivCallAbsComponents
Shared signed-absolute-value component abbreviations for SDIV div-call
handoff proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallResultSignFix
namespace EvmAsm.Evm64.SDiv.Compose
abbrev sdivAbsSign (top : Word) : Word :=
top >>> (63 : BitVec 6).toNat
abbre... | @@ -50,6 +50,17 @@
else
0
+theorem sdivAbsDividendWord_eq_components
+ (limb0 limb1 limb2 top : Word) :
+ sdivAbsDividendWord limb0 limb1 limb2 top =
+ EvmWord.fromLimbs fun i : Fin 4 =>
+ match i with
+ | 0 => sdivAbsSum0 limb0 top
+ | 1 => sdivAbsSum1 limb0 limb1 top
+ ... | {
"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_b98f0212dc19_4 | abfb4949c13437e8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/DivCallAbsComponents.lean | DivCallAbsComponents | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 5 | [
{
"theorem_name": "sdivAbsDivisorWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sdivAbsDivisorWord_eq_components, EvmWord.getLimbN_lt _ 0 (by decide)]\n exact EvmWord.getLimb_fromLimbs... | [
{
"name": "sdivAbsDivisorWord_eq_components",
"text": "theorem sdivAbsDivisorWord_eq_components\n (limb0 limb1 limb2 top : Word) :\n sdivAbsDivisorWord limb0 limb1 limb2 top =\n EvmWord.fromLimbs fun i : Fin 4 =>\n match i with\n | 0 => sdivAbsSum0 limb0 top\n | 1 => sdivAbsS... | [
{
"name": "sdivAbsDivisorWord_getLimbN_0",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 281,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.SDiv.Compose.DivCallAbsComponents
Shared signed-absolute-value component abbreviations for SDIV div-call
handoff proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallResultSignFix
namespace EvmAsm.Evm64.SDiv.Compose
abbrev sdivAbsSign (top : Word) : Word :=
top >>> (63 : BitVec 6).toNat
abbre... | /-
EvmAsm.Evm64.SDiv.Compose.DivCallAbsComponents
Shared signed-absolute-value component abbreviations for SDIV div-call
handoff proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallResultSignFix
namespace EvmAsm.Evm64.SDiv.Compose
abbrev sdivAbsSign (top : Word) : Word :=
top >>> (63 : BitVec 6).toNat
abbre... | @@ -61,10 +61,23 @@
| 3 => sdivAbsSum3 limb0 limb1 limb2 top := by
rfl
+theorem sdivAbsDivisorWord_eq_components
+ (limb0 limb1 limb2 top : Word) :
+ sdivAbsDivisorWord limb0 limb1 limb2 top =
+ EvmWord.fromLimbs fun i : Fin 4 =>
+ match i with
+ | 0 => sdivAbsSum0 limb0 top
+ ... | {
"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_b98f0212dc19_5 | 0a59c01ec463a36f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/DivCallAbsComponents.lean | DivCallAbsComponents | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 5 | [
{
"theorem_name": "sdivAbsDivisorWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sdivAbsDivisorWord_eq_components, EvmWord.getLimbN_lt _ 0 (by decide)]\n exact EvmWord.getLimb_fromLimbs... | [
{
"name": "sdivAbsDivisorWord_eq_components",
"text": "theorem sdivAbsDivisorWord_eq_components\n (limb0 limb1 limb2 top : Word) :\n sdivAbsDivisorWord limb0 limb1 limb2 top =\n EvmWord.fromLimbs fun i : Fin 4 =>\n match i with\n | 0 => sdivAbsSum0 limb0 top\n | 1 => sdivAbsS... | [
{
"name": "sdivAbsDivisorWord_getLimbN_1",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 287,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.SDiv.Compose.DivCallAbsComponents
Shared signed-absolute-value component abbreviations for SDIV div-call
handoff proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallResultSignFix
namespace EvmAsm.Evm64.SDiv.Compose
abbrev sdivAbsSign (top : Word) : Word :=
top >>> (63 : BitVec 6).toNat
abbre... | /-
EvmAsm.Evm64.SDiv.Compose.DivCallAbsComponents
Shared signed-absolute-value component abbreviations for SDIV div-call
handoff proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallResultSignFix
namespace EvmAsm.Evm64.SDiv.Compose
abbrev sdivAbsSign (top : Word) : Word :=
top >>> (63 : BitVec 6).toNat
abbre... | @@ -61,10 +61,23 @@
| 3 => sdivAbsSum3 limb0 limb1 limb2 top := by
rfl
+theorem sdivAbsDivisorWord_eq_components
+ (limb0 limb1 limb2 top : Word) :
+ sdivAbsDivisorWord limb0 limb1 limb2 top =
+ EvmWord.fromLimbs fun i : Fin 4 =>
+ match i with
+ | 0 => sdivAbsSum0 limb0 top
+ ... | {
"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_b98f0212dc19_6 | 4c35b4bc62225274 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/DivCallAbsComponents.lean | DivCallAbsComponents | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 5 | [
{
"theorem_name": "sdivAbsDivisorWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sdivAbsDivisorWord_eq_components, EvmWord.getLimbN_lt _ 0 (by decide)]\n exact EvmWord.getLimb_fromLimbs... | [
{
"name": "sdivAbsDivisorWord_eq_components",
"text": "theorem sdivAbsDivisorWord_eq_components\n (limb0 limb1 limb2 top : Word) :\n sdivAbsDivisorWord limb0 limb1 limb2 top =\n EvmWord.fromLimbs fun i : Fin 4 =>\n match i with\n | 0 => sdivAbsSum0 limb0 top\n | 1 => sdivAbsS... | [
{
"name": "sdivAbsDivisorWord_getLimbN_2",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 293,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.SDiv.Compose.DivCallAbsComponents
Shared signed-absolute-value component abbreviations for SDIV div-call
handoff proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallResultSignFix
namespace EvmAsm.Evm64.SDiv.Compose
abbrev sdivAbsSign (top : Word) : Word :=
top >>> (63 : BitVec 6).toNat
abbre... | /-
EvmAsm.Evm64.SDiv.Compose.DivCallAbsComponents
Shared signed-absolute-value component abbreviations for SDIV div-call
handoff proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallResultSignFix
namespace EvmAsm.Evm64.SDiv.Compose
abbrev sdivAbsSign (top : Word) : Word :=
top >>> (63 : BitVec 6).toNat
abbre... | @@ -61,10 +61,23 @@
| 3 => sdivAbsSum3 limb0 limb1 limb2 top := by
rfl
+theorem sdivAbsDivisorWord_eq_components
+ (limb0 limb1 limb2 top : Word) :
+ sdivAbsDivisorWord limb0 limb1 limb2 top =
+ EvmWord.fromLimbs fun i : Fin 4 =>
+ match i with
+ | 0 => sdivAbsSum0 limb0 top
+ ... | {
"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_b98f0212dc19_7 | 40b80fbe3f077e2a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/DivCallAbsComponents.lean | DivCallAbsComponents | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 5 | [
{
"theorem_name": "sdivAbsDivisorWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sdivAbsDivisorWord_eq_components, EvmWord.getLimbN_lt _ 0 (by decide)]\n exact EvmWord.getLimb_fromLimbs... | [
{
"name": "sdivAbsDivisorWord_eq_components",
"text": "theorem sdivAbsDivisorWord_eq_components\n (limb0 limb1 limb2 top : Word) :\n sdivAbsDivisorWord limb0 limb1 limb2 top =\n EvmWord.fromLimbs fun i : Fin 4 =>\n match i with\n | 0 => sdivAbsSum0 limb0 top\n | 1 => sdivAbsS... | [
{
"name": "sdivAbsDivisorWord_getLimbN_3",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 293,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.SDiv.Compose.DivCallAbsComponents
Shared signed-absolute-value component abbreviations for SDIV div-call
handoff proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallResultSignFix
namespace EvmAsm.Evm64.SDiv.Compose
abbrev sdivAbsSign (top : Word) : Word :=
top >>> (63 : BitVec 6).toNat
abbre... | /-
EvmAsm.Evm64.SDiv.Compose.DivCallAbsComponents
Shared signed-absolute-value component abbreviations for SDIV div-call
handoff proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallResultSignFix
namespace EvmAsm.Evm64.SDiv.Compose
abbrev sdivAbsSign (top : Word) : Word :=
top >>> (63 : BitVec 6).toNat
abbre... | @@ -61,10 +61,23 @@
| 3 => sdivAbsSum3 limb0 limb1 limb2 top := by
rfl
+theorem sdivAbsDivisorWord_eq_components
+ (limb0 limb1 limb2 top : Word) :
+ sdivAbsDivisorWord limb0 limb1 limb2 top =
+ EvmWord.fromLimbs fun i : Fin 4 =>
+ match i with
+ | 0 => sdivAbsSum0 limb0 top
+ ... | {
"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_b98f0212dc19_8 | d75e34dafde966a0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/DivCallAbsComponents.lean | DivCallAbsComponents | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 5 | [
{
"theorem_name": "sdivAbsDividendWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sdivAbsDividendWord_eq_components, EvmWord.getLimbN_lt _ 0 (by decide)]\n exact EvmWord.getLimb_fromLim... | [
{
"name": "sdivAbsDividendWord_eq_components",
"text": "theorem sdivAbsDividendWord_eq_components\n (limb0 limb1 limb2 top : Word) :\n sdivAbsDividendWord limb0 limb1 limb2 top =\n EvmWord.fromLimbs fun i : Fin 4 =>\n match i with\n | 0 => sdivAbsSum0 limb0 top\n | 1 => sdivA... | [
{
"name": "sdivAbsDividendWord_evmWordIs_sp_components",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 602,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_o... | 1 | /-
EvmAsm.Evm64.SDiv.Compose.DivCallAbsComponents
Shared signed-absolute-value component abbreviations for SDIV div-call
handoff proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallResultSignFix
namespace EvmAsm.Evm64.SDiv.Compose
abbrev sdivAbsSign (top : Word) : Word :=
top >>> (63 : BitVec 6).toNat
abbre... | /-
EvmAsm.Evm64.SDiv.Compose.DivCallAbsComponents
Shared signed-absolute-value component abbreviations for SDIV div-call
handoff proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallResultSignFix
namespace EvmAsm.Evm64.SDiv.Compose
abbrev sdivAbsSign (top : Word) : Word :=
top >>> (63 : BitVec 6).toNat
abbre... | @@ -50,6 +50,17 @@
else
0
+theorem sdivAbsDividendWord_eq_components
+ (limb0 limb1 limb2 top : Word) :
+ sdivAbsDividendWord limb0 limb1 limb2 top =
+ EvmWord.fromLimbs fun i : Fin 4 =>
+ match i with
+ | 0 => sdivAbsSum0 limb0 top
+ | 1 => sdivAbsSum1 limb0 limb1 top
+ ... | {
"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_b98f0212dc19_9 | 596c8a9bd22a6725 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/DivCallAbsComponents.lean | DivCallAbsComponents | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 5 | [
{
"theorem_name": "sdivAbsDivisorWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sdivAbsDivisorWord_eq_components, EvmWord.getLimbN_lt _ 0 (by decide)]\n exact EvmWord.getLimb_fromLimbs... | [
{
"name": "sdivAbsDivisorWord_eq_components",
"text": "theorem sdivAbsDivisorWord_eq_components\n (limb0 limb1 limb2 top : Word) :\n sdivAbsDivisorWord limb0 limb1 limb2 top =\n EvmWord.fromLimbs fun i : Fin 4 =>\n match i with\n | 0 => sdivAbsSum0 limb0 top\n | 1 => sdivAbsS... | [
{
"name": "sdivAbsDivisorWord_evmWordIs_sp32_components",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 618,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_... | 1 | /-
EvmAsm.Evm64.SDiv.Compose.DivCallAbsComponents
Shared signed-absolute-value component abbreviations for SDIV div-call
handoff proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallResultSignFix
namespace EvmAsm.Evm64.SDiv.Compose
abbrev sdivAbsSign (top : Word) : Word :=
top >>> (63 : BitVec 6).toNat
abbre... | /-
EvmAsm.Evm64.SDiv.Compose.DivCallAbsComponents
Shared signed-absolute-value component abbreviations for SDIV div-call
handoff proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallResultSignFix
namespace EvmAsm.Evm64.SDiv.Compose
abbrev sdivAbsSign (top : Word) : Word :=
top >>> (63 : BitVec 6).toNat
abbre... | @@ -61,6 +61,17 @@
| 3 => sdivAbsSum3 limb0 limb1 limb2 top := by
rfl
+theorem sdivAbsDivisorWord_eq_components
+ (limb0 limb1 limb2 top : Word) :
+ sdivAbsDivisorWord limb0 limb1 limb2 top =
+ EvmWord.fromLimbs fun i : Fin 4 =>
+ match i with
+ | 0 => sdivAbsSum0 limb0 top
+ ... | {
"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_d2364a6842d3_0 | 4d2a4bc524103bbd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254FieldConvSAsm.lean | Bn254FieldConvSAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "beBytesToNat_append",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold beBytesToNat\n rw [List.foldl_append, foldl_be' b]",
"n_chars": 63,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "foldl_be'",
"text": "/-- Generalized-accumulator unfolding of the `beBytesToNat` foldl (local\n copy of the private `PowLadder.foldl_be`). -/\nprivate theorem foldl_be' (bs : List (BitVec 8)) (acc : Nat) :\n List.foldl (fun a (b : BitVec 8) => a * 256 + b.toNat) acc bs\n = acc * 256 ^ ... | [
{
"name": "beBytesToNat_append",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 309,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_nes... | 1 | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsm
Verified SAsm port of the bn254 BE↔LE field-element converters
(bead evm-asm-4ch8f.38.2 wave-3, clone of the merged `secfBeToLe`
template #9848 — the two `_prog`s are byte-identical, so this is an
exact byte-tie, spec-only, no EEST):
- `bnfBeToLe` (`bnfBeToLe_... | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsm
Verified SAsm port of the bn254 BE↔LE field-element converters
(bead evm-asm-4ch8f.38.2 wave-3, clone of the merged `secfBeToLe`
template #9848 — the two `_prog`s are byte-identical, so this is an
exact byte-tie, spec-only, no EEST):
- `bnfBeToLe` (`bnfBeToLe_... | @@ -162,10 +162,28 @@
A = empAssertion
body := bnfBeToLeBody src dst inBytes
+/-- Generalized-accumulator unfolding of the `beBytesToNat` foldl (local
+ copy of the private `PowLadder.foldl_be`). -/
+private theorem foldl_be' (bs : List (BitVec 8)) (acc : Nat) :
+ List.foldl (fun a (b : BitVec 8) => 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_d2364a6842d3_1 | a2a6bebc7779b010 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254FieldConvSAsm.lean | Bn254FieldConvSAsm | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 2 | [
{
"theorem_name": "beBytesToNat_take_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [List.take_add_one, List.getElem?_eq_getElem hn, Option.toList_some,\n beBytesToNat_append]\n simp [beBytesTo... | [
{
"name": "beBytesToNat_append",
"text": "/-- Big-endian value of a concatenation: the high part is shifted by the low\n part's byte width. -/\nprivate theorem beBytesToNat_append (a b : List (BitVec 8)) :\n beBytesToNat (a ++ b) = beBytesToNat a * 256 ^ b.length + beBytesToNat b := by\n unfold beByt... | [
{
"name": "beBytesToNat_take_succ",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 437,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max... | 2 | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsm
Verified SAsm port of the bn254 BE↔LE field-element converters
(bead evm-asm-4ch8f.38.2 wave-3, clone of the merged `secfBeToLe`
template #9848 — the two `_prog`s are byte-identical, so this is an
exact byte-tie, spec-only, no EEST):
- `bnfBeToLe` (`bnfBeToLe_... | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsm
Verified SAsm port of the bn254 BE↔LE field-element converters
(bead evm-asm-4ch8f.38.2 wave-3, clone of the merged `secfBeToLe`
template #9848 — the two `_prog`s are byte-identical, so this is an
exact byte-tie, spec-only, no EEST):
- `bnfBeToLe` (`bnfBeToLe_... | @@ -178,11 +178,21 @@
simp only [Nat.zero_mul, Nat.zero_add, Nat.add_mul]
omega
+/-- Big-endian value of a concatenation: the high part is shifted by the low
+ part's byte width. -/
+private theorem beBytesToNat_append (a b : List (BitVec 8)) :
+ beBytesToNat (a ++ b) = beBytesToNat a * 256 ^ b.length... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_d2364a6842d3_2 | 68ea3b99b47aa411 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254FieldConvSAsm.lean | Bn254FieldConvSAsm | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "shiftOr_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hb : b.toNat < 256 := b.isLt\n have hze : (b.zeroExtend 64).toNat = b.toNat := by have := b.isLt; simp; omega\n apply Bi... | [
{
"name": "mul_pow_lor",
"text": "/-- A shifted value or-ed with a small byte is their sum (disjoint bits). -/\nprivate theorem mul_pow_lor (v : Nat) (b : Nat) (hb : b < 2 ^ 8) :\n v * 2 ^ 8 ||| b = v * 2 ^ 8 + b := by\n have key : v * 2 ^ 8 ||| b = 2 ^ 8 * v + b := by\n apply Nat.eq_of_testBit_eq\n ... | [
{
"name": "shiftOr_eq",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 756,
"n_subproofs": 3,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": ... | 1 | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsm
Verified SAsm port of the bn254 BE↔LE field-element converters
(bead evm-asm-4ch8f.38.2 wave-3, clone of the merged `secfBeToLe`
template #9848 — the two `_prog`s are byte-identical, so this is an
exact byte-tie, spec-only, no EEST):
- `bnfBeToLe` (`bnfBeToLe_... | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsm
Verified SAsm port of the bn254 BE↔LE field-element converters
(bead evm-asm-4ch8f.38.2 wave-3, clone of the merged `secfBeToLe`
template #9848 — the two `_prog`s are byte-identical, so this is an
exact byte-tie, spec-only, no EEST):
- `bnfBeToLe` (`bnfBeToLe_... | @@ -162,11 +162,34 @@
A = empAssertion
body := bnfBeToLeBody src dst inBytes
+/-- A shifted value or-ed with a small byte is their sum (disjoint bits). -/
+private theorem mul_pow_lor (v : Nat) (b : Nat) (hb : b < 2 ^ 8) :
+ v * 2 ^ 8 ||| b = v * 2 ^ 8 + b := by
+ have key : v * 2 ^ 8 ||| b = 2 ^ 8 * v + ... | {
"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_d2364a6842d3_3 | deb56ebcded2c7b6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254FieldConvSAsm.lean | Bn254FieldConvSAsm | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 2 | [
{
"theorem_name": "beBytesToNat_take_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [List.take_add_one, List.getElem?_eq_getElem hn, Option.toList_some,\n beBytesToNat_append]\n simp [beBytesTo... | [
{
"name": "beBytesToNat_append",
"text": "/-- Big-endian value of a concatenation: the high part is shifted by the low\n part's byte width. -/\nprivate theorem beBytesToNat_append (a b : List (BitVec 8)) :\n beBytesToNat (a ++ b) = beBytesToNat a * 256 ^ b.length + beBytesToNat b := by\n unfold beByt... | [
{
"name": "leLimbs_chunks_eq_beBytesToNat",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 53,
"n_chars": 2851,
"n_subproofs": 13,
"n_tactics": 39,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 16,
"n_structural": 0,
"automation_only": fal... | 3 | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsm
Verified SAsm port of the bn254 BE↔LE field-element converters
(bead evm-asm-4ch8f.38.2 wave-3, clone of the merged `secfBeToLe`
template #9848 — the two `_prog`s are byte-identical, so this is an
exact byte-tie, spec-only, no EEST):
- `bnfBeToLe` (`bnfBeToLe_... | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsm
Verified SAsm port of the bn254 BE↔LE field-element converters
(bead evm-asm-4ch8f.38.2 wave-3, clone of the merged `secfBeToLe`
template #9848 — the two `_prog`s are byte-identical, so this is an
exact byte-tie, spec-only, no EEST):
- `bnfBeToLe` (`bnfBeToLe_... | @@ -178,6 +178,13 @@
simp only [Nat.zero_mul, Nat.zero_add, Nat.add_mul]
omega
+/-- Big-endian value of a concatenation: the high part is shifted by the low
+ part's byte width. -/
+private theorem beBytesToNat_append (a b : List (BitVec 8)) :
+ beBytesToNat (a ++ b) = beBytesToNat a * 256 ^ b.length ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_d2364a6842d3_4 | c37b5d1068140a91 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254FieldConvSAsm.lean | Bn254FieldConvSAsm | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 2 | [
{
"theorem_name": "inner_body_exec",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have haddr : (rf.set .x28 (rf.get .x28 <<< (8 : BitVec 6).toNat)).get .x6\n + signExtend12 (0 : BitVec 12) = src + Bi... | [
{
"name": "src_miss",
"text": "/-- A source-region byte at offset `o < 32` misses the disjoint 32-byte\n writable window. -/\nprivate theorem src_miss (src dst : Word) (ws : List (BitVec 8)) (o : Nat)\n (ho : o < 32) (hws : ws.length = 32) (hfr : frameOk src dst) :\n ¬ inRw dst ws (src + BitVec.ofN... | [
{
"name": "inner_body_exec",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 38,
"n_chars": 2368,
"n_subproofs": 2,
"n_tactics": 23,
"cyclomatic": 2,
"n_automation": 9,
"n_rewrites": 9,
"n_structural": 2,
"automation_only": false,
"max_nest... | 3 | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsm
Verified SAsm port of the bn254 BE↔LE field-element converters
(bead evm-asm-4ch8f.38.2 wave-3, clone of the merged `secfBeToLe`
template #9848 — the two `_prog`s are byte-identical, so this is an
exact byte-tie, spec-only, no EEST):
- `bnfBeToLe` (`bnfBeToLe_... | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsm
Verified SAsm port of the bn254 BE↔LE field-element converters
(bead evm-asm-4ch8f.38.2 wave-3, clone of the merged `secfBeToLe`
template #9848 — the two `_prog`s are byte-identical, so this is an
exact byte-tie, spec-only, no EEST):
- `bnfBeToLe` (`bnfBeToLe_... | @@ -193,6 +193,16 @@
congr 1
bv_omega
+/-- A source-region byte at offset `o < 32` misses the disjoint 32-byte
+ writable window. -/
+private theorem src_miss (src dst : Word) (ws : List (BitVec 8)) (o : Nat)
+ (ho : o < 32) (hws : ws.length = 32) (hfr : frameOk src dst) :
+ ¬ inRw dst ws (src + BitVec... | {
"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_d2364a6842d3_5 | 847ab365c9ec5920 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254FieldConvSAsm.lean | Bn254FieldConvSAsm | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 2 | [
{
"theorem_name": "snap_facts",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨rfp, wsp, hwsp, hreach, rfl, rfl⟩ := hsp\n -- pre-setup facts: x5 = ofNat k (k<4), x10 = src, x11 = dst, ws length 32,... | [
{
"name": "setup_exec",
"text": "private theorem setup_exec (reg : Region) (rwb src : Word) (rfp : RegFile)\n (wsp : List (BitVec 8)) (k : Nat) (hk : k < 4)\n (hx5 : rfp.get .x5 = BitVec.ofNat 64 k) (hx10 : rfp.get .x10 = src) :\n (execBlock reg rwb rfp wsp setupInstrs).1.get .x5 = BitVec.ofNat 64 ... | [
{
"name": "snap_facts",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 41,
"n_chars": 2612,
"n_subproofs": 6,
"n_tactics": 21,
"cyclomatic": 2,
"n_automation": 11,
"n_rewrites": 0,
"n_structural": 11,
"automation_only": false,
"max_nesting... | 1 | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsm
Verified SAsm port of the bn254 BE↔LE field-element converters
(bead evm-asm-4ch8f.38.2 wave-3, clone of the merged `secfBeToLe`
template #9848 — the two `_prog`s are byte-identical, so this is an
exact byte-tie, spec-only, no EEST):
- `bnfBeToLe` (`bnfBeToLe_... | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsm
Verified SAsm port of the bn254 BE↔LE field-element converters
(bead evm-asm-4ch8f.38.2 wave-3, clone of the merged `secfBeToLe`
template #9848 — the two `_prog`s are byte-identical, so this is an
exact byte-tie, spec-only, no EEST):
- `bnfBeToLe` (`bnfBeToLe_... | @@ -169,6 +169,22 @@
[.LI .x6 (24 : Word), .SLLI .x7 .x5 (3 : BitVec 6), .SUB .x6 .x6 .x7,
.ADD .x6 .x10 .x6, .LI .x28 (0 : Word), .LI .x29 (8 : Word)]
+private theorem setup_exec (reg : Region) (rwb src : Word) (rfp : RegFile)
+ (wsp : List (BitVec 8)) (k : Nat) (hk : k < 4)
+ (hx5 : rfp.get .x5 = 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_d2364a6842d3_6 | 913925386dad564c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254FieldConvSAsm.lean | Bn254FieldConvSAsm | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 2 | [
{
"theorem_name": "inner_body_exec",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have haddr : (rf.set .x28 (rf.get .x28 <<< (8 : BitVec 6).toNat)).get .x6\n + signExtend12 (0 : BitVec 12) = src + Bi... | [
{
"name": "src_miss",
"text": "/-- A source-region byte at offset `o < 32` misses the disjoint 32-byte\n writable window. -/\nprivate theorem src_miss (src dst : Word) (ws : List (BitVec 8)) (o : Nat)\n (ho : o < 32) (hws : ws.length = 32) (hfr : frameOk src dst) :\n ¬ inRw dst ws (src + BitVec.ofN... | [
{
"name": "inner_blockVCs",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 31,
"n_chars": 1733,
"n_subproofs": 3,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 13,
"n_rewrites": 8,
"n_structural": 2,
"automation_only": false,
"max_nest... | 1 | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsm
Verified SAsm port of the bn254 BE↔LE field-element converters
(bead evm-asm-4ch8f.38.2 wave-3, clone of the merged `secfBeToLe`
template #9848 — the two `_prog`s are byte-identical, so this is an
exact byte-tie, spec-only, no EEST):
- `bnfBeToLe` (`bnfBeToLe_... | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsm
Verified SAsm port of the bn254 BE↔LE field-element converters
(bead evm-asm-4ch8f.38.2 wave-3, clone of the merged `secfBeToLe`
template #9848 — the two `_prog`s are byte-identical, so this is an
exact byte-tie, spec-only, no EEST):
- `bnfBeToLe` (`bnfBeToLe_... | @@ -177,6 +177,16 @@
[.SLLI .x7 .x5 (3 : BitVec 6), .ADD .x7 .x11 .x7, .SD .x7 .x28 (0 : BitVec 12),
.ADDI .x5 .x5 (1 : BitVec 12), .LI .x6 (4 : Word)]
+/-- A source-region byte at offset `o < 32` misses the disjoint 32-byte
+ writable window. -/
+private theorem src_miss (src dst : Word) (ws : List (BitVec... | {
"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_d2364a6842d3_7 | 2ba8fea62ef86671 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254FieldConvSAsm.lean | Bn254FieldConvSAsm | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 2 | [
{
"theorem_name": "inner_step_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨hp29, hp28, hp6, hp5, hp10, hp11, hpws, hpfr, hpA⟩ := hInv\n rw [hkeq] at hp28\n have hpx6 : rf.get .x6 = src ... | [
{
"name": "inner_body_exec",
"text": "/-- One inner body run: accumulate the source byte at `src + o` (missing the\n disjoint window), advance the pointer, decrement the counter. -/\nprivate theorem inner_body_exec (src dst : Word) (inBytes ws : List (BitVec 8))\n (rf : RegFile) (o : Nat) (ho : o < 32... | [
{
"name": "inner_step_engine",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 11,
"n_lines": 47,
"n_chars": 2474,
"n_subproofs": 8,
"n_tactics": 32,
"cyclomatic": 1,
"n_automation": 9,
"n_rewrites": 15,
"n_structural": 4,
"automation_only": false,
"max_... | 11 | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsm
Verified SAsm port of the bn254 BE↔LE field-element converters
(bead evm-asm-4ch8f.38.2 wave-3, clone of the merged `secfBeToLe`
template #9848 — the two `_prog`s are byte-identical, so this is an
exact byte-tie, spec-only, no EEST):
- `bnfBeToLe` (`bnfBeToLe_... | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsm
Verified SAsm port of the bn254 BE↔LE field-element converters
(bead evm-asm-4ch8f.38.2 wave-3, clone of the merged `secfBeToLe`
template #9848 — the two `_prog`s are byte-identical, so this is an
exact byte-tie, spec-only, no EEST):
- `bnfBeToLe` (`bnfBeToLe_... | @@ -264,6 +264,43 @@
rw [hws]
rcases hdisj with h | h <;> bv_omega
+/-- One inner body run: accumulate the source byte at `src + o` (missing the
+ disjoint window), advance the pointer, decrement the counter. -/
+private theorem inner_body_exec (src dst : Word) (inBytes ws : List (BitVec 8))
+ (rf : RegFi... | {
"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_d2364a6842d3_8 | 33db96fc166fd958 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254FieldConvSAsm.lean | Bn254FieldConvSAsm | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "outer_step_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨_, hp28, _, hp5, hp10, hp11, hpws, hfr, hpA⟩ := hInv\n have hkeq : (rf₀.get .x5).toNat = k := by rw [hs5, BitVe... | [
{
"name": "wsDword_setBytes_self",
"text": "/-- Reading a dword back at the offset it was just written. -/\nprivate theorem wsDword_setBytes_self (ws : List (BitVec 8)) (v : Word) (j : Nat)\n (h : j + 8 ≤ ws.length) : wsDword (setBytes ws j (dwordBytes v)) j = v := by\n unfold wsDword\n have hs := setB... | [
{
"name": "outer_step_engine",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 34,
"n_chars": 1818,
"n_subproofs": 6,
"n_tactics": 24,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 10,
"n_structural": 8,
"automation_only": false,
"max_n... | 2 | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsm
Verified SAsm port of the bn254 BE↔LE field-element converters
(bead evm-asm-4ch8f.38.2 wave-3, clone of the merged `secfBeToLe`
template #9848 — the two `_prog`s are byte-identical, so this is an
exact byte-tie, spec-only, no EEST):
- `bnfBeToLe` (`bnfBeToLe_... | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsm
Verified SAsm port of the bn254 BE↔LE field-element converters
(bead evm-asm-4ch8f.38.2 wave-3, clone of the merged `secfBeToLe`
template #9848 — the two `_prog`s are byte-identical, so this is an
exact byte-tie, spec-only, no EEST):
- `bnfBeToLe` (`bnfBeToLe_... | @@ -210,6 +210,14 @@
congr 1
bv_omega
+/-- Reading a dword back at the offset it was just written. -/
+private theorem wsDword_setBytes_self (ws : List (BitVec 8)) (v : Word) (j : Nat)
+ (h : j + 8 ≤ ws.length) : wsDword (setBytes ws j (dwordBytes v)) j = v := by
+ unfold wsDword
+ have hs := setBytes_slot... | {
"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_d2364a6842d3_9 | a1b245ba52061ca6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254FieldConvSAsm.lean | Bn254FieldConvSAsm | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 2 | [
{
"theorem_name": "inner_step_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨hp29, hp28, hp6, hp5, hp10, hp11, hpws, hpfr, hpA⟩ := hInv\n rw [hkeq] at hp28\n have hpx6 : rf.get .x6 = src ... | [
{
"name": "add_ofNat_add",
"text": "/-- `src + ofNat a + ofNat b = src + ofNat (a + b)`. -/\nprivate theorem add_ofNat_add (src : Word) (a b : Nat) :\n src + BitVec.ofNat 64 a + BitVec.ofNat 64 b = src + BitVec.ofNat 64 (a + b) := by\n rw [BitVec.add_assoc]\n congr 1\n apply BitVec.eq_of_toNat_eq\n s... | [
{
"name": "bnfBeToLeFn_spec",
"fan_in": 0,
"n_deps_direct": 12,
"n_deps_transitive": 21,
"n_lines": 140,
"n_chars": 6975,
"n_subproofs": 36,
"n_tactics": 142,
"cyclomatic": 11,
"n_automation": 54,
"n_rewrites": 43,
"n_structural": 43,
"automation_only": false,
... | 21 | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsm
Verified SAsm port of the bn254 BE↔LE field-element converters
(bead evm-asm-4ch8f.38.2 wave-3, clone of the merged `secfBeToLe`
template #9848 — the two `_prog`s are byte-identical, so this is an
exact byte-tie, spec-only, no EEST):
- `bnfBeToLe` (`bnfBeToLe_... | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsm
Verified SAsm port of the bn254 BE↔LE field-element converters
(bead evm-asm-4ch8f.38.2 wave-3, clone of the merged `secfBeToLe`
template #9848 — the two `_prog`s are byte-identical, so this is an
exact byte-tie, spec-only, no EEST):
- `bnfBeToLe` (`bnfBeToLe_... | @@ -415,6 +415,14 @@
(l.drop m).getD n 0 = l.getD (m + n) 0 := by
simp [List.getD_eq_getElem?_getD, List.getElem?_drop]
+/-- `src + ofNat a + ofNat b = src + ofNat (a + b)`. -/
+private theorem add_ofNat_add (src : Word) (a b : Nat) :
+ src + BitVec.ofNat 64 a + BitVec.ofNat 64 b = src + BitVec.ofNat 64 (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_cf05f808208f_0 | b25c97a240da569e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Base.lean | Base | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "sdivCodeV4_top_level_subs",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact ⟨sdivCodeV4_wrapper_sub, sdivCodeV4_div_callable_sub⟩",
"n_chars": 69,
"n_subproofs": 0,
"n_tac... | [
{
"name": "sdivCodeV4_wrapper_sub",
"text": "/-- Wrapper sub-region inside `sdivCodeV4`. -/\ntheorem sdivCodeV4_wrapper_sub {base : Word} :\n ∀ a i, (EvmAsm.Rv64.CodeReq.ofProg base evm_sdiv_wrapper) a = some i →\n (sdivCodeV4 base) a = some i := by\n unfold sdivCodeV4\n exact EvmAsm.Rv64.CodeReq.... | [
{
"name": "sdivCodeV4_top_level_subs",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 458,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"... | 2 | /-
EvmAsm.Evm64.SDiv.Compose.Base
Shared composition infrastructure for SDIV: `sdivCode` (the union of
all sub-block `CodeReq`s), subsumption helpers tying sub-block codes
back to `sdivCode`, and shared length lemmas.
Skeleton placeholder for GH #90 (beads slice evm-asm-kyp6). Concrete
definitions will be... | /-
EvmAsm.Evm64.SDiv.Compose.Base
Shared composition infrastructure for SDIV: `sdivCode` (the union of
all sub-block `CodeReq`s), subsumption helpers tying sub-block codes
back to `sdivCode`, and shared length lemmas.
Skeleton placeholder for GH #90 (beads slice evm-asm-kyp6). Concrete
definitions will be... | @@ -27,6 +27,21 @@
namespace EvmAsm.Evm64.SDiv.Compose
+/-- Wrapper sub-region inside `sdivCodeV4`. -/
+theorem sdivCodeV4_wrapper_sub {base : Word} :
+ ∀ a i, (EvmAsm.Rv64.CodeReq.ofProg base evm_sdiv_wrapper) a = some i →
+ (sdivCodeV4 base) a = some i := by
+ unfold sdivCodeV4
+ exact EvmAsm.Rv64.Code... | {
"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_13311ac464ec_0 | b1e7ac965aa40068 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/SingleByteListLoopValidated.lean | SingleByteListLoopValidated | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "orAccList_and_zero_imp_acc",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction l with\n | nil => intro acc h; simpa [orAccList] using h\n | cons c l ih =>\n intro acc h\n rw... | [
{
"name": "and_left_of_or_and_eq_zero",
"text": "/-- If `(x ||| y) &&& m = 0` then the left disjunct is masked to zero. -/\ntheorem and_left_of_or_and_eq_zero {x y m : Word} (h : (x ||| y) &&& m = 0) :\n x &&& m = 0 := by\n ext i\n have hi := congrArg (fun z => z.getLsbD i) h\n simp at hi\n cases x.g... | [
{
"name": "orAccList_and_zero_imp_acc",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 433,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
... | 2 | /-
EvmAsm.Rv64.RLP.SingleByteListLoopValidated
EL.3 — the single-byte-item RLP list-decode loop with **in-machine `< 0x80`
validation**. Where `SingleByteListLoop.lean` *assumes* every payload byte
`< 0x80` (the `hsingle` precondition), this loop *proves* it: it ORs every byte
into an accumulator (`x11`) as ... | /-
EvmAsm.Rv64.RLP.SingleByteListLoopValidated
EL.3 — the single-byte-item RLP list-decode loop with **in-machine `< 0x80`
validation**. Where `SingleByteListLoop.lean` *assumes* every payload byte
`< 0x80` (the `hsingle` precondition), this loop *proves* it: it ORs every byte
into an accumulator (`x11`) as ... | @@ -37,6 +37,14 @@
theorem orAccList_cons (acc : Word) (b : BitVec 8) (l : List (BitVec 8)) :
orAccList acc (b :: l) = orAccList (acc ||| b.zeroExtend 64) l := rfl
+/-- If `(x ||| y) &&& m = 0` then the left disjunct is masked to zero. -/
+theorem and_left_of_or_and_eq_zero {x y m : Word} (h : (x ||| y) &&& m =... | {
"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_13311ac464ec_1 | e1f7e85a981731e4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/SingleByteListLoopValidated.lean | SingleByteListLoopValidated | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "orAccList_and_0x80_eq_zero_imp_all_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n suffices H : ∀ (acc : Word) (l : List (BitVec 8)),\n (orAccList acc l) &&& (0x80 : Word) = 0 → ... | [
{
"name": "byte_zext_and_0x80_eq_zero_imp_lt",
"text": "/-- Bit-7 leaf: a byte whose bit 7 is masked off (by `0x80`) is `< 0x80`. -/\ntheorem byte_zext_and_0x80_eq_zero_imp_lt {b : BitVec 8}\n (h : (b.zeroExtend 64) &&& (0x80 : Word) = 0) : b.toNat < 0x80 := by\n -- Bit 7 of `b` is clear (the only set b... | [
{
"name": "orAccList_and_0x80_eq_zero_imp_all_lt",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 5,
"n_lines": 19,
"n_chars": 807,
"n_subproofs": 1,
"n_tactics": 14,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 7,
"automation_only":... | 5 | /-
EvmAsm.Rv64.RLP.SingleByteListLoopValidated
EL.3 — the single-byte-item RLP list-decode loop with **in-machine `< 0x80`
validation**. Where `SingleByteListLoop.lean` *assumes* every payload byte
`< 0x80` (the `hsingle` precondition), this loop *proves* it: it ORs every byte
into an accumulator (`x11`) as ... | /-
EvmAsm.Rv64.RLP.SingleByteListLoopValidated
EL.3 — the single-byte-item RLP list-decode loop with **in-machine `< 0x80`
validation**. Where `SingleByteListLoop.lean` *assumes* every payload byte
`< 0x80` (the `hsingle` precondition), this loop *proves* it: it ORs every byte
into an accumulator (`x11`) as ... | @@ -53,6 +53,19 @@
simp at hi
cases x.getLsbD i <;> cases y.getLsbD i <;> cases m.getLsbD i <;> simp_all
+/-- Bit-7 leaf: a byte whose bit 7 is masked off (by `0x80`) is `< 0x80`. -/
+theorem byte_zext_and_0x80_eq_zero_imp_lt {b : BitVec 8}
+ (h : (b.zeroExtend 64) &&& (0x80 : Word) = 0) : b.toNat < 0x80 := ... | {
"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_13311ac464ec_2 | 2c1131336fa9b173 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/SingleByteListLoopValidated.lean | SingleByteListLoopValidated | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "sbll_val_iter_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 107,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sbll_val_iter_code_split]\n have h01 : (base : Word) ≠ base + 4 := by bv_omega\n have h02 : (base : Word)... | [
{
"name": "sbll_val_iter_code_split",
"text": "private theorem sbll_val_iter_code_split {base : Word} :\n CodeReq.ofProg base sbll_val_iter_prog =\n (CodeReq.singleton base (.LBU .x12 .x13 0)).union\n ((CodeReq.singleton (base + 4) (.OR .x11 .x11 .x12)).union\n ((CodeReq.singleton (base + 8) (.A... | [
{
"name": "sbll_val_iter_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 129,
"n_chars": 7234,
"n_subproofs": 20,
"n_tactics": 103,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 10,
"n_structural": 1,
"automation_only": false,... | 1 | /-
EvmAsm.Rv64.RLP.SingleByteListLoopValidated
EL.3 — the single-byte-item RLP list-decode loop with **in-machine `< 0x80`
validation**. Where `SingleByteListLoop.lean` *assumes* every payload byte
`< 0x80` (the `hsingle` precondition), this loop *proves* it: it ORs every byte
into an accumulator (`x11`) as ... | /-
EvmAsm.Rv64.RLP.SingleByteListLoopValidated
EL.3 — the single-byte-item RLP list-decode loop with **in-machine `< 0x80`
validation**. Where `SingleByteListLoop.lean` *assumes* every payload byte
`< 0x80` (the `hsingle` precondition), this loop *proves* it: it ORs every byte
into an accumulator (`x11`) as ... | @@ -110,6 +110,17 @@
example : sbll_val_iter_prog.length = 4 := rfl
+private theorem sbll_val_iter_code_split {base : Word} :
+ CodeReq.ofProg base sbll_val_iter_prog =
+ (CodeReq.singleton base (.LBU .x12 .x13 0)).union
+ ((CodeReq.singleton (base + 4) (.OR .x11 .x11 .x12)).union
+ ((CodeReq.singleton... | {
"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_13311ac464ec_3 | 0b8460b2202ab0bf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/SingleByteListLoopValidated.lean | SingleByteListLoopValidated | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 3 | [
{
"theorem_name": "sbll_val_body_post_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hp hpost\n simp only [sbll_val_body_post_unfold] at hpost\n open EvmAsm.Rv64.Tactics in extract_pure hpost\... | [
{
"name": "sbll_val_body_post_unfold",
"text": "theorem sbll_val_body_post_unfold (regionBase accFinal byteZext nextPtr cnt' : Word)\n (bs : List (BitVec 8)) (P : Prop) :\n sbll_val_body_post regionBase accFinal byteZext nextPtr cnt' bs P =\n ((.x11 ↦ᵣ accFinal) ** (.x12 ↦ᵣ byteZext) ** (.x13 ↦ᵣ ne... | [
{
"name": "sbll_val_body_post_pure",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 348,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max... | 1 | /-
EvmAsm.Rv64.RLP.SingleByteListLoopValidated
EL.3 — the single-byte-item RLP list-decode loop with **in-machine `< 0x80`
validation**. Where `SingleByteListLoop.lean` *assumes* every payload byte
`< 0x80` (the `hsingle` precondition), this loop *proves* it: it ORs every byte
into an accumulator (`x11`) as ... | /-
EvmAsm.Rv64.RLP.SingleByteListLoopValidated
EL.3 — the single-byte-item RLP list-decode loop with **in-machine `< 0x80`
validation**. Where `SingleByteListLoop.lean` *assumes* every payload byte
`< 0x80` (the `hsingle` precondition), this loop *proves* it: it ORs every byte
into an accumulator (`x11`) as ... | @@ -263,9 +263,20 @@
(.x11 ↦ᵣ accFinal) ** (.x12 ↦ᵣ byteZext) ** (.x13 ↦ᵣ nextPtr) ** (.x14 ↦ᵣ cnt') **
(.x0 ↦ᵣ (0 : Word)) ** bytesRegion regionBase bs ** ⌜P⌝
+theorem sbll_val_body_post_unfold (regionBase accFinal byteZext nextPtr cnt' : Word)
+ (bs : List (BitVec 8)) (P : Prop) :
+ sbll_val_body_post... | {
"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_13311ac464ec_4 | bc430ebe3e9ee2b6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/SingleByteListLoopValidated.lean | SingleByteListLoopValidated | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "orAccList_dropTake_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dropTake_succ_peel bs start k h, orAccList_cons]",
"n_chars": 58,
"n_subproofs": 0,
"n_tactics": 2,... | [
{
"name": "dropTake_succ_peel",
"text": "/-- Peel the head off a `drop`-then-`take`, exposing the `orAccList` recursion. -/\ntheorem dropTake_succ_peel (bs : List (BitVec 8)) (start m : Nat)\n (h : start < bs.length) :\n (bs.drop start).take (m + 1) = (bs[start]'h) :: (bs.drop (start + 1)).take m := b... | [
{
"name": "orAccList_dropTake_succ",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 368,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max... | 2 | /-
EvmAsm.Rv64.RLP.SingleByteListLoopValidated
EL.3 — the single-byte-item RLP list-decode loop with **in-machine `< 0x80`
validation**. Where `SingleByteListLoop.lean` *assumes* every payload byte
`< 0x80` (the `hsingle` precondition), this loop *proves* it: it ORs every byte
into an accumulator (`x11`) as ... | /-
EvmAsm.Rv64.RLP.SingleByteListLoopValidated
EL.3 — the single-byte-item RLP list-decode loop with **in-machine `< 0x80`
validation**. Where `SingleByteListLoop.lean` *assumes* every payload byte
`< 0x80` (the `hsingle` precondition), this loop *proves* it: it ORs every byte
into an accumulator (`x11`) as ... | @@ -94,6 +94,16 @@
(and_right_of_or_and_eq_zero (orAccList_and_zero_imp_acc _ hacc))
· exact ih (acc ||| c.zeroExtend 64) hacc b hbl
+/-- Peel the head off a `drop`-then-`take`, exposing the `orAccList` recursion. -/
+theorem dropTake_succ_peel (bs : List (BitVec 8)) (start m : Nat)
+ (h : start < bs... | {
"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_13311ac464ec_5 | 4a81e54efd7ac104 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/SingleByteListLoopValidated.lean | SingleByteListLoopValidated | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "sbll_val_loop_succ_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 66,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction k generalizing start acc v12Old with\n | zero =>\n have hvalid0 := hwin 0 (by omega)\n rw ... | [
{
"name": "sbll_val_body_post_pure",
"text": "theorem sbll_val_body_post_pure {regionBase accFinal byteZext nextPtr cnt' : Word}\n {bs : List (BitVec 8)} {P : Prop} :\n ∀ hp, sbll_val_body_post regionBase accFinal byteZext nextPtr cnt' bs P hp → P := by\n intro hp hpost\n simp only [sbll_val_body_po... | [
{
"name": "sbll_val_loop_succ_spec_within",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 9,
"n_lines": 87,
"n_chars": 4590,
"n_subproofs": 14,
"n_tactics": 66,
"cyclomatic": 2,
"n_automation": 24,
"n_rewrites": 13,
"n_structural": 4,
"automation_only": fa... | 8 | /-
EvmAsm.Rv64.RLP.SingleByteListLoopValidated
EL.3 — the single-byte-item RLP list-decode loop with **in-machine `< 0x80`
validation**. Where `SingleByteListLoop.lean` *assumes* every payload byte
`< 0x80` (the `hsingle` precondition), this loop *proves* it: it ORs every byte
into an accumulator (`x11`) as ... | /-
EvmAsm.Rv64.RLP.SingleByteListLoopValidated
EL.3 — the single-byte-item RLP list-decode loop with **in-machine `< 0x80`
validation**. Where `SingleByteListLoop.lean` *assumes* every payload byte
`< 0x80` (the `hsingle` precondition), this loop *proves* it: it ORs every byte
into an accumulator (`x11`) as ... | @@ -270,6 +270,14 @@
(.x0 ↦ᵣ (0 : Word)) ** bytesRegion regionBase bs ** ⌜P⌝) := by
delta sbll_val_body_post; rfl
+theorem sbll_val_body_post_pure {regionBase accFinal byteZext nextPtr cnt' : Word}
+ {bs : List (BitVec 8)} {P : Prop} :
+ ∀ hp, sbll_val_body_post regionBase accFinal byteZext nextPtr cn... | {
"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_13311ac464ec_6 | 2f85a09496f04af9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/SingleByteListLoopValidated.lean | SingleByteListLoopValidated | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "sbll_val_loop_succ_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 66,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction k generalizing start acc v12Old with\n | zero =>\n have hvalid0 := hwin 0 (by omega)\n rw ... | [
{
"name": "orAccList_dropTake_succ",
"text": "/-- One-step recursion for the threaded accumulator. -/\ntheorem orAccList_dropTake_succ (acc : Word) (bs : List (BitVec 8)) (start k : Nat)\n (h : start < bs.length) :\n orAccList acc ((bs.drop start).take (k + 1))\n = orAccList (acc ||| (bs[start]'h... | [
{
"name": "sbll_val_loop_checked_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 12,
"n_lines": 133,
"n_chars": 7799,
"n_subproofs": 12,
"n_tactics": 97,
"cyclomatic": 3,
"n_automation": 12,
"n_rewrites": 6,
"n_structural": 12,
"automation_only... | 11 | /-
EvmAsm.Rv64.RLP.SingleByteListLoopValidated
EL.3 — the single-byte-item RLP list-decode loop with **in-machine `< 0x80`
validation**. Where `SingleByteListLoop.lean` *assumes* every payload byte
`< 0x80` (the `hsingle` precondition), this loop *proves* it: it ORs every byte
into an accumulator (`x11`) as ... | /-
EvmAsm.Rv64.RLP.SingleByteListLoopValidated
EL.3 — the single-byte-item RLP list-decode loop with **in-machine `< 0x80`
validation**. Where `SingleByteListLoop.lean` *assumes* every payload byte
`< 0x80` (the `hsingle` precondition), this loop *proves* it: it ORs every byte
into an accumulator (`x11`) as ... | @@ -381,6 +381,13 @@
-- n-iteration closure (operational cpsTriple, OR accumulator threaded)
-- ============================================================================
+/-- One-step recursion for the threaded accumulator. -/
+theorem orAccList_dropTake_succ (acc : Word) (bs : List (BitVec 8)) (start k : Nat)
+... | {
"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_13311ac464ec_7 | 70b1cce62df40b22 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/SingleByteListLoopValidated.lean | SingleByteListLoopValidated | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "orAccList_and_0x80_eq_zero_imp_all_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n suffices H : ∀ (acc : Word) (l : List (BitVec 8)),\n (orAccList acc l) &&& (0x80 : Word) = 0 → ... | [
{
"name": "orAccList_and_zero_imp_acc",
"text": "/-- The fold preserves the bit-7-clear invariant downward to its seed. -/\ntheorem orAccList_and_zero_imp_acc {l : List (BitVec 8)} :\n ∀ acc : Word, (orAccList acc l) &&& (0x80 : Word) = 0 → acc &&& (0x80 : Word) = 0 := by\n induction l with\n | nil => ... | [
{
"name": "sbll_val_loop_bridge",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 12,
"n_chars": 692,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_n... | 6 | /-
EvmAsm.Rv64.RLP.SingleByteListLoopValidated
EL.3 — the single-byte-item RLP list-decode loop with **in-machine `< 0x80`
validation**. Where `SingleByteListLoop.lean` *assumes* every payload byte
`< 0x80` (the `hsingle` precondition), this loop *proves* it: it ORs every byte
into an accumulator (`x11`) as ... | /-
EvmAsm.Rv64.RLP.SingleByteListLoopValidated
EL.3 — the single-byte-item RLP list-decode loop with **in-machine `< 0x80`
validation**. Where `SingleByteListLoop.lean` *assumes* every payload byte
`< 0x80` (the `hsingle` precondition), this loop *proves* it: it ORs every byte
into an accumulator (`x11`) as ... | @@ -66,6 +66,16 @@
have h2 := (BitVec.msb_eq_false_iff_two_mul_lt).mp hmsb
omega
+/-- The fold preserves the bit-7-clear invariant downward to its seed. -/
+theorem orAccList_and_zero_imp_acc {l : List (BitVec 8)} :
+ ∀ acc : Word, (orAccList acc l) &&& (0x80 : Word) = 0 → acc &&& (0x80 : Word) = 0 := 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_ced4106b365c_0 | 439c500a7c832678 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Sub/Spec.lean | Spec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_sub_stack_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro a0 b0 a1 b1 a2 b2 a3 b3 borrow0 diff0 borrow1a temp1 borrow1b result1 borrow1 borrow2a temp2 borrow2b resu... | [
{
"name": "evm_sub_spec_within",
"text": "/-- Full 256-bit EVM SUB: composes 4 per-limb SUB specs + ADDI sp adjustment.\n 30 instructions total. Pops 2 stack words (A at sp, B at sp+32),\n writes A - B to sp+32..sp+56, advances sp by 32.\n Borrow propagates through limbs via x5. -/\ntheorem evm_sub... | [
{
"name": "evm_sub_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 55,
"n_chars": 2619,
"n_subproofs": 2,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.Sub.Spec
Full 256-bit EVM SUB spec composed from per-limb specs.
30 instructions total (5 + 3×8 + 1 ADDI).
-/
-- `Sub.LimbSpec → Sub.Program → Stack → SpAddr`.
import EvmAsm.Evm64.Sub.LimbSpec
import EvmAsm.Evm64.Sub.Program
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Evm64.Stack
i... | /-
EvmAsm.Evm64.Sub.Spec
Full 256-bit EVM SUB spec composed from per-limb specs.
30 instructions total (5 + 3×8 + 1 ADDI).
-/
-- `Sub.LimbSpec → Sub.Program → Stack → SpAddr`.
import EvmAsm.Evm64.Sub.LimbSpec
import EvmAsm.Evm64.Sub.Program
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Evm64.Stack
i... | @@ -23,6 +23,52 @@
abbrev evm_sub_code (base : Word) : CodeReq :=
CodeReq.ofProg base evm_sub
+/-- Full 256-bit EVM SUB: composes 4 per-limb SUB specs + ADDI sp adjustment.
+ 30 instructions total. Pops 2 stack words (A at sp, B at sp+32),
+ writes A - B to sp+32..sp+56, advances sp by 32.
+ Borrow propa... | {
"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_7a1909fd986e_0 | 4f0d258f7e1f04c1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/UnifiedLenLoop.lean | UnifiedLenLoop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "unified_lenloop_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 146,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro items\n induction items with\n | nil => intro O btail v5Old v10 v11Old v12Old v14Old hne _ _; exact a... | [
{
"name": "unified_lenloop_post_unfold",
"text": "theorem unified_lenloop_post_unfold (regionBase : Word) (bs : List (BitVec 8)) (endPtr : Word) :\n unified_lenloop_post regionBase bs endPtr =\n (regOwn .x5 ** (.x0 ↦ᵣ (0 : Word)) ** regOwn .x10 ** regOwn .x11 ** regOwn .x12 **\n (.x13 ↦ᵣ endPtr) ... | [
{
"name": "unified_lenloop_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 177,
"n_chars": 11067,
"n_subproofs": 34,
"n_tactics": 156,
"cyclomatic": 5,
"n_automation": 29,
"n_rewrites": 29,
"n_structural": 16,
"automation_only": f... | 2 | /-
EvmAsm.Rv64.RLP.UnifiedLenLoop
EL.3 / Phase 5 — the LENGTH-DRIVEN unified RV64 RLP list-decode loop closure +
bridge. Induct over the items, applying the length-driven body
(`unified_lenloop_body_spec_within`) per item; the loop runs until the data
pointer `x13` reaches the invariant end pointer `x15 = en... | /-
EvmAsm.Rv64.RLP.UnifiedLenLoop
EL.3 / Phase 5 — the LENGTH-DRIVEN unified RV64 RLP list-decode loop closure +
bridge. Induct over the items, applying the length-driven body
(`unified_lenloop_body_spec_within`) per item; the loop runs until the data
pointer `x13` reaches the invariant end pointer `x15 = en... | @@ -36,6 +36,12 @@
regOwn .x5 ** (.x0 ↦ᵣ (0 : Word)) ** regOwn .x10 ** regOwn .x11 ** regOwn .x12 **
(.x13 ↦ᵣ endPtr) ** regOwn .x14 ** (.x15 ↦ᵣ endPtr) ** bytesRegion regionBase bs
+theorem unified_lenloop_post_unfold (regionBase : Word) (bs : List (BitVec 8)) (endPtr : Word) :
+ unified_lenloop_post regi... | {
"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_7a1909fd986e_1 | 9fb832f9d08fb402 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/UnifiedLenLoop.lean | UnifiedLenLoop | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "unified_lenloop_n_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := unified_lenloop_spec_within regionBase lbase joinPC decoder_base dcr back\n (encode.encodeItems ... | [
{
"name": "unified_lenloop_spec_within",
"text": "/-- **Length-driven n-iteration closure.** Decoding a non-empty list of arbitrary\n RLP items from the region suffix at offset `O` runs the loop body once per\n item — `63 * items.length` steps — until `x13` reaches the end pointer\n `x15 = endPtr =... | [
{
"name": "unified_lenloop_n_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 38,
"n_chars": 2462,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
... | 3 | /-
EvmAsm.Rv64.RLP.UnifiedLenLoop
EL.3 / Phase 5 — the LENGTH-DRIVEN unified RV64 RLP list-decode loop closure +
bridge. Induct over the items, applying the length-driven body
(`unified_lenloop_body_spec_within`) per item; the loop runs until the data
pointer `x13` reaches the invariant end pointer `x15 = en... | /-
EvmAsm.Rv64.RLP.UnifiedLenLoop
EL.3 / Phase 5 — the LENGTH-DRIVEN unified RV64 RLP list-decode loop closure +
bridge. Induct over the items, applying the length-driven body
(`unified_lenloop_body_spec_within`) per item; the loop runs until the data
pointer `x13` reaches the invariant end pointer `x15 = en... | @@ -42,6 +42,182 @@
(.x13 ↦ᵣ endPtr) ** regOwn .x14 ** (.x15 ↦ᵣ endPtr) ** bytesRegion regionBase bs) := by
delta unified_lenloop_post; rfl
+/-- **Length-driven n-iteration closure.** Decoding a non-empty list of arbitrary
+ RLP items from the region suffix at offset `O` runs the loop body once per
+ ... | {
"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_7a1909fd986e_2 | f9cdc0e0aff2231e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/UnifiedLenLoop.lean | UnifiedLenLoop | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "unified_lenloop_n_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := unified_lenloop_spec_within regionBase lbase joinPC decoder_base dcr back\n (encode.encodeItems ... | [
{
"name": "unified_lenloop_spec_within",
"text": "/-- **Length-driven n-iteration closure.** Decoding a non-empty list of arbitrary\n RLP items from the region suffix at offset `O` runs the loop body once per\n item — `63 * items.length` steps — until `x13` reaches the end pointer\n `x15 = endPtr =... | [
{
"name": "unified_lenloop_bridge",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 37,
"n_chars": 2404,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max... | 4 | /-
EvmAsm.Rv64.RLP.UnifiedLenLoop
EL.3 / Phase 5 — the LENGTH-DRIVEN unified RV64 RLP list-decode loop closure +
bridge. Induct over the items, applying the length-driven body
(`unified_lenloop_body_spec_within`) per item; the loop runs until the data
pointer `x13` reaches the invariant end pointer `x15 = en... | /-
EvmAsm.Rv64.RLP.UnifiedLenLoop
EL.3 / Phase 5 — the LENGTH-DRIVEN unified RV64 RLP list-decode loop closure +
bridge. Induct over the items, applying the length-driven body
(`unified_lenloop_body_spec_within`) per item; the loop runs until the data
pointer `x13` reaches the invariant end pointer `x15 = en... | @@ -42,6 +42,182 @@
(.x13 ↦ᵣ endPtr) ** regOwn .x14 ** (.x15 ↦ᵣ endPtr) ** bytesRegion regionBase bs) := by
delta unified_lenloop_post; rfl
+/-- **Length-driven n-iteration closure.** Decoding a non-empty list of arbitrary
+ RLP items from the region suffix at offset `O` runs the loop body once per
+ ... | {
"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_0e729126d8b9_0 | 1695d36aea17bd41 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Shift/LimbSpec.lean | LimbSpec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "shr_body_3_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have LL := shr_last_limb_spec_within 0 sp v3 v0 v5 bit_shift base\n have S0 := sd_x0_spec_gen_within .x12 sp v1 8 (... | [
{
"name": "shr_last_limb_spec_within",
"text": "theorem shr_last_limb_spec_within (dst_off : BitVec 12)\n (sp src dstOld v5 bit_shift : Word) (base : Word) :\n let memSrc := sp + signExtend12 (24 : BitVec 12)\n let memDst := sp + signExtend12 dst_off\n let result := src >>> (bit_shift.toNat % 64... | [
{
"name": "shr_body_3_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 26,
"n_chars": 1245,
"n_subproofs": 5,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"ma... | 1 | /-
EvmAsm.Evm64.Shift.LimbSpec
CPS specifications for the 256-bit EVM SHR (logical shift right) program (64-bit).
Modern CodeReq-based approach.
Modular decomposition:
- Per-limb helpers: shr_merge_limb_spec (7 instrs), shr_last_limb_spec (3 instrs)
- Zero path: shr_zero_path_spec (5 instrs, shift >= 256)... | /-
EvmAsm.Evm64.Shift.LimbSpec
CPS specifications for the 256-bit EVM SHR (logical shift right) program (64-bit).
Modern CodeReq-based approach.
Modular decomposition:
- Per-limb helpers: shr_merge_limb_spec (7 instrs), shr_last_limb_spec (3 instrs)
- Zero path: shr_zero_path_spec (5 instrs, shift >= 256)... | @@ -41,6 +41,24 @@
abbrev shr_last_limb_code (dst_off : BitVec 12) (base : Word) : CodeReq :=
CodeReq.ofProg base (shr_last_limb_prog dst_off)
+theorem shr_last_limb_spec_within (dst_off : BitVec 12)
+ (sp src dstOld v5 bit_shift : Word) (base : Word) :
+ let memSrc := sp + signExtend12 (24 : BitVec 12)
+ ... | {
"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_0e729126d8b9_1 | 86a13e036b33fc26 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Shift/LimbSpec.lean | LimbSpec | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "shr_body_2_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have MM := shr_merge_limb_spec_within 16 24 0 sp v2 v3 v0 v5 v10 bit_shift antiShift mask base\n have LL := shr_la... | [
{
"name": "shr_merge_limb_spec_within",
"text": "theorem shr_merge_limb_spec_within (src_off next_off dst_off : BitVec 12)\n (sp src next dstOld v5 v10 bit_shift antiShift mask : Word) (base : Word) :\n let memSrc := sp + signExtend12 src_off\n let memNext := sp + signExtend12 next_off\n let mem... | [
{
"name": "shr_body_2_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 29,
"n_chars": 1513,
"n_subproofs": 5,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"m... | 2 | /-
EvmAsm.Evm64.Shift.LimbSpec
CPS specifications for the 256-bit EVM SHR (logical shift right) program (64-bit).
Modern CodeReq-based approach.
Modular decomposition:
- Per-limb helpers: shr_merge_limb_spec (7 instrs), shr_last_limb_spec (3 instrs)
- Zero path: shr_zero_path_spec (5 instrs, shift >= 256)... | /-
EvmAsm.Evm64.Shift.LimbSpec
CPS specifications for the 256-bit EVM SHR (logical shift right) program (64-bit).
Modern CodeReq-based approach.
Modular decomposition:
- Per-limb helpers: shr_merge_limb_spec (7 instrs), shr_last_limb_spec (3 instrs)
- Zero path: shr_zero_path_spec (5 instrs, shift >= 256)... | @@ -38,6 +38,33 @@
abbrev shr_merge_limb_code (src_off next_off dst_off : BitVec 12) (base : Word) : CodeReq :=
CodeReq.ofProg base (shr_merge_limb_prog src_off next_off dst_off)
+theorem shr_merge_limb_spec_within (src_off next_off dst_off : BitVec 12)
+ (sp src next dstOld v5 v10 bit_shift antiShift mask : W... | {
"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_0e729126d8b9_2 | 36ed59ed3df067ac | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Shift/LimbSpec.lean | LimbSpec | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "shr_body_2_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have MM := shr_merge_limb_spec_within 16 24 0 sp v2 v3 v0 v5 v10 bit_shift antiShift mask base\n have LL := shr_la... | [
{
"name": "shr_merge_limb_spec_within",
"text": "theorem shr_merge_limb_spec_within (src_off next_off dst_off : BitVec 12)\n (sp src next dstOld v5 v10 bit_shift antiShift mask : Word) (base : Word) :\n let memSrc := sp + signExtend12 src_off\n let memNext := sp + signExtend12 next_off\n let mem... | [
{
"name": "shr_body_1_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 33,
"n_chars": 1793,
"n_subproofs": 5,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"m... | 2 | /-
EvmAsm.Evm64.Shift.LimbSpec
CPS specifications for the 256-bit EVM SHR (logical shift right) program (64-bit).
Modern CodeReq-based approach.
Modular decomposition:
- Per-limb helpers: shr_merge_limb_spec (7 instrs), shr_last_limb_spec (3 instrs)
- Zero path: shr_zero_path_spec (5 instrs, shift >= 256)... | /-
EvmAsm.Evm64.Shift.LimbSpec
CPS specifications for the 256-bit EVM SHR (logical shift right) program (64-bit).
Modern CodeReq-based approach.
Modular decomposition:
- Per-limb helpers: shr_merge_limb_spec (7 instrs), shr_last_limb_spec (3 instrs)
- Zero path: shr_zero_path_spec (5 instrs, shift >= 256)... | @@ -38,6 +38,33 @@
abbrev shr_merge_limb_code (src_off next_off dst_off : BitVec 12) (base : Word) : CodeReq :=
CodeReq.ofProg base (shr_merge_limb_prog src_off next_off dst_off)
+theorem shr_merge_limb_spec_within (src_off next_off dst_off : BitVec 12)
+ (sp src next dstOld v5 v10 bit_shift antiShift mask : W... | {
"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_0e729126d8b9_3 | da63600e92b221d8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Shift/LimbSpec.lean | LimbSpec | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "shr_body_0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have MM1 := shr_merge_limb_inplace_spec_within 0 8 sp v0 v1 v5 v10 bit_shift antiShift mask base\n have MM2 := shr... | [
{
"name": "shr_merge_limb_inplace_spec_within",
"text": "theorem shr_merge_limb_inplace_spec_within (off next_off : BitVec 12)\n (sp src next v5 v10 bit_shift antiShift mask : Word) (base : Word) :\n let memLoc := sp + signExtend12 off\n let memNext := sp + signExtend12 next_off\n let shiftedSrc... | [
{
"name": "shr_body_0_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 39,
"n_chars": 2250,
"n_subproofs": 5,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"m... | 2 | /-
EvmAsm.Evm64.Shift.LimbSpec
CPS specifications for the 256-bit EVM SHR (logical shift right) program (64-bit).
Modern CodeReq-based approach.
Modular decomposition:
- Per-limb helpers: shr_merge_limb_spec (7 instrs), shr_last_limb_spec (3 instrs)
- Zero path: shr_zero_path_spec (5 instrs, shift >= 256)... | /-
EvmAsm.Evm64.Shift.LimbSpec
CPS specifications for the 256-bit EVM SHR (logical shift right) program (64-bit).
Modern CodeReq-based approach.
Modular decomposition:
- Per-limb helpers: shr_merge_limb_spec (7 instrs), shr_last_limb_spec (3 instrs)
- Zero path: shr_zero_path_spec (5 instrs, shift >= 256)... | @@ -44,6 +44,32 @@
abbrev shr_merge_limb_inplace_code (off next_off : BitVec 12) (base : Word) : CodeReq :=
CodeReq.ofProg base (shr_merge_limb_inplace_prog off next_off)
+theorem shr_merge_limb_inplace_spec_within (off next_off : BitVec 12)
+ (sp src next v5 v10 bit_shift antiShift mask : Word) (base : 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_0e729126d8b9_4 | 584661b4706c307d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Shift/LimbSpec.lean | LimbSpec | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "shr_phase_c_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 86,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Address arithmetic\n have hc1 : ((base + 4 : Word) + 4) + signExtend13 92 = e1 := by\n rw [show (base + 4 :... | [
{
"name": "shr_cascade_step_spec_within",
"text": "/-- Cascade step: ADDI x10,x0,k followed by BEQ x5,x10,off.\n Produces a cpsBranchWithin with clean postconditions (no pure facts).\n Uses disjoint composition of the two singleton CRs. -/\ntheorem shr_cascade_step_spec_within (v5 v10 : Word)\n (k ... | [
{
"name": "shr_phase_c_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 103,
"n_chars": 5622,
"n_subproofs": 19,
"n_tactics": 78,
"cyclomatic": 4,
"n_automation": 16,
"n_rewrites": 11,
"n_structural": 14,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.Shift.LimbSpec
CPS specifications for the 256-bit EVM SHR (logical shift right) program (64-bit).
Modern CodeReq-based approach.
Modular decomposition:
- Per-limb helpers: shr_merge_limb_spec (7 instrs), shr_last_limb_spec (3 instrs)
- Zero path: shr_zero_path_spec (5 instrs, shift >= 256)... | /-
EvmAsm.Evm64.Shift.LimbSpec
CPS specifications for the 256-bit EVM SHR (logical shift right) program (64-bit).
Modern CodeReq-based approach.
Modular decomposition:
- Per-limb helpers: shr_merge_limb_spec (7 instrs), shr_last_limb_spec (3 instrs)
- Zero path: shr_zero_path_spec (5 instrs, shift >= 256)... | @@ -71,6 +71,58 @@
abbrev shr_cascade_step_code (k : BitVec 12) (offset : BitVec 13) (base : Word) : CodeReq :=
CodeReq.ofProg base (shr_cascade_step_prog k offset)
+/-- Cascade step: ADDI x10,x0,k followed by BEQ x5,x10,off.
+ Produces a cpsBranchWithin with clean postconditions (no pure facts).
+ Uses dis... | {
"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_0e729126d8b9_5 | 63f5b5befec914e2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Shift/LimbSpec.lean | LimbSpec | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "shr_phase_c_spec_pure_within",
"depth": 1,
"n_commands": 0,
"n_lines": 114,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hc1 : ((base + 4 : Word) + 4) + signExtend13 92 = e1 := by\n rw [show (base + 4 : Word) + 4 = base +... | [
{
"name": "shr_cascade_step_spec_pure_within",
"text": "/-- Cascade step variant that preserves pure dispatch facts.\n Taken postcondition includes `⌜v5 = kVal⌝`, not-taken includes `⌜v5 ≠ kVal⌝`. -/\ntheorem shr_cascade_step_spec_pure_within (v5 v10 : Word)\n (k : BitVec 12) (offset : BitVec 13) (bas... | [
{
"name": "shr_phase_c_spec_pure_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 138,
"n_chars": 8584,
"n_subproofs": 28,
"n_tactics": 99,
"cyclomatic": 3,
"n_automation": 4,
"n_rewrites": 16,
"n_structural": 11,
"automation_only": fal... | 1 | /-
EvmAsm.Evm64.Shift.LimbSpec
CPS specifications for the 256-bit EVM SHR (logical shift right) program (64-bit).
Modern CodeReq-based approach.
Modular decomposition:
- Per-limb helpers: shr_merge_limb_spec (7 instrs), shr_last_limb_spec (3 instrs)
- Zero path: shr_zero_path_spec (5 instrs, shift >= 256)... | /-
EvmAsm.Evm64.Shift.LimbSpec
CPS specifications for the 256-bit EVM SHR (logical shift right) program (64-bit).
Modern CodeReq-based approach.
Modular decomposition:
- Per-limb helpers: shr_merge_limb_spec (7 instrs), shr_last_limb_spec (3 instrs)
- Zero path: shr_zero_path_spec (5 instrs, shift >= 256)... | @@ -71,6 +71,48 @@
abbrev shr_cascade_step_code (k : BitVec 12) (offset : BitVec 13) (base : Word) : CodeReq :=
CodeReq.ofProg base (shr_cascade_step_prog k offset)
+/-- Cascade step variant that preserves pure dispatch facts.
+ Taken postcondition includes `⌜v5 = kVal⌝`, not-taken includes `⌜v5 ≠ kVal⌝`. -/
+... | {
"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_0e729126d8b9_6 | 930c64923bdeac0c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Shift/LimbSpec.lean | LimbSpec | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "shr_phase_a_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 238,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Address arithmetic\n have ha48 : (base + 4 : Word) + 8 = base + 12 := by bv_omega\n have ha128 : (base + 12 ... | [
{
"name": "shr_ld_or_acc_spec_within",
"text": "theorem shr_ld_or_acc_spec_within (sp acc prev_x10 val : Word) (off : BitVec 12)\n (base : Word) :\n let code := shr_ld_or_acc_code off base\n cpsTripleWithin 2 base (base + 8) code\n ((.x12 ↦ᵣ sp) ** (.x5 ↦ᵣ acc) ** (.x10 ↦ᵣ prev_x10) ** ((sp + ... | [
{
"name": "shr_phase_a_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 259,
"n_chars": 14254,
"n_subproofs": 44,
"n_tactics": 195,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 15,
"n_structural": 5,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.Shift.LimbSpec
CPS specifications for the 256-bit EVM SHR (logical shift right) program (64-bit).
Modern CodeReq-based approach.
Modular decomposition:
- Per-limb helpers: shr_merge_limb_spec (7 instrs), shr_last_limb_spec (3 instrs)
- Zero path: shr_zero_path_spec (5 instrs, shift >= 256)... | /-
EvmAsm.Evm64.Shift.LimbSpec
CPS specifications for the 256-bit EVM SHR (logical shift right) program (64-bit).
Modern CodeReq-based approach.
Modular decomposition:
- Per-limb helpers: shr_merge_limb_spec (7 instrs), shr_last_limb_spec (3 instrs)
- Zero path: shr_zero_path_spec (5 instrs, shift >= 256)... | @@ -56,6 +56,22 @@
abbrev shr_ld_or_acc_code (off : BitVec 12) (base : Word) : CodeReq :=
CodeReq.ofProg base (shr_ld_or_acc_prog off)
+theorem shr_ld_or_acc_spec_within (sp acc prev_x10 val : Word) (off : BitVec 12)
+ (base : Word) :
+ let code := shr_ld_or_acc_code off base
+ cpsTripleWithin 2 base (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_96b8489a888d_0 | abcc59482f790ee5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Bls12PairingPrecompileResultBridge.lean | Bls12PairingPrecompileResultBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "pairingOutputBytes_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [pairingOutputBytes, zeroPad31_length]",
"n_chars": 49,
"n_subproofs": 0,
"n_tactics": 2,
"c... | [
{
"name": "zeroPad31_length",
"text": "theorem zeroPad31_length : zeroPad31.length = 31 := by\n simp [zeroPad31]\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 75,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
... | [
{
"name": "pairingOutputBytes_length",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 153,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"ma... | 1 | /-
EvmAsm.EL.Bls12PairingPrecompileResultBridge
Bridge from BLS12-381 pairing accelerator ECALL results to EVM precompile results.
Authored by @pirapira; implemented by Codex.
-/
import EvmAsm.EL.Bls12PairingEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Bls12PairingPrecompile... | /-
EvmAsm.EL.Bls12PairingPrecompileResultBridge
Bridge from BLS12-381 pairing accelerator ECALL results to EVM precompile results.
Authored by @pirapira; implemented by Codex.
-/
import EvmAsm.EL.Bls12PairingEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Bls12PairingPrecompile... | @@ -38,8 +38,12 @@
def gasRemainingAfterCost (input : EvmAsm.Evm64.PrecompileInput) (cost : Nat) : Nat :=
input.gas - cost
+theorem zeroPad31_length : zeroPad31.length = 31 := by
+ simp [zeroPad31]
+
theorem pairingOutputBytes_length (verified : Bool) :
- (pairingOutputBytes verified).length = 32 := sorry
+ ... | {
"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_96b8489a888d_1 | 376c9e71d6746b38 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Bls12PairingPrecompileResultBridge.lean | Bls12PairingPrecompileResultBridge | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "outputBytesFromResult_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [outputBytesFromResult, pairingOutputBytes_length]",
"n_chars": 61,
"n_subproofs": 0,
"n_tact... | [
{
"name": "pairingOutputBytes_length",
"text": "theorem pairingOutputBytes_length (verified : Bool) :\n (pairingOutputBytes verified).length = 32 := by\n simp [pairingOutputBytes, zeroPad31_length]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 153,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "outputBytesFromResult_length",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 6,
"n_chars": 209,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 2 | /-
EvmAsm.EL.Bls12PairingPrecompileResultBridge
Bridge from BLS12-381 pairing accelerator ECALL results to EVM precompile results.
Authored by @pirapira; implemented by Codex.
-/
import EvmAsm.EL.Bls12PairingEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Bls12PairingPrecompile... | /-
EvmAsm.EL.Bls12PairingPrecompileResultBridge
Bridge from BLS12-381 pairing accelerator ECALL results to EVM precompile results.
Authored by @pirapira; implemented by Codex.
-/
import EvmAsm.EL.Bls12PairingEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Bls12PairingPrecompile... | @@ -41,9 +41,14 @@
theorem zeroPad31_length : zeroPad31.length = 31 := by
simp [zeroPad31]
+theorem pairingOutputBytes_length (verified : Bool) :
+ (pairingOutputBytes verified).length = 32 := by
+ simp [pairingOutputBytes, zeroPad31_length]
+
theorem outputBytesFromResult_length
(result : Bls12PairingE... | {
"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_96b8489a888d_2 | be9abf2994985af0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Bls12PairingPrecompileResultBridge.lean | Bls12PairingPrecompileResultBridge | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "fromPairingResult_output_length",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [fromPairingResult_eok h_status]\n simp [outputBytesFromResult_length]",
"n_chars": 79,
"n_subp... | [
{
"name": "outputBytesFromResult_length",
"text": "theorem outputBytesFromResult_length\n (result : Bls12PairingEcallBridge.Bls12PairingResult) :\n (outputBytesFromResult result).length = 32 := by\n simp [outputBytesFromResult, pairingOutputBytes_length]\n\n",
"fan_in": 1,
"n_lines": 6,
"... | [
{
"name": "fromPairingResult_output_length",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 305,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 4 | /-
EvmAsm.EL.Bls12PairingPrecompileResultBridge
Bridge from BLS12-381 pairing accelerator ECALL results to EVM precompile results.
Authored by @pirapira; implemented by Codex.
-/
import EvmAsm.EL.Bls12PairingEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Bls12PairingPrecompile... | /-
EvmAsm.EL.Bls12PairingPrecompileResultBridge
Bridge from BLS12-381 pairing accelerator ECALL results to EVM precompile results.
Authored by @pirapira; implemented by Codex.
-/
import EvmAsm.EL.Bls12PairingEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Bls12PairingPrecompile... | @@ -45,6 +45,11 @@
(pairingOutputBytes verified).length = 32 := by
simp [pairingOutputBytes, zeroPad31_length]
+theorem outputBytesFromResult_length
+ (result : Bls12PairingEcallBridge.Bls12PairingResult) :
+ (outputBytesFromResult result).length = 32 := by
+ simp [outputBytesFromResult, pairingOutputB... | {
"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_96b8489a888d_3 | 5ee9c034419f1bcb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Bls12PairingPrecompileResultBridge.lean | Bls12PairingPrecompileResultBridge | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "fromPairingResult_failure_output_length",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [fromPairingResult_efail h_status]\n rfl",
"n_chars": 49,
"n_subproofs": 0,
"n_tact... | [
{
"name": "fromPairingResult_efail",
"text": "theorem fromPairingResult_efail\n {gasRemaining : Nat} {result : Bls12PairingEcallBridge.Bls12PairingResult}\n (h_status : result.status = .efail) :\n fromPairingResult gasRemaining result = EvmAsm.Evm64.PrecompileResult.fail gasRemaining := by\n simp ... | [
{
"name": "fromPairingResult_failure_output_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 292,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only":... | 1 | /-
EvmAsm.EL.Bls12PairingPrecompileResultBridge
Bridge from BLS12-381 pairing accelerator ECALL results to EVM precompile results.
Authored by @pirapira; implemented by Codex.
-/
import EvmAsm.EL.Bls12PairingEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Bls12PairingPrecompile... | /-
EvmAsm.EL.Bls12PairingPrecompileResultBridge
Bridge from BLS12-381 pairing accelerator ECALL results to EVM precompile results.
Authored by @pirapira; implemented by Codex.
-/
import EvmAsm.EL.Bls12PairingEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Bls12PairingPrecompile... | @@ -38,10 +38,18 @@
def gasRemainingAfterCost (input : EvmAsm.Evm64.PrecompileInput) (cost : Nat) : Nat :=
input.gas - cost
+theorem fromPairingResult_efail
+ {gasRemaining : Nat} {result : Bls12PairingEcallBridge.Bls12PairingResult}
+ (h_status : result.status = .efail) :
+ fromPairingResult gasRemainin... | {
"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_10f387951158_0 | ddbeab1a38b3e693 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedExpResidual.lean | SavedBitFixedExpResidual | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "expTwoMulFixedExpResidual_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n match b with\n | 0 =>\n rw [expTwoMulFixedExpResidual_zero_unfold]; pcFree\n | 1 =>\n rw [expTwoMu... | [
{
"name": "expTwoMulFixedExpResidual_zero_unfold",
"text": "theorem expTwoMulFixedExpResidual_zero_unfold\n {ptr lookahead : Word} {exponentWord : EvmWord} :\n expTwoMulFixedExpResidual 0 ptr lookahead exponentWord =\n ((((ptr + signExtend12 (-8 : BitVec 12)) + signExtend12 (0 : BitVec 12)) ↦ₘ\n ... | [
{
"name": "expTwoMulFixedExpResidual_pcFree",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 398,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": fals... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedExpResidual
The exponent residual `ExpResidual` carried (as a framed pcFree assertion)
by the merged-loop induction: the not-yet-loaded limb cells strictly below
the loop pointer `x16 = ptr`, organized by block `b = k / 64`.
Within a block the pointer `x16` is consta... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedExpResidual
The exponent residual `ExpResidual` carried (as a framed pcFree assertion)
by the merged-loop induction: the not-yet-loaded limb cells strictly below
the loop pointer `x16 = ptr`, organized by block `b = k / 64`.
Within a block the pointer `x16` is consta... | @@ -55,6 +55,16 @@
exponentWord.getLimbN 0)
| _ => empAssertion
+theorem expTwoMulFixedExpResidual_zero_unfold
+ {ptr lookahead : Word} {exponentWord : EvmWord} :
+ expTwoMulFixedExpResidual 0 ptr lookahead exponentWord =
+ ((((ptr + signExtend12 (-8 : BitVec 12)) + signExtend12 (0 : BitVec 12)... | {
"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_10f387951158_1 | 9bc387439c481a41 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedExpResidual.lean | SavedBitFixedExpResidual | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "expTwoMulFixedExpResidual_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n match b with\n | 0 =>\n rw [expTwoMulFixedExpResidual_zero_unfold]; pcFree\n | 1 =>\n rw [expTwoMu... | [
{
"name": "expTwoMulFixedExpResidual_zero_unfold",
"text": "theorem expTwoMulFixedExpResidual_zero_unfold\n {ptr lookahead : Word} {exponentWord : EvmWord} :\n expTwoMulFixedExpResidual 0 ptr lookahead exponentWord =\n ((((ptr + signExtend12 (-8 : BitVec 12)) + signExtend12 (0 : BitVec 12)) ↦ₘ\n ... | [
{
"name": "expTwoMulFixedExpResidual_succ_zero",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 16,
"n_chars": 863,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fa... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedExpResidual
The exponent residual `ExpResidual` carried (as a framed pcFree assertion)
by the merged-loop induction: the not-yet-loaded limb cells strictly below
the loop pointer `x16 = ptr`, organized by block `b = k / 64`.
Within a block the pointer `x16` is consta... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedExpResidual
The exponent residual `ExpResidual` carried (as a framed pcFree assertion)
by the merged-loop induction: the not-yet-loaded limb cells strictly below
the loop pointer `x16 = ptr`, organized by block `b = k / 64`.
Within a block the pointer `x16` is consta... | @@ -55,6 +55,16 @@
exponentWord.getLimbN 0)
| _ => empAssertion
+theorem expTwoMulFixedExpResidual_zero_unfold
+ {ptr lookahead : Word} {exponentWord : EvmWord} :
+ expTwoMulFixedExpResidual 0 ptr lookahead exponentWord =
+ ((((ptr + signExtend12 (-8 : BitVec 12)) + signExtend12 (0 : BitVec 12)... | {
"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_10f387951158_2 | 94e032c4a50405b0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedExpResidual.lean | SavedBitFixedExpResidual | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 3 | [
{
"theorem_name": "expTwoMulFixedExpResidual_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n match b with\n | 0 =>\n rw [expTwoMulFixedExpResidual_zero_unfold]; pcFree\n | 1 =>\n rw [expTwoMu... | [
{
"name": "expTwoMulFixedExpResidual_one_unfold",
"text": "theorem expTwoMulFixedExpResidual_one_unfold\n {ptr lookahead : Word} {exponentWord : EvmWord} :\n expTwoMulFixedExpResidual 1 ptr lookahead exponentWord =\n (((ptr + signExtend12 (-8 : BitVec 12)) + signExtend12 (0 : BitVec 12)) ↦ₘ\n ... | [
{
"name": "expTwoMulFixedExpResidual_succ_one",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 655,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fal... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedExpResidual
The exponent residual `ExpResidual` carried (as a framed pcFree assertion)
by the merged-loop induction: the not-yet-loaded limb cells strictly below
the loop pointer `x16 = ptr`, organized by block `b = k / 64`.
Within a block the pointer `x16` is consta... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedExpResidual
The exponent residual `ExpResidual` carried (as a framed pcFree assertion)
by the merged-loop induction: the not-yet-loaded limb cells strictly below
the loop pointer `x16 = ptr`, organized by block `b = k / 64`.
Within a block the pointer `x16` is consta... | @@ -65,6 +65,14 @@
delta expTwoMulFixedExpResidual
rfl
+theorem expTwoMulFixedExpResidual_one_unfold
+ {ptr lookahead : Word} {exponentWord : EvmWord} :
+ expTwoMulFixedExpResidual 1 ptr lookahead exponentWord =
+ (((ptr + signExtend12 (-8 : BitVec 12)) + signExtend12 (0 : BitVec 12)) ↦ₘ
+ e... | {
"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_6bbcf43b6124_0 | 0b1a8d1a32ad9a02 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bls12G2Zero192SAsm.lean | Bls12G2Zero192SAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "blsg2Zero192Fn_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 72,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbase : (blsg2Zero192Fn dst orig).rw.base = dst := rfl\n vcgen\n case region => exact ⟨Region.empty_wf, hwf⟩\n ... | [
{
"name": "zeroStepRf_get_x10",
"text": "theorem zeroStepRf_get_x10 (rf : RegFile) :\n (zeroStepRf rf).get .x10 = rf.get .x10 + signExtend12 (8 : BitVec 12) := by\n unfold zeroStepRf\n simp only [RegFile.get_set_self, RegFile.get_set_ne, ne_eq, reduceCtorEq,\n not_false_eq_true]\n\n",
"fan_in": ... | [
{
"name": "blsg2Zero192Fn_spec",
"fan_in": 0,
"n_deps_direct": 6,
"n_deps_transitive": 6,
"n_lines": 76,
"n_chars": 3793,
"n_subproofs": 7,
"n_tactics": 74,
"cyclomatic": 16,
"n_automation": 45,
"n_rewrites": 19,
"n_structural": 20,
"automation_only": false,
"... | 6 | /-
EvmAsm.Codegen.Programs.Bls12G2Zero192SAsm
Verified SAsm port of `blsg2_zero192`: zero the 192-byte BLS12-381 G2
point buffer at `a0`. The emitted routine is a bottom-test dword loop:
initialize `x5 = 24`, store a zero dword, advance `a0`, decrement `x5`, and
branch back while `x5 != 0`.
The postcondi... | /-
EvmAsm.Codegen.Programs.Bls12G2Zero192SAsm
Verified SAsm port of `blsg2_zero192`: zero the 192-byte BLS12-381 G2
point buffer at `a0`. The emitted routine is a bottom-test dword loop:
initialize `x5 = 24`, store a zero dword, advance `a0`, decrement `x5`, and
branch back while `x5 != 0`.
The postcondi... | @@ -74,6 +74,12 @@
let r1 := rf.set .x10 (rf.get .x10 + signExtend12 (8 : BitVec 12))
r1.set .x5 (r1.get .x5 + signExtend12 (-1 : BitVec 12))
+theorem zeroStepRf_get_x10 (rf : RegFile) :
+ (zeroStepRf rf).get .x10 = rf.get .x10 + signExtend12 (8 : BitVec 12) := by
+ unfold zeroStepRf
+ simp only [RegFile.g... | {
"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_669d126a25aa_0 | f0c2580517c01543 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DivN4SingleAddbackVal256.lean | DivN4SingleAddbackVal256 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "iterSingleAddback_val256_conservation_gen",
"depth": 1,
"n_commands": 0,
"n_lines": 43,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- ab top resolves to 0 (generalised, any uTop).\n have htop0 := addbackN4_single_top_zero_of_c... | [
{
"name": "single_addback_conservation_arith",
"text": "/-- The pure-`Nat` arithmetic core of the single-addback conservation, with the\n large val256 / mulsub / addback terms abstracted to opaque atoms (keeps the\n `omega` call small, away from the deeply nested BitVec terms). -/\nprivate theorem sin... | [
{
"name": "iterSingleAddback_val256_conservation_gen",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 87,
"n_chars": 4345,
"n_subproofs": 8,
"n_tactics": 39,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 5,
"n_structural": 1,
"automation_o... | 1 | /-
EvmAsm.Evm64.EvmWordArith.DivN4SingleAddbackVal256
U4-general single-addback value conservation for the n=4 double-addback iterate.
The carry≠0 branch of `iterWithDoubleAddback` performs a single corrective
addback, emitting quotient `qHat - 1` (= `qHat + signExtend12 4095`) and the
addback result limbs.... | /-
EvmAsm.Evm64.EvmWordArith.DivN4SingleAddbackVal256
U4-general single-addback value conservation for the n=4 double-addback iterate.
The carry≠0 branch of `iterWithDoubleAddback` performs a single corrective
addback, emitting quotient `qHat - 1` (= `qHat + signExtend12 4095`) and the
addback result limbs.... | @@ -27,6 +27,18 @@
open EvmWord EvmAsm.Rv64
+/-- The pure-`Nat` arithmetic core of the single-addback conservation, with the
+ large val256 / mulsub / addback terms abstracted to opaque atoms (keeps the
+ `omega` call small, away from the deeply nested BitVec terms). -/
+private theorem single_addback_conser... | {
"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_45b3cc7df121_0 | 71cede718e04b9f1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedMergedFramedStep.lean | SavedBitFixedMergedFramedStep | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "exp_two_mul_fixed_iter_merged_with_continuations_bounded_framed_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hLoop hExit\n exact\n cpsTripleWithin_mono_nSteps hB... | [
{
"name": "exp_two_mul_fixed_iter_merged_with_continuations_framed_spec_within",
"text": "/-- Merge one fixed x19 canonical appended-MUL EXP iteration with externally\n supplied continuations, with a pcFree frame `F` threaded through the body\n (read-only exponent), so the continuations see `… ** F`. ... | [
{
"name": "exp_two_mul_fixed_iter_merged_with_continuations_bounded_framed_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 40,
"n_chars": 1733,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedMergedFramedStep
Framed variant of the merged fixed-x19 EXP per-iteration step. The exponent
is read-only across the loop body, so an arbitrary pcFree frame `F` (used by
the residual induction to carry the not-yet-loaded exponent limb cells) can be
threaded through o... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedMergedFramedStep
Framed variant of the merged fixed-x19 EXP per-iteration step. The exponent
is read-only across the loop body, so an arbitrary pcFree frame `F` (used by
the residual induction to carry the not-yet-loaded exponent limb cells) can be
threaded through o... | @@ -17,6 +17,53 @@
open EvmAsm.Rv64
+/-- Merge one fixed x19 canonical appended-MUL EXP iteration with externally
+ supplied continuations, with a pcFree frame `F` threaded through the body
+ (read-only exponent), so the continuations see `… ** F`. -/
+theorem exp_two_mul_fixed_iter_merged_with_continuations... | {
"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_45b3cc7df121_1 | 2556c05c5903a569 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedMergedFramedStep.lean | SavedBitFixedMergedFramedStep | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "exp_two_mul_fixed_iter_merged_with_continuations_bounded_framed_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hLoop hExit\n exact\n cpsTripleWithin_mono_nSteps hB... | [
{
"name": "exp_two_mul_fixed_iter_merged_with_continuations_framed_spec_within",
"text": "/-- Merge one fixed x19 canonical appended-MUL EXP iteration with externally\n supplied continuations, with a pcFree frame `F` threaded through the body\n (read-only exponent), so the continuations see `… ** F`. ... | [
{
"name": "exp_two_mul_fixed_iterations_body_peel_with_continuations_closed_bound_framed_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 43,
"n_chars": 1809,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrit... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedMergedFramedStep
Framed variant of the merged fixed-x19 EXP per-iteration step. The exponent
is read-only across the loop body, so an arbitrary pcFree frame `F` (used by
the residual induction to carry the not-yet-loaded exponent limb cells) can be
threaded through o... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedMergedFramedStep
Framed variant of the merged fixed-x19 EXP per-iteration step. The exponent
is read-only across the loop body, so an arbitrary pcFree frame `F` (used by
the residual induction to carry the not-yet-loaded exponent limb cells) can be
threaded through o... | @@ -17,6 +17,53 @@
open EvmAsm.Rv64
+/-- Merge one fixed x19 canonical appended-MUL EXP iteration with externally
+ supplied continuations, with a pcFree frame `F` threaded through the body
+ (read-only exponent), so the continuations see `… ** F`. -/
+theorem exp_two_mul_fixed_iter_merged_with_continuations... | {
"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_45b3cc7df121_2 | 48e223b2e92fb9ae | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedMergedFramedStep.lean | SavedBitFixedMergedFramedStep | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "exp_two_mul_fixed_iterations_body_peel_with_continuations_closed_bound_framed_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hLoop hExit\n rw [← expTwoMulFixedIterati... | [
{
"name": "exp_two_mul_fixed_iter_merged_with_continuations_bounded_framed_spec_within",
"text": "/-- Bounded framed merge (max of loop/exit bounds). -/\ntheorem exp_two_mul_fixed_iter_merged_with_continuations_bounded_framed_spec_within\n {nLoop nExit nBound : Nat} {exit_ : Word} {R F : Assertion}\n ... | [
{
"name": "exp_fixed_loop_body_succ_step_framed",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 41,
"n_chars": 1685,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only":... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedMergedFramedStep
Framed variant of the merged fixed-x19 EXP per-iteration step. The exponent
is read-only across the loop body, so an arbitrary pcFree frame `F` (used by
the residual induction to carry the not-yet-loaded exponent limb cells) can be
threaded through o... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedMergedFramedStep
Framed variant of the merged fixed-x19 EXP per-iteration step. The exponent
is read-only across the loop body, so an arbitrary pcFree frame `F` (used by
the residual induction to carry the not-yet-loaded exponent limb cells) can be
threaded through o... | @@ -64,6 +64,45 @@
| head => exact hExit
| tail _ hnil => cases hnil
+/-- Bounded framed merge (max of loop/exit bounds). -/
+theorem exp_two_mul_fixed_iter_merged_with_continuations_bounded_framed_spec_within
+ {nLoop nExit nBound : Nat} {exit_ : Word} {R F : Assertion}
+ (e c6 iterCount v10 v18 ... | {
"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_45b3cc7df121_3 | 454985ab3cf18a3c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedMergedFramedStep.lean | SavedBitFixedMergedFramedStep | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "exp_two_mul_fixed_iterations_body_peel_with_continuations_closed_bound_framed_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hLoop hExit\n rw [← expTwoMulFixedIterati... | [
{
"name": "exp_two_mul_fixed_iter_merged_with_continuations_bounded_framed_spec_within",
"text": "/-- Bounded framed merge (max of loop/exit bounds). -/\ntheorem exp_two_mul_fixed_iter_merged_with_continuations_bounded_framed_spec_within\n {nLoop nExit nBound : Nat} {exit_ : Word} {R F : Assertion}\n ... | [
{
"name": "exp_fixed_loop_body_final_succ_step_framed",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 33,
"n_chars": 1325,
"n_subproofs": 2,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_... | 4 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedMergedFramedStep
Framed variant of the merged fixed-x19 EXP per-iteration step. The exponent
is read-only across the loop body, so an arbitrary pcFree frame `F` (used by
the residual induction to carry the not-yet-loaded exponent limb cells) can be
threaded through o... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedMergedFramedStep
Framed variant of the merged fixed-x19 EXP per-iteration step. The exponent
is read-only across the loop body, so an arbitrary pcFree frame `F` (used by
the residual induction to carry the not-yet-loaded exponent limb cells) can be
threaded through o... | @@ -64,6 +64,45 @@
| head => exact hExit
| tail _ hnil => cases hnil
+/-- Bounded framed merge (max of loop/exit bounds). -/
+theorem exp_two_mul_fixed_iter_merged_with_continuations_bounded_framed_spec_within
+ {nLoop nExit nBound : Nat} {exit_ : Word} {R F : Assertion}
+ (e c6 iterCount v10 v18 ... | {
"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_45b3cc7df121_4 | 3a7eecd2fa07fbec | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedMergedFramedStep.lean | SavedBitFixedMergedFramedStep | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "exp_two_mul_fixed_iter_merged_with_continuations_bounded_framed_spec_within_bodyonly",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hLoop hExit\n exact\n cpsTripleWithin_mono_... | [
{
"name": "exp_two_mul_fixed_iter_merged_with_continuations_framed_spec_within_bodyonly",
"text": "/-- Body-only-code-req twins of the framed merged-step chain (path A, bug fjivz). -/\ntheorem exp_two_mul_fixed_iter_merged_with_continuations_framed_spec_within_bodyonly\n {nCont : Nat} {exit_ : Word} {R F... | [
{
"name": "exp_two_mul_fixed_iter_merged_with_continuations_bounded_framed_spec_within_bodyonly",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 40,
"n_chars": 1778,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": ... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedMergedFramedStep
Framed variant of the merged fixed-x19 EXP per-iteration step. The exponent
is read-only across the loop body, so an arbitrary pcFree frame `F` (used by
the residual induction to carry the not-yet-loaded exponent limb cells) can be
threaded through o... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedMergedFramedStep
Framed variant of the merged fixed-x19 EXP per-iteration step. The exponent
is read-only across the loop body, so an arbitrary pcFree frame `F` (used by
the residual induction to carry the not-yet-loaded exponent limb cells) can be
threaded through o... | @@ -17,6 +17,51 @@
open EvmAsm.Rv64
+/-- Body-only-code-req twins of the framed merged-step chain (path A, bug fjivz). -/
+theorem exp_two_mul_fixed_iter_merged_with_continuations_framed_spec_within_bodyonly
+ {nCont : Nat} {exit_ : Word} {R F : Assertion}
+ (e c6 iterCount v10 v18 ptr nextLimb sp evmSp tOld... | {
"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_45b3cc7df121_5 | c090d982cb9a8a7f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedMergedFramedStep.lean | SavedBitFixedMergedFramedStep | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "exp_two_mul_fixed_iter_merged_with_continuations_bounded_framed_spec_within_bodyonly",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hLoop hExit\n exact\n cpsTripleWithin_mono_... | [
{
"name": "exp_two_mul_fixed_iter_merged_with_continuations_framed_spec_within_bodyonly",
"text": "/-- Body-only-code-req twins of the framed merged-step chain (path A, bug fjivz). -/\ntheorem exp_two_mul_fixed_iter_merged_with_continuations_framed_spec_within_bodyonly\n {nCont : Nat} {exit_ : Word} {R F... | [
{
"name": "exp_two_mul_fixed_iterations_body_peel_with_continuations_closed_bound_framed_spec_within_bodyonly",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 43,
"n_chars": 1854,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 0,
... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedMergedFramedStep
Framed variant of the merged fixed-x19 EXP per-iteration step. The exponent
is read-only across the loop body, so an arbitrary pcFree frame `F` (used by
the residual induction to carry the not-yet-loaded exponent limb cells) can be
threaded through o... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedMergedFramedStep
Framed variant of the merged fixed-x19 EXP per-iteration step. The exponent
is read-only across the loop body, so an arbitrary pcFree frame `F` (used by
the residual induction to carry the not-yet-loaded exponent limb cells) can be
threaded through o... | @@ -17,6 +17,51 @@
open EvmAsm.Rv64
+/-- Body-only-code-req twins of the framed merged-step chain (path A, bug fjivz). -/
+theorem exp_two_mul_fixed_iter_merged_with_continuations_framed_spec_within_bodyonly
+ {nCont : Nat} {exit_ : Word} {R F : Assertion}
+ (e c6 iterCount v10 v18 ptr nextLimb sp evmSp tOld... | {
"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_45b3cc7df121_6 | a3295179b87e673b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedMergedFramedStep.lean | SavedBitFixedMergedFramedStep | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "exp_two_mul_fixed_iterations_body_peel_with_continuations_closed_bound_framed_spec_within_bodyonly",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hLoop hExit\n rw [← expTwoMulFix... | [
{
"name": "exp_two_mul_fixed_iter_merged_with_continuations_bounded_framed_spec_within_bodyonly",
"text": "/-- Bounded framed merge (max of loop/exit bounds). -/\ntheorem exp_two_mul_fixed_iter_merged_with_continuations_bounded_framed_spec_within_bodyonly\n {nLoop nExit nBound : Nat} {exit_ : Word} {R F ... | [
{
"name": "exp_fixed_loop_body_succ_step_framed_bodyonly",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 41,
"n_chars": 1721,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automati... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedMergedFramedStep
Framed variant of the merged fixed-x19 EXP per-iteration step. The exponent
is read-only across the loop body, so an arbitrary pcFree frame `F` (used by
the residual induction to carry the not-yet-loaded exponent limb cells) can be
threaded through o... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedMergedFramedStep
Framed variant of the merged fixed-x19 EXP per-iteration step. The exponent
is read-only across the loop body, so an arbitrary pcFree frame `F` (used by
the residual induction to carry the not-yet-loaded exponent limb cells) can be
threaded through o... | @@ -62,6 +62,45 @@
| head => exact hExit
| tail _ hnil => cases hnil
+/-- Bounded framed merge (max of loop/exit bounds). -/
+theorem exp_two_mul_fixed_iter_merged_with_continuations_bounded_framed_spec_within_bodyonly
+ {nLoop nExit nBound : Nat} {exit_ : Word} {R F : Assertion}
+ (e c6 iterCount... | {
"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_45b3cc7df121_7 | 69a752b2aba9c313 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedMergedFramedStep.lean | SavedBitFixedMergedFramedStep | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "exp_two_mul_fixed_iterations_body_peel_with_continuations_closed_bound_framed_spec_within_bodyonly",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hLoop hExit\n rw [← expTwoMulFix... | [
{
"name": "exp_two_mul_fixed_iter_merged_with_continuations_bounded_framed_spec_within_bodyonly",
"text": "/-- Bounded framed merge (max of loop/exit bounds). -/\ntheorem exp_two_mul_fixed_iter_merged_with_continuations_bounded_framed_spec_within_bodyonly\n {nLoop nExit nBound : Nat} {exit_ : Word} {R F ... | [
{
"name": "exp_fixed_loop_body_final_succ_step_framed_bodyonly",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 32,
"n_chars": 1351,
"n_subproofs": 2,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"au... | 4 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedMergedFramedStep
Framed variant of the merged fixed-x19 EXP per-iteration step. The exponent
is read-only across the loop body, so an arbitrary pcFree frame `F` (used by
the residual induction to carry the not-yet-loaded exponent limb cells) can be
threaded through o... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedMergedFramedStep
Framed variant of the merged fixed-x19 EXP per-iteration step. The exponent
is read-only across the loop body, so an arbitrary pcFree frame `F` (used by
the residual induction to carry the not-yet-loaded exponent limb cells) can be
threaded through o... | @@ -62,6 +62,45 @@
| head => exact hExit
| tail _ hnil => cases hnil
+/-- Bounded framed merge (max of loop/exit bounds). -/
+theorem exp_two_mul_fixed_iter_merged_with_continuations_bounded_framed_spec_within_bodyonly
+ {nLoop nExit nBound : Nat} {exit_ : Word} {R F : Assertion}
+ (e c6 iterCount... | {
"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_57fda16f3573_0 | 4af5d2288c072059 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Bls12MapFpToG1ResultBridge.lean | Bls12MapFpToG1ResultBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "acceleratorOutput_point_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n g1PointBytesList_length output.point",
"n_chars": 39,
"n_subproofs": 0,
"n_tactics": 1,
"cyclom... | [
{
"name": "g1PointBytesList_length",
"text": "theorem g1PointBytesList_length (point : G1PointBytes) :\n (g1PointBytesList point).length = 96 := by\n simp [g1PointBytesList]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 131,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n... | [
{
"name": "acceleratorOutput_point_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 161,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.EL.Bls12MapFpToG1ResultBridge
Bridge from the `zkvm_bls12_map_fp_to_g1` accelerator output to the executable
precompile-result surface.
-/
import EvmAsm.Evm64.Accelerators.Status
import EvmAsm.EL.WorldState
namespace EvmAsm.EL
namespace Bls12MapFpToG1ResultBridge
abbrev ZkvmStatus := EvmAsm.Acceler... | /-
EvmAsm.EL.Bls12MapFpToG1ResultBridge
Bridge from the `zkvm_bls12_map_fp_to_g1` accelerator output to the executable
precompile-result surface.
-/
import EvmAsm.Evm64.Accelerators.Status
import EvmAsm.EL.WorldState
namespace EvmAsm.EL
namespace Bls12MapFpToG1ResultBridge
abbrev ZkvmStatus := EvmAsm.Acceler... | @@ -29,8 +29,13 @@
def g1PointBytesList (point : G1PointBytes) : List Byte :=
List.ofFn point
+theorem g1PointBytesList_length (point : G1PointBytes) :
+ (g1PointBytesList point).length = 96 := by
+ simp [g1PointBytesList]
+
theorem acceleratorOutput_point_length (output : AcceleratorOutput) :
- (g1PointB... | {
"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_5d36e4c0d786_0 | 0af6500e28e563e4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedLoopInvariantWithControl.lean | SavedBitFixedLoopInvariantWithControl | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 5 | [
{
"theorem_name": "expTwoMulFixedIterPreNWithControl_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterPreNWithControl_unfold]\n pcFree",
"n_chars": 60,
"n_subproofs": 0,... | [
{
"name": "expTwoMulFixedIterPreNWithControl_unfold",
"text": "theorem expTwoMulFixedIterPreNWithControl_unfold\n {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}\n {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld\n r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3\n ... | [
{
"name": "expTwoMulFixedIterPreNWithControl_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 534,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
Relaxed fixed-loop invariant preconditions that separate the semantic
control counter from the machine x6 scratch register.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- F... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
Relaxed fixed-loop invariant preconditions that separate the semantic
control counter from the machine x6 scratch register.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- F... | @@ -32,6 +32,24 @@
expTwoMulFixedCursorAssertion exponentWord k e **
expTwoMulFixedControlAssertion exponentWord k controlC6 ptr nextLimb evmSp
+theorem expTwoMulFixedIterPreNWithControl_unfold
+ {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}
+ {e machineC6 iterCount v10 v18 ptr nextLimb s... | {
"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_5d36e4c0d786_1 | ce4706cebc3f753e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedLoopInvariantWithControl.lean | SavedBitFixedLoopInvariantWithControl | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 5 | [
{
"theorem_name": "expTwoMulFixedIterPreNWithControlFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterPreNWithControlFrame_unfold]\n pcFree",
"n_chars": 65,
"n_subp... | [
{
"name": "expTwoMulFixedIterPreNWithControlFrame_unfold",
"text": "theorem expTwoMulFixedIterPreNWithControlFrame_unfold\n {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}\n {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld\n r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a... | [
{
"name": "expTwoMulFixedIterPreNWithControlFrame_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 610,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
Relaxed fixed-loop invariant preconditions that separate the semantic
control counter from the machine x6 scratch register.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- F... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
Relaxed fixed-loop invariant preconditions that separate the semantic
control counter from the machine x6 scratch register.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- F... | @@ -86,6 +86,23 @@
r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3 v7 v11 **
frame
+theorem expTwoMulFixedIterPreNWithControlFrame_unfold
+ {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}
+ {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld
+ r0 r1 r2 r3 d0 d1 d2 d3 e0 e1... | {
"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_5d36e4c0d786_2 | 269474a48cf94700 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedLoopInvariantWithControl.lean | SavedBitFixedLoopInvariantWithControl | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 5 | [
{
"theorem_name": "expTwoMulFixedIterPreNWithControl_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterPreNWithControl_unfold]\n pcFree",
"n_chars": 60,
"n_subproofs": 0,... | [
{
"name": "expTwoMulFixedIterPreNWithControl_unfold",
"text": "theorem expTwoMulFixedIterPreNWithControl_unfold\n {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}\n {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld\n r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3\n ... | [
{
"name": "expTwoMulFixedIterPreNWithControlFrame_pures",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 30,
"n_chars": 1506,
"n_subproofs": 4,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 5,
"automatio... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
Relaxed fixed-loop invariant preconditions that separate the semantic
control counter from the machine x6 scratch register.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- F... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
Relaxed fixed-loop invariant preconditions that separate the semantic
control counter from the machine x6 scratch register.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- F... | @@ -32,6 +32,24 @@
expTwoMulFixedCursorAssertion exponentWord k e **
expTwoMulFixedControlAssertion exponentWord k controlC6 ptr nextLimb evmSp
+theorem expTwoMulFixedIterPreNWithControl_unfold
+ {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}
+ {e machineC6 iterCount v10 v18 ptr nextLimb s... | {
"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_5d36e4c0d786_3 | 0294e8f5544a888d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedLoopInvariantWithControl.lean | SavedBitFixedLoopInvariantWithControl | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 5 | [
{
"theorem_name": "expTwoMulFixedIterPreNWithControl_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterPreNWithControl_unfold]\n pcFree",
"n_chars": 60,
"n_subproofs": 0,... | [
{
"name": "expTwoMulFixedIterPreNWithControl_unfold",
"text": "theorem expTwoMulFixedIterPreNWithControl_unfold\n {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}\n {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld\n r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3\n ... | [
{
"name": "expTwoMulFixedIterPreNWithControlFrame_to_iterPre_frame",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 29,
"n_chars": 1256,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 2,
... | 4 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
Relaxed fixed-loop invariant preconditions that separate the semantic
control counter from the machine x6 scratch register.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- F... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
Relaxed fixed-loop invariant preconditions that separate the semantic
control counter from the machine x6 scratch register.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- F... | @@ -32,6 +32,24 @@
expTwoMulFixedCursorAssertion exponentWord k e **
expTwoMulFixedControlAssertion exponentWord k controlC6 ptr nextLimb evmSp
+theorem expTwoMulFixedIterPreNWithControl_unfold
+ {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}
+ {e machineC6 iterCount v10 v18 ptr nextLimb s... | {
"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_5d36e4c0d786_4 | 7f447e9c99ca5bdb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedLoopInvariantWithControl.lean | SavedBitFixedLoopInvariantWithControl | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 5 | [
{
"theorem_name": "expTwoMulFixedIterPreNWithControl_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterPreNWithControl_unfold]\n pcFree",
"n_chars": 60,
"n_subproofs": 0,... | [
{
"name": "expTwoMulFixedIterPreNWithControl_unfold",
"text": "theorem expTwoMulFixedIterPreNWithControl_unfold\n {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}\n {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld\n r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3\n ... | [
{
"name": "expTwoMulFixedIterPreNWithControlFrame_to_iterPreN_frame_of_control_eq_machine",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 24,
"n_chars": 1051,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
Relaxed fixed-loop invariant preconditions that separate the semantic
control counter from the machine x6 scratch register.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- F... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
Relaxed fixed-loop invariant preconditions that separate the semantic
control counter from the machine x6 scratch register.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- F... | @@ -32,6 +32,24 @@
expTwoMulFixedCursorAssertion exponentWord k e **
expTwoMulFixedControlAssertion exponentWord k controlC6 ptr nextLimb evmSp
+theorem expTwoMulFixedIterPreNWithControl_unfold
+ {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}
+ {e machineC6 iterCount v10 v18 ptr nextLimb s... | {
"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_5d36e4c0d786_5 | 41a55b556f733dcb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedLoopInvariantWithControl.lean | SavedBitFixedLoopInvariantWithControl | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 5 | [
{
"theorem_name": "expTwoMulFixedIterPreNWithControl_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterPreNWithControl_unfold]\n pcFree",
"n_chars": 60,
"n_subproofs": 0,... | [
{
"name": "expTwoMulFixedIterPreNWithControl_unfold",
"text": "theorem expTwoMulFixedIterPreNWithControl_unfold\n {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}\n {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld\n r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3\n ... | [
{
"name": "expTwoMulFixedIterPreNWithFrame_to_iterPreNWithControlFrame",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 22,
"n_chars": 921,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
Relaxed fixed-loop invariant preconditions that separate the semantic
control counter from the machine x6 scratch register.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- F... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
Relaxed fixed-loop invariant preconditions that separate the semantic
control counter from the machine x6 scratch register.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- F... | @@ -32,6 +32,24 @@
expTwoMulFixedCursorAssertion exponentWord k e **
expTwoMulFixedControlAssertion exponentWord k controlC6 ptr nextLimb evmSp
+theorem expTwoMulFixedIterPreNWithControl_unfold
+ {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}
+ {e machineC6 iterCount v10 v18 ptr nextLimb s... | {
"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_e01f59c2d7e4_0 | 49c32aa30d3fdfec | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1V5ModRemainder.lean | N1V5ModRemainder | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "fullModN1RemainderWordV5_eq_mod_lane_of_shape",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hraw := fullModN1RemainderWordV5_eq_mod_of_shape a0 a1 a2 a3 b0 b1 b2 b3\n hbnz hb1z ... | [
{
"name": "fullModN1RemainderWordV5_eq_mod_of_shape",
"text": "/-- **v5 n=1 MOD remainder correctness (shift≠0), from shape.**\n `fullModN1RemainderWordV5 = EvmWord.mod a b`. -/\ntheorem fullModN1RemainderWordV5_eq_mod_of_shape\n (a0 a1 a2 a3 b0 b1 b2 b3 : Word)\n (hbnz : b0 ||| b1 ||| b2 ||| b3 ≠ ... | [
{
"name": "fullModN1RemainderWordV5_eq_mod_lane_of_shape",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 964,
"n_subproofs": 1,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 9,
"n_structural": 3,
"automatio... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N1V5ModRemainder
**v5 n=1 MOD remainder correctness from shape (shift≠0):**
`fullModN1RemainderWordV5 = EvmWord.mod a b`.
The n=1 analog of `fullModN2RemainderWordV5_eq_mod_of_shape` (N2V5ModRemainder).
For the single-limb divisor case (b1=b2=b3=0) the normalized remainder collap... | /-
EvmAsm.Evm64.DivMod.Spec.N1V5ModRemainder
**v5 n=1 MOD remainder correctness from shape (shift≠0):**
`fullModN1RemainderWordV5 = EvmWord.mod a b`.
The n=1 analog of `fullModN2RemainderWordV5_eq_mod_of_shape` (N2V5ModRemainder).
For the single-limb divisor case (b1=b2=b3=0) the normalized remainder collap... | @@ -45,6 +45,39 @@
(fullDivN1R0V5 true true true true a0 a1 a2 a3 b0 b1 b2 b3).2.2.2.2.1 >>>
((fullDivN1Shift b0).toNat % 64))
+/-- **v5 n=1 MOD remainder correctness (shift≠0), from shape.**
+ `fullModN1RemainderWordV5 = EvmWord.mod a b`. -/
+theorem fullModN1RemainderWordV5_eq_mod_of_shape
+ ... | {
"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_84b2beb29453_0 | 69ccb1ff2d2be871 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathV5BzeroMod.lean | FullPathV5BzeroMod | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_mod_bzero_spec_within_noNop_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbody := cpsTripleWithin_extend_code divK_phaseA_code_sub_modCode_noNop_v5\n (divK_phaseA_body_... | [
{
"name": "beq_singleton_sub_modCode_noNop_v5",
"text": "private theorem beq_singleton_sub_modCode_noNop_v5 {base : Word} :\n ∀ a i, (CodeReq.singleton (base + phaseABeqOff) (.BEQ .x5 .x0 1020)) a = some i →\n (modCode_noNop_v5 base) a = some i := by\n intro a i h\n exact sharedNoNop_v5_b0_mod a i... | [
{
"name": "evm_mod_bzero_spec_within_noNop_v5",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 42,
"n_chars": 2377,
"n_subproofs": 10,
"n_tactics": 32,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 6,
"n_structural": 3,
"automation_only": ... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathV5BzeroMod
v5 bzero MOD code path (b = 0 → remainder 0), over `modCode_noNop_v5`: phaseA
detects b=0, the BEQ at phaseABeqOff is taken to zeroPath, which writes 0 to the
output slots. MOD mirror of `evm_div_bzero_lane_v5` (Compose/FullPathN1V5Bzero.lean)
with the phase... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathV5BzeroMod
v5 bzero MOD code path (b = 0 → remainder 0), over `modCode_noNop_v5`: phaseA
detects b=0, the BEQ at phaseABeqOff is taken to zeroPath, which writes 0 to the
output slots. MOD mirror of `evm_div_bzero_lane_v5` (Compose/FullPathN1V5Bzero.lean)
with the phase... | @@ -29,6 +29,14 @@
intro a i h
exact sharedNoNop_v5_b10_mod a i (by unfold divK_zeroPath_code at h; exact h)
+private theorem beq_singleton_sub_modCode_noNop_v5 {base : Word} :
+ ∀ a i, (CodeReq.singleton (base + phaseABeqOff) (.BEQ .x5 .x0 1020)) a = some i →
+ (modCode_noNop_v5 base) a = some i := 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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.