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_eaff7724ba8f_70 | 00976073bb622b93 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N4V4ShiftNzDispatcher.lean | N4V4ShiftNzDispatcher | 70 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 6 | [
{
"theorem_name": "n4ShiftNzDispatcherBranchBoundsV4.callSkipBranch",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [n4ShiftNzDispatcherBranchBoundsV4_def] at hevidence\n exact hevidence.1",
"n_char... | [
{
"name": "n4ShiftNzDispatcherBranchBoundsV4_def",
"text": "theorem n4ShiftNzDispatcherBranchBoundsV4_def {a b : EvmWord} :\n n4ShiftNzDispatcherBranchBoundsV4 a b =\n (n4CallSkipBranchV4 a b ∧\n isAddbackCarry2NzN4CallV4Evm a b ∧\n n4CallAddbackBeqRuntimeBounds a b) :=\n rfl\n\n",
... | [
{
"name": "evm_div_n4_shift_nz_stack_spec_noNop_of_branch_bounds",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 10,
"n_lines": 25,
"n_chars": 1258,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"... | 8 | /-
EvmAsm.Evm64.DivMod.Spec.N4V4ShiftNzDispatcher
Dispatcher-level n=4, shift-nonzero DIV v4 wrapper.
-/
import EvmAsm.Evm64.DivMod.Spec.CallAddbackRuntimeHighDiv
import EvmAsm.Evm64.DivMod.Spec.CallSkipUnconditional
import EvmAsm.Evm64.DivMod.Spec.CallSkipV4NoWrap
import EvmAsm.Evm64.DivMod.Spec.N4V4StackPre
na... | /-
EvmAsm.Evm64.DivMod.Spec.N4V4ShiftNzDispatcher
Dispatcher-level n=4, shift-nonzero DIV v4 wrapper.
-/
import EvmAsm.Evm64.DivMod.Spec.CallAddbackRuntimeHighDiv
import EvmAsm.Evm64.DivMod.Spec.CallSkipUnconditional
import EvmAsm.Evm64.DivMod.Spec.CallSkipV4NoWrap
import EvmAsm.Evm64.DivMod.Spec.N4V4StackPre
na... | @@ -139,6 +139,13 @@
n4CallAddbackBeqRuntimeBounds a b)) :=
rfl
+theorem n4ShiftNzDispatcherBranchBoundsV4_def {a b : EvmWord} :
+ n4ShiftNzDispatcherBranchBoundsV4 a b =
+ (n4CallSkipBranchV4 a b ∧
+ isAddbackCarry2NzN4CallV4Evm a b ∧
+ n4CallAddbackBeqRuntimeBounds a b) :=
+ rfl
+
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_d66aaad0bebd_0 | 8ef1c3f30948f271 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2V5PreloopShift0.lean | FullPathN2V5PreloopShift0 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_div_n2_to_loopSetup_shift0_spec_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 32,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hC2 := evm_div_phaseAB_n2_clz_c2taken_spec_v5_noNop sp base b0 b1 b2 b3\n v2 v5 v6 v7... | [
{
"name": "evm_div_phaseAB_n2_clz_c2taken_spec_v5_noNop",
"text": "/-- v5 n=2 phaseAB-clz + phaseC2(shift=0 taken), `base → copyAUOff`, over\n `divCode_noNop_v5`. Shift=0 branch (`(clzResult b1).1 = 0`): the divisor is\n already aligned, so phase-C2 takes the BEQ to copyAU. -/\ntheorem evm_div_phaseA... | [
{
"name": "evm_div_n2_to_loopSetup_shift0_spec_v5_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 77,
"n_chars": 4904,
"n_subproofs": 5,
"n_tactics": 34,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 1,
"automatio... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V5PreloopShift0
v5 n=2 shift=0 preloop pieces over `divCode_noNop_v5`. On the shift=0 branch
the divisor is already top-bit-aligned, so normalization is skipped: phase-C2
takes the BEQ to copyAU. This file builds the n=2 phaseAB-clz + phaseC2-taken
segment (`base → ... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V5PreloopShift0
v5 n=2 shift=0 preloop pieces over `divCode_noNop_v5`. On the shift=0 branch
the divisor is already top-bit-aligned, so normalization is skipped: phase-C2
takes the BEQ to copyAU. This file builds the n=2 phaseAB-clz + phaseC2-taken
segment (`base → ... | @@ -18,6 +18,59 @@
open EvmAsm.Rv64
+/-- v5 n=2 phaseAB-clz + phaseC2(shift=0 taken), `base → copyAUOff`, over
+ `divCode_noNop_v5`. Shift=0 branch (`(clzResult b1).1 = 0`): the divisor is
+ already aligned, so phase-C2 takes the BEQ to copyAU. -/
+theorem evm_div_phaseAB_n2_clz_c2taken_spec_v5_noNop (sp ba... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c32b9055a670_0 | 0e88a2b9d8746551 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Pow256CodeBridge.lean | Pow256CodeBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "evm_addmod_pow256_mod_n_shared_code_with_callable_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold evm_addmod_pow256_mod_n_shared_code\n exact CodeReq.union_sub\n (evm_addmo... | [
{
"name": "evm_addmod_pow256_plus_one_call_restore_with_callable_sub",
"text": "/-- The second composed pow256 call/restore code is subsumed by the concrete\n helper program plus callable body. -/\ntheorem evm_addmod_pow256_plus_one_call_restore_with_callable_sub\n (base : Word) (modOff : BitVec 21) (... | [
{
"name": "evm_addmod_pow256_mod_n_shared_code_with_callable_sub",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 780,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"au... | 2 | /-
EvmAsm.Evm64.AddMod.Pow256CodeBridge
CodeReq subsumption bridges from composed pow256 call/restore code into the
concrete ADDMOD pow256 helper program plus callable body.
-/
import EvmAsm.Evm64.AddMod.Pow256Spec
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- The first composed pow256 call/restore code is sub... | /-
EvmAsm.Evm64.AddMod.Pow256CodeBridge
CodeReq subsumption bridges from composed pow256 call/restore code into the
concrete ADDMOD pow256 helper program plus callable body.
-/
import EvmAsm.Evm64.AddMod.Pow256Spec
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- The first composed pow256 call/restore code is sub... | @@ -139,13 +139,154 @@
(CodeReq.union_sub (CodeReq.union_sub hPrep hEnter) hJal)
(CodeReq.union_sub hCallable hRestore) a i h
+/-- The second composed pow256 call/restore code is subsumed by the concrete
+ helper program plus callable body. -/
+theorem evm_addmod_pow256_plus_one_call_restore_with_callabl... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c32b9055a670_1 | 732f4733ce402b54 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Pow256CodeBridge.lean | Pow256CodeBridge | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "evm_addmod_pow256_shared_code_extend_to_concrete",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (evm_addmod_pow256_mod_n_shared_code_with_callable_sub base ... | [
{
"name": "evm_addmod_pow256_mod_n_shared_code_with_callable_sub",
"text": "/-- The named shared pow256 call/restore code region is subsumed by the concrete\n helper program plus callable body. -/\ntheorem evm_addmod_pow256_mod_n_shared_code_with_callable_sub\n (base : Word) (modOff : BitVec 21) (call... | [
{
"name": "evm_addmod_pow256_shared_code_extend_to_concrete",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 14,
"n_chars": 739,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automat... | 3 | /-
EvmAsm.Evm64.AddMod.Pow256CodeBridge
CodeReq subsumption bridges from composed pow256 call/restore code into the
concrete ADDMOD pow256 helper program plus callable body.
-/
import EvmAsm.Evm64.AddMod.Pow256Spec
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- The first composed pow256 call/restore code is sub... | /-
EvmAsm.Evm64.AddMod.Pow256CodeBridge
CodeReq subsumption bridges from composed pow256 call/restore code into the
concrete ADDMOD pow256 helper program plus callable body.
-/
import EvmAsm.Evm64.AddMod.Pow256Spec
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- The first composed pow256 call/restore code is sub... | @@ -276,6 +276,18 @@
(CodeReq.union_sub (CodeReq.union_sub hPrep hEnter) hJal)
(CodeReq.union_sub hCallable hRestore) a i h
+/-- The named shared pow256 call/restore code region is subsumed by the concrete
+ helper program plus callable body. -/
+theorem evm_addmod_pow256_mod_n_shared_code_with_callable_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c32b9055a670_2 | e7f2d9664c530ed6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Pow256CodeBridge.lean | Pow256CodeBridge | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "evm_addmod_pow256_mod_n_shared_code_with_callable_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold evm_addmod_pow256_mod_n_shared_code\n exact CodeReq.union_sub\n (evm_addmo... | [
{
"name": "evm_addmod_pow256_plus_one_call_restore_with_callable_sub",
"text": "/-- The second composed pow256 call/restore code is subsumed by the concrete\n helper program plus callable body. -/\ntheorem evm_addmod_pow256_plus_one_call_restore_with_callable_sub\n (base : Word) (modOff : BitVec 21) (... | [
{
"name": "evm_addmod_pow256_mod_n_with_callable_code_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 82,
"n_chars": 4857,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"... | 2 | /-
EvmAsm.Evm64.AddMod.Pow256CodeBridge
CodeReq subsumption bridges from composed pow256 call/restore code into the
concrete ADDMOD pow256 helper program plus callable body.
-/
import EvmAsm.Evm64.AddMod.Pow256Spec
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- The first composed pow256 call/restore code is sub... | /-
EvmAsm.Evm64.AddMod.Pow256CodeBridge
CodeReq subsumption bridges from composed pow256 call/restore code into the
concrete ADDMOD pow256 helper program plus callable body.
-/
import EvmAsm.Evm64.AddMod.Pow256Spec
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- The first composed pow256 call/restore code is sub... | @@ -139,6 +139,143 @@
(CodeReq.union_sub (CodeReq.union_sub hPrep hEnter) hJal)
(CodeReq.union_sub hCallable hRestore) a i h
+/-- The second composed pow256 call/restore code is subsumed by the concrete
+ helper program plus callable body. -/
+theorem evm_addmod_pow256_plus_one_call_restore_with_callable... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_d2d59f64ce82_0 | 755c07b1732c3fdf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN3V5PathShift0.lean | FullPathN3V5PathShift0 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_div_n3_to_denorm_shift0_param_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hb2ge : b2.toNat ≥ 2 ^ 63 := clz_zero_imp_msb hshift_z\n have hPre := evm_div_n3_to_loopS... | [
{
"name": "n3_shift0_loopExit_to_loopN3PreWithScratch",
"text": "/-- Bridge: shift=0 preloop exit (`b3 = 0`) plus the framed scratch/return cells\n implies the loop entry bundle over the raw divisor + verbatim window. -/\ntheorem n3_shift0_loopExit_to_loopN3PreWithScratch (sp : Word)\n (a0 a1 a2 a3 b0... | [
{
"name": "evm_div_n3_to_denorm_shift0_param_v5_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 80,
"n_chars": 4808,
"n_subproofs": 7,
"n_tactics": 33,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5PathShift0
Bridge from the n=3 v5 shift=0 preloop exit (at `loopBodyOff`, the layout
produced by `evm_div_n3_to_loopSetup_shift0_spec_v5_noNop`, #7552) to the loop's
entry bundle `loopN3PreWithScratchV4NoX1` over the RAW divisor `(b0, b1, b2, 0)`
and shift=0 verbati... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5PathShift0
Bridge from the n=3 v5 shift=0 preloop exit (at `loopBodyOff`, the layout
produced by `evm_div_n3_to_loopSetup_shift0_spec_v5_noNop`, #7552) to the loop's
entry bundle `loopN3PreWithScratchV4NoX1` over the RAW divisor `(b0, b1, b2, 0)`
and shift=0 verbati... | @@ -19,6 +19,54 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
+/-- Bridge: shift=0 preloop exit (`b3 = 0`) plus the framed scratch/return cells
+ implies the loop entry bundle over the raw divisor + verbatim window. -/
+theorem n3_shift0_loopExit_to_loopN3PreWithScratch (sp : Wo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6d5aac41430e_0 | ba7d6aa39931d16e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/AbsComponents.lean | AbsComponents | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 5 | [
{
"theorem_name": "smodAbsDividendWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [smodAbsDividendWord_eq_components, EvmWord.getLimbN_lt _ 0 (by decide)]\n exact EvmWord.getLimb_fromLim... | [
{
"name": "smodAbsDividendWord_eq_components",
"text": "theorem smodAbsDividendWord_eq_components\n (limb0 limb1 limb2 top : Word) :\n smodAbsDividendWord limb0 limb1 limb2 top =\n EvmWord.fromLimbs fun i : Fin 4 =>\n match i with\n | 0 => smodAbsSum0 limb0 top\n | 1 => smodA... | [
{
"name": "smodAbsDividendWord_getLimbN_0",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 284,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.SMod.Compose.AbsComponents
Shared signed-absolute-value component abbreviations for SMOD mod-call
handoff proofs.
-/
import EvmAsm.Evm64.SMod.Compose.QuadMemBridges
import EvmAsm.Evm64.SMod.Compose.Words
namespace EvmAsm.Evm64.SMod.Compose
abbrev smodAbsSign (top : Word) : Word :=
top >>> (6... | /-
EvmAsm.Evm64.SMod.Compose.AbsComponents
Shared signed-absolute-value component abbreviations for SMOD mod-call
handoff proofs.
-/
import EvmAsm.Evm64.SMod.Compose.QuadMemBridges
import EvmAsm.Evm64.SMod.Compose.Words
namespace EvmAsm.Evm64.SMod.Compose
abbrev smodAbsSign (top : Word) : Word :=
top >>> (6... | @@ -51,6 +51,17 @@
else
0
+theorem smodAbsDividendWord_eq_components
+ (limb0 limb1 limb2 top : Word) :
+ smodAbsDividendWord limb0 limb1 limb2 top =
+ EvmWord.fromLimbs fun i : Fin 4 =>
+ match i with
+ | 0 => smodAbsSum0 limb0 top
+ | 1 => smodAbsSum1 limb0 limb1 top
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6d5aac41430e_1 | 8efb8fb8e87fdea5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/AbsComponents.lean | AbsComponents | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 5 | [
{
"theorem_name": "smodAbsDividendWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [smodAbsDividendWord_eq_components, EvmWord.getLimbN_lt _ 0 (by decide)]\n exact EvmWord.getLimb_fromLim... | [
{
"name": "smodAbsDividendWord_eq_components",
"text": "theorem smodAbsDividendWord_eq_components\n (limb0 limb1 limb2 top : Word) :\n smodAbsDividendWord limb0 limb1 limb2 top =\n EvmWord.fromLimbs fun i : Fin 4 =>\n match i with\n | 0 => smodAbsSum0 limb0 top\n | 1 => smodA... | [
{
"name": "smodAbsDividendWord_getLimbN_1",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 290,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.SMod.Compose.AbsComponents
Shared signed-absolute-value component abbreviations for SMOD mod-call
handoff proofs.
-/
import EvmAsm.Evm64.SMod.Compose.QuadMemBridges
import EvmAsm.Evm64.SMod.Compose.Words
namespace EvmAsm.Evm64.SMod.Compose
abbrev smodAbsSign (top : Word) : Word :=
top >>> (6... | /-
EvmAsm.Evm64.SMod.Compose.AbsComponents
Shared signed-absolute-value component abbreviations for SMOD mod-call
handoff proofs.
-/
import EvmAsm.Evm64.SMod.Compose.QuadMemBridges
import EvmAsm.Evm64.SMod.Compose.Words
namespace EvmAsm.Evm64.SMod.Compose
abbrev smodAbsSign (top : Word) : Word :=
top >>> (6... | @@ -51,6 +51,17 @@
else
0
+theorem smodAbsDividendWord_eq_components
+ (limb0 limb1 limb2 top : Word) :
+ smodAbsDividendWord limb0 limb1 limb2 top =
+ EvmWord.fromLimbs fun i : Fin 4 =>
+ match i with
+ | 0 => smodAbsSum0 limb0 top
+ | 1 => smodAbsSum1 limb0 limb1 top
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6d5aac41430e_2 | 97d485494f4a2f19 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/AbsComponents.lean | AbsComponents | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 5 | [
{
"theorem_name": "smodAbsDividendWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [smodAbsDividendWord_eq_components, EvmWord.getLimbN_lt _ 0 (by decide)]\n exact EvmWord.getLimb_fromLim... | [
{
"name": "smodAbsDividendWord_eq_components",
"text": "theorem smodAbsDividendWord_eq_components\n (limb0 limb1 limb2 top : Word) :\n smodAbsDividendWord limb0 limb1 limb2 top =\n EvmWord.fromLimbs fun i : Fin 4 =>\n match i with\n | 0 => smodAbsSum0 limb0 top\n | 1 => smodA... | [
{
"name": "smodAbsDividendWord_getLimbN_2",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 296,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.SMod.Compose.AbsComponents
Shared signed-absolute-value component abbreviations for SMOD mod-call
handoff proofs.
-/
import EvmAsm.Evm64.SMod.Compose.QuadMemBridges
import EvmAsm.Evm64.SMod.Compose.Words
namespace EvmAsm.Evm64.SMod.Compose
abbrev smodAbsSign (top : Word) : Word :=
top >>> (6... | /-
EvmAsm.Evm64.SMod.Compose.AbsComponents
Shared signed-absolute-value component abbreviations for SMOD mod-call
handoff proofs.
-/
import EvmAsm.Evm64.SMod.Compose.QuadMemBridges
import EvmAsm.Evm64.SMod.Compose.Words
namespace EvmAsm.Evm64.SMod.Compose
abbrev smodAbsSign (top : Word) : Word :=
top >>> (6... | @@ -51,6 +51,17 @@
else
0
+theorem smodAbsDividendWord_eq_components
+ (limb0 limb1 limb2 top : Word) :
+ smodAbsDividendWord limb0 limb1 limb2 top =
+ EvmWord.fromLimbs fun i : Fin 4 =>
+ match i with
+ | 0 => smodAbsSum0 limb0 top
+ | 1 => smodAbsSum1 limb0 limb1 top
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6d5aac41430e_3 | ec2bd39f06308c29 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/AbsComponents.lean | AbsComponents | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 5 | [
{
"theorem_name": "smodAbsDividendWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [smodAbsDividendWord_eq_components, EvmWord.getLimbN_lt _ 0 (by decide)]\n exact EvmWord.getLimb_fromLim... | [
{
"name": "smodAbsDividendWord_eq_components",
"text": "theorem smodAbsDividendWord_eq_components\n (limb0 limb1 limb2 top : Word) :\n smodAbsDividendWord limb0 limb1 limb2 top =\n EvmWord.fromLimbs fun i : Fin 4 =>\n match i with\n | 0 => smodAbsSum0 limb0 top\n | 1 => smodA... | [
{
"name": "smodAbsDividendWord_getLimbN_3",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 296,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.SMod.Compose.AbsComponents
Shared signed-absolute-value component abbreviations for SMOD mod-call
handoff proofs.
-/
import EvmAsm.Evm64.SMod.Compose.QuadMemBridges
import EvmAsm.Evm64.SMod.Compose.Words
namespace EvmAsm.Evm64.SMod.Compose
abbrev smodAbsSign (top : Word) : Word :=
top >>> (6... | /-
EvmAsm.Evm64.SMod.Compose.AbsComponents
Shared signed-absolute-value component abbreviations for SMOD mod-call
handoff proofs.
-/
import EvmAsm.Evm64.SMod.Compose.QuadMemBridges
import EvmAsm.Evm64.SMod.Compose.Words
namespace EvmAsm.Evm64.SMod.Compose
abbrev smodAbsSign (top : Word) : Word :=
top >>> (6... | @@ -51,6 +51,17 @@
else
0
+theorem smodAbsDividendWord_eq_components
+ (limb0 limb1 limb2 top : Word) :
+ smodAbsDividendWord limb0 limb1 limb2 top =
+ EvmWord.fromLimbs fun i : Fin 4 =>
+ match i with
+ | 0 => smodAbsSum0 limb0 top
+ | 1 => smodAbsSum1 limb0 limb1 top
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6d5aac41430e_4 | 30f839a9bbec8e81 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/AbsComponents.lean | AbsComponents | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 5 | [
{
"theorem_name": "smodAbsDivisorWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [smodAbsDivisorWord_eq_components, EvmWord.getLimbN_lt _ 0 (by decide)]\n exact EvmWord.getLimb_fromLimbs... | [
{
"name": "smodAbsDivisorWord_eq_components",
"text": "theorem smodAbsDivisorWord_eq_components\n (limb0 limb1 limb2 top : Word) :\n smodAbsDivisorWord limb0 limb1 limb2 top =\n EvmWord.fromLimbs fun i : Fin 4 =>\n match i with\n | 0 => smodAbsSum0 limb0 top\n | 1 => smodAbsS... | [
{
"name": "smodAbsDivisorWord_getLimbN_0",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 281,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.SMod.Compose.AbsComponents
Shared signed-absolute-value component abbreviations for SMOD mod-call
handoff proofs.
-/
import EvmAsm.Evm64.SMod.Compose.QuadMemBridges
import EvmAsm.Evm64.SMod.Compose.Words
namespace EvmAsm.Evm64.SMod.Compose
abbrev smodAbsSign (top : Word) : Word :=
top >>> (6... | /-
EvmAsm.Evm64.SMod.Compose.AbsComponents
Shared signed-absolute-value component abbreviations for SMOD mod-call
handoff proofs.
-/
import EvmAsm.Evm64.SMod.Compose.QuadMemBridges
import EvmAsm.Evm64.SMod.Compose.Words
namespace EvmAsm.Evm64.SMod.Compose
abbrev smodAbsSign (top : Word) : Word :=
top >>> (6... | @@ -62,10 +62,23 @@
| 3 => smodAbsSum3 limb0 limb1 limb2 top := by
rfl
+theorem smodAbsDivisorWord_eq_components
+ (limb0 limb1 limb2 top : Word) :
+ smodAbsDivisorWord limb0 limb1 limb2 top =
+ EvmWord.fromLimbs fun i : Fin 4 =>
+ match i with
+ | 0 => smodAbsSum0 limb0 top
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6d5aac41430e_5 | 57e88a652083e164 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/AbsComponents.lean | AbsComponents | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 5 | [
{
"theorem_name": "smodAbsDivisorWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [smodAbsDivisorWord_eq_components, EvmWord.getLimbN_lt _ 0 (by decide)]\n exact EvmWord.getLimb_fromLimbs... | [
{
"name": "smodAbsDivisorWord_eq_components",
"text": "theorem smodAbsDivisorWord_eq_components\n (limb0 limb1 limb2 top : Word) :\n smodAbsDivisorWord limb0 limb1 limb2 top =\n EvmWord.fromLimbs fun i : Fin 4 =>\n match i with\n | 0 => smodAbsSum0 limb0 top\n | 1 => smodAbsS... | [
{
"name": "smodAbsDivisorWord_getLimbN_1",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 287,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.SMod.Compose.AbsComponents
Shared signed-absolute-value component abbreviations for SMOD mod-call
handoff proofs.
-/
import EvmAsm.Evm64.SMod.Compose.QuadMemBridges
import EvmAsm.Evm64.SMod.Compose.Words
namespace EvmAsm.Evm64.SMod.Compose
abbrev smodAbsSign (top : Word) : Word :=
top >>> (6... | /-
EvmAsm.Evm64.SMod.Compose.AbsComponents
Shared signed-absolute-value component abbreviations for SMOD mod-call
handoff proofs.
-/
import EvmAsm.Evm64.SMod.Compose.QuadMemBridges
import EvmAsm.Evm64.SMod.Compose.Words
namespace EvmAsm.Evm64.SMod.Compose
abbrev smodAbsSign (top : Word) : Word :=
top >>> (6... | @@ -62,10 +62,23 @@
| 3 => smodAbsSum3 limb0 limb1 limb2 top := by
rfl
+theorem smodAbsDivisorWord_eq_components
+ (limb0 limb1 limb2 top : Word) :
+ smodAbsDivisorWord limb0 limb1 limb2 top =
+ EvmWord.fromLimbs fun i : Fin 4 =>
+ match i with
+ | 0 => smodAbsSum0 limb0 top
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6d5aac41430e_6 | a6fb0946b67abb0b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/AbsComponents.lean | AbsComponents | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 5 | [
{
"theorem_name": "smodAbsDivisorWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [smodAbsDivisorWord_eq_components, EvmWord.getLimbN_lt _ 0 (by decide)]\n exact EvmWord.getLimb_fromLimbs... | [
{
"name": "smodAbsDivisorWord_eq_components",
"text": "theorem smodAbsDivisorWord_eq_components\n (limb0 limb1 limb2 top : Word) :\n smodAbsDivisorWord limb0 limb1 limb2 top =\n EvmWord.fromLimbs fun i : Fin 4 =>\n match i with\n | 0 => smodAbsSum0 limb0 top\n | 1 => smodAbsS... | [
{
"name": "smodAbsDivisorWord_getLimbN_2",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 293,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.SMod.Compose.AbsComponents
Shared signed-absolute-value component abbreviations for SMOD mod-call
handoff proofs.
-/
import EvmAsm.Evm64.SMod.Compose.QuadMemBridges
import EvmAsm.Evm64.SMod.Compose.Words
namespace EvmAsm.Evm64.SMod.Compose
abbrev smodAbsSign (top : Word) : Word :=
top >>> (6... | /-
EvmAsm.Evm64.SMod.Compose.AbsComponents
Shared signed-absolute-value component abbreviations for SMOD mod-call
handoff proofs.
-/
import EvmAsm.Evm64.SMod.Compose.QuadMemBridges
import EvmAsm.Evm64.SMod.Compose.Words
namespace EvmAsm.Evm64.SMod.Compose
abbrev smodAbsSign (top : Word) : Word :=
top >>> (6... | @@ -62,10 +62,23 @@
| 3 => smodAbsSum3 limb0 limb1 limb2 top := by
rfl
+theorem smodAbsDivisorWord_eq_components
+ (limb0 limb1 limb2 top : Word) :
+ smodAbsDivisorWord limb0 limb1 limb2 top =
+ EvmWord.fromLimbs fun i : Fin 4 =>
+ match i with
+ | 0 => smodAbsSum0 limb0 top
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6d5aac41430e_7 | 6e6cef28882c057a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/AbsComponents.lean | AbsComponents | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 5 | [
{
"theorem_name": "smodAbsDivisorWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [smodAbsDivisorWord_eq_components, EvmWord.getLimbN_lt _ 0 (by decide)]\n exact EvmWord.getLimb_fromLimbs... | [
{
"name": "smodAbsDivisorWord_eq_components",
"text": "theorem smodAbsDivisorWord_eq_components\n (limb0 limb1 limb2 top : Word) :\n smodAbsDivisorWord limb0 limb1 limb2 top =\n EvmWord.fromLimbs fun i : Fin 4 =>\n match i with\n | 0 => smodAbsSum0 limb0 top\n | 1 => smodAbsS... | [
{
"name": "smodAbsDivisorWord_getLimbN_3",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 293,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.SMod.Compose.AbsComponents
Shared signed-absolute-value component abbreviations for SMOD mod-call
handoff proofs.
-/
import EvmAsm.Evm64.SMod.Compose.QuadMemBridges
import EvmAsm.Evm64.SMod.Compose.Words
namespace EvmAsm.Evm64.SMod.Compose
abbrev smodAbsSign (top : Word) : Word :=
top >>> (6... | /-
EvmAsm.Evm64.SMod.Compose.AbsComponents
Shared signed-absolute-value component abbreviations for SMOD mod-call
handoff proofs.
-/
import EvmAsm.Evm64.SMod.Compose.QuadMemBridges
import EvmAsm.Evm64.SMod.Compose.Words
namespace EvmAsm.Evm64.SMod.Compose
abbrev smodAbsSign (top : Word) : Word :=
top >>> (6... | @@ -62,10 +62,23 @@
| 3 => smodAbsSum3 limb0 limb1 limb2 top := by
rfl
+theorem smodAbsDivisorWord_eq_components
+ (limb0 limb1 limb2 top : Word) :
+ smodAbsDivisorWord limb0 limb1 limb2 top =
+ EvmWord.fromLimbs fun i : Fin 4 =>
+ match i with
+ | 0 => smodAbsSum0 limb0 top
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6d5aac41430e_8 | abc50d38e6523ac1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/AbsComponents.lean | AbsComponents | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 5 | [
{
"theorem_name": "smodAbsDividendWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [smodAbsDividendWord_eq_components, EvmWord.getLimbN_lt _ 0 (by decide)]\n exact EvmWord.getLimb_fromLim... | [
{
"name": "smodAbsDividendWord_eq_components",
"text": "theorem smodAbsDividendWord_eq_components\n (limb0 limb1 limb2 top : Word) :\n smodAbsDividendWord limb0 limb1 limb2 top =\n EvmWord.fromLimbs fun i : Fin 4 =>\n match i with\n | 0 => smodAbsSum0 limb0 top\n | 1 => smodA... | [
{
"name": "smodAbsDividendWord_evmWordIs_sp_components_smodOffsets",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 837,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"... | 1 | /-
EvmAsm.Evm64.SMod.Compose.AbsComponents
Shared signed-absolute-value component abbreviations for SMOD mod-call
handoff proofs.
-/
import EvmAsm.Evm64.SMod.Compose.QuadMemBridges
import EvmAsm.Evm64.SMod.Compose.Words
namespace EvmAsm.Evm64.SMod.Compose
abbrev smodAbsSign (top : Word) : Word :=
top >>> (6... | /-
EvmAsm.Evm64.SMod.Compose.AbsComponents
Shared signed-absolute-value component abbreviations for SMOD mod-call
handoff proofs.
-/
import EvmAsm.Evm64.SMod.Compose.QuadMemBridges
import EvmAsm.Evm64.SMod.Compose.Words
namespace EvmAsm.Evm64.SMod.Compose
abbrev smodAbsSign (top : Word) : Word :=
top >>> (6... | @@ -51,6 +51,17 @@
else
0
+theorem smodAbsDividendWord_eq_components
+ (limb0 limb1 limb2 top : Word) :
+ smodAbsDividendWord limb0 limb1 limb2 top =
+ EvmWord.fromLimbs fun i : Fin 4 =>
+ match i with
+ | 0 => smodAbsSum0 limb0 top
+ | 1 => smodAbsSum1 limb0 limb1 top
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6d5aac41430e_9 | a07523877aaf28b6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/AbsComponents.lean | AbsComponents | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 5 | [
{
"theorem_name": "smodAbsDivisorWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [smodAbsDivisorWord_eq_components, EvmWord.getLimbN_lt _ 0 (by decide)]\n exact EvmWord.getLimb_fromLimbs... | [
{
"name": "smodAbsDivisorWord_eq_components",
"text": "theorem smodAbsDivisorWord_eq_components\n (limb0 limb1 limb2 top : Word) :\n smodAbsDivisorWord limb0 limb1 limb2 top =\n EvmWord.fromLimbs fun i : Fin 4 =>\n match i with\n | 0 => smodAbsSum0 limb0 top\n | 1 => smodAbsS... | [
{
"name": "smodAbsDivisorWord_evmWordIs_sp32_components_smodOffsets",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 843,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
... | 1 | /-
EvmAsm.Evm64.SMod.Compose.AbsComponents
Shared signed-absolute-value component abbreviations for SMOD mod-call
handoff proofs.
-/
import EvmAsm.Evm64.SMod.Compose.QuadMemBridges
import EvmAsm.Evm64.SMod.Compose.Words
namespace EvmAsm.Evm64.SMod.Compose
abbrev smodAbsSign (top : Word) : Word :=
top >>> (6... | /-
EvmAsm.Evm64.SMod.Compose.AbsComponents
Shared signed-absolute-value component abbreviations for SMOD mod-call
handoff proofs.
-/
import EvmAsm.Evm64.SMod.Compose.QuadMemBridges
import EvmAsm.Evm64.SMod.Compose.Words
namespace EvmAsm.Evm64.SMod.Compose
abbrev smodAbsSign (top : Word) : Word :=
top >>> (6... | @@ -62,6 +62,17 @@
| 3 => smodAbsSum3 limb0 limb1 limb2 top := by
rfl
+theorem smodAbsDivisorWord_eq_components
+ (limb0 limb1 limb2 top : Word) :
+ smodAbsDivisorWord limb0 limb1 limb2 top =
+ EvmWord.fromLimbs fun i : Fin 4 =>
+ match i with
+ | 0 => smodAbsSum0 limb0 top
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0af56c8ad2df_0 | 1cbec1c6f69bc2f3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseC2V5Mod.lean | PhaseC2V5Mod | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "beq_shift_sub_modCode_noNop_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro a i h\n have hlookup := CodeReq.ofProg_lookup (base + phaseC2Off) (divK_phaseC2 172) 3\n (by decid... | [
{
"name": "divK_phaseC2_code_sub_modCode_noNop_v5",
"text": "/-- Phase-C2 block instructions are subsumed by `modCode_noNop_v5`. -/\nprivate theorem divK_phaseC2_code_sub_modCode_noNop_v5 {base : Word} :\n ∀ a i, (divK_phaseC2_code 172 (base + phaseC2Off)) a = some i →\n (modCode_noNop_v5 base) a = ... | [
{
"name": "beq_shift_sub_modCode_noNop_v5",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 568,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseC2V5Mod
v5 phase-C2 brick (4 steps, phaseC2Off → normBOff, shift ≠ 0 / BEQ-not-taken)
over `modCode_noNop_v5`. Mirror of `divK_phaseC2_ntaken_spec_within_v4_noNop`
(Norm.lean): phase-C2 doesn't touch div128, so its body extends to the v5 code
via the v5 block subsumption ... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseC2V5Mod
v5 phase-C2 brick (4 steps, phaseC2Off → normBOff, shift ≠ 0 / BEQ-not-taken)
over `modCode_noNop_v5`. Mirror of `divK_phaseC2_ntaken_spec_within_v4_noNop`
(Norm.lean): phase-C2 doesn't touch div128, so its body extends to the v5 code
via the v5 block subsumption ... | @@ -15,10 +15,24 @@
open EvmAsm.Rv64
+/-- Phase-C2 block instructions are subsumed by `modCode_noNop_v5`. -/
+private theorem divK_phaseC2_code_sub_modCode_noNop_v5 {base : Word} :
+ ∀ a i, (divK_phaseC2_code 172 (base + phaseC2Off)) a = some i →
+ (modCode_noNop_v5 base) a = some i := by
+ unfold divK_ph... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0af56c8ad2df_1 | c477c28482a7fc12 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseC2V5Mod.lean | PhaseC2V5Mod | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "beq_shift_sub_modCode_noNop_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro a i h\n have hlookup := CodeReq.ofProg_lookup (base + phaseC2Off) (divK_phaseC2 172) 3\n (by decid... | [
{
"name": "divK_phaseC2_code_sub_modCode_noNop_v5",
"text": "/-- Phase-C2 block instructions are subsumed by `modCode_noNop_v5`. -/\nprivate theorem divK_phaseC2_code_sub_modCode_noNop_v5 {base : Word} :\n ∀ a i, (divK_phaseC2_code 172 (base + phaseC2Off)) a = some i →\n (modCode_noNop_v5 base) a = ... | [
{
"name": "divK_phaseC2_body_modCode_noNop_v5_within",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 703,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_onl... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseC2V5Mod
v5 phase-C2 brick (4 steps, phaseC2Off → normBOff, shift ≠ 0 / BEQ-not-taken)
over `modCode_noNop_v5`. Mirror of `divK_phaseC2_ntaken_spec_within_v4_noNop`
(Norm.lean): phase-C2 doesn't touch div128, so its body extends to the v5 code
via the v5 block subsumption ... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseC2V5Mod
v5 phase-C2 brick (4 steps, phaseC2Off → normBOff, shift ≠ 0 / BEQ-not-taken)
over `modCode_noNop_v5`. Mirror of `divK_phaseC2_ntaken_spec_within_v4_noNop`
(Norm.lean): phase-C2 doesn't touch div128, so its body extends to the v5 code
via the v5 block subsumption ... | @@ -15,13 +15,23 @@
open EvmAsm.Rv64
+/-- Phase-C2 block instructions are subsumed by `modCode_noNop_v5`. -/
+private theorem divK_phaseC2_code_sub_modCode_noNop_v5 {base : Word} :
+ ∀ a i, (divK_phaseC2_code 172 (base + phaseC2Off)) a = some i →
+ (modCode_noNop_v5 base) a = some i := by
+ unfold divK_ph... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0af56c8ad2df_2 | 8241b7f5416034b2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseC2V5Mod.lean | PhaseC2V5Mod | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "divK_phaseC2_ntaken_spec_within_v5_noNop_mod",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbody := divK_phaseC2_body_modCode_noNop_v5_within sp shift v2 shiftMem base\n have hbe... | [
{
"name": "divK_phaseC2_body_modCode_noNop_v5_within",
"text": "private theorem divK_phaseC2_body_modCode_noNop_v5_within\n (sp shift v2 shiftMem : Word) (base : Word) :\n cpsTripleWithin 3 (base + phaseC2Off) (base + phaseC2Off + 12) (modCode_noNop_v5 base)\n ((.x12 ↦ᵣ sp) ** (.x6 ↦ᵣ shift) ** (... | [
{
"name": "divK_phaseC2_ntaken_spec_within_v5_noNop_mod",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 29,
"n_chars": 1754,
"n_subproofs": 7,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 3,
"automatio... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseC2V5Mod
v5 phase-C2 brick (4 steps, phaseC2Off → normBOff, shift ≠ 0 / BEQ-not-taken)
over `modCode_noNop_v5`. Mirror of `divK_phaseC2_ntaken_spec_within_v4_noNop`
(Norm.lean): phase-C2 doesn't touch div128, so its body extends to the v5 code
via the v5 block subsumption ... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseC2V5Mod
v5 phase-C2 brick (4 steps, phaseC2Off → normBOff, shift ≠ 0 / BEQ-not-taken)
over `modCode_noNop_v5`. Mirror of `divK_phaseC2_ntaken_spec_within_v4_noNop`
(Norm.lean): phase-C2 doesn't touch div128, so its body extends to the v5 code
via the v5 block subsumption ... | @@ -34,6 +34,16 @@
exact divK_phaseC2_code_sub_modCode_noNop_v5 a i
(CodeReq.singleton_mono hlookup a i h)
+private theorem divK_phaseC2_body_modCode_noNop_v5_within
+ (sp shift v2 shiftMem : Word) (base : Word) :
+ cpsTripleWithin 3 (base + phaseC2Off) (base + phaseC2Off + 12) (modCode_noNop_v5 base)
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0af56c8ad2df_3 | 539b2f5366e2366f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseC2V5Mod.lean | PhaseC2V5Mod | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "divK_phaseC2_ntaken_spec_within_v5_noNop_mod",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbody := divK_phaseC2_body_modCode_noNop_v5_within sp shift v2 shiftMem base\n have hbe... | [
{
"name": "divK_phaseC2_body_modCode_noNop_v5_within",
"text": "private theorem divK_phaseC2_body_modCode_noNop_v5_within\n (sp shift v2 shiftMem : Word) (base : Word) :\n cpsTripleWithin 3 (base + phaseC2Off) (base + phaseC2Off + 12) (modCode_noNop_v5 base)\n ((.x12 ↦ᵣ sp) ** (.x6 ↦ᵣ shift) ** (... | [
{
"name": "divK_phaseC2_taken_spec_within_v5_noNop_mod",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 32,
"n_chars": 1951,
"n_subproofs": 7,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 3,
"automation... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseC2V5Mod
v5 phase-C2 brick (4 steps, phaseC2Off → normBOff, shift ≠ 0 / BEQ-not-taken)
over `modCode_noNop_v5`. Mirror of `divK_phaseC2_ntaken_spec_within_v4_noNop`
(Norm.lean): phase-C2 doesn't touch div128, so its body extends to the v5 code
via the v5 block subsumption ... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseC2V5Mod
v5 phase-C2 brick (4 steps, phaseC2Off → normBOff, shift ≠ 0 / BEQ-not-taken)
over `modCode_noNop_v5`. Mirror of `divK_phaseC2_ntaken_spec_within_v4_noNop`
(Norm.lean): phase-C2 doesn't touch div128, so its body extends to the v5 code
via the v5 block subsumption ... | @@ -34,6 +34,16 @@
exact divK_phaseC2_code_sub_modCode_noNop_v5 a i
(CodeReq.singleton_mono hlookup a i h)
+private theorem divK_phaseC2_body_modCode_noNop_v5_within
+ (sp shift v2 shiftMem : Word) (base : Word) :
+ cpsTripleWithin 3 (base + phaseC2Off) (base + phaseC2Off + 12) (modCode_noNop_v5 base)
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7f8c8a5f3f9c_0 | b61a42d176dcd423 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Sha256ResultBridge.lean | Sha256ResultBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "stackWordFromAcceleratorOutput_hash_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n hashBytesList_length output.hash",
"n_chars": 35,
"n_subproofs": 0,
"n_tactics": 1,
... | [
{
"name": "hashBytesList_length",
"text": "theorem hashBytesList_length (hash : HashBytes) :\n (hashBytesList hash).length = 32 := by\n simp [hashBytesList]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 117,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
... | [
{
"name": "stackWordFromAcceleratorOutput_hash_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 165,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_onl... | 1 | /-
EvmAsm.EL.Sha256ResultBridge
Bridge from the zkVM SHA256 accelerator output to the EVM stack word returned
by the precompile-facing executable spec.
-/
import EvmAsm.EL.KeccakResultBridge
namespace EvmAsm.EL
namespace Sha256ResultBridge
abbrev EvmWord := EvmAsm.Evm64.EvmWord
/-- The SHA256 accelerator re... | /-
EvmAsm.EL.Sha256ResultBridge
Bridge from the zkVM SHA256 accelerator output to the EVM stack word returned
by the precompile-facing executable spec.
-/
import EvmAsm.EL.KeccakResultBridge
namespace EvmAsm.EL
namespace Sha256ResultBridge
abbrev EvmWord := EvmAsm.Evm64.EvmWord
/-- The SHA256 accelerator re... | @@ -35,11 +35,16 @@
def stackWordFromAcceleratorOutput (output : AcceleratorOutput) : EvmWord :=
stackWordFromAcceleratorHash output.hash
+theorem hashBytesList_length (hash : HashBytes) :
+ (hashBytesList hash).length = 32 := by
+ simp [hashBytesList]
+
@[simp] theorem wordFromBigEndianBytes_nil :
word... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_52e85c35a069_0 | 5d6cd348e95f33a6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1NoNop.lean | FullPathN1NoNop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_div_phaseAB_n1_clz_c2_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hABCLZ := evm_div_phaseAB_n1_clz_spec_within_noNop sp base b0 b1 b2 b3\n v5 v6 v7 v10 ... | [
{
"name": "evm_div_phaseAB_n1_clz_spec_within_noNop",
"text": "/-- DIV PhaseAB(n=1) + CLZ over `divCode_noNop`.\n b≠0, b[3]=b[2]=b[1]=0; base → base+212. -/\ntheorem evm_div_phaseAB_n1_clz_spec_within_noNop (sp base : Word)\n (b0 b1 b2 b3 v5 v6 v7 v10 : Word)\n (q0 q1 q2 q3 u5 u6 u7 nMem : Word)\n ... | [
{
"name": "evm_div_phaseAB_n1_clz_c2_spec_within_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 54,
"n_chars": 3432,
"n_subproofs": 5,
"n_tactics": 24,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1NoNop
No-NOP prefix composition for the b[3]=b[2]=b[1]=0 (n=1) DIV path.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
import EvmAsm.Evm64.DivMod.Compose.CLZ
import EvmAsm.Evm64.DivMod.Compose.Norm
import EvmAsm.Evm64.DivMod.Compose.NormA
open EvmAsm.Rv64.Tactics
na... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1NoNop
No-NOP prefix composition for the b[3]=b[2]=b[1]=0 (n=1) DIV path.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
import EvmAsm.Evm64.DivMod.Compose.CLZ
import EvmAsm.Evm64.DivMod.Compose.Norm
import EvmAsm.Evm64.DivMod.Compose.NormA
open EvmAsm.Rv64.Tactics
na... | @@ -15,6 +15,49 @@
open EvmAsm.Rv64
+/-- DIV PhaseAB(n=1) + CLZ over `divCode_noNop`.
+ b≠0, b[3]=b[2]=b[1]=0; base → base+212. -/
+theorem evm_div_phaseAB_n1_clz_spec_within_noNop (sp base : Word)
+ (b0 b1 b2 b3 v5 v6 v7 v10 : Word)
+ (q0 q1 q2 q3 u5 u6 u7 nMem : Word)
+ (hbnz : b0 ||| b1 ||| b2 ||| b... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_52e85c35a069_1 | 467a5d698acfdea7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1NoNop.lean | FullPathN1NoNop | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_div_phaseAB_n1_clz_c2_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hABCLZ := evm_div_phaseAB_n1_clz_spec_within_noNop sp base b0 b1 b2 b3\n v5 v6 v7 v10 ... | [
{
"name": "evm_div_phaseAB_n1_clz_spec_within_noNop",
"text": "/-- DIV PhaseAB(n=1) + CLZ over `divCode_noNop`.\n b≠0, b[3]=b[2]=b[1]=0; base → base+212. -/\ntheorem evm_div_phaseAB_n1_clz_spec_within_noNop (sp base : Word)\n (b0 b1 b2 b3 v5 v6 v7 v10 : Word)\n (q0 q1 q2 q3 u5 u6 u7 nMem : Word)\n ... | [
{
"name": "evm_div_phaseAB_n1_clz_c2_normB_spec_within_noNop",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 41,
"n_chars": 2208,
"n_subproofs": 4,
"n_tactics": 30,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 1,
"auto... | 4 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1NoNop
No-NOP prefix composition for the b[3]=b[2]=b[1]=0 (n=1) DIV path.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
import EvmAsm.Evm64.DivMod.Compose.CLZ
import EvmAsm.Evm64.DivMod.Compose.Norm
import EvmAsm.Evm64.DivMod.Compose.NormA
open EvmAsm.Rv64.Tactics
na... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1NoNop
No-NOP prefix composition for the b[3]=b[2]=b[1]=0 (n=1) DIV path.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
import EvmAsm.Evm64.DivMod.Compose.CLZ
import EvmAsm.Evm64.DivMod.Compose.Norm
import EvmAsm.Evm64.DivMod.Compose.NormA
open EvmAsm.Rv64.Tactics
na... | @@ -15,6 +15,49 @@
open EvmAsm.Rv64
+/-- DIV PhaseAB(n=1) + CLZ over `divCode_noNop`.
+ b≠0, b[3]=b[2]=b[1]=0; base → base+212. -/
+theorem evm_div_phaseAB_n1_clz_spec_within_noNop (sp base : Word)
+ (b0 b1 b2 b3 v5 v6 v7 v10 : Word)
+ (q0 q1 q2 q3 u5 u6 u7 nMem : Word)
+ (hbnz : b0 ||| b1 ||| b2 ||| b... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_52e85c35a069_2 | cce6e85f722e3c86 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1NoNop.lean | FullPathN1NoNop | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_div_phaseAB_n1_clz_c2_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hABCLZ := evm_div_phaseAB_n1_clz_spec_within_noNop sp base b0 b1 b2 b3\n v5 v6 v7 v10 ... | [
{
"name": "evm_div_phaseAB_n1_clz_spec_within_noNop",
"text": "/-- DIV PhaseAB(n=1) + CLZ over `divCode_noNop`.\n b≠0, b[3]=b[2]=b[1]=0; base → base+212. -/\ntheorem evm_div_phaseAB_n1_clz_spec_within_noNop (sp base : Word)\n (b0 b1 b2 b3 v5 v6 v7 v10 : Word)\n (q0 q1 q2 q3 u5 u6 u7 nMem : Word)\n ... | [
{
"name": "evm_div_n1_to_loopSetup_spec_within_noNop",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 94,
"n_chars": 5628,
"n_subproofs": 8,
"n_tactics": 71,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 2,
"n_structural": 1,
"automation_o... | 5 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1NoNop
No-NOP prefix composition for the b[3]=b[2]=b[1]=0 (n=1) DIV path.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
import EvmAsm.Evm64.DivMod.Compose.CLZ
import EvmAsm.Evm64.DivMod.Compose.Norm
import EvmAsm.Evm64.DivMod.Compose.NormA
open EvmAsm.Rv64.Tactics
na... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1NoNop
No-NOP prefix composition for the b[3]=b[2]=b[1]=0 (n=1) DIV path.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
import EvmAsm.Evm64.DivMod.Compose.CLZ
import EvmAsm.Evm64.DivMod.Compose.Norm
import EvmAsm.Evm64.DivMod.Compose.NormA
open EvmAsm.Rv64.Tactics
na... | @@ -15,6 +15,49 @@
open EvmAsm.Rv64
+/-- DIV PhaseAB(n=1) + CLZ over `divCode_noNop`.
+ b≠0, b[3]=b[2]=b[1]=0; base → base+212. -/
+theorem evm_div_phaseAB_n1_clz_spec_within_noNop (sp base : Word)
+ (b0 b1 b2 b3 v5 v6 v7 v10 : Word)
+ (q0 q1 q2 q3 u5 u6 u7 nMem : Word)
+ (hbnz : b0 ||| b1 ||| b2 ||| b... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_52e85c35a069_3 | f964811b3c5556ce | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1NoNop.lean | FullPathN1NoNop | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_div_phaseAB_n1_clz_c2_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hABCLZ := evm_div_phaseAB_n1_clz_spec_within_noNop sp base b0 b1 b2 b3\n v5 v6 v7 v10 ... | [
{
"name": "evm_div_phaseAB_n1_clz_spec_within_noNop",
"text": "/-- DIV PhaseAB(n=1) + CLZ over `divCode_noNop`.\n b≠0, b[3]=b[2]=b[1]=0; base → base+212. -/\ntheorem evm_div_phaseAB_n1_clz_spec_within_noNop (sp base : Word)\n (b0 b1 b2 b3 v5 v6 v7 v10 : Word)\n (q0 q1 q2 q3 u5 u6 u7 nMem : Word)\n ... | [
{
"name": "evm_div_n1_to_loopSetup_spec_within_noNop_exact_x1_frame",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 59,
"n_chars": 3161,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
... | 6 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1NoNop
No-NOP prefix composition for the b[3]=b[2]=b[1]=0 (n=1) DIV path.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
import EvmAsm.Evm64.DivMod.Compose.CLZ
import EvmAsm.Evm64.DivMod.Compose.Norm
import EvmAsm.Evm64.DivMod.Compose.NormA
open EvmAsm.Rv64.Tactics
na... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1NoNop
No-NOP prefix composition for the b[3]=b[2]=b[1]=0 (n=1) DIV path.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
import EvmAsm.Evm64.DivMod.Compose.CLZ
import EvmAsm.Evm64.DivMod.Compose.Norm
import EvmAsm.Evm64.DivMod.Compose.NormA
open EvmAsm.Rv64.Tactics
na... | @@ -15,6 +15,49 @@
open EvmAsm.Rv64
+/-- DIV PhaseAB(n=1) + CLZ over `divCode_noNop`.
+ b≠0, b[3]=b[2]=b[1]=0; base → base+212. -/
+theorem evm_div_phaseAB_n1_clz_spec_within_noNop (sp base : Word)
+ (b0 b1 b2 b3 v5 v6 v7 v10 : Word)
+ (q0 q1 q2 q3 u5 u6 u7 nMem : Word)
+ (hbnz : b0 ||| b1 ||| b2 ||| b... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_576047835ca9_0 | ffc8c7fc7053d24e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2V5NoNopComboMTM.lean | FullPathN2V5NoNopComboMTM | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "divK_loop_n2_max_call_max_from_source_exact_loopIterScratch_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 145,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loopN2MaxCallMaxSourceCondsV5_unfold] at hconds\n simp only [r2... | [
{
"name": "loopN2MaxCallMaxSourceCondsV5_unfold",
"text": "theorem loopN2MaxCallMaxSourceCondsV5_unfold\n (v0 v1 v2 v3 u0 u1 u2 u3 uTop u0Orig1 u0Orig0 : Word) :\n loopN2MaxCallMaxSourceCondsV5\n v0 v1 v2 v3 u0 u1 u2 u3 uTop u0Orig1 u0Orig0 =\n (let r2 := r2MTTN2V5 v0 v1 v2 v3 u0 u1 u2 u3 uTop... | [
{
"name": "divK_loop_n2_max_call_max_from_source_exact_loopIterScratch_v5_noNop",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 165,
"n_chars": 7936,
"n_subproofs": 6,
"n_tactics": 145,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_stru... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V5NoNopComboMTM
Three-iteration max×call×max composition for the n=2 v5/no-NOP source path.
j=2 max, j=1 call, j=0 max. Reuses r2MTTN2V5/r1MTTN2V5 (j=2 max, j=1 call) +
the max×call prefix (#7395). Mirror of FullPathN2V4NoNopMTM.
-/
import EvmAsm.Evm64.DivMod.Compose... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V5NoNopComboMTM
Three-iteration max×call×max composition for the n=2 v5/no-NOP source path.
j=2 max, j=1 call, j=0 max. Reuses r2MTTN2V5/r1MTTN2V5 (j=2 max, j=1 call) +
the max×call prefix (#7395). Mirror of FullPathN2V4NoNopMTM.
-/
import EvmAsm.Evm64.DivMod.Compose... | @@ -80,6 +80,23 @@
isAddbackCarry2NzN2Max v0 v1 v2 v3
u0Orig0 r1.2.1 r1.2.2.1 r1.2.2.2.1 r1.2.2.2.2.1
+theorem loopN2MaxCallMaxSourceCondsV5_unfold
+ (v0 v1 v2 v3 u0 u1 u2 u3 uTop u0Orig1 u0Orig0 : Word) :
+ loopN2MaxCallMaxSourceCondsV5
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop u0Orig1 u0Orig0 =
+ (let r2... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e0200f6867a7_0 | c25ccc56f938af15 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3V4StackPreAnyX9.lean | N3V4StackPreAnyX9 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_mod_n3_preloop_loop_stack_pre_spec_v4_noNop_anyX9",
"depth": 1,
"n_commands": 0,
"n_lines": 41,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hSetup := evm_mod_n3_to_loopSetup_stack_pre_spec_v4_noNop_anyX9\n sp base x9... | [
{
"name": "evm_mod_n3_to_loopSetup_stack_pre_spec_v4_noNop_anyX9",
"text": "/-- Generalization of `evm_mod_n3_to_loopSetup_stack_pre_spec_v4_noNop`\n allowing any initial `x9` value. -/\ntheorem evm_mod_n3_to_loopSetup_stack_pre_spec_v4_noNop_anyX9 (sp base : Word)\n (x9Init : Word)\n (a b : EvmWor... | [
{
"name": "evm_mod_n3_preloop_loop_stack_pre_spec_v4_noNop_anyX9",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 154,
"n_chars": 8405,
"n_subproofs": 3,
"n_tactics": 42,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N3V4StackPreAnyX9
MOD n=3 anyX9 variants: the loop-setup instruction overwrites x9 ← 4-n
before the loop body, so the initial x9 value is irrelevant. This file
contains generalisations of the stack-level n=3 MOD path theorems that
accept an arbitrary initial x9 value in the preco... | /-
EvmAsm.Evm64.DivMod.Spec.N3V4StackPreAnyX9
MOD n=3 anyX9 variants: the loop-setup instruction overwrites x9 ← 4-n
before the loop body, so the initial x9 value is irrelevant. This file
contains generalisations of the stack-level n=3 MOD path theorems that
accept an arbitrary initial x9 value in the preco... | @@ -16,6 +16,67 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
+/-- Generalization of `evm_mod_n3_to_loopSetup_stack_pre_spec_v4_noNop`
+ allowing any initial `x9` value. -/
+theorem evm_mod_n3_to_loopSetup_stack_pre_spec_v4_noNop_anyX9 (sp base : Word)
+ (x9Init : Word)
+ (a b : EvmWord)
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e0200f6867a7_1 | bc3735154b04bdba | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3V4StackPreAnyX9.lean | N3V4StackPreAnyX9 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_mod_n3_preloop_loop_stack_pre_spec_v4_noNop_anyX9",
"depth": 1,
"n_commands": 0,
"n_lines": 41,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hSetup := evm_mod_n3_to_loopSetup_stack_pre_spec_v4_noNop_anyX9\n sp base x9... | [
{
"name": "evm_mod_n3_to_loopSetup_stack_pre_spec_v4_noNop_anyX9",
"text": "/-- Generalization of `evm_mod_n3_to_loopSetup_stack_pre_spec_v4_noNop`\n allowing any initial `x9` value. -/\ntheorem evm_mod_n3_to_loopSetup_stack_pre_spec_v4_noNop_anyX9 (sp base : Word)\n (x9Init : Word)\n (a b : EvmWor... | [
{
"name": "evm_mod_n3_stack_pre_to_unified_post_v4_noNop_anyX9",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 131,
"n_chars": 6903,
"n_subproofs": 4,
"n_tactics": 39,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 8,
"a... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.N3V4StackPreAnyX9
MOD n=3 anyX9 variants: the loop-setup instruction overwrites x9 ← 4-n
before the loop body, so the initial x9 value is irrelevant. This file
contains generalisations of the stack-level n=3 MOD path theorems that
accept an arbitrary initial x9 value in the preco... | /-
EvmAsm.Evm64.DivMod.Spec.N3V4StackPreAnyX9
MOD n=3 anyX9 variants: the loop-setup instruction overwrites x9 ← 4-n
before the loop body, so the initial x9 value is irrelevant. This file
contains generalisations of the stack-level n=3 MOD path theorems that
accept an arbitrary initial x9 value in the preco... | @@ -16,6 +16,67 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
+/-- Generalization of `evm_mod_n3_to_loopSetup_stack_pre_spec_v4_noNop`
+ allowing any initial `x9` value. -/
+theorem evm_mod_n3_to_loopSetup_stack_pre_spec_v4_noNop_anyX9 (sp base : Word)
+ (x9Init : Word)
+ (a b : EvmWord)
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5621a75c9686_0 | 35ae39c69096a114 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase2LongLoopEight.lean | Phase2LongLoopEight | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "rlp_phase2_long_loop_eight_byte_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 60,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [rlp_phase2_long_loop_eight_byte_post_unfold]\n have body := rlp_phase2_long_loop_b... | [
{
"name": "rlp_phase2_long_loop_eight_byte_post_unfold",
"text": "theorem rlp_phase2_long_loop_eight_byte_post_unfold\n (len ptr byte1 byte2 byte3 byte4 byte5 byte6 byte7 byte8\n wordVal dwordAddr : Word) :\n rlp_phase2_long_loop_eight_byte_post len ptr byte1 byte2 byte3 byte4\n byte5 byte6... | [
{
"name": "rlp_phase2_long_loop_eight_byte_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 99,
"n_chars": 5326,
"n_subproofs": 13,
"n_tactics": 71,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 27,
"n_structural": 13,
"automat... | 1 | /-
EvmAsm.Rv64.RLP.Phase2LongLoopEight
EL.3 Phase 2 (long form) — eight-iteration closure of the loop body.
Specializes `rlp_phase2_long_loop_body_spec` at `x14 = 8`, composed
with `rlp_phase2_long_loop_seven_byte_spec` for the remaining seven
iterations.
Corresponds to RLP prefixes `0xBF` and `0xFF` (`l... | /-
EvmAsm.Rv64.RLP.Phase2LongLoopEight
EL.3 Phase 2 (long form) — eight-iteration closure of the loop body.
Specializes `rlp_phase2_long_loop_body_spec` at `x14 = 8`, composed
with `rlp_phase2_long_loop_seven_byte_spec` for the remaining seven
iterations.
Corresponds to RLP prefixes `0xBF` and `0xFF` (`l... | @@ -41,6 +41,20 @@
(.x12 ↦ᵣ byte8) ** (.x0 ↦ᵣ (0 : Word)) **
(dwordAddr ↦ₘ wordVal)
+theorem rlp_phase2_long_loop_eight_byte_post_unfold
+ (len ptr byte1 byte2 byte3 byte4 byte5 byte6 byte7 byte8
+ wordVal dwordAddr : Word) :
+ rlp_phase2_long_loop_eight_byte_post len ptr byte1 byte2 byte3 byte4
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5621a75c9686_1 | 5a84d951b55a714a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase2LongLoopEight.lean | Phase2LongLoopEight | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "rlp_phase2_long_loop_eight_byte_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 60,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [rlp_phase2_long_loop_eight_byte_post_unfold]\n have body := rlp_phase2_long_loop_b... | [
{
"name": "rlp_phase2_long_loop_eight_byte_post_unfold",
"text": "theorem rlp_phase2_long_loop_eight_byte_post_unfold\n (len ptr byte1 byte2 byte3 byte4 byte5 byte6 byte7 byte8\n wordVal dwordAddr : Word) :\n rlp_phase2_long_loop_eight_byte_post len ptr byte1 byte2 byte3 byte4\n byte5 byte6... | [
{
"name": "rlp_phase2_long_loop_eight_byte_spec_within_bundled",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 35,
"n_chars": 1927,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"aut... | 2 | /-
EvmAsm.Rv64.RLP.Phase2LongLoopEight
EL.3 Phase 2 (long form) — eight-iteration closure of the loop body.
Specializes `rlp_phase2_long_loop_body_spec` at `x14 = 8`, composed
with `rlp_phase2_long_loop_seven_byte_spec` for the remaining seven
iterations.
Corresponds to RLP prefixes `0xBF` and `0xFF` (`l... | /-
EvmAsm.Rv64.RLP.Phase2LongLoopEight
EL.3 Phase 2 (long form) — eight-iteration closure of the loop body.
Specializes `rlp_phase2_long_loop_body_spec` at `x14 = 8`, composed
with `rlp_phase2_long_loop_seven_byte_spec` for the remaining seven
iterations.
Corresponds to RLP prefixes `0xBF` and `0xFF` (`l... | @@ -41,6 +41,20 @@
(.x12 ↦ᵣ byte8) ** (.x0 ↦ᵣ (0 : Word)) **
(dwordAddr ↦ₘ wordVal)
+theorem rlp_phase2_long_loop_eight_byte_post_unfold
+ (len ptr byte1 byte2 byte3 byte4 byte5 byte6 byte7 byte8
+ wordVal dwordAddr : Word) :
+ rlp_phase2_long_loop_eight_byte_post len ptr byte1 byte2 byte3 byte4
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_629644b73a74_0 | 77883baf46a8fa85 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/CopySpec.lean | CopySpec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_calldatacopy_preamble_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 47,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hLoadDest := ld_spec_gen_within destReg .x12 sp destOld destOffset\n (0 : BitVec 12) base hd... | [
{
"name": "signExtend12_callDataLenOff",
"text": "theorem signExtend12_callDataLenOff :\n signExtend12 (BitVec.ofNat 12 callDataLenOff) =\n BitVec.ofNat 64 callDataLenOff := by\n rw [signExtend12_ofNat_small (by decide)]\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 178,
"n_subproofs"... | [
{
"name": "evm_calldatacopy_preamble_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 79,
"n_chars": 4544,
"n_subproofs": 9,
"n_tactics": 47,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 25,
"n_structural": 0,
"automation_only... | 2 | /-
EvmAsm.Evm64.Calldata.CopySpec
Partial stack-level specification for the EVM `CALLDATACOPY` opcode
(GH #104, bead `evm-asm-54bh8`).
This slice proves the straight-line executable preamble of
`evm_calldatacopy`: it pops the three stack arguments, exposes
`env.callDataPtr` / `env.callDataLen`, and initia... | /-
EvmAsm.Evm64.Calldata.CopySpec
Partial stack-level specification for the EVM `CALLDATACOPY` opcode
(GH #104, bead `evm-asm-54bh8`).
This slice proves the straight-line executable preamble of
`evm_calldatacopy`: it pops the three stack arguments, exposes
`env.callDataPtr` / `env.callDataLen`, and initia... | @@ -58,6 +58,11 @@
BitVec.ofNat 64 callDataPtrOff := by
rw [signExtend12_ofNat_small (by decide)]
+theorem signExtend12_callDataLenOff :
+ signExtend12 (BitVec.ofNat 12 callDataLenOff) =
+ BitVec.ofNat 64 callDataLenOff := by
+ rw [signExtend12_ofNat_small (by decide)]
+
/-- Raw preamble spec: loa... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_629644b73a74_1 | fdf5518964ecbcaa | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/CopySpec.lean | CopySpec | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_calldatacopy_preamble_stack_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 37,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro code\n let frame : Assertion :=\n ((sp + 8) ↦ₘ destOffset.getLimbN 1) **\n ((sp +... | [
{
"name": "evm_calldatacopy_preamble_spec_within",
"text": "/-- Raw preamble spec: load the low limbs of the three stack arguments,\n pop three EVM words, load calldata base/length from the env block,\n then initialize absolute destination/source pointers and calldata end. -/\ntheorem evm_calldatacopy... | [
{
"name": "evm_calldatacopy_preamble_stack_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 70,
"n_chars": 3200,
"n_subproofs": 3,
"n_tactics": 37,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 3,
"automation... | 3 | /-
EvmAsm.Evm64.Calldata.CopySpec
Partial stack-level specification for the EVM `CALLDATACOPY` opcode
(GH #104, bead `evm-asm-54bh8`).
This slice proves the straight-line executable preamble of
`evm_calldatacopy`: it pops the three stack arguments, exposes
`env.callDataPtr` / `env.callDataLen`, and initia... | /-
EvmAsm.Evm64.Calldata.CopySpec
Partial stack-level specification for the EVM `CALLDATACOPY` opcode
(GH #104, bead `evm-asm-54bh8`).
This slice proves the straight-line executable preamble of
`evm_calldatacopy`: it pops the three stack arguments, exposes
`env.callDataPtr` / `env.callDataLen`, and initia... | @@ -63,6 +63,84 @@
BitVec.ofNat 64 callDataLenOff := by
rw [signExtend12_ofNat_small (by decide)]
+/-- Raw preamble spec: load the low limbs of the three stack arguments,
+ pop three EVM words, load calldata base/length from the env block,
+ then initialize absolute destination/source pointers and cal... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_629644b73a74_2 | 8ce5024a63080ecc | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/CopySpec.lean | CopySpec | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_calldatacopy_preamble_code_sub_full",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact CodeReq.ofProg_mono_sub base base\n (evm_calldatacopy envBaseReg memBaseReg destReg srcRe... | [
{
"name": "evm_calldatacopy_preamble_length",
"text": "/-- The CALLDATACOPY preamble is exactly the first nine instructions. -/\ntheorem evm_calldatacopy_preamble_length\n (envBaseReg memBaseReg destReg srcReg cntReg cdpReg endReg : Reg) :\n (evm_calldatacopy_preamble envBaseReg memBaseReg destReg src... | [
{
"name": "evm_calldatacopy_preamble_code_sub_full",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 33,
"n_chars": 1082,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 1,
"automation_onl... | 1 | /-
EvmAsm.Evm64.Calldata.CopySpec
Partial stack-level specification for the EVM `CALLDATACOPY` opcode
(GH #104, bead `evm-asm-54bh8`).
This slice proves the straight-line executable preamble of
`evm_calldatacopy`: it pops the three stack arguments, exposes
`env.callDataPtr` / `env.callDataLen`, and initia... | /-
EvmAsm.Evm64.Calldata.CopySpec
Partial stack-level specification for the EVM `CALLDATACOPY` opcode
(GH #104, bead `evm-asm-54bh8`).
This slice proves the straight-line executable preamble of
`evm_calldatacopy`: it pops the three stack arguments, exposes
`env.callDataPtr` / `env.callDataLen`, and initia... | @@ -53,6 +53,14 @@
(evm_calldatacopy_preamble envBaseReg memBaseReg destReg srcReg
cntReg cdpReg endReg)
+/-- The CALLDATACOPY preamble is exactly the first nine instructions. -/
+theorem evm_calldatacopy_preamble_length
+ (envBaseReg memBaseReg destReg srcReg cntReg cdpReg endReg : Reg) :
+ (evm_ca... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_629644b73a74_3 | 8f1ceeb8e0028a1a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/CopySpec.lean | CopySpec | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_calldatacopy_full_code_preamble_stack_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro code\n exact cpsTripleWithin_extend_code\n (h := evm_calldatacopy_preamble... | [
{
"name": "evm_calldatacopy_preamble_stack_spec_within",
"text": "/-- Stack-form lift of the CALLDATACOPY preamble. The postcondition exposes\n the low-limb stack arguments, the absolute destination/source registers\n used by the byte loop, and keeps the consumed stack words owned below the\n advan... | [
{
"name": "evm_calldatacopy_full_code_preamble_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 43,
"n_chars": 2108,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"... | 6 | /-
EvmAsm.Evm64.Calldata.CopySpec
Partial stack-level specification for the EVM `CALLDATACOPY` opcode
(GH #104, bead `evm-asm-54bh8`).
This slice proves the straight-line executable preamble of
`evm_calldatacopy`: it pops the three stack arguments, exposes
`env.callDataPtr` / `env.callDataLen`, and initia... | /-
EvmAsm.Evm64.Calldata.CopySpec
Partial stack-level specification for the EVM `CALLDATACOPY` opcode
(GH #104, bead `evm-asm-54bh8`).
This slice proves the straight-line executable preamble of
`evm_calldatacopy`: it pops the three stack arguments, exposes
`env.callDataPtr` / `env.callDataLen`, and initia... | @@ -149,6 +149,75 @@
rw [show (base + 28 : Word) + 4 = base + 32 by bv_addr]
runBlock hLoadDest hLoadSrc hLoadCnt hPop hLoadPtr hLoadLen hAddEnd hAddDest hAddSrc
+/-- Stack-form lift of the CALLDATACOPY preamble. The postcondition exposes
+ the low-limb stack arguments, the absolute destination/source regist... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_35af28632b69_0 | 7a1b261c763c8e5e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V5CallableExactShift0.lean | FullPathN1V5CallableExactShift0 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "loopN1UnifiedPostV5NoX1_shift0_to_epiloguePre",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [fullDivN1FrameShift0V5NoX1_unfold]\n delta loopN1UnifiedPostV5NoX1 loopN1Iter210PostV5N... | [
{
"name": "iterN1Call_v5_unfoldU4",
"text": "private theorem iterN1Call_v5_unfoldU4 (v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :\n iterN1Call_v5 v0 v1 v2 v3 u0 u1 u2 u3 uTop\n = iterWithDoubleAddback (div128Quot_v5 u1 u0 v0) v0 v1 v2 v3 u0 u1 u2 u3 uTop := by\n unfold iterN1Call_v5; rfl\n\n",
"fan_in"... | [
{
"name": "loopN1UnifiedPostV5NoX1_shift0_to_epiloguePre",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 45,
"n_chars": 2686,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 5,
"n_structural": 0,
"automati... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5CallableExactShift0
The n=1 v5 x1-preserving (callable exact-frame) full path, **shift=0 arm**,
over `divCode_noNop_v5`: shift=0 preloop + x1-preserving shift=0 loop
(LoopIterN1/NoX1ChainShift0V5) + shift=0 DIV epilogue, landing
`divStackDispatchPostCallableExactFra... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5CallableExactShift0
The n=1 v5 x1-preserving (callable exact-frame) full path, **shift=0 arm**,
over `divCode_noNop_v5`: shift=0 preloop + x1-preserving shift=0 loop
(LoopIterN1/NoX1ChainShift0V5) + shift=0 DIV epilogue, landing
`divStackDispatchPostCallableExactFra... | @@ -69,6 +69,11 @@
attribute [local irreducible] EvmWord.val256 div128Quot_v5 iterWithDoubleAddback mulsubN4 clzResult
+private theorem iterN1Call_v5_unfoldU4 (v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :
+ iterN1Call_v5 v0 v1 v2 v3 u0 u1 u2 u3 uTop
+ = iterWithDoubleAddback (div128Quot_v5 u1 u0 v0) v0 v1 v2 v3 u0... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_35af28632b69_1 | aa47352c5632c71d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V5CallableExactShift0.lean | FullPathN1V5CallableExactShift0 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "evm_div_n1_full_shift0_spec_v5_noNop_preserving_x1",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hA := evm_div_n1_to_denorm_shift0_spec_v5_noNop_preserving_x1 sp base\n a0 a1 a... | [
{
"name": "loopN1UnifiedPostV5NoX1_shift0_to_epiloguePre",
"text": "/-- x1-free twin of `loopN1UnifiedPostV5_shift0_to_epiloguePre`: the x1-free\n shift=0 loop result at `denormOff` reduces to the shift=0 DIV-epilogue\n precondition plus the x1-free loop-state frame, the concrete return\n address r... | [
{
"name": "evm_div_n1_full_shift0_spec_v5_noNop_preserving_x1",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 87,
"n_chars": 4994,
"n_subproofs": 5,
"n_tactics": 34,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"aut... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5CallableExactShift0
The n=1 v5 x1-preserving (callable exact-frame) full path, **shift=0 arm**,
over `divCode_noNop_v5`: shift=0 preloop + x1-preserving shift=0 loop
(LoopIterN1/NoX1ChainShift0V5) + shift=0 DIV epilogue, landing
`divStackDispatchPostCallableExactFra... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5CallableExactShift0
The n=1 v5 x1-preserving (callable exact-frame) full path, **shift=0 arm**,
over `divCode_noNop_v5`: shift=0 preloop + x1-preserving shift=0 loop
(LoopIterN1/NoX1ChainShift0V5) + shift=0 DIV epilogue, landing
`divStackDispatchPostCallableExactFra... | @@ -74,6 +74,50 @@
= iterWithDoubleAddback (div128Quot_v5 u1 u0 v0) v0 v1 v2 v3 u0 u1 u2 u3 uTop := by
unfold iterN1Call_v5; rfl
+/-- x1-free twin of `loopN1UnifiedPostV5_shift0_to_epiloguePre`: the x1-free
+ shift=0 loop result at `denormOff` reduces to the shift=0 DIV-epilogue
+ precondition plus 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_0f8d72736fe5_0 | 9d8ad6811e302fb0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/SchemaListEncodeLong.lean | SchemaListEncodeLong | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "schemaConcat_of_encode_list_long",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← List.drop_drop, hbs, encode_list_schemaItems_long specs hlen, List.append_assoc,\n show 1 + (Na... | [
{
"name": "encode_list_schemaItems_long",
"text": "/-- **Long-list encoding of a field schema.** When the payload exceeds 55 bytes, the RLP\n encoding of the field items is the `0xF7 + lenOfLen` header, the big-endian length bytes,\n then `schemaEncBytes`. -/\ntheorem encode_list_schemaItems_long (spe... | [
{
"name": "schemaConcat_of_encode_list_long",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 966,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false... | 1 | /-
EvmAsm.Rv64.RLP.SchemaListEncodeLong
EL.3 / Phase 5 — long-list counterpart of `SchemaListEncode`. Real STF records (transactions,
block headers) exceed 55 bytes, so their RLP encoding is a LONG list: a `0xF7 + lenOfLen`
prefix, then `lenOfLen` big-endian length bytes, then the payload. This shows the paylo... | /-
EvmAsm.Rv64.RLP.SchemaListEncodeLong
EL.3 / Phase 5 — long-list counterpart of `SchemaListEncode`. Real STF records (transactions,
block headers) exceed 55 bytes, so their RLP encoding is a LONG list: a `0xF7 + lenOfLen`
prefix, then `lenOfLen` big-endian length bytes, then the payload. This shows the paylo... | @@ -15,6 +15,17 @@
open EvmAsm.EL.RLP
+/-- **Long-list encoding of a field schema.** When the payload exceeds 55 bytes, the RLP
+ encoding of the field items is the `0xF7 + lenOfLen` header, the big-endian length bytes,
+ then `schemaEncBytes`. -/
+theorem encode_list_schemaItems_long (specs : List FieldSpec... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_29ee8d57f086_0 | 711c45d092e0bb05 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/RLP.lean | RLP | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "rlpNestedListDecodeVector_passed",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n checkVector?_some_passed runDecodeFully\n \"rlp-nested-list-decode\"\n { bytes := [(0xc3 : Byte), 0x01,... | [
{
"name": "runDecodeFully_nestedList",
"text": "theorem runDecodeFully_nestedList :\n runDecodeFully { bytes := [(0xc3 : Byte), 0x01, 0x02, 0x03] } =\n some (.list [.bytes [0x01], .bytes [0x02], .bytes [0x03]]) := rfl\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 177,
"n_subproofs": 0,... | [
{
"name": "rlpNestedListDecodeVector_passed",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 325,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,... | 1 | /-
EvmAsm.EL.Conformance.RLP
Compact Lean-side conformance vectors for the executable RLP decoder
(GH #125 / GH #120).
-/
import EvmAsm.EL.Conformance
import EvmAsm.EL.RLP.Decode
namespace EvmAsm.EL
namespace Conformance
namespace RLP
abbrev Byte := EvmAsm.EL.RLP.Byte
abbrev RLPItem := EvmAsm.EL.RLP.RLPItem
... | /-
EvmAsm.EL.Conformance.RLP
Compact Lean-side conformance vectors for the executable RLP decoder
(GH #125 / GH #120).
-/
import EvmAsm.EL.Conformance
import EvmAsm.EL.RLP.Decode
namespace EvmAsm.EL
namespace Conformance
namespace RLP
abbrev Byte := EvmAsm.EL.RLP.Byte
abbrev RLPItem := EvmAsm.EL.RLP.RLPItem
... | @@ -54,8 +54,17 @@
input := { bytes := (0xb8 : Byte) :: 0x38 :: List.replicate 56 (0x7f : Byte) }
expected := .value (.bytes (List.replicate 56 (0x7f : Byte))) }
+theorem runDecodeFully_nestedList :
+ runDecodeFully { bytes := [(0xc3 : Byte), 0x01, 0x02, 0x03] } =
+ some (.list [.bytes [0x01], .byte... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_29ee8d57f086_1 | d84b2d45ff4e6857 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/RLP.lean | RLP | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "rlpNoncanonicalSingletonVector_errored",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n checkVector?_none_error runDecodeFully\n \"rlp-noncanonical-singleton\"\n \"noncanonical-singleto... | [
{
"name": "runDecodeFully_reject_noncanonical_singleton",
"text": "theorem runDecodeFully_reject_noncanonical_singleton :\n runDecodeFully { bytes := [(0x81 : Byte), 0x01] } = none := rfl\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 124,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomati... | [
{
"name": "rlpNoncanonicalSingletonVector_errored",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 378,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only":... | 1 | /-
EvmAsm.EL.Conformance.RLP
Compact Lean-side conformance vectors for the executable RLP decoder
(GH #125 / GH #120).
-/
import EvmAsm.EL.Conformance
import EvmAsm.EL.RLP.Decode
namespace EvmAsm.EL
namespace Conformance
namespace RLP
abbrev Byte := EvmAsm.EL.RLP.Byte
abbrev RLPItem := EvmAsm.EL.RLP.RLPItem
... | /-
EvmAsm.EL.Conformance.RLP
Compact Lean-side conformance vectors for the executable RLP decoder
(GH #125 / GH #120).
-/
import EvmAsm.EL.Conformance
import EvmAsm.EL.RLP.Decode
namespace EvmAsm.EL
namespace Conformance
namespace RLP
abbrev Byte := EvmAsm.EL.RLP.Byte
abbrev RLPItem := EvmAsm.EL.RLP.RLPItem
... | @@ -54,9 +54,17 @@
input := { bytes := (0xb8 : Byte) :: 0x38 :: List.replicate 56 (0x7f : Byte) }
expected := .value (.bytes (List.replicate 56 (0x7f : Byte))) }
+theorem runDecodeFully_reject_noncanonical_singleton :
+ runDecodeFully { bytes := [(0x81 : Byte), 0x01] } = none := rfl
+
theorem rlpNoncano... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_29ee8d57f086_2 | 47d0a520ecc34e36 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/RLP.lean | RLP | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "rlpEmptyListDecodeVector_passed",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n checkVector?_some_passed runDecodeFully\n \"rlp-empty-list-decode\"\n { bytes := [(0xc0 : Byte)] }\n ... | [
{
"name": "runDecodeFully_emptyList",
"text": "theorem runDecodeFully_emptyList :\n runDecodeFully { bytes := [(0xc0 : Byte)] } = some (.list []) := rfl\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 109,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"... | [
{
"name": "rlpEmptyListDecodeVector_passed",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 260,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.EL.Conformance.RLP
Compact Lean-side conformance vectors for the executable RLP decoder
(GH #125 / GH #120).
-/
import EvmAsm.EL.Conformance
import EvmAsm.EL.RLP.Decode
namespace EvmAsm.EL
namespace Conformance
namespace RLP
abbrev Byte := EvmAsm.EL.RLP.Byte
abbrev RLPItem := EvmAsm.EL.RLP.RLPItem
... | /-
EvmAsm.EL.Conformance.RLP
Compact Lean-side conformance vectors for the executable RLP decoder
(GH #125 / GH #120).
-/
import EvmAsm.EL.Conformance
import EvmAsm.EL.RLP.Decode
namespace EvmAsm.EL
namespace Conformance
namespace RLP
abbrev Byte := EvmAsm.EL.RLP.Byte
abbrev RLPItem := EvmAsm.EL.RLP.RLPItem
... | @@ -54,8 +54,16 @@
input := { bytes := (0xb8 : Byte) :: 0x38 :: List.replicate 56 (0x7f : Byte) }
expected := .value (.bytes (List.replicate 56 (0x7f : Byte))) }
+theorem runDecodeFully_emptyList :
+ runDecodeFully { bytes := [(0xc0 : Byte)] } = some (.list []) := rfl
+
theorem rlpEmptyListDecodeVector_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_29ee8d57f086_3 | 55bbd625658c3bb6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/RLP.lean | RLP | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "rlpLongBytesDecodeVector_passed",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n checkVector?_some_passed runDecodeFully\n \"rlp-long-bytes-decode\"\n { bytes := (0xb8 : Byte) :: 0x38 :... | [
{
"name": "runDecodeFully_longBytes",
"text": "theorem runDecodeFully_longBytes :\n runDecodeFully\n { bytes := (0xb8 : Byte) :: 0x38 :: List.replicate 56 (0x7f : Byte) } =\n some (.bytes (List.replicate 56 (0x7f : Byte))) := by\n rfl\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 199... | [
{
"name": "rlpLongBytesDecodeVector_passed",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 333,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.EL.Conformance.RLP
Compact Lean-side conformance vectors for the executable RLP decoder
(GH #125 / GH #120).
-/
import EvmAsm.EL.Conformance
import EvmAsm.EL.RLP.Decode
namespace EvmAsm.EL
namespace Conformance
namespace RLP
abbrev Byte := EvmAsm.EL.RLP.Byte
abbrev RLPItem := EvmAsm.EL.RLP.RLPItem
... | /-
EvmAsm.EL.Conformance.RLP
Compact Lean-side conformance vectors for the executable RLP decoder
(GH #125 / GH #120).
-/
import EvmAsm.EL.Conformance
import EvmAsm.EL.RLP.Decode
namespace EvmAsm.EL
namespace Conformance
namespace RLP
abbrev Byte := EvmAsm.EL.RLP.Byte
abbrev RLPItem := EvmAsm.EL.RLP.RLPItem
... | @@ -54,8 +54,19 @@
input := { bytes := (0xb8 : Byte) :: 0x38 :: List.replicate 56 (0x7f : Byte) }
expected := .value (.bytes (List.replicate 56 (0x7f : Byte))) }
+theorem runDecodeFully_longBytes :
+ runDecodeFully
+ { bytes := (0xb8 : Byte) :: 0x38 :: List.replicate 56 (0x7f : Byte) } =
+ some... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_29ee8d57f086_4 | ac5cbff2e4621359 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/RLP.lean | RLP | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "rlpNoncanonicalSingletonVector_errored",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n checkVector?_none_error runDecodeFully\n \"rlp-noncanonical-singleton\"\n \"noncanonical-singleto... | [
{
"name": "runDecodeFully_reject_noncanonical_singleton",
"text": "theorem runDecodeFully_reject_noncanonical_singleton :\n runDecodeFully { bytes := [(0x81 : Byte), 0x01] } = none := rfl\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 124,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomati... | [
{
"name": "rlpConformanceVectors_passed",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 8,
"n_lines": 12,
"n_chars": 380,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 8 | /-
EvmAsm.EL.Conformance.RLP
Compact Lean-side conformance vectors for the executable RLP decoder
(GH #125 / GH #120).
-/
import EvmAsm.EL.Conformance
import EvmAsm.EL.RLP.Decode
namespace EvmAsm.EL
namespace Conformance
namespace RLP
abbrev Byte := EvmAsm.EL.RLP.Byte
abbrev RLPItem := EvmAsm.EL.RLP.RLPItem
... | /-
EvmAsm.EL.Conformance.RLP
Compact Lean-side conformance vectors for the executable RLP decoder
(GH #125 / GH #120).
-/
import EvmAsm.EL.Conformance
import EvmAsm.EL.RLP.Decode
namespace EvmAsm.EL
namespace Conformance
namespace RLP
abbrev Byte := EvmAsm.EL.RLP.Byte
abbrev RLPItem := EvmAsm.EL.RLP.RLPItem
... | @@ -58,6 +58,9 @@
runDecodeFully { bytes := [(0xc3 : Byte), 0x01, 0x02, 0x03] } =
some (.list [.bytes [0x01], .bytes [0x02], .bytes [0x03]]) := rfl
+theorem runDecodeFully_reject_noncanonical_singleton :
+ runDecodeFully { bytes := [(0x81 : Byte), 0x01] } = none := rfl
+
theorem runDecodeFully_emptyLi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_69d9600d67ab_0 | dc17ca4ebde49c6e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase2LongLoopRegion.lean | Phase2LongLoopRegion | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "rlpLoopAccRegion_toNat",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing len off with\n | zero =>\n simp only [rlpLoopAccRegion, rlpRegionByteList, Nat.fromByt... | [
{
"name": "rlpRegionByteList_length",
"text": "theorem rlpRegionByteList_length (bs : List Byte) (off n : Nat) :\n (rlpRegionByteList bs off n).length = n := by\n induction n generalizing off with\n | zero => rfl\n | succ k ih => simp [rlpRegionByteList, ih]\n\n",
"fan_in": 1,
"n_lines": 7,
... | [
{
"name": "rlpLoopAccRegion_toNat",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 39,
"n_chars": 2005,
"n_subproofs": 3,
"n_tactics": 33,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 6,
"n_structural": 4,
"automation_only": false,
"m... | 1 | /-
EvmAsm.Rv64.RLP.Phase2LongLoopRegion
EL.3 Phase 2 (long form) — the big-endian length-read loop over a multi-dword
`bytesRegion`, the region-based analog of the single-dword stack in
`Phase2LongIter` / `Phase2LongLoopBody` / `Phase2LongLoopGeneral`.
The body program is unchanged (`rlp_phase2_long_iter_pr... | /-
EvmAsm.Rv64.RLP.Phase2LongLoopRegion
EL.3 Phase 2 (long form) — the big-endian length-read loop over a multi-dword
`bytesRegion`, the region-based analog of the single-dword stack in
`Phase2LongIter` / `Phase2LongLoopBody` / `Phase2LongLoopGeneral`.
The body program is unchanged (`rlp_phase2_long_iter_pr... | @@ -51,6 +51,12 @@
| _, 0 => []
| off, (k + 1) => (bs.getD off 0) :: rlpRegionByteList bs (off + 1) k
+theorem rlpRegionByteList_length (bs : List Byte) (off n : Nat) :
+ (rlpRegionByteList bs off n).length = n := by
+ induction n generalizing off with
+ | zero => rfl
+ | succ k ih => simp [rlpReg... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_69d9600d67ab_1 | 80ab84e11df77b0c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase2LongLoopRegion.lean | Phase2LongLoopRegion | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "rlpLoopAccRegion_zero_eq_fromBytesBE",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [rlpLoopAccRegion_toNat, BitVec.toNat_ofNat,\n show ((0 : Word).t... | [
{
"name": "rlpRegionByteList_eq_slice",
"text": "/-- In range, the read byte list is the corresponding slice of `bs`. -/\ntheorem rlpRegionByteList_eq_slice (bs : List Byte) (off n : Nat)\n (h : off + n ≤ bs.length) :\n rlpRegionByteList bs off n = (bs.drop off).take n := by\n induction n generalizin... | [
{
"name": "rlpLoopAccRegion_zero_eq_fromBytesBE",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 16,
"n_chars": 793,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": f... | 3 | /-
EvmAsm.Rv64.RLP.Phase2LongLoopRegion
EL.3 Phase 2 (long form) — the big-endian length-read loop over a multi-dword
`bytesRegion`, the region-based analog of the single-dword stack in
`Phase2LongIter` / `Phase2LongLoopBody` / `Phase2LongLoopGeneral`.
The body program is unchanged (`rlp_phase2_long_iter_pr... | /-
EvmAsm.Rv64.RLP.Phase2LongLoopRegion
EL.3 Phase 2 (long form) — the big-endian length-read loop over a multi-dword
`bytesRegion`, the region-based analog of the single-dword stack in
`Phase2LongIter` / `Phase2LongLoopBody` / `Phase2LongLoopGeneral`.
The body program is unchanged (`rlp_phase2_long_iter_pr... | @@ -57,6 +57,19 @@
| zero => rfl
| succ k ih => simp [rlpRegionByteList, ih]
+/-- In range, the read byte list is the corresponding slice of `bs`. -/
+theorem rlpRegionByteList_eq_slice (bs : List Byte) (off n : Nat)
+ (h : off + n ≤ bs.length) :
+ rlpRegionByteList bs off n = (bs.drop off).take n := by
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_69d9600d67ab_2 | aa76700fb4e9402f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase2LongLoopRegion.lean | Phase2LongLoopRegion | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 3 | [
{
"theorem_name": "rlp_phase2_long_region_body_post_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hp hpost\n simp only [rlp_phase2_long_region_body_post_unfold] at hpost\n open EvmAsm.Rv64.Ta... | [
{
"name": "rlp_phase2_long_region_body_post_unfold",
"text": "theorem rlp_phase2_long_region_body_post_unfold\n (bs : List Byte) (regionBase len : Word) (off : Nat) (cnt : Word) (P : Prop) :\n rlp_phase2_long_region_body_post bs regionBase len off cnt P =\n ((.x11 ↦ᵣ ((len <<< 8) + (bs.getD off 0).... | [
{
"name": "rlp_phase2_long_region_body_post_pure",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 363,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": f... | 1 | /-
EvmAsm.Rv64.RLP.Phase2LongLoopRegion
EL.3 Phase 2 (long form) — the big-endian length-read loop over a multi-dword
`bytesRegion`, the region-based analog of the single-dword stack in
`Phase2LongIter` / `Phase2LongLoopBody` / `Phase2LongLoopGeneral`.
The body program is unchanged (`rlp_phase2_long_iter_pr... | /-
EvmAsm.Rv64.RLP.Phase2LongLoopRegion
EL.3 Phase 2 (long form) — the big-endian length-read loop over a multi-dword
`bytesRegion`, the region-based analog of the single-dword stack in
`Phase2LongIter` / `Phase2LongLoopBody` / `Phase2LongLoopGeneral`.
The body program is unchanged (`rlp_phase2_long_iter_pr... | @@ -61,9 +61,23 @@
(.x12 ↦ᵣ (bs.getD off 0).zeroExtend 64) ** (.x0 ↦ᵣ (0 : Word)) **
bytesRegion regionBase bs ** ⌜P⌝
+theorem rlp_phase2_long_region_body_post_unfold
+ (bs : List Byte) (regionBase len : Word) (off : Nat) (cnt : Word) (P : Prop) :
+ rlp_phase2_long_region_body_post bs regionBase len o... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_69d9600d67ab_3 | ef585eebc84312eb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase2LongLoopRegion.lean | Phase2LongLoopRegion | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 3 | [
{
"theorem_name": "rlp_phase2_long_region_body_post_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hp hpost\n simp only [rlp_phase2_long_region_body_post_unfold] at hpost\n open EvmAsm.Rv64.Ta... | [
{
"name": "rlp_phase2_long_region_body_post_unfold",
"text": "theorem rlp_phase2_long_region_body_post_unfold\n (bs : List Byte) (regionBase len : Word) (off : Nat) (cnt : Word) (P : Prop) :\n rlp_phase2_long_region_body_post bs regionBase len off cnt P =\n ((.x11 ↦ᵣ ((len <<< 8) + (bs.getD off 0).... | [
{
"name": "rlp_phase2_long_region_body_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 96,
"n_chars": 5342,
"n_subproofs": 12,
"n_tactics": 77,
"cyclomatic": 2,
"n_automation": 12,
"n_rewrites": 3,
"n_structural": 8,
"automation_o... | 2 | /-
EvmAsm.Rv64.RLP.Phase2LongLoopRegion
EL.3 Phase 2 (long form) — the big-endian length-read loop over a multi-dword
`bytesRegion`, the region-based analog of the single-dword stack in
`Phase2LongIter` / `Phase2LongLoopBody` / `Phase2LongLoopGeneral`.
The body program is unchanged (`rlp_phase2_long_iter_pr... | /-
EvmAsm.Rv64.RLP.Phase2LongLoopRegion
EL.3 Phase 2 (long form) — the big-endian length-read loop over a multi-dword
`bytesRegion`, the region-based analog of the single-dword stack in
`Phase2LongIter` / `Phase2LongLoopBody` / `Phase2LongLoopGeneral`.
The body program is unchanged (`rlp_phase2_long_iter_pr... | @@ -105,6 +105,16 @@
(.x12 ↦ᵣ (bs.getD off 0).zeroExtend 64) ** (.x0 ↦ᵣ (0 : Word)) **
bytesRegion regionBase bs ** ⌜P⌝
+theorem rlp_phase2_long_region_body_post_unfold
+ (bs : List Byte) (regionBase len : Word) (off : Nat) (cnt : Word) (P : Prop) :
+ rlp_phase2_long_region_body_post bs regionBase len... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_69d9600d67ab_4 | 5725749f914ec0b4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase2LongLoopRegion.lean | Phase2LongLoopRegion | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 3 | [
{
"theorem_name": "rlp_phase2_long_region_body_post_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hp hpost\n simp only [rlp_phase2_long_region_body_post_unfold] at hpost\n open EvmAsm.Rv64.Ta... | [
{
"name": "rlp_phase2_long_region_body_post_unfold",
"text": "theorem rlp_phase2_long_region_body_post_unfold\n (bs : List Byte) (regionBase len : Word) (off : Nat) (cnt : Word) (P : Prop) :\n rlp_phase2_long_region_body_post bs regionBase len off cnt P =\n ((.x11 ↦ᵣ ((len <<< 8) + (bs.getD off 0).... | [
{
"name": "rlp_phase2_long_loop_region_succ_spec_within",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 6,
"n_lines": 89,
"n_chars": 5163,
"n_subproofs": 18,
"n_tactics": 71,
"cyclomatic": 2,
"n_automation": 15,
"n_rewrites": 16,
"n_structural": 6,
"automa... | 6 | /-
EvmAsm.Rv64.RLP.Phase2LongLoopRegion
EL.3 Phase 2 (long form) — the big-endian length-read loop over a multi-dword
`bytesRegion`, the region-based analog of the single-dword stack in
`Phase2LongIter` / `Phase2LongLoopBody` / `Phase2LongLoopGeneral`.
The body program is unchanged (`rlp_phase2_long_iter_pr... | /-
EvmAsm.Rv64.RLP.Phase2LongLoopRegion
EL.3 Phase 2 (long form) — the big-endian length-read loop over a multi-dword
`bytesRegion`, the region-based analog of the single-dword stack in
`Phase2LongIter` / `Phase2LongLoopBody` / `Phase2LongLoopGeneral`.
The body program is unchanged (`rlp_phase2_long_iter_pr... | @@ -112,9 +112,23 @@
(.x12 ↦ᵣ (bs.getD off 0).zeroExtend 64) ** (.x0 ↦ᵣ (0 : Word)) **
bytesRegion regionBase bs ** ⌜P⌝
+theorem rlp_phase2_long_region_body_post_unfold
+ (bs : List Byte) (regionBase len : Word) (off : Nat) (cnt : Word) (P : Prop) :
+ rlp_phase2_long_region_body_post bs regionBase len... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_69d9600d67ab_5 | 850e14e1336791d1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase2LongLoopRegion.lean | Phase2LongLoopRegion | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 3 | [
{
"theorem_name": "rlp_phase2_long_region_body_post_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hp hpost\n simp only [rlp_phase2_long_region_body_post_unfold] at hpost\n open EvmAsm.Rv64.Ta... | [
{
"name": "rlp_phase2_long_region_body_post_unfold",
"text": "theorem rlp_phase2_long_region_body_post_unfold\n (bs : List Byte) (regionBase len : Word) (off : Nat) (cnt : Word) (P : Prop) :\n rlp_phase2_long_region_body_post bs regionBase len off cnt P =\n ((.x11 ↦ᵣ ((len <<< 8) + (bs.getD off 0).... | [
{
"name": "rlp_phase2_long_loop_region_n_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 11,
"n_lines": 29,
"n_chars": 1752,
"n_subproofs": 4,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 2,
"automation_o... | 11 | /-
EvmAsm.Rv64.RLP.Phase2LongLoopRegion
EL.3 Phase 2 (long form) — the big-endian length-read loop over a multi-dword
`bytesRegion`, the region-based analog of the single-dword stack in
`Phase2LongIter` / `Phase2LongLoopBody` / `Phase2LongLoopGeneral`.
The body program is unchanged (`rlp_phase2_long_iter_pr... | /-
EvmAsm.Rv64.RLP.Phase2LongLoopRegion
EL.3 Phase 2 (long form) — the big-endian length-read loop over a multi-dword
`bytesRegion`, the region-based analog of the single-dword stack in
`Phase2LongIter` / `Phase2LongLoopBody` / `Phase2LongLoopGeneral`.
The body program is unchanged (`rlp_phase2_long_iter_pr... | @@ -184,9 +184,23 @@
(.x12 ↦ᵣ (bs.getD off 0).zeroExtend 64) ** (.x0 ↦ᵣ (0 : Word)) **
bytesRegion regionBase bs ** ⌜P⌝
+theorem rlp_phase2_long_region_body_post_unfold
+ (bs : List Byte) (regionBase len : Word) (off : Nat) (cnt : Word) (P : Prop) :
+ rlp_phase2_long_region_body_post bs regionBase len... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_31e7c55cbb7d_0 | 3e6c21300db4d4ce | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/TerminatingLoopBridge.lean | TerminatingLoopBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "stepWithTerminatingHandler_STOP_status",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [stepWithTerminatingHandler_STOP h_decode]\n exact EvmState.stop_status state",
"n_chars": 8... | [
{
"name": "stepWithTerminatingHandler_STOP",
"text": "theorem stepWithTerminatingHandler_STOP\n {state : EvmState}\n (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some .STOP) :\n InterpreterLoop.stepWithHandler terminatingLoopHandler state = state.stop := by\n change\n InterpreterLoo... | [
{
"name": "stepWithTerminatingHandler_STOP_status",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 326,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": ... | 1 | /-
EvmAsm.Evm64.TerminatingLoopBridge
Executable-loop bridge for terminating handler-table entries (GH #113).
-/
import EvmAsm.Evm64.HandlerLoopBridge
import EvmAsm.Evm64.TerminatingHandlers
namespace EvmAsm.Evm64
namespace TerminatingLoopBridge
/--
Executable-loop handler backed by the terminating opcode hand... | /-
EvmAsm.Evm64.TerminatingLoopBridge
Executable-loop bridge for terminating handler-table entries (GH #113).
-/
import EvmAsm.Evm64.HandlerLoopBridge
import EvmAsm.Evm64.TerminatingHandlers
namespace EvmAsm.Evm64
namespace TerminatingLoopBridge
/--
Executable-loop handler backed by the terminating opcode hand... | @@ -25,11 +25,25 @@
HandlerTable.dispatchOpcode TerminatingHandlers.terminatingHandlerTable
opcode state := rfl
+theorem stepWithTerminatingHandler_STOP
+ {state : EvmState}
+ (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some .STOP) :
+ InterpreterLoop.stepWithHandler terminatingL... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_31e7c55cbb7d_1 | b01cdb3d8e17083b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/TerminatingLoopBridge.lean | TerminatingLoopBridge | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "stepWithTerminatingHandler_INVALID_status",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [stepWithTerminatingHandler_INVALID h_decode]\n exact EvmState.invalid_status state",
"n_... | [
{
"name": "stepWithTerminatingHandler_INVALID",
"text": "theorem stepWithTerminatingHandler_INVALID\n {state : EvmState}\n (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some .INVALID) :\n InterpreterLoop.stepWithHandler terminatingLoopHandler state = state.invalid := by\n change\n In... | [
{
"name": "stepWithTerminatingHandler_INVALID_status",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 336,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only... | 1 | /-
EvmAsm.Evm64.TerminatingLoopBridge
Executable-loop bridge for terminating handler-table entries (GH #113).
-/
import EvmAsm.Evm64.HandlerLoopBridge
import EvmAsm.Evm64.TerminatingHandlers
namespace EvmAsm.Evm64
namespace TerminatingLoopBridge
/--
Executable-loop handler backed by the terminating opcode hand... | /-
EvmAsm.Evm64.TerminatingLoopBridge
Executable-loop bridge for terminating handler-table entries (GH #113).
-/
import EvmAsm.Evm64.HandlerLoopBridge
import EvmAsm.Evm64.TerminatingHandlers
namespace EvmAsm.Evm64
namespace TerminatingLoopBridge
/--
Executable-loop handler backed by the terminating opcode hand... | @@ -25,11 +25,25 @@
HandlerTable.dispatchOpcode TerminatingHandlers.terminatingHandlerTable
opcode state := rfl
+theorem stepWithTerminatingHandler_INVALID
+ {state : EvmState}
+ (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some .INVALID) :
+ InterpreterLoop.stepWithHandler termin... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_31e7c55cbb7d_2 | 75aa15e49285c7b3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/TerminatingLoopBridge.lean | TerminatingLoopBridge | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "stepWithTerminatingHandler_missing_invalid_status",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [stepWithTerminatingHandler_missing_invalid h_decode h_lookup]\n exact EvmState.inval... | [
{
"name": "stepWithTerminatingHandler_missing_invalid",
"text": "/--\nDecoded opcodes absent from `terminatingHandlerTable` step to `state.invalid`\nthrough the terminating loop handler.\n\nDistinctive token: TerminatingLoopBridge.stepWithTerminatingHandler_missing_invalid #113.\n-/\ntheorem stepWithTermina... | [
{
"name": "stepWithTerminatingHandler_missing_invalid_status",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 569,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automa... | 1 | /-
EvmAsm.Evm64.TerminatingLoopBridge
Executable-loop bridge for terminating handler-table entries (GH #113).
-/
import EvmAsm.Evm64.HandlerLoopBridge
import EvmAsm.Evm64.TerminatingHandlers
namespace EvmAsm.Evm64
namespace TerminatingLoopBridge
/--
Executable-loop handler backed by the terminating opcode hand... | /-
EvmAsm.Evm64.TerminatingLoopBridge
Executable-loop bridge for terminating handler-table entries (GH #113).
-/
import EvmAsm.Evm64.HandlerLoopBridge
import EvmAsm.Evm64.TerminatingHandlers
namespace EvmAsm.Evm64
namespace TerminatingLoopBridge
/--
Executable-loop handler backed by the terminating opcode hand... | @@ -26,6 +26,19 @@
opcode state := rfl
/--
+Decoded opcodes absent from `terminatingHandlerTable` step to `state.invalid`
+through the terminating loop handler.
+
+Distinctive token: TerminatingLoopBridge.stepWithTerminatingHandler_missing_invalid #113.
+-/
+theorem stepWithTerminatingHandler_missing_invali... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_31e7c55cbb7d_3 | 1c253226d5054a6d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/TerminatingLoopBridge.lean | TerminatingLoopBridge | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "stepWithTerminatingHandler_STOP_status",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [stepWithTerminatingHandler_STOP h_decode]\n exact EvmState.stop_status state",
"n_chars": 8... | [
{
"name": "stepWithTerminatingHandler_STOP",
"text": "theorem stepWithTerminatingHandler_STOP\n {state : EvmState}\n (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some .STOP) :\n InterpreterLoop.stepWithHandler terminatingLoopHandler state = state.stop := by\n change\n InterpreterLoo... | [
{
"name": "loopFuel_succ_running_STOP",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 457,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.TerminatingLoopBridge
Executable-loop bridge for terminating handler-table entries (GH #113).
-/
import EvmAsm.Evm64.HandlerLoopBridge
import EvmAsm.Evm64.TerminatingHandlers
namespace EvmAsm.Evm64
namespace TerminatingLoopBridge
/--
Executable-loop handler backed by the terminating opcode hand... | /-
EvmAsm.Evm64.TerminatingLoopBridge
Executable-loop bridge for terminating handler-table entries (GH #113).
-/
import EvmAsm.Evm64.HandlerLoopBridge
import EvmAsm.Evm64.TerminatingHandlers
namespace EvmAsm.Evm64
namespace TerminatingLoopBridge
/--
Executable-loop handler backed by the terminating opcode hand... | @@ -25,6 +25,18 @@
HandlerTable.dispatchOpcode TerminatingHandlers.terminatingHandlerTable
opcode state := rfl
+theorem stepWithTerminatingHandler_STOP
+ {state : EvmState}
+ (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some .STOP) :
+ InterpreterLoop.stepWithHandler terminatingLo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_31e7c55cbb7d_4 | 9284887c19e67cd8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/TerminatingLoopBridge.lean | TerminatingLoopBridge | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "stepWithTerminatingHandler_STOP_status",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [stepWithTerminatingHandler_STOP h_decode]\n exact EvmState.stop_status state",
"n_chars": 8... | [
{
"name": "stepWithTerminatingHandler_STOP",
"text": "theorem stepWithTerminatingHandler_STOP\n {state : EvmState}\n (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some .STOP) :\n InterpreterLoop.stepWithHandler terminatingLoopHandler state = state.stop := by\n change\n InterpreterLoo... | [
{
"name": "loopFuel_succ_running_STOP_status",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 388,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": fals... | 2 | /-
EvmAsm.Evm64.TerminatingLoopBridge
Executable-loop bridge for terminating handler-table entries (GH #113).
-/
import EvmAsm.Evm64.HandlerLoopBridge
import EvmAsm.Evm64.TerminatingHandlers
namespace EvmAsm.Evm64
namespace TerminatingLoopBridge
/--
Executable-loop handler backed by the terminating opcode hand... | /-
EvmAsm.Evm64.TerminatingLoopBridge
Executable-loop bridge for terminating handler-table entries (GH #113).
-/
import EvmAsm.Evm64.HandlerLoopBridge
import EvmAsm.Evm64.TerminatingHandlers
namespace EvmAsm.Evm64
namespace TerminatingLoopBridge
/--
Executable-loop handler backed by the terminating opcode hand... | @@ -25,6 +25,18 @@
HandlerTable.dispatchOpcode TerminatingHandlers.terminatingHandlerTable
opcode state := rfl
+theorem stepWithTerminatingHandler_STOP
+ {state : EvmState}
+ (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some .STOP) :
+ InterpreterLoop.stepWithHandler terminatingLo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_31e7c55cbb7d_5 | 8e8dcfc0bf720c5f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/TerminatingLoopBridge.lean | TerminatingLoopBridge | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "stepWithTerminatingHandler_INVALID_status",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [stepWithTerminatingHandler_INVALID h_decode]\n exact EvmState.invalid_status state",
"n_... | [
{
"name": "stepWithTerminatingHandler_INVALID",
"text": "theorem stepWithTerminatingHandler_INVALID\n {state : EvmState}\n (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some .INVALID) :\n InterpreterLoop.stepWithHandler terminatingLoopHandler state = state.invalid := by\n change\n In... | [
{
"name": "loopFuel_succ_running_INVALID",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 472,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.TerminatingLoopBridge
Executable-loop bridge for terminating handler-table entries (GH #113).
-/
import EvmAsm.Evm64.HandlerLoopBridge
import EvmAsm.Evm64.TerminatingHandlers
namespace EvmAsm.Evm64
namespace TerminatingLoopBridge
/--
Executable-loop handler backed by the terminating opcode hand... | /-
EvmAsm.Evm64.TerminatingLoopBridge
Executable-loop bridge for terminating handler-table entries (GH #113).
-/
import EvmAsm.Evm64.HandlerLoopBridge
import EvmAsm.Evm64.TerminatingHandlers
namespace EvmAsm.Evm64
namespace TerminatingLoopBridge
/--
Executable-loop handler backed by the terminating opcode hand... | @@ -25,6 +25,18 @@
HandlerTable.dispatchOpcode TerminatingHandlers.terminatingHandlerTable
opcode state := rfl
+theorem stepWithTerminatingHandler_INVALID
+ {state : EvmState}
+ (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some .INVALID) :
+ InterpreterLoop.stepWithHandler termina... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_31e7c55cbb7d_6 | 1475bd3cdbf8bcbe | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/TerminatingLoopBridge.lean | TerminatingLoopBridge | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "stepWithTerminatingHandler_INVALID_status",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [stepWithTerminatingHandler_INVALID h_decode]\n exact EvmState.invalid_status state",
"n_... | [
{
"name": "stepWithTerminatingHandler_INVALID",
"text": "theorem stepWithTerminatingHandler_INVALID\n {state : EvmState}\n (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some .INVALID) :\n InterpreterLoop.stepWithHandler terminatingLoopHandler state = state.invalid := by\n change\n In... | [
{
"name": "loopFuel_succ_running_INVALID_status",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 398,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": f... | 2 | /-
EvmAsm.Evm64.TerminatingLoopBridge
Executable-loop bridge for terminating handler-table entries (GH #113).
-/
import EvmAsm.Evm64.HandlerLoopBridge
import EvmAsm.Evm64.TerminatingHandlers
namespace EvmAsm.Evm64
namespace TerminatingLoopBridge
/--
Executable-loop handler backed by the terminating opcode hand... | /-
EvmAsm.Evm64.TerminatingLoopBridge
Executable-loop bridge for terminating handler-table entries (GH #113).
-/
import EvmAsm.Evm64.HandlerLoopBridge
import EvmAsm.Evm64.TerminatingHandlers
namespace EvmAsm.Evm64
namespace TerminatingLoopBridge
/--
Executable-loop handler backed by the terminating opcode hand... | @@ -25,6 +25,18 @@
HandlerTable.dispatchOpcode TerminatingHandlers.terminatingHandlerTable
opcode state := rfl
+theorem stepWithTerminatingHandler_INVALID
+ {state : EvmState}
+ (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some .INVALID) :
+ InterpreterLoop.stepWithHandler termina... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_06baef53af59_0 | 63116e1de9c65559 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2V4NoNopMTT.lean | FullPathN2V4NoNopMTT | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "divK_loop_n2_max_call_call_from_source_exact_loopIterScratch_v4_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 149,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loopN2MaxCallCallSourceConds_unfold] at hconds\n simp only [r2... | [
{
"name": "r2MTTN2V4_eq",
"text": "theorem r2MTTN2V4_eq (v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :\n r2MTTN2V4 v0 v1 v2 v3 u0 u1 u2 u3 uTop =\n iterN2Max v0 v1 v2 v3 u0 u1 u2 u3 uTop := by\n delta r2MTTN2V4; rfl\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 181,
"n_subproofs": 0,
"n_... | [
{
"name": "divK_loop_n2_max_call_call_from_source_exact_loopIterScratch_v4_noNop",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 170,
"n_chars": 8240,
"n_subproofs": 6,
"n_tactics": 145,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_str... | 4 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V4NoNopMTT
Three-iteration max-call-call composition for the n=2 v4/no-NOP source path.
j=2 takes the max-trial branch; j=1 and j=0 take the callable trial-division
(call) path.
Conditions: bltu_2=false (max), bltu_1=true (call), bltu_0=true (call).
-/
import EvmAsm.... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V4NoNopMTT
Three-iteration max-call-call composition for the n=2 v4/no-NOP source path.
j=2 takes the max-trial branch; j=1 and j=0 take the callable trial-division
(call) path.
Conditions: bltu_2=false (max), bltu_1=true (call), bltu_0=true (call).
-/
import EvmAsm.... | @@ -21,6 +21,11 @@
Word × Word × Word × Word × Word × Word :=
iterN2Max v0 v1 v2 v3 u0 u1 u2 u3 uTop
+theorem r2MTTN2V4_eq (v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :
+ r2MTTN2V4 v0 v1 v2 v3 u0 u1 u2 u3 uTop =
+ iterN2Max v0 v1 v2 v3 u0 u1 u2 u3 uTop := by
+ delta r2MTTN2V4; rfl
+
/-- Opaque alias for t... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4192e40b32e0_0 | 8fc90b64504245ea | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/InterpreterLoop.lean | InterpreterLoop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "decodeCurrentOpcode?_of_fetch_unsupported",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [decodeCurrentOpcode?_of_fetch h_fetch, h_decode]",
"n_chars": 58,
"n_subproofs": 0,
... | [
{
"name": "decodeCurrentOpcode?_of_fetch",
"text": "theorem decodeCurrentOpcode?_of_fetch\n {state : EvmState} {byte : BitVec 8}\n (h_fetch : fetchOpcodeByte? state = some byte) :\n decodeCurrentOpcode? state = EvmOpcode.decodeByte? byte.toNat := by\n simp [decodeCurrentOpcode?, h_fetch]\n\n",
... | [
{
"name": "decodeCurrentOpcode?_of_fetch_unsupported",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 301,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only... | 1 | /-
EvmAsm.Evm64.InterpreterLoop
Pure fetch/decode/dispatch loop scaffold for the EVM interpreter (GH #108).
-/
import EvmAsm.Evm64.Dispatch
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
namespace InterpreterLoop
/-- Fetch the opcode byte at the current EVM PC. -/
def fetchOpcodeByte? (state : EvmState... | /-
EvmAsm.Evm64.InterpreterLoop
Pure fetch/decode/dispatch loop scaffold for the EVM interpreter (GH #108).
-/
import EvmAsm.Evm64.Dispatch
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
namespace InterpreterLoop
/-- Fetch the opcode byte at the current EVM PC. -/
def fetchOpcodeByte? (state : EvmState... | @@ -46,11 +46,18 @@
| .running => loopFuel handler nSteps (stepWithHandler handler state)
| _ => state
+theorem decodeCurrentOpcode?_of_fetch
+ {state : EvmState} {byte : BitVec 8}
+ (h_fetch : fetchOpcodeByte? state = some byte) :
+ decodeCurrentOpcode? state = EvmOpcode.decodeByte? byte.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_4192e40b32e0_1 | fa42f3679c5326d3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/InterpreterLoop.lean | InterpreterLoop | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "decodeCurrentOpcode?_of_fetch_unsupported",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [decodeCurrentOpcode?_of_fetch h_fetch, h_decode]",
"n_chars": 58,
"n_subproofs": 0,
... | [
{
"name": "decodeCurrentOpcode?_of_fetch",
"text": "theorem decodeCurrentOpcode?_of_fetch\n {state : EvmState} {byte : BitVec 8}\n (h_fetch : fetchOpcodeByte? state = some byte) :\n decodeCurrentOpcode? state = EvmOpcode.decodeByte? byte.toNat := by\n simp [decodeCurrentOpcode?, h_fetch]\n\n",
... | [
{
"name": "decodeCurrentOpcode?_eq_some_iff",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 25,
"n_chars": 1151,
"n_subproofs": 3,
"n_tactics": 15,
"cyclomatic": 4,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 6,
"automation_only": fal... | 4 | /-
EvmAsm.Evm64.InterpreterLoop
Pure fetch/decode/dispatch loop scaffold for the EVM interpreter (GH #108).
-/
import EvmAsm.Evm64.Dispatch
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
namespace InterpreterLoop
/-- Fetch the opcode byte at the current EVM PC. -/
def fetchOpcodeByte? (state : EvmState... | /-
EvmAsm.Evm64.InterpreterLoop
Pure fetch/decode/dispatch loop scaffold for the EVM interpreter (GH #108).
-/
import EvmAsm.Evm64.Dispatch
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
namespace InterpreterLoop
/-- Fetch the opcode byte at the current EVM PC. -/
def fetchOpcodeByte? (state : EvmState... | @@ -56,6 +56,12 @@
fetchOpcodeByte? state = none := by
simp [fetchOpcodeByte?, show ¬ state.pc < state.code.length from by omega]
+theorem decodeCurrentOpcode?_of_fetch
+ {state : EvmState} {byte : BitVec 8}
+ (h_fetch : fetchOpcodeByte? state = some byte) :
+ decodeCurrentOpcode? state = EvmOpcode.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_4192e40b32e0_2 | 13b16bbbb069e695 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/InterpreterLoop.lean | InterpreterLoop | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "decodeCurrentOpcode?_of_fetch_unsupported",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [decodeCurrentOpcode?_of_fetch h_fetch, h_decode]",
"n_chars": 58,
"n_subproofs": 0,
... | [
{
"name": "decodeCurrentOpcode?_of_fetch",
"text": "theorem decodeCurrentOpcode?_of_fetch\n {state : EvmState} {byte : BitVec 8}\n (h_fetch : fetchOpcodeByte? state = some byte) :\n decodeCurrentOpcode? state = EvmOpcode.decodeByte? byte.toNat := by\n simp [decodeCurrentOpcode?, h_fetch]\n\n",
... | [
{
"name": "decodeCurrentOpcode?_eq_none_iff",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 23,
"n_chars": 1121,
"n_subproofs": 2,
"n_tactics": 13,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 7,
"automation_only": fal... | 5 | /-
EvmAsm.Evm64.InterpreterLoop
Pure fetch/decode/dispatch loop scaffold for the EVM interpreter (GH #108).
-/
import EvmAsm.Evm64.Dispatch
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
namespace InterpreterLoop
/-- Fetch the opcode byte at the current EVM PC. -/
def fetchOpcodeByte? (state : EvmState... | /-
EvmAsm.Evm64.InterpreterLoop
Pure fetch/decode/dispatch loop scaffold for the EVM interpreter (GH #108).
-/
import EvmAsm.Evm64.Dispatch
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
namespace InterpreterLoop
/-- Fetch the opcode byte at the current EVM PC. -/
def fetchOpcodeByte? (state : EvmState... | @@ -56,11 +56,18 @@
fetchOpcodeByte? state = none := by
simp [fetchOpcodeByte?, show ¬ state.pc < state.code.length from by omega]
+theorem decodeCurrentOpcode?_of_fetch
+ {state : EvmState} {byte : BitVec 8}
+ (h_fetch : fetchOpcodeByte? state = some byte) :
+ decodeCurrentOpcode? state = EvmOpcode.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4192e40b32e0_3 | ddb569629861cd2d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/InterpreterLoop.lean | InterpreterLoop | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "decodeCurrentOpcode?_eq_none_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · intro h_eq\n by_cases h_pc : state.pc < state.code.length\n · have h_fetch : fetch... | [
{
"name": "decodeCurrentOpcode?_of_fetch_unsupported",
"text": "theorem decodeCurrentOpcode?_of_fetch_unsupported\n {state : EvmState} {byte : BitVec 8}\n (h_fetch : fetchOpcodeByte? state = some byte)\n (h_decode : EvmOpcode.decodeByte? byte.toNat = none) :\n decodeCurrentOpcode? state = none :... | [
{
"name": "stepWithHandler_of_fetch_unsupported",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 376,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": fa... | 3 | /-
EvmAsm.Evm64.InterpreterLoop
Pure fetch/decode/dispatch loop scaffold for the EVM interpreter (GH #108).
-/
import EvmAsm.Evm64.Dispatch
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
namespace InterpreterLoop
/-- Fetch the opcode byte at the current EVM PC. -/
def fetchOpcodeByte? (state : EvmState... | /-
EvmAsm.Evm64.InterpreterLoop
Pure fetch/decode/dispatch loop scaffold for the EVM interpreter (GH #108).
-/
import EvmAsm.Evm64.Dispatch
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
namespace InterpreterLoop
/-- Fetch the opcode byte at the current EVM PC. -/
def fetchOpcodeByte? (state : EvmState... | @@ -52,6 +52,13 @@
decodeCurrentOpcode? state = EvmOpcode.decodeByte? byte.toNat := by
simp [decodeCurrentOpcode?, h_fetch]
+theorem decodeCurrentOpcode?_of_fetch_unsupported
+ {state : EvmState} {byte : BitVec 8}
+ (h_fetch : fetchOpcodeByte? state = some byte)
+ (h_decode : EvmOpcode.decodeByte? by... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4192e40b32e0_4 | e9e6e9fd13270f14 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/InterpreterLoop.lean | InterpreterLoop | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "decodeCurrentOpcode?_eq_some_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · intro h_eq\n by_cases h_pc : state.pc < state.code.length\n · have h_fetch : fetch... | [
{
"name": "decodeCurrentOpcode?_of_eof",
"text": "theorem decodeCurrentOpcode?_of_eof\n {state : EvmState} (h_fetch : fetchOpcodeByte? state = none) :\n decodeCurrentOpcode? state = none := by\n simp [decodeCurrentOpcode?, h_fetch]\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 187,
"n_s... | [
{
"name": "stepWithHandler_eof_invalid",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 293,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 3 | /-
EvmAsm.Evm64.InterpreterLoop
Pure fetch/decode/dispatch loop scaffold for the EVM interpreter (GH #108).
-/
import EvmAsm.Evm64.Dispatch
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
namespace InterpreterLoop
/-- Fetch the opcode byte at the current EVM PC. -/
def fetchOpcodeByte? (state : EvmState... | /-
EvmAsm.Evm64.InterpreterLoop
Pure fetch/decode/dispatch loop scaffold for the EVM interpreter (GH #108).
-/
import EvmAsm.Evm64.Dispatch
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
namespace InterpreterLoop
/-- Fetch the opcode byte at the current EVM PC. -/
def fetchOpcodeByte? (state : EvmState... | @@ -51,6 +51,11 @@
fetchOpcodeByte? state = none := by
simp [fetchOpcodeByte?, show ¬ state.pc < state.code.length from by omega]
+theorem decodeCurrentOpcode?_of_eof
+ {state : EvmState} (h_fetch : fetchOpcodeByte? state = none) :
+ decodeCurrentOpcode? state = none := by
+ simp [decodeCurrentOpcode?,... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f5c946e89f38_0 | 838972e76ae82475 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2V5ConcretePostBridgeMod.lean | N2V5ConcretePostBridgeMod | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "fullModN2UnifiedPostNoX1V5_frame_to_modStackDispatchPostCallableExactFrame_scratch",
"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 [modStackDispatchPostCallableExactFram... | [
{
"name": "fullModN2UnifiedPostNoX1V5_frame_to_modConcretePostNoX1ExactRegsFrame_scratch",
"text": "theorem fullModN2UnifiedPostNoX1V5_frame_to_modConcretePostNoX1ExactRegsFrame_scratch\n (bltu_2 bltu_1 bltu_0 : Bool)\n (sp base : Word) (a b : EvmWord)\n (a0 a1 a2 a3 b0 b1 b2 b3 retMem dMem dloMem ... | [
{
"name": "fullModN2UnifiedPostNoX1V5_frame_to_modStackDispatchPostCallableExactFrame_scratch",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 42,
"n_chars": 2608,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N2V5ConcretePostBridgeMod
N=2 V5 bridge from `fullModN2UnifiedPostNoX1V5` (with exact caller `x1`)
to `modConcretePostNoX1ExactRegsFrame` plus the v4 scratch cell.
Mirrors `fullDivN3UnifiedPostNoX1V5_frame_to_modConcretePostNoX1ExactRegsFrame_scratch`
in N3V5StackPre.lean:721–836... | /-
EvmAsm.Evm64.DivMod.Spec.N2V5ConcretePostBridgeMod
N=2 V5 bridge from `fullModN2UnifiedPostNoX1V5` (with exact caller `x1`)
to `modConcretePostNoX1ExactRegsFrame` plus the v4 scratch cell.
Mirrors `fullDivN3UnifiedPostNoX1V5_frame_to_modConcretePostNoX1ExactRegsFrame_scratch`
in N3V5StackPre.lean:721–836... | @@ -19,6 +19,102 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
+theorem fullModN2UnifiedPostNoX1V5_frame_to_modConcretePostNoX1ExactRegsFrame_scratch
+ (bltu_2 bltu_1 bltu_0 : Bool)
+ (sp base : Word) (a b : EvmWord)
+ (a0 a1 a2 a3 b0 b1 b2 b3 retMem dMem dloMem scratchUn0 scratchMem : Word... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f5c946e89f38_1 | a8d2b851359eeab3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2V5ConcretePostBridgeMod.lean | N2V5ConcretePostBridgeMod | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "fullModN2UnifiedPostNoX1V5_frame_to_modStackDispatchPostCallableExactFrame_scratch",
"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 [modStackDispatchPostCallableExactFram... | [
{
"name": "fullModN2UnifiedPostNoX1V5_frame_to_modConcretePostNoX1ExactRegsFrame_scratch",
"text": "theorem fullModN2UnifiedPostNoX1V5_frame_to_modConcretePostNoX1ExactRegsFrame_scratch\n (bltu_2 bltu_1 bltu_0 : Bool)\n (sp base : Word) (a b : EvmWord)\n (a0 a1 a2 a3 b0 b1 b2 b3 retMem dMem dloMem ... | [
{
"name": "fullModN2UnifiedPostNoX1V5_frame_to_modStackDispatchPostCallableExactFrame_scratch_word",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 38,
"n_chars": 1894,
"n_subproofs": 1,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.N2V5ConcretePostBridgeMod
N=2 V5 bridge from `fullModN2UnifiedPostNoX1V5` (with exact caller `x1`)
to `modConcretePostNoX1ExactRegsFrame` plus the v4 scratch cell.
Mirrors `fullDivN3UnifiedPostNoX1V5_frame_to_modConcretePostNoX1ExactRegsFrame_scratch`
in N3V5StackPre.lean:721–836... | /-
EvmAsm.Evm64.DivMod.Spec.N2V5ConcretePostBridgeMod
N=2 V5 bridge from `fullModN2UnifiedPostNoX1V5` (with exact caller `x1`)
to `modConcretePostNoX1ExactRegsFrame` plus the v4 scratch cell.
Mirrors `fullDivN3UnifiedPostNoX1V5_frame_to_modConcretePostNoX1ExactRegsFrame_scratch`
in N3V5StackPre.lean:721–836... | @@ -19,6 +19,102 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
+theorem fullModN2UnifiedPostNoX1V5_frame_to_modConcretePostNoX1ExactRegsFrame_scratch
+ (bltu_2 bltu_1 bltu_0 : Bool)
+ (sp base : Word) (a b : EvmWord)
+ (a0 a1 a2 a3 b0 b1 b2 b3 retMem dMem dloMem scratchUn0 scratchMem : Word... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4f41cacbd566_0 | 2a0a99ed27cde9f1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Crypto/ScalarMul.lean | ScalarMul | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "nsmul_two_mul",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction k with\n | zero => rfl\n | succ k ih =>\n show add (nsmul add zero k (add P P)) (add P P) = _\n rw [ih,... | [
{
"name": "nsmul_succ",
"text": "theorem nsmul_succ {α : Type _} (add : α → α → α) (zero : α) (k : Nat)\n (P : α) : nsmul add zero (k + 1) P = add (nsmul add zero k P) P := rfl\n\n",
"fan_in": 3,
"n_lines": 4,
"n_chars": 157,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
... | [
{
"name": "nsmul_two_mul",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 654,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"max_nesting"... | 1 | /-
EvmAsm.Crypto.ScalarMul
The double-and-add scalar-multiplication skeleton (bead
evm-asm-4ch8f.11.13, crypto-strategy §6 label `.11.9`): the MSB-first
double-and-add ladder shape every guest curve scalar-mul routine
implements (`secp256k1_scalar_mul` over the `0x803/0x804` accelerator
handles, and the BN... | /-
EvmAsm.Crypto.ScalarMul
The double-and-add scalar-multiplication skeleton (bead
evm-asm-4ch8f.11.13, crypto-strategy §6 label `.11.9`): the MSB-first
double-and-add ladder shape every guest curve scalar-mul routine
implements (`secp256k1_scalar_mul` over the `0x803/0x804` accelerator
handles, and the BN... | @@ -73,13 +73,19 @@
@[simp] theorem nsmul_zero {α : Type _} (add : α → α → α) (zero : α)
(P : α) : nsmul add zero 0 P = zero := rfl
+theorem nsmul_succ {α : Type _} (add : α → α → α) (zero : α) (k : Nat)
+ (P : α) : nsmul add zero (k + 1) P = add (nsmul add zero k P) P := rfl
+
/-- `k · (P + P) = (2k) · P`.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4f41cacbd566_1 | c3da6182e3e96031 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Crypto/ScalarMul.lean | ScalarMul | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "nsmul_two_mul",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction k with\n | zero => rfl\n | succ k ih =>\n show add (nsmul add zero k (add P P)) (add P P) = _\n rw [ih,... | [
{
"name": "nsmul_succ",
"text": "theorem nsmul_succ {α : Type _} (add : α → α → α) (zero : α) (k : Nat)\n (P : α) : nsmul add zero (k + 1) P = add (nsmul add zero k P) P := rfl\n\n",
"fan_in": 3,
"n_lines": 4,
"n_chars": 157,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
... | [
{
"name": "dblAdd_inv",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 39,
"n_chars": 1821,
"n_subproofs": 8,
"n_tactics": 31,
"cyclomatic": 3,
"n_automation": 8,
"n_rewrites": 8,
"n_structural": 3,
"automation_only": false,
"max_nesting":... | 3 | /-
EvmAsm.Crypto.ScalarMul
The double-and-add scalar-multiplication skeleton (bead
evm-asm-4ch8f.11.13, crypto-strategy §6 label `.11.9`): the MSB-first
double-and-add ladder shape every guest curve scalar-mul routine
implements (`secp256k1_scalar_mul` over the `0x803/0x804` accelerator
handles, and the BN... | /-
EvmAsm.Crypto.ScalarMul
The double-and-add scalar-multiplication skeleton (bead
evm-asm-4ch8f.11.13, crypto-strategy §6 label `.11.9`): the MSB-first
double-and-add ladder shape every guest curve scalar-mul routine
implements (`secp256k1_scalar_mul` over the `0x803/0x804` accelerator
handles, and the BN... | @@ -73,6 +73,9 @@
@[simp] theorem nsmul_zero {α : Type _} (add : α → α → α) (zero : α)
(P : α) : nsmul add zero 0 P = zero := rfl
+theorem nsmul_succ {α : Type _} (add : α → α → α) (zero : α) (k : Nat)
+ (P : α) : nsmul add zero (k + 1) P = add (nsmul add zero k P) P := rfl
+
/-- `(m + n) · P = m · P + 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_4f41cacbd566_2 | b99657b74601b1f9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Crypto/ScalarMul.lean | ScalarMul | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "nsmul_two_mul",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction k with\n | zero => rfl\n | succ k ih =>\n show add (nsmul add zero k (add P P)) (add P P) = _\n rw [ih,... | [
{
"name": "nsmul_succ",
"text": "theorem nsmul_succ {α : Type _} (add : α → α → α) (zero : α) (k : Nat)\n (P : α) : nsmul add zero (k + 1) P = add (nsmul add zero k P) P := rfl\n\n",
"fan_in": 3,
"n_lines": 4,
"n_chars": 157,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
... | [
{
"name": "dblAdd_correct",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 14,
"n_chars": 628,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting... | 4 | /-
EvmAsm.Crypto.ScalarMul
The double-and-add scalar-multiplication skeleton (bead
evm-asm-4ch8f.11.13, crypto-strategy §6 label `.11.9`): the MSB-first
double-and-add ladder shape every guest curve scalar-mul routine
implements (`secp256k1_scalar_mul` over the `0x803/0x804` accelerator
handles, and the BN... | /-
EvmAsm.Crypto.ScalarMul
The double-and-add scalar-multiplication skeleton (bead
evm-asm-4ch8f.11.13, crypto-strategy §6 label `.11.9`): the MSB-first
double-and-add ladder shape every guest curve scalar-mul routine
implements (`secp256k1_scalar_mul` over the `0x803/0x804` accelerator
handles, and the BN... | @@ -73,6 +73,9 @@
@[simp] theorem nsmul_zero {α : Type _} (add : α → α → α) (zero : α)
(P : α) : nsmul add zero 0 P = zero := rfl
+theorem nsmul_succ {α : Type _} (add : α → α → α) (zero : α) (k : Nat)
+ (P : α) : nsmul add zero (k + 1) P = add (nsmul add zero k P) P := rfl
+
/-- `(m + n) · P = m · P + 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_4f41cacbd566_3 | 47672c0c1fbd12ba | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Crypto/ScalarMul.lean | ScalarMul | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "dblAdd_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction i with\n | zero =>\n have h0 : beBytesToNat bs >>> (8 * bs.length - 0) = 0 := by\n rw [Nat.sub_zero, Nat... | [
{
"name": "nsmul_add_distrib",
"text": "/-- `(m + n) · P = m · P + n · P` (needs only `assoc` + `add_zero`). -/\ntheorem nsmul_add_distrib {α : Type _} {add : α → α → α} {zero : α}\n (h : AddLaws add zero) (m n : Nat) (P : α) :\n nsmul add zero (m + n) P\n = add (nsmul add zero m P) (nsmul add ze... | [
{
"name": "dblAdd_zero_scalar",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 11,
"n_chars": 443,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nes... | 5 | /-
EvmAsm.Crypto.ScalarMul
The double-and-add scalar-multiplication skeleton (bead
evm-asm-4ch8f.11.13, crypto-strategy §6 label `.11.9`): the MSB-first
double-and-add ladder shape every guest curve scalar-mul routine
implements (`secp256k1_scalar_mul` over the `0x803/0x804` accelerator
handles, and the BN... | /-
EvmAsm.Crypto.ScalarMul
The double-and-add scalar-multiplication skeleton (bead
evm-asm-4ch8f.11.13, crypto-strategy §6 label `.11.9`): the MSB-first
double-and-add ladder shape every guest curve scalar-mul routine
implements (`secp256k1_scalar_mul` over the `0x803/0x804` accelerator
handles, and the BN... | @@ -76,6 +76,18 @@
theorem nsmul_succ {α : Type _} (add : α → α → α) (zero : α) (k : Nat)
(P : α) : nsmul add zero (k + 1) P = add (nsmul add zero k P) P := rfl
+/-- `(m + n) · P = m · P + n · P` (needs only `assoc` + `add_zero`). -/
+theorem nsmul_add_distrib {α : Type _} {add : α → α → α} {zero : α}
+ (h :... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4f41cacbd566_4 | 3fcc44eb9941c53c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Crypto/ScalarMul.lean | ScalarMul | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "dblAdd_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction i with\n | zero =>\n have h0 : beBytesToNat bs >>> (8 * bs.length - 0) = 0 := by\n rw [Nat.sub_zero, Nat... | [
{
"name": "nsmul_add_distrib",
"text": "/-- `(m + n) · P = m · P + n · P` (needs only `assoc` + `add_zero`). -/\ntheorem nsmul_add_distrib {α : Type _} {add : α → α → α} {zero : α}\n (h : AddLaws add zero) (m n : Nat) (P : α) :\n nsmul add zero (m + n) P\n = add (nsmul add zero m P) (nsmul add ze... | [
{
"name": "dblAdd_zero_point",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 15,
"n_chars": 665,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nest... | 6 | /-
EvmAsm.Crypto.ScalarMul
The double-and-add scalar-multiplication skeleton (bead
evm-asm-4ch8f.11.13, crypto-strategy §6 label `.11.9`): the MSB-first
double-and-add ladder shape every guest curve scalar-mul routine
implements (`secp256k1_scalar_mul` over the `0x803/0x804` accelerator
handles, and the BN... | /-
EvmAsm.Crypto.ScalarMul
The double-and-add scalar-multiplication skeleton (bead
evm-asm-4ch8f.11.13, crypto-strategy §6 label `.11.9`): the MSB-first
double-and-add ladder shape every guest curve scalar-mul routine
implements (`secp256k1_scalar_mul` over the `0x803/0x804` accelerator
handles, and the BN... | @@ -76,6 +76,18 @@
theorem nsmul_succ {α : Type _} (add : α → α → α) (zero : α) (k : Nat)
(P : α) : nsmul add zero (k + 1) P = add (nsmul add zero k P) P := rfl
+/-- `(m + n) · P = m · P + n · P` (needs only `assoc` + `add_zero`). -/
+theorem nsmul_add_distrib {α : Type _} {add : α → α → α} {zero : α}
+ (h :... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4f41cacbd566_5 | d60ac90652089450 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Crypto/ScalarMul.lean | ScalarMul | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "nsmul_two_mul",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction k with\n | zero => rfl\n | succ k ih =>\n show add (nsmul add zero k (add P P)) (add P P) = _\n rw [ih,... | [
{
"name": "nsmul_succ",
"text": "theorem nsmul_succ {α : Type _} (add : α → α → α) (zero : α) (k : Nat)\n (P : α) : nsmul add zero (k + 1) P = add (nsmul add zero k P) P := rfl\n\n",
"fan_in": 3,
"n_lines": 4,
"n_chars": 157,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
... | [
{
"name": "binMulAux_eq",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 36,
"n_chars": 1373,
"n_subproofs": 5,
"n_tactics": 29,
"cyclomatic": 3,
"n_automation": 6,
"n_rewrites": 11,
"n_structural": 9,
"automation_only": false,
"max_nestin... | 2 | /-
EvmAsm.Crypto.ScalarMul
The double-and-add scalar-multiplication skeleton (bead
evm-asm-4ch8f.11.13, crypto-strategy §6 label `.11.9`): the MSB-first
double-and-add ladder shape every guest curve scalar-mul routine
implements (`secp256k1_scalar_mul` over the `0x803/0x804` accelerator
handles, and the BN... | /-
EvmAsm.Crypto.ScalarMul
The double-and-add scalar-multiplication skeleton (bead
evm-asm-4ch8f.11.13, crypto-strategy §6 label `.11.9`): the MSB-first
double-and-add ladder shape every guest curve scalar-mul routine
implements (`secp256k1_scalar_mul` over the `0x803/0x804` accelerator
handles, and the BN... | @@ -73,13 +73,19 @@
@[simp] theorem nsmul_zero {α : Type _} (add : α → α → α) (zero : α)
(P : α) : nsmul add zero 0 P = zero := rfl
+theorem nsmul_succ {α : Type _} (add : α → α → α) (zero : α) (k : Nat)
+ (P : α) : nsmul add zero (k + 1) P = add (nsmul add zero k P) P := rfl
+
/-- `k · (P + P) = (2k) · P`.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4f41cacbd566_6 | 29a5ea40abe8f7c3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Crypto/ScalarMul.lean | ScalarMul | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "binMulAux_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 29,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro fuel\n induction fuel with\n | zero =>\n intro k hk pt acc\n obtain rfl : k = 0 := by omega\n exact (h... | [
{
"name": "nsmul_two_mul",
"text": "/-- `k · (P + P) = (2k) · P`. -/\ntheorem nsmul_two_mul {α : Type _} {add : α → α → α} {zero : α}\n (h : AddLaws add zero) (k : Nat) (P : α) :\n nsmul add zero k (add P P) = nsmul add zero (2 * k) P := by\n induction k with\n | zero => rfl\n | succ k ih =>\n ... | [
{
"name": "dblAdd_eq_binMulAux",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 13,
"n_chars": 615,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_ne... | 7 | /-
EvmAsm.Crypto.ScalarMul
The double-and-add scalar-multiplication skeleton (bead
evm-asm-4ch8f.11.13, crypto-strategy §6 label `.11.9`): the MSB-first
double-and-add ladder shape every guest curve scalar-mul routine
implements (`secp256k1_scalar_mul` over the `0x803/0x804` accelerator
handles, and the BN... | /-
EvmAsm.Crypto.ScalarMul
The double-and-add scalar-multiplication skeleton (bead
evm-asm-4ch8f.11.13, crypto-strategy §6 label `.11.9`): the MSB-first
double-and-add ladder shape every guest curve scalar-mul routine
implements (`secp256k1_scalar_mul` over the `0x803/0x804` accelerator
handles, and the BN... | @@ -88,6 +88,21 @@
rw [ih, h.assoc]
rfl
+/-- `k · (P + P) = (2k) · P`. -/
+theorem nsmul_two_mul {α : Type _} {add : α → α → α} {zero : α}
+ (h : AddLaws add zero) (k : Nat) (P : α) :
+ nsmul add zero k (add P P) = nsmul add zero (2 * k) P := by
+ induction k with
+ | zero => rfl
+ | succ k ih ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5a3098fa9460_0 | 0769c03ad409ff91 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WithdrawalSchemaWP.lean | WithdrawalSchemaWP | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "successFieldSpecs_schemaCanonical",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [SchemaWP.SchemaCanonical, successFieldSpecs]\n exact ⟨headD_ne_zero_schema_guard d0 hc0,\n head... | [
{
"name": "headD_ne_zero_schema_guard",
"text": "private theorem headD_ne_zero_schema_guard (d : List Byte) (h : d.headD 1 ≠ 0) :\n d = [] ∨ ¬ d.head?.getD (BitVec.ofNat 8 1) = BitVec.ofNat 8 0 := by\n right\n cases hd : d with\n | nil => simp\n | cons b _ =>\n have hb : b ≠ (0 : Byte) := by sim... | [
{
"name": "successFieldSpecs_schemaCanonical",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 464,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": fals... | 1 | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | @@ -32,11 +32,23 @@
, { isScalar := true, data := d3, di := 40, imm := (40 : BitVec 12) }
]
+private theorem headD_ne_zero_schema_guard (d : List Byte) (h : d.headD 1 ≠ 0) :
+ d = [] ∨ ¬ d.head?.getD (BitVec.ofNat 8 1) = BitVec.ofNat 8 0 := by
+ right
+ cases hd : d with
+ | nil => simp
+ | cons b _ =>
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5a3098fa9460_1 | 6df4b8366d711b28 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WithdrawalSchemaWP.lean | WithdrawalSchemaWP | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "successFieldSpecs_coreValid",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro f hf\n simp [successFieldSpecs] at hf\n rcases hf with rfl | rfl | rfl | rfl\n · simp [fieldCoreValid... | [
{
"name": "encode_bytes_length_lt_256_pow_8_of_length_eq_20",
"text": "private theorem encode_bytes_length_lt_256_pow_8_of_length_eq_20 (d : List Byte)\n (h : d.length = 20) :\n (encode (.bytes d)).length < 256 ^ 8 := by\n cases d with\n | nil => simp at h\n | cons b tail =>\n cases tail with\... | [
{
"name": "successFieldSpecs_coreValid",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 790,
"n_subproofs": 1,
"n_tactics": 13,
"cyclomatic": 2,
"n_automation": 13,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
... | 1 | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | @@ -50,6 +50,21 @@
exact ⟨headD_ne_zero_schema_guard d0 hc0,
headD_ne_zero_schema_guard d1 hc1, headD_ne_zero_schema_guard d3 hc3⟩
+private theorem encode_bytes_length_lt_256_pow_8_of_length_eq_20 (d : List Byte)
+ (h : d.length = 20) :
+ (encode (.bytes d)).length < 256 ^ 8 := by
+ cases d with
+ | 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_5a3098fa9460_2 | 085bbeb559769ccc | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WithdrawalSchemaWP.lean | WithdrawalSchemaWP | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "successFieldSpecs_schemaCanonical",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [SchemaWP.SchemaCanonical, successFieldSpecs]\n exact ⟨headD_ne_zero_schema_guard d0 hc0,\n head... | [
{
"name": "headD_ne_zero_schema_guard",
"text": "private theorem headD_ne_zero_schema_guard (d : List Byte) (h : d.headD 1 ≠ 0) :\n d = [] ∨ ¬ d.head?.getD (BitVec.ofNat 8 1) = BitVec.ofNat 8 0 := by\n right\n cases hd : d with\n | nil => simp\n | cons b _ =>\n have hb : b ≠ (0 : Byte) := by sim... | [
{
"name": "successFieldSpecs_decodes_of_concat",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 14,
"n_chars": 758,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": fa... | 2 | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | @@ -32,11 +32,23 @@
, { isScalar := true, data := d3, di := 40, imm := (40 : BitVec 12) }
]
+private theorem headD_ne_zero_schema_guard (d : List Byte) (h : d.headD 1 ≠ 0) :
+ d = [] ∨ ¬ d.head?.getD (BitVec.ofNat 8 1) = BitVec.ofNat 8 0 := by
+ right
+ cases hd : d with
+ | nil => simp
+ | cons b _ =>
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5a3098fa9460_3 | cf9a2f00ea655a8e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WithdrawalSchemaWP.lean | WithdrawalSchemaWP | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "schemaEncBytes_successFieldSpecs_length_le_48",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h0 := encode_bytes_length_le_9_of_length_le_8 d0 hl0\n have h1 := encode_bytes_length_l... | [
{
"name": "encode_bytes_length_le_9_of_length_le_8",
"text": "private theorem encode_bytes_length_le_9_of_length_le_8 (d : List Byte) (h : d.length ≤ 8) :\n (encode (.bytes d)).length ≤ 9 := by\n unfold encode encodeBytes\n cases d with\n | nil => simp\n | cons b tail =>\n cases tail with\n ... | [
{
"name": "schemaEncBytes_successFieldSpecs_length_le_48",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 560,
"n_subproofs": 4,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation... | 2 | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | @@ -95,6 +95,21 @@
schemaValid_of_concat bs outputSize tail (successFieldSpecs d0 d1 d2 d3) O
(successFieldSpecs_coreValid d0 d1 d2 d3 hl0 hl1 haddr hl3) hconcat
+private theorem encode_bytes_length_le_9_of_length_le_8 (d : List Byte) (h : d.length ≤ 8) :
+ (encode (.bytes d)).length ≤ 9 := by
+ unfold en... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5a3098fa9460_4 | 9907fbae59398fe3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WithdrawalSchemaWP.lean | WithdrawalSchemaWP | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "schemaEncBytes_successFieldSpecs_length_le_48",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h0 := encode_bytes_length_le_9_of_length_le_8 d0 hl0\n have h1 := encode_bytes_length_l... | [
{
"name": "encode_bytes_length_le_21_of_length_eq_20",
"text": "private theorem encode_bytes_length_le_21_of_length_eq_20 (d : List Byte) (h : d.length = 20) :\n (encode (.bytes d)).length ≤ 21 := by\n cases d with\n | nil => simp at h\n | cons b tail =>\n cases tail with\n | nil => simp at ... | [
{
"name": "decodeWithdrawal_eq_some_of_successFieldSpecs_input",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 14,
"n_chars": 687,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"auto... | 4 | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | @@ -110,11 +110,31 @@
simp [hshort]
omega
+private theorem encode_bytes_length_le_21_of_length_eq_20 (d : List Byte) (h : d.length = 20) :
+ (encode (.bytes d)).length ≤ 21 := by
+ cases d with
+ | nil => simp at h
+ | cons b tail =>
+ cases tail with
+ | nil => simp at h
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5a3098fa9460_5 | d4dc4ed476edb5a2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WithdrawalSchemaWP.lean | WithdrawalSchemaWP | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "schemaEncBytes_successFieldSpecs_length_le_48",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h0 := encode_bytes_length_le_9_of_length_le_8 d0 hl0\n have h1 := encode_bytes_length_l... | [
{
"name": "encode_bytes_length_le_9_of_length_le_8",
"text": "private theorem encode_bytes_length_le_9_of_length_le_8 (d : List Byte) (h : d.length ≤ 8) :\n (encode (.bytes d)).length ≤ 9 := by\n unfold encode encodeBytes\n cases d with\n | nil => simp\n | cons b tail =>\n cases tail with\n ... | [
{
"name": "successFieldSpecs_input_of_decodeWithdrawal_eq_some",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 27,
"n_chars": 1489,
"n_subproofs": 3,
"n_tactics": 12,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 5,
"au... | 3 | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | @@ -95,6 +95,21 @@
schemaValid_of_concat bs outputSize tail (successFieldSpecs d0 d1 d2 d3) O
(successFieldSpecs_coreValid d0 d1 d2 d3 hl0 hl1 haddr hl3) hconcat
+private theorem encode_bytes_length_le_9_of_length_le_8 (d : List Byte) (h : d.length ≤ 8) :
+ (encode (.bytes d)).length ≤ 9 := by
+ unfold en... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5a3098fa9460_6 | 2906e9d48543ca92 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WithdrawalSchemaWP.lean | WithdrawalSchemaWP | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "schemaEncBytes_successFieldSpecs_length_le_48",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h0 := encode_bytes_length_le_9_of_length_le_8 d0 hl0\n have h1 := encode_bytes_length_l... | [
{
"name": "encode_bytes_length_le_21_of_length_eq_20",
"text": "private theorem encode_bytes_length_le_21_of_length_eq_20 (d : List Byte) (h : d.length = 20) :\n (encode (.bytes d)).length ≤ 21 := by\n cases d with\n | nil => simp at h\n | cons b tail =>\n cases tail with\n | nil => simp at ... | [
{
"name": "decodeWithdrawal_eq_some_iff_successFieldSpecs_input",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 21,
"n_chars": 991,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 4,
"aut... | 5 | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | @@ -110,11 +110,31 @@
simp [hshort]
omega
+private theorem encode_bytes_length_le_21_of_length_eq_20 (d : List Byte) (h : d.length = 20) :
+ (encode (.bytes d)).length ≤ 21 := by
+ cases d with
+ | nil => simp at h
+ | cons b tail =>
+ cases tail with
+ | nil => simp at h
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5a3098fa9460_7 | 4b14fb46cc5c906f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WithdrawalSchemaWP.lean | WithdrawalSchemaWP | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "schemaEncBytes_successFieldSpecs_length_le_48",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h0 := encode_bytes_length_le_9_of_length_le_8 d0 hl0\n have h1 := encode_bytes_length_l... | [
{
"name": "encode_bytes_length_le_21_of_length_eq_20",
"text": "private theorem encode_bytes_length_le_21_of_length_eq_20 (d : List Byte) (h : d.length = 20) :\n (encode (.bytes d)).length ≤ 21 := by\n cases d with\n | nil => simp at h\n | cons b tail =>\n cases tail with\n | nil => simp at ... | [
{
"name": "decodeWithdrawal_eq_none_iff_not_successFieldSpecsInput",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 23,
"n_chars": 962,
"n_subproofs": 1,
"n_tactics": 17,
"cyclomatic": 5,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 7,
... | 5 | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | @@ -110,11 +110,31 @@
simp [hshort]
omega
+private theorem encode_bytes_length_le_21_of_length_eq_20 (d : List Byte) (h : d.length = 20) :
+ (encode (.bytes d)).length ≤ 21 := by
+ cases d with
+ | nil => simp at h
+ | cons b tail =>
+ cases tail with
+ | nil => simp at h
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5a3098fa9460_8 | cdc5cad0dbd7f8db | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WithdrawalSchemaWP.lean | WithdrawalSchemaWP | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "successFieldSpecs_schemaOut_zeroed_eq_successBytes",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨b0, b1, b2, b3, b4, b5, b6, b7, b8, b9,\n b10, b11, b12, b13, b14, b15, b16, ... | [
{
"name": "exists_eq_list_of_length_eq_20",
"text": "private theorem exists_eq_list_of_length_eq_20 (d : List Byte) (h : d.length = 20) :\n ∃ b0 b1 b2 b3 b4 b5 b6 b7 b8 b9 b10 b11 b12 b13 b14 b15 b16 b17 b18 b19 : Byte,\n d = [b0, b1, b2, b3, b4, b5, b6, b7, b8, b9,\n b10, b11, b12, b13, b14,... | [
{
"name": "successFieldSpecs_schemaOut_zeroed_eq_successBytes",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 693,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"autom... | 1 | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | @@ -202,6 +202,35 @@
∧ d2.length = 20
∧ d3.headD 1 ≠ 0 ∧ d3.length ≤ 8
+private theorem exists_eq_list_of_length_eq_20 (d : List Byte) (h : d.length = 20) :
+ ∃ b0 b1 b2 b3 b4 b5 b6 b7 b8 b9 b10 b11 b12 b13 b14 b15 b16 b17 b18 b19 : Byte,
+ d = [b0, b1, b2, b3, b4, b5, b6, b7, b8, b9,
+ b... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5a3098fa9460_9 | 216d41d6297b5c4a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WithdrawalSchemaWP.lean | WithdrawalSchemaWP | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 3 | [
{
"theorem_name": "schemaCR_disjoint_statusReturnCode",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbase : (base + BitVec.ofNat 64 (schemaSize specs)).toNat =\n base.toNat + schemaSize specs :... | [
{
"name": "statusReturnCode_none_below",
"text": "/-- A status-return block rooted at `base` has no code requirements below `base`. -/\ntheorem statusReturnCode_none_below (base status a : Word)\n (hcode : base.toNat + 8 < 2 ^ 64) (hlt : a.toNat < base.toNat) :\n statusReturnCode base status a = none ... | [
{
"name": "schemaCR_disjoint_statusReturnCode",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 834,
"n_subproofs": 1,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 6,
"automation_only": fa... | 1 | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | @@ -384,6 +384,26 @@
rw [← successFieldSpecs_schemaOut_zeroed_eq_successBytes d0 d1 d2 d3 haddr]
simpa [outBytes] using hp)
+/-- A status-return block rooted at `base` has no code requirements below `base`. -/
+theorem statusReturnCode_none_below (base status a : Word)
+ (hcode : base.toNat + 8 < 2 ^ 64)... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5a3098fa9460_10 | f0f88a15e37b56d1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WithdrawalSchemaWP.lean | WithdrawalSchemaWP | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 2 | [
{
"theorem_name": "schemaCursorInitCode_disjoint_schemaCR",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbase4 : (base + 4).toNat = base.toNat + 4 := by\n bv_omega\n refine codeReq_disjoint_of_ra... | [
{
"name": "schemaCursorInitCode_none_above",
"text": "theorem schemaCursorInitCode_none_above (base a : Word)\n (h : base.toNat + 4 ≤ a.toNat) :\n schemaCursorInitCode base a = none := by\n unfold schemaCursorInitCode\n exact CodeReq.singleton_miss (by\n intro h_eq\n have := congrArg BitVec.to... | [
{
"name": "schemaCursorInitCode_disjoint_schemaCR",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 570,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 6,
"automation_only"... | 1 | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | @@ -538,6 +538,15 @@
exact WP.CFG.block
(schemaCursorInitPostRest_entails_schemaINV regionBase outBase raVal bs O outBytes) hspec
+theorem schemaCursorInitCode_none_above (base a : Word)
+ (h : base.toNat + 4 ≤ a.toNat) :
+ schemaCursorInitCode base a = none := by
+ unfold schemaCursorInitCode
+ exact... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5a3098fa9460_11 | 8f9ca838b15e0950 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WithdrawalSchemaWP.lean | WithdrawalSchemaWP | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "successFieldSpecsReturnAbiCertOfInput_pre",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold successFieldSpecsReturnAbiCertOfInput\n rw [successFieldSpecsReturnAbiCertOfConcat_pre]",... | [
{
"name": "successFieldSpecsReturnAbiCertOfConcat_pre",
"text": "/-- The composed success-path certificate reduces to the initial schema invariant\n plus the preserved return address; no decoded result appears in the precondition. -/\ntheorem successFieldSpecsReturnAbiCertOfConcat_pre\n (base regionBa... | [
{
"name": "successFieldSpecsReturnAbiCertOfInput_pre",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 24,
"n_chars": 1410,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_on... | 1 | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | @@ -726,6 +726,31 @@
(by simpa [successStatusReturnCode] using hcode)
exact WP.CFG.seqDisjoint hd schemaStrong.sound tailCert (WP.Entails.refl _)
+/-- The composed success-path certificate reduces to the initial schema invariant
+ plus the preserved return address; no decoded result appears in the precon... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5a3098fa9460_12 | e5bfda3c870f8644 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WithdrawalSchemaWP.lean | WithdrawalSchemaWP | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "successFieldSpecsReturnAbiCertOfInputFromListStartF8_pre",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold successFieldSpecsReturnAbiCertOfInputFromListStartF8\n change ((successFie... | [
{
"name": "successFieldSpecsReturnAbiCertOfInputFromListStart_pre",
"text": "theorem successFieldSpecsReturnAbiCertOfInputFromListStart_pre\n (base regionBase outBase raVal : Word)\n (bs d0 d1 d2 d3 : List Byte)\n (hc0 : d0.headD 1 ≠ 0) (hl0 : d0.length ≤ 8)\n (hc1 : d1.headD 1 ≠ 0) (hl1 : d1.le... | [
{
"name": "successFieldSpecsReturnAbiCertOfInputFromListStartF8_pre",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 28,
"n_chars": 1701,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 0,
... | 1 | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | @@ -852,6 +852,28 @@
rw [successFieldSpecsReturnAbiCertOfInput_pre]
exact WP.Entails.refl _)
+theorem successFieldSpecsReturnAbiCertOfInputFromListStart_pre
+ (base regionBase outBase raVal : Word)
+ (bs d0 d1 d2 d3 : List Byte)
+ (hc0 : d0.headD 1 ≠ 0) (hl0 : d0.length ≤ 8)
+ (hc1 : d1.headD 1 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5a3098fa9460_13 | e9b8a7b548596940 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WithdrawalSchemaWP.lean | WithdrawalSchemaWP | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "walkInitShortListCandidatePost_schemaWalkInitFrame_entails_walkShortExitPre",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h hp\n rw [successFieldSpecsReturnAbiCertOfInputFromWalk... | [
{
"name": "successFieldSpecsReturnAbiCertOfInputFromWalkShortExit_pre",
"text": "theorem successFieldSpecsReturnAbiCertOfInputFromWalkShortExit_pre\n (base regionBase outBase raVal : Word)\n (bs d0 d1 d2 d3 : List Byte)\n (hc0 : d0.headD 1 ≠ 0) (hl0 : d0.length ≤ 8)\n (hc1 : d1.headD 1 ≠ 0) (hl1... | [
{
"name": "walkInitShortListCandidatePost_schemaWalkInitFrame_entails_walkShortExitPre",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 29,
"n_chars": 1641,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_... | 2 | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | /-
EvmAsm.Rv64.RLP.WithdrawalSchemaWP
Withdrawal-specific adapters for the generic schema WP calculus. The static
ABI schema in `WithdrawalDecode` remains result-free; this file packages the
success-path field byte witnesses into generic `FieldSpec`s and proves the
validity/canonicality facts that generated... | @@ -998,6 +998,29 @@
rw [successFieldSpecsReturnAbiCertOfInputFromListStartF8_pre]
simpa [sepConj_emp_left'] using hp)
+theorem successFieldSpecsReturnAbiCertOfInputFromWalkShortExit_pre
+ (base regionBase outBase raVal : Word)
+ (bs d0 d1 d2 d3 : List Byte)
+ (hc0 : d0.headD 1 ≠ 0) (hl0 : d0.lengt... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c11a0b58d0a8_0 | b5281ad426ca65c6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/CreateArgsStackDecode.lean | CreateArgsStackDecode | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "decodeCreateStack?_eq_some_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases kind with\n | create => exact decodeCreateStack?_create_eq_some_iff stack decoded\n | create2 => exa... | [
{
"name": "decodeCreateStack?_create_eq_some_iff",
"text": "theorem decodeCreateStack?_create_eq_some_iff\n (stack : List EvmWord) (decoded : Decoded) :\n decodeCreateStack? .create stack = some decoded ↔\n ∃ value offset size rest,\n stack = value :: offset :: size :: rest ∧\n de... | [
{
"name": "decodeCreateStack?_eq_some_iff",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 17,
"n_chars": 717,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.CreateArgsStackDecode
Pure top-of-stack decoders for CREATE and CREATE2 arguments (GH #115).
-/
import EvmAsm.Evm64.CreateArgs
namespace EvmAsm.Evm64
namespace CreateArgsStackDecode
open CreateArgs
inductive Decoded where
| create (args : Create)
| create2 (args : Create2)
deriving Repr
... | /-
EvmAsm.Evm64.CreateArgsStackDecode
Pure top-of-stack decoders for CREATE and CREATE2 arguments (GH #115).
-/
import EvmAsm.Evm64.CreateArgs
namespace EvmAsm.Evm64
namespace CreateArgsStackDecode
open CreateArgs
inductive Decoded where
| create (args : Create)
| create2 (args : Create2)
deriving Repr
... | @@ -64,6 +64,21 @@
some (.create2 (mkCreate2 value offset size salt))
| _, _ => none
+theorem decodeCreateStack?_create_eq_some_iff
+ (stack : List EvmWord) (decoded : Decoded) :
+ decodeCreateStack? .create stack = some decoded ↔
+ ∃ value offset size rest,
+ stack = value :: offset :: si... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c11a0b58d0a8_1 | 80d17ef095f8fbb2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/CreateArgsStackDecode.lean | CreateArgsStackDecode | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "decodeCreateStack?_eq_some_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases kind with\n | create => exact decodeCreateStack?_create_eq_some_iff stack decoded\n | create2 => exa... | [
{
"name": "decodeCreateStack?_create_eq_some_iff",
"text": "theorem decodeCreateStack?_create_eq_some_iff\n (stack : List EvmWord) (decoded : Decoded) :\n decodeCreateStack? .create stack = some decoded ↔\n ∃ value offset size rest,\n stack = value :: offset :: size :: rest ∧\n de... | [
{
"name": "decodeCreateStack?_create_kind_of_some",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 358,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only":... | 1 | /-
EvmAsm.Evm64.CreateArgsStackDecode
Pure top-of-stack decoders for CREATE and CREATE2 arguments (GH #115).
-/
import EvmAsm.Evm64.CreateArgs
namespace EvmAsm.Evm64
namespace CreateArgsStackDecode
open CreateArgs
inductive Decoded where
| create (args : Create)
| create2 (args : Create2)
deriving Repr
... | /-
EvmAsm.Evm64.CreateArgsStackDecode
Pure top-of-stack decoders for CREATE and CREATE2 arguments (GH #115).
-/
import EvmAsm.Evm64.CreateArgs
namespace EvmAsm.Evm64
namespace CreateArgsStackDecode
open CreateArgs
inductive Decoded where
| create (args : Create)
| create2 (args : Create2)
deriving Repr
... | @@ -64,10 +64,29 @@
some (.create2 (mkCreate2 value offset size salt))
| _, _ => none
+theorem decodeCreateStack?_create_eq_some_iff
+ (stack : List EvmWord) (decoded : Decoded) :
+ decodeCreateStack? .create stack = some decoded ↔
+ ∃ value offset size rest,
+ stack = value :: offset :: s... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c11a0b58d0a8_2 | 75975971d7e459a0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/CreateArgsStackDecode.lean | CreateArgsStackDecode | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "decodeCreateStack?_eq_some_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases kind with\n | create => exact decodeCreateStack?_create_eq_some_iff stack decoded\n | create2 => exa... | [
{
"name": "decodeCreateStack?_create2_eq_some_iff",
"text": "theorem decodeCreateStack?_create2_eq_some_iff\n (stack : List EvmWord) (decoded : Decoded) :\n decodeCreateStack? .create2 stack = some decoded ↔\n ∃ value offset size salt rest,\n stack = value :: offset :: size :: salt :: rest... | [
{
"name": "decodeCreateStack?_create2_kind_of_some",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 368,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only"... | 1 | /-
EvmAsm.Evm64.CreateArgsStackDecode
Pure top-of-stack decoders for CREATE and CREATE2 arguments (GH #115).
-/
import EvmAsm.Evm64.CreateArgs
namespace EvmAsm.Evm64
namespace CreateArgsStackDecode
open CreateArgs
inductive Decoded where
| create (args : Create)
| create2 (args : Create2)
deriving Repr
... | /-
EvmAsm.Evm64.CreateArgsStackDecode
Pure top-of-stack decoders for CREATE and CREATE2 arguments (GH #115).
-/
import EvmAsm.Evm64.CreateArgs
namespace EvmAsm.Evm64
namespace CreateArgsStackDecode
open CreateArgs
inductive Decoded where
| create (args : Create)
| create2 (args : Create2)
deriving Repr
... | @@ -64,10 +64,29 @@
some (.create2 (mkCreate2 value offset size salt))
| _, _ => none
+theorem decodeCreateStack?_create2_eq_some_iff
+ (stack : List EvmWord) (decoded : Decoded) :
+ decodeCreateStack? .create2 stack = some decoded ↔
+ ∃ value offset size salt rest,
+ stack = value :: offs... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c11a0b58d0a8_3 | 1b27e1133f21a524 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/CreateArgsStackDecode.lean | CreateArgsStackDecode | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "decodeCreateStack?_eq_some_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases kind with\n | create => exact decodeCreateStack?_create_eq_some_iff stack decoded\n | create2 => exa... | [
{
"name": "decodeCreateStack?_create_eq_some_iff",
"text": "theorem decodeCreateStack?_create_eq_some_iff\n (stack : List EvmWord) (decoded : Decoded) :\n decodeCreateStack? .create stack = some decoded ↔\n ∃ value offset size rest,\n stack = value :: offset :: size :: rest ∧\n de... | [
{
"name": "decodeCreateStack?_kind_of_some",
"fan_in": 4,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 9,
"n_chars": 359,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
... | 4 | /-
EvmAsm.Evm64.CreateArgsStackDecode
Pure top-of-stack decoders for CREATE and CREATE2 arguments (GH #115).
-/
import EvmAsm.Evm64.CreateArgs
namespace EvmAsm.Evm64
namespace CreateArgsStackDecode
open CreateArgs
inductive Decoded where
| create (args : Create)
| create2 (args : Create2)
deriving Repr
... | /-
EvmAsm.Evm64.CreateArgsStackDecode
Pure top-of-stack decoders for CREATE and CREATE2 arguments (GH #115).
-/
import EvmAsm.Evm64.CreateArgs
namespace EvmAsm.Evm64
namespace CreateArgsStackDecode
open CreateArgs
inductive Decoded where
| create (args : Create)
| create2 (args : Create2)
deriving Repr
... | @@ -64,6 +64,21 @@
some (.create2 (mkCreate2 value offset size salt))
| _, _ => none
+theorem decodeCreateStack?_create_eq_some_iff
+ (stack : List EvmWord) (decoded : Decoded) :
+ decodeCreateStack? .create stack = some decoded ↔
+ ∃ value offset size rest,
+ stack = value :: offset :: si... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c11a0b58d0a8_4 | 2ca9e3d4143175bb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/CreateArgsStackDecode.lean | CreateArgsStackDecode | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "decodeCreateStack?_eq_some_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases kind with\n | create => exact decodeCreateStack?_create_eq_some_iff stack decoded\n | create2 => exa... | [
{
"name": "decodeCreateStack?_create_eq_some_iff",
"text": "theorem decodeCreateStack?_create_eq_some_iff\n (stack : List EvmWord) (decoded : Decoded) :\n decodeCreateStack? .create stack = some decoded ↔\n ∃ value offset size rest,\n stack = value :: offset :: size :: rest ∧\n de... | [
{
"name": "decodeCreateStack?_usesSalt_of_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 7,
"n_chars": 285,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fal... | 5 | /-
EvmAsm.Evm64.CreateArgsStackDecode
Pure top-of-stack decoders for CREATE and CREATE2 arguments (GH #115).
-/
import EvmAsm.Evm64.CreateArgs
namespace EvmAsm.Evm64
namespace CreateArgsStackDecode
open CreateArgs
inductive Decoded where
| create (args : Create)
| create2 (args : Create2)
deriving Repr
... | /-
EvmAsm.Evm64.CreateArgsStackDecode
Pure top-of-stack decoders for CREATE and CREATE2 arguments (GH #115).
-/
import EvmAsm.Evm64.CreateArgs
namespace EvmAsm.Evm64
namespace CreateArgsStackDecode
open CreateArgs
inductive Decoded where
| create (args : Create)
| create2 (args : Create2)
deriving Repr
... | @@ -64,6 +64,21 @@
some (.create2 (mkCreate2 value offset size salt))
| _, _ => none
+theorem decodeCreateStack?_create_eq_some_iff
+ (stack : List EvmWord) (decoded : Decoded) :
+ decodeCreateStack? .create stack = some decoded ↔
+ ∃ value offset size rest,
+ stack = value :: offset :: si... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c11a0b58d0a8_5 | 8ef677d513f2330c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/CreateArgsStackDecode.lean | CreateArgsStackDecode | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "decodeCreateStack?_eq_some_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases kind with\n | create => exact decodeCreateStack?_create_eq_some_iff stack decoded\n | create2 => exa... | [
{
"name": "decodeCreateStack?_create_eq_some_iff",
"text": "theorem decodeCreateStack?_create_eq_some_iff\n (stack : List EvmWord) (decoded : Decoded) :\n decodeCreateStack? .create stack = some decoded ↔\n ∃ value offset size rest,\n stack = value :: offset :: size :: rest ∧\n de... | [
{
"name": "decodeCreateStack?_argumentCount_of_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 7,
"n_chars": 305,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only"... | 5 | /-
EvmAsm.Evm64.CreateArgsStackDecode
Pure top-of-stack decoders for CREATE and CREATE2 arguments (GH #115).
-/
import EvmAsm.Evm64.CreateArgs
namespace EvmAsm.Evm64
namespace CreateArgsStackDecode
open CreateArgs
inductive Decoded where
| create (args : Create)
| create2 (args : Create2)
deriving Repr
... | /-
EvmAsm.Evm64.CreateArgsStackDecode
Pure top-of-stack decoders for CREATE and CREATE2 arguments (GH #115).
-/
import EvmAsm.Evm64.CreateArgs
namespace EvmAsm.Evm64
namespace CreateArgsStackDecode
open CreateArgs
inductive Decoded where
| create (args : Create)
| create2 (args : Create2)
deriving Repr
... | @@ -64,6 +64,21 @@
some (.create2 (mkCreate2 value offset size salt))
| _, _ => none
+theorem decodeCreateStack?_create_eq_some_iff
+ (stack : List EvmWord) (decoded : Decoded) :
+ decodeCreateStack? .create stack = some decoded ↔
+ ∃ value offset size rest,
+ stack = value :: offset :: si... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c11a0b58d0a8_6 | 58398d29922c80a0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/CreateArgsStackDecode.lean | CreateArgsStackDecode | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "decodeCreateStack?_eq_some_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases kind with\n | create => exact decodeCreateStack?_create_eq_some_iff stack decoded\n | create2 => exa... | [
{
"name": "decodeCreateStack?_create_eq_some_iff",
"text": "theorem decodeCreateStack?_create_eq_some_iff\n (stack : List EvmWord) (decoded : Decoded) :\n decodeCreateStack? .create stack = some decoded ↔\n ∃ value offset size rest,\n stack = value :: offset :: size :: rest ∧\n de... | [
{
"name": "decodeCreateStack?_resultCount_of_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 7,
"n_chars": 297,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": ... | 5 | /-
EvmAsm.Evm64.CreateArgsStackDecode
Pure top-of-stack decoders for CREATE and CREATE2 arguments (GH #115).
-/
import EvmAsm.Evm64.CreateArgs
namespace EvmAsm.Evm64
namespace CreateArgsStackDecode
open CreateArgs
inductive Decoded where
| create (args : Create)
| create2 (args : Create2)
deriving Repr
... | /-
EvmAsm.Evm64.CreateArgsStackDecode
Pure top-of-stack decoders for CREATE and CREATE2 arguments (GH #115).
-/
import EvmAsm.Evm64.CreateArgs
namespace EvmAsm.Evm64
namespace CreateArgsStackDecode
open CreateArgs
inductive Decoded where
| create (args : Create)
| create2 (args : Create2)
deriving Repr
... | @@ -64,6 +64,21 @@
some (.create2 (mkCreate2 value offset size salt))
| _, _ => none
+theorem decodeCreateStack?_create_eq_some_iff
+ (stack : List EvmWord) (decoded : Decoded) :
+ decodeCreateStack? .create stack = some decoded ↔
+ ∃ value offset size rest,
+ stack = value :: offset :: si... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c11a0b58d0a8_7 | dd50ba9075572c67 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/CreateArgsStackDecode.lean | CreateArgsStackDecode | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "decodeCreateStack?_eq_some_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases kind with\n | create => exact decodeCreateStack?_create_eq_some_iff stack decoded\n | create2 => exa... | [
{
"name": "decodeCreateStack?_create_eq_some_iff",
"text": "theorem decodeCreateStack?_create_eq_some_iff\n (stack : List EvmWord) (decoded : Decoded) :\n decodeCreateStack? .create stack = some decoded ↔\n ∃ value offset size rest,\n stack = value :: offset :: size :: rest ∧\n de... | [
{
"name": "decodeCreateStack?_initcodeRangeCount_of_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 7,
"n_chars": 325,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_... | 5 | /-
EvmAsm.Evm64.CreateArgsStackDecode
Pure top-of-stack decoders for CREATE and CREATE2 arguments (GH #115).
-/
import EvmAsm.Evm64.CreateArgs
namespace EvmAsm.Evm64
namespace CreateArgsStackDecode
open CreateArgs
inductive Decoded where
| create (args : Create)
| create2 (args : Create2)
deriving Repr
... | /-
EvmAsm.Evm64.CreateArgsStackDecode
Pure top-of-stack decoders for CREATE and CREATE2 arguments (GH #115).
-/
import EvmAsm.Evm64.CreateArgs
namespace EvmAsm.Evm64
namespace CreateArgsStackDecode
open CreateArgs
inductive Decoded where
| create (args : Create)
| create2 (args : Create2)
deriving Repr
... | @@ -64,6 +64,21 @@
some (.create2 (mkCreate2 value offset size salt))
| _, _ => none
+theorem decodeCreateStack?_create_eq_some_iff
+ (stack : List EvmWord) (decoded : Decoded) :
+ decodeCreateStack? .create stack = some decoded ↔
+ ∃ value offset size rest,
+ stack = value :: offset :: si... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c11a0b58d0a8_8 | acff0b3c4c833989 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/CreateArgsStackDecode.lean | CreateArgsStackDecode | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "decodeCreateStack?_eq_none_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases kind with\n | create => exact decodeCreateStack?_create_eq_none_iff stack\n | create2 => exact decod... | [
{
"name": "decodeCreateStack?_create_eq_none_iff",
"text": "theorem decodeCreateStack?_create_eq_none_iff (stack : List EvmWord) :\n decodeCreateStack? .create stack = none ↔ stack.length < argumentCount .create := by\n constructor\n · intro h_decode\n rcases stack with _ | ⟨_, _ | ⟨_, _ | ⟨_, _⟩⟩⟩\... | [
{
"name": "decodeCreateStack?_eq_none_iff",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 312,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.CreateArgsStackDecode
Pure top-of-stack decoders for CREATE and CREATE2 arguments (GH #115).
-/
import EvmAsm.Evm64.CreateArgs
namespace EvmAsm.Evm64
namespace CreateArgsStackDecode
open CreateArgs
inductive Decoded where
| create (args : Create)
| create2 (args : Create2)
deriving Repr
... | /-
EvmAsm.Evm64.CreateArgsStackDecode
Pure top-of-stack decoders for CREATE and CREATE2 arguments (GH #115).
-/
import EvmAsm.Evm64.CreateArgs
namespace EvmAsm.Evm64
namespace CreateArgsStackDecode
open CreateArgs
inductive Decoded where
| create (args : Create)
| create2 (args : Create2)
deriving Repr
... | @@ -64,6 +64,23 @@
some (.create2 (mkCreate2 value offset size salt))
| _, _ => none
+theorem decodeCreateStack?_create_eq_none_iff (stack : List EvmWord) :
+ decodeCreateStack? .create stack = none ↔ stack.length < argumentCount .create := by
+ constructor
+ · intro h_decode
+ rcases stack with _ |... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9738ceeea606_0 | d4b8cdb9f3e4fc28 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceOuterInduction.lean | ReduceOuterInduction | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "outer_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 74,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction m with\n | zero => intro h1 _; omega\n | succ k ih =>\n intro _ h8 sp base ptr r n limbs\n rcases Nat.eq_zero_... | [
{
"name": "limbChain_succ",
"text": "/-- Peel the head limb off the window: the limb at `ptr` (the next to be\n consumed) splits off, leaving the remaining `m` limbs as a window starting\n 8 bytes lower. This is the step the eight-limb induction takes each\n iteration — the body folds `limbs 0`, th... | [
{
"name": "outer_aux",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 90,
"n_chars": 4906,
"n_subproofs": 13,
"n_tactics": 71,
"cyclomatic": 3,
"n_automation": 13,
"n_rewrites": 18,
"n_structural": 12,
"automation_only": false,
"max_nestin... | 2 | /-
EvmAsm.Evm64.MulMod.ReduceOuterInduction
Eight-limb induction for the MULMOD 512-bit reducer outer loop. The outer
loop walks the eight 64-bit product limbs from high to low (`x16` starts at
the top limb and decreases by 8 each iteration), folding each into the
running remainder via the inner bit loop. Un... | /-
EvmAsm.Evm64.MulMod.ReduceOuterInduction
Eight-limb induction for the MULMOD 512-bit reducer outer loop. The outer
loop walks the eight 64-bit product limbs from high to low (`x16` starts at
the top limb and decreases by 8 each iteration), folding each into the
running remainder via the inner bit loop. Un... | @@ -34,6 +34,17 @@
@[simp] theorem limbChain_zero (ptr : Word) (limbs : Nat → Word) :
limbChain ptr limbs 0 = empAssertion := rfl
+/-- Peel the head limb off the window: the limb at `ptr` (the next to be
+ consumed) splits off, leaving the remaining `m` limbs as a window starting
+ 8 bytes lower. This is ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9738ceeea606_1 | 0243f2c2ef762350 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceOuterInduction.lean | ReduceOuterInduction | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "outer_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 74,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction m with\n | zero => intro h1 _; omega\n | succ k ih =>\n intro _ h8 sp base ptr r n limbs\n rcases Nat.eq_zero_... | [
{
"name": "limbChain_succ",
"text": "/-- Peel the head limb off the window: the limb at `ptr` (the next to be\n consumed) splits off, leaving the remaining `m` limbs as a window starting\n 8 bytes lower. This is the step the eight-limb induction takes each\n iteration — the body folds `limbs 0`, th... | [
{
"name": "evm_mulmod_reduce512_loop_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 13,
"n_chars": 699,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": ... | 3 | /-
EvmAsm.Evm64.MulMod.ReduceOuterInduction
Eight-limb induction for the MULMOD 512-bit reducer outer loop. The outer
loop walks the eight 64-bit product limbs from high to low (`x16` starts at
the top limb and decreases by 8 each iteration), folding each into the
running remainder via the inner bit loop. Un... | /-
EvmAsm.Evm64.MulMod.ReduceOuterInduction
Eight-limb induction for the MULMOD 512-bit reducer outer loop. The outer
loop walks the eight 64-bit product limbs from high to low (`x16` starts at
the top limb and decreases by 8 each iteration), folding each into the
running remainder via the inner bit loop. Un... | @@ -34,6 +34,17 @@
@[simp] theorem limbChain_zero (ptr : Word) (limbs : Nat → Word) :
limbChain ptr limbs 0 = empAssertion := rfl
+/-- Peel the head limb off the window: the limb at `ptr` (the next to be
+ consumed) splits off, leaving the remaining `m` limbs as a window starting
+ 8 bytes lower. This is ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9738ceeea606_2 | 60d5201c78880831 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceOuterInduction.lean | ReduceOuterInduction | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "outer_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 74,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction m with\n | zero => intro h1 _; omega\n | succ k ih =>\n intro _ h8 sp base ptr r n limbs\n rcases Nat.eq_zero_... | [
{
"name": "limbChain_succ",
"text": "/-- Peel the head limb off the window: the limb at `ptr` (the next to be\n consumed) splits off, leaving the remaining `m` limbs as a window starting\n 8 bytes lower. This is the step the eight-limb induction takes each\n iteration — the body folds `limbs 0`, th... | [
{
"name": "evm_mulmod_reduce512_loop_total_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 15,
"n_chars": 862,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_o... | 5 | /-
EvmAsm.Evm64.MulMod.ReduceOuterInduction
Eight-limb induction for the MULMOD 512-bit reducer outer loop. The outer
loop walks the eight 64-bit product limbs from high to low (`x16` starts at
the top limb and decreases by 8 each iteration), folding each into the
running remainder via the inner bit loop. Un... | /-
EvmAsm.Evm64.MulMod.ReduceOuterInduction
Eight-limb induction for the MULMOD 512-bit reducer outer loop. The outer
loop walks the eight 64-bit product limbs from high to low (`x16` starts at
the top limb and decreases by 8 each iteration), folding each into the
running remainder via the inner bit loop. Un... | @@ -34,6 +34,17 @@
@[simp] theorem limbChain_zero (ptr : Word) (limbs : Nat → Word) :
limbChain ptr limbs 0 = empAssertion := rfl
+/-- Peel the head limb off the window: the limb at `ptr` (the next to be
+ consumed) splits off, leaving the remaining `m` limbs as a window starting
+ 8 bytes lower. This is ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9738ceeea606_3 | 1da64b585b725d3e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceOuterInduction.lean | ReduceOuterInduction | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_init_total_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (hmono := evm_mulmod_reduce512_init_code_sub base)\n (h := evm... | [
{
"name": "evm_mulmod_reduce512_init_code_sub",
"text": "/-- `evm_mulmod_reduce512_init` is the prefix (byte offset 0) of the total\n reducer program. -/\ntheorem evm_mulmod_reduce512_init_code_sub (base : Word) :\n ∀ a i, (CodeReq.ofProg base evm_mulmod_reduce512_init) a = some i →\n (CodeReq.of... | [
{
"name": "evm_mulmod_reduce512_init_total_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 21,
"n_chars": 1287,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_... | 1 | /-
EvmAsm.Evm64.MulMod.ReduceOuterInduction
Eight-limb induction for the MULMOD 512-bit reducer outer loop. The outer
loop walks the eight 64-bit product limbs from high to low (`x16` starts at
the top limb and decreases by 8 each iteration), folding each into the
running remainder via the inner bit loop. Un... | /-
EvmAsm.Evm64.MulMod.ReduceOuterInduction
Eight-limb induction for the MULMOD 512-bit reducer outer loop. The outer
loop walks the eight 64-bit product limbs from high to low (`x16` starts at
the top limb and decreases by 8 each iteration), folding each into the
running remainder via the inner bit loop. Un... | @@ -45,6 +45,16 @@
regOwn .x17 ** regOwn .x15 ** regOwn .x19 ** regOwn .x20 **
mulModReduceCompareMem sp r n
+/-- `evm_mulmod_reduce512_init` is the prefix (byte offset 0) of the total
+ reducer program. -/
+theorem evm_mulmod_reduce512_init_code_sub (base : Word) :
+ ∀ a i, (CodeReq.ofProg base evm_mulmo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9738ceeea606_4 | 62e52d5765a24f36 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceOuterInduction.lean | ReduceOuterInduction | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_write_result_total_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (hmono := evm_mulmod_reduce512_write_result_code_sub base... | [
{
"name": "evm_mulmod_reduce512_write_result_code_sub",
"text": "/-- `evm_mulmod_reduce512_write_result` sits at byte offset 308 (after `init`\n and the 71-instruction `loop`) within the total reducer program. -/\ntheorem evm_mulmod_reduce512_write_result_code_sub (base : Word) :\n ∀ a i, (CodeReq.ofP... | [
{
"name": "evm_mulmod_reduce512_write_result_total_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 29,
"n_chars": 1652,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"aut... | 1 | /-
EvmAsm.Evm64.MulMod.ReduceOuterInduction
Eight-limb induction for the MULMOD 512-bit reducer outer loop. The outer
loop walks the eight 64-bit product limbs from high to low (`x16` starts at
the top limb and decreases by 8 each iteration), folding each into the
running remainder via the inner bit loop. Un... | /-
EvmAsm.Evm64.MulMod.ReduceOuterInduction
Eight-limb induction for the MULMOD 512-bit reducer outer loop. The outer
loop walks the eight 64-bit product limbs from high to low (`x16` starts at
the top limb and decreases by 8 each iteration), folding each into the
running remainder via the inner bit loop. Un... | @@ -45,6 +45,23 @@
regOwn .x17 ** regOwn .x15 ** regOwn .x19 ** regOwn .x20 **
mulModReduceCompareMem sp r n
+/-- `evm_mulmod_reduce512_write_result` sits at byte offset 308 (after `init`
+ and the 71-instruction `loop`) within the total reducer program. -/
+theorem evm_mulmod_reduce512_write_result_code_sub... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9738ceeea606_5 | aced1cdba8b0ecec | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceOuterInduction.lean | ReduceOuterInduction | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "evm_mulmod_epilogue_total_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (hmono := evm_mulmod_epilogue_code_sub base)\n (h := evm_mulmod_epil... | [
{
"name": "evm_mulmod_epilogue_code_sub",
"text": "/-- `evm_mulmod_epilogue` is the final instruction (byte offset 340) of the\n total reducer program. -/\ntheorem evm_mulmod_epilogue_code_sub (base : Word) :\n ∀ a i, (CodeReq.ofProg (base + BitVec.ofNat 64 340) evm_mulmod_epilogue) a = some i →\n ... | [
{
"name": "evm_mulmod_epilogue_total_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 550,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": ... | 1 | /-
EvmAsm.Evm64.MulMod.ReduceOuterInduction
Eight-limb induction for the MULMOD 512-bit reducer outer loop. The outer
loop walks the eight 64-bit product limbs from high to low (`x16` starts at
the top limb and decreases by 8 each iteration), folding each into the
running remainder via the inner bit loop. Un... | /-
EvmAsm.Evm64.MulMod.ReduceOuterInduction
Eight-limb induction for the MULMOD 512-bit reducer outer loop. The outer
loop walks the eight 64-bit product limbs from high to low (`x16` starts at
the top limb and decreases by 8 each iteration), folding each into the
running remainder via the inner bit loop. Un... | @@ -45,12 +45,36 @@
regOwn .x17 ** regOwn .x15 ** regOwn .x19 ** regOwn .x20 **
mulModReduceCompareMem sp r n
+/-- `evm_mulmod_epilogue` is the final instruction (byte offset 340) of the
+ total reducer program. -/
+theorem evm_mulmod_epilogue_code_sub (base : Word) :
+ ∀ a i, (CodeReq.ofProg (base + BitV... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9738ceeea606_6 | def267966c8a86d4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceOuterInduction.lean | ReduceOuterInduction | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "outer_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 74,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction m with\n | zero => intro h1 _; omega\n | succ k ih =>\n intro _ h8 sp base ptr r n limbs\n rcases Nat.eq_zero_... | [
{
"name": "limbChain_succ",
"text": "/-- Peel the head limb off the window: the limb at `ptr` (the next to be\n consumed) splits off, leaving the remaining `m` limbs as a window starting\n 8 bytes lower. This is the step the eight-limb induction takes each\n iteration — the body folds `limbs 0`, th... | [
{
"name": "evm_mulmod_reduce512_init_loop_spec_within",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 9,
"n_lines": 45,
"n_chars": 2932,
"n_subproofs": 1,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 2,
"automation_... | 8 | /-
EvmAsm.Evm64.MulMod.ReduceOuterInduction
Eight-limb induction for the MULMOD 512-bit reducer outer loop. The outer
loop walks the eight 64-bit product limbs from high to low (`x16` starts at
the top limb and decreases by 8 each iteration), folding each into the
running remainder via the inner bit loop. Un... | /-
EvmAsm.Evm64.MulMod.ReduceOuterInduction
Eight-limb induction for the MULMOD 512-bit reducer outer loop. The outer
loop walks the eight 64-bit product limbs from high to low (`x16` starts at
the top limb and decreases by 8 each iteration), folding each into the
running remainder via the inner bit loop. Un... | @@ -34,6 +34,17 @@
@[simp] theorem limbChain_zero (ptr : Word) (limbs : Nat → Word) :
limbChain ptr limbs 0 = empAssertion := rfl
+/-- Peel the head limb off the window: the limb at `ptr` (the next to be
+ consumed) splits off, leaving the remaining `m` limbs as a window starting
+ 8 bytes lower. This is ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "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.