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_74303b9d60c0_16 | a1253ca4a17e290d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_byte_eq_old_of_end_le",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evmMemExpand_byte_eq]\n exact max_eq_left (roundUpTo32_le_of_le_dvd h_end h_size_dvd)",
"n_char... | [
{
"name": "evmMemExpand_byte_eq",
"text": "/-- Byte-granular memory writes such as MSTORE8 access one EVM memory byte. -/\ntheorem evmMemExpand_byte_eq (sizeBytes offset : Nat) :\n evmMemExpand sizeBytes offset 1 =\n max sizeBytes (roundUpTo32 (offset + 1)) := by\n unfold evmMemExpand\n simp\n\n",... | [
{
"name": "evmMemExpand_byte_eq_rounded_of_old_le",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 256,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": ... | 1 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -190,10 +190,19 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+/-- Byte-granular memory writes such as MSTORE8 access one EVM memory byte. -/
+theorem evmMemExpand_byte_eq (sizeBytes offset : Nat) :
+ evmMemExpand sizeBytes offset 1 =
+ max sizeBytes (roundUpTo32 (o... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_17 | e214b066b55a43e3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_word_eq_old_of_end_le",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evmMemExpand_word_eq]\n exact max_eq_left (roundUpTo32_le_of_le_dvd h_end h_size_dvd)",
"n_char... | [
{
"name": "evmMemExpand_word_eq",
"text": "/-- MLOAD and MSTORE access one full 32-byte EVM word. -/\ntheorem evmMemExpand_word_eq (sizeBytes offset : Nat) :\n evmMemExpand sizeBytes offset 32 =\n max sizeBytes (roundUpTo32 (offset + 32)) := by\n unfold evmMemExpand\n simp\n\n",
"fan_in": 3,
... | [
{
"name": "evmMemSizeIsWordExpanded_unfold_max",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 287,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fal... | 2 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -190,6 +190,13 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+/-- MLOAD and MSTORE access one full 32-byte EVM word. -/
+theorem evmMemExpand_word_eq (sizeBytes offset : Nat) :
+ evmMemExpand sizeBytes offset 32 =
+ max sizeBytes (roundUpTo32 (offset + 32)) := 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_74303b9d60c0_18 | f2c2c0b27a76a403 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_word_eq_old_of_end_le",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evmMemExpand_word_eq]\n exact max_eq_left (roundUpTo32_le_of_le_dvd h_end h_size_dvd)",
"n_char... | [
{
"name": "evmMemExpand_word_eq",
"text": "/-- MLOAD and MSTORE access one full 32-byte EVM word. -/\ntheorem evmMemExpand_word_eq (sizeBytes offset : Nat) :\n evmMemExpand sizeBytes offset 32 =\n max sizeBytes (roundUpTo32 (offset + 32)) := by\n unfold evmMemExpand\n simp\n\n",
"fan_in": 3,
... | [
{
"name": "evmMemSizeIsWordExpanded_eq_current_of_mload_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 9,
"n_chars": 393,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"autom... | 4 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -196,10 +196,19 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+/-- MLOAD and MSTORE access one full 32-byte EVM word. -/
+theorem evmMemExpand_word_eq (sizeBytes offset : Nat) :
+ evmMemExpand sizeBytes offset 32 =
+ max sizeBytes (roundUpTo32 (offset + 32)) := 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_74303b9d60c0_19 | 9a5c83ca4517613c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_word_eq_old_of_end_le",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evmMemExpand_word_eq]\n exact max_eq_left (roundUpTo32_le_of_le_dvd h_end h_size_dvd)",
"n_char... | [
{
"name": "evmMemExpand_word_eq",
"text": "/-- MLOAD and MSTORE access one full 32-byte EVM word. -/\ntheorem evmMemExpand_word_eq (sizeBytes offset : Nat) :\n evmMemExpand sizeBytes offset 32 =\n max sizeBytes (roundUpTo32 (offset + 32)) := by\n unfold evmMemExpand\n simp\n\n",
"fan_in": 3,
... | [
{
"name": "evmMemSizeIsWordExpanded_eq_rounded_of_mload_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 386,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"autom... | 3 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -190,10 +190,19 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+/-- MLOAD and MSTORE access one full 32-byte EVM word. -/
+theorem evmMemExpand_word_eq (sizeBytes offset : Nat) :
+ evmMemExpand sizeBytes offset 32 =
+ max sizeBytes (roundUpTo32 (offset + 32)) := 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_74303b9d60c0_20 | 2ca0abd61ca03847 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_word_eq_old_of_end_le",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evmMemExpand_word_eq]\n exact max_eq_left (roundUpTo32_le_of_le_dvd h_end h_size_dvd)",
"n_char... | [
{
"name": "evmMemExpand_word_eq",
"text": "/-- MLOAD and MSTORE access one full 32-byte EVM word. -/\ntheorem evmMemExpand_word_eq (sizeBytes offset : Nat) :\n evmMemExpand sizeBytes offset 32 =\n max sizeBytes (roundUpTo32 (offset + 32)) := by\n unfold evmMemExpand\n simp\n\n",
"fan_in": 3,
... | [
{
"name": "evmMemSizeIsWordExpanded_eq_rounded_of_word_growth",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 9,
"n_chars": 369,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automa... | 5 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -197,10 +197,19 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+/-- MLOAD and MSTORE access one full 32-byte EVM word. -/
+theorem evmMemExpand_word_eq (sizeBytes offset : Nat) :
+ evmMemExpand sizeBytes offset 32 =
+ max sizeBytes (roundUpTo32 (offset + 32)) := 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_74303b9d60c0_21 | acd4f56ff6a973cd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 5 | [
{
"theorem_name": "evmMemSizeIsWordExpanded_unfold_max",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evmMemSizeIsWordExpanded_unfold, evmMemExpand_word_eq]",
"n_chars": 64,
"n_subproofs": 0,
... | [
{
"name": "evmMemSizeIsWordExpanded_unfold",
"text": "theorem evmMemSizeIsWordExpanded_unfold\n {sizeLoc : Word} {sizeBytes offset : Nat} :\n evmMemSizeIsWordExpanded sizeLoc sizeBytes offset =\n evmMemSizeIs sizeLoc (evmMemExpand sizeBytes offset 32) := by\n delta evmMemSizeIsWordExpanded\n rf... | [
{
"name": "pcFree_evmMemSizeIsWordExpanded",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 225,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -199,9 +199,18 @@
def evmMemSizeIsWordExpanded (sizeLoc : Word) (sizeBytes offset : Nat) : Assertion :=
evmMemSizeIs sizeLoc (evmMemExpand sizeBytes offset 32)
+theorem evmMemSizeIsWordExpanded_unfold
+ {sizeLoc : Word} {sizeBytes offset : Nat} :
+ evmMemSizeIsWordExpanded sizeLoc sizeBytes offset =
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_22 | 8be5efeaf2beb19c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_byte_eq_old_of_end_le",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evmMemExpand_byte_eq]\n exact max_eq_left (roundUpTo32_le_of_le_dvd h_end h_size_dvd)",
"n_char... | [
{
"name": "evmMemExpand_byte_eq",
"text": "/-- Byte-granular memory writes such as MSTORE8 access one EVM memory byte. -/\ntheorem evmMemExpand_byte_eq (sizeBytes offset : Nat) :\n evmMemExpand sizeBytes offset 1 =\n max sizeBytes (roundUpTo32 (offset + 1)) := by\n unfold evmMemExpand\n simp\n\n",... | [
{
"name": "evmMemSizeIsByteExpanded_unfold_max",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 286,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fal... | 2 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -190,6 +190,13 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+/-- Byte-granular memory writes such as MSTORE8 access one EVM memory byte. -/
+theorem evmMemExpand_byte_eq (sizeBytes offset : Nat) :
+ evmMemExpand sizeBytes offset 1 =
+ max sizeBytes (roundUpTo32 (of... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_23 | c09ea4367b612d53 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_byte_eq_old_of_end_le",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evmMemExpand_byte_eq]\n exact max_eq_left (roundUpTo32_le_of_le_dvd h_end h_size_dvd)",
"n_char... | [
{
"name": "evmMemExpand_byte_eq",
"text": "/-- Byte-granular memory writes such as MSTORE8 access one EVM memory byte. -/\ntheorem evmMemExpand_byte_eq (sizeBytes offset : Nat) :\n evmMemExpand sizeBytes offset 1 =\n max sizeBytes (roundUpTo32 (offset + 1)) := by\n unfold evmMemExpand\n simp\n\n",... | [
{
"name": "evmMemSizeIsByteExpanded_eq_current_of_mstore8_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 9,
"n_chars": 394,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"aut... | 4 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -196,10 +196,19 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+/-- Byte-granular memory writes such as MSTORE8 access one EVM memory byte. -/
+theorem evmMemExpand_byte_eq (sizeBytes offset : Nat) :
+ evmMemExpand sizeBytes offset 1 =
+ max sizeBytes (roundUpTo32 (o... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_24 | 3ffb4ff783bf76b7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 24 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_byte_eq_old_of_end_le",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evmMemExpand_byte_eq]\n exact max_eq_left (roundUpTo32_le_of_le_dvd h_end h_size_dvd)",
"n_char... | [
{
"name": "evmMemExpand_byte_eq",
"text": "/-- Byte-granular memory writes such as MSTORE8 access one EVM memory byte. -/\ntheorem evmMemExpand_byte_eq (sizeBytes offset : Nat) :\n evmMemExpand sizeBytes offset 1 =\n max sizeBytes (roundUpTo32 (offset + 1)) := by\n unfold evmMemExpand\n simp\n\n",... | [
{
"name": "evmMemSizeIsByteExpanded_eq_rounded_of_mstore8_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 386,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"aut... | 3 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -190,10 +190,19 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+/-- Byte-granular memory writes such as MSTORE8 access one EVM memory byte. -/
+theorem evmMemExpand_byte_eq (sizeBytes offset : Nat) :
+ evmMemExpand sizeBytes offset 1 =
+ max sizeBytes (roundUpTo32 (o... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_25 | d50e692179b80606 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 25 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 4 | [
{
"theorem_name": "evmMemSizeIsByteExpanded_unfold_max",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evmMemSizeIsByteExpanded_unfold, evmMemExpand_byte_eq]",
"n_chars": 64,
"n_subproofs": 0,
... | [
{
"name": "evmMemSizeIsByteExpanded_unfold",
"text": "theorem evmMemSizeIsByteExpanded_unfold\n {sizeLoc : Word} {sizeBytes offset : Nat} :\n evmMemSizeIsByteExpanded sizeLoc sizeBytes offset =\n evmMemSizeIs sizeLoc (evmMemExpand sizeBytes offset 1) := by\n delta evmMemSizeIsByteExpanded\n rfl... | [
{
"name": "pcFree_evmMemSizeIsByteExpanded",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 225,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -224,9 +224,18 @@
def evmMemSizeIsByteExpanded (sizeLoc : Word) (sizeBytes offset : Nat) : Assertion :=
evmMemSizeIs sizeLoc (evmMemExpand sizeBytes offset 1)
+theorem evmMemSizeIsByteExpanded_unfold
+ {sizeLoc : Word} {sizeBytes offset : Nat} :
+ evmMemSizeIsByteExpanded sizeLoc sizeBytes offset =
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_26 | a4d98dd8a505ba35 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 26 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 2 | [
{
"theorem_name": "evmMemExpand_ge_access",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold evmMemExpand\n rw [if_neg hlen]\n exact Nat.le_trans (roundUpTo32_le _) (Nat.le_max_right _ _)",
"n_cha... | [
{
"name": "roundUpTo32_le",
"text": "theorem roundUpTo32_le (n : Nat) : n ≤ roundUpTo32 n := by\n unfold roundUpTo32\n have h : n ≤ (n + 31) / 32 * 32 := by\n have := Nat.div_mul_le_self (n + 31) 32\n omega\n exact h\n\n",
"fan_in": 2,
"n_lines": 8,
"n_chars": 189,
"n_subproofs": 2,... | [
{
"name": "evmMemExpand_mload_ge_end",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 323,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"m... | 2 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -174,6 +174,13 @@
`roundUpTo32 n = ((n + 31) / 32) * 32`. -/
def roundUpTo32 (n : Nat) : Nat := ((n + 31) / 32) * 32
+theorem roundUpTo32_le (n : Nat) : n ≤ roundUpTo32 n := by
+ unfold roundUpTo32
+ have h : n ≤ (n + 31) / 32 * 32 := by
+ have := Nat.div_mul_le_self (n + 31) 32
+ omega
+ exact h
+
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_27 | 73f9c9268a898736 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 27 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_access_byte_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_ge_access sizeBytes offset length hlen\n omega",
"n_chars": 79,
"n_subproof... | [
{
"name": "evmMemExpand_ge_access",
"text": "theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :\n offset + length ≤ evmMemExpand sizeBytes offset length := by\n unfold evmMemExpand\n rw [if_neg hlen]\n exact Nat.le_trans (roundUpTo32_le _) (Nat.le_max_right _ _)\n\n",... | [
{
"name": "evmMemExpand_mload_ge_start",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 306,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 3 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -197,6 +197,12 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :
+ offset + length ≤ evmMemExpand sizeBytes offset length := by
+ unfold evmMemExpand
+ rw [if_neg hlen]
+ exact Nat.le_tr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_28 | 54c738d436bf1495 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 28 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_access_byte_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_ge_access sizeBytes offset length hlen\n omega",
"n_chars": 79,
"n_subproof... | [
{
"name": "evmMemExpand_ge_access",
"text": "theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :\n offset + length ≤ evmMemExpand sizeBytes offset length := by\n unfold evmMemExpand\n rw [if_neg hlen]\n exact Nat.le_trans (roundUpTo32_le _) (Nat.le_max_right _ _)\n\n",... | [
{
"name": "evmMemExpand_mload_byte_lt",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 354,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"... | 3 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -197,6 +197,12 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :
+ offset + length ≤ evmMemExpand sizeBytes offset length := by
+ unfold evmMemExpand
+ rw [if_neg hlen]
+ exact Nat.le_tr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_29 | 6687edb850637f38 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 29 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_access_byte_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_ge_access sizeBytes offset length hlen\n omega",
"n_chars": 79,
"n_subproof... | [
{
"name": "evmMemExpand_ge_access",
"text": "theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :\n offset + length ≤ evmMemExpand sizeBytes offset length := by\n unfold evmMemExpand\n rw [if_neg hlen]\n exact Nat.le_trans (roundUpTo32_le _) (Nat.le_max_right _ _)\n\n",... | [
{
"name": "evmMemExpand_mstore_ge_end",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 7,
"n_chars": 318,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"... | 3 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -197,6 +197,12 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :
+ offset + length ≤ evmMemExpand sizeBytes offset length := by
+ unfold evmMemExpand
+ rw [if_neg hlen]
+ exact Nat.le_tr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_30 | c374d5eb36bb557f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 30 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_access_byte_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_ge_access sizeBytes offset length hlen\n omega",
"n_chars": 79,
"n_subproof... | [
{
"name": "evmMemExpand_ge_access",
"text": "theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :\n offset + length ≤ evmMemExpand sizeBytes offset length := by\n unfold evmMemExpand\n rw [if_neg hlen]\n exact Nat.le_trans (roundUpTo32_le _) (Nat.le_max_right _ _)\n\n",... | [
{
"name": "evmMemExpand_mstore_ge_start",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 7,
"n_chars": 294,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 4 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -197,6 +197,12 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :
+ offset + length ≤ evmMemExpand sizeBytes offset length := by
+ unfold evmMemExpand
+ rw [if_neg hlen]
+ exact Nat.le_tr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_31 | fa3556cdd12334b7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 31 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_access_byte_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_ge_access sizeBytes offset length hlen\n omega",
"n_chars": 79,
"n_subproof... | [
{
"name": "evmMemExpand_ge_access",
"text": "theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :\n offset + length ≤ evmMemExpand sizeBytes offset length := by\n unfold evmMemExpand\n rw [if_neg hlen]\n exact Nat.le_trans (roundUpTo32_le _) (Nat.le_max_right _ _)\n\n",... | [
{
"name": "evmMemExpand_mstore_byte_lt",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 358,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 4 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -197,6 +197,12 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :
+ offset + length ≤ evmMemExpand sizeBytes offset length := by
+ unfold evmMemExpand
+ rw [if_neg hlen]
+ exact Nat.le_tr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_32 | d4ddc928f2e7ef08 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 32 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 2 | [
{
"theorem_name": "evmMemExpand_ge_access",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold evmMemExpand\n rw [if_neg hlen]\n exact Nat.le_trans (roundUpTo32_le _) (Nat.le_max_right _ _)",
"n_cha... | [
{
"name": "roundUpTo32_le",
"text": "theorem roundUpTo32_le (n : Nat) : n ≤ roundUpTo32 n := by\n unfold roundUpTo32\n have h : n ≤ (n + 31) / 32 * 32 := by\n have := Nat.div_mul_le_self (n + 31) 32\n omega\n exact h\n\n",
"fan_in": 2,
"n_lines": 8,
"n_chars": 189,
"n_subproofs": 2,... | [
{
"name": "evmMemExpand_mstore8_ge_end",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 325,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -174,6 +174,13 @@
`roundUpTo32 n = ((n + 31) / 32) * 32`. -/
def roundUpTo32 (n : Nat) : Nat := ((n + 31) / 32) * 32
+theorem roundUpTo32_le (n : Nat) : n ≤ roundUpTo32 n := by
+ unfold roundUpTo32
+ have h : n ≤ (n + 31) / 32 * 32 := by
+ have := Nat.div_mul_le_self (n + 31) 32
+ omega
+ exact h
+
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_33 | d602f718d753274f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 33 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_access_byte_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_ge_access sizeBytes offset length hlen\n omega",
"n_chars": 79,
"n_subproof... | [
{
"name": "evmMemExpand_ge_access",
"text": "theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :\n offset + length ≤ evmMemExpand sizeBytes offset length := by\n unfold evmMemExpand\n rw [if_neg hlen]\n exact Nat.le_trans (roundUpTo32_le _) (Nat.le_max_right _ _)\n\n",... | [
{
"name": "evmMemExpand_mstore8_ge_start",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 311,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 3 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -197,6 +197,12 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :
+ offset + length ≤ evmMemExpand sizeBytes offset length := by
+ unfold evmMemExpand
+ rw [if_neg hlen]
+ exact Nat.le_tr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_34 | c2447f8de064756b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 34 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_access_byte_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_ge_access sizeBytes offset length hlen\n omega",
"n_chars": 79,
"n_subproof... | [
{
"name": "evmMemExpand_ge_access",
"text": "theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :\n offset + length ≤ evmMemExpand sizeBytes offset length := by\n unfold evmMemExpand\n rw [if_neg hlen]\n exact Nat.le_trans (roundUpTo32_le _) (Nat.le_max_right _ _)\n\n",... | [
{
"name": "evmMemExpand_mstore8_byte_lt",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 358,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 3 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -197,6 +197,12 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :
+ offset + length ≤ evmMemExpand sizeBytes offset length := by
+ unfold evmMemExpand
+ rw [if_neg hlen]
+ exact Nat.le_tr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_35 | e1f187981bebc455 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 35 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_access_byte_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_ge_access sizeBytes offset length hlen\n omega",
"n_chars": 79,
"n_subproof... | [
{
"name": "evmMemExpand_ge_access",
"text": "theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :\n offset + length ≤ evmMemExpand sizeBytes offset length := by\n unfold evmMemExpand\n rw [if_neg hlen]\n exact Nat.le_trans (roundUpTo32_le _) (Nat.le_max_right _ _)\n\n",... | [
{
"name": "evmMemExpand_mload_byte_dword_start_lt",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 459,
"n_subproofs": 2,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only":... | 4 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -197,6 +197,12 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :
+ offset + length ≤ evmMemExpand sizeBytes offset length := by
+ unfold evmMemExpand
+ rw [if_neg hlen]
+ exact Nat.le_tr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_36 | 3234152b40c19cb3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 36 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_access_byte_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_ge_access sizeBytes offset length hlen\n omega",
"n_chars": 79,
"n_subproof... | [
{
"name": "evmMemExpand_ge_access",
"text": "theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :\n offset + length ≤ evmMemExpand sizeBytes offset length := by\n unfold evmMemExpand\n rw [if_neg hlen]\n exact Nat.le_trans (roundUpTo32_le _) (Nat.le_max_right _ _)\n\n",... | [
{
"name": "evmMemExpand_mstore8_byte_dword_start_lt",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 461,
"n_subproofs": 2,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only... | 4 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -197,6 +197,12 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :
+ offset + length ≤ evmMemExpand sizeBytes offset length := by
+ unfold evmMemExpand
+ rw [if_neg hlen]
+ exact Nat.le_tr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_37 | fbf56321f73e7449 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 37 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_access_byte_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_ge_access sizeBytes offset length hlen\n omega",
"n_chars": 79,
"n_subproof... | [
{
"name": "evmMemExpand_ge_access",
"text": "theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :\n offset + length ≤ evmMemExpand sizeBytes offset length := by\n unfold evmMemExpand\n rw [if_neg hlen]\n exact Nat.le_trans (roundUpTo32_le _) (Nat.le_max_right _ _)\n\n",... | [
{
"name": "evmMemExpand_mload_byte_dword_interval",
"fan_in": 4,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 11,
"n_chars": 457,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only":... | 6 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -197,6 +197,12 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :
+ offset + length ≤ evmMemExpand sizeBytes offset length := by
+ unfold evmMemExpand
+ rw [if_neg hlen]
+ exact Nat.le_tr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_38 | 3862f8a0589d27fc | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 38 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_mload_ge_start",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_mload_ge_end sizeBytes offset\n omega",
"n_chars": 70,
"n_subproofs": 1,
... | [
{
"name": "evmMemExpand_mload_ge_end",
"text": "/-- MLOAD is a 32-byte byte-addressed access: expansion covers the byte just\n past the requested range for any starting byte offset. -/\ntheorem evmMemExpand_mload_ge_end (sizeBytes offset : Nat) :\n offset + 32 ≤ evmMemExpand sizeBytes offset 32 := by\... | [
{
"name": "evmMemExpand_mload_byte_dword_byte_lt",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 14,
"n_chars": 523,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": ... | 7 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -254,11 +254,19 @@
Assertion.PCFree (evmMemSizeIsByteExpanded sizeLoc sizeBytes offset) :=
⟨pcFree_evmMemSizeIsByteExpanded⟩
+/-- MLOAD is a 32-byte byte-addressed access: expansion covers the byte just
+ past the requested range for any starting byte offset. -/
+theorem evmMemExpand_mload_ge_end (sizeB... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_39 | 92890126c73dac11 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 39 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_mload_ge_start",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_mload_ge_end sizeBytes offset\n omega",
"n_chars": 70,
"n_subproofs": 1,
... | [
{
"name": "evmMemExpand_mload_ge_end",
"text": "/-- MLOAD is a 32-byte byte-addressed access: expansion covers the byte just\n past the requested range for any starting byte offset. -/\ntheorem evmMemExpand_mload_ge_end (sizeBytes offset : Nat) :\n offset + 32 ≤ evmMemExpand sizeBytes offset 32 := by\... | [
{
"name": "evmMemExpand_mload_dword_interval",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 7,
"n_chars": 282,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false... | 7 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -254,11 +254,19 @@
Assertion.PCFree (evmMemSizeIsByteExpanded sizeLoc sizeBytes offset) :=
⟨pcFree_evmMemSizeIsByteExpanded⟩
+/-- MLOAD is a 32-byte byte-addressed access: expansion covers the byte just
+ past the requested range for any starting byte offset. -/
+theorem evmMemExpand_mload_ge_end (sizeB... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_40 | 39e4dafc1d2175c8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 40 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_mload_ge_start",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_mload_ge_end sizeBytes offset\n omega",
"n_chars": 70,
"n_subproofs": 1,
... | [
{
"name": "evmMemExpand_mload_ge_end",
"text": "/-- MLOAD is a 32-byte byte-addressed access: expansion covers the byte just\n past the requested range for any starting byte offset. -/\ntheorem evmMemExpand_mload_ge_end (sizeBytes offset : Nat) :\n offset + 32 ≤ evmMemExpand sizeBytes offset 32 := by\... | [
{
"name": "evmMemExpand_mload_last_dword_interval",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 7,
"n_chars": 302,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": ... | 7 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -254,11 +254,19 @@
Assertion.PCFree (evmMemSizeIsByteExpanded sizeLoc sizeBytes offset) :=
⟨pcFree_evmMemSizeIsByteExpanded⟩
+/-- MLOAD is a 32-byte byte-addressed access: expansion covers the byte just
+ past the requested range for any starting byte offset. -/
+theorem evmMemExpand_mload_ge_end (sizeB... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_41 | 8a7bf74e9f352fa9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 41 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_mload_ge_start",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_mload_ge_end sizeBytes offset\n omega",
"n_chars": 70,
"n_subproofs": 1,
... | [
{
"name": "evmMemExpand_mload_ge_end",
"text": "/-- MLOAD is a 32-byte byte-addressed access: expansion covers the byte just\n past the requested range for any starting byte offset. -/\ntheorem evmMemExpand_mload_ge_end (sizeBytes offset : Nat) :\n offset + 32 ≤ evmMemExpand sizeBytes offset 32 := by\... | [
{
"name": "evmMemExpand_mload_dword_span",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 9,
"n_chars": 346,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 9 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -254,11 +254,19 @@
Assertion.PCFree (evmMemSizeIsByteExpanded sizeLoc sizeBytes offset) :=
⟨pcFree_evmMemSizeIsByteExpanded⟩
+/-- MLOAD is a 32-byte byte-addressed access: expansion covers the byte just
+ past the requested range for any starting byte offset. -/
+theorem evmMemExpand_mload_ge_end (sizeB... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_42 | 68392e34c335902e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 42 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 2 | [
{
"theorem_name": "evmMemExpand_mload_byte_dword_interval",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact ⟨\n evmMemExpand_mload_byte_dword_start_lt sizeBytes offset byteIndex h_byte,\n evmMemEx... | [
{
"name": "evmMemExpand_mload_byte_dword_end_le",
"text": "theorem evmMemExpand_mload_byte_dword_end_le\n (sizeBytes offset byteIndex : Nat) (h_byte : byteIndex < 32) :\n ((offset + byteIndex) / 8 + 1) * 8 ≤\n evmMemExpand sizeBytes offset 32 := by\n unfold evmMemExpand\n rw [if_neg (by decide ... | [
{
"name": "evmMemExpand_mstore_byte_dword_end_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 281,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": f... | 1 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -241,10 +241,23 @@
Assertion.PCFree (evmMemSizeIsByteExpanded sizeLoc sizeBytes offset) :=
⟨pcFree_evmMemSizeIsByteExpanded⟩
+theorem evmMemExpand_mload_byte_dword_end_le
+ (sizeBytes offset byteIndex : Nat) (h_byte : byteIndex < 32) :
+ ((offset + byteIndex) / 8 + 1) * 8 ≤
+ evmMemExpand sizeBy... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_43 | c615ceb9486e3b1f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 43 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_access_byte_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_ge_access sizeBytes offset length hlen\n omega",
"n_chars": 79,
"n_subproof... | [
{
"name": "evmMemExpand_ge_access",
"text": "theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :\n offset + length ≤ evmMemExpand sizeBytes offset length := by\n unfold evmMemExpand\n rw [if_neg hlen]\n exact Nat.le_trans (roundUpTo32_le _) (Nat.le_max_right _ _)\n\n",... | [
{
"name": "evmMemExpand_mstore_byte_dword_start_lt",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 7,
"n_chars": 279,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only":... | 5 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -197,6 +197,12 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :
+ offset + length ≤ evmMemExpand sizeBytes offset length := by
+ unfold evmMemExpand
+ rw [if_neg hlen]
+ exact Nat.le_tr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_44 | 04f11ef58e7ac27f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 44 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_mload_ge_start",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_mload_ge_end sizeBytes offset\n omega",
"n_chars": 70,
"n_subproofs": 1,
... | [
{
"name": "evmMemExpand_mload_ge_end",
"text": "/-- MLOAD is a 32-byte byte-addressed access: expansion covers the byte just\n past the requested range for any starting byte offset. -/\ntheorem evmMemExpand_mload_ge_end (sizeBytes offset : Nat) :\n offset + 32 ≤ evmMemExpand sizeBytes offset 32 := by\... | [
{
"name": "evmMemExpand_mstore_byte_dword_interval",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 9,
"n_chars": 371,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only":... | 7 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -254,11 +254,19 @@
Assertion.PCFree (evmMemSizeIsByteExpanded sizeLoc sizeBytes offset) :=
⟨pcFree_evmMemSizeIsByteExpanded⟩
+/-- MLOAD is a 32-byte byte-addressed access: expansion covers the byte just
+ past the requested range for any starting byte offset. -/
+theorem evmMemExpand_mload_ge_end (sizeB... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_45 | 5802ed282cc3409f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 45 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_mload_ge_start",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_mload_ge_end sizeBytes offset\n omega",
"n_chars": 70,
"n_subproofs": 1,
... | [
{
"name": "evmMemExpand_mload_ge_end",
"text": "/-- MLOAD is a 32-byte byte-addressed access: expansion covers the byte just\n past the requested range for any starting byte offset. -/\ntheorem evmMemExpand_mload_ge_end (sizeBytes offset : Nat) :\n offset + 32 ≤ evmMemExpand sizeBytes offset 32 := by\... | [
{
"name": "evmMemExpand_mstore_dword_interval",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 7,
"n_chars": 264,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": fals... | 8 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -254,11 +254,19 @@
Assertion.PCFree (evmMemSizeIsByteExpanded sizeLoc sizeBytes offset) :=
⟨pcFree_evmMemSizeIsByteExpanded⟩
+/-- MLOAD is a 32-byte byte-addressed access: expansion covers the byte just
+ past the requested range for any starting byte offset. -/
+theorem evmMemExpand_mload_ge_end (sizeB... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_46 | c4279a963dfdb003 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 46 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_mload_ge_start",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_mload_ge_end sizeBytes offset\n omega",
"n_chars": 70,
"n_subproofs": 1,
... | [
{
"name": "evmMemExpand_mload_ge_end",
"text": "/-- MLOAD is a 32-byte byte-addressed access: expansion covers the byte just\n past the requested range for any starting byte offset. -/\ntheorem evmMemExpand_mload_ge_end (sizeBytes offset : Nat) :\n offset + 32 ≤ evmMemExpand sizeBytes offset 32 := by\... | [
{
"name": "evmMemExpand_mstore_last_dword_interval",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 7,
"n_chars": 288,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only":... | 8 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -254,11 +254,19 @@
Assertion.PCFree (evmMemSizeIsByteExpanded sizeLoc sizeBytes offset) :=
⟨pcFree_evmMemSizeIsByteExpanded⟩
+/-- MLOAD is a 32-byte byte-addressed access: expansion covers the byte just
+ past the requested range for any starting byte offset. -/
+theorem evmMemExpand_mload_ge_end (sizeB... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_47 | 71d406cee164f1cf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 47 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_mload_ge_start",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_mload_ge_end sizeBytes offset\n omega",
"n_chars": 70,
"n_subproofs": 1,
... | [
{
"name": "evmMemExpand_mload_ge_end",
"text": "/-- MLOAD is a 32-byte byte-addressed access: expansion covers the byte just\n past the requested range for any starting byte offset. -/\ntheorem evmMemExpand_mload_ge_end (sizeBytes offset : Nat) :\n offset + 32 ≤ evmMemExpand sizeBytes offset 32 := by\... | [
{
"name": "evmMemExpand_mstore_dword_span",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 10,
"n_lines": 7,
"n_chars": 263,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 10 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -254,11 +254,19 @@
Assertion.PCFree (evmMemSizeIsByteExpanded sizeLoc sizeBytes offset) :=
⟨pcFree_evmMemSizeIsByteExpanded⟩
+/-- MLOAD is a 32-byte byte-addressed access: expansion covers the byte just
+ past the requested range for any starting byte offset. -/
+theorem evmMemExpand_mload_ge_end (sizeB... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_48 | 8d3e65e7b3830054 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 48 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_access_byte_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_ge_access sizeBytes offset length hlen\n omega",
"n_chars": 79,
"n_subproof... | [
{
"name": "evmMemExpand_ge_access",
"text": "theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :\n offset + length ≤ evmMemExpand sizeBytes offset length := by\n unfold evmMemExpand\n rw [if_neg hlen]\n exact Nat.le_trans (roundUpTo32_le _) (Nat.le_max_right _ _)\n\n",... | [
{
"name": "evmMemExpand_mstore8_byte_dword_interval",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 11,
"n_chars": 460,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only... | 6 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -197,6 +197,12 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :
+ offset + length ≤ evmMemExpand sizeBytes offset length := by
+ unfold evmMemExpand
+ rw [if_neg hlen]
+ exact Nat.le_tr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_49 | 1e97732ab21f08a4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 49 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_access_byte_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_ge_access sizeBytes offset length hlen\n omega",
"n_chars": 79,
"n_subproof... | [
{
"name": "evmMemExpand_ge_access",
"text": "theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :\n offset + length ≤ evmMemExpand sizeBytes offset length := by\n unfold evmMemExpand\n rw [if_neg hlen]\n exact Nat.le_trans (roundUpTo32_le _) (Nat.le_max_right _ _)\n\n",... | [
{
"name": "evmMemExpand_mstore8_byte_dword_byte_lt",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 14,
"n_chars": 529,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only"... | 7 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -197,6 +197,12 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :
+ offset + length ≤ evmMemExpand sizeBytes offset length := by
+ unfold evmMemExpand
+ rw [if_neg hlen]
+ exact Nat.le_tr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_50 | 36a79c4c32bc6aa5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 50 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_access_byte_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_ge_access sizeBytes offset length hlen\n omega",
"n_chars": 79,
"n_subproof... | [
{
"name": "evmMemExpand_ge_access",
"text": "theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :\n offset + length ≤ evmMemExpand sizeBytes offset length := by\n unfold evmMemExpand\n rw [if_neg hlen]\n exact Nat.le_trans (roundUpTo32_le _) (Nat.le_max_right _ _)\n\n",... | [
{
"name": "evmMemExpand_mstore8_dword_byte_lt",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 8,
"n_chars": 299,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": fals... | 8 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -197,6 +197,12 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :
+ offset + length ≤ evmMemExpand sizeBytes offset length := by
+ unfold evmMemExpand
+ rw [if_neg hlen]
+ exact Nat.le_tr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_51 | e58369959728b781 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 51 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_access_byte_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_ge_access sizeBytes offset length hlen\n omega",
"n_chars": 79,
"n_subproof... | [
{
"name": "evmMemExpand_ge_access",
"text": "theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :\n offset + length ≤ evmMemExpand sizeBytes offset length := by\n unfold evmMemExpand\n rw [if_neg hlen]\n exact Nat.le_trans (roundUpTo32_le _) (Nat.le_max_right _ _)\n\n",... | [
{
"name": "evmMemExpand_mstore8_dword_interval",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 7,
"n_chars": 284,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": fal... | 7 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -197,6 +197,12 @@
evmMemExpand sizeBytes offset 0 = sizeBytes := by
unfold evmMemExpand; simp
+theorem evmMemExpand_ge_access (sizeBytes offset length : Nat) (hlen : length ≠ 0) :
+ offset + length ≤ evmMemExpand sizeBytes offset length := by
+ unfold evmMemExpand
+ rw [if_neg hlen]
+ exact Nat.le_tr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_52 | 71f40f82c4d48e4c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 52 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 3 | [
{
"theorem_name": "evmMemExpand_mload_ge_start",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_end := evmMemExpand_mload_ge_end sizeBytes offset\n omega",
"n_chars": 70,
"n_subproofs": 1,
... | [
{
"name": "evmMemExpand_mload_ge_end",
"text": "/-- MLOAD is a 32-byte byte-addressed access: expansion covers the byte just\n past the requested range for any starting byte offset. -/\ntheorem evmMemExpand_mload_ge_end (sizeBytes offset : Nat) :\n offset + 32 ≤ evmMemExpand sizeBytes offset 32 := by\... | [
{
"name": "evmMemExpand_mstore_byte_dword_byte_lt",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 14,
"n_chars": 529,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only":... | 8 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -254,11 +254,19 @@
Assertion.PCFree (evmMemSizeIsByteExpanded sizeLoc sizeBytes offset) :=
⟨pcFree_evmMemSizeIsByteExpanded⟩
+/-- MLOAD is a 32-byte byte-addressed access: expansion covers the byte just
+ past the requested range for any starting byte offset. -/
+theorem evmMemExpand_mload_ge_end (sizeB... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_53 | d3041472cd6740bd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 53 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 1 | [
{
"theorem_name": "evmMemExpand_le_max_old_access_plus_31",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold evmMemExpand\n by_cases hlen : length = 0\n · simp [hlen]\n · rw [if_neg hlen]\n exact ... | [
{
"name": "roundUpTo32_le_add_31",
"text": "theorem roundUpTo32_le_add_31 (n : Nat) :\n roundUpTo32 n ≤ n + 31 := by\n unfold roundUpTo32\n exact Nat.div_mul_le_self (n + 31) 32\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 139,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
... | [
{
"name": "evmMemExpand_le_max_old_access_plus_31",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 389,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only":... | 1 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -174,6 +174,11 @@
`roundUpTo32 n = ((n + 31) / 32) * 32`. -/
def roundUpTo32 (n : Nat) : Nat := ((n + 31) / 32) * 32
+theorem roundUpTo32_le_add_31 (n : Nat) :
+ roundUpTo32 n ≤ n + 31 := by
+ unfold roundUpTo32
+ exact Nat.div_mul_le_self (n + 31) 32
+
/-- The pure EVM memory-expansion update: given t... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74303b9d60c0_54 | e6af39cb6a19d247 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Memory.lean | Memory | 54 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 39 | 1 | [
{
"theorem_name": "evmMemExpand_dvd_of_old_dvd",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold evmMemExpand\n by_cases hlen : length = 0\n · simp [hlen]; exact h_old\n · simp [hlen]\n -- max of... | [
{
"name": "roundUpTo32_dvd",
"text": "theorem roundUpTo32_dvd (n : Nat) : 32 ∣ roundUpTo32 n := by\n unfold roundUpTo32; exact ⟨(n + 31) / 32, (Nat.mul_comm _ _)⟩\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 132,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": ... | [
{
"name": "evmMemExpand_dvd_of_old_dvd",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 630,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 4,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | /-
EvmAsm.Evm64.Memory
Separation logic model for EVM memory (byte-addressable, zero-initialized,
dynamically expandable) stored in RV64IM doubleword-aligned memory cells.
Slice 1 (issue #99): defines the core `evmMemIs` assertion at dword-cell
granularity plus the zero-initialized form `evmMemZero`.
Sli... | @@ -174,6 +174,9 @@
`roundUpTo32 n = ((n + 31) / 32) * 32`. -/
def roundUpTo32 (n : Nat) : Nat := ((n + 31) / 32) * 32
+theorem roundUpTo32_dvd (n : Nat) : 32 ∣ roundUpTo32 n := by
+ unfold roundUpTo32; exact ⟨(n + 31) / 32, (Nat.mul_comm _ _)⟩
+
/-- The pure EVM memory-expansion update: given the current hig... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_55458f5727bd_0 | 603d7027279b04ef | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V5FullShift0Mod.lean | FullPathN1V5FullShift0Mod | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "loopN1UnifiedPostV5_shift0_to_modEpiloguePre",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [fullModN1FrameShift0V5Rest_unfold]\n delta loopN1UnifiedPostV5 loopN1Iter210PostV5 loopN... | [
{
"name": "fullModN1FrameShift0V5Rest_unfold",
"text": "theorem fullModN1FrameShift0V5Rest_unfold {sp base a0 a1 a2 a3 b0 scratchMem : Word} :\n fullModN1FrameShift0V5Rest sp base a0 a1 a2 a3 b0 scratchMem =\n (let R3 := iterN1Call_v5 b0 0 0 0 a3 0 0 0 0\n let R2 := fullN1S2 b0 0 0 0 a3 0 0 0 0 a2... | [
{
"name": "loopN1UnifiedPostV5_shift0_to_modEpiloguePre",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 49,
"n_chars": 3080,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 5,
"n_structural": 0,
"automatio... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5FullShift0Mod
Full v5 n=1 MOD code path, shift=0 case (base → nopOff), over `modCode_noNop_v5`:
the shift=0 preloop+loop (`evm_mod_n1_to_denorm_shift0_spec_v5_noNop`) composed
with the shift=0 MOD epilogue (`evm_mod_shift0_epilogue_spec_v5_noNop`) via a
MOD-specific... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5FullShift0Mod
Full v5 n=1 MOD code path, shift=0 case (base → nopOff), over `modCode_noNop_v5`:
the shift=0 preloop+loop (`evm_mod_n1_to_denorm_shift0_spec_v5_noNop`) composed
with the shift=0 MOD epilogue (`evm_mod_shift0_epilogue_spec_v5_noNop`) via a
MOD-specific... | @@ -45,6 +45,28 @@
(divKTrialCallV5ScratchOut 0 a3 b0 scratchMem)))) **
regOwn .x1
+theorem fullModN1FrameShift0V5Rest_unfold {sp base a0 a1 a2 a3 b0 scratchMem : Word} :
+ fullModN1FrameShift0V5Rest sp base a0 a1 a2 a3 b0 scratchMem =
+ (let R3 := iterN1Call_v5 b0 0 0 0 a3 0 0 0 0
+ let R2 :=... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_55458f5727bd_1 | 12d0828cdffc4487 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V5FullShift0Mod.lean | FullPathN1V5FullShift0Mod | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "loopN1UnifiedPostV5_shift0_to_modEpiloguePre",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [fullModN1FrameShift0V5Rest_unfold]\n delta loopN1UnifiedPostV5 loopN1Iter210PostV5 loopN... | [
{
"name": "fullModN1FrameShift0V5Rest_unfold",
"text": "theorem fullModN1FrameShift0V5Rest_unfold {sp base a0 a1 a2 a3 b0 scratchMem : Word} :\n fullModN1FrameShift0V5Rest sp base a0 a1 a2 a3 b0 scratchMem =\n (let R3 := iterN1Call_v5 b0 0 0 0 a3 0 0 0 0\n let R2 := fullN1S2 b0 0 0 0 a3 0 0 0 0 a2... | [
{
"name": "evm_mod_n1_full_shift0_spec_v5_noNop",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 92,
"n_chars": 5776,
"n_subproofs": 5,
"n_tactics": 36,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only":... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5FullShift0Mod
Full v5 n=1 MOD code path, shift=0 case (base → nopOff), over `modCode_noNop_v5`:
the shift=0 preloop+loop (`evm_mod_n1_to_denorm_shift0_spec_v5_noNop`) composed
with the shift=0 MOD epilogue (`evm_mod_shift0_epilogue_spec_v5_noNop`) via a
MOD-specific... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5FullShift0Mod
Full v5 n=1 MOD code path, shift=0 case (base → nopOff), over `modCode_noNop_v5`:
the shift=0 preloop+loop (`evm_mod_n1_to_denorm_shift0_spec_v5_noNop`) composed
with the shift=0 MOD epilogue (`evm_mod_shift0_epilogue_spec_v5_noNop`) via a
MOD-specific... | @@ -45,6 +45,28 @@
(divKTrialCallV5ScratchOut 0 a3 b0 scratchMem)))) **
regOwn .x1
+theorem fullModN1FrameShift0V5Rest_unfold {sp base a0 a1 a2 a3 b0 scratchMem : Word} :
+ fullModN1FrameShift0V5Rest sp base a0 a1 a2 a3 b0 scratchMem =
+ (let R3 := iterN1Call_v5 b0 0 0 0 a3 0 0 0 0
+ let R2 :=... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_d0e7495171c0_0 | 01bf3c3461de26fc | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldLeavesSAsm.lean | Secp256k1FieldLeavesSAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "zeroFold",
"depth": 1,
"n_commands": 0,
"n_lines": 29,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply List.ext_getElem\n · simp only [length_setBytes, hl, List.length_replicate]\n · intro i h1 _\n have hi : i < 32 := by ... | [
{
"name": "getElem_eq_getByteAt",
"text": "/-- `l[i] = getByteAt l i` for an in-range index. -/\nprivate theorem getElem_eq_getByteAt (l : List (BitVec 8)) (i : Nat)\n (h : i < l.length) : l[i] = getByteAt l i := by\n unfold getByteAt; rw [dif_pos h]\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars... | [
{
"name": "zeroFold",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 36,
"n_chars": 1951,
"n_subproofs": 5,
"n_tactics": 34,
"cyclomatic": 1,
"n_automation": 16,
"n_rewrites": 7,
"n_structural": 3,
"automation_only": false,
"max_nesting": ... | 2 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldLeavesSAsm
Verified SAsm ports of the STRAIGHT-LINE secp256k1 field leaves
(bead evm-asm-4ch8f.38.2.1, the wave-1 `.38a` stack):
- `secfZero32` (`secfZero32_prog`, Secp256k1Field.lean): zero the 32-byte
buffer at `a0` — four `SD x0` dword stores. Modelled over a s... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldLeavesSAsm
Verified SAsm ports of the STRAIGHT-LINE secp256k1 field leaves
(bead evm-asm-4ch8f.38.2.1, the wave-1 `.38a` stack):
- `secfZero32` (`secfZero32_prog`, Secp256k1Field.lean): zero the 32-byte
buffer at `a0` — four `SD x0` dword stores. Modelled over a s... | @@ -61,6 +61,11 @@
#guard secfZero32Body.flatten 0 ++ [Instr.JALR .x0 .x1 (0 : BitVec 12)]
= secfZero32_prog
+/-- `l[i] = getByteAt l i` for an in-range index. -/
+private theorem getElem_eq_getByteAt (l : List (BitVec 8)) (i : Nat)
+ (h : i < l.length) : l[i] = getByteAt l i := by
+ unfold getByteAt; rw [dif... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_d0e7495171c0_1 | abdca031c63ef507 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldLeavesSAsm.lean | Secp256k1FieldLeavesSAsm | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "zero_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hx0 : rf.get .x0 = (0 : Word) := RegFile.get_x0 rf\n simp only [execBlock, execInstrRF, storeSem, loadSem, aluSem, hx10, ... | [
{
"name": "se12_z8",
"text": "private theorem se12_z8 : signExtend12 (8 : BitVec 12) = (8 : Word) := by decide\n",
"fan_in": 4,
"n_lines": 2,
"n_chars": 81,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"auto... | [
{
"name": "zero_engine",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 7,
"n_lines": 17,
"n_chars": 913,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 5,
"n_structural": 0,
"automation_only": false,
"max_nesting": ... | 7 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldLeavesSAsm
Verified SAsm ports of the STRAIGHT-LINE secp256k1 field leaves
(bead evm-asm-4ch8f.38.2.1, the wave-1 `.38a` stack):
- `secfZero32` (`secfZero32_prog`, Secp256k1Field.lean): zero the 32-byte
buffer at `a0` — four `SD x0` dword stores. Modelled over a s... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldLeavesSAsm
Verified SAsm ports of the STRAIGHT-LINE secp256k1 field leaves
(bead evm-asm-4ch8f.38.2.1, the wave-1 `.38a` stack):
- `secfZero32` (`secfZero32_prog`, Secp256k1Field.lean): zero the 32-byte
buffer at `a0` — four `SD x0` dword stores. Modelled over a s... | @@ -63,6 +63,7 @@
/-- `signExtend12` of the four dword offsets, as concrete words. -/
private theorem se12_z0 : signExtend12 (0 : BitVec 12) = (0 : Word) := by decide
+private theorem se12_z8 : signExtend12 (8 : BitVec 12) = (8 : Word) := by decide
private theorem se12_z16 : signExtend12 (16 : BitVec 12) = (16 : 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_d0e7495171c0_2 | 4fc94f77d96129e9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldLeavesSAsm.lean | Secp256k1FieldLeavesSAsm | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "zero_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hx0 : rf.get .x0 = (0 : Word) := RegFile.get_x0 rf\n simp only [execBlock, execInstrRF, storeSem, loadSem, aluSem, hx10, ... | [
{
"name": "se12_z8",
"text": "private theorem se12_z8 : signExtend12 (8 : BitVec 12) = (8 : Word) := by decide\n",
"fan_in": 4,
"n_lines": 2,
"n_chars": 81,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"auto... | [
{
"name": "zero_blockVCs",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 11,
"n_chars": 590,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 4,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_nesting"... | 4 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldLeavesSAsm
Verified SAsm ports of the STRAIGHT-LINE secp256k1 field leaves
(bead evm-asm-4ch8f.38.2.1, the wave-1 `.38a` stack):
- `secfZero32` (`secfZero32_prog`, Secp256k1Field.lean): zero the 32-byte
buffer at `a0` — four `SD x0` dword stores. Modelled over a s... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldLeavesSAsm
Verified SAsm ports of the STRAIGHT-LINE secp256k1 field leaves
(bead evm-asm-4ch8f.38.2.1, the wave-1 `.38a` stack):
- `secfZero32` (`secfZero32_prog`, Secp256k1Field.lean): zero the 32-byte
buffer at `a0` — four `SD x0` dword stores. Modelled over a s... | @@ -63,6 +63,7 @@
/-- `signExtend12` of the four dword offsets, as concrete words. -/
private theorem se12_z0 : signExtend12 (0 : BitVec 12) = (0 : Word) := by decide
+private theorem se12_z8 : signExtend12 (8 : BitVec 12) = (8 : Word) := by decide
private theorem se12_z16 : signExtend12 (16 : BitVec 12) = (16 : 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_d0e7495171c0_3 | c6f18ae91186370e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldLeavesSAsm.lean | Secp256k1FieldLeavesSAsm | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "zero_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hx0 : rf.get .x0 = (0 : Word) := RegFile.get_x0 rf\n simp only [execBlock, execInstrRF, storeSem, loadSem, aluSem, hx10, ... | [
{
"name": "se12_z16",
"text": "private theorem se12_z16 : signExtend12 (16 : BitVec 12) = (16 : Word) := by decide\n",
"fan_in": 4,
"n_lines": 2,
"n_chars": 84,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"... | [
{
"name": "secfZero32Fn_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 19,
"n_chars": 790,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 5,
"automation_only": false,
"max_nes... | 9 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldLeavesSAsm
Verified SAsm ports of the STRAIGHT-LINE secp256k1 field leaves
(bead evm-asm-4ch8f.38.2.1, the wave-1 `.38a` stack):
- `secfZero32` (`secfZero32_prog`, Secp256k1Field.lean): zero the 32-byte
buffer at `a0` — four `SD x0` dword stores. Modelled over a s... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldLeavesSAsm
Verified SAsm ports of the STRAIGHT-LINE secp256k1 field leaves
(bead evm-asm-4ch8f.38.2.1, the wave-1 `.38a` stack):
- `secfZero32` (`secfZero32_prog`, Secp256k1Field.lean): zero the 32-byte
buffer at `a0` — four `SD x0` dword stores. Modelled over a s... | @@ -64,6 +64,7 @@
/-- `signExtend12` of the four dword offsets, as concrete words. -/
private theorem se12_z0 : signExtend12 (0 : BitVec 12) = (0 : Word) := by decide
private theorem se12_z8 : signExtend12 (8 : BitVec 12) = (8 : Word) := by decide
+private theorem se12_z16 : signExtend12 (16 : BitVec 12) = (16 : Wor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_d0e7495171c0_4 | 28f4aee3095dae0a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldLeavesSAsm.lean | Secp256k1FieldLeavesSAsm | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "zeroFold",
"depth": 1,
"n_commands": 0,
"n_lines": 29,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply List.ext_getElem\n · simp only [length_setBytes, hl, List.length_replicate]\n · intro i h1 _\n have hi : i < 32 := by ... | [
{
"name": "getElem_eq_getByteAt",
"text": "/-- `l[i] = getByteAt l i` for an in-range index. -/\nprivate theorem getElem_eq_getByteAt (l : List (BitVec 8)) (i : Nat)\n (h : i < l.length) : l[i] = getByteAt l i := by\n unfold getByteAt; rw [dif_pos h]\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars... | [
{
"name": "copyFold",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 54,
"n_chars": 3091,
"n_subproofs": 6,
"n_tactics": 64,
"cyclomatic": 1,
"n_automation": 33,
"n_rewrites": 23,
"n_structural": 5,
"automation_only": false,
"max_nesting":... | 2 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldLeavesSAsm
Verified SAsm ports of the STRAIGHT-LINE secp256k1 field leaves
(bead evm-asm-4ch8f.38.2.1, the wave-1 `.38a` stack):
- `secfZero32` (`secfZero32_prog`, Secp256k1Field.lean): zero the 32-byte
buffer at `a0` — four `SD x0` dword stores. Modelled over a s... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldLeavesSAsm
Verified SAsm ports of the STRAIGHT-LINE secp256k1 field leaves
(bead evm-asm-4ch8f.38.2.1, the wave-1 `.38a` stack):
- `secfZero32` (`secfZero32_prog`, Secp256k1Field.lean): zero the 32-byte
buffer at `a0` — four `SD x0` dword stores. Modelled over a s... | @@ -61,6 +61,11 @@
#guard secfZero32Body.flatten 0 ++ [Instr.JALR .x0 .x1 (0 : BitVec 12)]
= secfZero32_prog
+/-- `l[i] = getByteAt l i` for an in-range index. -/
+private theorem getElem_eq_getByteAt (l : List (BitVec 8)) (i : Nat)
+ (h : i < l.length) : l[i] = getByteAt l i := by
+ unfold getByteAt; rw [dif... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_d0e7495171c0_5 | fefd8cc255185be8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldLeavesSAsm.lean | Secp256k1FieldLeavesSAsm | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "zero_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hx0 : rf.get .x0 = (0 : Word) := RegFile.get_x0 rf\n simp only [execBlock, execInstrRF, storeSem, loadSem, aluSem, hx10, ... | [
{
"name": "se12_z16",
"text": "private theorem se12_z16 : signExtend12 (16 : BitVec 12) = (16 : Word) := by decide\n",
"fan_in": 4,
"n_lines": 2,
"n_chars": 84,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"... | [
{
"name": "copy_engine",
"fan_in": 1,
"n_deps_direct": 7,
"n_deps_transitive": 9,
"n_lines": 69,
"n_chars": 3850,
"n_subproofs": 1,
"n_tactics": 57,
"cyclomatic": 1,
"n_automation": 23,
"n_rewrites": 21,
"n_structural": 5,
"automation_only": false,
"max_nestin... | 9 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldLeavesSAsm
Verified SAsm ports of the STRAIGHT-LINE secp256k1 field leaves
(bead evm-asm-4ch8f.38.2.1, the wave-1 `.38a` stack):
- `secfZero32` (`secfZero32_prog`, Secp256k1Field.lean): zero the 32-byte
buffer at `a0` — four `SD x0` dword stores. Modelled over a s... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldLeavesSAsm
Verified SAsm ports of the STRAIGHT-LINE secp256k1 field leaves
(bead evm-asm-4ch8f.38.2.1, the wave-1 `.38a` stack):
- `secfZero32` (`secfZero32_prog`, Secp256k1Field.lean): zero the 32-byte
buffer at `a0` — four `SD x0` dword stores. Modelled over a s... | @@ -64,6 +64,7 @@
/-- `signExtend12` of the four dword offsets, as concrete words. -/
private theorem se12_z0 : signExtend12 (0 : BitVec 12) = (0 : Word) := by decide
private theorem se12_z8 : signExtend12 (8 : BitVec 12) = (8 : Word) := by decide
+private theorem se12_z16 : signExtend12 (16 : BitVec 12) = (16 : Wor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_d0e7495171c0_6 | 3607969afc4f87f8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldLeavesSAsm.lean | Secp256k1FieldLeavesSAsm | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "zero_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hx0 : rf.get .x0 = (0 : Word) := RegFile.get_x0 rf\n simp only [execBlock, execInstrRF, storeSem, loadSem, aluSem, hx10, ... | [
{
"name": "se12_z8",
"text": "private theorem se12_z8 : signExtend12 (8 : BitVec 12) = (8 : Word) := by decide\n",
"fan_in": 4,
"n_lines": 2,
"n_chars": 81,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"auto... | [
{
"name": "copy_blockVCs",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 75,
"n_chars": 4961,
"n_subproofs": 5,
"n_tactics": 49,
"cyclomatic": 2,
"n_automation": 15,
"n_rewrites": 15,
"n_structural": 9,
"automation_only": false,
"max_nest... | 5 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldLeavesSAsm
Verified SAsm ports of the STRAIGHT-LINE secp256k1 field leaves
(bead evm-asm-4ch8f.38.2.1, the wave-1 `.38a` stack):
- `secfZero32` (`secfZero32_prog`, Secp256k1Field.lean): zero the 32-byte
buffer at `a0` — four `SD x0` dword stores. Modelled over a s... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldLeavesSAsm
Verified SAsm ports of the STRAIGHT-LINE secp256k1 field leaves
(bead evm-asm-4ch8f.38.2.1, the wave-1 `.38a` stack):
- `secfZero32` (`secfZero32_prog`, Secp256k1Field.lean): zero the 32-byte
buffer at `a0` — four `SD x0` dword stores. Modelled over a s... | @@ -63,6 +63,7 @@
/-- `signExtend12` of the four dword offsets, as concrete words. -/
private theorem se12_z0 : signExtend12 (0 : BitVec 12) = (0 : Word) := by decide
+private theorem se12_z8 : signExtend12 (8 : BitVec 12) = (8 : Word) := by decide
private theorem se12_z16 : signExtend12 (16 : BitVec 12) = (16 : 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_d0e7495171c0_7 | 362efd98b6629f3e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldLeavesSAsm.lean | Secp256k1FieldLeavesSAsm | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "zero_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hx0 : rf.get .x0 = (0 : Word) := RegFile.get_x0 rf\n simp only [execBlock, execInstrRF, storeSem, loadSem, aluSem, hx10, ... | [
{
"name": "se12_z16",
"text": "private theorem se12_z16 : signExtend12 (16 : BitVec 12) = (16 : Word) := by decide\n",
"fan_in": 4,
"n_lines": 2,
"n_chars": 84,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"... | [
{
"name": "secfCopy32Fn_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 11,
"n_lines": 17,
"n_chars": 724,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 5,
"automation_only": false,
"max_ne... | 11 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldLeavesSAsm
Verified SAsm ports of the STRAIGHT-LINE secp256k1 field leaves
(bead evm-asm-4ch8f.38.2.1, the wave-1 `.38a` stack):
- `secfZero32` (`secfZero32_prog`, Secp256k1Field.lean): zero the 32-byte
buffer at `a0` — four `SD x0` dword stores. Modelled over a s... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldLeavesSAsm
Verified SAsm ports of the STRAIGHT-LINE secp256k1 field leaves
(bead evm-asm-4ch8f.38.2.1, the wave-1 `.38a` stack):
- `secfZero32` (`secfZero32_prog`, Secp256k1Field.lean): zero the 32-byte
buffer at `a0` — four `SD x0` dword stores. Modelled over a s... | @@ -64,6 +64,7 @@
/-- `signExtend12` of the four dword offsets, as concrete words. -/
private theorem se12_z0 : signExtend12 (0 : BitVec 12) = (0 : Word) := by decide
private theorem se12_z8 : signExtend12 (8 : BitVec 12) = (8 : Word) := by decide
+private theorem se12_z16 : signExtend12 (16 : BitVec 12) = (16 : Wor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bc26d7b15e18_0 | ebbc64dd159a10f1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128KnuthLower.lean | Div128KnuthLower | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 2 | [
{
"theorem_name": "div128Quot_q1c_ge_q_true_1",
"depth": 1,
"n_commands": 0,
"n_lines": 29,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro q1 hi1 q1c\n have h_q1_ge : (uHi.toNat * 2^32 + div_un1.toNat) /\n (dHi.toNat * 2^32 + dLo.toNat) ≤... | [
{
"name": "div128Quot_q_true_1_lt_pow32",
"text": "/-- **KB-LB2: True first digit is bounded by 2^32 under hcall.** Under\n the call-trial precondition `uHi < vTop`, the abstract Knuth first\n digit `q_true_1 = (uHi * 2^32 + div_un1) / vTop` is strictly less\n than 2^32:\n\n ```\n (uHi * 2^32... | [
{
"name": "div128Quot_q1c_ge_q_true_1",
"fan_in": 3,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 56,
"n_chars": 2341,
"n_subproofs": 5,
"n_tactics": 30,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 10,
"n_structural": 4,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | @@ -62,6 +62,39 @@
exact EvmWord.trial_quotient_ge_general uHi.toNat div_un1.toNat
dHi.toNat dLo.toNat (2^32) hdHi_pos h_div_un1_lt
+/-- **KB-LB2: True first digit is bounded by 2^32 under hcall.** Under
+ the call-trial precondition `uHi < vTop`, the abstract Knuth first
+ digit `q_true_1 = (uHi * 2^32... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bc26d7b15e18_1 | 1b9a07b4741f0be1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128KnuthLower.lean | Div128KnuthLower | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 2 | [
{
"theorem_name": "div128Quot_rhatc_lt_pow32_of_uHi_lt_pow63",
"depth": 1,
"n_commands": 0,
"n_lines": 35,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro q1 rhat hi1 rhatc\n have h_q1_lt : q1.toNat < 2^32 :=\n div128Quot_q1_lt_pow32_of_uHi_... | [
{
"name": "div128Quot_q1_lt_pow32_of_uHi_lt_pow63",
"text": "/-- **KB-LB6a: Small uHi ⟹ Phase 1 trial < 2^32.** With `uHi.toNat < 2^63`\n and `dHi.toNat ≥ 2^31`, the raw Phase 1 trial `rv64_divu uHi dHi` is\n strictly less than `2^32`:\n\n ```\n (rv64_divu uHi dHi).toNat < 2^32\n ```\n\n P... | [
{
"name": "div128Quot_rhatc_lt_pow32_of_uHi_lt_pow63",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 59,
"n_chars": 2652,
"n_subproofs": 10,
"n_tactics": 30,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 9,
"n_structural": 4,
"automation_... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | @@ -33,6 +33,40 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (bv6_toNat_32)
+/-- **KB-LB6a: Small uHi ⟹ Phase 1 trial < 2^32.** With `uHi.toNat < 2^63`
+ and `dHi.toNat ≥ 2^31`, the raw Phase 1 trial `rv64_divu uHi dHi` is
+ strictly less than `2^32`:
+
+ ```
+ (rv64_divu uHi dHi).toNat < 2^32
+ ```... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bc26d7b15e18_2 | d593b93d48c25d30 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128KnuthLower.lean | Div128KnuthLower | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 3 | [
{
"theorem_name": "div128Quot_q1_prime_ge_q_true_1_small_rhatc",
"depth": 1,
"n_commands": 0,
"n_lines": 76,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro q1 rhat hi1 q1c rhatc div_un1 rhatUn1 q1'\n -- Derived preconditions.\n have hdHi_ne :... | [
{
"name": "div128Quot_q1c_ge_q_true_1",
"text": "/-- **KB-LB3: Phase 1a preserves Knuth lower bound.** After Phase 1a's\n `hi1` correction, the corrected trial `q1c` is still ≥ the true\n first digit:\n\n ```\n (uHi * 2^32 + div_un1) / vTop ≤ q1c.toNat\n ```\n\n Case analysis on `hi1`:\n ... | [
{
"name": "div128Quot_q1_prime_ge_q_true_1_small_rhatc",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 120,
"n_chars": 5753,
"n_subproofs": 20,
"n_tactics": 72,
"cyclomatic": 1,
"n_automation": 12,
"n_rewrites": 16,
"n_structural": 9,
"automa... | 4 | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | @@ -95,6 +95,61 @@
linarith
exact (Nat.div_lt_iff_lt_mul h_vTop_pos).mpr h_num_lt'
+/-- **KB-LB3: Phase 1a preserves Knuth lower bound.** After Phase 1a's
+ `hi1` correction, the corrected trial `q1c` is still ≥ the true
+ first digit:
+
+ ```
+ (uHi * 2^32 + div_un1) / vTop ≤ q1c.toNat
+ ```
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bc26d7b15e18_3 | 191ebfdd439a3ff8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128KnuthLower.lean | Div128KnuthLower | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 2 | [
{
"theorem_name": "div128Quot_rhatc_lt_pow32_of_uHi_lt_pow63",
"depth": 1,
"n_commands": 0,
"n_lines": 35,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro q1 rhat hi1 rhatc\n have h_q1_lt : q1.toNat < 2^32 :=\n div128Quot_q1_lt_pow32_of_uHi_... | [
{
"name": "div128Quot_q1_lt_pow32_of_uHi_lt_pow63",
"text": "/-- **KB-LB6a: Small uHi ⟹ Phase 1 trial < 2^32.** With `uHi.toNat < 2^63`\n and `dHi.toNat ≥ 2^31`, the raw Phase 1 trial `rv64_divu uHi dHi` is\n strictly less than `2^32`:\n\n ```\n (rv64_divu uHi dHi).toNat < 2^32\n ```\n\n P... | [
{
"name": "div128Quot_q1_prime_ge_q_true_1_of_uHi_lt_pow63",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 40,
"n_chars": 1865,
"n_subproofs": 2,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 3,
"automa... | 7 | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | @@ -180,6 +180,40 @@
rw [h_expand]
linarith
+/-- **KB-LB6a: Small uHi ⟹ Phase 1 trial < 2^32.** With `uHi.toNat < 2^63`
+ and `dHi.toNat ≥ 2^31`, the raw Phase 1 trial `rv64_divu uHi dHi` is
+ strictly less than `2^32`:
+
+ ```
+ (rv64_divu uHi dHi).toNat < 2^32
+ ```
+
+ Proof: `q1.toNat = uH... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bc26d7b15e18_4 | dea3bc34988c7163 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128KnuthLower.lean | Div128KnuthLower | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 2 | [
{
"theorem_name": "div128Quot_rhatc_lt_pow32_of_uHi_lt_pow63",
"depth": 1,
"n_commands": 0,
"n_lines": 35,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro q1 rhat hi1 rhatc\n have h_q1_lt : q1.toNat < 2^32 :=\n div128Quot_q1_lt_pow32_of_uHi_... | [
{
"name": "div128Quot_q1_lt_pow32_of_uHi_lt_pow63",
"text": "/-- **KB-LB6a: Small uHi ⟹ Phase 1 trial < 2^32.** With `uHi.toNat < 2^63`\n and `dHi.toNat ≥ 2^31`, the raw Phase 1 trial `rv64_divu uHi dHi` is\n strictly less than `2^32`:\n\n ```\n (rv64_divu uHi dHi).toNat < 2^32\n ```\n\n P... | [
{
"name": "div128Quot_q0_prime_ge_q_true_0_of_un21_lt_pow63",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 56,
"n_chars": 2622,
"n_subproofs": 3,
"n_tactics": 25,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 6,
"n_structural": 5,
"autom... | 8 | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | @@ -180,6 +180,40 @@
rw [h_expand]
linarith
+/-- **KB-LB6a: Small uHi ⟹ Phase 1 trial < 2^32.** With `uHi.toNat < 2^63`
+ and `dHi.toNat ≥ 2^31`, the raw Phase 1 trial `rv64_divu uHi dHi` is
+ strictly less than `2^32`:
+
+ ```
+ (rv64_divu uHi dHi).toNat < 2^32
+ ```
+
+ Proof: `q1.toNat = uH... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bc26d7b15e18_5 | da71c1711f19d64d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128KnuthLower.lean | Div128KnuthLower | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "knuth_compose_qHat_le_abstract_trial_nat",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := knuth_compose_qHat_vTop_le_nat q1' q0' rhat' rhat2' dHi dLo\n div_un1 div_un0 uHi h_p... | [
{
"name": "knuth_compose_qHat_vTop_le_nat",
"text": "/-- **KB-Compose: Knuth 2-digit composition identity (pure Nat algebra).**\n Under the Phase 1b Euclidean, un21 identity, Phase 2b Euclidean, and\n the two no-wrap conditions, the composed quotient satisfies:\n\n ```\n (q1' * 2^32 + q0') * (dH... | [
{
"name": "knuth_compose_qHat_le_abstract_trial_nat",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 34,
"n_chars": 1719,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_onl... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | @@ -33,6 +33,53 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (bv6_toNat_32)
+/-- **KB-Compose: Knuth 2-digit composition identity (pure Nat algebra).**
+ Under the Phase 1b Euclidean, un21 identity, Phase 2b Euclidean, and
+ the two no-wrap conditions, the composed quotient satisfies:
+
+ ```
+ (q1' * ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bc26d7b15e18_6 | a5745855e2022fd1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128KnuthLower.lean | Div128KnuthLower | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "div128Quot_rhatc_lt_pow32_of_uHi_lt_dHi_mul_pow32",
"depth": 1,
"n_commands": 0,
"n_lines": 32,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro q1 rhat hi1 rhatc\n have h_q1_lt : q1.toNat < 2^32 :=\n div128Quot_q1_lt_pow32... | [
{
"name": "div128Quot_q1_lt_pow32_of_uHi_lt_dHi_mul_pow32",
"text": "/-- **KB-LB6a': `uHi < dHi * 2^32 ⟹ q1 < 2^32`.** Case A variant of KB-LB6a\n with a hypothesis on `dHi * 2^32` instead of `2^63`. Strictly weaker\n under `dHi ≥ 2^31`. -/\ntheorem div128Quot_q1_lt_pow32_of_uHi_lt_dHi_mul_pow32\n ... | [
{
"name": "div128Quot_rhatc_lt_pow32_of_uHi_lt_dHi_mul_pow32",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 45,
"n_chars": 1868,
"n_subproofs": 10,
"n_tactics": 32,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 9,
"n_structural": 4,
"aut... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | @@ -33,6 +33,17 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (bv6_toNat_32)
+/-- **KB-LB6a': `uHi < dHi * 2^32 ⟹ q1 < 2^32`.** Case A variant of KB-LB6a
+ with a hypothesis on `dHi * 2^32` instead of `2^63`. Strictly weaker
+ under `dHi ≥ 2^31`. -/
+theorem div128Quot_q1_lt_pow32_of_uHi_lt_dHi_mul_pow32
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bc26d7b15e18_7 | 2f3ea7ecd32b50ac | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128KnuthLower.lean | Div128KnuthLower | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "div128Quot_q1_prime_ge_q_true_1_small_rhatc",
"depth": 1,
"n_commands": 0,
"n_lines": 76,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro q1 rhat hi1 q1c rhatc div_un1 rhatUn1 q1'\n -- Derived preconditions.\n have hdHi_ne :... | [
{
"name": "knuth_theorem_c_abstract",
"text": "/-- **KB-LB4: Knuth Theorem C (abstract algebra form).** The\n multiplication-check inequality implies the trial overshoots the\n true first digit:\n\n ```\n rhatc * 2^32 + div_un1 < q1c * dLo\n → uHi * 2^32 + div_un1 < q1c * (dHi * 2^32 + dLo)... | [
{
"name": "div128Quot_q1_prime_ge_q_true_1_of_uHi_lt_dHi_mul_pow32",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 31,
"n_chars": 1511,
"n_subproofs": 2,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 3,
... | 7 | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | @@ -150,6 +150,36 @@
Nat.add_mod_right, Nat.mod_eq_of_lt hq1_lt_word]
omega
+/-- **KB-LB4: Knuth Theorem C (abstract algebra form).** The
+ multiplication-check inequality implies the trial overshoots the
+ true first digit:
+
+ ```
+ rhatc * 2^32 + div_un1 < q1c * dLo
+ → uHi * 2^32 + ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bc26d7b15e18_8 | 3b90579198f67368 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128KnuthLower.lean | Div128KnuthLower | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "div128Quot_q1_prime_ge_q_true_1_small_rhatc",
"depth": 1,
"n_commands": 0,
"n_lines": 76,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro q1 rhat hi1 q1c rhatc div_un1 rhatUn1 q1'\n -- Derived preconditions.\n have hdHi_ne :... | [
{
"name": "knuth_theorem_c_abstract",
"text": "/-- **KB-LB4: Knuth Theorem C (abstract algebra form).** The\n multiplication-check inequality implies the trial overshoots the\n true first digit:\n\n ```\n rhatc * 2^32 + div_un1 < q1c * dLo\n → uHi * 2^32 + div_un1 < q1c * (dHi * 2^32 + dLo)... | [
{
"name": "div128Quot_q0_prime_ge_q_true_0_of_un21_lt_dHi_mul_pow32",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 47,
"n_chars": 2246,
"n_subproofs": 3,
"n_tactics": 25,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 6,
"n_structural": 5,
... | 8 | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | @@ -150,6 +150,36 @@
Nat.add_mod_right, Nat.mod_eq_of_lt hq1_lt_word]
omega
+/-- **KB-LB4: Knuth Theorem C (abstract algebra form).** The
+ multiplication-check inequality implies the trial overshoots the
+ true first digit:
+
+ ```
+ rhatc * 2^32 + div_un1 < q1c * dLo
+ → uHi * 2^32 + ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bc26d7b15e18_9 | 632e52a92a282f78 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128KnuthLower.lean | Div128KnuthLower | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 2 | [
{
"theorem_name": "div128Quot_q1c_ge_q_true_1",
"depth": 1,
"n_commands": 0,
"n_lines": 29,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro q1 hi1 q1c\n have h_q1_ge : (uHi.toNat * 2^32 + div_un1.toNat) /\n (dHi.toNat * 2^32 + dLo.toNat) ≤... | [
{
"name": "div128Quot_q_true_1_lt_pow32",
"text": "/-- **KB-LB2: True first digit is bounded by 2^32 under hcall.** Under\n the call-trial precondition `uHi < vTop`, the abstract Knuth first\n digit `q_true_1 = (uHi * 2^32 + div_un1) / vTop` is strictly less\n than 2^32:\n\n ```\n (uHi * 2^32... | [
{
"name": "div128Quot_q1_le_q_true_1_plus_two",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 109,
"n_chars": 5172,
"n_subproofs": 28,
"n_tactics": 64,
"cyclomatic": 1,
"n_automation": 17,
"n_rewrites": 4,
"n_structural": 3,
"automation_only"... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | @@ -33,6 +33,39 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (bv6_toNat_32)
+/-- **KB-LB2: True first digit is bounded by 2^32 under hcall.** Under
+ the call-trial precondition `uHi < vTop`, the abstract Knuth first
+ digit `q_true_1 = (uHi * 2^32 + div_un1) / vTop` is strictly less
+ than 2^32:
+
+ `... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bc26d7b15e18_10 | 32e30278ba260c12 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128KnuthLower.lean | Div128KnuthLower | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 2 | [
{
"theorem_name": "div128Quot_q1c_ge_q_true_1",
"depth": 1,
"n_commands": 0,
"n_lines": 29,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro q1 hi1 q1c\n have h_q1_ge : (uHi.toNat * 2^32 + div_un1.toNat) /\n (dHi.toNat * 2^32 + dLo.toNat) ≤... | [
{
"name": "div128Quot_q_true_1_lt_pow32",
"text": "/-- **KB-LB2: True first digit is bounded by 2^32 under hcall.** Under\n the call-trial precondition `uHi < vTop`, the abstract Knuth first\n digit `q_true_1 = (uHi * 2^32 + div_un1) / vTop` is strictly less\n than 2^32:\n\n ```\n (uHi * 2^32... | [
{
"name": "div128Quot_q1c_le_q_true_1_plus_two",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 58,
"n_chars": 2296,
"n_subproofs": 4,
"n_tactics": 30,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 10,
"n_structural": 4,
"automation_only":... | 2 | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | @@ -33,6 +33,39 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (bv6_toNat_32)
+/-- **KB-LB2: True first digit is bounded by 2^32 under hcall.** Under
+ the call-trial precondition `uHi < vTop`, the abstract Knuth first
+ digit `q_true_1 = (uHi * 2^32 + div_un1) / vTop` is strictly less
+ than 2^32:
+
+ `... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bc26d7b15e18_11 | 6544bc9eaef5617c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128KnuthLower.lean | Div128KnuthLower | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "knuth_theorem_c_strong_contrapositive",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_contra h\n push Not at h\n have h_overshoot : q1c.toNat ≥\n (uHi.toNat * 2^32 + div_un1.to... | [
{
"name": "knuth_theorem_c_strong_abstract",
"text": "/-- **Strong Knuth Theorem C (abstract algebra form): trial overshoot\n forces the multiplication check.** Given the Phase 1a Euclidean\n `q1c * dHi + rhatc = uHi` and a 2-overshoot of the trial, the\n Knuth multiplication-check inequality holds... | [
{
"name": "knuth_theorem_c_strong_contrapositive",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 34,
"n_chars": 1300,
"n_subproofs": 2,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only"... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | @@ -33,6 +33,71 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (bv6_toNat_32)
+/-- **Strong Knuth Theorem C (abstract algebra form): trial overshoot
+ forces the multiplication check.** Given the Phase 1a Euclidean
+ `q1c * dHi + rhatc = uHi` and a 2-overshoot of the trial, the
+ Knuth multiplication-check ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bc26d7b15e18_12 | cad40b3fc6b3e412 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128KnuthLower.lean | Div128KnuthLower | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 2 | [
{
"theorem_name": "div128Quot_q1_prime_ge_q_true_1_of_uHi_lt_pow63",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro q1 rhat hi1 q1c rhatc div_un1 rhatUn1 q1'\n have hdHi_ne : dHi ≠ 0 := by\n intro ... | [
{
"name": "div128Quot_rhatc_lt_pow32_of_uHi_lt_pow63",
"text": "/-- **KB-LB6b: Under uHi < 2^63, Phase 1a doesn't correct; rhatc < 2^32.**\n Composing KB-LB6a (q1 < 2^32) with the algorithm: when `q1 < 2^32`,\n `hi1 = q1 >>> 32 = 0`, so Phase 1a takes the no-correction branch.\n Then `rhatc = rhat ... | [
{
"name": "div128Quot_q1_prime_le_q_true_1_plus_one",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 7,
"n_lines": 138,
"n_chars": 6388,
"n_subproofs": 29,
"n_tactics": 80,
"cyclomatic": 1,
"n_automation": 12,
"n_rewrites": 21,
"n_structural": 7,
"automatio... | 7 | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | /-
EvmAsm.Evm64.EvmWordArith.Div128KnuthLower
Knuth's "Lemma A" Lower Bound chain for `div128Quot`: the digit-wise
trial quotient never underestimates the true quotient of the abstract
top-digits division. Split from `Div128QuotientBounds.lean` when that
file crossed the 1500-line guardrail.
Key lemmas (a... | @@ -100,6 +100,64 @@
omega
omega
+/-- **KB-LB6b: Under uHi < 2^63, Phase 1a doesn't correct; rhatc < 2^32.**
+ Composing KB-LB6a (q1 < 2^32) with the algorithm: when `q1 < 2^32`,
+ `hi1 = q1 >>> 32 = 0`, so Phase 1a takes the no-correction branch.
+ Then `rhatc = rhat = uHi mod dHi < dHi < 2^32`:
+
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f06c7cd96a42_0 | 7182e8fa0f5eb0f6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/AbiFrameDemo.lean | AbiFrameDemo | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "demoFrame_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 56,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbody :\n cpsTripleWithin 3\n ((0x1000 : Word) + BitVec.ofNat 64 (4 * (1 + demoFrame.length)))\n ((... | [
{
"name": "demoBody_spec",
"text": "/-- The body's straight-line effect (explicit atoms), proved by `runBlock`.\n `ra`, `sp`, and the three frame slots are framed (untouched). -/\ntheorem demoBody_spec (ret v0 v1 va0 va1 jt : Word) :\n cpsTripleWithin 3 0x1010 0x101C demoCr\n ((.x2 ↦ᵣ (0x2FFE8 : ... | [
{
"name": "demoFrame_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 71,
"n_chars": 3664,
"n_subproofs": 5,
"n_tactics": 55,
"cyclomatic": 1,
"n_automation": 15,
"n_rewrites": 5,
"n_structural": 4,
"automation_only": false,
"max_nest... | 1 | /-
EvmAsm.Rv64.SAsm.AbiFrameDemo
End-to-end regression witness for the ABI-frame construct
(bead evm-asm-4ch8f.76), now derived as a one-shot instantiation of the
reusable, parameterized `abiFrame_spec`.
A synthetic leaf routine with a standard C-ABI frame:
addi sp, sp, -24 -- allocate frame
... | /-
EvmAsm.Rv64.SAsm.AbiFrameDemo
End-to-end regression witness for the ABI-frame construct
(bead evm-asm-4ch8f.76), now derived as a one-shot instantiation of the
reusable, parameterized `abiFrame_spec`.
A synthetic leaf routine with a standard C-ABI frame:
addi sp, sp, -24 -- allocate frame
... | @@ -91,6 +91,27 @@
/-- The routine CodeReq: exactly the flattened routine at `0x1000`. -/
def demoCr : CodeReq := CodeReq.ofProg 0x1000 demoProgList
+/-- The body's straight-line effect (explicit atoms), proved by `runBlock`.
+ `ra`, `sp`, and the three frame slots are framed (untouched). -/
+theorem demoBody_sp... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e9f3dba515f9_0 | fc7f409cd4bbdf53 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/BaseSquaringCallCode.lean | BaseSquaringCallCode | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 4 | [
{
"theorem_name": "exp_squaring_call_block_code_marshal_factor1_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [exp_squaring_call_block_code_eq_ofProg]\n exact CodeReq.ofProg_mono_sub base base\n ... | [
{
"name": "exp_squaring_call_block_code_eq_ofProg",
"text": "theorem exp_squaring_call_block_code_eq_ofProg\n (base : Word) (mulOff : BitVec 21) :\n exp_squaring_call_block_code base mulOff =\n CodeReq.ofProg base (EvmAsm.Evm64.exp_squaring_call_block mulOff) := by\n unfold exp_squaring_call_blo... | [
{
"name": "exp_squaring_call_block_code_marshal_factor1_sub",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 807,
"n_subproofs": 0,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 1,
"automa... | 1 | /-
EvmAsm.Evm64.Exp.Compose.BaseSquaringCallCode
CodeReq decomposition for the base EXP squaring call block.
-/
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
/-- CodeReq decomposition for one EXP squarin... | /-
EvmAsm.Evm64.Exp.Compose.BaseSquaringCallCode
CodeReq decomposition for the base EXP squaring call block.
-/
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
/-- CodeReq decomposition for one EXP squarin... | @@ -23,10 +23,60 @@
CodeReq.ofProg (base + 68) EvmAsm.Evm64.exp_loop_un_marshal_and_restore
]
+theorem exp_squaring_call_block_code_eq_ofProg
+ (base : Word) (mulOff : BitVec 21) :
+ exp_squaring_call_block_code base mulOff =
+ CodeReq.ofProg base (EvmAsm.Evm64.exp_squaring_call_block mulOff) := 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_e9f3dba515f9_1 | cc41a0967474cb5b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/BaseSquaringCallCode.lean | BaseSquaringCallCode | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 4 | [
{
"theorem_name": "exp_squaring_call_block_code_marshal_factor1_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [exp_squaring_call_block_code_eq_ofProg]\n exact CodeReq.ofProg_mono_sub base base\n ... | [
{
"name": "exp_squaring_call_block_code_eq_ofProg",
"text": "theorem exp_squaring_call_block_code_eq_ofProg\n (base : Word) (mulOff : BitVec 21) :\n exp_squaring_call_block_code base mulOff =\n CodeReq.ofProg base (EvmAsm.Evm64.exp_squaring_call_block mulOff) := by\n unfold exp_squaring_call_blo... | [
{
"name": "exp_squaring_call_block_code_marshal_result_to_factor2_sub",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 24,
"n_chars": 881,
"n_subproofs": 0,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 1,
... | 1 | /-
EvmAsm.Evm64.Exp.Compose.BaseSquaringCallCode
CodeReq decomposition for the base EXP squaring call block.
-/
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
/-- CodeReq decomposition for one EXP squarin... | /-
EvmAsm.Evm64.Exp.Compose.BaseSquaringCallCode
CodeReq decomposition for the base EXP squaring call block.
-/
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
/-- CodeReq decomposition for one EXP squarin... | @@ -23,11 +23,61 @@
CodeReq.ofProg (base + 68) EvmAsm.Evm64.exp_loop_un_marshal_and_restore
]
+theorem exp_squaring_call_block_code_eq_ofProg
+ (base : Word) (mulOff : BitVec 21) :
+ exp_squaring_call_block_code base mulOff =
+ CodeReq.ofProg base (EvmAsm.Evm64.exp_squaring_call_block mulOff) := 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_e9f3dba515f9_2 | b8110fa8cfef2764 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/BaseSquaringCallCode.lean | BaseSquaringCallCode | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 4 | [
{
"theorem_name": "exp_squaring_call_block_code_marshal_factor1_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [exp_squaring_call_block_code_eq_ofProg]\n exact CodeReq.ofProg_mono_sub base base\n ... | [
{
"name": "exp_squaring_call_block_code_eq_ofProg",
"text": "theorem exp_squaring_call_block_code_eq_ofProg\n (base : Word) (mulOff : BitVec 21) :\n exp_squaring_call_block_code base mulOff =\n CodeReq.ofProg base (EvmAsm.Evm64.exp_squaring_call_block mulOff) := by\n unfold exp_squaring_call_blo... | [
{
"name": "exp_squaring_call_block_code_square_sub",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 802,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 1,
"automation_only... | 1 | /-
EvmAsm.Evm64.Exp.Compose.BaseSquaringCallCode
CodeReq decomposition for the base EXP squaring call block.
-/
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
/-- CodeReq decomposition for one EXP squarin... | /-
EvmAsm.Evm64.Exp.Compose.BaseSquaringCallCode
CodeReq decomposition for the base EXP squaring call block.
-/
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
/-- CodeReq decomposition for one EXP squarin... | @@ -23,11 +23,60 @@
CodeReq.ofProg (base + 68) EvmAsm.Evm64.exp_loop_un_marshal_and_restore
]
+theorem exp_squaring_call_block_code_eq_ofProg
+ (base : Word) (mulOff : BitVec 21) :
+ exp_squaring_call_block_code base mulOff =
+ CodeReq.ofProg base (EvmAsm.Evm64.exp_squaring_call_block mulOff) := 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_e9f3dba515f9_3 | a8bdc9f96cee4c61 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/BaseSquaringCallCode.lean | BaseSquaringCallCode | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 4 | [
{
"theorem_name": "exp_squaring_call_block_code_marshal_factor1_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [exp_squaring_call_block_code_eq_ofProg]\n exact CodeReq.ofProg_mono_sub base base\n ... | [
{
"name": "exp_squaring_call_block_code_eq_ofProg",
"text": "theorem exp_squaring_call_block_code_eq_ofProg\n (base : Word) (mulOff : BitVec 21) :\n exp_squaring_call_block_code base mulOff =\n CodeReq.ofProg base (EvmAsm.Evm64.exp_squaring_call_block mulOff) := by\n unfold exp_squaring_call_blo... | [
{
"name": "exp_squaring_call_block_code_un_marshal_and_restore_sub",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 24,
"n_chars": 870,
"n_subproofs": 0,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 1,
... | 1 | /-
EvmAsm.Evm64.Exp.Compose.BaseSquaringCallCode
CodeReq decomposition for the base EXP squaring call block.
-/
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
/-- CodeReq decomposition for one EXP squarin... | /-
EvmAsm.Evm64.Exp.Compose.BaseSquaringCallCode
CodeReq decomposition for the base EXP squaring call block.
-/
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
/-- CodeReq decomposition for one EXP squarin... | @@ -23,11 +23,61 @@
CodeReq.ofProg (base + 68) EvmAsm.Evm64.exp_loop_un_marshal_and_restore
]
+theorem exp_squaring_call_block_code_eq_ofProg
+ (base : Word) (mulOff : BitVec 21) :
+ exp_squaring_call_block_code base mulOff =
+ CodeReq.ofProg base (EvmAsm.Evm64.exp_squaring_call_block mulOff) := 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_4cb3d32ad6b4_0 | 2db52a9575280037 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Ripemd160EcallBridge.lean | Ripemd160EcallBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "statusWord_eq_eokWord_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases h_st : result.status with\n | eok => simp [statusWord_eok h_st]\n | efail =>\n rw [statusWord_efail h_... | [
{
"name": "statusWord_efail",
"text": "theorem statusWord_efail\n {result : Ripemd160Result} (h_status : result.status = .efail) :\n statusWord result = EvmAsm.Rv64.zkvmStatusEfailWord := by\n show EvmAsm.Rv64.zkvmStatusToWord result.status = _\n rw [h_status]; rfl\n\n",
"fan_in": 1,
"n_line... | [
{
"name": "statusWord_eq_eokWord_iff",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 12,
"n_chars": 459,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 5,
"automation_only": false,
... | 2 | /-
EvmAsm.EL.Ripemd160EcallBridge
Pure zkVM RIPEMD160 accelerator ECALL surface for the Ethereum RIPEMD160
precompile (address 0x03).
-/
import EvmAsm.EL.Ripemd160InputBridge
import EvmAsm.EL.Ripemd160ResultBridge
import EvmAsm.Evm64.Accelerators.Status
import EvmAsm.Evm64.Accelerators.SyscallIds
namespace Evm... | /-
EvmAsm.EL.Ripemd160EcallBridge
Pure zkVM RIPEMD160 accelerator ECALL surface for the Ethereum RIPEMD160
precompile (address 0x03).
-/
import EvmAsm.EL.Ripemd160InputBridge
import EvmAsm.EL.Ripemd160ResultBridge
import EvmAsm.Evm64.Accelerators.Status
import EvmAsm.Evm64.Accelerators.SyscallIds
namespace Evm... | @@ -67,12 +67,22 @@
show EvmAsm.Rv64.zkvmStatusToWord result.status = _
rw [h_status]; rfl
+theorem statusWord_efail
+ {result : Ripemd160Result} (h_status : result.status = .efail) :
+ statusWord result = EvmAsm.Rv64.zkvmStatusEfailWord := by
+ show EvmAsm.Rv64.zkvmStatusToWord result.status = _
+ rw [... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fa86875fedcb_0 | 548333100cac115d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceInnerStepTail.lean | ReduceInnerStepTail | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "evm_mulmod_reduce512_inner_step_tail_done_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbr := evm_mulmod_reduce512_inner_step_tail_spec_within base x15\n have hdone_... | [
{
"name": "evm_mulmod_reduce512_inner_step_tail_spec_within",
"text": "theorem evm_mulmod_reduce512_inner_step_tail_spec_within\n (base x15 : Word) :\n cpsBranchWithin 2 (base + 248)\n (evm_mulmod_reduce512_inner_step_tail_code base)\n ((.x15 ↦ᵣ x15) ** (.x0 ↦ᵣ (0 : Word)))\n base (mulM... | [
{
"name": "evm_mulmod_reduce512_inner_step_tail_done_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 25,
"n_chars": 1151,
"n_subproofs": 3,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 4,
"... | 1 | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepTail
CPS spec for the loop-tail branch of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceCompare
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.SyscallSpecs
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- The loop-control tail of `evm_mulmod_reduce512_inner... | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepTail
CPS spec for the loop-tail branch of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceCompare
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.SyscallSpecs
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- The loop-control tail of `evm_mulmod_reduce512_inner... | @@ -28,6 +28,50 @@
(.x0 ↦ᵣ (0 : Word))) **
⌜if done then x15New = 0 else x15New ≠ 0⌝
+theorem evm_mulmod_reduce512_inner_step_tail_spec_within
+ (base x15 : Word) :
+ cpsBranchWithin 2 (base + 248)
+ (evm_mulmod_reduce512_inner_step_tail_code base)
+ ((.x15 ↦ᵣ x15) ** (.x0 ↦ᵣ (0 : 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_fa86875fedcb_1 | 116619389813f0ac | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceInnerStepTail.lean | ReduceInnerStepTail | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "evm_mulmod_reduce512_inner_step_tail_done_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbr := evm_mulmod_reduce512_inner_step_tail_spec_within base x15\n have hdone_... | [
{
"name": "evm_mulmod_reduce512_inner_step_tail_spec_within",
"text": "theorem evm_mulmod_reduce512_inner_step_tail_spec_within\n (base x15 : Word) :\n cpsBranchWithin 2 (base + 248)\n (evm_mulmod_reduce512_inner_step_tail_code base)\n ((.x15 ↦ᵣ x15) ** (.x0 ↦ᵣ (0 : Word)))\n base (mulM... | [
{
"name": "evm_mulmod_reduce512_inner_step_tail_loop_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 25,
"n_chars": 1125,
"n_subproofs": 3,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 4,
"... | 1 | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepTail
CPS spec for the loop-tail branch of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceCompare
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.SyscallSpecs
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- The loop-control tail of `evm_mulmod_reduce512_inner... | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepTail
CPS spec for the loop-tail branch of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceCompare
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.SyscallSpecs
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- The loop-control tail of `evm_mulmod_reduce512_inner... | @@ -28,6 +28,50 @@
(.x0 ↦ᵣ (0 : Word))) **
⌜if done then x15New = 0 else x15New ≠ 0⌝
+theorem evm_mulmod_reduce512_inner_step_tail_spec_within
+ (base x15 : Word) :
+ cpsBranchWithin 2 (base + 248)
+ (evm_mulmod_reduce512_inner_step_tail_code base)
+ ((.x15 ↦ᵣ x15) ** (.x0 ↦ᵣ (0 : 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_d2b73defebda_0 | c74748ec6845d948 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Val256ModBridge.lean | Val256ModBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "val256_ms_un_lt_val256_b_max_skip",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ms\n rw [val256_ms_un_eq_val256_mod_max_skip hbnz hb3nz hc3_zero]\n exact Nat.mod_lt _ (val256_po... | [
{
"name": "val256_ms_un_eq_val256_mod_max_skip",
"text": "/-- The un-normalized mulsub output (at n=4 max+skip with `c3 = 0`) represents\n `val256(a) mod val256(b)` at the Nat level. Derived via the Euclidean\n uniqueness argument (`remainder_lt_of_ge_floor`) rather than going through\n the `EvmWor... | [
{
"name": "val256_ms_un_lt_val256_b_max_skip",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 669,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": fals... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Val256ModBridge
Nat-level val256 extractions for the MOD stack spec bridge:
- `val256_ms_un_eq_val256_mod_max_skip`:
`val256(mulsub_un) = val256(a) % val256(b)` at n=4 max+skip with c3=0.
- `val256_ms_un_lt_val256_b_max_skip`:
`val256(mulsub_un) < val256(b)` (Knuth rema... | /-
EvmAsm.Evm64.EvmWordArith.Val256ModBridge
Nat-level val256 extractions for the MOD stack spec bridge:
- `val256_ms_un_eq_val256_mod_max_skip`:
`val256(mulsub_un) = val256(a) % val256(b)` at n=4 max+skip with c3=0.
- `val256_ms_un_lt_val256_b_max_skip`:
`val256(mulsub_un) < val256(b)` (Knuth rema... | @@ -23,6 +23,42 @@
namespace EvmWord
+/-- The un-normalized mulsub output (at n=4 max+skip with `c3 = 0`) represents
+ `val256(a) mod val256(b)` at the Nat level. Derived via the Euclidean
+ uniqueness argument (`remainder_lt_of_ge_floor`) rather than going through
+ the `EvmWord.mod` / `fromLimbs` encodi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_03653457d120_0 | d56dde2a2540f51a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V5PreloopShift0Mod.lean | FullPathN1V5PreloopShift0Mod | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_mod_n1_to_loopSetup_shift0_spec_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hC2 := evm_mod_phaseAB_n1_clz_c2taken_spec_v5_noNop sp base b0 b1 b2 b3\n v5 v6 v7 v1... | [
{
"name": "divK_copyAU_loopSetup_shift0_spec_v5_noNop_mod",
"text": "/-- copyAU + loopSetup (shift=0), `base → loopBodyOff` over `modCode_noNop_v5`.\n MOD mirror of `divK_copyAU_loopSetup_shift0_spec_v5_noNop`. -/\ntheorem divK_copyAU_loopSetup_shift0_spec_v5_noNop_mod (sp base : Word)\n (a0 a1 a2 a3 ... | [
{
"name": "evm_mod_n1_to_loopSetup_shift0_spec_v5_noNop",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 74,
"n_chars": 4748,
"n_subproofs": 5,
"n_tactics": 33,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 1,
"automatio... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5PreloopShift0Mod
v5 n=1 shift=0 preloop for MOD, over `modCode_noNop_v5`. MOD mirror of
`FullPathN1V5PreloopShift0` (the DIV shift=0 preloop): the preloop runs the
shared phaseAB/clz/c2-taken/copyAU/loopSetup instructions (no normalization on
the shift=0 branch), s... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5PreloopShift0Mod
v5 n=1 shift=0 preloop for MOD, over `modCode_noNop_v5`. MOD mirror of
`FullPathN1V5PreloopShift0` (the DIV shift=0 preloop): the preloop runs the
shared phaseAB/clz/c2-taken/copyAU/loopSetup instructions (no normalization on
the shift=0 branch), s... | @@ -21,6 +21,47 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
+/-- copyAU + loopSetup (shift=0), `base → loopBodyOff` over `modCode_noNop_v5`.
+ MOD mirror of `divK_copyAU_loopSetup_shift0_spec_v5_noNop`. -/
+theorem divK_copyAU_loopSetup_shift0_spec_v5_noNop_mod (sp 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_68e2fcaae722_0 | 10f336188655ca87 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Sha256PrecompileDispatch.lean | Sha256PrecompileDispatch | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "gasCost_empty",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [gasCost_eq_precompileGasCost]\n simp [EvmAsm.Evm64.Precompile.inputWords_zero]",
"n_chars": 88,
"n_subproofs": 0... | [
{
"name": "gasCost_eq_precompileGasCost",
"text": "theorem gasCost_eq_precompileGasCost (payload : List Byte) :\n gasCost payload = 60 + 12 * EvmAsm.Evm64.Precompile.inputWords payload.length := by\n simp [gasCost, EvmAsm.Evm64.Precompile.precompileGasCost?,\n EvmAsm.Evm64.Precompile.gasSchedule]\n\n... | [
{
"name": "gasCost_empty",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 146,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting":... | 1 | /-
EvmAsm.EL.Sha256PrecompileDispatch
Pure EVM SHA256 precompile framing. The digest computation is supplied by
the zkVM SHA256 accelerator boundary; this module fixes the target check,
word-linear gas charge, accelerator input, and shared precompile result shape.
-/
import EvmAsm.EL.Sha256PrecompileResultBri... | /-
EvmAsm.EL.Sha256PrecompileDispatch
Pure EVM SHA256 precompile framing. The digest computation is supplied by
the zkVM SHA256 accelerator boundary; this module fixes the target check,
word-linear gas charge, accelerator input, and shared precompile result shape.
-/
import EvmAsm.EL.Sha256PrecompileResultBri... | @@ -46,8 +46,15 @@
else
EvmAsm.Evm64.PrecompileResult.fail input.gas
-theorem gasCost_empty : gasCost ([] : List Byte) = 60 := sorry
+theorem gasCost_eq_precompileGasCost (payload : List Byte) :
+ gasCost payload = 60 + 12 * EvmAsm.Evm64.Precompile.inputWords payload.length := by
+ simp [gasCost, EvmAsm.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_68e2fcaae722_1 | 44acba17d41c10dd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Sha256PrecompileDispatch.lean | Sha256PrecompileDispatch | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "dispatch_success_output_length",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatch_success accelerator h_target h_gas h_status]\n simp [Sha256ResultBridge.hashBytesList_length]"... | [
{
"name": "dispatch_success",
"text": "theorem dispatch_success\n (accelerator : Sha256InputBridge.AcceleratorInput ->\n EvmAsm.Accelerators.ZkvmStatus × Sha256ResultBridge.AcceleratorOutput)\n {input : EvmAsm.Evm64.PrecompileInput}\n (h_target : input.target = .sha256)\n (h_gas : gasCost i... | [
{
"name": "dispatch_success_output_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 581,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.EL.Sha256PrecompileDispatch
Pure EVM SHA256 precompile framing. The digest computation is supplied by
the zkVM SHA256 accelerator boundary; this module fixes the target check,
word-linear gas charge, accelerator input, and shared precompile result shape.
-/
import EvmAsm.EL.Sha256PrecompileResultBri... | /-
EvmAsm.EL.Sha256PrecompileDispatch
Pure EVM SHA256 precompile framing. The digest computation is supplied by
the zkVM SHA256 accelerator boundary; this module fixes the target check,
word-linear gas charge, accelerator input, and shared precompile result shape.
-/
import EvmAsm.EL.Sha256PrecompileResultBri... | @@ -46,6 +46,25 @@
else
EvmAsm.Evm64.PrecompileResult.fail input.gas
+theorem dispatch_success
+ (accelerator : Sha256InputBridge.AcceleratorInput ->
+ EvmAsm.Accelerators.ZkvmStatus × Sha256ResultBridge.AcceleratorOutput)
+ {input : EvmAsm.Evm64.PrecompileInput}
+ (h_target : input.target = .sh... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_daed86a90ee5_0 | 61092bba809dce72 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN4NoNop.lean | FullPathN4NoNop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "divK_loop_body_n4_call_skip_j0_norm_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have raw := divK_loop_body_n4_call_skip_j0_divCode_noNop_within sp jOld v5Old v6Old v7Old v10Old... | [
{
"name": "n4CallSkipJ0NormPost_unfold",
"text": "theorem n4CallSkipJ0NormPost_unfold\n {sp base v3 u3 uTop v0 v1 v2 u0 u1 u2 : Word} :\n n4CallSkipJ0NormPost sp base v3 u3 uTop v0 v1 v2 u0 u1 u2 =\n (loopBodyN4SkipPost sp (0 : Word) (div128Quot uTop u3 v3)\n v0 v1 v2 v3 u0 u1 u2 u3 uTop ... | [
{
"name": "divK_loop_body_n4_call_skip_j0_norm_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 31,
"n_chars": 1661,
"n_subproofs": 1,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 3,
"automation_o... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4NoNop
No-NOP wrappers for the n=4 DIV full path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN4
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
/-- Bundled postcondition for `divK_loop_body_... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4NoNop
No-NOP wrappers for the n=4 DIV full path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN4
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
/-- Bundled postcondition for `divK_loop_body_... | @@ -26,6 +26,17 @@
(sp + signExtend12 3952 ↦ₘ (v3 <<< (32 : BitVec 6).toNat) >>> (32 : BitVec 6).toNat) **
(sp + signExtend12 3944 ↦ₘ (u3 <<< (32 : BitVec 6).toNat) >>> (32 : BitVec 6).toNat) ** regOwn .x1
+theorem n4CallSkipJ0NormPost_unfold
+ {sp base v3 u3 uTop v0 v1 v2 u0 u1 u2 : Word} :
+ n4CallSkipJ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_daed86a90ee5_1 | 69571984d4b12337 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN4NoNop.lean | FullPathN4NoNop | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "divK_loop_body_n4_call_skip_j0_norm_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have raw := divK_loop_body_n4_call_skip_j0_divCode_noNop_within sp jOld v5Old v6Old v7Old v10Old... | [
{
"name": "n4CallSkipJ0NormPost_unfold",
"text": "theorem n4CallSkipJ0NormPost_unfold\n {sp base v3 u3 uTop v0 v1 v2 u0 u1 u2 : Word} :\n n4CallSkipJ0NormPost sp base v3 u3 uTop v0 v1 v2 u0 u1 u2 =\n (loopBodyN4SkipPost sp (0 : Word) (div128Quot uTop u3 v3)\n v0 v1 v2 v3 u0 u1 u2 u3 uTop ... | [
{
"name": "evm_div_n4_preloop_call_skip_spec_noNop",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 87,
"n_chars": 4760,
"n_subproofs": 6,
"n_tactics": 53,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 6,
"n_structural": 1,
"automation_onl... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4NoNop
No-NOP wrappers for the n=4 DIV full path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN4
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
/-- Bundled postcondition for `divK_loop_body_... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4NoNop
No-NOP wrappers for the n=4 DIV full path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN4
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
/-- Bundled postcondition for `divK_loop_body_... | @@ -26,6 +26,17 @@
(sp + signExtend12 3952 ↦ₘ (v3 <<< (32 : BitVec 6).toNat) >>> (32 : BitVec 6).toNat) **
(sp + signExtend12 3944 ↦ₘ (u3 <<< (32 : BitVec 6).toNat) >>> (32 : BitVec 6).toNat) ** regOwn .x1
+theorem n4CallSkipJ0NormPost_unfold
+ {sp base v3 u3 uTop v0 v1 v2 u0 u1 u2 : Word} :
+ n4CallSkipJ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_daed86a90ee5_2 | 5c5b76ad6178e264 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN4NoNop.lean | FullPathN4NoNop | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "evm_div_n4_preloop_call_skip_spec_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 53,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold isCallTrialN4 at hbltu\n unfold isSkipBorrowN4Call at hborrow\n let shift := (clzResult b... | [
{
"name": "divK_loop_body_n4_call_skip_j0_norm_noNop",
"text": "/-- Loop body n=4, call+skip, j=0 with sp-relative addresses over `divCode_noNop`. -/\ntheorem divK_loop_body_n4_call_skip_j0_norm_noNop (sp base : Word)\n (jOld v5Old v6Old v7Old v10Old v11Old v2Old : Word)\n (v0 v1 v2 v3 u0 u1 u2 u3 uTo... | [
{
"name": "evm_div_n4_full_call_skip_spec_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 48,
"n_chars": 2774,
"n_subproofs": 3,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only":... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4NoNop
No-NOP wrappers for the n=4 DIV full path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN4
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
/-- Bundled postcondition for `divK_loop_body_... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4NoNop
No-NOP wrappers for the n=4 DIV full path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN4
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
/-- Bundled postcondition for `divK_loop_body_... | @@ -37,6 +37,36 @@
(sp + signExtend12 3944 ↦ₘ (u3 <<< (32 : BitVec 6).toNat) >>> (32 : BitVec 6).toNat) ** regOwn .x1) := by
delta n4CallSkipJ0NormPost; rfl
+/-- Loop body n=4, call+skip, j=0 with sp-relative addresses over `divCode_noNop`. -/
+theorem divK_loop_body_n4_call_skip_j0_norm_noNop (sp base : 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_838d6c1f91fd_0 | 1663c9ee61d0f2ac | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/RLP/ListDecode.lean | ListDecode | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "decodeAux_shortList_of_singleByte_items",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hitems := decodeItems_singleByte_run\n (rest.take (rlpPrefixShortListPayloadLen pfx)) nDep... | [
{
"name": "decodeItems_singleByte_run",
"text": "/-- A run of single-byte items (`bs`, every byte `< 0x80`) decodes to one\n one-byte `RLPItem` per byte, consuming the whole run. The depth budget\n `2 * bs.length ≤ nDepth` matches the `decodeItems`/`decodeAux` per-item cost\n (one level each). -/\n... | [
{
"name": "decodeAux_shortList_of_singleByte_items",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 24,
"n_chars": 1382,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 4,
"automation_onl... | 1 | /-
EvmAsm.EL.RLP.ListDecode
Pure-spec lemmas about `decodeItems` (list payload decode), supporting the
RV64 list decoder. First slice: a list whose every byte is a single-byte item
(`< 0x80`) decodes to the corresponding list of one-byte `RLPItem.bytes`.
-/
import EvmAsm.EL.RLP.PrefixDecode
import EvmAsm.EL.R... | /-
EvmAsm.EL.RLP.ListDecode
Pure-spec lemmas about `decodeItems` (list payload decode), supporting the
RV64 list decoder. First slice: a list whose every byte is a single-byte item
(`< 0x80`) decodes to the corresponding list of one-byte `RLPItem.bytes`.
-/
import EvmAsm.EL.RLP.PrefixDecode
import EvmAsm.EL.R... | @@ -11,6 +11,34 @@
namespace EvmAsm.EL.RLP
+/-- A run of single-byte items (`bs`, every byte `< 0x80`) decodes to one
+ one-byte `RLPItem` per byte, consuming the whole run. The depth budget
+ `2 * bs.length ≤ nDepth` matches the `decodeItems`/`decodeAux` per-item cost
+ (one level each). -/
+theorem deco... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4be8252b8bd5_0 | 1810cbad63c9358f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePostCases.lean | SavedBitFixedIterCasePostCases | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "expTwoMulFixedIterScratchOwn_choose_frame",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨psScratch, psRest, h_disjoint, h_union, hScratch, hRest⟩ := h\n obtain ⟨v6, v7, v10, v11... | [
{
"name": "expTwoMulFixedIterScratchOwn_choose",
"text": "theorem expTwoMulFixedIterScratchOwn_choose\n {evmSp : Word} {ps : PartialState}\n (h : expTwoMulFixedIterScratchOwn evmSp ps) :\n ∃ v6 v7 v10 v11 d0 d1 d2 d3,\n expTwoMulFixedIterScratchIs evmSp v6 v7 v10 v11 d0 d1 d2 d3 ps := by\n un... | [
{
"name": "expTwoMulFixedIterScratchOwn_choose_frame",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 578,
"n_subproofs": 2,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_onl... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | @@ -45,11 +45,55 @@
d0 d1 d2 d3) :=
⟨expTwoMulFixedIterScratchIs_pcFree⟩
+theorem expTwoMulFixedIterScratchOwn_choose
+ {evmSp : Word} {ps : PartialState}
+ (h : expTwoMulFixedIterScratchOwn evmSp ps) :
+ ∃ v6 v7 v10 v11 d0 d1 d2 d3,
+ expTwoMulFixedIterScratchIs evmSp v6 v7 v10 v11 d0 d1 d2... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4be8252b8bd5_1 | 709d27b5d0571a0b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePostCases.lean | SavedBitFixedIterCasePostCases | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "expTwoMulFixedIterScratchOwn_choose_frame",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨psScratch, psRest, h_disjoint, h_union, hScratch, hRest⟩ := h\n obtain ⟨v6, v7, v10, v11... | [
{
"name": "expTwoMulFixedIterScratchOwn_choose",
"text": "theorem expTwoMulFixedIterScratchOwn_choose\n {evmSp : Word} {ps : PartialState}\n (h : expTwoMulFixedIterScratchOwn evmSp ps) :\n ∃ v6 v7 v10 v11 d0 d1 d2 d3,\n expTwoMulFixedIterScratchIs evmSp v6 v7 v10 v11 d0 d1 d2 d3 ps := by\n un... | [
{
"name": "expTwoMulFixedIterScratchOwn_choose_two_frame",
"fan_in": 9,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 575,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | @@ -45,11 +45,55 @@
d0 d1 d2 d3) :=
⟨expTwoMulFixedIterScratchIs_pcFree⟩
+theorem expTwoMulFixedIterScratchOwn_choose
+ {evmSp : Word} {ps : PartialState}
+ (h : expTwoMulFixedIterScratchOwn evmSp ps) :
+ ∃ v6 v7 v10 v11 d0 d1 d2 d3,
+ expTwoMulFixedIterScratchIs evmSp v6 v7 v10 v11 d0 d1 d2... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4be8252b8bd5_2 | 32752308924d76dc | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePostCases.lean | SavedBitFixedIterCasePostCases | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "expTwoMulFixedIterScratchOwn_choose_two_frame",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hFront :\n (expTwoMulFixedIterScratchOwn evmSp ** (A ** B)) ps := by\n sep_perm ... | [
{
"name": "expTwoMulFixedIterScratchOwn_choose_frame",
"text": "theorem expTwoMulFixedIterScratchOwn_choose_frame\n {evmSp : Word} {B : Assertion} {ps : PartialState}\n (h : (expTwoMulFixedIterScratchOwn evmSp ** B) ps) :\n ∃ v6 v7 v10 v11 d0 d1 d2 d3,\n (expTwoMulFixedIterScratchIs evmSp v6 v... | [
{
"name": "expTwoMulFixedIterSkipCondRest_choose_scratch",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 14,
"n_chars": 620,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation... | 4 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | @@ -84,11 +84,29 @@
refine ⟨ps_d2, ps_rest7, h_disjoint_d2, h_union_d2, h_d2, ?_⟩
exact h_d3
+theorem expTwoMulFixedIterScratchOwn_choose_frame
+ {evmSp : Word} {B : Assertion} {ps : PartialState}
+ (h : (expTwoMulFixedIterScratchOwn evmSp ** B) ps) :
+ ∃ v6 v7 v10 v11 d0 d1 d2 d3,
+ (expTwoMulFix... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4be8252b8bd5_3 | 1591ab4d392edbed | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePostCases.lean | SavedBitFixedIterCasePostCases | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "expTwoMulFixedIterScratchOwn_choose_two_frame",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hFront :\n (expTwoMulFixedIterScratchOwn evmSp ** (A ** B)) ps := by\n sep_perm ... | [
{
"name": "expTwoMulFixedIterScratchOwn_choose_frame",
"text": "theorem expTwoMulFixedIterScratchOwn_choose_frame\n {evmSp : Word} {B : Assertion} {ps : PartialState}\n (h : (expTwoMulFixedIterScratchOwn evmSp ** B) ps) :\n ∃ v6 v7 v10 v11 d0 d1 d2 d3,\n (expTwoMulFixedIterScratchIs evmSp v6 v... | [
{
"name": "expTwoMulFixedIterSkipRest_choose_scratch",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 13,
"n_chars": 571,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_onl... | 4 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | @@ -84,11 +84,29 @@
refine ⟨ps_d2, ps_rest7, h_disjoint_d2, h_union_d2, h_d2, ?_⟩
exact h_d3
+theorem expTwoMulFixedIterScratchOwn_choose_frame
+ {evmSp : Word} {B : Assertion} {ps : PartialState}
+ (h : (expTwoMulFixedIterScratchOwn evmSp ** B) ps) :
+ ∃ v6 v7 v10 v11 d0 d1 d2 d3,
+ (expTwoMulFix... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4be8252b8bd5_4 | 46f88fb346b2347a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePostCases.lean | SavedBitFixedIterCasePostCases | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "expTwoMulFixedIterScratchOwn_choose_two_frame",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hFront :\n (expTwoMulFixedIterScratchOwn evmSp ** (A ** B)) ps := by\n sep_perm ... | [
{
"name": "expTwoMulFixedIterScratchOwn_choose_frame",
"text": "theorem expTwoMulFixedIterScratchOwn_choose_frame\n {evmSp : Word} {B : Assertion} {ps : PartialState}\n (h : (expTwoMulFixedIterScratchOwn evmSp ** B) ps) :\n ∃ v6 v7 v10 v11 d0 d1 d2 d3,\n (expTwoMulFixedIterScratchIs evmSp v6 v... | [
{
"name": "expTwoMulFixedIterReloadSkipRest_choose_scratch",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 14,
"n_chars": 638,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automati... | 4 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | @@ -84,11 +84,29 @@
refine ⟨ps_d2, ps_rest7, h_disjoint_d2, h_union_d2, h_d2, ?_⟩
exact h_d3
+theorem expTwoMulFixedIterScratchOwn_choose_frame
+ {evmSp : Word} {B : Assertion} {ps : PartialState}
+ (h : (expTwoMulFixedIterScratchOwn evmSp ** B) ps) :
+ ∃ v6 v7 v10 v11 d0 d1 d2 d3,
+ (expTwoMulFix... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4be8252b8bd5_5 | 246e3c0b17ac0b55 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePostCases.lean | SavedBitFixedIterCasePostCases | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "expTwoMulFixedIterScratchOwn_choose_two_frame",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hFront :\n (expTwoMulFixedIterScratchOwn evmSp ** (A ** B)) ps := by\n sep_perm ... | [
{
"name": "expTwoMulFixedIterScratchOwn_choose_frame",
"text": "theorem expTwoMulFixedIterScratchOwn_choose_frame\n {evmSp : Word} {B : Assertion} {ps : PartialState}\n (h : (expTwoMulFixedIterScratchOwn evmSp ** B) ps) :\n ∃ v6 v7 v10 v11 d0 d1 d2 d3,\n (expTwoMulFixedIterScratchIs evmSp v6 v... | [
{
"name": "expTwoMulFixedIterSkipCondCountPost_choose_scratch",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 27,
"n_chars": 1267,
"n_subproofs": 1,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"aut... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | @@ -84,11 +84,29 @@
refine ⟨ps_d2, ps_rest7, h_disjoint_d2, h_union_d2, h_d2, ?_⟩
exact h_d3
+theorem expTwoMulFixedIterScratchOwn_choose_frame
+ {evmSp : Word} {B : Assertion} {ps : PartialState}
+ (h : (expTwoMulFixedIterScratchOwn evmSp ** B) ps) :
+ ∃ v6 v7 v10 v11 d0 d1 d2 d3,
+ (expTwoMulFix... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4be8252b8bd5_6 | b7a28a07f039e50f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePostCases.lean | SavedBitFixedIterCasePostCases | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "expTwoMulFixedIterScratchOwn_choose_two_frame",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hFront :\n (expTwoMulFixedIterScratchOwn evmSp ** (A ** B)) ps := by\n sep_perm ... | [
{
"name": "expTwoMulFixedIterScratchOwn_choose_frame",
"text": "theorem expTwoMulFixedIterScratchOwn_choose_frame\n {evmSp : Word} {B : Assertion} {ps : PartialState}\n (h : (expTwoMulFixedIterScratchOwn evmSp ** B) ps) :\n ∃ v6 v7 v10 v11 d0 d1 d2 d3,\n (expTwoMulFixedIterScratchIs evmSp v6 v... | [
{
"name": "expTwoMulFixedIterSkipCountPost_choose_scratch",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 29,
"n_chars": 1251,
"n_subproofs": 1,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automat... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | @@ -84,11 +84,29 @@
refine ⟨ps_d2, ps_rest7, h_disjoint_d2, h_union_d2, h_d2, ?_⟩
exact h_d3
+theorem expTwoMulFixedIterScratchOwn_choose_frame
+ {evmSp : Word} {B : Assertion} {ps : PartialState}
+ (h : (expTwoMulFixedIterScratchOwn evmSp ** B) ps) :
+ ∃ v6 v7 v10 v11 d0 d1 d2 d3,
+ (expTwoMulFix... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4be8252b8bd5_7 | f4b0a5ab6a9d1014 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePostCases.lean | SavedBitFixedIterCasePostCases | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "expTwoMulFixedIterScratchOwn_choose_two_frame",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hFront :\n (expTwoMulFixedIterScratchOwn evmSp ** (A ** B)) ps := by\n sep_perm ... | [
{
"name": "expTwoMulFixedIterScratchOwn_choose_frame",
"text": "theorem expTwoMulFixedIterScratchOwn_choose_frame\n {evmSp : Word} {B : Assertion} {ps : PartialState}\n (h : (expTwoMulFixedIterScratchOwn evmSp ** B) ps) :\n ∃ v6 v7 v10 v11 d0 d1 d2 d3,\n (expTwoMulFixedIterScratchIs evmSp v6 v... | [
{
"name": "expTwoMulFixedIterReloadCondCountPost_choose_scratch",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 30,
"n_chars": 1357,
"n_subproofs": 1,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"a... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | @@ -84,11 +84,29 @@
refine ⟨ps_d2, ps_rest7, h_disjoint_d2, h_union_d2, h_d2, ?_⟩
exact h_d3
+theorem expTwoMulFixedIterScratchOwn_choose_frame
+ {evmSp : Word} {B : Assertion} {ps : PartialState}
+ (h : (expTwoMulFixedIterScratchOwn evmSp ** B) ps) :
+ ∃ v6 v7 v10 v11 d0 d1 d2 d3,
+ (expTwoMulFix... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4be8252b8bd5_8 | c3cb409a930027e3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePostCases.lean | SavedBitFixedIterCasePostCases | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "expTwoMulFixedIterScratchOwn_choose_two_frame",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hFront :\n (expTwoMulFixedIterScratchOwn evmSp ** (A ** B)) ps := by\n sep_perm ... | [
{
"name": "expTwoMulFixedIterScratchOwn_choose_frame",
"text": "theorem expTwoMulFixedIterScratchOwn_choose_frame\n {evmSp : Word} {B : Assertion} {ps : PartialState}\n (h : (expTwoMulFixedIterScratchOwn evmSp ** B) ps) :\n ∃ v6 v7 v10 v11 d0 d1 d2 d3,\n (expTwoMulFixedIterScratchIs evmSp v6 v... | [
{
"name": "expTwoMulFixedIterReloadSkipCountPost_choose_scratch",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 30,
"n_chars": 1357,
"n_subproofs": 1,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"a... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | @@ -84,11 +84,29 @@
refine ⟨ps_d2, ps_rest7, h_disjoint_d2, h_union_d2, h_d2, ?_⟩
exact h_d3
+theorem expTwoMulFixedIterScratchOwn_choose_frame
+ {evmSp : Word} {B : Assertion} {ps : PartialState}
+ (h : (expTwoMulFixedIterScratchOwn evmSp ** B) ps) :
+ ∃ v6 v7 v10 v11 d0 d1 d2 d3,
+ (expTwoMulFix... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4be8252b8bd5_9 | 804c1a2b5a528d00 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePostCases.lean | SavedBitFixedIterCasePostCases | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "expTwoMulFixedIterScratchOwn_choose_two_frame",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hFront :\n (expTwoMulFixedIterScratchOwn evmSp ** (A ** B)) ps := by\n sep_perm ... | [
{
"name": "expTwoMulFixedIterScratchOwn_choose_frame",
"text": "theorem expTwoMulFixedIterScratchOwn_choose_frame\n {evmSp : Word} {B : Assertion} {ps : PartialState}\n (h : (expTwoMulFixedIterScratchOwn evmSp ** B) ps) :\n ∃ v6 v7 v10 v11 d0 d1 d2 d3,\n (expTwoMulFixedIterScratchIs evmSp v6 v... | [
{
"name": "expTwoMulFixedIterSkipCondCountPost_choose_scratch_frame",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 30,
"n_chars": 1354,
"n_subproofs": 1,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | @@ -84,11 +84,29 @@
refine ⟨ps_d2, ps_rest7, h_disjoint_d2, h_union_d2, h_d2, ?_⟩
exact h_d3
+theorem expTwoMulFixedIterScratchOwn_choose_frame
+ {evmSp : Word} {B : Assertion} {ps : PartialState}
+ (h : (expTwoMulFixedIterScratchOwn evmSp ** B) ps) :
+ ∃ v6 v7 v10 v11 d0 d1 d2 d3,
+ (expTwoMulFix... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4be8252b8bd5_10 | 6da65917a15df80c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePostCases.lean | SavedBitFixedIterCasePostCases | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "expTwoMulFixedIterScratchOwn_choose_two_frame",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hFront :\n (expTwoMulFixedIterScratchOwn evmSp ** (A ** B)) ps := by\n sep_perm ... | [
{
"name": "expTwoMulFixedIterScratchOwn_choose_frame",
"text": "theorem expTwoMulFixedIterScratchOwn_choose_frame\n {evmSp : Word} {B : Assertion} {ps : PartialState}\n (h : (expTwoMulFixedIterScratchOwn evmSp ** B) ps) :\n ∃ v6 v7 v10 v11 d0 d1 d2 d3,\n (expTwoMulFixedIterScratchIs evmSp v6 v... | [
{
"name": "expTwoMulFixedIterSkipCountPost_choose_scratch_frame",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 32,
"n_chars": 1338,
"n_subproofs": 1,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"a... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | @@ -84,11 +84,29 @@
refine ⟨ps_d2, ps_rest7, h_disjoint_d2, h_union_d2, h_d2, ?_⟩
exact h_d3
+theorem expTwoMulFixedIterScratchOwn_choose_frame
+ {evmSp : Word} {B : Assertion} {ps : PartialState}
+ (h : (expTwoMulFixedIterScratchOwn evmSp ** B) ps) :
+ ∃ v6 v7 v10 v11 d0 d1 d2 d3,
+ (expTwoMulFix... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4be8252b8bd5_11 | 701f9e4d19d12fc5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePostCases.lean | SavedBitFixedIterCasePostCases | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "expTwoMulFixedIterCaseLoopPost_cases",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n expTwoMulFixedIterCaseLoopPost_iff.mp h",
"n_chars": 42,
"n_subproofs": 0,
"n_tactics": 1,
... | [
{
"name": "expTwoMulFixedIterCaseLoopPost_iff",
"text": "theorem expTwoMulFixedIterCaseLoopPost_iff\n {iterCount e c6 ptr nextLimb sp evmSp\n r0 r1 r2 r3 a0 a1 a2 a3 base : Word} {ps : PartialState} :\n expTwoMulFixedIterCaseLoopPost iterCount e c6 ptr nextLimb sp evmSp\n r0 r1 r2 r3 a0 a1 a... | [
{
"name": "expTwoMulFixedIterCaseLoopPost_cases",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 548,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": f... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | @@ -125,6 +125,17 @@
expTwoMulFixedIterReloadSkipRestScratchSuffix e c6 ptr nextLimb base **
expTwoMulFixedIterBaseFrame evmSp a0 a1 a2 a3
+theorem expTwoMulFixedIterCaseLoopPost_iff
+ {iterCount e c6 ptr nextLimb sp evmSp
+ r0 r1 r2 r3 a0 a1 a2 a3 base : Word} {ps : PartialState} :
+ expTwoMulFixe... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4be8252b8bd5_12 | 31db0ca58a1ac519 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePostCases.lean | SavedBitFixedIterCasePostCases | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "expTwoMulFixedIterCaseExitPost_cases",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n expTwoMulFixedIterCaseExitPost_iff.mp h",
"n_chars": 42,
"n_subproofs": 0,
"n_tactics": 1,
... | [
{
"name": "expTwoMulFixedIterCaseExitPost_iff",
"text": "theorem expTwoMulFixedIterCaseExitPost_iff\n {iterCount e c6 ptr nextLimb sp evmSp\n r0 r1 r2 r3 a0 a1 a2 a3 base : Word} {ps : PartialState} :\n expTwoMulFixedIterCaseExitPost iterCount e c6 ptr nextLimb sp evmSp\n r0 r1 r2 r3 a0 a1 a... | [
{
"name": "expTwoMulFixedIterCaseExitPost_cases",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 548,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": f... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | @@ -125,6 +125,17 @@
expTwoMulFixedIterReloadSkipRestScratchSuffix e c6 ptr nextLimb base **
expTwoMulFixedIterBaseFrame evmSp a0 a1 a2 a3
+theorem expTwoMulFixedIterCaseExitPost_iff
+ {iterCount e c6 ptr nextLimb sp evmSp
+ r0 r1 r2 r3 a0 a1 a2 a3 base : Word} {ps : PartialState} :
+ expTwoMulFixe... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4be8252b8bd5_13 | 9ca7e02909646dc3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePostCases.lean | SavedBitFixedIterCasePostCases | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "expTwoMulFixedIterReloadLoopPost_cases",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n expTwoMulFixedIterReloadLoopPost_iff.mp h",
"n_chars": 44,
"n_subproofs": 0,
"n_tactics": 1... | [
{
"name": "expTwoMulFixedIterReloadLoopPost_iff",
"text": "theorem expTwoMulFixedIterReloadLoopPost_iff\n {iterCount e c6 ptr nextLimb sp evmSp\n r0 r1 r2 r3 a0 a1 a2 a3 base : Word} {ps : PartialState} :\n expTwoMulFixedIterReloadLoopPost iterCount e c6 ptr nextLimb sp evmSp\n r0 r1 r2 r3 a... | [
{
"name": "expTwoMulFixedIterReloadLoopPost_cases",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 658,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only":... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | @@ -125,6 +125,19 @@
expTwoMulFixedIterReloadSkipRestScratchSuffix e c6 ptr nextLimb base **
expTwoMulFixedIterBaseFrame evmSp a0 a1 a2 a3
+theorem expTwoMulFixedIterReloadLoopPost_iff
+ {iterCount e c6 ptr nextLimb sp evmSp
+ r0 r1 r2 r3 a0 a1 a2 a3 base : Word} {ps : PartialState} :
+ expTwoMulFi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4be8252b8bd5_14 | c462660efa22f743 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePostCases.lean | SavedBitFixedIterCasePostCases | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "expTwoMulFixedIterReloadExitPost_cases",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n expTwoMulFixedIterReloadExitPost_iff.mp h",
"n_chars": 44,
"n_subproofs": 0,
"n_tactics": 1... | [
{
"name": "expTwoMulFixedIterReloadExitPost_iff",
"text": "theorem expTwoMulFixedIterReloadExitPost_iff\n {iterCount e c6 ptr nextLimb sp evmSp\n r0 r1 r2 r3 a0 a1 a2 a3 base : Word} {ps : PartialState} :\n expTwoMulFixedIterReloadExitPost iterCount e c6 ptr nextLimb sp evmSp\n r0 r1 r2 r3 a... | [
{
"name": "expTwoMulFixedIterReloadExitPost_cases",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 654,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only":... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | @@ -125,6 +125,19 @@
expTwoMulFixedIterReloadSkipRestScratchSuffix e c6 ptr nextLimb base **
expTwoMulFixedIterBaseFrame evmSp a0 a1 a2 a3
+theorem expTwoMulFixedIterReloadExitPost_iff
+ {iterCount e c6 ptr nextLimb sp evmSp
+ r0 r1 r2 r3 a0 a1 a2 a3 base : Word} {ps : PartialState} :
+ expTwoMulFi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4be8252b8bd5_15 | 2a5e6438d1d3d157 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePostCases.lean | SavedBitFixedIterCasePostCases | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "expTwoMulFixedIterCaseLoopPost_cases",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n expTwoMulFixedIterCaseLoopPost_iff.mp h",
"n_chars": 42,
"n_subproofs": 0,
"n_tactics": 1,
... | [
{
"name": "expTwoMulFixedIterCaseLoopPost_iff",
"text": "theorem expTwoMulFixedIterCaseLoopPost_iff\n {iterCount e c6 ptr nextLimb sp evmSp\n r0 r1 r2 r3 a0 a1 a2 a3 base : Word} {ps : PartialState} :\n expTwoMulFixedIterCaseLoopPost iterCount e c6 ptr nextLimb sp evmSp\n r0 r1 r2 r3 a0 a1 a... | [
{
"name": "expTwoMulFixedIterCaseLoopPost_count_cases",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 29,
"n_chars": 1417,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 4,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 7,
"automation_o... | 5 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | @@ -125,6 +125,17 @@
expTwoMulFixedIterReloadSkipRestScratchSuffix e c6 ptr nextLimb base **
expTwoMulFixedIterBaseFrame evmSp a0 a1 a2 a3
+theorem expTwoMulFixedIterCaseLoopPost_iff
+ {iterCount e c6 ptr nextLimb sp evmSp
+ r0 r1 r2 r3 a0 a1 a2 a3 base : Word} {ps : PartialState} :
+ expTwoMulFixe... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4be8252b8bd5_16 | 23416c9ca03dd438 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePostCases.lean | SavedBitFixedIterCasePostCases | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "expTwoMulFixedIterCaseExitPost_cases",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n expTwoMulFixedIterCaseExitPost_iff.mp h",
"n_chars": 42,
"n_subproofs": 0,
"n_tactics": 1,
... | [
{
"name": "expTwoMulFixedIterCaseExitPost_iff",
"text": "theorem expTwoMulFixedIterCaseExitPost_iff\n {iterCount e c6 ptr nextLimb sp evmSp\n r0 r1 r2 r3 a0 a1 a2 a3 base : Word} {ps : PartialState} :\n expTwoMulFixedIterCaseExitPost iterCount e c6 ptr nextLimb sp evmSp\n r0 r1 r2 r3 a0 a1 a... | [
{
"name": "expTwoMulFixedIterCaseExitPost_count_cases",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 29,
"n_chars": 1409,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 4,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 7,
"automation_o... | 5 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | @@ -125,6 +125,17 @@
expTwoMulFixedIterReloadSkipRestScratchSuffix e c6 ptr nextLimb base **
expTwoMulFixedIterBaseFrame evmSp a0 a1 a2 a3
+theorem expTwoMulFixedIterCaseExitPost_iff
+ {iterCount e c6 ptr nextLimb sp evmSp
+ r0 r1 r2 r3 a0 a1 a2 a3 base : Word} {ps : PartialState} :
+ expTwoMulFixe... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4be8252b8bd5_17 | 1f72f0174af04736 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePostCases.lean | SavedBitFixedIterCasePostCases | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 9 | [
{
"theorem_name": "expTwoMulFixedIterSkipCondRest_choose_scratch",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hDecomp := expTwoMulFixedIterSkipCondRest_scratch_decomp h\n exact expTwoMulFixedIterSc... | [
{
"name": "expTwoMulFixedIterScratchOwn_choose_two_frame",
"text": "theorem expTwoMulFixedIterScratchOwn_choose_two_frame\n {evmSp : Word} {A B : Assertion} {ps : PartialState}\n (h : (A ** expTwoMulFixedIterScratchOwn evmSp ** B) ps) :\n ∃ v6 v7 v10 v11 d0 d1 d2 d3,\n (A ** expTwoMulFixedIter... | [
{
"name": "expTwoMulFixedIterCaseLoopPost_scratch_cases",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 13,
"n_lines": 48,
"n_chars": 2417,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 4,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 7,
"automati... | 13 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | @@ -95,6 +95,19 @@
exact ⟨v6, v7, v10, v11, d0, d1, d2, d3,
psScratch, psRest, h_disjoint, h_union, hScratchIs, hRest⟩
+theorem expTwoMulFixedIterScratchOwn_choose_two_frame
+ {evmSp : Word} {A B : Assertion} {ps : PartialState}
+ (h : (A ** expTwoMulFixedIterScratchOwn evmSp ** B) ps) :
+ ∃ v6 v7 v1... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4be8252b8bd5_18 | 92ed011575dd1c4b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePostCases.lean | SavedBitFixedIterCasePostCases | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 9 | [
{
"theorem_name": "expTwoMulFixedIterSkipCondRest_choose_scratch",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hDecomp := expTwoMulFixedIterSkipCondRest_scratch_decomp h\n exact expTwoMulFixedIterSc... | [
{
"name": "expTwoMulFixedIterScratchOwn_choose_two_frame",
"text": "theorem expTwoMulFixedIterScratchOwn_choose_two_frame\n {evmSp : Word} {A B : Assertion} {ps : PartialState}\n (h : (A ** expTwoMulFixedIterScratchOwn evmSp ** B) ps) :\n ∃ v6 v7 v10 v11 d0 d1 d2 d3,\n (A ** expTwoMulFixedIter... | [
{
"name": "expTwoMulFixedIterCaseExitPost_scratch_cases",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 13,
"n_lines": 48,
"n_chars": 2409,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 4,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 7,
"automati... | 13 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | @@ -95,6 +95,19 @@
exact ⟨v6, v7, v10, v11, d0, d1, d2, d3,
psScratch, psRest, h_disjoint, h_union, hScratchIs, hRest⟩
+theorem expTwoMulFixedIterScratchOwn_choose_two_frame
+ {evmSp : Word} {A B : Assertion} {ps : PartialState}
+ (h : (A ** expTwoMulFixedIterScratchOwn evmSp ** B) ps) :
+ ∃ v6 v7 v1... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4be8252b8bd5_19 | 5cd1f61bbb0c0abe | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePostCases.lean | SavedBitFixedIterCasePostCases | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 9 | [
{
"theorem_name": "expTwoMulFixedIterSkipCondRest_choose_scratch",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hDecomp := expTwoMulFixedIterSkipCondRest_scratch_decomp h\n exact expTwoMulFixedIterSc... | [
{
"name": "expTwoMulFixedIterScratchOwn_choose_two_frame",
"text": "theorem expTwoMulFixedIterScratchOwn_choose_two_frame\n {evmSp : Word} {A B : Assertion} {ps : PartialState}\n (h : (A ** expTwoMulFixedIterScratchOwn evmSp ** B) ps) :\n ∃ v6 v7 v10 v11 d0 d1 d2 d3,\n (A ** expTwoMulFixedIter... | [
{
"name": "expTwoMulFixedIterCaseLoopPost_scratch_cases_frame",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 14,
"n_lines": 65,
"n_chars": 3098,
"n_subproofs": 1,
"n_tactics": 23,
"cyclomatic": 8,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 12,
"a... | 14 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | @@ -95,6 +95,19 @@
exact ⟨v6, v7, v10, v11, d0, d1, d2, d3,
psScratch, psRest, h_disjoint, h_union, hScratchIs, hRest⟩
+theorem expTwoMulFixedIterScratchOwn_choose_two_frame
+ {evmSp : Word} {A B : Assertion} {ps : PartialState}
+ (h : (A ** expTwoMulFixedIterScratchOwn evmSp ** B) ps) :
+ ∃ v6 v7 v1... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4be8252b8bd5_20 | 9e1dc4db770da911 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePostCases.lean | SavedBitFixedIterCasePostCases | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "expTwoMulFixedIterReloadLoopPost_cases",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n expTwoMulFixedIterReloadLoopPost_iff.mp h",
"n_chars": 44,
"n_subproofs": 0,
"n_tactics": 1... | [
{
"name": "expTwoMulFixedIterReloadLoopPost_iff",
"text": "theorem expTwoMulFixedIterReloadLoopPost_iff\n {iterCount e c6 ptr nextLimb sp evmSp\n r0 r1 r2 r3 a0 a1 a2 a3 base : Word} {ps : PartialState} :\n expTwoMulFixedIterReloadLoopPost iterCount e c6 ptr nextLimb sp evmSp\n r0 r1 r2 r3 a... | [
{
"name": "expTwoMulFixedIterCaseLoopPost_pure_cases",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 10,
"n_lines": 37,
"n_chars": 1884,
"n_subproofs": 6,
"n_tactics": 18,
"cyclomatic": 4,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 13,
"automation... | 10 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | @@ -136,6 +136,19 @@
r0 r1 r2 r3 a0 a1 a2 a3 base ps := by
rfl
+theorem expTwoMulFixedIterReloadLoopPost_iff
+ {iterCount e c6 ptr nextLimb sp evmSp
+ r0 r1 r2 r3 a0 a1 a2 a3 base : Word} {ps : PartialState} :
+ expTwoMulFixedIterReloadLoopPost iterCount e c6 ptr nextLimb sp evmSp
+ r0 r1 r2... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4be8252b8bd5_21 | e42a3ada82c07572 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePostCases.lean | SavedBitFixedIterCasePostCases | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "expTwoMulFixedIterReloadExitPost_cases",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n expTwoMulFixedIterReloadExitPost_iff.mp h",
"n_chars": 44,
"n_subproofs": 0,
"n_tactics": 1... | [
{
"name": "expTwoMulFixedIterReloadExitPost_iff",
"text": "theorem expTwoMulFixedIterReloadExitPost_iff\n {iterCount e c6 ptr nextLimb sp evmSp\n r0 r1 r2 r3 a0 a1 a2 a3 base : Word} {ps : PartialState} :\n expTwoMulFixedIterReloadExitPost iterCount e c6 ptr nextLimb sp evmSp\n r0 r1 r2 r3 a... | [
{
"name": "expTwoMulFixedIterCaseExitPost_pure_cases",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 10,
"n_lines": 37,
"n_chars": 1876,
"n_subproofs": 6,
"n_tactics": 18,
"cyclomatic": 4,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 13,
"automation... | 10 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostCases
Case-splitting lemmas for fixed x19 named case-post assertions.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePostBridge
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterScratchOwn (evmSp : Word) : Assertion :=
r... | @@ -136,6 +136,19 @@
r0 r1 r2 r3 a0 a1 a2 a3 base ps := by
rfl
+theorem expTwoMulFixedIterReloadExitPost_iff
+ {iterCount e c6 ptr nextLimb sp evmSp
+ r0 r1 r2 r3 a0 a1 a2 a3 base : Word} {ps : PartialState} :
+ expTwoMulFixedIterReloadExitPost iterCount e c6 ptr nextLimb sp evmSp
+ r0 r1 r2... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "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.