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_6cfa2e77dfe9_15 | 3eace8b8841ebcc6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerLoopBridge.lean | HandlerLoopBridge | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "loopFuel_succ_running_missing_invalid_status",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loopFuel_succ_running_missing_invalid nSteps h_status h_decode h_lookup]\n exact loopFuel... | [
{
"name": "loopFuel_table_invalid_fixed_status",
"text": "theorem loopFuel_table_invalid_fixed_status\n (table : HandlerTable) (nSteps : Nat) (state : EvmState) :\n (InterpreterLoop.loopFuel (toLoopHandler table) nSteps state.invalid).status =\n .error := by\n rw [loopFuel_table_invalid_fixed ta... | [
{
"name": "loopFuel_succ_running_missing_invalid_status",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 12,
"n_chars": 536,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_... | 4 | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | @@ -61,6 +61,13 @@
| nSteps + 1, state => by
simp [InterpreterLoop.loopFuel]
+theorem loopFuel_table_invalid_fixed_status
+ (table : HandlerTable) (nSteps : Nat) (state : EvmState) :
+ (InterpreterLoop.loopFuel (toLoopHandler table) nSteps state.invalid).status =
+ .error := by
+ rw [loopFuel_ta... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6cfa2e77dfe9_16 | 29a38677b78cc33c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerLoopBridge.lean | HandlerLoopBridge | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "loopFuel_succ_running_unsupported_invalid_status",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loopFuel_succ_running_unsupported_invalid table nSteps h_status h_decode]\n exact loo... | [
{
"name": "loopFuel_succ_running_unsupported_invalid",
"text": "theorem loopFuel_succ_running_unsupported_invalid\n (table : HandlerTable) (nSteps : Nat) {state : EvmState}\n (h_status : state.status = .running)\n (h_decode : InterpreterLoop.decodeCurrentOpcode? state = none) :\n InterpreterLoop... | [
{
"name": "loopFuel_succ_running_unsupported_invalid_status",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 472,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automat... | 2 | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | @@ -40,12 +40,23 @@
rw [loopFuel_table_invalid_fixed table nSteps state]
exact EvmState.invalid_status state
+theorem loopFuel_succ_running_unsupported_invalid
+ (table : HandlerTable) (nSteps : Nat) {state : EvmState}
+ (h_status : state.status = .running)
+ (h_decode : InterpreterLoop.decodeCurrentOp... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6cfa2e77dfe9_17 | fe4d001654c79150 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerLoopBridge.lean | HandlerLoopBridge | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "stepWithTableHandler_eof_invalid_status",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [stepWithTableHandler_eof_invalid table h_pc]\n exact EvmState.invalid_status state",
"n_ch... | [
{
"name": "stepWithTableHandler_eof_invalid",
"text": "theorem stepWithTableHandler_eof_invalid\n (table : HandlerTable) {state : EvmState}\n (h_pc : state.code.length ≤ state.pc) :\n InterpreterLoop.stepWithHandler (toLoopHandler table) state = state.invalid := by\n exact InterpreterLoop.stepWith... | [
{
"name": "loopFuel_succ_running_eof_invalid",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 483,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": fals... | 1 | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | @@ -25,6 +25,12 @@
toLoopHandler table opcode state =
HandlerTable.dispatchOpcode table opcode state := rfl
+theorem stepWithTableHandler_eof_invalid
+ (table : HandlerTable) {state : EvmState}
+ (h_pc : state.code.length ≤ state.pc) :
+ InterpreterLoop.stepWithHandler (toLoopHandler table) state... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6cfa2e77dfe9_18 | 92c402dc6e5a28c3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerLoopBridge.lean | HandlerLoopBridge | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "loopFuel_succ_running_eof_invalid_status",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loopFuel_succ_running_eof_invalid table nSteps h_status h_pc]\n exact loopFuel_table_invalid_... | [
{
"name": "loopFuel_succ_running_eof_invalid",
"text": "theorem loopFuel_succ_running_eof_invalid\n (table : HandlerTable) (nSteps : Nat) {state : EvmState}\n (h_status : state.status = .running)\n (h_pc : state.code.length ≤ state.pc) :\n InterpreterLoop.loopFuel (toLoopHandler table) (nSteps +... | [
{
"name": "loopFuel_succ_running_eof_invalid_status",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 10,
"n_chars": 429,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only... | 3 | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | @@ -46,12 +46,23 @@
rw [loopFuel_table_invalid_fixed table nSteps state]
exact EvmState.invalid_status state
+theorem loopFuel_succ_running_eof_invalid
+ (table : HandlerTable) (nSteps : Nat) {state : EvmState}
+ (h_status : state.status = .running)
+ (h_pc : state.code.length ≤ state.pc) :
+ Interp... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6cfa2e77dfe9_19 | ee8ca1987480489a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerLoopBridge.lean | HandlerLoopBridge | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "loopFuel_succ_running_decode_status",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loopFuel_succ_running_decode table nSteps h_status h_decode]",
"n_chars": 70,
"n_subproofs"... | [
{
"name": "loopFuel_succ_running_decode",
"text": "theorem loopFuel_succ_running_decode\n (table : HandlerTable) (nSteps : Nat) {state : EvmState} {opcode : EvmOpcode}\n (h_status : state.status = .running)\n (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some opcode) :\n InterpreterLo... | [
{
"name": "loopFuel_empty_succ_running_decode",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 515,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fal... | 2 | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | @@ -32,6 +32,16 @@
HandlerTable.dispatchOpcode table opcode state := by
simp [InterpreterLoop.stepWithHandler, h_decode, toLoopHandler]
+theorem loopFuel_succ_running_decode
+ (table : HandlerTable) (nSteps : Nat) {state : EvmState} {opcode : EvmOpcode}
+ (h_status : state.status = .running)
+ (h_d... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6cfa2e77dfe9_20 | 61ba0a084f238b71 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerLoopBridge.lean | HandlerLoopBridge | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "loopFuel_succ_running_missing_invalid_status",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loopFuel_succ_running_missing_invalid nSteps h_status h_decode h_lookup]\n exact loopFuel... | [
{
"name": "loopFuel_table_invalid_fixed_status",
"text": "theorem loopFuel_table_invalid_fixed_status\n (table : HandlerTable) (nSteps : Nat) (state : EvmState) :\n (InterpreterLoop.loopFuel (toLoopHandler table) nSteps state.invalid).status =\n .error := by\n rw [loopFuel_table_invalid_fixed ta... | [
{
"name": "loopFuel_empty_succ_running_decode_status",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 483,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_onl... | 4 | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | @@ -50,6 +50,13 @@
| nSteps + 1, state => by
simp [InterpreterLoop.loopFuel]
+theorem loopFuel_table_invalid_fixed_status
+ (table : HandlerTable) (nSteps : Nat) (state : EvmState) :
+ (InterpreterLoop.loopFuel (toLoopHandler table) nSteps state.invalid).status =
+ .error := by
+ rw [loopFuel_ta... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_62fd4e7f2037_0 | 5c20d54d1d877593 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV2/QuotientBounds.lean | QuotientBounds | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "algorithmQ1Prime_step5_ult_bridge",
"depth": 1,
"n_commands": 0,
"n_lines": 47,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro dHi dLo div_un1 q1 rhat hi1 q1c rhatc rhatUn1\n have h_dHi_lt : dHi.toNat < 2^32 := by\n show ... | [
{
"name": "algorithmQ1Prime_step4_rhatc_lt_pow32",
"text": "/-- **_plus_one sub-step 4**: `rhatc.toNat < 2^32` under `u4 < dHi*2^32`.\n Direct wrapping of `div128Quot_rhatc_lt_pow32_of_uHi_lt_dHi_mul_pow32`. -/\ntheorem algorithmQ1Prime_step4_rhatc_lt_pow32\n (u4 b3' : Word)\n (hb3'_ge : b3'.toNat ... | [
{
"name": "algorithmQ1Prime_step5_ult_bridge",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 68,
"n_chars": 3376,
"n_subproofs": 17,
"n_tactics": 42,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 12,
"n_structural": 6,
"automation_only": ... | 1 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.QuotientBounds
Quotient/algorithm Word→Nat bridge wrappers and the per-step `_plus_one`
decomposition (steps 1–6) used by §A1 / A2.S1 of the call-skip lower bound
proof. Extracted from `CallSkipLowerBoundV2.lean` for file-size hygiene.
## Contents
- `algo... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.QuotientBounds
Quotient/algorithm Word→Nat bridge wrappers and the per-step `_plus_one`
decomposition (steps 1–6) used by §A1 / A2.S1 of the call-skip lower bound
proof. Extracted from `CallSkipLowerBoundV2.lean` for file-size hygiene.
## Contents
- `algo... | @@ -38,6 +38,31 @@
-- `CompensationCases.lean`) means this lemma is no longer needed. See
-- `memory/project_a2s2_per_phase_tightness_fails.md` for details.
+/-- **_plus_one sub-step 4**: `rhatc.toNat < 2^32` under `u4 < dHi*2^32`.
+ Direct wrapping of `div128Quot_rhatc_lt_pow32_of_uHi_lt_dHi_mul_pow32`. -/
+the... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_62fd4e7f2037_1 | 0114553468e6f5e3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV2/QuotientBounds.lean | QuotientBounds | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "algorithmQ1Prime_step5_ult_bridge",
"depth": 1,
"n_commands": 0,
"n_lines": 47,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro dHi dLo div_un1 q1 rhat hi1 q1c rhatc rhatUn1\n have h_dHi_lt : dHi.toNat < 2^32 := by\n show ... | [
{
"name": "algorithmQ1Prime_step4_rhatc_lt_pow32",
"text": "/-- **_plus_one sub-step 4**: `rhatc.toNat < 2^32` under `u4 < dHi*2^32`.\n Direct wrapping of `div128Quot_rhatc_lt_pow32_of_uHi_lt_dHi_mul_pow32`. -/\ntheorem algorithmQ1Prime_step4_rhatc_lt_pow32\n (u4 b3' : Word)\n (hb3'_ge : b3'.toNat ... | [
{
"name": "algorithmQ1Prime_step6_word_nat_if_bridge",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 50,
"n_chars": 2378,
"n_subproofs": 5,
"n_tactics": 25,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 9,
"n_structural": 3,
"automation_o... | 2 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.QuotientBounds
Quotient/algorithm Word→Nat bridge wrappers and the per-step `_plus_one`
decomposition (steps 1–6) used by §A1 / A2.S1 of the call-skip lower bound
proof. Extracted from `CallSkipLowerBoundV2.lean` for file-size hygiene.
## Contents
- `algo... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.QuotientBounds
Quotient/algorithm Word→Nat bridge wrappers and the per-step `_plus_one`
decomposition (steps 1–6) used by §A1 / A2.S1 of the call-skip lower bound
proof. Extracted from `CallSkipLowerBoundV2.lean` for file-size hygiene.
## Contents
- `algo... | @@ -38,6 +38,31 @@
-- `CompensationCases.lean`) means this lemma is no longer needed. See
-- `memory/project_a2s2_per_phase_tightness_fails.md` for details.
+/-- **_plus_one sub-step 4**: `rhatc.toNat < 2^32` under `u4 < dHi*2^32`.
+ Direct wrapping of `div128Quot_rhatc_lt_pow32_of_uHi_lt_dHi_mul_pow32`. -/
+the... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_62fd4e7f2037_2 | 461d569e6f769081 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV2/QuotientBounds.lean | QuotientBounds | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "algorithmQ1Prime_le_q_true_1_plus_one",
"depth": 1,
"n_commands": 0,
"n_lines": 54,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_v_eq : b3'.toNat =\n (b3' >>> (32 : BitVec 6).toNat).toNat * 2^32 +\n ((b3' <<< (32... | [
{
"name": "algorithmQ1Prime_step3_q1c_le_q_true_1_plus_two",
"text": "/-- **_plus_one sub-step 3**: `q1c ≤ q_true_1 + 2` via trial_quotient_le\n + Phase 1a monotonicity. -/\ntheorem algorithmQ1Prime_step3_q1c_le_q_true_1_plus_two\n (u4 u3 b3' : Word)\n (hb3'_ge : b3'.toNat ≥ 2^63)\n (hu4_lt_b3' ... | [
{
"name": "algorithmQ1Prime_le_q_true_1_plus_one",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 74,
"n_chars": 3965,
"n_subproofs": 8,
"n_tactics": 54,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 4,
"n_structural": 1,
"automation_only"... | 5 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.QuotientBounds
Quotient/algorithm Word→Nat bridge wrappers and the per-step `_plus_one`
decomposition (steps 1–6) used by §A1 / A2.S1 of the call-skip lower bound
proof. Extracted from `CallSkipLowerBoundV2.lean` for file-size hygiene.
## Contents
- `algo... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.QuotientBounds
Quotient/algorithm Word→Nat bridge wrappers and the per-step `_plus_one`
decomposition (steps 1–6) used by §A1 / A2.S1 of the call-skip lower bound
proof. Extracted from `CallSkipLowerBoundV2.lean` for file-size hygiene.
## Contents
- `algo... | @@ -65,6 +65,63 @@
exact div128Quot_first_round_post u4 (b3' >>> (32 : BitVec 6).toNat)
h_dHi_ne h_dHi_lt
+/-- **_plus_one sub-step 3**: `q1c ≤ q_true_1 + 2` via trial_quotient_le
+ + Phase 1a monotonicity. -/
+theorem algorithmQ1Prime_step3_q1c_le_q_true_1_plus_two
+ (u4 u3 b3' : Word)
+ (hb3'_ge : ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_575f1155b8ff_0 | 79c7782ebcfd2030 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3V5QuotientShape.lean | N3V5QuotientShape | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "div_getLimbN_eq_digit_n3_v5_of_shape",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hword := fullDivN3QuotientWordV5_eq_div_of_shape a0 a1 a2 a3 b0 b1 b2 b3\n bltu_1 bltu_0 hb3z ... | [
{
"name": "fullDivN3QuotientWordV5_eq_div_of_shape",
"text": "/-- **v5 n=3 quotient correctness (shift≠0), from shape + `bltu` path matches.**\n The assembled v5 n=3 quotient word equals `EvmWord.div a b`. -/\ntheorem fullDivN3QuotientWordV5_eq_div_of_shape\n (a0 a1 a2 a3 b0 b1 b2 b3 : Word) (bltu_1 b... | [
{
"name": "div_getLimbN_eq_digit_n3_v5_of_shape",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 38,
"n_chars": 2288,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": ... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N3V5QuotientShape
**v5 n=3 quotient correctness from shape (shift≠0):**
`fullDivN3QuotientWordV5 = EvmWord.div a b`.
Combines the accumulated-quotient telescope `fullDivN3_acc_quot_eq_div_of_shape`
(N3V5AccQuot) with the `EvmWord` lift `div_of_val256_eq_div`: the assembled
quot... | /-
EvmAsm.Evm64.DivMod.Spec.N3V5QuotientShape
**v5 n=3 quotient correctness from shape (shift≠0):**
`fullDivN3QuotientWordV5 = EvmWord.div a b`.
Combines the accumulated-quotient telescope `fullDivN3_acc_quot_eq_div_of_shape`
(N3V5AccQuot) with the `EvmWord` lift `div_of_val256_eq_div`: the assembled
quot... | @@ -22,6 +22,40 @@
open EvmWord EvmAsm.Rv64
+/-- **v5 n=3 quotient correctness (shift≠0), from shape + `bltu` path matches.**
+ The assembled v5 n=3 quotient word equals `EvmWord.div a b`. -/
+theorem fullDivN3QuotientWordV5_eq_div_of_shape
+ (a0 a1 a2 a3 b0 b1 b2 b3 : Word) (bltu_1 bltu_0 : Bool)
+ (hb3z... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6c1c91c6272c_0 | 9c8701ad8da957f5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EnvHandlers.lean | EnvHandlers | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "simpleEnvHandler?_of_field",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [simpleEnvHandler?, fieldOfOpcode?_of_field]",
"n_chars": 55,
"n_subproofs": 0,
"n_tactics": 2,... | [
{
"name": "fieldOfOpcode?_of_field",
"text": "theorem fieldOfOpcode?_of_field (field : SimpleEnvField) :\n fieldOfOpcode? field.opcode = some field := by\n cases field <;> rfl\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 133,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
... | [
{
"name": "simpleEnvHandler?_of_field",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 188,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"m... | 1 | /-
EvmAsm.Evm64.EnvHandlers
Generic pure handler-table entries for simple environment opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.Env.Gas
namespace EvmAsm.Evm64
namespace EnvHandlers
abbrev SimpleEnvField := Env.SimpleEnvField
/-- Decode handler-table opcodes back to the simple e... | /-
EvmAsm.Evm64.EnvHandlers
Generic pure handler-table entries for simple environment opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.Env.Gas
namespace EvmAsm.Evm64
namespace EnvHandlers
abbrev SimpleEnvField := Env.SimpleEnvField
/-- Decode handler-table opcodes back to the simple e... | @@ -61,8 +61,13 @@
@[simp] theorem simpleEnvHandlerTable_eq :
simpleEnvHandlerTable = simpleEnvHandler? := rfl
+theorem fieldOfOpcode?_of_field (field : SimpleEnvField) :
+ fieldOfOpcode? field.opcode = some field := by
+ cases field <;> rfl
+
theorem simpleEnvHandler?_of_field (field : SimpleEnvField) :
-... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6c1c91c6272c_1 | a42465a9d0a43ae6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EnvHandlers.lean | EnvHandlers | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "dispatchOpcode?_simpleEnvHandlerTable_of_field",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact HandlerTable.dispatchOpcode?_some\n (simpleEnvHandler?_of_field field) state",
... | [
{
"name": "simpleEnvHandler?_of_field",
"text": "theorem simpleEnvHandler?_of_field (field : SimpleEnvField) :\n simpleEnvHandler? field.opcode = some (simpleEnvHandler field) := by\n simp [simpleEnvHandler?, fieldOfOpcode?_of_field]\n\n",
"fan_in": 2,
"n_lines": 5,
"n_chars": 188,
"n_su... | [
{
"name": "dispatchOpcode?_simpleEnvHandlerTable_of_field",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 317,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation... | 2 | /-
EvmAsm.Evm64.EnvHandlers
Generic pure handler-table entries for simple environment opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.Env.Gas
namespace EvmAsm.Evm64
namespace EnvHandlers
abbrev SimpleEnvField := Env.SimpleEnvField
/-- Decode handler-table opcodes back to the simple e... | /-
EvmAsm.Evm64.EnvHandlers
Generic pure handler-table entries for simple environment opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.Env.Gas
namespace EvmAsm.Evm64
namespace EnvHandlers
abbrev SimpleEnvField := Env.SimpleEnvField
/-- Decode handler-table opcodes back to the simple e... | @@ -65,10 +65,16 @@
fieldOfOpcode? field.opcode = some field := by
cases field <;> rfl
+theorem simpleEnvHandler?_of_field (field : SimpleEnvField) :
+ simpleEnvHandler? field.opcode = some (simpleEnvHandler field) := by
+ simp [simpleEnvHandler?, fieldOfOpcode?_of_field]
+
theorem dispatchOpcode?_simple... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6c1c91c6272c_2 | 95b0985327858988 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EnvHandlers.lean | EnvHandlers | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "dispatchOpcode?_simpleEnvHandlerTable_of_field",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact HandlerTable.dispatchOpcode?_some\n (simpleEnvHandler?_of_field field) state",
... | [
{
"name": "simpleEnvHandler?_of_field",
"text": "theorem simpleEnvHandler?_of_field (field : SimpleEnvField) :\n simpleEnvHandler? field.opcode = some (simpleEnvHandler field) := by\n simp [simpleEnvHandler?, fieldOfOpcode?_of_field]\n\n",
"fan_in": 2,
"n_lines": 5,
"n_chars": 188,
"n_su... | [
{
"name": "dispatchOpcode_simpleEnvHandlerTable_of_field",
"fan_in": 5,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 307,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_... | 2 | /-
EvmAsm.Evm64.EnvHandlers
Generic pure handler-table entries for simple environment opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.Env.Gas
namespace EvmAsm.Evm64
namespace EnvHandlers
abbrev SimpleEnvField := Env.SimpleEnvField
/-- Decode handler-table opcodes back to the simple e... | /-
EvmAsm.Evm64.EnvHandlers
Generic pure handler-table entries for simple environment opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.Env.Gas
namespace EvmAsm.Evm64
namespace EnvHandlers
abbrev SimpleEnvField := Env.SimpleEnvField
/-- Decode handler-table opcodes back to the simple e... | @@ -65,10 +65,16 @@
fieldOfOpcode? field.opcode = some field := by
cases field <;> rfl
+theorem simpleEnvHandler?_of_field (field : SimpleEnvField) :
+ simpleEnvHandler? field.opcode = some (simpleEnvHandler field) := by
+ simp [simpleEnvHandler?, fieldOfOpcode?_of_field]
+
theorem dispatchOpcode_simpleE... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6c1c91c6272c_3 | d837039103e5be6e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EnvHandlers.lean | EnvHandlers | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 5 | [
{
"theorem_name": "dispatchOpcode_simpleEnvHandlerTable_of_field_status",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatchOpcode_simpleEnvHandlerTable_of_field field state]\n exact simpleEnvHandl... | [
{
"name": "dispatchOpcode_simpleEnvHandlerTable_of_field",
"text": "theorem dispatchOpcode_simpleEnvHandlerTable_of_field\n (field : SimpleEnvField) (state : EvmState) :\n HandlerTable.dispatchOpcode simpleEnvHandlerTable field.opcode state =\n simpleEnvHandler field state := by\n exact HandlerT... | [
{
"name": "dispatchOpcode_simpleEnvHandlerTable_of_field_status",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 330,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"auto... | 3 | /-
EvmAsm.Evm64.EnvHandlers
Generic pure handler-table entries for simple environment opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.Env.Gas
namespace EvmAsm.Evm64
namespace EnvHandlers
abbrev SimpleEnvField := Env.SimpleEnvField
/-- Decode handler-table opcodes back to the simple e... | /-
EvmAsm.Evm64.EnvHandlers
Generic pure handler-table entries for simple environment opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.Env.Gas
namespace EvmAsm.Evm64
namespace EnvHandlers
abbrev SimpleEnvField := Env.SimpleEnvField
/-- Decode handler-table opcodes back to the simple e... | @@ -69,10 +69,19 @@
simpleEnvHandler? field.opcode = some (simpleEnvHandler field) := by
simp [simpleEnvHandler?, fieldOfOpcode?_of_field]
+theorem dispatchOpcode_simpleEnvHandlerTable_of_field
+ (field : SimpleEnvField) (state : EvmState) :
+ HandlerTable.dispatchOpcode simpleEnvHandlerTable field.opco... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6c1c91c6272c_4 | 640d54c3fea01833 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EnvHandlers.lean | EnvHandlers | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 5 | [
{
"theorem_name": "dispatchOpcode_simpleEnvHandlerTable_of_field_status",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatchOpcode_simpleEnvHandlerTable_of_field field state]\n exact simpleEnvHandl... | [
{
"name": "dispatchOpcode_simpleEnvHandlerTable_of_field",
"text": "theorem dispatchOpcode_simpleEnvHandlerTable_of_field\n (field : SimpleEnvField) (state : EvmState) :\n HandlerTable.dispatchOpcode simpleEnvHandlerTable field.opcode state =\n simpleEnvHandler field state := by\n exact HandlerT... | [
{
"name": "dispatchOpcode_simpleEnvHandlerTable_ADDRESS",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 7,
"n_chars": 254,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_o... | 3 | /-
EvmAsm.Evm64.EnvHandlers
Generic pure handler-table entries for simple environment opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.Env.Gas
namespace EvmAsm.Evm64
namespace EnvHandlers
abbrev SimpleEnvField := Env.SimpleEnvField
/-- Decode handler-table opcodes back to the simple e... | /-
EvmAsm.Evm64.EnvHandlers
Generic pure handler-table entries for simple environment opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.Env.Gas
namespace EvmAsm.Evm64
namespace EnvHandlers
abbrev SimpleEnvField := Env.SimpleEnvField
/-- Decode handler-table opcodes back to the simple e... | @@ -69,6 +69,13 @@
simpleEnvHandler? field.opcode = some (simpleEnvHandler field) := by
simp [simpleEnvHandler?, fieldOfOpcode?_of_field]
+theorem dispatchOpcode_simpleEnvHandlerTable_of_field
+ (field : SimpleEnvField) (state : EvmState) :
+ HandlerTable.dispatchOpcode simpleEnvHandlerTable field.opcod... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6c1c91c6272c_5 | f238ba8546188e9c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EnvHandlers.lean | EnvHandlers | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 5 | [
{
"theorem_name": "dispatchOpcode_simpleEnvHandlerTable_of_field_status",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatchOpcode_simpleEnvHandlerTable_of_field field state]\n exact simpleEnvHandl... | [
{
"name": "dispatchOpcode_simpleEnvHandlerTable_of_field",
"text": "theorem dispatchOpcode_simpleEnvHandlerTable_of_field\n (field : SimpleEnvField) (state : EvmState) :\n HandlerTable.dispatchOpcode simpleEnvHandlerTable field.opcode state =\n simpleEnvHandler field state := by\n exact HandlerT... | [
{
"name": "dispatchOpcode_simpleEnvHandlerTable_ORIGIN",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 7,
"n_chars": 250,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_on... | 3 | /-
EvmAsm.Evm64.EnvHandlers
Generic pure handler-table entries for simple environment opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.Env.Gas
namespace EvmAsm.Evm64
namespace EnvHandlers
abbrev SimpleEnvField := Env.SimpleEnvField
/-- Decode handler-table opcodes back to the simple e... | /-
EvmAsm.Evm64.EnvHandlers
Generic pure handler-table entries for simple environment opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.Env.Gas
namespace EvmAsm.Evm64
namespace EnvHandlers
abbrev SimpleEnvField := Env.SimpleEnvField
/-- Decode handler-table opcodes back to the simple e... | @@ -69,6 +69,13 @@
simpleEnvHandler? field.opcode = some (simpleEnvHandler field) := by
simp [simpleEnvHandler?, fieldOfOpcode?_of_field]
+theorem dispatchOpcode_simpleEnvHandlerTable_of_field
+ (field : SimpleEnvField) (state : EvmState) :
+ HandlerTable.dispatchOpcode simpleEnvHandlerTable field.opcod... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6c1c91c6272c_6 | 49d95c581d8676dd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EnvHandlers.lean | EnvHandlers | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 5 | [
{
"theorem_name": "dispatchOpcode_simpleEnvHandlerTable_of_field_status",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatchOpcode_simpleEnvHandlerTable_of_field field state]\n exact simpleEnvHandl... | [
{
"name": "dispatchOpcode_simpleEnvHandlerTable_of_field",
"text": "theorem dispatchOpcode_simpleEnvHandlerTable_of_field\n (field : SimpleEnvField) (state : EvmState) :\n HandlerTable.dispatchOpcode simpleEnvHandlerTable field.opcode state =\n simpleEnvHandler field state := by\n exact HandlerT... | [
{
"name": "dispatchOpcode_simpleEnvHandlerTable_CALLER",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 7,
"n_chars": 250,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_on... | 3 | /-
EvmAsm.Evm64.EnvHandlers
Generic pure handler-table entries for simple environment opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.Env.Gas
namespace EvmAsm.Evm64
namespace EnvHandlers
abbrev SimpleEnvField := Env.SimpleEnvField
/-- Decode handler-table opcodes back to the simple e... | /-
EvmAsm.Evm64.EnvHandlers
Generic pure handler-table entries for simple environment opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.Env.Gas
namespace EvmAsm.Evm64
namespace EnvHandlers
abbrev SimpleEnvField := Env.SimpleEnvField
/-- Decode handler-table opcodes back to the simple e... | @@ -69,6 +69,13 @@
simpleEnvHandler? field.opcode = some (simpleEnvHandler field) := by
simp [simpleEnvHandler?, fieldOfOpcode?_of_field]
+theorem dispatchOpcode_simpleEnvHandlerTable_of_field
+ (field : SimpleEnvField) (state : EvmState) :
+ HandlerTable.dispatchOpcode simpleEnvHandlerTable field.opcod... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6c1c91c6272c_7 | 9ec2e60e5e31d7b1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EnvHandlers.lean | EnvHandlers | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 5 | [
{
"theorem_name": "dispatchOpcode_simpleEnvHandlerTable_of_field_status",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatchOpcode_simpleEnvHandlerTable_of_field field state]\n exact simpleEnvHandl... | [
{
"name": "dispatchOpcode_simpleEnvHandlerTable_of_field",
"text": "theorem dispatchOpcode_simpleEnvHandlerTable_of_field\n (field : SimpleEnvField) (state : EvmState) :\n HandlerTable.dispatchOpcode simpleEnvHandlerTable field.opcode state =\n simpleEnvHandler field state := by\n exact HandlerT... | [
{
"name": "dispatchOpcode_simpleEnvHandlerTable_CALLVALUE",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 7,
"n_chars": 262,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation... | 3 | /-
EvmAsm.Evm64.EnvHandlers
Generic pure handler-table entries for simple environment opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.Env.Gas
namespace EvmAsm.Evm64
namespace EnvHandlers
abbrev SimpleEnvField := Env.SimpleEnvField
/-- Decode handler-table opcodes back to the simple e... | /-
EvmAsm.Evm64.EnvHandlers
Generic pure handler-table entries for simple environment opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.Env.Gas
namespace EvmAsm.Evm64
namespace EnvHandlers
abbrev SimpleEnvField := Env.SimpleEnvField
/-- Decode handler-table opcodes back to the simple e... | @@ -69,6 +69,13 @@
simpleEnvHandler? field.opcode = some (simpleEnvHandler field) := by
simp [simpleEnvHandler?, fieldOfOpcode?_of_field]
+theorem dispatchOpcode_simpleEnvHandlerTable_of_field
+ (field : SimpleEnvField) (state : EvmState) :
+ HandlerTable.dispatchOpcode simpleEnvHandlerTable field.opcod... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b9e27f49aa20_0 | 6b0eb4505898f4b1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LimbSpec/Div128Step1v2.lean | Div128Step1v2 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "divK_div128_step1_v2_branch_merged_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 107,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold divKDiv128Step1V2Code divKDiv128Step1V2Pre\n divKDiv128Step1V2BranchMergedTakenP... | [
{
"name": "step1_v2_pc1b_cr_subsumed",
"text": "/-- Helper: prodcheck1b's 10-singleton cr at offset (base+60) is included in\n step1_v2's 25-singleton merged cr.\n\n Defined outside `divK_div128_step1_v2_branch_merged_spec_within` so the heartbeat\n budget for this inclusion check is independent of... | [
{
"name": "divK_div128_step1_v2_branch_merged_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 125,
"n_chars": 7609,
"n_subproofs": 17,
"n_tactics": 103,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 5,
"n_structural": 3,
"auto... | 1 | /-
EvmAsm.Evm64.DivMod.LimbSpec.Div128Step1v2
Full-step composition for instructions [10]-[34] of the
`divK_div128_v2` subroutine — the v2 fix that adds a 2nd Phase 1b
D3 correction iteration (Knuth TAOCP §4.3.1 classical D3 step,
full 2-iteration version).
Combines:
- step-1-init (DIVU+MUL+SUB) — instr... | /-
EvmAsm.Evm64.DivMod.LimbSpec.Div128Step1v2
Full-step composition for instructions [10]-[34] of the
`divK_div128_v2` subroutine — the v2 fix that adds a 2nd Phase 1b
D3 correction iteration (Knuth TAOCP §4.3.1 classical D3 step,
full 2-iteration version).
Combines:
- step-1-init (DIVU+MUL+SUB) — instr... | @@ -140,6 +140,53 @@
(.x5 ↦ᵣ x5Exit) ** (.x11 ↦ᵣ un1) ** (.x9 ↦ᵣ x9Exit) **
(.x12 ↦ᵣ sp) ** (.x0 ↦ᵣ 0) ** (sp + signExtend12 3952 ↦ₘ dlo)
+/-- Helper: prodcheck1b's 10-singleton cr at offset (base+60) is included in
+ step1_v2's 25-singleton merged cr.
+
+ Defined outside `divK_div128_step1_v2_branch_merg... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b9e27f49aa20_1 | 593e384b335b5f18 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LimbSpec/Div128Step1v2.lean | Div128Step1v2 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "divK_div128_step1_v2_branch_merged_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 107,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold divKDiv128Step1V2Code divKDiv128Step1V2Pre\n divKDiv128Step1V2BranchMergedTakenP... | [
{
"name": "step1_v2_pc1b_cr_subsumed",
"text": "/-- Helper: prodcheck1b's 10-singleton cr at offset (base+60) is included in\n step1_v2's 25-singleton merged cr.\n\n Defined outside `divK_div128_step1_v2_branch_merged_spec_within` so the heartbeat\n budget for this inclusion check is independent of... | [
{
"name": "divK_div128_step1_v2_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 154,
"n_chars": 8787,
"n_subproofs": 33,
"n_tactics": 126,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 13,
"n_structural": 23,
"automation_only"... | 2 | /-
EvmAsm.Evm64.DivMod.LimbSpec.Div128Step1v2
Full-step composition for instructions [10]-[34] of the
`divK_div128_v2` subroutine — the v2 fix that adds a 2nd Phase 1b
D3 correction iteration (Knuth TAOCP §4.3.1 classical D3 step,
full 2-iteration version).
Combines:
- step-1-init (DIVU+MUL+SUB) — instr... | /-
EvmAsm.Evm64.DivMod.LimbSpec.Div128Step1v2
Full-step composition for instructions [10]-[34] of the
`divK_div128_v2` subroutine — the v2 fix that adds a 2nd Phase 1b
D3 correction iteration (Knuth TAOCP §4.3.1 classical D3 step,
full 2-iteration version).
Combines:
- step-1-init (DIVU+MUL+SUB) — instr... | @@ -140,6 +140,53 @@
(.x5 ↦ᵣ x5Exit) ** (.x11 ↦ᵣ un1) ** (.x9 ↦ᵣ x9Exit) **
(.x12 ↦ᵣ sp) ** (.x0 ↦ᵣ 0) ** (sp + signExtend12 3952 ↦ₘ dlo)
+/-- Helper: prodcheck1b's 10-singleton cr at offset (base+60) is included in
+ step1_v2's 25-singleton merged cr.
+
+ Defined outside `divK_div128_step1_v2_branch_merg... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc17d80784f8_0 | 3f630a8a811de757 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBounds.lean | SavedBitLoopBounds | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "expTwoMulFixedSkipIterStepBound_le_reload",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedSkipIterStepBound_eq, expTwoMulFixedReloadIterStepBound_eq]\n omega",
"n_c... | [
{
"name": "expTwoMulFixedSkipIterStepBound_eq",
"text": "theorem expTwoMulFixedSkipIterStepBound_eq :\n expTwoMulFixedSkipIterStepBound = 190 := by\n norm_num [expTwoMulFixedSkipIterStepBound]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 139,
"n_subproofs": 0,
"n_tactics": 2,
"cyc... | [
{
"name": "expTwoMulFixedSkipIterStepBound_le_reload",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 6,
"n_chars": 221,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | @@ -69,12 +69,18 @@
abbrev expTwoMulFullLoopBoundaryBound : Nat :=
expTwoMulBoundaryLoopBound expTwoMulFullLoopBodyBound
+theorem expTwoMulFixedSkipIterStepBound_eq :
+ expTwoMulFixedSkipIterStepBound = 190 := by
+ norm_num [expTwoMulFixedSkipIterStepBound]
+
theorem expTwoMulFixedReloadIterStepBound_eq :
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc17d80784f8_1 | 91727e7b7ca701cb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBounds.lean | SavedBitLoopBounds | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "expTwoMulIterationsBodyBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulIterationsBodyBound, expTwoMulNamedIterStepBound_eq]",
"n_chars": 71,
"n_subproofs": 0... | [
{
"name": "expTwoMulNamedIterStepBound_eq",
"text": "theorem expTwoMulNamedIterStepBound_eq :\n expTwoMulNamedIterStepBound = 189 := by\n norm_num [expTwoMulNamedIterStepBound]\n\n",
"fan_in": 4,
"n_lines": 5,
"n_chars": 127,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
... | [
{
"name": "expTwoMulIterationsBodyBound_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 199,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | @@ -69,8 +69,13 @@
abbrev expTwoMulFullLoopBoundaryBound : Nat :=
expTwoMulBoundaryLoopBound expTwoMulFullLoopBodyBound
+theorem expTwoMulNamedIterStepBound_eq :
+ expTwoMulNamedIterStepBound = 189 := by
+ norm_num [expTwoMulNamedIterStepBound]
+
theorem expTwoMulIterationsBodyBound_eq (iterations : Nat) :
-... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc17d80784f8_2 | f2d805cc81f60813 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBounds.lean | SavedBitLoopBounds | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 5 | [
{
"theorem_name": "expTwoMulFixedSkipIterStepBound_le_reload",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedSkipIterStepBound_eq, expTwoMulFixedReloadIterStepBound_eq]\n omega",
"n_c... | [
{
"name": "expTwoMulFixedReloadIterStepBound_eq",
"text": "theorem expTwoMulFixedReloadIterStepBound_eq :\n expTwoMulFixedReloadIterStepBound = 193 := by\n norm_num [expTwoMulFixedReloadIterStepBound]\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 145,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "expTwoMulFixedIterationsBodyBound_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 220,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fa... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | @@ -69,8 +69,13 @@
abbrev expTwoMulFullLoopBoundaryBound : Nat :=
expTwoMulBoundaryLoopBound expTwoMulFullLoopBodyBound
+theorem expTwoMulFixedReloadIterStepBound_eq :
+ expTwoMulFixedReloadIterStepBound = 193 := by
+ norm_num [expTwoMulFixedReloadIterStepBound]
+
theorem expTwoMulFixedIterationsBodyBound_eq... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc17d80784f8_3 | ee7c3c0f2c2011f9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBounds.lean | SavedBitLoopBounds | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "expTwoMulNamedIterStepBound_add_iterationsBodyBound_le_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulIterationsBodyBound_succ]",
"n_chars": 44,
"n_subproofs": ... | [
{
"name": "expTwoMulIterationsBodyBound_succ",
"text": "theorem expTwoMulIterationsBodyBound_succ (iterations : Nat) :\n expTwoMulIterationsBodyBound (iterations + 1) =\n expTwoMulNamedIterStepBound + expTwoMulIterationsBodyBound iterations := by\n unfold expTwoMulIterationsBodyBound\n rw [Nat.add... | [
{
"name": "expTwoMulNamedIterStepBound_add_iterationsBodyBound_le_succ",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 271,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | @@ -69,10 +69,17 @@
abbrev expTwoMulFullLoopBoundaryBound : Nat :=
expTwoMulBoundaryLoopBound expTwoMulFullLoopBodyBound
+theorem expTwoMulIterationsBodyBound_succ (iterations : Nat) :
+ expTwoMulIterationsBodyBound (iterations + 1) =
+ expTwoMulNamedIterStepBound + expTwoMulIterationsBodyBound iterations... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc17d80784f8_4 | 2c9ba975430e2798 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBounds.lean | SavedBitLoopBounds | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "expTwoMulFixedReloadIterStepBound_add_fixedIterationsBodyBound_le_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterationsBodyBound_succ]",
"n_chars": 49,
... | [
{
"name": "expTwoMulFixedIterationsBodyBound_succ",
"text": "theorem expTwoMulFixedIterationsBodyBound_succ (iterations : Nat) :\n expTwoMulFixedIterationsBodyBound (iterations + 1) =\n expTwoMulFixedReloadIterStepBound +\n expTwoMulFixedIterationsBodyBound iterations := by\n unfold expTwoMu... | [
{
"name": "expTwoMulFixedReloadIterStepBound_add_fixedIterationsBodyBound_le_succ",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 311,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structu... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | @@ -69,11 +69,19 @@
abbrev expTwoMulFullLoopBoundaryBound : Nat :=
expTwoMulBoundaryLoopBound expTwoMulFullLoopBodyBound
+theorem expTwoMulFixedIterationsBodyBound_succ (iterations : Nat) :
+ expTwoMulFixedIterationsBodyBound (iterations + 1) =
+ expTwoMulFixedReloadIterStepBound +
+ expTwoMulFixed... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc17d80784f8_5 | a953da96b7ab7ac7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBounds.lean | SavedBitLoopBounds | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "expTwoMulNamedIterStepBound_add_iterationsBodyBound_le_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulIterationsBodyBound_succ]",
"n_chars": 44,
"n_subproofs": ... | [
{
"name": "expTwoMulIterationsBodyBound_succ",
"text": "theorem expTwoMulIterationsBodyBound_succ (iterations : Nat) :\n expTwoMulIterationsBodyBound (iterations + 1) =\n expTwoMulNamedIterStepBound + expTwoMulIterationsBodyBound iterations := by\n unfold expTwoMulIterationsBodyBound\n rw [Nat.add... | [
{
"name": "expTwoMulNamedIterStepBound_add_max_iterationsBodyBound_le_succ",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 399,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": ... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | @@ -69,10 +69,17 @@
abbrev expTwoMulFullLoopBoundaryBound : Nat :=
expTwoMulBoundaryLoopBound expTwoMulFullLoopBodyBound
+theorem expTwoMulIterationsBodyBound_succ (iterations : Nat) :
+ expTwoMulIterationsBodyBound (iterations + 1) =
+ expTwoMulNamedIterStepBound + expTwoMulIterationsBodyBound iterations... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc17d80784f8_6 | df83a71d32844f14 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBounds.lean | SavedBitLoopBounds | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "expTwoMulFixedReloadIterStepBound_add_fixedIterationsBodyBound_le_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterationsBodyBound_succ]",
"n_chars": 49,
... | [
{
"name": "expTwoMulFixedIterationsBodyBound_succ",
"text": "theorem expTwoMulFixedIterationsBodyBound_succ (iterations : Nat) :\n expTwoMulFixedIterationsBodyBound (iterations + 1) =\n expTwoMulFixedReloadIterStepBound +\n expTwoMulFixedIterationsBodyBound iterations := by\n unfold expTwoMu... | [
{
"name": "expTwoMulFixedReloadIterStepBound_add_max_fixedIterationsBodyBound_le_succ",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 12,
"n_chars": 452,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_st... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | @@ -69,11 +69,19 @@
abbrev expTwoMulFullLoopBoundaryBound : Nat :=
expTwoMulBoundaryLoopBound expTwoMulFullLoopBodyBound
+theorem expTwoMulFixedIterationsBodyBound_succ (iterations : Nat) :
+ expTwoMulFixedIterationsBodyBound (iterations + 1) =
+ expTwoMulFixedReloadIterStepBound +
+ expTwoMulFixed... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc17d80784f8_7 | 42ca7e4c6dcdb7f9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBounds.lean | SavedBitLoopBounds | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "expTwoMulNamedIterStepBound_add_iterationsBodyBound_le_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulIterationsBodyBound_succ]",
"n_chars": 44,
"n_subproofs": ... | [
{
"name": "expTwoMulIterationsBodyBound_succ",
"text": "theorem expTwoMulIterationsBodyBound_succ (iterations : Nat) :\n expTwoMulIterationsBodyBound (iterations + 1) =\n expTwoMulNamedIterStepBound + expTwoMulIterationsBodyBound iterations := by\n unfold expTwoMulIterationsBodyBound\n rw [Nat.add... | [
{
"name": "expTwoMulNamedIterStepBound_add_max_iterationsBodyBound_zero_le_succ",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 373,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structura... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | @@ -69,10 +69,17 @@
abbrev expTwoMulFullLoopBoundaryBound : Nat :=
expTwoMulBoundaryLoopBound expTwoMulFullLoopBodyBound
+theorem expTwoMulIterationsBodyBound_succ (iterations : Nat) :
+ expTwoMulIterationsBodyBound (iterations + 1) =
+ expTwoMulNamedIterStepBound + expTwoMulIterationsBodyBound iterations... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc17d80784f8_8 | 49c4e918bc01adf0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBounds.lean | SavedBitLoopBounds | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "expTwoMulFixedReloadIterStepBound_add_fixedIterationsBodyBound_le_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterationsBodyBound_succ]",
"n_chars": 49,
... | [
{
"name": "expTwoMulFixedIterationsBodyBound_succ",
"text": "theorem expTwoMulFixedIterationsBodyBound_succ (iterations : Nat) :\n expTwoMulFixedIterationsBodyBound (iterations + 1) =\n expTwoMulFixedReloadIterStepBound +\n expTwoMulFixedIterationsBodyBound iterations := by\n unfold expTwoMu... | [
{
"name": "expTwoMulFixedReloadIterStepBound_add_max_fixedIterationsBodyBound_zero_le_succ",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 421,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | @@ -69,11 +69,19 @@
abbrev expTwoMulFullLoopBoundaryBound : Nat :=
expTwoMulBoundaryLoopBound expTwoMulFullLoopBodyBound
+theorem expTwoMulFixedIterationsBodyBound_succ (iterations : Nat) :
+ expTwoMulFixedIterationsBodyBound (iterations + 1) =
+ expTwoMulFixedReloadIterStepBound +
+ expTwoMulFixed... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc17d80784f8_9 | 217e3b6130bf48ff | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBounds.lean | SavedBitLoopBounds | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "expTwoMulIterationsBodyBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulIterationsBodyBound, expTwoMulNamedIterStepBound_eq]",
"n_chars": 71,
"n_subproofs": 0... | [
{
"name": "expTwoMulNamedIterStepBound_eq",
"text": "theorem expTwoMulNamedIterStepBound_eq :\n expTwoMulNamedIterStepBound = 189 := by\n norm_num [expTwoMulNamedIterStepBound]\n\n",
"fan_in": 4,
"n_lines": 5,
"n_chars": 127,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
... | [
{
"name": "expTwoMulFullLoopBodyBound_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 192,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | @@ -69,8 +69,14 @@
abbrev expTwoMulFullLoopBoundaryBound : Nat :=
expTwoMulBoundaryLoopBound expTwoMulFullLoopBodyBound
+theorem expTwoMulNamedIterStepBound_eq :
+ expTwoMulNamedIterStepBound = 189 := by
+ norm_num [expTwoMulNamedIterStepBound]
+
theorem expTwoMulFullLoopBodyBound_eq :
- expTwoMulFullLoop... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc17d80784f8_10 | 7df24382c8336146 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBounds.lean | SavedBitLoopBounds | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 5 | [
{
"theorem_name": "expTwoMulFixedSkipIterStepBound_le_reload",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedSkipIterStepBound_eq, expTwoMulFixedReloadIterStepBound_eq]\n omega",
"n_c... | [
{
"name": "expTwoMulFixedReloadIterStepBound_eq",
"text": "theorem expTwoMulFixedReloadIterStepBound_eq :\n expTwoMulFixedReloadIterStepBound = 193 := by\n norm_num [expTwoMulFixedReloadIterStepBound]\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 145,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "expTwoMulFixedFullLoopBodyBound_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 218,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | @@ -69,8 +69,14 @@
abbrev expTwoMulFullLoopBoundaryBound : Nat :=
expTwoMulBoundaryLoopBound expTwoMulFullLoopBodyBound
+theorem expTwoMulFixedReloadIterStepBound_eq :
+ expTwoMulFixedReloadIterStepBound = 193 := by
+ norm_num [expTwoMulFixedReloadIterStepBound]
+
theorem expTwoMulFixedFullLoopBodyBound_eq :... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc17d80784f8_11 | 7e490f1a2ddf7e07 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBounds.lean | SavedBitLoopBounds | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "expTwoMulIterationsBodyBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulIterationsBodyBound, expTwoMulNamedIterStepBound_eq]",
"n_chars": 71,
"n_subproofs": 0... | [
{
"name": "expTwoMulNamedIterStepBound_eq",
"text": "theorem expTwoMulNamedIterStepBound_eq :\n expTwoMulNamedIterStepBound = 189 := by\n norm_num [expTwoMulNamedIterStepBound]\n\n",
"fan_in": 4,
"n_lines": 5,
"n_chars": 127,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
... | [
{
"name": "expTwoMulFullLoopBodyTailBound_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 204,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | @@ -69,8 +69,14 @@
abbrev expTwoMulFullLoopBoundaryBound : Nat :=
expTwoMulBoundaryLoopBound expTwoMulFullLoopBodyBound
+theorem expTwoMulNamedIterStepBound_eq :
+ expTwoMulNamedIterStepBound = 189 := by
+ norm_num [expTwoMulNamedIterStepBound]
+
theorem expTwoMulFullLoopBodyTailBound_eq :
- expTwoMulFull... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc17d80784f8_12 | 44fea733d49e6b37 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBounds.lean | SavedBitLoopBounds | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 5 | [
{
"theorem_name": "expTwoMulFixedSkipIterStepBound_le_reload",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedSkipIterStepBound_eq, expTwoMulFixedReloadIterStepBound_eq]\n omega",
"n_c... | [
{
"name": "expTwoMulFixedReloadIterStepBound_eq",
"text": "theorem expTwoMulFixedReloadIterStepBound_eq :\n expTwoMulFixedReloadIterStepBound = 193 := by\n norm_num [expTwoMulFixedReloadIterStepBound]\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 145,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "expTwoMulFixedFullLoopBodyTailBound_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 230,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": ... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | @@ -69,8 +69,14 @@
abbrev expTwoMulFullLoopBoundaryBound : Nat :=
expTwoMulBoundaryLoopBound expTwoMulFullLoopBodyBound
+theorem expTwoMulFixedReloadIterStepBound_eq :
+ expTwoMulFixedReloadIterStepBound = 193 := by
+ norm_num [expTwoMulFixedReloadIterStepBound]
+
theorem expTwoMulFixedFullLoopBodyTailBound_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc17d80784f8_13 | ed293ad2eb2c0896 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBounds.lean | SavedBitLoopBounds | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "expTwoMulIterationsBodyBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulIterationsBodyBound, expTwoMulNamedIterStepBound_eq]",
"n_chars": 71,
"n_subproofs": 0... | [
{
"name": "expTwoMulNamedIterStepBound_eq",
"text": "theorem expTwoMulNamedIterStepBound_eq :\n expTwoMulNamedIterStepBound = 189 := by\n norm_num [expTwoMulNamedIterStepBound]\n\n",
"fan_in": 4,
"n_lines": 5,
"n_chars": 127,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
... | [
{
"name": "expTwoMulFullLoopBodyBound_eq_iter_plus_tail",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 343,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_o... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | @@ -69,10 +69,16 @@
abbrev expTwoMulFullLoopBoundaryBound : Nat :=
expTwoMulBoundaryLoopBound expTwoMulFullLoopBodyBound
+theorem expTwoMulNamedIterStepBound_eq :
+ expTwoMulNamedIterStepBound = 189 := by
+ norm_num [expTwoMulNamedIterStepBound]
+
/-- Peel the first named iteration from the 256-iteration bod... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc17d80784f8_14 | 76aa3534a0a49322 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBounds.lean | SavedBitLoopBounds | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 5 | [
{
"theorem_name": "expTwoMulFixedSkipIterStepBound_le_reload",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedSkipIterStepBound_eq, expTwoMulFixedReloadIterStepBound_eq]\n omega",
"n_c... | [
{
"name": "expTwoMulFixedReloadIterStepBound_eq",
"text": "theorem expTwoMulFixedReloadIterStepBound_eq :\n expTwoMulFixedReloadIterStepBound = 193 := by\n norm_num [expTwoMulFixedReloadIterStepBound]\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 145,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "expTwoMulFixedFullLoopBodyBound_eq_iter_plus_tail",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 409,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automa... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | @@ -69,12 +69,18 @@
abbrev expTwoMulFullLoopBoundaryBound : Nat :=
expTwoMulBoundaryLoopBound expTwoMulFullLoopBodyBound
+theorem expTwoMulFixedReloadIterStepBound_eq :
+ expTwoMulFixedReloadIterStepBound = 193 := by
+ norm_num [expTwoMulFixedReloadIterStepBound]
+
/-- Peel the first fixed-x19 iteration from... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc17d80784f8_15 | 52281171b69e447b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBounds.lean | SavedBitLoopBounds | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "expTwoMulIterationsBodyBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulIterationsBodyBound, expTwoMulNamedIterStepBound_eq]",
"n_chars": 71,
"n_subproofs": 0... | [
{
"name": "expTwoMulNamedIterStepBound_eq",
"text": "theorem expTwoMulNamedIterStepBound_eq :\n expTwoMulNamedIterStepBound = 189 := by\n norm_num [expTwoMulNamedIterStepBound]\n\n",
"fan_in": 4,
"n_lines": 5,
"n_chars": 127,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
... | [
{
"name": "expTwoMulFullLoopBodyBound_eq_tail_succ",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 330,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only":... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | @@ -69,6 +69,10 @@
abbrev expTwoMulFullLoopBoundaryBound : Nat :=
expTwoMulBoundaryLoopBound expTwoMulFullLoopBodyBound
+theorem expTwoMulNamedIterStepBound_eq :
+ expTwoMulNamedIterStepBound = 189 := by
+ norm_num [expTwoMulNamedIterStepBound]
+
theorem expTwoMulIterationsBodyBound_succ (iterations : Nat) :... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc17d80784f8_16 | 80f388114c3a91f8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBounds.lean | SavedBitLoopBounds | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 5 | [
{
"theorem_name": "expTwoMulFixedSkipIterStepBound_le_reload",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedSkipIterStepBound_eq, expTwoMulFixedReloadIterStepBound_eq]\n omega",
"n_c... | [
{
"name": "expTwoMulFixedReloadIterStepBound_eq",
"text": "theorem expTwoMulFixedReloadIterStepBound_eq :\n expTwoMulFixedReloadIterStepBound = 193 := by\n norm_num [expTwoMulFixedReloadIterStepBound]\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 145,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "expTwoMulFixedFullLoopBodyBound_eq_tail_succ",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 384,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_o... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | @@ -69,6 +69,10 @@
abbrev expTwoMulFullLoopBoundaryBound : Nat :=
expTwoMulBoundaryLoopBound expTwoMulFullLoopBodyBound
+theorem expTwoMulFixedReloadIterStepBound_eq :
+ expTwoMulFixedReloadIterStepBound = 193 := by
+ norm_num [expTwoMulFixedReloadIterStepBound]
+
theorem expTwoMulFixedIterationsBodyBound_su... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc17d80784f8_17 | 1be9eccbc5362bd5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBounds.lean | SavedBitLoopBounds | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "expTwoMulIterationsBodyBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulIterationsBodyBound, expTwoMulNamedIterStepBound_eq]",
"n_chars": 71,
"n_subproofs": 0... | [
{
"name": "expTwoMulNamedIterStepBound_eq",
"text": "theorem expTwoMulNamedIterStepBound_eq :\n expTwoMulNamedIterStepBound = 189 := by\n norm_num [expTwoMulNamedIterStepBound]\n\n",
"fan_in": 4,
"n_lines": 5,
"n_chars": 127,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
... | [
{
"name": "expTwoMulNamedIterStepBound_add_fullTail_le_full",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 334,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automati... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | @@ -69,10 +69,16 @@
abbrev expTwoMulFullLoopBoundaryBound : Nat :=
expTwoMulBoundaryLoopBound expTwoMulFullLoopBodyBound
+theorem expTwoMulNamedIterStepBound_eq :
+ expTwoMulNamedIterStepBound = 189 := by
+ norm_num [expTwoMulNamedIterStepBound]
+
/-- Peel the first named iteration from the 256-iteration bod... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc17d80784f8_18 | 215d7d2d63cc2fe7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBounds.lean | SavedBitLoopBounds | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 5 | [
{
"theorem_name": "expTwoMulFixedSkipIterStepBound_le_reload",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedSkipIterStepBound_eq, expTwoMulFixedReloadIterStepBound_eq]\n omega",
"n_c... | [
{
"name": "expTwoMulFixedReloadIterStepBound_eq",
"text": "theorem expTwoMulFixedReloadIterStepBound_eq :\n expTwoMulFixedReloadIterStepBound = 193 := by\n norm_num [expTwoMulFixedReloadIterStepBound]\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 145,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "expTwoMulFixedReloadIterStepBound_add_fullTail_le_full",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 386,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"au... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | @@ -69,12 +69,18 @@
abbrev expTwoMulFullLoopBoundaryBound : Nat :=
expTwoMulBoundaryLoopBound expTwoMulFullLoopBodyBound
+theorem expTwoMulFixedReloadIterStepBound_eq :
+ expTwoMulFixedReloadIterStepBound = 193 := by
+ norm_num [expTwoMulFixedReloadIterStepBound]
+
/-- Peel the first fixed-x19 iteration from... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc17d80784f8_19 | b0debf12d113485d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBounds.lean | SavedBitLoopBounds | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "expTwoMulIterationsBodyBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulIterationsBodyBound, expTwoMulNamedIterStepBound_eq]",
"n_chars": 71,
"n_subproofs": 0... | [
{
"name": "expTwoMulNamedIterStepBound_eq",
"text": "theorem expTwoMulNamedIterStepBound_eq :\n expTwoMulNamedIterStepBound = 189 := by\n norm_num [expTwoMulNamedIterStepBound]\n\n",
"fan_in": 4,
"n_lines": 5,
"n_chars": 127,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
... | [
{
"name": "expTwoMulNamedIterStepBound_add_max_fullTail_le_full",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 10,
"n_chars": 404,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"aut... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | @@ -69,10 +69,16 @@
abbrev expTwoMulFullLoopBoundaryBound : Nat :=
expTwoMulBoundaryLoopBound expTwoMulFullLoopBodyBound
+theorem expTwoMulNamedIterStepBound_eq :
+ expTwoMulNamedIterStepBound = 189 := by
+ norm_num [expTwoMulNamedIterStepBound]
+
/-- Peel the first named iteration from the 256-iteration bod... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc17d80784f8_20 | 39a8569bea28a1d9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBounds.lean | SavedBitLoopBounds | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 5 | [
{
"theorem_name": "expTwoMulFixedSkipIterStepBound_le_reload",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedSkipIterStepBound_eq, expTwoMulFixedReloadIterStepBound_eq]\n omega",
"n_c... | [
{
"name": "expTwoMulFixedReloadIterStepBound_eq",
"text": "theorem expTwoMulFixedReloadIterStepBound_eq :\n expTwoMulFixedReloadIterStepBound = 193 := by\n norm_num [expTwoMulFixedReloadIterStepBound]\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 145,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "expTwoMulFixedReloadIterStepBound_add_max_fullTail_le_full",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 11,
"n_chars": 446,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | @@ -69,12 +69,18 @@
abbrev expTwoMulFullLoopBoundaryBound : Nat :=
expTwoMulBoundaryLoopBound expTwoMulFullLoopBodyBound
+theorem expTwoMulFixedReloadIterStepBound_eq :
+ expTwoMulFixedReloadIterStepBound = 193 := by
+ norm_num [expTwoMulFixedReloadIterStepBound]
+
/-- Peel the first fixed-x19 iteration from... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc17d80784f8_21 | 864163d22fffd7f2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBounds.lean | SavedBitLoopBounds | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "expTwoMulIterationsBodyBound_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulIterationsBodyBound, expTwoMulNamedIterStepBound_eq]",
"n_chars": 71,
"n_subproofs": 0... | [
{
"name": "expTwoMulNamedIterStepBound_eq",
"text": "theorem expTwoMulNamedIterStepBound_eq :\n expTwoMulNamedIterStepBound = 189 := by\n norm_num [expTwoMulNamedIterStepBound]\n\n",
"fan_in": 4,
"n_lines": 5,
"n_chars": 127,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
... | [
{
"name": "expTwoMulFullLoopBoundaryBound_eq",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 6,
"n_chars": 198,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBounds
Named step-count expressions for the two-MUL saved-bit EXP loop
composition helpers.
-/
import EvmAsm.Evm64.Exp.Compose.Base
namespace EvmAsm.Evm64.Exp.Compose
/-- Instruction bound for one named saved-bit two-MUL iteration, excluding
externally supplied loop... | @@ -69,6 +69,10 @@
abbrev expTwoMulFullLoopBoundaryBound : Nat :=
expTwoMulBoundaryLoopBound expTwoMulFullLoopBodyBound
+theorem expTwoMulNamedIterStepBound_eq :
+ expTwoMulNamedIterStepBound = 189 := by
+ norm_num [expTwoMulNamedIterStepBound]
+
theorem expTwoMulBoundaryLoopBound_eq (nSteps : Nat) :
ex... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520f37b939e6_0 | a535d76c671f63a2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Spec.lean | Spec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "mload_prologue_ofProg_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← mloadPrologueCode_eq_ofProg]\n exact mload_prologue_spec_within offReg addrReg memBaseReg\n sp ... | [
{
"name": "mloadPrologueCode_eq_ofProg",
"text": "theorem mloadPrologueCode_eq_ofProg\n (offReg addrReg memBaseReg : Reg) (base : Word) :\n mloadPrologueCode offReg addrReg memBaseReg base =\n CodeReq.ofProg base\n (LD offReg .x12 0 ;; ADD addrReg memBaseReg offReg) := by\n unfold mloadPr... | [
{
"name": "mload_prologue_ofProg_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 19,
"n_chars": 833,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": fals... | 2 | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | @@ -23,6 +23,17 @@
(CodeReq.singleton base (.LD offReg .x12 0)).union
(CodeReq.singleton (base + 4) (.ADD addrReg memBaseReg offReg))
+theorem mloadPrologueCode_eq_ofProg
+ (offReg addrReg memBaseReg : Reg) (base : Word) :
+ mloadPrologueCode offReg addrReg memBaseReg base =
+ CodeReq.ofProg base
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520f37b939e6_1 | 932855dba7f55549 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Spec.lean | Spec | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "mload_prologue_ofProg_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← mloadPrologueCode_eq_ofProg]\n exact mload_prologue_spec_within offReg addrReg memBaseReg\n sp ... | [
{
"name": "mload_prologue_spec_within",
"text": "/--\n MLOAD prologue spec: load the low 64-bit offset limb from the EVM stack and\n compute the concrete byte address `memBase + offset` used by the four\n subsequent limb-load blocks.\n-/\ntheorem mload_prologue_spec_within\n (offReg addrReg memBaseReg... | [
{
"name": "mload_prologue_evm_mload_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 20,
"n_chars": 936,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": f... | 4 | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | @@ -34,6 +34,33 @@
[.LD offReg .x12 0, .ADD addrReg memBaseReg offReg]
rw [CodeReq.ofProg_cons, CodeReq.ofProg_singleton]
+/--
+ MLOAD prologue spec: load the low 64-bit offset limb from the EVM stack and
+ compute the concrete byte address `memBase + offset` used by the four
+ subsequent limb-load block... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520f37b939e6_2 | db9659c858df3f21 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Spec.lean | Spec | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "mloadLoadedWord_evmWordIs_fold",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evmWordIs_sp_unfold]\n rw [getLimbN_mloadLoadedWord_0, getLimbN_mloadLoadedWord_1,\n getLimbN_mloadL... | [
{
"name": "getLimbN_mloadLoadedWord_1",
"text": "theorem getLimbN_mloadLoadedWord_1 (l0 l1 l2 l3 : Word) :\n (mloadLoadedWord l0 l1 l2 l3).getLimbN 1 = l1 := by\n simp [mloadLoadedWord, EvmWord.getLimbN, EvmWord.getLimb_fromLimbs]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 185,
"n_subpr... | [
{
"name": "mloadLoadedWord_evmWordIs_fold",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 452,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 4 | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | @@ -36,6 +36,10 @@
(mloadLoadedWord l0 l1 l2 l3).getLimbN 0 = l0 := by
simp [mloadLoadedWord, EvmWord.getLimbN, EvmWord.getLimb_fromLimbs]
+theorem getLimbN_mloadLoadedWord_1 (l0 l1 l2 l3 : Word) :
+ (mloadLoadedWord l0 l1 l2 l3).getLimbN 1 = l1 := by
+ simp [mloadLoadedWord, EvmWord.getLimbN, EvmWord.get... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520f37b939e6_3 | 3107588cb37b5d90 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Spec.lean | Spec | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "mloadByteFromDwordPair_zeroExtend_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mloadByteFromDwordPair_eq_extractByte_pair]",
"n_chars": 53,
"n_subproofs": 0,
"n_tact... | [
{
"name": "mloadByteFromDwordPair_eq_extractByte_pair",
"text": "theorem mloadByteFromDwordPair_eq_extractByte_pair\n (loVal hiVal : Word) (start i : Nat) :\n mloadByteFromDwordPair loVal hiVal start i =\n extractByte (mloadDwordPairVal loVal hiVal start i) ((start + i) % 8) := by\n simp [mloadB... | [
{
"name": "mloadByteFromDwordPair_zeroExtend_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 310,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fa... | 1 | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | @@ -55,11 +55,18 @@
def mloadDwordPairVal (loVal hiVal : Word) (start i : Nat) : Word :=
if start + i < 8 then loVal else hiVal
+theorem mloadByteFromDwordPair_eq_extractByte_pair
+ (loVal hiVal : Word) (start i : Nat) :
+ mloadByteFromDwordPair loVal hiVal start i =
+ extractByte (mloadDwordPairVal lo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520f37b939e6_4 | 40402c648d9ae43e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Spec.lean | Spec | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "mloadByteFromDwordPair_eq_extractByte_low_of_byteOffset",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mloadByteFromDwordPair_low loVal hiVal h_pos, h_byte]",
"n_chars": 63,
... | [
{
"name": "mloadByteFromDwordPair_low",
"text": "theorem mloadByteFromDwordPair_low\n (lo hi : Word) {start i : Nat} (h_pos : start + i < 8) :\n mloadByteFromDwordPair lo hi start i = extractByte lo ((start + i) % 8) := by\n simp [mloadByteFromDwordPair, h_pos]\n\n",
"fan_in": 1,
"n_lines": 6... | [
{
"name": "mloadByteFromDwordPair_eq_extractByte_low_of_byteOffset",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 347,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"a... | 1 | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | @@ -47,6 +47,11 @@
let pos := start + i
extractByte (if pos < 8 then lo else hi) (pos % 8)
+theorem mloadByteFromDwordPair_low
+ (lo hi : Word) {start i : Nat} (h_pos : start + i < 8) :
+ mloadByteFromDwordPair lo hi start i = extractByte lo ((start + i) % 8) := by
+ simp [mloadByteFromDwordPair, h_pos]
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520f37b939e6_5 | 71d437351b702977 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Spec.lean | Spec | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "mloadByteFromDwordPair_eq_extractByte_high_of_byteOffset",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mloadByteFromDwordPair_high loVal hiVal h_pos, h_byte]",
"n_chars": 64,
... | [
{
"name": "mloadByteFromDwordPair_high",
"text": "theorem mloadByteFromDwordPair_high\n (lo hi : Word) {start i : Nat} (h_pos : 8 ≤ start + i) :\n mloadByteFromDwordPair lo hi start i = extractByte hi ((start + i) % 8) := by\n simp [mloadByteFromDwordPair, show ¬ start + i < 8 from by omega]\n\n",
... | [
{
"name": "mloadByteFromDwordPair_eq_extractByte_high_of_byteOffset",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 351,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"... | 1 | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | @@ -47,6 +47,11 @@
let pos := start + i
extractByte (if pos < 8 then lo else hi) (pos % 8)
+theorem mloadByteFromDwordPair_high
+ (lo hi : Word) {start i : Nat} (h_pos : 8 ≤ start + i) :
+ mloadByteFromDwordPair lo hi start i = extractByte hi ((start + i) % 8) := by
+ simp [mloadByteFromDwordPair, show ¬... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520f37b939e6_6 | 12f8ff9510c9472b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Spec.lean | Spec | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "mloadByteFromDwordPair_eq_extractByte_low_of_byteOffset",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mloadByteFromDwordPair_low loVal hiVal h_pos, h_byte]",
"n_chars": 63,
... | [
{
"name": "mloadByteFromDwordPair_low",
"text": "theorem mloadByteFromDwordPair_low\n (lo hi : Word) {start i : Nat} (h_pos : start + i < 8) :\n mloadByteFromDwordPair lo hi start i = extractByte lo ((start + i) % 8) := by\n simp [mloadByteFromDwordPair, h_pos]\n\n",
"fan_in": 1,
"n_lines": 6... | [
{
"name": "mloadByteFromDwordPair_zeroExtend_eq_extractByte_low_of_byteOffset",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 427,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural... | 2 | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | @@ -47,6 +47,11 @@
let pos := start + i
extractByte (if pos < 8 then lo else hi) (pos % 8)
+theorem mloadByteFromDwordPair_low
+ (lo hi : Word) {start i : Nat} (h_pos : start + i < 8) :
+ mloadByteFromDwordPair lo hi start i = extractByte lo ((start + i) % 8) := by
+ simp [mloadByteFromDwordPair, h_pos]
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520f37b939e6_7 | ca37ce73d0c17943 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Spec.lean | Spec | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "mloadByteFromDwordPair_eq_extractByte_high_of_byteOffset",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mloadByteFromDwordPair_high loVal hiVal h_pos, h_byte]",
"n_chars": 64,
... | [
{
"name": "mloadByteFromDwordPair_high",
"text": "theorem mloadByteFromDwordPair_high\n (lo hi : Word) {start i : Nat} (h_pos : 8 ≤ start + i) :\n mloadByteFromDwordPair lo hi start i = extractByte hi ((start + i) % 8) := by\n simp [mloadByteFromDwordPair, show ¬ start + i < 8 from by omega]\n\n",
... | [
{
"name": "mloadByteFromDwordPair_zeroExtend_eq_extractByte_high_of_byteOffset",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 431,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structura... | 2 | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | @@ -47,6 +47,11 @@
let pos := start + i
extractByte (if pos < 8 then lo else hi) (pos % 8)
+theorem mloadByteFromDwordPair_high
+ (lo hi : Word) {start i : Nat} (h_pos : 8 ≤ start + i) :
+ mloadByteFromDwordPair lo hi start i = extractByte hi ((start + i) % 8) := by
+ simp [mloadByteFromDwordPair, show ¬... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520f37b939e6_8 | 9ae2dcc7952fdeda | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Spec.lean | Spec | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "mloadByteFromDwordPair_zeroExtend_eq_extractByte_low_of_byteOffset",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mloadByteFromDwordPair_eq_extractByte_low_of_byteOffset\n loVal h... | [
{
"name": "mloadByteFromDwordPair_eq_extractByte_low_of_byteOffset",
"text": "theorem mloadByteFromDwordPair_eq_extractByte_low_of_byteOffset\n (loVal hiVal addr : Word) {start i : Nat}\n (h_pos : start + i < 8)\n (h_byte : byteOffset addr = (start + i) % 8) :\n mloadByteFromDwordPair loVal hiVa... | [
{
"name": "mload_byte_pack_init_pair_low_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 32,
"n_chars": 1596,
"n_subproofs": 2,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 2,
"automation_o... | 3 | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | @@ -60,12 +60,22 @@
def mloadDwordPairVal (loVal hiVal : Word) (start i : Nat) : Word :=
if start + i < 8 then loVal else hiVal
+theorem mloadByteFromDwordPair_eq_extractByte_low_of_byteOffset
+ (loVal hiVal addr : Word) {start i : Nat}
+ (h_pos : start + i < 8)
+ (h_byte : byteOffset addr = (start + i) ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520f37b939e6_9 | 6e1fa09ef2caa18f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Spec.lean | Spec | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "mloadByteFromDwordPair_zeroExtend_eq_extractByte_high_of_byteOffset",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mloadByteFromDwordPair_eq_extractByte_high_of_byteOffset\n loVal... | [
{
"name": "mloadByteFromDwordPair_eq_extractByte_high_of_byteOffset",
"text": "theorem mloadByteFromDwordPair_eq_extractByte_high_of_byteOffset\n (loVal hiVal addr : Word) {start i : Nat}\n (h_pos : 8 ≤ start + i)\n (h_byte : byteOffset addr = (start + i) % 8) :\n mloadByteFromDwordPair loVal hi... | [
{
"name": "mload_byte_pack_init_pair_high_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 32,
"n_chars": 1601,
"n_subproofs": 2,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 2,
"automation_... | 3 | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | @@ -60,12 +60,22 @@
def mloadDwordPairVal (loVal hiVal : Word) (start i : Nat) : Word :=
if start + i < 8 then loVal else hiVal
+theorem mloadByteFromDwordPair_eq_extractByte_high_of_byteOffset
+ (loVal hiVal addr : Word) {start i : Nat}
+ (h_pos : 8 ≤ start + i)
+ (h_byte : byteOffset addr = (start + i)... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520f37b939e6_10 | b384c57165e1ff28 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Spec.lean | Spec | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 2 | [
{
"theorem_name": "mload_byte_pack_init_pair_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases h_pos : start + i < 8\n · have h_addr := mloadDwordPairAddr_low loAddr hiAddr h_pos\n r... | [
{
"name": "mloadDwordPairAddr_high",
"text": "theorem mloadDwordPairAddr_high\n (loAddr hiAddr : Word) {start i : Nat} (h_pos : 8 ≤ start + i) :\n mloadDwordPairAddr loAddr hiAddr start i = hiAddr := by\n simp [mloadDwordPairAddr, show ¬ start + i < 8 from by omega]\n\n",
"fan_in": 2,
"n_line... | [
{
"name": "mload_byte_pack_init_pair_spec_within",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 10,
"n_lines": 32,
"n_chars": 1616,
"n_subproofs": 3,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 2,
"automation_only... | 10 | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | @@ -66,6 +66,11 @@
mloadDwordPairAddr loAddr hiAddr start i = loAddr := by
simp [mloadDwordPairAddr, h_pos]
+theorem mloadDwordPairAddr_high
+ (loAddr hiAddr : Word) {start i : Nat} (h_pos : 8 ≤ start + i) :
+ mloadDwordPairAddr loAddr hiAddr start i = hiAddr := by
+ simp [mloadDwordPairAddr, show ¬ st... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520f37b939e6_11 | cdaa79c9e8250667 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Spec.lean | Spec | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "mloadByteFromDwordPair_zeroExtend_eq_extractByte_low_of_byteOffset",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mloadByteFromDwordPair_eq_extractByte_low_of_byteOffset\n loVal h... | [
{
"name": "mloadByteFromDwordPair_eq_extractByte_low_of_byteOffset",
"text": "theorem mloadByteFromDwordPair_eq_extractByte_low_of_byteOffset\n (loVal hiVal addr : Word) {start i : Nat}\n (h_pos : start + i < 8)\n (h_byte : byteOffset addr = (start + i) % 8) :\n mloadByteFromDwordPair loVal hiVa... | [
{
"name": "mload_byte_pack_step_pair_low_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 41,
"n_chars": 2028,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 2,
"automation_o... | 3 | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | @@ -60,12 +60,22 @@
def mloadDwordPairVal (loVal hiVal : Word) (start i : Nat) : Word :=
if start + i < 8 then loVal else hiVal
+theorem mloadByteFromDwordPair_eq_extractByte_low_of_byteOffset
+ (loVal hiVal addr : Word) {start i : Nat}
+ (h_pos : start + i < 8)
+ (h_byte : byteOffset addr = (start + i) ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520f37b939e6_12 | 80cd0f71da0e1096 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Spec.lean | Spec | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "mloadByteFromDwordPair_zeroExtend_eq_extractByte_high_of_byteOffset",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mloadByteFromDwordPair_eq_extractByte_high_of_byteOffset\n loVal... | [
{
"name": "mloadByteFromDwordPair_eq_extractByte_high_of_byteOffset",
"text": "theorem mloadByteFromDwordPair_eq_extractByte_high_of_byteOffset\n (loVal hiVal addr : Word) {start i : Nat}\n (h_pos : 8 ≤ start + i)\n (h_byte : byteOffset addr = (start + i) % 8) :\n mloadByteFromDwordPair loVal hi... | [
{
"name": "mload_byte_pack_step_pair_high_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 41,
"n_chars": 2033,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 2,
"automation_... | 3 | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | @@ -60,12 +60,22 @@
def mloadDwordPairVal (loVal hiVal : Word) (start i : Nat) : Word :=
if start + i < 8 then loVal else hiVal
+theorem mloadByteFromDwordPair_eq_extractByte_high_of_byteOffset
+ (loVal hiVal addr : Word) {start i : Nat}
+ (h_pos : 8 ≤ start + i)
+ (h_byte : byteOffset addr = (start + i)... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520f37b939e6_13 | b0d65626cfddbfce | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Spec.lean | Spec | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 2 | [
{
"theorem_name": "mload_byte_pack_init_pair_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases h_pos : start + i < 8\n · have h_addr := mloadDwordPairAddr_low loAddr hiAddr h_pos\n r... | [
{
"name": "mloadDwordPairAddr_high",
"text": "theorem mloadDwordPairAddr_high\n (loAddr hiAddr : Word) {start i : Nat} (h_pos : 8 ≤ start + i) :\n mloadDwordPairAddr loAddr hiAddr start i = hiAddr := by\n simp [mloadDwordPairAddr, show ¬ start + i < 8 from by omega]\n\n",
"fan_in": 2,
"n_line... | [
{
"name": "mload_byte_pack_step_pair_spec_within",
"fan_in": 7,
"n_deps_direct": 4,
"n_deps_transitive": 10,
"n_lines": 37,
"n_chars": 2015,
"n_subproofs": 3,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 2,
"automation_only... | 10 | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | @@ -66,6 +66,11 @@
mloadDwordPairAddr loAddr hiAddr start i = loAddr := by
simp [mloadDwordPairAddr, h_pos]
+theorem mloadDwordPairAddr_high
+ (loAddr hiAddr : Word) {start i : Nat} (h_pos : 8 ≤ start + i) :
+ mloadDwordPairAddr loAddr hiAddr start i = hiAddr := by
+ simp [mloadDwordPairAddr, show ¬ st... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520f37b939e6_14 | 5a2c7c5b5a281151 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Spec.lean | Spec | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "mloadByteFromDwordPair_zeroExtend_eq_extractByte_high_of_byteOffset",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mloadByteFromDwordPair_eq_extractByte_high_of_byteOffset\n loVal... | [
{
"name": "mloadByteFromDwordPair_eq_extractByte_high_of_byteOffset",
"text": "theorem mloadByteFromDwordPair_eq_extractByte_high_of_byteOffset\n (loVal hiVal addr : Word) {start i : Nat}\n (h_pos : 8 ≤ start + i)\n (h_byte : byteOffset addr = (start + i) % 8) :\n mloadByteFromDwordPair loVal hi... | [
{
"name": "mload_byte_pack_two_pair_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 14,
"n_lines": 69,
"n_chars": 3562,
"n_subproofs": 8,
"n_tactics": 37,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 5,
"n_structural": 2,
"automation_only"... | 14 | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | @@ -83,6 +83,14 @@
extractByte loVal (byteOffset addr) := by
rw [mloadByteFromDwordPair_low loVal hiVal h_pos, h_byte]
+theorem mloadByteFromDwordPair_eq_extractByte_high_of_byteOffset
+ (loVal hiVal addr : Word) {start i : Nat}
+ (h_pos : 8 ≤ start + i)
+ (h_byte : byteOffset addr = (start + i) % ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520f37b939e6_15 | a46710e434711136 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Spec.lean | Spec | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 1 | [
{
"theorem_name": "mloadByteFromDwordPair_zeroExtend_eq_extractByte_high_of_byteOffset",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mloadByteFromDwordPair_eq_extractByte_high_of_byteOffset\n loVal... | [
{
"name": "mloadByteFromDwordPair_eq_extractByte_high_of_byteOffset",
"text": "theorem mloadByteFromDwordPair_eq_extractByte_high_of_byteOffset\n (loVal hiVal addr : Word) {start i : Nat}\n (h_pos : 8 ≤ start + i)\n (h_byte : byteOffset addr = (start + i) % 8) :\n mloadByteFromDwordPair loVal hi... | [
{
"name": "mload_byte_pack_three_pair_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 15,
"n_lines": 82,
"n_chars": 4688,
"n_subproofs": 15,
"n_tactics": 45,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 6,
"n_structural": 11,
"automation_o... | 15 | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | @@ -83,6 +83,14 @@
extractByte loVal (byteOffset addr) := by
rw [mloadByteFromDwordPair_low loVal hiVal h_pos, h_byte]
+theorem mloadByteFromDwordPair_eq_extractByte_high_of_byteOffset
+ (loVal hiVal addr : Word) {start i : Nat}
+ (h_pos : 8 ≤ start + i)
+ (h_byte : byteOffset addr = (start + i) % ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520f37b939e6_16 | 3e5ac20b539c967b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Spec.lean | Spec | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 2 | [
{
"theorem_name": "mload_byte_pack_init_pair_low_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro byteZext\n have init := mload_byte_pack_init_spec_within addrReg accReg\n addrPtr accO... | [
{
"name": "mloadByteFromDwordPair_zeroExtend_eq_extractByte_low_of_byteOffset",
"text": "theorem mloadByteFromDwordPair_zeroExtend_eq_extractByte_low_of_byteOffset\n (loVal hiVal addr : Word) {start i : Nat}\n (h_pos : start + i < 8)\n (h_byte : byteOffset addr = (start + i) % 8) :\n (mloadByteF... | [
{
"name": "mload_byte_pack_four_pair_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 16,
"n_lines": 104,
"n_chars": 5902,
"n_subproofs": 25,
"n_tactics": 61,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 6,
"n_structural": 12,
"automation_o... | 16 | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | @@ -91,6 +91,15 @@
extractByte hiVal (byteOffset addr) := by
rw [mloadByteFromDwordPair_high loVal hiVal h_pos, h_byte]
+theorem mloadByteFromDwordPair_zeroExtend_eq_extractByte_low_of_byteOffset
+ (loVal hiVal addr : Word) {start i : Nat}
+ (h_pos : start + i < 8)
+ (h_byte : byteOffset addr = (st... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520f37b939e6_17 | 30200ef0881c2b93 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Spec.lean | Spec | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 2 | [
{
"theorem_name": "mload_byte_pack_init_pair_low_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro byteZext\n have init := mload_byte_pack_init_spec_within addrReg accReg\n addrPtr accO... | [
{
"name": "mloadByteFromDwordPair_zeroExtend_eq_extractByte_low_of_byteOffset",
"text": "theorem mloadByteFromDwordPair_zeroExtend_eq_extractByte_low_of_byteOffset\n (loVal hiVal addr : Word) {start i : Nat}\n (h_pos : start + i < 8)\n (h_byte : byteOffset addr = (start + i) % 8) :\n (mloadByteF... | [
{
"name": "mload_byte_pack_five_pair_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 17,
"n_lines": 91,
"n_chars": 5456,
"n_subproofs": 4,
"n_tactics": 44,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 6,
"n_structural": 16,
"automation_onl... | 17 | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | @@ -91,6 +91,15 @@
extractByte hiVal (byteOffset addr) := by
rw [mloadByteFromDwordPair_high loVal hiVal h_pos, h_byte]
+theorem mloadByteFromDwordPair_zeroExtend_eq_extractByte_low_of_byteOffset
+ (loVal hiVal addr : Word) {start i : Nat}
+ (h_pos : start + i < 8)
+ (h_byte : byteOffset addr = (st... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520f37b939e6_18 | 7ec7772669c67a41 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Spec.lean | Spec | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 2 | [
{
"theorem_name": "mload_byte_pack_init_pair_low_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro byteZext\n have init := mload_byte_pack_init_spec_within addrReg accReg\n addrPtr accO... | [
{
"name": "mloadByteFromDwordPair_zeroExtend_eq_extractByte_low_of_byteOffset",
"text": "theorem mloadByteFromDwordPair_zeroExtend_eq_extractByte_low_of_byteOffset\n (loVal hiVal addr : Word) {start i : Nat}\n (h_pos : start + i < 8)\n (h_byte : byteOffset addr = (start + i) % 8) :\n (mloadByteF... | [
{
"name": "mload_byte_pack_six_pair_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 18,
"n_lines": 106,
"n_chars": 6228,
"n_subproofs": 4,
"n_tactics": 51,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 6,
"n_structural": 20,
"automation_onl... | 18 | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | @@ -91,6 +91,15 @@
extractByte hiVal (byteOffset addr) := by
rw [mloadByteFromDwordPair_high loVal hiVal h_pos, h_byte]
+theorem mloadByteFromDwordPair_zeroExtend_eq_extractByte_low_of_byteOffset
+ (loVal hiVal addr : Word) {start i : Nat}
+ (h_pos : start + i < 8)
+ (h_byte : byteOffset addr = (st... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520f37b939e6_19 | 4b706e4df8a932ff | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Spec.lean | Spec | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 2 | [
{
"theorem_name": "mload_byte_pack_init_pair_low_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro byteZext\n have init := mload_byte_pack_init_spec_within addrReg accReg\n addrPtr accO... | [
{
"name": "mloadByteFromDwordPair_zeroExtend_eq_extractByte_low_of_byteOffset",
"text": "theorem mloadByteFromDwordPair_zeroExtend_eq_extractByte_low_of_byteOffset\n (loVal hiVal addr : Word) {start i : Nat}\n (h_pos : start + i < 8)\n (h_byte : byteOffset addr = (start + i) % 8) :\n (mloadByteF... | [
{
"name": "mload_byte_pack_seven_pair_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 19,
"n_lines": 116,
"n_chars": 6984,
"n_subproofs": 4,
"n_tactics": 55,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 6,
"n_structural": 24,
"automation_o... | 19 | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | @@ -91,6 +91,15 @@
extractByte hiVal (byteOffset addr) := by
rw [mloadByteFromDwordPair_high loVal hiVal h_pos, h_byte]
+theorem mloadByteFromDwordPair_zeroExtend_eq_extractByte_low_of_byteOffset
+ (loVal hiVal addr : Word) {start i : Nat}
+ (h_pos : start + i < 8)
+ (h_byte : byteOffset addr = (st... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520f37b939e6_20 | bedcd6c86582634a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Spec.lean | Spec | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 29 | 2 | [
{
"theorem_name": "mload_byte_pack_init_pair_low_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro byteZext\n have init := mload_byte_pack_init_spec_within addrReg accReg\n addrPtr accO... | [
{
"name": "mloadByteFromDwordPair_zeroExtend_eq_extractByte_low_of_byteOffset",
"text": "theorem mloadByteFromDwordPair_zeroExtend_eq_extractByte_low_of_byteOffset\n (loVal hiVal addr : Word) {start i : Nat}\n (h_pos : start + i < 8)\n (h_byte : byteOffset addr = (start + i) % 8) :\n (mloadByteF... | [
{
"name": "mload_byte_pack_eight_pair_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 20,
"n_lines": 93,
"n_chars": 6045,
"n_subproofs": 5,
"n_tactics": 64,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 6,
"n_structural": 29,
"automation_on... | 20 | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | /-
EvmAsm.Evm64.MLoad.Spec
Stack-level bridge lemmas for the MLOAD result word. The instruction
composition proves four packed 64-bit output limbs; this file packages
those limbs as a single `EvmWord` and folds the four destination cells into
`evmWordIs`.
Authored by @pirapira; implemented by Codex.
-/
... | @@ -91,6 +91,15 @@
extractByte hiVal (byteOffset addr) := by
rw [mloadByteFromDwordPair_high loVal hiVal h_pos, h_byte]
+theorem mloadByteFromDwordPair_zeroExtend_eq_extractByte_low_of_byteOffset
+ (loVal hiVal addr : Word) {start i : Nat}
+ (h_pos : start + i < 8)
+ (h_byte : byteOffset addr = (st... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_273a3b0b37bc_0 | 30e6582a6d711625 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/BlobHash/Spec.lean | Spec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_blobhash_stack_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 169,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro code\n by_cases hc : w.getLimbN 1 = 0 ∧ w.getLimbN 2 = 0 ∧ w.getLimbN 3 = 0 ∧\n BitVec.ult (w.... | [
{
"name": "evm_blobhash_zero_high1_spec_within",
"text": "/-- Zero path via the first BNE (index limb 1 nonzero → out of range).\n Executes LD, BNE(taken → `base+80`), then the four-SD zero arm. -/\ntheorem evm_blobhash_zero_high1_spec_within\n (envBaseReg tableBaseReg idxReg tmpReg valReg : Reg)\n ... | [
{
"name": "evm_blobhash_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 6,
"n_deps_transitive": 6,
"n_lines": 205,
"n_chars": 11462,
"n_subproofs": 11,
"n_tactics": 165,
"cyclomatic": 1,
"n_automation": 13,
"n_rewrites": 22,
"n_structural": 8,
"automation_only":... | 6 | /-
EvmAsm.Evm64.BlobHash.Spec
Stack-level cpsTripleWithin specification for the EVM `BLOBHASH` opcode
(0x49, EIP-4844; see `EvmAsm/Evm64/BlobHash/Program.lean`).
BLOBHASH pops an index word `w` and pushes `hashes[w]` when the index is in
range (`w.getLimbN 1/2/3 = 0` and `w.getLimbN 0 <u count`), or zero
... | /-
EvmAsm.Evm64.BlobHash.Spec
Stack-level cpsTripleWithin specification for the EVM `BLOBHASH` opcode
(0x49, EIP-4844; see `EvmAsm/Evm64/BlobHash/Program.lean`).
BLOBHASH pops an index word `w` and pushes `hashes[w]` when the index is in
range (`w.getLimbN 1/2/3 = 0` and `w.getLimbN 0 <u count`), or zero
... | @@ -58,6 +58,55 @@
-- table-entry cells at `tblAddr + (i0 <<< 5) + {0,8,16,24}`.
-- ============================================================================
+/-- Zero path via the first BNE (index limb 1 nonzero → out of range).
+ Executes LD, BNE(taken → `base+80`), then the four-SD zero arm. -/
+theorem ev... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9b638c0ffe45_0 | 9dd537cfcb6caa46 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128FinalAssembly.lean | Div128FinalAssembly | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 5 | [
{
"theorem_name": "div128Quot_cu_rhat_un1_toNat",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [bv6_toNat_32]\n apply halfword_combine_mod\n rw [← bv6_toNat_32]\n exact Word_ushiftRight_32_lt_pow32",... | [
{
"name": "Word_ushiftRight_32_lt_pow32",
"text": "/-- Utility: right-shifting a 64-bit Word by 32 produces a value bounded\n by `2^32`. -/\ntheorem Word_ushiftRight_32_lt_pow32 {x : Word} :\n (x >>> (32 : BitVec 6).toNat).toNat < 2^32 := by\n rw [BitVec.toNat_ushiftRight]\n rw [bv6_toNat_32, Nat.sh... | [
{
"name": "div128Quot_cu_rhat_un1_toNat",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 24,
"n_chars": 951,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.EvmWordArith.Div128FinalAssembly
Second half of the top-down Knuth-B analysis for `div128Quot`. Split
from `Div128QuotientBounds.lean` (issue #61) to keep files under the
1500-line size cap.
This file contains the Phase 2 un21 machinery and final output
assembly:
- **KB-3f**: `q1' * dLo`... | /-
EvmAsm.Evm64.EvmWordArith.Div128FinalAssembly
Second half of the top-down Knuth-B analysis for `div128Quot`. Split
from `Div128QuotientBounds.lean` (issue #61) to keep files under the
1500-line size cap.
This file contains the Phase 2 un21 machinery and final output
assembly:
- **KB-3f**: `q1' * dLo`... | @@ -75,6 +75,19 @@
Nat.mul_mod_mul_right]
rw [h_mod]
+/-- Utility: right-shifting a 64-bit Word by 32 produces a value bounded
+ by `2^32`. -/
+theorem Word_ushiftRight_32_lt_pow32 {x : Word} :
+ (x >>> (32 : BitVec 6).toNat).toNat < 2^32 := by
+ rw [BitVec.toNat_ushiftRight]
+ rw [bv6_toNat_32, N... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9b638c0ffe45_1 | ee5f64ad77a11390 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128FinalAssembly.lean | Div128FinalAssembly | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "div128Quot_cu_rhat_un1_toNat",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [bv6_toNat_32]\n apply halfword_combine_mod\n rw [← bv6_toNat_32]\n exact Word_ushiftRight_32_lt_pow32",... | [
{
"name": "halfword_combine_mod",
"text": "/-- **KB-3g: Generalized halfword combine.** Without an upper bound on\n `a`, the shift-left-by-32 + OR construction still has a clean Nat\n formula, truncating `a` modulo `2^32`:\n\n ```\n (a <<< 32 ||| b).toNat = (a.toNat % 2^32) * 2^32 + b.toNat\n ... | [
{
"name": "div128Quot_un21_toNat",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 48,
"n_chars": 2078,
"n_subproofs": 2,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"ma... | 4 | /-
EvmAsm.Evm64.EvmWordArith.Div128FinalAssembly
Second half of the top-down Knuth-B analysis for `div128Quot`. Split
from `Div128QuotientBounds.lean` (issue #61) to keep files under the
1500-line size cap.
This file contains the Phase 2 un21 machinery and final output
assembly:
- **KB-3f**: `q1' * dLo`... | /-
EvmAsm.Evm64.EvmWordArith.Div128FinalAssembly
Second half of the top-down Knuth-B analysis for `div128Quot`. Split
from `Div128QuotientBounds.lean` (issue #61) to keep files under the
1500-line size cap.
This file contains the Phase 2 un21 machinery and final output
assembly:
- **KB-3f**: `q1' * dLo`... | @@ -72,6 +72,46 @@
omega
rw [BitVec.toNat_mul, Nat.mod_eq_of_lt h_mul_lt]
+/-- **KB-3g: Generalized halfword combine.** Without an upper bound on
+ `a`, the shift-left-by-32 + OR construction still has a clean Nat
+ formula, truncating `a` modulo `2^32`:
+
+ ```
+ (a <<< 32 ||| b).toNat = (a.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_9b638c0ffe45_2 | 0ce1ccdba5eca8a7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128FinalAssembly.lean | Div128FinalAssembly | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 5 | [
{
"theorem_name": "div128Quot_cu_rhat_un1_toNat",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [bv6_toNat_32]\n apply halfword_combine_mod\n rw [← bv6_toNat_32]\n exact Word_ushiftRight_32_lt_pow32",... | [
{
"name": "Word_ushiftRight_32_lt_pow32",
"text": "/-- Utility: right-shifting a 64-bit Word by 32 produces a value bounded\n by `2^32`. -/\ntheorem Word_ushiftRight_32_lt_pow32 {x : Word} :\n (x >>> (32 : BitVec 6).toNat).toNat < 2^32 := by\n rw [BitVec.toNat_ushiftRight]\n rw [bv6_toNat_32, Nat.sh... | [
{
"name": "div128Quot_un21_toNat_case",
"fan_in": 3,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 63,
"n_chars": 2717,
"n_subproofs": 7,
"n_tactics": 27,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 8,
"n_structural": 5,
"automation_only": false,
... | 5 | /-
EvmAsm.Evm64.EvmWordArith.Div128FinalAssembly
Second half of the top-down Knuth-B analysis for `div128Quot`. Split
from `Div128QuotientBounds.lean` (issue #61) to keep files under the
1500-line size cap.
This file contains the Phase 2 un21 machinery and final output
assembly:
- **KB-3f**: `q1' * dLo`... | /-
EvmAsm.Evm64.EvmWordArith.Div128FinalAssembly
Second half of the top-down Knuth-B analysis for `div128Quot`. Split
from `Div128QuotientBounds.lean` (issue #61) to keep files under the
1500-line size cap.
This file contains the Phase 2 un21 machinery and final output
assembly:
- **KB-3f**: `q1' * dLo`... | @@ -112,6 +112,19 @@
Nat.mul_mod_mul_right]
rw [h_mod]
+/-- Utility: right-shifting a 64-bit Word by 32 produces a value bounded
+ by `2^32`. -/
+theorem Word_ushiftRight_32_lt_pow32 {x : Word} :
+ (x >>> (32 : BitVec 6).toNat).toNat < 2^32 := by
+ rw [BitVec.toNat_ushiftRight]
+ rw [bv6_toNat_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_9b638c0ffe45_3 | 24c7c36a03a45b6d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128FinalAssembly.lean | Div128FinalAssembly | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 5 | [
{
"theorem_name": "div128Quot_cu_rhat_un1_toNat",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [bv6_toNat_32]\n apply halfword_combine_mod\n rw [← bv6_toNat_32]\n exact Word_ushiftRight_32_lt_pow32",... | [
{
"name": "Word_ushiftRight_32_lt_pow32",
"text": "/-- Utility: right-shifting a 64-bit Word by 32 produces a value bounded\n by `2^32`. -/\ntheorem Word_ushiftRight_32_lt_pow32 {x : Word} :\n (x >>> (32 : BitVec 6).toNat).toNat < 2^32 := by\n rw [BitVec.toNat_ushiftRight]\n rw [bv6_toNat_32, Nat.sh... | [
{
"name": "div128Quot_un21_abstract_dividend",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 8,
"n_lines": 90,
"n_chars": 4332,
"n_subproofs": 14,
"n_tactics": 40,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 8,
"n_structural": 4,
"automation_only": f... | 8 | /-
EvmAsm.Evm64.EvmWordArith.Div128FinalAssembly
Second half of the top-down Knuth-B analysis for `div128Quot`. Split
from `Div128QuotientBounds.lean` (issue #61) to keep files under the
1500-line size cap.
This file contains the Phase 2 un21 machinery and final output
assembly:
- **KB-3f**: `q1' * dLo`... | /-
EvmAsm.Evm64.EvmWordArith.Div128FinalAssembly
Second half of the top-down Knuth-B analysis for `div128Quot`. Split
from `Div128QuotientBounds.lean` (issue #61) to keep files under the
1500-line size cap.
This file contains the Phase 2 un21 machinery and final output
assembly:
- **KB-3f**: `q1' * dLo`... | @@ -112,6 +112,19 @@
Nat.mul_mod_mul_right]
rw [h_mod]
+/-- Utility: right-shifting a 64-bit Word by 32 produces a value bounded
+ by `2^32`. -/
+theorem Word_ushiftRight_32_lt_pow32 {x : Word} :
+ (x >>> (32 : BitVec 6).toNat).toNat < 2^32 := by
+ rw [BitVec.toNat_ushiftRight]
+ rw [bv6_toNat_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_9b638c0ffe45_4 | 45f7dbb588d58b72 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128FinalAssembly.lean | Div128FinalAssembly | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 5 | [
{
"theorem_name": "div128Quot_cu_rhat_un1_toNat",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [bv6_toNat_32]\n apply halfword_combine_mod\n rw [← bv6_toNat_32]\n exact Word_ushiftRight_32_lt_pow32",... | [
{
"name": "Word_ushiftRight_32_lt_pow32",
"text": "/-- Utility: right-shifting a 64-bit Word by 32 produces a value bounded\n by `2^32`. -/\ntheorem Word_ushiftRight_32_lt_pow32 {x : Word} :\n (x >>> (32 : BitVec 6).toNat).toNat < 2^32 := by\n rw [BitVec.toNat_ushiftRight]\n rw [bv6_toNat_32, Nat.sh... | [
{
"name": "div128Quot_un21_additive_identity",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 8,
"n_lines": 73,
"n_chars": 3457,
"n_subproofs": 14,
"n_tactics": 40,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 9,
"n_structural": 4,
"automation_only": f... | 8 | /-
EvmAsm.Evm64.EvmWordArith.Div128FinalAssembly
Second half of the top-down Knuth-B analysis for `div128Quot`. Split
from `Div128QuotientBounds.lean` (issue #61) to keep files under the
1500-line size cap.
This file contains the Phase 2 un21 machinery and final output
assembly:
- **KB-3f**: `q1' * dLo`... | /-
EvmAsm.Evm64.EvmWordArith.Div128FinalAssembly
Second half of the top-down Knuth-B analysis for `div128Quot`. Split
from `Div128QuotientBounds.lean` (issue #61) to keep files under the
1500-line size cap.
This file contains the Phase 2 un21 machinery and final output
assembly:
- **KB-3f**: `q1' * dLo`... | @@ -112,6 +112,19 @@
Nat.mul_mod_mul_right]
rw [h_mod]
+/-- Utility: right-shifting a 64-bit Word by 32 produces a value bounded
+ by `2^32`. -/
+theorem Word_ushiftRight_32_lt_pow32 {x : Word} :
+ (x >>> (32 : BitVec 6).toNat).toNat < 2^32 := by
+ rw [BitVec.toNat_ushiftRight]
+ rw [bv6_toNat_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_9b638c0ffe45_5 | 970f34d23331b654 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128FinalAssembly.lean | Div128FinalAssembly | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 5 | [
{
"theorem_name": "div128Quot_cu_rhat_un1_toNat",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [bv6_toNat_32]\n apply halfword_combine_mod\n rw [← bv6_toNat_32]\n exact Word_ushiftRight_32_lt_pow32",... | [
{
"name": "Word_ushiftRight_32_lt_pow32",
"text": "/-- Utility: right-shifting a 64-bit Word by 32 produces a value bounded\n by `2^32`. -/\ntheorem Word_ushiftRight_32_lt_pow32 {x : Word} :\n (x >>> (32 : BitVec 6).toNat).toNat < 2^32 := by\n rw [BitVec.toNat_ushiftRight]\n rw [bv6_toNat_32, Nat.sh... | [
{
"name": "div128Quot_un21_additive_identity_uncond",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 8,
"n_lines": 96,
"n_chars": 4428,
"n_subproofs": 17,
"n_tactics": 56,
"cyclomatic": 1,
"n_automation": 10,
"n_rewrites": 7,
"n_structural": 6,
"automation_... | 8 | /-
EvmAsm.Evm64.EvmWordArith.Div128FinalAssembly
Second half of the top-down Knuth-B analysis for `div128Quot`. Split
from `Div128QuotientBounds.lean` (issue #61) to keep files under the
1500-line size cap.
This file contains the Phase 2 un21 machinery and final output
assembly:
- **KB-3f**: `q1' * dLo`... | /-
EvmAsm.Evm64.EvmWordArith.Div128FinalAssembly
Second half of the top-down Knuth-B analysis for `div128Quot`. Split
from `Div128QuotientBounds.lean` (issue #61) to keep files under the
1500-line size cap.
This file contains the Phase 2 un21 machinery and final output
assembly:
- **KB-3f**: `q1' * dLo`... | @@ -112,6 +112,19 @@
Nat.mul_mod_mul_right]
rw [h_mod]
+/-- Utility: right-shifting a 64-bit Word by 32 produces a value bounded
+ by `2^32`. -/
+theorem Word_ushiftRight_32_lt_pow32 {x : Word} :
+ (x >>> (32 : BitVec 6).toNat).toNat < 2^32 := by
+ rw [BitVec.toNat_ushiftRight]
+ rw [bv6_toNat_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_9b638c0ffe45_6 | e0aeb31fd24b0647 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128FinalAssembly.lean | Div128FinalAssembly | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "div128Quot_cu_rhat_un1_toNat",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [bv6_toNat_32]\n apply halfword_combine_mod\n rw [← bv6_toNat_32]\n exact Word_ushiftRight_32_lt_pow32",... | [
{
"name": "halfword_combine_mod",
"text": "/-- **KB-3g: Generalized halfword combine.** Without an upper bound on\n `a`, the shift-left-by-32 + OR construction still has a clean Nat\n formula, truncating `a` modulo `2^32`:\n\n ```\n (a <<< 32 ||| b).toNat = (a.toNat % 2^32) * 2^32 + b.toNat\n ... | [
{
"name": "div128Quot_toNat_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 53,
"n_chars": 2492,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"max_n... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Div128FinalAssembly
Second half of the top-down Knuth-B analysis for `div128Quot`. Split
from `Div128QuotientBounds.lean` (issue #61) to keep files under the
1500-line size cap.
This file contains the Phase 2 un21 machinery and final output
assembly:
- **KB-3f**: `q1' * dLo`... | /-
EvmAsm.Evm64.EvmWordArith.Div128FinalAssembly
Second half of the top-down Knuth-B analysis for `div128Quot`. Split
from `Div128QuotientBounds.lean` (issue #61) to keep files under the
1500-line size cap.
This file contains the Phase 2 un21 machinery and final output
assembly:
- **KB-3f**: `q1' * dLo`... | @@ -35,6 +35,46 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (bv6_toNat_32)
+/-- **KB-3g: Generalized halfword combine.** Without an upper bound on
+ `a`, the shift-left-by-32 + OR construction still has a clean Nat
+ formula, truncating `a` modulo `2^32`:
+
+ ```
+ (a <<< 32 ||| b).toNat = (a.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_9b638c0ffe45_7 | dcf9d4ff047ccc2f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128FinalAssembly.lean | Div128FinalAssembly | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "div128Quot_cu_rhat_un1_toNat",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [bv6_toNat_32]\n apply halfword_combine_mod\n rw [← bv6_toNat_32]\n exact Word_ushiftRight_32_lt_pow32",... | [
{
"name": "halfword_combine_mod",
"text": "/-- **KB-3g: Generalized halfword combine.** Without an upper bound on\n `a`, the shift-left-by-32 + OR construction still has a clean Nat\n formula, truncating `a` modulo `2^32`:\n\n ```\n (a <<< 32 ||| b).toNat = (a.toNat % 2^32) * 2^32 + b.toNat\n ... | [
{
"name": "div128Quot_toNat_eq_strict",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 52,
"n_chars": 2505,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.EvmWordArith.Div128FinalAssembly
Second half of the top-down Knuth-B analysis for `div128Quot`. Split
from `Div128QuotientBounds.lean` (issue #61) to keep files under the
1500-line size cap.
This file contains the Phase 2 un21 machinery and final output
assembly:
- **KB-3f**: `q1' * dLo`... | /-
EvmAsm.Evm64.EvmWordArith.Div128FinalAssembly
Second half of the top-down Knuth-B analysis for `div128Quot`. Split
from `Div128QuotientBounds.lean` (issue #61) to keep files under the
1500-line size cap.
This file contains the Phase 2 un21 machinery and final output
assembly:
- **KB-3f**: `q1' * dLo`... | @@ -35,6 +35,46 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (bv6_toNat_32)
+/-- **KB-3g: Generalized halfword combine.** Without an upper bound on
+ `a`, the shift-left-by-32 + OR construction still has a clean Nat
+ formula, truncating `a` modulo `2^32`:
+
+ ```
+ (a <<< 32 ||| b).toNat = (a.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_9b638c0ffe45_8 | b25383f75f19eab8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128FinalAssembly.lean | Div128FinalAssembly | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "Div128AllPhasesNoWrapInv.ofConjuncts",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact Div128AllPhasesNoWrapInv.ofPhaseNoWrapInv\n (Div128PhaseNoWrapInv.ofConjuncts h_un21_lt h_pha... | [
{
"name": "Div128AllPhasesNoWrapInv.ofPhaseNoWrapInv",
"text": "/-- Build the all-phases invariant from the Phase-1 invariant plus the Phase-2\n no-wrap conjunct. This gives downstream proofs a named split point for the\n remaining hard arithmetic instead of unfolding the full all-phases\n predicat... | [
{
"name": "Div128AllPhasesNoWrapInv.ofConjuncts",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 69,
"n_chars": 3528,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": ... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Div128FinalAssembly
Second half of the top-down Knuth-B analysis for `div128Quot`. Split
from `Div128QuotientBounds.lean` (issue #61) to keep files under the
1500-line size cap.
This file contains the Phase 2 un21 machinery and final output
assembly:
- **KB-3f**: `q1' * dLo`... | /-
EvmAsm.Evm64.EvmWordArith.Div128FinalAssembly
Second half of the top-down Knuth-B analysis for `div128Quot`. Split
from `Div128QuotientBounds.lean` (issue #61) to keep files under the
1500-line size cap.
This file contains the Phase 2 un21 machinery and final output
assembly:
- **KB-3f**: `q1' * dLo`... | @@ -151,6 +151,47 @@
simp only [Div128PhaseNoWrapInv]
exact ⟨h_un21_lt, h_phase1_no_wrap⟩
+/-- Build the all-phases invariant from the Phase-1 invariant plus the Phase-2
+ no-wrap conjunct. This gives downstream proofs a named split point for the
+ remaining hard arithmetic instead of unfolding the full a... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fd52ff83935f_0 | 027d67cc603208a3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/ResultSignFixOwn.lean | ResultSignFixOwn | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "smodResultSignFixPost_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [smodResultSignFixPost_unfold]\n dsimp only\n pcFree",
"n_chars": 61,
"n_subproofs": 0,
"n_ta... | [
{
"name": "smodResultSignFixPost_unfold",
"text": "theorem smodResultSignFixPost_unfold\n {sp sign limb0 limb1 limb2 limb3 : Word} :\n smodResultSignFixPost sp sign limb0 limb1 limb2 limb3 =\n (let mask := (0 : Word) - sign\n let sum0 := (limb0 ^^^ mask) + sign\n let carry0 := if BitV... | [
{
"name": "smodResultSignFixPost_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 216,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.SMod.Compose.ResultSignFixOwn
SMOD-local wrappers for the shared result-sign-fix block. The SMOD wrapper
preserves the dividend/result sign in x13 across the MOD callable, so these
assertions intentionally differ from the SDIV x8-shaped result-sign-fix
assertions.
-/
import EvmAsm.Evm64.SDiv... | /-
EvmAsm.Evm64.SMod.Compose.ResultSignFixOwn
SMOD-local wrappers for the shared result-sign-fix block. The SMOD wrapper
preserves the dividend/result sign in x13 across the MOD callable, so these
assertions intentionally differ from the SDIV x8-shaped result-sign-fix
assertions.
-/
import EvmAsm.Evm64.SDiv... | @@ -44,9 +44,33 @@
((sp + EvmAsm.Rv64.signExtend12 (16 : BitVec 12)) ↦ₘ sum2) **
((sp + EvmAsm.Rv64.signExtend12 (24 : BitVec 12)) ↦ₘ sum3)
+theorem smodResultSignFixPost_unfold
+ {sp sign limb0 limb1 limb2 limb3 : Word} :
+ smodResultSignFixPost sp sign limb0 limb1 limb2 limb3 =
+ (let mask := (0 : ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fd52ff83935f_1 | 0671e06896369218 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/ResultSignFixOwn.lean | ResultSignFixOwn | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 2 | [
{
"theorem_name": "smodResultSignFixPreOwnScratch_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [smodResultSignFixPreOwnScratch_unfold]\n pcFree",
"n_chars": 57,
"n_subproofs": 0,
"... | [
{
"name": "smodResultSignFixPreOwnScratch_unfold",
"text": "theorem smodResultSignFixPreOwnScratch_unfold\n {sp sign limb0 limb1 limb2 limb3 : Word} :\n smodResultSignFixPreOwnScratch sp sign limb0 limb1 limb2 limb3 =\n ((((((((((.x0 ↦ᵣ (0 : Word)) ** (.x12 ↦ᵣ sp)) ** (.x13 ↦ᵣ sign)) **\n ... | [
{
"name": "smodResultSignFixPreOwnScratch_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 230,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": f... | 1 | /-
EvmAsm.Evm64.SMod.Compose.ResultSignFixOwn
SMOD-local wrappers for the shared result-sign-fix block. The SMOD wrapper
preserves the dividend/result sign in x13 across the MOD callable, so these
assertions intentionally differ from the SDIV x8-shaped result-sign-fix
assertions.
-/
import EvmAsm.Evm64.SDiv... | /-
EvmAsm.Evm64.SMod.Compose.ResultSignFixOwn
SMOD-local wrappers for the shared result-sign-fix block. The SMOD wrapper
preserves the dividend/result sign in x13 across the MOD callable, so these
assertions intentionally differ from the SDIV x8-shaped result-sign-fix
assertions.
-/
import EvmAsm.Evm64.SDiv... | @@ -110,9 +110,24 @@
((sp + EvmAsm.Rv64.signExtend12 (24 : BitVec 12)) ↦ₘ limb3)) **
EvmAsm.Rv64.regOwn .x10) ** EvmAsm.Rv64.regOwn .x7) ** EvmAsm.Rv64.regOwn .x11
+theorem smodResultSignFixPreOwnScratch_unfold
+ {sp sign limb0 limb1 limb2 limb3 : Word} :
+ smodResultSignFixPreOwnScratch sp sign limb0... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fd52ff83935f_2 | fd36efd282f82fb1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/ResultSignFixOwn.lean | ResultSignFixOwn | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "smodResultSignFixPost_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [smodResultSignFixPost_unfold]\n dsimp only\n pcFree",
"n_chars": 61,
"n_subproofs": 0,
"n_ta... | [
{
"name": "smodResultSignFixPost_unfold",
"text": "theorem smodResultSignFixPost_unfold\n {sp sign limb0 limb1 limb2 limb3 : Word} :\n smodResultSignFixPost sp sign limb0 limb1 limb2 limb3 =\n (let mask := (0 : Word) - sign\n let sum0 := (limb0 ^^^ mask) + sign\n let carry0 := if BitV... | [
{
"name": "resultSignFix_spec_in_smodCode",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 29,
"n_chars": 1289,
"n_subproofs": 2,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 3,
"automation_only": false... | 2 | /-
EvmAsm.Evm64.SMod.Compose.ResultSignFixOwn
SMOD-local wrappers for the shared result-sign-fix block. The SMOD wrapper
preserves the dividend/result sign in x13 across the MOD callable, so these
assertions intentionally differ from the SDIV x8-shaped result-sign-fix
assertions.
-/
import EvmAsm.Evm64.SDiv... | /-
EvmAsm.Evm64.SMod.Compose.ResultSignFixOwn
SMOD-local wrappers for the shared result-sign-fix block. The SMOD wrapper
preserves the dividend/result sign in x13 across the MOD callable, so these
assertions intentionally differ from the SDIV x8-shaped result-sign-fix
assertions.
-/
import EvmAsm.Evm64.SDiv... | @@ -57,9 +57,33 @@
((sp + EvmAsm.Rv64.signExtend12 (16 : BitVec 12)) ↦ₘ sum2) **
((sp + EvmAsm.Rv64.signExtend12 (24 : BitVec 12)) ↦ₘ sum3)
+theorem smodResultSignFixPost_unfold
+ {sp sign limb0 limb1 limb2 limb3 : Word} :
+ smodResultSignFixPost sp sign limb0 limb1 limb2 limb3 =
+ (let mask := (0 : ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fd52ff83935f_3 | 95b44dffab1f0e32 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/ResultSignFixOwn.lean | ResultSignFixOwn | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "smodResultSignFixPost_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [smodResultSignFixPost_unfold]\n dsimp only\n pcFree",
"n_chars": 61,
"n_subproofs": 0,
"n_ta... | [
{
"name": "smodResultSignFixPost_unfold",
"text": "theorem smodResultSignFixPost_unfold\n {sp sign limb0 limb1 limb2 limb3 : Word} :\n smodResultSignFixPost sp sign limb0 limb1 limb2 limb3 =\n (let mask := (0 : Word) - sign\n let sum0 := (limb0 ^^^ mask) + sign\n let carry0 := if BitV... | [
{
"name": "resultSignFix_spec_in_smodCodeV4",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 29,
"n_chars": 1297,
"n_subproofs": 2,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 3,
"automation_only": fal... | 2 | /-
EvmAsm.Evm64.SMod.Compose.ResultSignFixOwn
SMOD-local wrappers for the shared result-sign-fix block. The SMOD wrapper
preserves the dividend/result sign in x13 across the MOD callable, so these
assertions intentionally differ from the SDIV x8-shaped result-sign-fix
assertions.
-/
import EvmAsm.Evm64.SDiv... | /-
EvmAsm.Evm64.SMod.Compose.ResultSignFixOwn
SMOD-local wrappers for the shared result-sign-fix block. The SMOD wrapper
preserves the dividend/result sign in x13 across the MOD callable, so these
assertions intentionally differ from the SDIV x8-shaped result-sign-fix
assertions.
-/
import EvmAsm.Evm64.SDiv... | @@ -57,9 +57,33 @@
((sp + EvmAsm.Rv64.signExtend12 (16 : BitVec 12)) ↦ₘ sum2) **
((sp + EvmAsm.Rv64.signExtend12 (24 : BitVec 12)) ↦ₘ sum3)
+theorem smodResultSignFixPost_unfold
+ {sp sign limb0 limb1 limb2 limb3 : Word} :
+ smodResultSignFixPost sp sign limb0 limb1 limb2 limb3 =
+ (let mask := (0 : ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fd52ff83935f_4 | d759c6a85d70498e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/ResultSignFixOwn.lean | ResultSignFixOwn | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "resultSignFix_regOwn_x10_spec_in_smodCodeV4",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [smodResultSignFixPreOwnX10_unfold]\n apply EvmAsm.Rv64.cpsTripleWithin_of_forall_regIs_to... | [
{
"name": "resultSignFix_spec_in_smodCodeV4",
"text": "theorem resultSignFix_spec_in_smodCodeV4\n (sp sign maskOld valueOld carryOld limb0 limb1 limb2 limb3 : Word)\n (base : Word) :\n EvmAsm.Rv64.cpsTripleWithin 21 (base + resultSignFixOff)\n ((base + resultSignFixOff) + 84) (smodCodeV4 base)... | [
{
"name": "resultSignFix_regOwn_x10_spec_in_smodCodeV4",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 19,
"n_chars": 781,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 3,
"automation_... | 4 | /-
EvmAsm.Evm64.SMod.Compose.ResultSignFixOwn
SMOD-local wrappers for the shared result-sign-fix block. The SMOD wrapper
preserves the dividend/result sign in x13 across the MOD callable, so these
assertions intentionally differ from the SDIV x8-shaped result-sign-fix
assertions.
-/
import EvmAsm.Evm64.SDiv... | /-
EvmAsm.Evm64.SMod.Compose.ResultSignFixOwn
SMOD-local wrappers for the shared result-sign-fix block. The SMOD wrapper
preserves the dividend/result sign in x13 across the MOD callable, so these
assertions intentionally differ from the SDIV x8-shaped result-sign-fix
assertions.
-/
import EvmAsm.Evm64.SDiv... | @@ -162,13 +162,51 @@
(smodResultSignFixPreOwnScratch sp sign limb0 limb1 limb2 limb3) :=
⟨smodResultSignFixPreOwnScratch_pcFree⟩
+theorem resultSignFix_spec_in_smodCodeV4
+ (sp sign maskOld valueOld carryOld limb0 limb1 limb2 limb3 : Word)
+ (base : Word) :
+ EvmAsm.Rv64.cpsTripleWithin 21 (base +... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fd52ff83935f_5 | ff3a6efd54b9e4e5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/ResultSignFixOwn.lean | ResultSignFixOwn | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "resultSignFix_regOwn_x10_x7_spec_in_smodCodeV4",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [smodResultSignFixPreOwnX10X7_unfold]\n apply EvmAsm.Rv64.cpsTripleWithin_of_forall_reg... | [
{
"name": "resultSignFix_regOwn_x10_spec_in_smodCodeV4",
"text": "theorem resultSignFix_regOwn_x10_spec_in_smodCodeV4\n (sp sign valueOld carryOld limb0 limb1 limb2 limb3 : Word) (base : Word) :\n EvmAsm.Rv64.cpsTripleWithin 21 (base + resultSignFixOff)\n ((base + resultSignFixOff) + 84) (smodCod... | [
{
"name": "resultSignFix_regOwn_x10_x7_spec_in_smodCodeV4",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 6,
"n_lines": 18,
"n_chars": 772,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 3,
"automati... | 6 | /-
EvmAsm.Evm64.SMod.Compose.ResultSignFixOwn
SMOD-local wrappers for the shared result-sign-fix block. The SMOD wrapper
preserves the dividend/result sign in x13 across the MOD callable, so these
assertions intentionally differ from the SDIV x8-shaped result-sign-fix
assertions.
-/
import EvmAsm.Evm64.SDiv... | /-
EvmAsm.Evm64.SMod.Compose.ResultSignFixOwn
SMOD-local wrappers for the shared result-sign-fix block. The SMOD wrapper
preserves the dividend/result sign in x13 across the MOD callable, so these
assertions intentionally differ from the SDIV x8-shaped result-sign-fix
assertions.
-/
import EvmAsm.Evm64.SDiv... | @@ -203,12 +203,40 @@
EvmAsm.Evm64.condNegate256BlockPost_unfold] at hSpec
exact EvmAsm.Rv64.cpsTripleWithin_extend_code hmono hSpec
+theorem resultSignFix_regOwn_x10_spec_in_smodCodeV4
+ (sp sign valueOld carryOld limb0 limb1 limb2 limb3 : Word) (base : Word) :
+ EvmAsm.Rv64.cpsTripleWithin 21 (base + ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fd52ff83935f_6 | 3b17d5a1f8b36e83 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/ResultSignFixOwn.lean | ResultSignFixOwn | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "resultSignFix_regOwn_scratch_spec_in_smodCodeV4",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [smodResultSignFixPreOwnScratch_unfold]\n apply EvmAsm.Rv64.cpsTripleWithin_of_forall_... | [
{
"name": "resultSignFix_regOwn_x10_x7_spec_in_smodCodeV4",
"text": "theorem resultSignFix_regOwn_x10_x7_spec_in_smodCodeV4\n (sp sign carryOld limb0 limb1 limb2 limb3 : Word) (base : Word) :\n EvmAsm.Rv64.cpsTripleWithin 21 (base + resultSignFixOff)\n ((base + resultSignFixOff) + 84) (smodCodeV4... | [
{
"name": "resultSignFix_regOwn_scratch_spec_in_smodCodeV4",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 8,
"n_lines": 18,
"n_chars": 755,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 3,
"automat... | 8 | /-
EvmAsm.Evm64.SMod.Compose.ResultSignFixOwn
SMOD-local wrappers for the shared result-sign-fix block. The SMOD wrapper
preserves the dividend/result sign in x13 across the MOD callable, so these
assertions intentionally differ from the SDIV x8-shaped result-sign-fix
assertions.
-/
import EvmAsm.Evm64.SDiv... | /-
EvmAsm.Evm64.SMod.Compose.ResultSignFixOwn
SMOD-local wrappers for the shared result-sign-fix block. The SMOD wrapper
preserves the dividend/result sign in x13 across the MOD callable, so these
assertions intentionally differ from the SDIV x8-shaped result-sign-fix
assertions.
-/
import EvmAsm.Evm64.SDiv... | @@ -221,12 +221,39 @@
(resultSignFix_spec_in_smodCodeV4 sp sign maskOld valueOld carryOld
limb0 limb1 limb2 limb3 base)
+theorem resultSignFix_regOwn_x10_x7_spec_in_smodCodeV4
+ (sp sign carryOld limb0 limb1 limb2 limb3 : Word) (base : Word) :
+ EvmAsm.Rv64.cpsTripleWithin 21 (base + resultSignFixOf... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b4577fa5f11c_0 | fee0db840b97ba72 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6FastResultBridge.lean | V6FastResultBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "fast_scratch_own_call_assemble",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h hp\n rw [divScratchOwnCall_unfold]\n revert hp\n apply sepConj_mono (fast_scratch_own_assemble s... | [
{
"name": "fast_scratch_own_assemble",
"text": "/-- **Scratch-ownership assembly.** The 15 div-scratch value cells (at the\n `divScratchOwn` offsets `4088 … 3976`) weaken to `divScratchOwn sp`. A\n building block of the fast-arm post → `divStackDispatchPost` weakening:\n after the fast body, every ... | [
{
"name": "fast_scratch_own_call_assemble",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 28,
"n_chars": 1665,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 7,
"automation_only": false... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.V6FastResultBridge
Reconcile the v6 fast-path body's stored quotient limbs (`v6chainQ_j` at the
result slots `sp+32 / +40 / +48 / +56`) with the `evmWordIs (sp+32)
(EvmWord.div a b)` component of `divStackDispatchPost`. This is the result
half of the `dr466.3` postcondition we... | /-
EvmAsm.Evm64.DivMod.Compose.V6FastResultBridge
Reconcile the v6 fast-path body's stored quotient limbs (`v6chainQ_j` at the
result slots `sp+32 / +40 / +48 / +56`) with the `evmWordIs (sp+32)
(EvmWord.div a b)` component of `divStackDispatchPost`. This is the result
half of the `dr466.3` postcondition we... | @@ -22,6 +22,41 @@
open EvmAsm.Rv64
+/-- **Scratch-ownership assembly.** The 15 div-scratch value cells (at the
+ `divScratchOwn` offsets `4088 … 3976`) weaken to `divScratchOwn sp`. A
+ building block of the fast-arm post → `divStackDispatchPost` weakening:
+ after the fast body, every scratch cell holds... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b4577fa5f11c_1 | cbadd5a663aa3f7a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6FastResultBridge.lean | V6FastResultBridge | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "fast_scratch_own_call_assemble",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h hp\n rw [divScratchOwnCall_unfold]\n revert hp\n apply sepConj_mono (fast_scratch_own_assemble s... | [
{
"name": "fast_scratch_own_assemble",
"text": "/-- **Scratch-ownership assembly.** The 15 div-scratch value cells (at the\n `divScratchOwn` offsets `4088 … 3976`) weaken to `divScratchOwn sp`. A\n building block of the fast-arm post → `divStackDispatchPost` weakening:\n after the fast body, every ... | [
{
"name": "fast_scratch_own_call_bodyform",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 29,
"n_chars": 1687,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 7,
"automation_only": false... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.V6FastResultBridge
Reconcile the v6 fast-path body's stored quotient limbs (`v6chainQ_j` at the
result slots `sp+32 / +40 / +48 / +56`) with the `evmWordIs (sp+32)
(EvmWord.div a b)` component of `divStackDispatchPost`. This is the result
half of the `dr466.3` postcondition we... | /-
EvmAsm.Evm64.DivMod.Compose.V6FastResultBridge
Reconcile the v6 fast-path body's stored quotient limbs (`v6chainQ_j` at the
result slots `sp+32 / +40 / +48 / +56`) with the `evmWordIs (sp+32)
(EvmWord.div a b)` component of `divStackDispatchPost`. This is the result
half of the `dr466.3` postcondition we... | @@ -22,6 +22,41 @@
open EvmAsm.Rv64
+/-- **Scratch-ownership assembly.** The 15 div-scratch value cells (at the
+ `divScratchOwn` offsets `4088 … 3976`) weaken to `divScratchOwn sp`. A
+ building block of the fast-arm post → `divStackDispatchPost` weakening:
+ after the fast body, every scratch cell holds... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b4577fa5f11c_2 | f2a693b8e90bfd73 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6FastResultBridge.lean | V6FastResultBridge | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "fast_post_weaken_core",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h hp\n revert hp\n apply sepConj_mono (fun _ x => x)\n apply sepConj_mono (fun _ x => x)\n apply sepConj_m... | [
{
"name": "fast_scratch_own_call_bodyform",
"text": "/-- **Call-scratch ownership assembly (body form).** As `fast_scratch_own_call_assemble`,\n but the four call cells arrive already as `memOwn` (the shape the fast-body\n postcondition exposes them in) rather than as value atoms. This is the form\n ... | [
{
"name": "fast_post_weaken_core",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 46,
"n_chars": 2919,
"n_subproofs": 0,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 14,
"automation_only": false,
"m... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.V6FastResultBridge
Reconcile the v6 fast-path body's stored quotient limbs (`v6chainQ_j` at the
result slots `sp+32 / +40 / +48 / +56`) with the `evmWordIs (sp+32)
(EvmWord.div a b)` component of `divStackDispatchPost`. This is the result
half of the `dr466.3` postcondition we... | /-
EvmAsm.Evm64.DivMod.Compose.V6FastResultBridge
Reconcile the v6 fast-path body's stored quotient limbs (`v6chainQ_j` at the
result slots `sp+32 / +40 / +48 / +56`) with the `evmWordIs (sp+32)
(EvmWord.div a b)` component of `divStackDispatchPost`. This is the result
half of the `dr466.3` postcondition we... | @@ -57,6 +57,34 @@
apply sepConj_mono (memIs_implies_memOwn)
exact memIs_implies_memOwn
+/-- **Call-scratch ownership assembly (body form).** As `fast_scratch_own_call_assemble`,
+ but the four call cells arrive already as `memOwn` (the shape the fast-body
+ postcondition exposes them in) rather than as v... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f65d968595aa_0 | a2b3b05675300ab3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2ModStackSpec.lean | N2ModStackSpec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_mod_n2_stack_spec_within_word",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨hmod0, hmod1, hmod2, hmod3⟩ :=\n fullModN2_hmods_of_word_eq bltu_2 bltu_1 bltu_0\n a b a... | [
{
"name": "evm_mod_n2_stack_spec_within",
"text": "/-- Legacy raw-carry N=2 MOD stack-level entry point: mirrors `evm_mod_n1_stack_spec_within`.\n\nComposes `evm_mod_n2_full_unified_spec` with the limb-shaped pre and post\nbridges (`divModStackDispatchPre` ↔ raw cells, and\n`fullModN2UnifiedPost_to_modStack... | [
{
"name": "evm_mod_n2_stack_spec_within_word",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 50,
"n_chars": 2769,
"n_subproofs": 1,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": fa... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N2ModStackSpec
Stack-level entry point for the n=2 MOD path: composes
`evm_mod_n2_full_unified_spec` with the limb-shaped `evmWordIs` bridge
`fullModN2UnifiedPost_to_modStackDispatchPost`. Mirrors
`evm_mod_n1_stack_spec_within{,_word}` from `Spec.Dispatcher`.
The `_word` varian... | /-
EvmAsm.Evm64.DivMod.Spec.N2ModStackSpec
Stack-level entry point for the n=2 MOD path: composes
`evm_mod_n2_full_unified_spec` with the limb-shaped `evmWordIs` bridge
`fullModN2UnifiedPost_to_modStackDispatchPost`. Mirrors
`evm_mod_n1_stack_spec_within{,_word}` from `Spec.Dispatcher`.
The `_word` varian... | @@ -24,6 +24,82 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
+/-- Legacy raw-carry N=2 MOD stack-level entry point: mirrors `evm_mod_n1_stack_spec_within`.
+
+Composes `evm_mod_n2_full_unified_spec` with the limb-shaped pre and post
+bridges (`divModStackDispatchPre` ↔ raw cells, and
+`fullModN2Uni... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8091609b6430_0 | d361b2df8d655e11 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WithdrawalDecodeAutoWP.lean | WithdrawalDecodeAutoWP | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "walkInitShortSuccessDecodedWP_nonempty",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases successFieldSpecs_input_of_decodeWithdrawal_eq_some input w hdec with\n ⟨d0, d1, d2, d3, ... | [
{
"name": "successFieldSpecs_input_length_pos",
"text": "theorem successFieldSpecs_input_length_pos\n (input d0 d1 d2 d3 : List Byte)\n (hl0 : d0.length <= 8) (hl1 : d1.length <= 8)\n (haddr : d2.length = 20) (hl3 : d3.length <= 8)\n (hinput : input = encode (.list (schemaItems (successFieldSpec... | [
{
"name": "walkInitShortSuccessDecodedWP_nonempty",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 51,
"n_chars": 2285,
"n_subproofs": 3,
"n_tactics": 30,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only... | 2 | /-
EvmAsm.Rv64.RLP.WithdrawalDecodeAutoWP
Caller-facing WP automation for the withdrawal decoder success path. The
generated schema code still depends on the field byte witnesses, but callers
only provide the pure `decodeWithdrawal` result; this module extracts the
witnesses and packages the resulting WP ce... | /-
EvmAsm.Rv64.RLP.WithdrawalDecodeAutoWP
Caller-facing WP automation for the withdrawal decoder success path. The
generated schema code still depends on the field byte witnesses, but callers
only provide the pure `decodeWithdrawal` result; this module extracts the
witnesses and packages the resulting WP ce... | @@ -24,6 +24,20 @@
simp [schemaSize, successFieldSpecs, fieldSize, haddr]
split <;> split <;> split <;> omega
+theorem successFieldSpecs_input_length_pos
+ (input d0 d1 d2 d3 : List Byte)
+ (hl0 : d0.length <= 8) (hl1 : d1.length <= 8)
+ (haddr : d2.length = 20) (hl3 : d3.length <= 8)
+ (hinput : in... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8091609b6430_1 | 0c4c2ff1ca05111a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WithdrawalDecodeAutoWP.lean | WithdrawalDecodeAutoWP | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "failureNBranch_exits",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold failureNBranch\n rw [walkInitZeroNonzeroAbiFailureFromPrologueResolvedCodeSuccessFrameNBranch_exits]\n unfold... | [
{
"name": "walkInitZeroNonzeroAbiFailureFromPrologueExits_of_pos",
"text": "/-- Nonempty inputs select the reason-erased classifier exits in the zero/nonzero\n facade. This hides the empty-input singleton branch once a caller has any\n static nonempty witness. -/\ntheorem walkInitZeroNonzeroAbiFailure... | [
{
"name": "failureNBranch_exits",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 25,
"n_chars": 1492,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 4,
"n_structural": 0,
"automation_only": false,
"max_... | 1 | /-
EvmAsm.Rv64.RLP.WithdrawalDecodeAutoWP
Caller-facing WP automation for the withdrawal decoder success path. The
generated schema code still depends on the field byte witnesses, but callers
only provide the pure `decodeWithdrawal` result; this module extracts the
witnesses and packages the resulting WP ce... | /-
EvmAsm.Rv64.RLP.WithdrawalDecodeAutoWP
Caller-facing WP automation for the withdrawal decoder success path. The
generated schema code still depends on the field byte witnesses, but callers
only provide the pure `decodeWithdrawal` result; this module extracts the
witnesses and packages the resulting WP ce... | @@ -314,6 +314,21 @@
attribute [rv64_wp]
walkInitShortSuccessSchemaInputWP_cert_pre
+/-- Nonempty inputs select the reason-erased classifier exits in the zero/nonzero
+ facade. This hides the empty-input singleton branch once a caller has any
+ static nonempty witness. -/
+theorem walkInitZeroNonzeroAbiFail... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8091609b6430_2 | 3c0aa901024669f7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WithdrawalDecodeAutoWP.lean | WithdrawalDecodeAutoWP | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "walkInitShortSuccessDecodedFailureNBranch_exits",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact (walkInitShortSuccessDecodedWP base sp0 raVal s0Old s1Old s2Old outBase m0 m1 m2\n ... | [
{
"name": "failureNBranch_exits",
"text": "/-- Package-indexed classifier exits normalized to the nonempty, reason-erased\n shape. The low-level empty/nonempty `match` is discharged by `pkg.hoff`. -/\ntheorem failureNBranch_exits\n {base sp0 raVal s0Old s1Old s2Old outBase : Word}\n {m0 m1 m2 m3 in... | [
{
"name": "walkInitShortSuccessDecodedFailureNBranch_exits",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 30,
"n_chars": 1859,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automat... | 2 | /-
EvmAsm.Rv64.RLP.WithdrawalDecodeAutoWP
Caller-facing WP automation for the withdrawal decoder success path. The
generated schema code still depends on the field byte witnesses, but callers
only provide the pure `decodeWithdrawal` result; this module extracts the
witnesses and packages the resulting WP ce... | /-
EvmAsm.Rv64.RLP.WithdrawalDecodeAutoWP
Caller-facing WP automation for the withdrawal decoder success path. The
generated schema code still depends on the field byte witnesses, but callers
only provide the pure `decodeWithdrawal` result; this module extracts the
witnesses and packages the resulting WP ce... | @@ -454,6 +454,30 @@
unfold failureNBranch
rw [walkInitZeroNonzeroAbiFailureFromPrologueResolvedCodeSuccessFrameNBranch_pre]
+/-- Package-indexed classifier exits normalized to the nonempty, reason-erased
+ shape. The low-level empty/nonempty `match` is discharged by `pkg.hoff`. -/
+theorem failureNBranch_ex... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8091609b6430_3 | 8bf9fb9a11f55905 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WithdrawalDecodeAutoWP.lean | WithdrawalDecodeAutoWP | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "walkInitShortSuccessDecodedFailureNBranch_exits",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact (walkInitShortSuccessDecodedWP base sp0 raVal s0Old s1Old s2Old outBase m0 m1 m2\n ... | [
{
"name": "failureNBranch_exits",
"text": "/-- Package-indexed classifier exits normalized to the nonempty, reason-erased\n shape. The low-level empty/nonempty `match` is discharged by `pkg.hoff`. -/\ntheorem failureNBranch_exits\n {base sp0 raVal s0Old s1Old s2Old outBase : Word}\n {m0 m1 m2 m3 in... | [
{
"name": "walkInitShortSuccessSchemaInputFailureNBranch_exits",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 31,
"n_chars": 1896,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"aut... | 2 | /-
EvmAsm.Rv64.RLP.WithdrawalDecodeAutoWP
Caller-facing WP automation for the withdrawal decoder success path. The
generated schema code still depends on the field byte witnesses, but callers
only provide the pure `decodeWithdrawal` result; this module extracts the
witnesses and packages the resulting WP ce... | /-
EvmAsm.Rv64.RLP.WithdrawalDecodeAutoWP
Caller-facing WP automation for the withdrawal decoder success path. The
generated schema code still depends on the field byte witnesses, but callers
only provide the pure `decodeWithdrawal` result; this module extracts the
witnesses and packages the resulting WP ce... | @@ -454,6 +454,30 @@
unfold failureNBranch
rw [walkInitZeroNonzeroAbiFailureFromPrologueResolvedCodeSuccessFrameNBranch_pre]
+/-- Package-indexed classifier exits normalized to the nonempty, reason-erased
+ shape. The low-level empty/nonempty `match` is discharged by `pkg.hoff`. -/
+theorem failureNBranch_ex... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cfb9908e9691_0 | d0e0cc21c5dbe9b0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/LogArgsBridge.lean | LogArgsBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "topicCountOk_log0",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact topicCountOk_of_logArgs .log0 emitter data { data := range, topics := [] } rfl",
"n_chars": 90,
"n_subproof... | [
{
"name": "topicCountOk_of_logArgs",
"text": "theorem topicCountOk_of_logArgs\n (kind : LogKind) (emitter : Address) (data : List Byte) (args : LogArgs)\n (h_topics : EvmAsm.Evm64.LogArgs.topicCountOk kind args) :\n (mkLogEntry emitter data args).topicCountOk := by\n cases kind\n · simp [mkLogEnt... | [
{
"name": "topicCountOk_log0",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 283,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 1 | /-
EvmAsm.EL.LogArgsBridge
Bridge from EVM LOG stack arguments to EL log entries (GH #112).
-/
import EvmAsm.EL.Logs
import EvmAsm.Evm64.LogArgs
namespace EvmAsm.EL
namespace LogArgsBridge
abbrev LogArgs := EvmAsm.Evm64.LogArgs.Args
abbrev LogKind := EvmAsm.Evm64.LogArgs.Kind
def topic (word : EvmAsm.Evm64.Ev... | /-
EvmAsm.EL.LogArgsBridge
Bridge from EVM LOG stack arguments to EL log entries (GH #112).
-/
import EvmAsm.EL.Logs
import EvmAsm.Evm64.LogArgs
namespace EvmAsm.EL
namespace LogArgsBridge
abbrev LogArgs := EvmAsm.Evm64.LogArgs.Args
abbrev LogKind := EvmAsm.Evm64.LogArgs.Kind
def topic (word : EvmAsm.Evm64.Ev... | @@ -24,9 +24,31 @@
def mkLogEntry (emitter : Address) (data : List Byte) (args : LogArgs) : LogEntry :=
LogEntry.mkChecked emitter (topics args) data
+theorem topicCountOk_of_logArgs
+ (kind : LogKind) (emitter : Address) (data : List Byte) (args : LogArgs)
+ (h_topics : EvmAsm.Evm64.LogArgs.topicCountOk ki... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cfb9908e9691_1 | 3db37a6c8ceb2839 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/LogArgsBridge.lean | LogArgsBridge | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "topicCountOk_log0",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact topicCountOk_of_logArgs .log0 emitter data { data := range, topics := [] } rfl",
"n_chars": 90,
"n_subproof... | [
{
"name": "topicCountOk_of_logArgs",
"text": "theorem topicCountOk_of_logArgs\n (kind : LogKind) (emitter : Address) (data : List Byte) (args : LogArgs)\n (h_topics : EvmAsm.Evm64.LogArgs.topicCountOk kind args) :\n (mkLogEntry emitter data args).topicCountOk := by\n cases kind\n · simp [mkLogEnt... | [
{
"name": "topicCountOk_log4",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 412,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 1 | /-
EvmAsm.EL.LogArgsBridge
Bridge from EVM LOG stack arguments to EL log entries (GH #112).
-/
import EvmAsm.EL.Logs
import EvmAsm.Evm64.LogArgs
namespace EvmAsm.EL
namespace LogArgsBridge
abbrev LogArgs := EvmAsm.Evm64.LogArgs.Args
abbrev LogKind := EvmAsm.Evm64.LogArgs.Kind
def topic (word : EvmAsm.Evm64.Ev... | /-
EvmAsm.EL.LogArgsBridge
Bridge from EVM LOG stack arguments to EL log entries (GH #112).
-/
import EvmAsm.EL.Logs
import EvmAsm.Evm64.LogArgs
namespace EvmAsm.EL
namespace LogArgsBridge
abbrev LogArgs := EvmAsm.Evm64.LogArgs.Args
abbrev LogKind := EvmAsm.Evm64.LogArgs.Kind
def topic (word : EvmAsm.Evm64.Ev... | @@ -24,11 +24,34 @@
def mkLogEntry (emitter : Address) (data : List Byte) (args : LogArgs) : LogEntry :=
LogEntry.mkChecked emitter (topics args) data
+theorem topicCountOk_of_logArgs
+ (kind : LogKind) (emitter : Address) (data : List Byte) (args : LogArgs)
+ (h_topics : EvmAsm.Evm64.LogArgs.topicCountOk k... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cfb9908e9691_2 | 7a3032743b905a21 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/LogArgsBridge.lean | LogArgsBridge | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "topicCountOk_log0",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact topicCountOk_of_logArgs .log0 emitter data { data := range, topics := [] } rfl",
"n_chars": 90,
"n_subproof... | [
{
"name": "topicCountOk_of_logArgs",
"text": "theorem topicCountOk_of_logArgs\n (kind : LogKind) (emitter : Address) (data : List Byte) (args : LogArgs)\n (h_topics : EvmAsm.Evm64.LogArgs.topicCountOk kind args) :\n (mkLogEntry emitter data args).topicCountOk := by\n cases kind\n · simp [mkLogEnt... | [
{
"name": "topicCountOk_appended",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 445,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_ne... | 1 | /-
EvmAsm.EL.LogArgsBridge
Bridge from EVM LOG stack arguments to EL log entries (GH #112).
-/
import EvmAsm.EL.Logs
import EvmAsm.Evm64.LogArgs
namespace EvmAsm.EL
namespace LogArgsBridge
abbrev LogArgs := EvmAsm.Evm64.LogArgs.Args
abbrev LogKind := EvmAsm.Evm64.LogArgs.Kind
def topic (word : EvmAsm.Evm64.Ev... | /-
EvmAsm.EL.LogArgsBridge
Bridge from EVM LOG stack arguments to EL log entries (GH #112).
-/
import EvmAsm.EL.Logs
import EvmAsm.Evm64.LogArgs
namespace EvmAsm.EL
namespace LogArgsBridge
abbrev LogArgs := EvmAsm.Evm64.LogArgs.Args
abbrev LogKind := EvmAsm.Evm64.LogArgs.Kind
def topic (word : EvmAsm.Evm64.Ev... | @@ -24,6 +24,27 @@
def mkLogEntry (emitter : Address) (data : List Byte) (args : LogArgs) : LogEntry :=
LogEntry.mkChecked emitter (topics args) data
+theorem topicCountOk_of_logArgs
+ (kind : LogKind) (emitter : Address) (data : List Byte) (args : LogArgs)
+ (h_topics : EvmAsm.Evm64.LogArgs.topicCountOk ki... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bb5f1c62fa02_0 | b33d34a3397c927e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutColumn7Target.lean | ProductLayoutColumn7Target | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 90 | 2 | [
{
"theorem_name": "mulModProductLayoutCall00P136_zero_forColumn7",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mulModProductLayoutCall00P136 mulModCarryStepValue\n rw [mulModProductLayoutCall00Car... | [
{
"name": "mulModProductLayoutCall00Carry128_zero_forColumn7",
"text": "private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :\n mulModProductLayoutCall00Carry128 a b = 0 := by\n unfold mulModProductLayoutCall00Carry128\n rw [mulModProductLayoutCall00Carry120_zero]\n exact... | [
{
"name": "mulModProductLayoutCall00P136_zero_forColumn7",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 252,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_... | 1 | import EvmAsm.Evm64.MulMod.ProductLayoutColumn6Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00P136_zero_forColumn7 (a b : EvmWord) :
mulModProductLayoutCall00P136 a b = 0 := sorry
/-- The finalized product-layout column-seven cell ... | import EvmAsm.Evm64.MulMod.ProductLayoutColumn6Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :
mulModProductLayoutCall00Carry128 a b = 0 := by
unfold mulModProductLayoutCall00Carry128
rw... | @@ -5,8 +5,17 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
+private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :
+ mulModProductLayoutCall00Carry128 a b = 0 := by
+ unfold mulModProductLayoutCall00Carry128
+ rw [mulModProductLayoutCall00Carry120_zero]
+ exact mulM... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bb5f1c62fa02_1 | 4e5e45be971c7d7a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutColumn7Target.lean | ProductLayoutColumn7Target | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 90 | 2 | [
{
"theorem_name": "mulModProductLayoutCall00P136_zero_forColumn7",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mulModProductLayoutCall00P136 mulModCarryStepValue\n rw [mulModProductLayoutCall00Car... | [
{
"name": "mulModProductLayoutCall00Carry128_zero_forColumn7",
"text": "private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :\n mulModProductLayoutCall00Carry128 a b = 0 := by\n unfold mulModProductLayoutCall00Carry128\n rw [mulModProductLayoutCall00Carry120_zero]\n exact... | [
{
"name": "mulModProductLayoutCall00Carry136_zero_forColumn7",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 276,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automat... | 1 | import EvmAsm.Evm64.MulMod.ProductLayoutColumn6Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00Carry136_zero_forColumn7 (a b : EvmWord) :
mulModProductLayoutCall00Carry136 a b = 0 := sorry
/-- The finalized product-layout column-sev... | import EvmAsm.Evm64.MulMod.ProductLayoutColumn6Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :
mulModProductLayoutCall00Carry128 a b = 0 := by
unfold mulModProductLayoutCall00Carry128
rw... | @@ -5,8 +5,17 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
+private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :
+ mulModProductLayoutCall00Carry128 a b = 0 := by
+ unfold mulModProductLayoutCall00Carry128
+ rw [mulModProductLayoutCall00Carry120_zero]
+ exact mulM... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bb5f1c62fa02_2 | 1f7ae2c28109893b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutColumn7Target.lean | ProductLayoutColumn7Target | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 90 | 2 | [
{
"theorem_name": "mulModProductLayoutCall00P136_zero_forColumn7",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mulModProductLayoutCall00P136 mulModCarryStepValue\n rw [mulModProductLayoutCall00Car... | [
{
"name": "mulModProductLayoutCall00Carry128_zero_forColumn7",
"text": "private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :\n mulModProductLayoutCall00Carry128 a b = 0 := by\n unfold mulModProductLayoutCall00Carry128\n rw [mulModProductLayoutCall00Carry120_zero]\n exact... | [
{
"name": "mulModProductLayoutCall00P144_zero_forColumn7",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 252,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_... | 2 | import EvmAsm.Evm64.MulMod.ProductLayoutColumn6Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00Carry136_zero_forColumn7 (a b : EvmWord) :
mulModProductLayoutCall00Carry136 a b = 0 := sorry
private theorem mulModProductLayoutCall00P1... | import EvmAsm.Evm64.MulMod.ProductLayoutColumn6Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :
mulModProductLayoutCall00Carry128 a b = 0 := by
unfold mulModProductLayoutCall00Carry128
rw... | @@ -5,8 +5,17 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
+private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :
+ mulModProductLayoutCall00Carry128 a b = 0 := by
+ unfold mulModProductLayoutCall00Carry128
+ rw [mulModProductLayoutCall00Carry120_zero]
+ exact mulM... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bb5f1c62fa02_3 | bc28b35849fc8e8d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutColumn7Target.lean | ProductLayoutColumn7Target | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 90 | 2 | [
{
"theorem_name": "mulModProductLayoutCall00P136_zero_forColumn7",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mulModProductLayoutCall00P136 mulModCarryStepValue\n rw [mulModProductLayoutCall00Car... | [
{
"name": "mulModProductLayoutCall00Carry128_zero_forColumn7",
"text": "private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :\n mulModProductLayoutCall00Carry128 a b = 0 := by\n unfold mulModProductLayoutCall00Carry128\n rw [mulModProductLayoutCall00Carry120_zero]\n exact... | [
{
"name": "mulModProductLayoutCall00Carry144_zero_forColumn7",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 276,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automat... | 2 | import EvmAsm.Evm64.MulMod.ProductLayoutColumn6Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00Carry136_zero_forColumn7 (a b : EvmWord) :
mulModProductLayoutCall00Carry136 a b = 0 := sorry
private theorem mulModProductLayoutCall00Ca... | import EvmAsm.Evm64.MulMod.ProductLayoutColumn6Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :
mulModProductLayoutCall00Carry128 a b = 0 := by
unfold mulModProductLayoutCall00Carry128
rw... | @@ -5,8 +5,17 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
+private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :
+ mulModProductLayoutCall00Carry128 a b = 0 := by
+ unfold mulModProductLayoutCall00Carry128
+ rw [mulModProductLayoutCall00Carry120_zero]
+ exact mulM... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bb5f1c62fa02_4 | dc11270b1cb13638 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutColumn7Target.lean | ProductLayoutColumn7Target | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 90 | 2 | [
{
"theorem_name": "mulModProductLayoutCall00P136_zero_forColumn7",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mulModProductLayoutCall00P136 mulModCarryStepValue\n rw [mulModProductLayoutCall00Car... | [
{
"name": "mulModProductLayoutCall00Carry128_zero_forColumn7",
"text": "private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :\n mulModProductLayoutCall00Carry128 a b = 0 := by\n unfold mulModProductLayoutCall00Carry128\n rw [mulModProductLayoutCall00Carry120_zero]\n exact... | [
{
"name": "mulModProductLayoutCall00P152_zero_forColumn7",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 7,
"n_chars": 252,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_... | 3 | import EvmAsm.Evm64.MulMod.ProductLayoutColumn6Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00Carry136_zero_forColumn7 (a b : EvmWord) :
mulModProductLayoutCall00Carry136 a b = 0 := sorry
private theorem mulModProductLayoutCall00Ca... | import EvmAsm.Evm64.MulMod.ProductLayoutColumn6Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :
mulModProductLayoutCall00Carry128 a b = 0 := by
unfold mulModProductLayoutCall00Carry128
rw... | @@ -5,8 +5,17 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
+private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :
+ mulModProductLayoutCall00Carry128 a b = 0 := by
+ unfold mulModProductLayoutCall00Carry128
+ rw [mulModProductLayoutCall00Carry120_zero]
+ exact mulM... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bb5f1c62fa02_5 | 9ca85eb9e35befd0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutColumn7Target.lean | ProductLayoutColumn7Target | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 90 | 2 | [
{
"theorem_name": "mulModProductLayoutCall00P136_zero_forColumn7",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mulModProductLayoutCall00P136 mulModCarryStepValue\n rw [mulModProductLayoutCall00Car... | [
{
"name": "mulModProductLayoutCall00Carry128_zero_forColumn7",
"text": "private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :\n mulModProductLayoutCall00Carry128 a b = 0 := by\n unfold mulModProductLayoutCall00Carry128\n rw [mulModProductLayoutCall00Carry120_zero]\n exact... | [
{
"name": "mulModProductLayoutCall01P136_zero_forColumn7",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 7,
"n_chars": 299,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_... | 3 | import EvmAsm.Evm64.MulMod.ProductLayoutColumn6Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00P136_zero_forColumn7 (a b : EvmWord) :
mulModProductLayoutCall00P136 a b = 0 := sorry
private theorem mulModProductLayoutCall01Carry128_z... | import EvmAsm.Evm64.MulMod.ProductLayoutColumn6Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :
mulModProductLayoutCall00Carry128 a b = 0 := by
unfold mulModProductLayoutCall00Carry128
rw... | @@ -5,8 +5,17 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
+private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :
+ mulModProductLayoutCall00Carry128 a b = 0 := by
+ unfold mulModProductLayoutCall00Carry128
+ rw [mulModProductLayoutCall00Carry120_zero]
+ exact mulM... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bb5f1c62fa02_6 | 6f14556a378908a5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutColumn7Target.lean | ProductLayoutColumn7Target | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 90 | 2 | [
{
"theorem_name": "mulModProductLayoutCall00P136_zero_forColumn7",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mulModProductLayoutCall00P136 mulModCarryStepValue\n rw [mulModProductLayoutCall00Car... | [
{
"name": "mulModProductLayoutCall00Carry128_zero_forColumn7",
"text": "private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :\n mulModProductLayoutCall00Carry128 a b = 0 := by\n unfold mulModProductLayoutCall00Carry128\n rw [mulModProductLayoutCall00Carry120_zero]\n exact... | [
{
"name": "mulModProductLayoutCall01Carry136_zero_forColumn7",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 7,
"n_chars": 323,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automat... | 3 | import EvmAsm.Evm64.MulMod.ProductLayoutColumn6Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00P136_zero_forColumn7 (a b : EvmWord) :
mulModProductLayoutCall00P136 a b = 0 := sorry
private theorem mulModProductLayoutCall01Carry128_z... | import EvmAsm.Evm64.MulMod.ProductLayoutColumn6Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :
mulModProductLayoutCall00Carry128 a b = 0 := by
unfold mulModProductLayoutCall00Carry128
rw... | @@ -5,8 +5,17 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
+private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :
+ mulModProductLayoutCall00Carry128 a b = 0 := by
+ unfold mulModProductLayoutCall00Carry128
+ rw [mulModProductLayoutCall00Carry120_zero]
+ exact mulM... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bb5f1c62fa02_7 | 2accd6e50e0676a2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutColumn7Target.lean | ProductLayoutColumn7Target | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 90 | 2 | [
{
"theorem_name": "mulModProductLayoutCall01P136_zero_forColumn7",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mulModProductLayoutCall01P136 mulModCarryStepValue\n rw [mulModProductLayoutCall00P13... | [
{
"name": "mulModProductLayoutCall00P136_zero_forColumn7",
"text": "private theorem mulModProductLayoutCall00P136_zero_forColumn7 (a b : EvmWord) :\n mulModProductLayoutCall00P136 a b = 0 := by\n unfold mulModProductLayoutCall00P136 mulModCarryStepValue\n rw [mulModProductLayoutCall00Carry128_zero_forC... | [
{
"name": "mulModProductLayoutCall01P144_zero_forColumn7",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 7,
"n_chars": 299,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_... | 6 | import EvmAsm.Evm64.MulMod.ProductLayoutColumn6Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :
mulModProductLayoutCall00Carry128 a b = 0 := by
unfold mulModProductLayoutCall00Carry128
rw... | import EvmAsm.Evm64.MulMod.ProductLayoutColumn6Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :
mulModProductLayoutCall00Carry128 a b = 0 := by
unfold mulModProductLayoutCall00Carry128
rw... | @@ -11,6 +11,12 @@
rw [mulModProductLayoutCall00Carry120_zero]
exact mulModCarryStepCarry_zero_zero
+private theorem mulModProductLayoutCall00P136_zero_forColumn7 (a b : EvmWord) :
+ mulModProductLayoutCall00P136 a b = 0 := by
+ unfold mulModProductLayoutCall00P136 mulModCarryStepValue
+ rw [mulModProductL... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bb5f1c62fa02_8 | f160b02c0603c6bc | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutColumn7Target.lean | ProductLayoutColumn7Target | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 90 | 2 | [
{
"theorem_name": "mulModProductLayoutCall01P136_zero_forColumn7",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mulModProductLayoutCall01P136 mulModCarryStepValue\n rw [mulModProductLayoutCall00P13... | [
{
"name": "mulModProductLayoutCall00P136_zero_forColumn7",
"text": "private theorem mulModProductLayoutCall00P136_zero_forColumn7 (a b : EvmWord) :\n mulModProductLayoutCall00P136 a b = 0 := by\n unfold mulModProductLayoutCall00P136 mulModCarryStepValue\n rw [mulModProductLayoutCall00Carry128_zero_forC... | [
{
"name": "mulModProductLayoutCall01Carry144_zero_forColumn7",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 7,
"n_chars": 323,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automat... | 6 | import EvmAsm.Evm64.MulMod.ProductLayoutColumn6Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :
mulModProductLayoutCall00Carry128 a b = 0 := by
unfold mulModProductLayoutCall00Carry128
rw... | import EvmAsm.Evm64.MulMod.ProductLayoutColumn6Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00Carry128_zero_forColumn7 (a b : EvmWord) :
mulModProductLayoutCall00Carry128 a b = 0 := by
unfold mulModProductLayoutCall00Carry128
rw... | @@ -11,6 +11,12 @@
rw [mulModProductLayoutCall00Carry120_zero]
exact mulModCarryStepCarry_zero_zero
+private theorem mulModProductLayoutCall00P136_zero_forColumn7 (a b : EvmWord) :
+ mulModProductLayoutCall00P136 a b = 0 := by
+ unfold mulModProductLayoutCall00P136 mulModCarryStepValue
+ rw [mulModProductL... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "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.