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_3b734c2405df_0 | e222eddca3c2512c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallablePost.lean | CallablePost | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "divStackDispatchPostCallableExactFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [divStackDispatchPostCallableExactFrame_unfold,\n divStackDispatchPostCallable_unfold, ... | [
{
"name": "divStackDispatchPostCallableExactFrame_unfold",
"text": "theorem divStackDispatchPostCallableExactFrame_unfold\n {sp : Word} {a b : EvmWord} {raVal x9Val : Word} :\n divStackDispatchPostCallableExactFrame sp a b raVal x9Val =\n ((divStackDispatchPostCallable sp a b ** (.x1 ↦ᵣ raVal)) *... | [
{
"name": "divStackDispatchPostCallableExactFrame_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 320,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | @@ -19,9 +19,20 @@
(divStackDispatchPostCallable sp a b ** (.x1 ↦ᵣ raVal)) **
(.x9 ↦ᵣ x9Val)
+theorem divStackDispatchPostCallableExactFrame_unfold
+ {sp : Word} {a b : EvmWord} {raVal x9Val : Word} :
+ divStackDispatchPostCallableExactFrame sp a b raVal x9Val =
+ ((divStackDispatchPostCallable sp ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b734c2405df_1 | 4526dee1daea3f5c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallablePost.lean | CallablePost | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "divConcretePostNoX1Frame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [divConcretePostNoX1Frame_unfold, divScratchValuesCallNoX1_unfold,\n divScratchValues_unfold]\n pcFr... | [
{
"name": "divConcretePostNoX1Frame_unfold",
"text": "theorem divConcretePostNoX1Frame_unfold\n {sp : Word} {a b : EvmWord}\n {x9Val raVal v2 v6 v7 v11 : Word}\n {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7\n shiftMem nMem jMem retMem dMem dloMem scratch_un0 : Word} :\n divConcretePostNoX1Frame sp a... | [
{
"name": "divConcretePostNoX1Frame_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 501,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | @@ -35,6 +35,24 @@
divScratchValuesCallNoX1 sp q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
shiftMem nMem jMem retMem dMem dloMem scratch_un0))
+theorem divConcretePostNoX1Frame_unfold
+ {sp : Word} {a b : EvmWord}
+ {x9Val raVal v2 v6 v7 v11 : Word}
+ {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
+ shiftM... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b734c2405df_2 | 383995dbca0a15f6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallablePost.lean | CallablePost | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "divConcretePostNoX1ExactRegsFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [divConcretePostNoX1ExactRegsFrame_unfold, divScratchValuesCallNoX1_unfold,\n divScratchValu... | [
{
"name": "divConcretePostNoX1ExactRegsFrame_unfold",
"text": "theorem divConcretePostNoX1ExactRegsFrame_unfold\n {sp : Word} {a b : EvmWord}\n {x9Val raVal v2 v5 v6 v7 v10 v11 : Word}\n {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7\n shiftMem nMem jMem retMem dMem dloMem scratch_un0 : Word} :\n divC... | [
{
"name": "divConcretePostNoX1ExactRegsFrame_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 542,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | @@ -50,6 +50,24 @@
divScratchValuesCallNoX1 sp q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
shiftMem nMem jMem retMem dMem dloMem scratch_un0))
+theorem divConcretePostNoX1ExactRegsFrame_unfold
+ {sp : Word} {a b : EvmWord}
+ {x9Val raVal v2 v5 v6 v7 v10 v11 : Word}
+ {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b734c2405df_3 | 35e063603ecf72a9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallablePost.lean | CallablePost | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "divConcretePostNoX1ExactRegsFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [divConcretePostNoX1ExactRegsFrame_unfold, divScratchValuesCallNoX1_unfold,\n divScratchValu... | [
{
"name": "divConcretePostNoX1ExactRegsFrame_unfold",
"text": "theorem divConcretePostNoX1ExactRegsFrame_unfold\n {sp : Word} {a b : EvmWord}\n {x9Val raVal v2 v5 v6 v7 v10 v11 : Word}\n {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7\n shiftMem nMem jMem retMem dMem dloMem scratch_un0 : Word} :\n divC... | [
{
"name": "divConcretePostNoX1ExactRegs_weaken_callable_frame",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 42,
"n_chars": 2035,
"n_subproofs": 1,
"n_tactics": 28,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 16,
"au... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | @@ -50,6 +50,24 @@
divScratchValuesCallNoX1 sp q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
shiftMem nMem jMem retMem dMem dloMem scratch_un0))
+theorem divConcretePostNoX1ExactRegsFrame_unfold
+ {sp : Word} {a b : EvmWord}
+ {x9Val raVal v2 v5 v6 v7 v10 v11 : Word}
+ {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b734c2405df_4 | 0cf63dff0ed92d90 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallablePost.lean | CallablePost | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "divConcretePostNoX1Frame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [divConcretePostNoX1Frame_unfold, divScratchValuesCallNoX1_unfold,\n divScratchValues_unfold]\n pcFr... | [
{
"name": "divConcretePostNoX1Frame_unfold",
"text": "theorem divConcretePostNoX1Frame_unfold\n {sp : Word} {a b : EvmWord}\n {x9Val raVal v2 v6 v7 v11 : Word}\n {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7\n shiftMem nMem jMem retMem dMem dloMem scratch_un0 : Word} :\n divConcretePostNoX1Frame sp a... | [
{
"name": "divConcretePostNoX1_weaken_callable_frame",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 39,
"n_chars": 1855,
"n_subproofs": 1,
"n_tactics": 25,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 14,
"automation_... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | @@ -35,6 +35,24 @@
divScratchValuesCallNoX1 sp q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
shiftMem nMem jMem retMem dMem dloMem scratch_un0))
+theorem divConcretePostNoX1Frame_unfold
+ {sp : Word} {a b : EvmWord}
+ {x9Val raVal v2 v6 v7 v11 : Word}
+ {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
+ shiftM... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b734c2405df_5 | 6b36668fae9ff974 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallablePost.lean | CallablePost | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "divStackDispatchPostNoX1_weaken_callable_own_x1_frame_x9",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h hp\n apply sepConj_mono_left\n · exact fun hLeft hpLeft =>\n divSta... | [
{
"name": "divStackDispatchPostNoX1_weaken_callable_own_x1",
"text": "/-- Split the historical no-`x1` DIV stack post into the callable public post\n plus separate `x1` ownership. This is the ownership-only bridge; exact\n return-address preservation requires a stronger upstream post. -/\ntheorem divS... | [
{
"name": "divStackDispatchPostNoX1_weaken_callable_own_x1_frame_x9",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 586,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 4,
... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | @@ -50,6 +50,21 @@
divScratchValuesCallNoX1 sp q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
shiftMem nMem jMem retMem dMem dloMem scratch_un0))
+/-- Split the historical no-`x1` DIV stack post into the callable public post
+ plus separate `x1` ownership. This is the ownership-only bridge; exact
+ return-... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b734c2405df_6 | ada77f794942e2ba | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallablePost.lean | CallablePost | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "divStackDispatchPostCallableExactFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [divStackDispatchPostCallableExactFrame_unfold,\n divStackDispatchPostCallable_unfold, ... | [
{
"name": "divStackDispatchPostCallableExactFrame_unfold",
"text": "theorem divStackDispatchPostCallableExactFrame_unfold\n {sp : Word} {a b : EvmWord} {raVal x9Val : Word} :\n divStackDispatchPostCallableExactFrame sp a b raVal x9Val =\n ((divStackDispatchPostCallable sp a b ** (.x1 ↦ᵣ raVal)) *... | [
{
"name": "divStackDispatchPostCallableExactFrame_weaken_own_x1_frame_x9",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 588,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | @@ -19,6 +19,14 @@
(divStackDispatchPostCallable sp a b ** (.x1 ↦ᵣ raVal)) **
(.x9 ↦ᵣ x9Val)
+theorem divStackDispatchPostCallableExactFrame_unfold
+ {sp : Word} {a b : EvmWord} {raVal x9Val : Word} :
+ divStackDispatchPostCallableExactFrame sp a b raVal x9Val =
+ ((divStackDispatchPostCallable sp ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b734c2405df_7 | 1fcfdaf63a9ff496 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallablePost.lean | CallablePost | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "modStackDispatchPostCallableExactFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [modStackDispatchPostCallableExactFrame_unfold,\n modStackDispatchPostCallable_unfold, ... | [
{
"name": "modStackDispatchPostCallableExactFrame_unfold",
"text": "theorem modStackDispatchPostCallableExactFrame_unfold\n {sp : Word} {a b : EvmWord} {raVal x9Val : Word} :\n modStackDispatchPostCallableExactFrame sp a b raVal x9Val =\n ((modStackDispatchPostCallable sp a b ** (.x1 ↦ᵣ raVal)) *... | [
{
"name": "modStackDispatchPostCallableExactFrame_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 320,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | @@ -58,9 +58,20 @@
(modStackDispatchPostCallable sp a b ** (.x1 ↦ᵣ raVal)) **
(.x9 ↦ᵣ x9Val)
+theorem modStackDispatchPostCallableExactFrame_unfold
+ {sp : Word} {a b : EvmWord} {raVal x9Val : Word} :
+ modStackDispatchPostCallableExactFrame sp a b raVal x9Val =
+ ((modStackDispatchPostCallable sp ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b734c2405df_8 | 0b53238e3a1768e6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallablePost.lean | CallablePost | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "modConcretePostNoX1Frame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [modConcretePostNoX1Frame_unfold, divScratchValuesCallNoX1_unfold,\n divScratchValues_unfold]\n pcFr... | [
{
"name": "modConcretePostNoX1Frame_unfold",
"text": "theorem modConcretePostNoX1Frame_unfold\n {sp : Word} {a b : EvmWord}\n {x9Val raVal v2 v6 v7 v11 : Word}\n {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7\n shiftMem nMem jMem retMem dMem dloMem scratch_un0 : Word} :\n modConcretePostNoX1Frame sp a... | [
{
"name": "modConcretePostNoX1Frame_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 501,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | @@ -72,6 +72,24 @@
divScratchValuesCallNoX1 sp q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
shiftMem nMem jMem retMem dMem dloMem scratch_un0))
+theorem modConcretePostNoX1Frame_unfold
+ {sp : Word} {a b : EvmWord}
+ {x9Val raVal v2 v6 v7 v11 : Word}
+ {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
+ shiftM... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b734c2405df_9 | d8d99eb9c866817c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallablePost.lean | CallablePost | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "modConcretePostNoX1ExactRegsFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [modConcretePostNoX1ExactRegsFrame_unfold, divScratchValuesCallNoX1_unfold,\n divScratchValu... | [
{
"name": "modConcretePostNoX1ExactRegsFrame_unfold",
"text": "theorem modConcretePostNoX1ExactRegsFrame_unfold\n {sp : Word} {a b : EvmWord}\n {x9Val raVal v2 v5 v6 v7 v10 v11 : Word}\n {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7\n shiftMem nMem jMem retMem dMem dloMem scratch_un0 : Word} :\n modC... | [
{
"name": "modConcretePostNoX1ExactRegsFrame_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 542,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | @@ -87,6 +87,24 @@
divScratchValuesCallNoX1 sp q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
shiftMem nMem jMem retMem dMem dloMem scratch_un0))
+theorem modConcretePostNoX1ExactRegsFrame_unfold
+ {sp : Word} {a b : EvmWord}
+ {x9Val raVal v2 v5 v6 v7 v10 v11 : Word}
+ {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b734c2405df_10 | 15a0c981f71eb390 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallablePost.lean | CallablePost | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "modConcretePostNoX1ExactRegsFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [modConcretePostNoX1ExactRegsFrame_unfold, divScratchValuesCallNoX1_unfold,\n divScratchValu... | [
{
"name": "modConcretePostNoX1ExactRegsFrame_unfold",
"text": "theorem modConcretePostNoX1ExactRegsFrame_unfold\n {sp : Word} {a b : EvmWord}\n {x9Val raVal v2 v5 v6 v7 v10 v11 : Word}\n {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7\n shiftMem nMem jMem retMem dMem dloMem scratch_un0 : Word} :\n modC... | [
{
"name": "modConcretePostNoX1ExactRegs_weaken_callable_frame",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 42,
"n_chars": 2035,
"n_subproofs": 1,
"n_tactics": 28,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 16,
"au... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | @@ -87,6 +87,24 @@
divScratchValuesCallNoX1 sp q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
shiftMem nMem jMem retMem dMem dloMem scratch_un0))
+theorem modConcretePostNoX1ExactRegsFrame_unfold
+ {sp : Word} {a b : EvmWord}
+ {x9Val raVal v2 v5 v6 v7 v10 v11 : Word}
+ {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b734c2405df_11 | aa58e38e018e5c38 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallablePost.lean | CallablePost | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "modConcretePostNoX1Frame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [modConcretePostNoX1Frame_unfold, divScratchValuesCallNoX1_unfold,\n divScratchValues_unfold]\n pcFr... | [
{
"name": "modConcretePostNoX1Frame_unfold",
"text": "theorem modConcretePostNoX1Frame_unfold\n {sp : Word} {a b : EvmWord}\n {x9Val raVal v2 v6 v7 v11 : Word}\n {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7\n shiftMem nMem jMem retMem dMem dloMem scratch_un0 : Word} :\n modConcretePostNoX1Frame sp a... | [
{
"name": "modConcretePostNoX1_weaken_callable_frame",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 38,
"n_chars": 1776,
"n_subproofs": 1,
"n_tactics": 25,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 14,
"automation_... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | @@ -72,6 +72,24 @@
divScratchValuesCallNoX1 sp q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
shiftMem nMem jMem retMem dMem dloMem scratch_un0))
+theorem modConcretePostNoX1Frame_unfold
+ {sp : Word} {a b : EvmWord}
+ {x9Val raVal v2 v6 v7 v11 : Word}
+ {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
+ shiftM... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b734c2405df_12 | 3f3c64f298d2f2dd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallablePost.lean | CallablePost | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "modStackDispatchPostNoX1_weaken_callable_own_x1_frame_x9",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h hp\n apply sepConj_mono_left\n · exact fun hLeft hpLeft =>\n modSta... | [
{
"name": "modStackDispatchPostNoX1_weaken_callable_own_x1",
"text": "/-- Split the historical no-`x1` MOD stack post into the callable public post\n plus separate `x1` ownership. This mirrors\n `divStackDispatchPostNoX1_weaken_callable_own_x1`. -/\ntheorem modStackDispatchPostNoX1_weaken_callable_own... | [
{
"name": "modStackDispatchPostNoX1_weaken_callable_own_x1_frame_x9",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 586,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 4,
... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | /-
EvmAsm.Evm64.DivMod.Spec.CallablePost
Reusable postcondition weakeners for callable DIV/MOD no-NOP dispatcher
surfaces that frame exact x1/x9 separately.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Public no-NOP DIV callable post with exact caller-framed `x1` ... | @@ -87,6 +87,21 @@
divScratchValuesCallNoX1 sp q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
shiftMem nMem jMem retMem dMem dloMem scratch_un0))
+/-- Split the historical no-`x1` MOD stack post into the callable public post
+ plus separate `x1` ownership. This mirrors
+ `divStackDispatchPostNoX1_weaken_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_5cc9d7be592a_0 | c18957b1a1210ae0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2V4NoNop.lean | FullPathN2V4NoNop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "divK_loop_body_n2_call_j2_exact_loopIterScratch_v4_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 38,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hborrow :\n BitVec.ult uTop\n (mulsubN4_c3 (divKTrialCallV4Q... | [
{
"name": "loopBodyN2CallSkipJgt0PostV4NoX1_eq_scratch",
"text": "theorem loopBodyN2CallSkipJgt0PostV4NoX1_eq_scratch\n (sp base j v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem : Word) :\n loopBodyN2CallSkipJgt0PostV4NoX1 sp base j v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem =\n loopBodyN2CallSkipPostJScra... | [
{
"name": "divK_loop_body_n2_call_j2_exact_loopIterScratch_v4_noNop",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 60,
"n_chars": 2885,
"n_subproofs": 2,
"n_tactics": 38,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 7,
"n_structural": 2,
... | 4 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V4NoNop
v4/no-NOP wrappers for the n=2 DIV loop-body j=0 exit paths.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN2LoopUnified
import EvmAsm.Evm64.DivMod.Compose.FullPathV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN2MaxV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN2CallV4No... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V4NoNop
v4/no-NOP wrappers for the n=2 DIV loop-body j=0 exit paths.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN2LoopUnified
import EvmAsm.Evm64.DivMod.Compose.FullPathV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN2MaxV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN2CallV4No... | @@ -107,6 +107,18 @@
loopBodyN2CallAddbackJgt0PreV4 j sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld retMem dMem dloMem scratchUn0 scratchMem
+theorem loopBodyN2CallSkipJgt0PostV4NoX1_eq_scratch
+ (sp base j v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem : Word) :
+ loopBodyN2C... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5cc9d7be592a_1 | d3c1c952f2d6dd59 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2V4NoNop.lean | FullPathN2V4NoNop | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "divK_loop_body_n2_max_j2_exact_loopIterScratch_v4_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 52,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hborrow :\n BitVec.ult uTop\n (mulsubN4_c3 (signExtend12 4095... | [
{
"name": "divK_loop_body_n2_max_skip_jgt0_norm_v4_noNop",
"text": "/-- Loop body n=2, max+skip, j>0 over `divCode_noNop_v4`, with\n computed addresses hidden behind a named precondition. -/\ntheorem divK_loop_body_n2_max_skip_jgt0_norm_v4_noNop (j sp base : Word)\n (hpos : BitVec.slt (j + signExtend1... | [
{
"name": "divK_loop_body_n2_max_j2_exact_loopIterScratch_v4_noNop",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 78,
"n_chars": 3468,
"n_subproofs": 6,
"n_tactics": 52,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 2,
... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V4NoNop
v4/no-NOP wrappers for the n=2 DIV loop-body j=0 exit paths.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN2LoopUnified
import EvmAsm.Evm64.DivMod.Compose.FullPathV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN2MaxV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN2CallV4No... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V4NoNop
v4/no-NOP wrappers for the n=2 DIV loop-body j=0 exit paths.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN2LoopUnified
import EvmAsm.Evm64.DivMod.Compose.FullPathV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN2MaxV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN2CallV4No... | @@ -107,6 +107,33 @@
loopBodyN2CallAddbackJgt0PreV4 j sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld retMem dMem dloMem scratchUn0 scratchMem
+/-- Loop body n=2, max+skip, j>0 over `divCode_noNop_v4`, with
+ computed addresses hidden behind a named precondition. -/
+theorem... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5cc9d7be592a_2 | 724f0c6b13315d26 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2V4NoNop.lean | FullPathN2V4NoNop | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "divK_loop_body_n2_call_j2_exact_loopIterScratch_v4_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 38,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hborrow :\n BitVec.ult uTop\n (mulsubN4_c3 (divKTrialCallV4Q... | [
{
"name": "loopBodyN2CallSkipJgt0PostV4NoX1_eq_scratch",
"text": "theorem loopBodyN2CallSkipJgt0PostV4NoX1_eq_scratch\n (sp base j v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem : Word) :\n loopBodyN2CallSkipJgt0PostV4NoX1 sp base j v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem =\n loopBodyN2CallSkipPostJScra... | [
{
"name": "divK_loop_body_n2_call_j1_exact_loopIterScratch_v4_noNop",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 60,
"n_chars": 2885,
"n_subproofs": 2,
"n_tactics": 38,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 7,
"n_structural": 2,
... | 4 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V4NoNop
v4/no-NOP wrappers for the n=2 DIV loop-body j=0 exit paths.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN2LoopUnified
import EvmAsm.Evm64.DivMod.Compose.FullPathV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN2MaxV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN2CallV4No... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V4NoNop
v4/no-NOP wrappers for the n=2 DIV loop-body j=0 exit paths.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN2LoopUnified
import EvmAsm.Evm64.DivMod.Compose.FullPathV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN2MaxV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN2CallV4No... | @@ -107,6 +107,18 @@
loopBodyN2CallAddbackJgt0PreV4 j sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld retMem dMem dloMem scratchUn0 scratchMem
+theorem loopBodyN2CallSkipJgt0PostV4NoX1_eq_scratch
+ (sp base j v0 v1 v2 v3 u0 u1 u2 u3 uTop scratchMem : Word) :
+ loopBodyN2C... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5cc9d7be592a_3 | 9b08bc7080b8c37c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2V4NoNop.lean | FullPathN2V4NoNop | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "divK_loop_body_n2_max_j2_exact_loopIterScratch_v4_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 52,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hborrow :\n BitVec.ult uTop\n (mulsubN4_c3 (signExtend12 4095... | [
{
"name": "divK_loop_body_n2_max_skip_jgt0_norm_v4_noNop",
"text": "/-- Loop body n=2, max+skip, j>0 over `divCode_noNop_v4`, with\n computed addresses hidden behind a named precondition. -/\ntheorem divK_loop_body_n2_max_skip_jgt0_norm_v4_noNop (j sp base : Word)\n (hpos : BitVec.slt (j + signExtend1... | [
{
"name": "divK_loop_body_n2_max_j1_exact_loopIterScratch_v4_noNop",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 78,
"n_chars": 3468,
"n_subproofs": 6,
"n_tactics": 52,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 2,
... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V4NoNop
v4/no-NOP wrappers for the n=2 DIV loop-body j=0 exit paths.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN2LoopUnified
import EvmAsm.Evm64.DivMod.Compose.FullPathV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN2MaxV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN2CallV4No... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V4NoNop
v4/no-NOP wrappers for the n=2 DIV loop-body j=0 exit paths.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN2LoopUnified
import EvmAsm.Evm64.DivMod.Compose.FullPathV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN2MaxV4NoNop
import EvmAsm.Evm64.DivMod.LoopIterN2CallV4No... | @@ -107,6 +107,33 @@
loopBodyN2CallAddbackJgt0PreV4 j sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld retMem dMem dloMem scratchUn0 scratchMem
+/-- Loop body n=2, max+skip, j>0 over `divCode_noNop_v4`, with
+ computed addresses hidden behind a named precondition. -/
+theorem... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2d621d30a3d8_0 | de62f29bff405de6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1LoopUnified.lean | FullPathN1LoopUnified | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "evm_div_n1_preloop_loop_unified_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 57,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- 1. Pre-loop: base → base+448\n have hPre := evm_div_n1_to_loopSetup_spec_within sp base\n a0 a... | [
{
"name": "evm_div_n1_loop_unified_inst",
"text": "/-- Helper: instantiate unified n=1 loop (double-addback) with explicit normalized values.\n Separates the loop application from the composition for heartbeat budgeting. -/\ntheorem evm_div_n1_loop_unified_inst\n (bltu_3 bltu_2 bltu_1 bltu_0 : Bool) (... | [
{
"name": "evm_div_n1_preloop_loop_unified_spec",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 103,
"n_chars": 6142,
"n_subproofs": 5,
"n_tactics": 51,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 1,
"automation_only"... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1LoopUnified
Bool-parameterized unified preloop+loop composition for n=1.
Issue #262: Single theorem covers all 16 path combinations at the
preloop+loop level (base → base+904).
Directly composes:
- Preloop: evm_div_n1_to_loopSetup_spec_within (base → base+448)
- ... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1LoopUnified
Bool-parameterized unified preloop+loop composition for n=1.
Issue #262: Single theorem covers all 16 path combinations at the
preloop+loop level (base → base+904).
Directly composes:
- Preloop: evm_div_n1_to_loopSetup_spec_within (base → base+448)
- ... | @@ -143,6 +143,64 @@
((sp + 16) ↦ₘ a2) ** ((sp + 24) ↦ₘ a3) **
((sp + signExtend12 3992) ↦ₘ (clzResult b0).1)
+/-- Helper: instantiate unified n=1 loop (double-addback) with explicit normalized values.
+ Separates the loop application from the composition for heartbeat budgeting. -/
+theorem evm_div_n1_loop_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2d621d30a3d8_1 | 2d096460bb0b14dd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1LoopUnified.lean | FullPathN1LoopUnified | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "evm_div_n1_noNop_preloop_loop_unified_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 53,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- 1. No-NOP pre-loop.\n have hPreNoNop := evm_div_n1_to_loopSetup_spec_within_noNop sp base\n... | [
{
"name": "evm_div_n1_loop_unified_inst_noNop",
"text": "/-- No-NOP helper: instantiate unified n=1 loop with explicit normalized values. -/\ntheorem evm_div_n1_loop_unified_inst_noNop\n (bltu_3 bltu_2 bltu_1 bltu_0 : Bool) (sp base : Word)\n (shift antiShift v0' v1' v2' v3' u0S u1S u2S u3S u4_s : Wor... | [
{
"name": "evm_div_n1_noNop_preloop_loop_unified_spec",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 96,
"n_chars": 5819,
"n_subproofs": 5,
"n_tactics": 51,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 1,
"automation_... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1LoopUnified
Bool-parameterized unified preloop+loop composition for n=1.
Issue #262: Single theorem covers all 16 path combinations at the
preloop+loop level (base → base+904).
Directly composes:
- Preloop: evm_div_n1_to_loopSetup_spec_within (base → base+448)
- ... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1LoopUnified
Bool-parameterized unified preloop+loop composition for n=1.
Issue #262: Single theorem covers all 16 path combinations at the
preloop+loop level (base → base+904).
Directly composes:
- Preloop: evm_div_n1_to_loopSetup_spec_within (base → base+448)
- ... | @@ -143,6 +143,66 @@
((sp + 16) ↦ₘ a2) ** ((sp + 24) ↦ₘ a3) **
((sp + signExtend12 3992) ↦ₘ (clzResult b0).1)
+/-- No-NOP helper: instantiate unified n=1 loop with explicit normalized values. -/
+theorem evm_div_n1_loop_unified_inst_noNop
+ (bltu_3 bltu_2 bltu_1 bltu_0 : Bool) (sp base : Word)
+ (shift an... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2d621d30a3d8_2 | f52ae29878b21d6d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1LoopUnified.lean | FullPathN1LoopUnified | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "evm_div_n1_noNop_preloop_loop_unified_spec_noX1_post",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_weaken\n (fun h hp => hp)\n (preloopN1UnifiedPost_to_prel... | [
{
"name": "evm_div_n1_noNop_preloop_loop_unified_spec",
"text": "/-- Unified preloop+loop for n=1 over the no-NOP DIV code. -/\ntheorem evm_div_n1_noNop_preloop_loop_unified_spec\n (bltu_3 bltu_2 bltu_1 bltu_0 : Bool) (sp base : Word)\n (a0 a1 a2 a3 b0 b1 b2 b3 v5 v6 v7 v10 v11Old : Word)\n (q0 q1 ... | [
{
"name": "evm_div_n1_noNop_preloop_loop_unified_spec_noX1_post",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 60,
"n_chars": 3814,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"a... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1LoopUnified
Bool-parameterized unified preloop+loop composition for n=1.
Issue #262: Single theorem covers all 16 path combinations at the
preloop+loop level (base → base+904).
Directly composes:
- Preloop: evm_div_n1_to_loopSetup_spec_within (base → base+448)
- ... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1LoopUnified
Bool-parameterized unified preloop+loop composition for n=1.
Issue #262: Single theorem covers all 16 path combinations at the
preloop+loop level (base → base+904).
Directly composes:
- Preloop: evm_div_n1_to_loopSetup_spec_within (base → base+448)
- ... | @@ -225,6 +225,101 @@
-- Double-addback unified preloop+loop composition (base → base+904)
-- ============================================================================
+/-- Unified preloop+loop for n=1 over the no-NOP DIV code. -/
+theorem evm_div_n1_noNop_preloop_loop_unified_spec
+ (bltu_3 bltu_2 bltu_1 blt... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2d621d30a3d8_3 | e912af148482aeb8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1LoopUnified.lean | FullPathN1LoopUnified | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "evm_div_n1_denorm_epilogue_bundled_spec_noNop_exact_x1",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hDenorm :=\n evm_div_n1_denorm_epilogue_bundled_spec_noNop\n bltu_3 bl... | [
{
"name": "evm_div_n1_denorm_epilogue_bundled_spec_noNop",
"text": "theorem evm_div_n1_denorm_epilogue_bundled_spec_noNop\n (bltu_3 bltu_2 bltu_1 bltu_0 : Bool)\n (sp base a0 a1 a2 a3 b0 b1 b2 b3 : Word)\n (hshift_nz : fullDivN1Shift b0 ≠ 0) :\n cpsTripleWithin (2 + 23 + 10) (base + denormOff) (... | [
{
"name": "evm_div_n1_denorm_epilogue_bundled_spec_noNop_exact_x1",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 32,
"n_chars": 1373,
"n_subproofs": 2,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1LoopUnified
Bool-parameterized unified preloop+loop composition for n=1.
Issue #262: Single theorem covers all 16 path combinations at the
preloop+loop level (base → base+904).
Directly composes:
- Preloop: evm_div_n1_to_loopSetup_spec_within (base → base+448)
- ... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1LoopUnified
Bool-parameterized unified preloop+loop composition for n=1.
Issue #262: Single theorem covers all 16 path combinations at the
preloop+loop level (base → base+904).
Directly composes:
- Preloop: evm_div_n1_to_loopSetup_spec_within (base → base+448)
- ... | @@ -417,6 +417,37 @@
⟨fullDivN1UnifiedPostNoX1_pcFree bltu_3 bltu_2 bltu_1 bltu_0 sp base
a0 a1 a2 a3 b0 b1 b2 b3 retMem dMem dloMem scratch_un0⟩
+theorem evm_div_n1_denorm_epilogue_bundled_spec_noNop
+ (bltu_3 bltu_2 bltu_1 bltu_0 : Bool)
+ (sp base a0 a1 a2 a3 b0 b1 b2 b3 : Word)
+ (hshift_nz : ful... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2d621d30a3d8_4 | fc8175487190083e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1LoopUnified.lean | FullPathN1LoopUnified | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "evm_div_n1_full_unified_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 27,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hA := evm_div_n1_preloop_loop_unified_spec bltu_3 bltu_2 bltu_1 bltu_0 sp base\n a0 a1 a2 a3 b0 b1 b2... | [
{
"name": "preloopN1UnifiedPost_to_fullDivN1DenormPre_frame",
"text": "theorem preloopN1UnifiedPost_to_fullDivN1DenormPre_frame\n (bltu_3 bltu_2 bltu_1 bltu_0 : Bool)\n (sp base a0 a1 a2 a3 b0 b1 b2 b3 retMem dMem dloMem scratch_un0 : Word)\n (h : PartialState)\n (hp :\n preloopN1UnifiedPos... | [
{
"name": "evm_div_n1_full_unified_spec",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 6,
"n_lines": 69,
"n_chars": 4130,
"n_subproofs": 5,
"n_tactics": 28,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
... | 6 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1LoopUnified
Bool-parameterized unified preloop+loop composition for n=1.
Issue #262: Single theorem covers all 16 path combinations at the
preloop+loop level (base → base+904).
Directly composes:
- Preloop: evm_div_n1_to_loopSetup_spec_within (base → base+448)
- ... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1LoopUnified
Bool-parameterized unified preloop+loop composition for n=1.
Issue #262: Single theorem covers all 16 path combinations at the
preloop+loop level (base → base+904).
Directly composes:
- Preloop: evm_div_n1_to_loopSetup_spec_within (base → base+448)
- ... | @@ -624,6 +624,31 @@
delta fullDivN1UnifiedPost
exact hq
+theorem preloopN1UnifiedPost_to_fullDivN1DenormPre_frame
+ (bltu_3 bltu_2 bltu_1 bltu_0 : Bool)
+ (sp base a0 a1 a2 a3 b0 b1 b2 b3 retMem dMem dloMem scratch_un0 : Word)
+ (h : PartialState)
+ (hp :
+ preloopN1UnifiedPost bltu_3 bltu_2 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_2d621d30a3d8_5 | fb2f928c0283ff58 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1LoopUnified.lean | FullPathN1LoopUnified | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "evm_div_n1_full_unified_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 27,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hA := evm_div_n1_preloop_loop_unified_spec bltu_3 bltu_2 bltu_1 bltu_0 sp base\n a0 a1 a2 a3 b0 b1 b2... | [
{
"name": "preloopN1UnifiedPost_to_fullDivN1DenormPre_frame",
"text": "theorem preloopN1UnifiedPost_to_fullDivN1DenormPre_frame\n (bltu_3 bltu_2 bltu_1 bltu_0 : Bool)\n (sp base a0 a1 a2 a3 b0 b1 b2 b3 retMem dMem dloMem scratch_un0 : Word)\n (h : PartialState)\n (hp :\n preloopN1UnifiedPos... | [
{
"name": "evm_div_n1_noNop_full_unified_spec",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 6,
"n_lines": 70,
"n_chars": 4213,
"n_subproofs": 5,
"n_tactics": 28,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": f... | 6 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1LoopUnified
Bool-parameterized unified preloop+loop composition for n=1.
Issue #262: Single theorem covers all 16 path combinations at the
preloop+loop level (base → base+904).
Directly composes:
- Preloop: evm_div_n1_to_loopSetup_spec_within (base → base+448)
- ... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1LoopUnified
Bool-parameterized unified preloop+loop composition for n=1.
Issue #262: Single theorem covers all 16 path combinations at the
preloop+loop level (base → base+904).
Directly composes:
- Preloop: evm_div_n1_to_loopSetup_spec_within (base → base+448)
- ... | @@ -620,6 +620,31 @@
delta fullDivN1UnifiedPost
exact hq
+theorem preloopN1UnifiedPost_to_fullDivN1DenormPre_frame
+ (bltu_3 bltu_2 bltu_1 bltu_0 : Bool)
+ (sp base a0 a1 a2 a3 b0 b1 b2 b3 retMem dMem dloMem scratch_un0 : Word)
+ (h : PartialState)
+ (hp :
+ preloopN1UnifiedPost bltu_3 bltu_2 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_2d621d30a3d8_6 | 3b89560b27d399d4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1LoopUnified.lean | FullPathN1LoopUnified | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "evm_div_n1_noNop_full_unified_spec_noX1_post",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hFull := evm_div_n1_noNop_full_unified_spec bltu_3 bltu_2 bltu_1 bltu_0 sp base\n a0 ... | [
{
"name": "evm_div_n1_noNop_full_unified_spec",
"text": "/-- Full n=1 unified DIV path over the no-NOP DIV code. -/\ntheorem evm_div_n1_noNop_full_unified_spec\n (bltu_3 bltu_2 bltu_1 bltu_0 : Bool) (sp base : Word)\n (a0 a1 a2 a3 b0 b1 b2 b3 v5 v6 v7 v10 v11Old : Word)\n (q0 q1 q2 q3 u0Old u1Old u... | [
{
"name": "evm_div_n1_noNop_full_unified_spec_noX1_post",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 58,
"n_chars": 3587,
"n_subproofs": 1,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automatio... | 8 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1LoopUnified
Bool-parameterized unified preloop+loop composition for n=1.
Issue #262: Single theorem covers all 16 path combinations at the
preloop+loop level (base → base+904).
Directly composes:
- Preloop: evm_div_n1_to_loopSetup_spec_within (base → base+448)
- ... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1LoopUnified
Bool-parameterized unified preloop+loop composition for n=1.
Issue #262: Single theorem covers all 16 path combinations at the
preloop+loop level (base → base+904).
Directly composes:
- Preloop: evm_div_n1_to_loopSetup_spec_within (base → base+448)
- ... | @@ -658,6 +658,75 @@
sepConj_emp_right'] at hp ⊢
sep_perm hp
+/-- Full n=1 unified DIV path over the no-NOP DIV code. -/
+theorem evm_div_n1_noNop_full_unified_spec
+ (bltu_3 bltu_2 bltu_1 bltu_0 : Bool) (sp base : Word)
+ (a0 a1 a2 a3 b0 b1 b2 b3 v5 v6 v7 v10 v11Old : Word)
+ (q0 q1 q2 q3 u0Ol... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_769b666e2ff7_0 | f2ff66e45737b58d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/AddModCondSub.lean | AddModCondSub | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "condSub_mask_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hN256 : N.toNat < 2 ^ 256 := N.isLt\n have hc01 : carry = 0 ∨ carry = 1 := by rw [hcarry]; split <;> simp\n have hb... | [
{
"name": "mask_word_cases",
"text": "/-- Bit-algebra: for `carry, b3 ∈ {0,1}` as words,\n `0 − (carry ||| (b3 ^^^ 1)) = -1` iff `carry = 1 ∨ b3 = 0`, else `0`. -/\nprivate theorem mask_word_cases (carry b3 : Word)\n (hc : carry = 0 ∨ carry = 1) (hb : b3 = 0 ∨ b3 = 1) :\n (0 : Word) - (carry ||| (b... | [
{
"name": "condSub_mask_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 37,
"n_chars": 1904,
"n_subproofs": 9,
"n_tactics": 39,
"cyclomatic": 5,
"n_automation": 11,
"n_rewrites": 17,
"n_structural": 1,
"automation_only": false,
"max_ne... | 1 | /-
EvmAsm.Evm64.EvmWordArith.AddModCondSub
Phase-3 M3d value bridges for the total ADDMOD carry branch (issue #9704):
the two genuinely-semantic facts the machine `Ld` sub-chain needs to fold
the branch-free conditional subtract into `EvmWord.addmod`.
* `evm_add_carry3_eq_overflow` — the `evm_add` 4-limb ca... | /-
EvmAsm.Evm64.EvmWordArith.AddModCondSub
Phase-3 M3d value bridges for the total ADDMOD carry branch (issue #9704):
the two genuinely-semantic facts the machine `Ld` sub-chain needs to fold
the branch-free conditional subtract into `EvmWord.addmod`.
* `evm_add_carry3_eq_overflow` — the `evm_add` 4-limb ca... | @@ -31,6 +31,14 @@
-- evm_add carry-out = 257th-bit overflow
-- ============================================================================
+/-- Bit-algebra: for `carry, b3 ∈ {0,1}` as words,
+ `0 − (carry ||| (b3 ^^^ 1)) = -1` iff `carry = 1 ∨ b3 = 0`, else `0`. -/
+private theorem mask_word_cases (carry b3 : ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9e11cfc0e4b0_0 | 477a60591d742531 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V5Bzero.lean | FullPathN1V5Bzero | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_div_bzero_spec_within_noNop_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbody := cpsTripleWithin_extend_code divK_phaseA_code_sub_divCode_noNop_v5\n (divK_phaseA_body_... | [
{
"name": "divK_zeroPath_code_sub_divCode_noNop_v5",
"text": "private theorem divK_zeroPath_code_sub_divCode_noNop_v5 {base : Word} :\n ∀ a i, (divK_zeroPath_code (base + zeroPathOff)) a = some i → (divCode_noNop_v5 base) a = some i := by\n intro a i h\n exact sharedNoNop_v5_b10_div a i (by unfold divK... | [
{
"name": "evm_div_bzero_spec_within_noNop_v5",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 42,
"n_chars": 2377,
"n_subproofs": 10,
"n_tactics": 32,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 6,
"n_structural": 3,
"automation_only": ... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5Bzero
v5 bzero DIV code path (b = 0 → quotient 0), over `divCode_noNop_v5`: phaseA
detects b=0, the BEQ at phaseABeqOff is taken to zeroPath, which writes 0 to the
output slots. Mirror of the v4 `evm_div_bzero_spec_within_noNop_v4` with the
phaseA/zeroPath/beq code... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5Bzero
v5 bzero DIV code path (b = 0 → quotient 0), over `divCode_noNop_v5`: phaseA
detects b=0, the BEQ at phaseABeqOff is taken to zeroPath, which writes 0 to the
output slots. Mirror of the v4 `evm_div_bzero_spec_within_noNop_v4` with the
phaseA/zeroPath/beq code... | @@ -21,6 +21,11 @@
intro a i h
exact sharedNoNop_v5_b0_div a i (by unfold divK_phaseA_code at h; exact h)
+private theorem divK_zeroPath_code_sub_divCode_noNop_v5 {base : Word} :
+ ∀ a i, (divK_zeroPath_code (base + zeroPathOff)) a = some i → (divCode_noNop_v5 base) a = some i := by
+ intro a i h
+ exact 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_9e11cfc0e4b0_1 | 3879d0aa62eb7777 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V5Bzero.lean | FullPathN1V5Bzero | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_div_bzero_spec_within_noNop_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbody := cpsTripleWithin_extend_code divK_phaseA_code_sub_divCode_noNop_v5\n (divK_phaseA_body_... | [
{
"name": "beq_singleton_sub_divCode_noNop_v5",
"text": "private theorem beq_singleton_sub_divCode_noNop_v5 {base : Word} :\n ∀ a i, (CodeReq.singleton (base + phaseABeqOff) (.BEQ .x5 .x0 1020)) a = some i →\n (divCode_noNop_v5 base) a = some i := by\n intro a i h\n exact sharedNoNop_v5_b0_div a i... | [
{
"name": "evm_div_bzero_stack_spec_within_noNop_v5",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 47,
"n_chars": 2355,
"n_subproofs": 12,
"n_tactics": 37,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 5,
"n_structural": 2,
"automation_o... | 4 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5Bzero
v5 bzero DIV code path (b = 0 → quotient 0), over `divCode_noNop_v5`: phaseA
detects b=0, the BEQ at phaseABeqOff is taken to zeroPath, which writes 0 to the
output slots. Mirror of the v4 `evm_div_bzero_spec_within_noNop_v4` with the
phaseA/zeroPath/beq code... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5Bzero
v5 bzero DIV code path (b = 0 → quotient 0), over `divCode_noNop_v5`: phaseA
detects b=0, the BEQ at phaseABeqOff is taken to zeroPath, which writes 0 to the
output slots. Mirror of the v4 `evm_div_bzero_spec_within_noNop_v4` with the
phaseA/zeroPath/beq code... | @@ -26,6 +26,14 @@
intro a i h
exact sharedNoNop_v5_b10_div a i (by unfold divK_zeroPath_code at h; exact h)
+private theorem beq_singleton_sub_divCode_noNop_v5 {base : Word} :
+ ∀ a i, (CodeReq.singleton (base + phaseABeqOff) (.BEQ .x5 .x0 1020)) a = some i →
+ (divCode_noNop_v5 base) a = some i := by
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9e11cfc0e4b0_2 | 9f9909ffd1b0226e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V5Bzero.lean | FullPathN1V5Bzero | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_div_bzero_spec_within_noNop_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbody := cpsTripleWithin_extend_code divK_phaseA_code_sub_divCode_noNop_v5\n (divK_phaseA_body_... | [
{
"name": "beq_singleton_sub_divCode_noNop_v5",
"text": "private theorem beq_singleton_sub_divCode_noNop_v5 {base : Word} :\n ∀ a i, (CodeReq.singleton (base + phaseABeqOff) (.BEQ .x5 .x0 1020)) a = some i →\n (divCode_noNop_v5 base) a = some i := by\n intro a i h\n exact sharedNoNop_v5_b0_div a i... | [
{
"name": "evm_div_bzero_stack_spec_within_dispatch_noNop_v5_uni",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 51,
"n_chars": 2371,
"n_subproofs": 2,
"n_tactics": 38,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 4,
"... | 5 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5Bzero
v5 bzero DIV code path (b = 0 → quotient 0), over `divCode_noNop_v5`: phaseA
detects b=0, the BEQ at phaseABeqOff is taken to zeroPath, which writes 0 to the
output slots. Mirror of the v4 `evm_div_bzero_spec_within_noNop_v4` with the
phaseA/zeroPath/beq code... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5Bzero
v5 bzero DIV code path (b = 0 → quotient 0), over `divCode_noNop_v5`: phaseA
detects b=0, the BEQ at phaseABeqOff is taken to zeroPath, which writes 0 to the
output slots. Mirror of the v4 `evm_div_bzero_spec_within_noNop_v4` with the
phaseA/zeroPath/beq code... | @@ -26,6 +26,14 @@
intro a i h
exact sharedNoNop_v5_b10_div a i (by unfold divK_zeroPath_code at h; exact h)
+private theorem beq_singleton_sub_divCode_noNop_v5 {base : Word} :
+ ∀ a i, (CodeReq.singleton (base + phaseABeqOff) (.BEQ .x5 .x0 1020)) a = some i →
+ (divCode_noNop_v5 base) a = some i := by
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9e11cfc0e4b0_3 | f6436e3fc8823809 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V5Bzero.lean | FullPathN1V5Bzero | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_div_bzero_stack_spec_within_noNop_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 37,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n subst hbz\n have hg0 := EvmWord.getLimbN_zero 0\n have hg1 := EvmWord.getLimbN_zero 1\n have h... | [
{
"name": "evm_div_bzero_spec_within_noNop_v5",
"text": "theorem evm_div_bzero_spec_within_noNop_v5 (sp base : Word)\n (b0 b1 b2 b3 v5 v10 : Word)\n (hbz : b0 ||| b1 ||| b2 ||| b3 = 0) :\n cpsTripleWithin (8 + 5) base (base + nopOff) (divCode_noNop_v5 base)\n ((.x12 ↦ᵣ sp) ** (.x5 ↦ᵣ v5) ** (.... | [
{
"name": "evm_div_bzero_lane_v5",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 35,
"n_chars": 1841,
"n_subproofs": 1,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 4,
"automation_only": false,
"ma... | 6 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5Bzero
v5 bzero DIV code path (b = 0 → quotient 0), over `divCode_noNop_v5`: phaseA
detects b=0, the BEQ at phaseABeqOff is taken to zeroPath, which writes 0 to the
output slots. Mirror of the v4 `evm_div_bzero_spec_within_noNop_v4` with the
phaseA/zeroPath/beq code... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5Bzero
v5 bzero DIV code path (b = 0 → quotient 0), over `divCode_noNop_v5`: phaseA
detects b=0, the BEQ at phaseABeqOff is taken to zeroPath, which writes 0 to the
output slots. Mirror of the v4 `evm_div_bzero_spec_within_noNop_v4` with the
phaseA/zeroPath/beq code... | @@ -34,6 +34,47 @@
(CodeReq.singleton_mono (CodeReq.ofProg_lookup base (divK_phaseA 1020) 7
(by decide) (by decide)) a i h)
+theorem evm_div_bzero_spec_within_noNop_v5 (sp base : Word)
+ (b0 b1 b2 b3 v5 v10 : Word)
+ (hbz : b0 ||| b1 ||| b2 ||| b3 = 0) :
+ cpsTripleWithin (8 + 5) base (base + nop... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f8b7350e03de_0 | a7306cb846a051ed | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Field0ToU64.lean | Field0ToU64 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "rlp_field0_to_u64_parse_fail_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← rlp_field0_to_u64_parse_fail_tail_cert_pre (base + 44) savedRa]\n exact (rlp_field0_to_u64_... | [
{
"name": "rlp_field0_to_u64_parse_fail_tail_cert_pre",
"text": "theorem rlp_field0_to_u64_parse_fail_tail_cert_pre (base savedRa : Word) :\n (rlp_field0_to_u64_parse_fail_tail_cert base savedRa).pre =\n (regOwn .x10 ** regOwn .x11 ** (.x13 ↦ᵣ savedRa) ** regOwn .x1) := rfl\n\n",
"fan_in": 1,
... | [
{
"name": "rlp_field0_to_u64_parse_fail_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 579,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only... | 1 | /-
EvmAsm.Rv64.RLP.Field0ToU64
First caller-level verification slice composing the verified cursor-walk RLP
leaves (`rlp_walk_init`, `rlp_walk_next`, `rlp_content_to_u64`) into a small
wrapper subroutine that decodes the **first field** of an RLP list as a
canonical `u64`. This is a bounded, intentionally na... | /-
EvmAsm.Rv64.RLP.Field0ToU64
First caller-level verification slice composing the verified cursor-walk RLP
leaves (`rlp_walk_init`, `rlp_walk_next`, `rlp_content_to_u64`) into a small
wrapper subroutine that decodes the **first field** of an RLP list as a
canonical `u64`. This is a bounded, intentionally na... | @@ -142,6 +142,10 @@
rlp_field0_to_u64_parse_fail_post
wp_rv64_leaf_synth
+theorem rlp_field0_to_u64_parse_fail_tail_cert_pre (base savedRa : Word) :
+ (rlp_field0_to_u64_parse_fail_tail_cert base savedRa).pre =
+ (regOwn .x10 ** regOwn .x11 ** (.x13 ↦ᵣ savedRa) ** regOwn .x1) := rfl
+
/-- The parse-... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f8b7350e03de_1 | 745dcc14693f88fe | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Field0ToU64.lean | Field0ToU64 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "rlp_field0_to_u64_content_call_success_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 147,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n subst hadvanced; subst hcontentLen\n set CR := (rlp_field0_to_u64_code base).union (r... | [
{
"name": "rlp_field0_to_u64_prog_length",
"text": "theorem rlp_field0_to_u64_prog_length : rlp_field0_to_u64_prog.length = 15 := rfl\n\n",
"fan_in": 1,
"n_lines": 3,
"n_chars": 83,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_... | [
{
"name": "rlp_field0_to_u64_content_call_success_spec_within",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 188,
"n_chars": 12131,
"n_subproofs": 35,
"n_tactics": 154,
"cyclomatic": 1,
"n_automation": 19,
"n_rewrites": 28,
"n_structural": 11,
... | 4 | /-
EvmAsm.Rv64.RLP.Field0ToU64
First caller-level verification slice composing the verified cursor-walk RLP
leaves (`rlp_walk_init`, `rlp_walk_next`, `rlp_content_to_u64`) into a small
wrapper subroutine that decodes the **first field** of an RLP list as a
canonical `u64`. This is a bounded, intentionally na... | /-
EvmAsm.Rv64.RLP.Field0ToU64
First caller-level verification slice composing the verified cursor-walk RLP
leaves (`rlp_walk_init`, `rlp_walk_next`, `rlp_content_to_u64`) into a small
wrapper subroutine that decodes the **first field** of an RLP list as a
canonical `u64`. This is a bounded, intentionally na... | @@ -122,6 +122,8 @@
.MV .x1 .x13, -- 13 restore caller ra
.JALR .x0 .x1 0 ] -- 14 ret
+theorem rlp_field0_to_u64_prog_length : rlp_field0_to_u64_prog.length = 15 := rfl
+
/-- The wrapper body as a `CodeReq` rooted at `base`. -/
abbrev rlp_field0_to_u64_code (base : Word) ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3fd0370f479c_0 | 52828ef1b0557995 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/RegionMap.lean | RegionMap | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "syslog_below_every_frame_slot",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := syslog_disjoint_from_frameArena\n have hmono : callFrameArenaBase ≤ callFrameArenaBase + (d - 1) *... | [
{
"name": "syslog_disjoint_from_frameArena",
"text": "/-- **The `.73` clobber is closed (load-bearing).** The un-unioned\n `bv_system_storage_log` region `[syslogBase, syslogBase + bvSystemStorageLogBytes)`\n ends at or before `call_frame_arena`'s base — it is entirely disjoint from the\n arena. Un... | [
{
"name": "syslog_below_every_frame_slot",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 1007,
"n_subproofs": 2,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Codegen.RegionMap
Authoritative, kernel-checked memory-region map for the stateless guest
(bead `evm-asm-4ch8f.6`, mechanical half).
This is the single source of truth reconciling the two address-space schemes
that previously had no shared, machine-checked layout statement:
* **Scheme A** — the... | /-
EvmAsm.Codegen.RegionMap
Authoritative, kernel-checked memory-region map for the stateless guest
(bead `evm-asm-4ch8f.6`, mechanical half).
This is the single source of truth reconciling the two address-space schemes
that previously had no shared, machine-checked layout statement:
* **Scheme A** — the... | @@ -332,6 +332,15 @@
LINK-LAYOUT-DEPENDENT — read from the ELF, guarded by `check-region-map.sh`. -/
def syslogBase : Nat := 0xaa30bea0
+/-- **The `.73` clobber is closed (load-bearing).** The un-unioned
+ `bv_system_storage_log` region `[syslogBase, syslogBase + bvSystemStorageLogBytes)`
+ ends at or bef... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3ef82aae4bf4_0 | 7ad0bd9bb36caef1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceInnerStepSubtract.lean | ReduceInnerStepSubtract | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_inner_step_subtract_limb0_core_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_reduce512_inner_step_subtract_limb0_code_eq_singletons base... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb0_code_eq_singletons",
"text": "/-- The limb0 subtract block as explicit singleton code entries for `runBlock`. -/\ntheorem evm_mulmod_reduce512_inner_step_subtract_limb0_code_eq_singletons (base : Word) :\n evm_mulmod_reduce512_inner_step_subtract_... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb0_core_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 1337,
"n_subproofs": 5,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural"... | 1 | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | @@ -198,6 +198,32 @@
((sp + signExtend12 (80 : BitVec 12)) ↦ₘ EvmWord.getLimbN n 2) **
((sp + signExtend12 (88 : BitVec 12)) ↦ₘ EvmWord.getLimbN n 3)
+/-- The limb0 subtract block as explicit singleton code entries for `runBlock`. -/
+theorem evm_mulmod_reduce512_inner_step_subtract_limb0_code_eq_singletons (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_3ef82aae4bf4_1 | 934e6599e915af2e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceInnerStepSubtract.lean | ReduceInnerStepSubtract | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_inner_step_subtract_limb0_core_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_reduce512_inner_step_subtract_limb0_code_eq_singletons base... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb0_code_eq_singletons",
"text": "/-- The limb0 subtract block as explicit singleton code entries for `runBlock`. -/\ntheorem evm_mulmod_reduce512_inner_step_subtract_limb0_code_eq_singletons (base : Word) :\n evm_mulmod_reduce512_inner_step_subtract_... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb0_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 26,
"n_chars": 1084,
"n_subproofs": 2,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 5,
"n_structural": 1,
... | 2 | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | @@ -198,6 +198,32 @@
((sp + signExtend12 (80 : BitVec 12)) ↦ₘ EvmWord.getLimbN n 2) **
((sp + signExtend12 (88 : BitVec 12)) ↦ₘ EvmWord.getLimbN n 3)
+/-- The limb0 subtract block as explicit singleton code entries for `runBlock`. -/
+theorem evm_mulmod_reduce512_inner_step_subtract_limb0_code_eq_singletons (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_3ef82aae4bf4_2 | 85595e9ee8b65e04 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceInnerStepSubtract.lean | ReduceInnerStepSubtract | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_inner_step_subtract_limb1_core_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_reduce512_inner_step_subtract_limb1_code_eq_singletons base... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb1_code_eq_singletons",
"text": "/-- The limb1 subtract block as explicit singleton code entries for `runBlock`. -/\ntheorem evm_mulmod_reduce512_inner_step_subtract_limb1_code_eq_singletons (base : Word) :\n evm_mulmod_reduce512_inner_step_subtract_... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb1_core_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 35,
"n_chars": 2173,
"n_subproofs": 8,
"n_tactics": 25,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 4,
"n_structural"... | 1 | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | @@ -222,6 +222,43 @@
((sp + signExtend12 (4064 : BitVec 12)) ↦ₘ mulModReduceSubLimb0 r n) **
((sp + signExtend12 (64 : BitVec 12)) ↦ₘ EvmWord.getLimbN n 0)
+/-- The limb1 subtract block as explicit singleton code entries for `runBlock`. -/
+theorem evm_mulmod_reduce512_inner_step_subtract_limb1_code_eq_singleto... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3ef82aae4bf4_3 | 794f7d782ddc0018 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceInnerStepSubtract.lean | ReduceInnerStepSubtract | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_inner_step_subtract_limb1_core_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_reduce512_inner_step_subtract_limb1_code_eq_singletons base... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb1_code_eq_singletons",
"text": "/-- The limb1 subtract block as explicit singleton code entries for `runBlock`. -/\ntheorem evm_mulmod_reduce512_inner_step_subtract_limb1_code_eq_singletons (base : Word) :\n evm_mulmod_reduce512_inner_step_subtract_... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb1_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 24,
"n_chars": 994,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 5,
"n_structural": 1,
... | 2 | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | @@ -222,6 +222,43 @@
((sp + signExtend12 (4064 : BitVec 12)) ↦ₘ mulModReduceSubLimb0 r n) **
((sp + signExtend12 (64 : BitVec 12)) ↦ₘ EvmWord.getLimbN n 0)
+/-- The limb1 subtract block as explicit singleton code entries for `runBlock`. -/
+theorem evm_mulmod_reduce512_inner_step_subtract_limb1_code_eq_singleto... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3ef82aae4bf4_4 | 5239bb8eddc3466f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceInnerStepSubtract.lean | ReduceInnerStepSubtract | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_inner_step_subtract_limb2_core_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_reduce512_inner_step_subtract_limb2_code_eq_singletons base... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb2_code_eq_singletons",
"text": "/-- The limb2 subtract block as explicit singleton code entries for `runBlock`. -/\ntheorem evm_mulmod_reduce512_inner_step_subtract_limb2_code_eq_singletons (base : Word) :\n evm_mulmod_reduce512_inner_step_subtract_... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb2_core_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 34,
"n_chars": 2088,
"n_subproofs": 8,
"n_tactics": 24,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 4,
"n_structural"... | 1 | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | @@ -222,6 +222,43 @@
((sp + signExtend12 (4064 : BitVec 12)) ↦ₘ mulModReduceSubLimb0 r n) **
((sp + signExtend12 (64 : BitVec 12)) ↦ₘ EvmWord.getLimbN n 0)
+/-- The limb2 subtract block as explicit singleton code entries for `runBlock`. -/
+theorem evm_mulmod_reduce512_inner_step_subtract_limb2_code_eq_singleto... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3ef82aae4bf4_5 | da386e046e371de1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceInnerStepSubtract.lean | ReduceInnerStepSubtract | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_inner_step_subtract_limb2_core_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_reduce512_inner_step_subtract_limb2_code_eq_singletons base... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb2_code_eq_singletons",
"text": "/-- The limb2 subtract block as explicit singleton code entries for `runBlock`. -/\ntheorem evm_mulmod_reduce512_inner_step_subtract_limb2_code_eq_singletons (base : Word) :\n evm_mulmod_reduce512_inner_step_subtract_... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb2_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 26,
"n_chars": 1035,
"n_subproofs": 2,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 5,
"n_structural": 1,
... | 2 | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | @@ -222,6 +222,43 @@
((sp + signExtend12 (4064 : BitVec 12)) ↦ₘ mulModReduceSubLimb0 r n) **
((sp + signExtend12 (64 : BitVec 12)) ↦ₘ EvmWord.getLimbN n 0)
+/-- The limb2 subtract block as explicit singleton code entries for `runBlock`. -/
+theorem evm_mulmod_reduce512_inner_step_subtract_limb2_code_eq_singleto... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3ef82aae4bf4_6 | d634b7a14b53ad33 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceInnerStepSubtract.lean | ReduceInnerStepSubtract | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_inner_step_subtract_limb3_core_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_reduce512_inner_step_subtract_limb3_code_eq_singletons base... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb3_code_eq_singletons",
"text": "/-- The high-limb subtract block as explicit singleton code entries for `runBlock`. -/\ntheorem evm_mulmod_reduce512_inner_step_subtract_limb3_code_eq_singletons (base : Word) :\n evm_mulmod_reduce512_inner_step_subtr... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb3_core_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 26,
"n_chars": 1515,
"n_subproofs": 5,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural"... | 1 | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | @@ -268,6 +268,32 @@
((sp + signExtend12 (4080 : BitVec 12)) ↦ₘ mulModReduceSubLimb2 r n) **
((sp + signExtend12 (80 : BitVec 12)) ↦ₘ EvmWord.getLimbN n 2)
+/-- The high-limb subtract block as explicit singleton code entries for `runBlock`. -/
+theorem evm_mulmod_reduce512_inner_step_subtract_limb3_code_eq_sing... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3ef82aae4bf4_7 | 93b876f62e34de18 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceInnerStepSubtract.lean | ReduceInnerStepSubtract | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_inner_step_subtract_limb3_core_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_reduce512_inner_step_subtract_limb3_code_eq_singletons base... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb3_code_eq_singletons",
"text": "/-- The high-limb subtract block as explicit singleton code entries for `runBlock`. -/\ntheorem evm_mulmod_reduce512_inner_step_subtract_limb3_code_eq_singletons (base : Word) :\n evm_mulmod_reduce512_inner_step_subtr... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb3_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 24,
"n_chars": 970,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 5,
"n_structural": 1,
... | 2 | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | @@ -268,6 +268,32 @@
((sp + signExtend12 (4080 : BitVec 12)) ↦ₘ mulModReduceSubLimb2 r n) **
((sp + signExtend12 (80 : BitVec 12)) ↦ₘ EvmWord.getLimbN n 2)
+/-- The high-limb subtract block as explicit singleton code entries for `runBlock`. -/
+theorem evm_mulmod_reduce512_inner_step_subtract_limb3_code_eq_sing... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3ef82aae4bf4_8 | 4de2f55679149a82 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceInnerStepSubtract.lean | ReduceInnerStepSubtract | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_inner_step_subtract_limb0_core_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_reduce512_inner_step_subtract_limb0_code_eq_singletons base... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb0_code_eq_singletons",
"text": "/-- The limb0 subtract block as explicit singleton code entries for `runBlock`. -/\ntheorem evm_mulmod_reduce512_inner_step_subtract_limb0_code_eq_singletons (base : Word) :\n evm_mulmod_reduce512_inner_step_subtract_... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb0_full_code_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 14,
"n_chars": 714,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structur... | 4 | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | @@ -198,6 +198,32 @@
((sp + signExtend12 (80 : BitVec 12)) ↦ₘ EvmWord.getLimbN n 2) **
((sp + signExtend12 (88 : BitVec 12)) ↦ₘ EvmWord.getLimbN n 3)
+/-- The limb0 subtract block as explicit singleton code entries for `runBlock`. -/
+theorem evm_mulmod_reduce512_inner_step_subtract_limb0_code_eq_singletons (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_3ef82aae4bf4_9 | 6e4779a9407ce529 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceInnerStepSubtract.lean | ReduceInnerStepSubtract | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_inner_step_subtract_limb1_core_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_reduce512_inner_step_subtract_limb1_code_eq_singletons base... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb1_code_eq_singletons",
"text": "/-- The limb1 subtract block as explicit singleton code entries for `runBlock`. -/\ntheorem evm_mulmod_reduce512_inner_step_subtract_limb1_code_eq_singletons (base : Word) :\n evm_mulmod_reduce512_inner_step_subtract_... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb1_full_code_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 11,
"n_chars": 535,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structur... | 4 | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | @@ -222,6 +222,43 @@
((sp + signExtend12 (4064 : BitVec 12)) ↦ₘ mulModReduceSubLimb0 r n) **
((sp + signExtend12 (64 : BitVec 12)) ↦ₘ EvmWord.getLimbN n 0)
+/-- The limb1 subtract block as explicit singleton code entries for `runBlock`. -/
+theorem evm_mulmod_reduce512_inner_step_subtract_limb1_code_eq_singleto... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3ef82aae4bf4_10 | 4094d165437316f7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceInnerStepSubtract.lean | ReduceInnerStepSubtract | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_inner_step_subtract_limb2_core_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_reduce512_inner_step_subtract_limb2_code_eq_singletons base... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb2_code_eq_singletons",
"text": "/-- The limb2 subtract block as explicit singleton code entries for `runBlock`. -/\ntheorem evm_mulmod_reduce512_inner_step_subtract_limb2_code_eq_singletons (base : Word) :\n evm_mulmod_reduce512_inner_step_subtract_... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb2_full_code_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 11,
"n_chars": 511,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structur... | 4 | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | @@ -222,6 +222,43 @@
((sp + signExtend12 (4064 : BitVec 12)) ↦ₘ mulModReduceSubLimb0 r n) **
((sp + signExtend12 (64 : BitVec 12)) ↦ₘ EvmWord.getLimbN n 0)
+/-- The limb2 subtract block as explicit singleton code entries for `runBlock`. -/
+theorem evm_mulmod_reduce512_inner_step_subtract_limb2_code_eq_singleto... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3ef82aae4bf4_11 | 8e6bbad2ad3ca4c3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceInnerStepSubtract.lean | ReduceInnerStepSubtract | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_inner_step_subtract_limb3_core_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_reduce512_inner_step_subtract_limb3_code_eq_singletons base... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb3_code_eq_singletons",
"text": "/-- The high-limb subtract block as explicit singleton code entries for `runBlock`. -/\ntheorem evm_mulmod_reduce512_inner_step_subtract_limb3_code_eq_singletons (base : Word) :\n evm_mulmod_reduce512_inner_step_subtr... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb3_full_code_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 11,
"n_chars": 511,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structur... | 4 | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | @@ -268,6 +268,32 @@
((sp + signExtend12 (4080 : BitVec 12)) ↦ₘ mulModReduceSubLimb2 r n) **
((sp + signExtend12 (80 : BitVec 12)) ↦ₘ EvmWord.getLimbN n 2)
+/-- The high-limb subtract block as explicit singleton code entries for `runBlock`. -/
+theorem evm_mulmod_reduce512_inner_step_subtract_limb3_code_eq_sing... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3ef82aae4bf4_12 | f32258a717e48e15 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceInnerStepSubtract.lean | ReduceInnerStepSubtract | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_inner_step_subtract_limb2_core_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_reduce512_inner_step_subtract_limb2_code_eq_singletons base... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_limb2_code_eq_singletons",
"text": "/-- The limb2 subtract block as explicit singleton code entries for `runBlock`. -/\ntheorem evm_mulmod_reduce512_inner_step_subtract_limb2_code_eq_singletons (base : Word) :\n evm_mulmod_reduce512_inner_step_subtract_... | [
{
"name": "evm_mulmod_reduce512_inner_step_subtract_store_spec_within",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 21,
"n_lines": 31,
"n_chars": 1518,
"n_subproofs": 7,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,... | 21 | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | /-
EvmAsm.Evm64.MulMod.ReduceInnerStepSubtract
CPS specs for the subtract-and-store path of the MULMOD reducer inner step.
-/
import EvmAsm.Evm64.MulMod.ReduceInnerStepCompare
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace ... | @@ -331,6 +331,43 @@
rw [show (base + 184 : Word) + 4 = base + 188 by bv_addr]
rw [show (base + 188 : Word) + 4 = base + 192 by bv_addr]
+/-- The limb2 subtract block as explicit singleton code entries for `runBlock`. -/
+theorem evm_mulmod_reduce512_inner_step_subtract_limb2_code_eq_singletons (base : Word) :
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6db89110b405_0 | c4e8a019ce391f1a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128Lemmas.lean | Div128Lemmas | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "halfword_combine_hi_lo",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [halfword_combine _ _ hi32_toNat_lt lo32_toNat_lt]\n exact halfword_decompose.symm",
"n_chars": 91,
"n_s... | [
{
"name": "halfword_combine",
"text": "/-- Combining two half-words via shift-left + OR gives addition at the Nat level,\n since the bit ranges [63:32] and [31:0] are disjoint. -/\ntheorem halfword_combine (a b : Word) (ha : a.toNat < 2^32) (hb : b.toNat < 2^32) :\n (a <<< 32 ||| b).toNat = a.toNat * ... | [
{
"name": "halfword_combine_hi_lo",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 477,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Div128Lemmas
Mathematical foundations for div128 correctness and multi-limb division:
- Half-word OR-combine (non-overlapping shift+OR = add)
- 128-bit Euclidean uniqueness
- Trial quotient bounds (Knuth TAOCP 4.3.1): generalized and 256→128 level
- Product check correction: re... | /-
EvmAsm.Evm64.EvmWordArith.Div128Lemmas
Mathematical foundations for div128 correctness and multi-limb division:
- Half-word OR-combine (non-overlapping shift+OR = add)
- 128-bit Euclidean uniqueness
- Trial quotient bounds (Knuth TAOCP 4.3.1): generalized and 256→128 level
- Product check correction: re... | @@ -22,9 +22,33 @@
-- Half-word OR-combine: non-overlapping shift+OR = add
-- ============================================================================
+/-- Combining two half-words via shift-left + OR gives addition at the Nat level,
+ since the bit ranges [63:32] and [31:0] are disjoint. -/
+theorem halfwor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6db89110b405_1 | 33943c6117279041 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128Lemmas.lean | Div128Lemmas | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "val128_mod_unique",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hq := val128_div_unique uHi uLo d q r hr heq\n have := Nat.div_add_mod (val128 uHi uLo) d\n subst hq; nlinarith [N... | [
{
"name": "val128_div_unique",
"text": "/-- If `val128 uHi uLo = d * q + r` with `r < d`, then `q = val128 uHi uLo / d`.\n Used to verify div128 output by checking the division equation and remainder bound. -/\ntheorem val128_div_unique (uHi uLo : Word) (d q r : Nat)\n (hr : r < d)\n (heq : val128 ... | [
{
"name": "val128_mod_unique",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 884,
"n_subproofs": 2,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nest... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Div128Lemmas
Mathematical foundations for div128 correctness and multi-limb division:
- Half-word OR-combine (non-overlapping shift+OR = add)
- 128-bit Euclidean uniqueness
- Trial quotient bounds (Knuth TAOCP 4.3.1): generalized and 256→128 level
- Product check correction: re... | /-
EvmAsm.Evm64.EvmWordArith.Div128Lemmas
Mathematical foundations for div128 correctness and multi-limb division:
- Half-word OR-combine (non-overlapping shift+OR = add)
- 128-bit Euclidean uniqueness
- Trial quotient bounds (Knuth TAOCP 4.3.1): generalized and 256→128 level
- Product check correction: re... | @@ -22,11 +22,24 @@
-- Half-word OR-combine: non-overlapping shift+OR = add
-- ============================================================================
+/-- If `val128 uHi uLo = d * q + r` with `r < d`, then `q = val128 uHi uLo / d`.
+ Used to verify div128 output by checking the division equation and remain... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6db89110b405_2 | 8be18ffa435b9afd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128Lemmas.lean | Div128Lemmas | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "trial_quotient_range",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n ⟨trial_quotient_ge uHi un1 dHi dLo (by omega) hun1,\n trial_quotient_le uHi un1 dHi dLo hd_hi_bound hd_lo hun1 hu hnorm... | [
{
"name": "trial_quotient_ge",
"text": "/-- Trial quotient upper bound: `⌊uHi / dHi⌋ ≥ ⌊(uHi * B + un1) / d⌋`.\n The trial quotient never underestimates. No normalization needed.\n\n Proof idea: `(q̂ + 1) * dHi > uHi`, so `(q̂ + 1) * d > uHi * B + un1`. -/\ntheorem trial_quotient_ge (uHi un1 dHi dLo :... | [
{
"name": "trial_quotient_range",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 21,
"n_chars": 1059,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_n... | 2 | /-
EvmAsm.Evm64.EvmWordArith.Div128Lemmas
Mathematical foundations for div128 correctness and multi-limb division:
- Half-word OR-combine (non-overlapping shift+OR = add)
- 128-bit Euclidean uniqueness
- Trial quotient bounds (Knuth TAOCP 4.3.1): generalized and 256→128 level
- Product check correction: re... | /-
EvmAsm.Evm64.EvmWordArith.Div128Lemmas
Mathematical foundations for div128 correctness and multi-limb division:
- Half-word OR-combine (non-overlapping shift+OR = add)
- 128-bit Euclidean uniqueness
- Trial quotient bounds (Knuth TAOCP 4.3.1): generalized and 256→128 level
- Product check correction: re... | @@ -22,6 +22,24 @@
-- Half-word OR-combine: non-overlapping shift+OR = add
-- ============================================================================
+/-- Trial quotient upper bound: `⌊uHi / dHi⌋ ≥ ⌊(uHi * B + un1) / d⌋`.
+ The trial quotient never underestimates. No normalization needed.
+
+ Proof idea:... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6db89110b405_3 | 85c999a5623e822c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128Lemmas.lean | Div128Lemmas | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "correction_step_overestimate_le_one",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n set qTrue := (uHi * B + un1) / (dHi * B + dLo)\n split\n · -- Product check fails: decrement. q̂ > q... | [
{
"name": "product_check_gt_imp_overestimate",
"text": "/-- Product check soundness: if `q̂ * dLo > r̂ * B + un1`,\n then `q̂ > qTrue` (the trial quotient strictly overestimates).\n\n Proof: q̂ * d = q̂ * dHi * B + q̂ * dLo > r̂ * dHi * B + r̂ * B + un1\n and from r̂ = uHi - q̂ * dHi: q̂ * dHi = uH... | [
{
"name": "correction_step_overestimate_le_one",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 31,
"n_chars": 1518,
"n_subproofs": 2,
"n_tactics": 14,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": ... | 2 | /-
EvmAsm.Evm64.EvmWordArith.Div128Lemmas
Mathematical foundations for div128 correctness and multi-limb division:
- Half-word OR-combine (non-overlapping shift+OR = add)
- 128-bit Euclidean uniqueness
- Trial quotient bounds (Knuth TAOCP 4.3.1): generalized and 256→128 level
- Product check correction: re... | /-
EvmAsm.Evm64.EvmWordArith.Div128Lemmas
Mathematical foundations for div128 correctness and multi-limb division:
- Half-word OR-combine (non-overlapping shift+OR = add)
- 128-bit Euclidean uniqueness
- Trial quotient bounds (Knuth TAOCP 4.3.1): generalized and 256→128 level
- Product check correction: re... | @@ -22,6 +22,31 @@
-- Half-word OR-combine: non-overlapping shift+OR = add
-- ============================================================================
+/-- Product check soundness: if `q̂ * dLo > r̂ * B + un1`,
+ then `q̂ > qTrue` (the trial quotient strictly overestimates).
+
+ Proof: q̂ * d = q̂ * dHi *... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6db89110b405_4 | 01802625a5a1c163 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128Lemmas.lean | Div128Lemmas | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "correction_step_overestimate_le_one",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n set qTrue := (uHi * B + un1) / (dHi * B + dLo)\n split\n · -- Product check fails: decrement. q̂ > q... | [
{
"name": "product_check_gt_imp_overestimate",
"text": "/-- Product check soundness: if `q̂ * dLo > r̂ * B + un1`,\n then `q̂ > qTrue` (the trial quotient strictly overestimates).\n\n Proof: q̂ * d = q̂ * dHi * B + q̂ * dLo > r̂ * dHi * B + r̂ * B + un1\n and from r̂ = uHi - q̂ * dHi: q̂ * dHi = uH... | [
{
"name": "half_round_overestimate_le_one",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 34,
"n_chars": 1524,
"n_subproofs": 1,
"n_tactics": 13,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false... | 3 | /-
EvmAsm.Evm64.EvmWordArith.Div128Lemmas
Mathematical foundations for div128 correctness and multi-limb division:
- Half-word OR-combine (non-overlapping shift+OR = add)
- 128-bit Euclidean uniqueness
- Trial quotient bounds (Knuth TAOCP 4.3.1): generalized and 256→128 level
- Product check correction: re... | /-
EvmAsm.Evm64.EvmWordArith.Div128Lemmas
Mathematical foundations for div128 correctness and multi-limb division:
- Half-word OR-combine (non-overlapping shift+OR = add)
- 128-bit Euclidean uniqueness
- Trial quotient bounds (Knuth TAOCP 4.3.1): generalized and 256→128 level
- Product check correction: re... | @@ -22,6 +22,31 @@
-- Half-word OR-combine: non-overlapping shift+OR = add
-- ============================================================================
+/-- Product check soundness: if `q̂ * dLo > r̂ * B + un1`,
+ then `q̂ > qTrue` (the trial quotient strictly overestimates).
+
+ Proof: q̂ * d = q̂ * dHi *... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6db89110b405_5 | 10235d17dbc56a88 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div128Lemmas.lean | Div128Lemmas | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "trial_quotient_ge_256",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [val256_eq_val128_pair, val256_top_zero]\n exact trial_quotient_ge_general (val128 u3 u2) (val128 u1 u0)\n v2.... | [
{
"name": "trial_quotient_ge_general",
"text": "/-- Generalized trial quotient bound: ⌊(uHi * Bk + u_rest) / (dHi * Bk + d_rest)⌋ ≤ ⌊uHi / dHi⌋.\n Works for any \"base\" Bk (e.g., 2^32, 2^64, 2^128). The trial quotient using only the\n top portions never underestimates the true quotient. -/\ntheorem t... | [
{
"name": "trial_quotient_ge_256",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 16,
"n_chars": 825,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
"max_... | 3 | /-
EvmAsm.Evm64.EvmWordArith.Div128Lemmas
Mathematical foundations for div128 correctness and multi-limb division:
- Half-word OR-combine (non-overlapping shift+OR = add)
- 128-bit Euclidean uniqueness
- Trial quotient bounds (Knuth TAOCP 4.3.1): generalized and 256→128 level
- Product check correction: re... | /-
EvmAsm.Evm64.EvmWordArith.Div128Lemmas
Mathematical foundations for div128 correctness and multi-limb division:
- Half-word OR-combine (non-overlapping shift+OR = add)
- 128-bit Euclidean uniqueness
- Trial quotient bounds (Knuth TAOCP 4.3.1): generalized and 256→128 level
- Product check correction: re... | @@ -22,6 +22,28 @@
-- Half-word OR-combine: non-overlapping shift+OR = add
-- ============================================================================
+/-- Generalized trial quotient bound: ⌊(uHi * Bk + u_rest) / (dHi * Bk + d_rest)⌋ ≤ ⌊uHi / dHi⌋.
+ Works for any "base" Bk (e.g., 2^32, 2^64, 2^128). The tri... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_446fa91879f8_0 | 7e9f79902fca95db | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/SizeProgram.lean | SizeProgram | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_calldatasize_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_calldatasize_length]",
"n_chars": 34,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": ... | [
{
"name": "evm_calldatasize_length",
"text": "/-- `evm_calldatasize` is exactly 6 RISC-V instructions = 24 bytes. -/\ntheorem evm_calldatasize_length (envBaseReg tmpReg : Reg) :\n (evm_calldatasize envBaseReg tmpReg).length = 6 := by\n simp [evm_calldatasize, LD, ADDI, SD, single, seq, Program.length_ap... | [
{
"name": "evm_calldatasize_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 160,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.Calldata.SizeProgram
RISC-V program implementing the EVM `CALLDATASIZE` opcode.
CALLDATASIZE pushes the calldata byte length (held in the env block at
`callDataLenOff = 424`) onto the EVM stack as a 256-bit word. Because the
length always fits in 64 bits in any realistic execution, the valu... | /-
EvmAsm.Evm64.Calldata.SizeProgram
RISC-V program implementing the EVM `CALLDATASIZE` opcode.
CALLDATASIZE pushes the calldata byte length (held in the env block at
`callDataLenOff = 424`) onto the EVM stack as a 256-bit word. Because the
length always fits in 64 bits in any realistic execution, the valu... | @@ -49,8 +49,14 @@
abbrev evm_calldatasize_code (envBaseReg tmpReg : Reg) (base : Word) : CodeReq :=
CodeReq.ofProg base (evm_calldatasize envBaseReg tmpReg)
+/-- `evm_calldatasize` is exactly 6 RISC-V instructions = 24 bytes. -/
+theorem evm_calldatasize_length (envBaseReg tmpReg : Reg) :
+ (evm_calldatasize ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_22ff49cce65d_0 | d0dece27c9ea4315 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Terminating/RevertSpec.lean | RevertSpec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 7 | [
{
"theorem_name": "revert_seg_prologue",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- idx 0: ld x14, 0(x12)\n have t0 := ld_spec_within .x14 .x12 p x14o off 0 hbase (by nofun)\n have t0e := cpsTriple... | [
{
"name": "revertTailProg_length",
"text": "/-- Byte fidelity: the modelled tail is exactly 61 instructions. -/\n@[simp] theorem revertTailProg_length\n (hiMem : BitVec 20) (loMem : BitVec 12) (hiMem2 : BitVec 20) (loMem2 : BitVec 12)\n (hi2 : BitVec 20) (lo2 : BitVec 12) (hi1 : BitVec 20) (lo1 : BitV... | [
{
"name": "revert_seg_prologue",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 30,
"n_chars": 1874,
"n_subproofs": 7,
"n_tactics": 21,
"cyclomatic": 1,
"n_automation": 9,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_... | 1 | /-
EvmAsm.Evm64.Terminating.RevertSpec
Composition of the standalone (`depthAware = false`) `REVERT` (0xfd)
return-data descriptor window into a public `cpsTripleWithin` witness.
REVERT is a near-clone of `RETURN` (0xf3): the emitted tail
(`Codegen.Programs.NoopHalt.returnRevertTail 2 <rollbackAsm> false`) ... | /-
EvmAsm.Evm64.Terminating.RevertSpec
Composition of the standalone (`depthAware = false`) `REVERT` (0xfd)
return-data descriptor window into a public `cpsTripleWithin` witness.
REVERT is a near-clone of `RETURN` (0xf3): the emitted tail
(`Codegen.Programs.NoopHalt.returnRevertTail 2 <rollbackAsm> false`) ... | @@ -145,6 +145,14 @@
.ADDI .x1 .x1 lo1, -- 59
.JALR .x0 .x1 0 ] -- 60
+/-- Byte fidelity: the modelled tail is exactly 61 instructions. -/
+@[simp] theorem revertTailProg_length
+ (hiMem : BitVec 20) (loMem : BitVec 12) (hiMem2 : BitVec 20) (loMem2 : BitVec 12... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_22ff49cce65d_1 | dad8a9be32e531d2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Terminating/RevertSpec.lean | RevertSpec | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 7 | [
{
"theorem_name": "revert_seg_prologue",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- idx 0: ld x14, 0(x12)\n have t0 := ld_spec_within .x14 .x12 p x14o off 0 hbase (by nofun)\n have t0e := cpsTriple... | [
{
"name": "revertTailProg_length",
"text": "/-- Byte fidelity: the modelled tail is exactly 61 instructions. -/\n@[simp] theorem revertTailProg_length\n (hiMem : BitVec 20) (loMem : BitVec 12) (hiMem2 : BitVec 20) (loMem2 : BitVec 12)\n (hi2 : BitVec 20) (lo2 : BitVec 12) (hi1 : BitVec 20) (lo1 : BitV... | [
{
"name": "revert_seg_header",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 111,
"n_chars": 7669,
"n_subproofs": 31,
"n_tactics": 111,
"cyclomatic": 1,
"n_automation": 47,
"n_rewrites": 25,
"n_structural": 1,
"automation_only": false,
"m... | 1 | /-
EvmAsm.Evm64.Terminating.RevertSpec
Composition of the standalone (`depthAware = false`) `REVERT` (0xfd)
return-data descriptor window into a public `cpsTripleWithin` witness.
REVERT is a near-clone of `RETURN` (0xf3): the emitted tail
(`Codegen.Programs.NoopHalt.returnRevertTail 2 <rollbackAsm> false`) ... | /-
EvmAsm.Evm64.Terminating.RevertSpec
Composition of the standalone (`depthAware = false`) `REVERT` (0xfd)
return-data descriptor window into a public `cpsTripleWithin` witness.
REVERT is a near-clone of `RETURN` (0xf3): the emitted tail
(`Codegen.Programs.NoopHalt.returnRevertTail 2 <rollbackAsm> false`) ... | @@ -145,6 +145,14 @@
.ADDI .x1 .x1 lo1, -- 59
.JALR .x0 .x1 0 ] -- 60
+/-- Byte fidelity: the modelled tail is exactly 61 instructions. -/
+@[simp] theorem revertTailProg_length
+ (hiMem : BitVec 20) (loMem : BitVec 12) (hiMem2 : BitVec 20) (loMem2 : BitVec 12... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_22ff49cce65d_2 | 75e2af33e9a36797 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Terminating/RevertSpec.lean | RevertSpec | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 7 | [
{
"theorem_name": "revert_seg_prologue",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- idx 0: ld x14, 0(x12)\n have t0 := ld_spec_within .x14 .x12 p x14o off 0 hbase (by nofun)\n have t0e := cpsTriple... | [
{
"name": "revertTailProg_length",
"text": "/-- Byte fidelity: the modelled tail is exactly 61 instructions. -/\n@[simp] theorem revertTailProg_length\n (hiMem : BitVec 20) (loMem : BitVec 12) (hiMem2 : BitVec 20) (loMem2 : BitVec 12)\n (hi2 : BitVec 20) (lo2 : BitVec 12) (hi1 : BitVec 20) (lo1 : BitV... | [
{
"name": "revert_seg_clamp176",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 60,
"n_chars": 4044,
"n_subproofs": 21,
"n_tactics": 59,
"cyclomatic": 1,
"n_automation": 21,
"n_rewrites": 11,
"n_structural": 6,
"automation_only": false,
"m... | 1 | /-
EvmAsm.Evm64.Terminating.RevertSpec
Composition of the standalone (`depthAware = false`) `REVERT` (0xfd)
return-data descriptor window into a public `cpsTripleWithin` witness.
REVERT is a near-clone of `RETURN` (0xf3): the emitted tail
(`Codegen.Programs.NoopHalt.returnRevertTail 2 <rollbackAsm> false`) ... | /-
EvmAsm.Evm64.Terminating.RevertSpec
Composition of the standalone (`depthAware = false`) `REVERT` (0xfd)
return-data descriptor window into a public `cpsTripleWithin` witness.
REVERT is a near-clone of `RETURN` (0xf3): the emitted tail
(`Codegen.Programs.NoopHalt.returnRevertTail 2 <rollbackAsm> false`) ... | @@ -145,6 +145,14 @@
.ADDI .x1 .x1 lo1, -- 59
.JALR .x0 .x1 0 ] -- 60
+/-- Byte fidelity: the modelled tail is exactly 61 instructions. -/
+@[simp] theorem revertTailProg_length
+ (hiMem : BitVec 20) (loMem : BitVec 12) (hiMem2 : BitVec 20) (loMem2 : BitVec 12... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_22ff49cce65d_3 | 8237bbe43e26dd41 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Terminating/RevertSpec.lean | RevertSpec | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 7 | [
{
"theorem_name": "revert_seg_prologue",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- idx 0: ld x14, 0(x12)\n have t0 := ld_spec_within .x14 .x12 p x14o off 0 hbase (by nofun)\n have t0e := cpsTriple... | [
{
"name": "revertTailProg_length",
"text": "/-- Byte fidelity: the modelled tail is exactly 61 instructions. -/\n@[simp] theorem revertTailProg_length\n (hiMem : BitVec 20) (loMem : BitVec 12) (hiMem2 : BitVec 20) (loMem2 : BitVec 12)\n (hi2 : BitVec 20) (lo2 : BitVec 12) (hi1 : BitVec 20) (lo1 : BitV... | [
{
"name": "revert_seg_copy1",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 167,
"n_chars": 11936,
"n_subproofs": 34,
"n_tactics": 145,
"cyclomatic": 1,
"n_automation": 44,
"n_rewrites": 28,
"n_structural": 2,
"automation_only": false,
"m... | 1 | /-
EvmAsm.Evm64.Terminating.RevertSpec
Composition of the standalone (`depthAware = false`) `REVERT` (0xfd)
return-data descriptor window into a public `cpsTripleWithin` witness.
REVERT is a near-clone of `RETURN` (0xf3): the emitted tail
(`Codegen.Programs.NoopHalt.returnRevertTail 2 <rollbackAsm> false`) ... | /-
EvmAsm.Evm64.Terminating.RevertSpec
Composition of the standalone (`depthAware = false`) `REVERT` (0xfd)
return-data descriptor window into a public `cpsTripleWithin` witness.
REVERT is a near-clone of `RETURN` (0xf3): the emitted tail
(`Codegen.Programs.NoopHalt.returnRevertTail 2 <rollbackAsm> false`) ... | @@ -145,6 +145,14 @@
.ADDI .x1 .x1 lo1, -- 59
.JALR .x0 .x1 0 ] -- 60
+/-- Byte fidelity: the modelled tail is exactly 61 instructions. -/
+@[simp] theorem revertTailProg_length
+ (hiMem : BitVec 20) (loMem : BitVec 12) (hiMem2 : BitVec 20) (loMem2 : BitVec 12... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_22ff49cce65d_4 | 12906ffda8a4639f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Terminating/RevertSpec.lean | RevertSpec | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 7 | [
{
"theorem_name": "revert_seg_prologue",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- idx 0: ld x14, 0(x12)\n have t0 := ld_spec_within .x14 .x12 p x14o off 0 hbase (by nofun)\n have t0e := cpsTriple... | [
{
"name": "revertTailProg_length",
"text": "/-- Byte fidelity: the modelled tail is exactly 61 instructions. -/\n@[simp] theorem revertTailProg_length\n (hiMem : BitVec 20) (loMem : BitVec 12) (hiMem2 : BitVec 20) (loMem2 : BitVec 12)\n (hi2 : BitVec 20) (lo2 : BitVec 12) (hi1 : BitVec 20) (lo1 : BitV... | [
{
"name": "revert_seg_clamp32",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 107,
"n_chars": 7127,
"n_subproofs": 33,
"n_tactics": 102,
"cyclomatic": 1,
"n_automation": 33,
"n_rewrites": 17,
"n_structural": 6,
"automation_only": false,
"... | 1 | /-
EvmAsm.Evm64.Terminating.RevertSpec
Composition of the standalone (`depthAware = false`) `REVERT` (0xfd)
return-data descriptor window into a public `cpsTripleWithin` witness.
REVERT is a near-clone of `RETURN` (0xf3): the emitted tail
(`Codegen.Programs.NoopHalt.returnRevertTail 2 <rollbackAsm> false`) ... | /-
EvmAsm.Evm64.Terminating.RevertSpec
Composition of the standalone (`depthAware = false`) `REVERT` (0xfd)
return-data descriptor window into a public `cpsTripleWithin` witness.
REVERT is a near-clone of `RETURN` (0xf3): the emitted tail
(`Codegen.Programs.NoopHalt.returnRevertTail 2 <rollbackAsm> false`) ... | @@ -145,6 +145,14 @@
.ADDI .x1 .x1 lo1, -- 59
.JALR .x0 .x1 0 ] -- 60
+/-- Byte fidelity: the modelled tail is exactly 61 instructions. -/
+@[simp] theorem revertTailProg_length
+ (hiMem : BitVec 20) (loMem : BitVec 12) (hiMem2 : BitVec 20) (loMem2 : BitVec 12... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_22ff49cce65d_5 | c58c6352ff05a3e2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Terminating/RevertSpec.lean | RevertSpec | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 7 | [
{
"theorem_name": "revert_seg_prologue",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- idx 0: ld x14, 0(x12)\n have t0 := ld_spec_within .x14 .x12 p x14o off 0 hbase (by nofun)\n have t0e := cpsTriple... | [
{
"name": "revertTailProg_length",
"text": "/-- Byte fidelity: the modelled tail is exactly 61 instructions. -/\n@[simp] theorem revertTailProg_length\n (hiMem : BitVec 20) (loMem : BitVec 12) (hiMem2 : BitVec 20) (loMem2 : BitVec 12)\n (hi2 : BitVec 20) (lo2 : BitVec 12) (hi1 : BitVec 20) (lo1 : BitV... | [
{
"name": "revert_seg_copy2",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 60,
"n_chars": 4011,
"n_subproofs": 8,
"n_tactics": 41,
"cyclomatic": 1,
"n_automation": 16,
"n_rewrites": 13,
"n_structural": 3,
"automation_only": false,
"max_n... | 1 | /-
EvmAsm.Evm64.Terminating.RevertSpec
Composition of the standalone (`depthAware = false`) `REVERT` (0xfd)
return-data descriptor window into a public `cpsTripleWithin` witness.
REVERT is a near-clone of `RETURN` (0xf3): the emitted tail
(`Codegen.Programs.NoopHalt.returnRevertTail 2 <rollbackAsm> false`) ... | /-
EvmAsm.Evm64.Terminating.RevertSpec
Composition of the standalone (`depthAware = false`) `REVERT` (0xfd)
return-data descriptor window into a public `cpsTripleWithin` witness.
REVERT is a near-clone of `RETURN` (0xf3): the emitted tail
(`Codegen.Programs.NoopHalt.returnRevertTail 2 <rollbackAsm> false`) ... | @@ -145,6 +145,14 @@
.ADDI .x1 .x1 lo1, -- 59
.JALR .x0 .x1 0 ] -- 60
+/-- Byte fidelity: the modelled tail is exactly 61 instructions. -/
+@[simp] theorem revertTailProg_length
+ (hiMem : BitVec 20) (loMem : BitVec 12) (hiMem2 : BitVec 20) (loMem2 : BitVec 12... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_22ff49cce65d_6 | de1369589d24e737 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Terminating/RevertSpec.lean | RevertSpec | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 7 | [
{
"theorem_name": "revert_seg_prologue",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- idx 0: ld x14, 0(x12)\n have t0 := ld_spec_within .x14 .x12 p x14o off 0 hbase (by nofun)\n have t0e := cpsTriple... | [
{
"name": "revertTailProg_length",
"text": "/-- Byte fidelity: the modelled tail is exactly 61 instructions. -/\n@[simp] theorem revertTailProg_length\n (hiMem : BitVec 20) (loMem : BitVec 12) (hiMem2 : BitVec 20) (loMem2 : BitVec 12)\n (hi2 : BitVec 20) (lo2 : BitVec 12) (hi1 : BitVec 20) (lo1 : BitV... | [
{
"name": "revert_seg_kindrollbackhalt",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 164,
"n_chars": 11629,
"n_subproofs": 31,
"n_tactics": 136,
"cyclomatic": 1,
"n_automation": 36,
"n_rewrites": 15,
"n_structural": 1,
"automation_only": fa... | 1 | /-
EvmAsm.Evm64.Terminating.RevertSpec
Composition of the standalone (`depthAware = false`) `REVERT` (0xfd)
return-data descriptor window into a public `cpsTripleWithin` witness.
REVERT is a near-clone of `RETURN` (0xf3): the emitted tail
(`Codegen.Programs.NoopHalt.returnRevertTail 2 <rollbackAsm> false`) ... | /-
EvmAsm.Evm64.Terminating.RevertSpec
Composition of the standalone (`depthAware = false`) `REVERT` (0xfd)
return-data descriptor window into a public `cpsTripleWithin` witness.
REVERT is a near-clone of `RETURN` (0xf3): the emitted tail
(`Codegen.Programs.NoopHalt.returnRevertTail 2 <rollbackAsm> false`) ... | @@ -145,6 +145,14 @@
.ADDI .x1 .x1 lo1, -- 59
.JALR .x0 .x1 0 ] -- 60
+/-- Byte fidelity: the modelled tail is exactly 61 instructions. -/
+@[simp] theorem revertTailProg_length
+ (hiMem : BitVec 20) (loMem : BitVec 12) (hiMem2 : BitVec 20) (loMem2 : BitVec 12... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_22ff49cce65d_7 | f6b22930749a6566 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Terminating/RevertSpec.lean | RevertSpec | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "evm_revert_stack_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 136,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- length lemmas for the intermediate descriptor images\n have hRc1len : (copyIntoRegion\n (setBytes (... | [
{
"name": "revert_seg_clamp176",
"text": "/-- **Size-clamp-to-176 segment** (`hbase+56 → hbase+72`). `x21 := x15`,\n `x22 := 176`, then `bgeu x22,x21,3f` skips `mv x21,x22` when `x15 ≤ᵤ 176`. -/\ntheorem revert_seg_clamp176 (hbase : Word) (x15v x21o x22o : Word) :\n cpsTripleWithin 4 (hbase + 56) (hb... | [
{
"name": "evm_revert_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 7,
"n_deps_transitive": 8,
"n_lines": 208,
"n_chars": 14142,
"n_subproofs": 22,
"n_tactics": 127,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": fal... | 8 | /-
EvmAsm.Evm64.Terminating.RevertSpec
Composition of the standalone (`depthAware = false`) `REVERT` (0xfd)
return-data descriptor window into a public `cpsTripleWithin` witness.
REVERT is a near-clone of `RETURN` (0xf3): the emitted tail
(`Codegen.Programs.NoopHalt.returnRevertTail 2 <rollbackAsm> false`) ... | /-
EvmAsm.Evm64.Terminating.RevertSpec
Composition of the standalone (`depthAware = false`) `REVERT` (0xfd)
return-data descriptor window into a public `cpsTripleWithin` witness.
REVERT is a near-clone of `RETURN` (0xf3): the emitted tail
(`Codegen.Programs.NoopHalt.returnRevertTail 2 <rollbackAsm> false`) ... | @@ -304,6 +304,65 @@
simp only [returnDescZeroed]
xperm_chunked hq) c6)
+/-- **Size-clamp-to-176 segment** (`hbase+56 → hbase+72`). `x21 := x15`,
+ `x22 := 176`, then `bgeu x22,x21,3f` skips `mv x21,x22` when `x15 ≤ᵤ 176`. -/
+theorem revert_seg_clamp176 (hbase : Word) (x15v x21o x22o : 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_7cf7d84efa51_0 | 7a238fc5e4e86cbf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceFoldInvariant.lean | ReduceFoldInvariant | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "mulModReduceStepNCarry_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro k\n induction k with\n | zero => intro w r hr; exact hr\n | succ k ih =>\n intro w r hr\n rw [mulM... | [
{
"name": "mulModReduceStepNCarry_succ",
"text": "theorem mulModReduceStepNCarry_succ (r n : EvmWord) (w : Word) (k : Nat) :\n mulModReduceStepNCarry r n w (k + 1) =\n mulModReduceStepNCarry (mulModReduceStepCarry r n (mulModReduceInputBit w)) n (w <<< 1) k :=\n rfl\n\n",
"fan_in": 1,
"n_li... | [
{
"name": "mulModReduceStepNCarry_lt",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 471,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 6,
"automation_only": false,
"... | 2 | /-
EvmAsm.Evm64.MulMod.ReduceFoldInvariant
Carry-aware analogues of the bit-serial reducer folds, together with the
`r < n` invariant that every accumulator value satisfies.
`ReduceSemantics` defines the folds (`mulModReduceStepN`,
`mulModReduceOuterFold`) over the *non* carry-aware step `mulModReduceStep`,... | /-
EvmAsm.Evm64.MulMod.ReduceFoldInvariant
Carry-aware analogues of the bit-serial reducer folds, together with the
`r < n` invariant that every accumulator value satisfies.
`ReduceSemantics` defines the folds (`mulModReduceStepN`,
`mulModReduceOuterFold`) over the *non* carry-aware step `mulModReduceStep`,... | @@ -43,6 +43,11 @@
@[simp] theorem mulModReduceStepNCarry_zero (r n : EvmWord) (w : Word) :
mulModReduceStepNCarry r n w 0 = r := rfl
+theorem mulModReduceStepNCarry_succ (r n : EvmWord) (w : Word) (k : Nat) :
+ mulModReduceStepNCarry r n w (k + 1) =
+ mulModReduceStepNCarry (mulModReduceStepCarry r 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_7cf7d84efa51_1 | ff441926b146ab0f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceFoldInvariant.lean | ReduceFoldInvariant | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "mulModReduceOuterFoldCarry_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro m\n induction m with\n | zero => intro limb r hr; exact hr\n | succ m ih =>\n intro limb r hr\n ... | [
{
"name": "mulModReduceStepNCarry_lt",
"text": "/-- The `k`-bit carry-aware bit loop preserves the remainder invariant. -/\ntheorem mulModReduceStepNCarry_lt (n : EvmWord) (hn : 0 < n.toNat) :\n ∀ (k : Nat) (w : Word) (r : EvmWord), r.toNat < n.toNat →\n (mulModReduceStepNCarry r n w k).toNat < n.to... | [
{
"name": "mulModReduceOuterFoldCarry_lt",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 14,
"n_chars": 545,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 6,
"automation_only": false,
... | 4 | /-
EvmAsm.Evm64.MulMod.ReduceFoldInvariant
Carry-aware analogues of the bit-serial reducer folds, together with the
`r < n` invariant that every accumulator value satisfies.
`ReduceSemantics` defines the folds (`mulModReduceStepN`,
`mulModReduceOuterFold`) over the *non* carry-aware step `mulModReduceStep`,... | /-
EvmAsm.Evm64.MulMod.ReduceFoldInvariant
Carry-aware analogues of the bit-serial reducer folds, together with the
`r < n` invariant that every accumulator value satisfies.
`ReduceSemantics` defines the folds (`mulModReduceStepN`,
`mulModReduceOuterFold`) over the *non* carry-aware step `mulModReduceStep`,... | @@ -48,6 +48,18 @@
mulModReduceStepNCarry (mulModReduceStepCarry r n (mulModReduceInputBit w)) n (w <<< 1) k :=
rfl
+/-- The `k`-bit carry-aware bit loop preserves the remainder invariant. -/
+theorem mulModReduceStepNCarry_lt (n : EvmWord) (hn : 0 < n.toNat) :
+ ∀ (k : Nat) (w : Word) (r : EvmWord), r.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_e10c2284cbe6_0 | 10a7c85e012e1532 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/StepProofs.lean | StepProofs | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 8 | [
{
"theorem_name": "beq_step_sail_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨sSail', h_exec, h_rel, h_np⟩ :=\n beq_sail_equiv sRv sSail hrelpc.toStateRel hrelpc.pc_agree h_nextpc h_misa... | [
{
"name": "step_of_execute",
"text": "/-- Generic `execute ; tick_pc` glue. If a SAIL computation `m` reduces to a\n state `sSail'` that agrees with the post Rv64 state `sRv'` on registers and\n memory (`StateRel`) and whose `nextPC` is the post Rv64 `pc`, then running\n `m >>= tick_pc` commits th... | [
{
"name": "beq_step_sail_equiv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 758,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_ne... | 1 | /-
EvmAsm.Rv64.SailEquiv.StepProofs
PC-aware step equivalence: the capstone that finally makes the **program
counter** part of the Rv64 ↔ SAIL comparison for control-flow instructions.
The per-instruction `*_sail_equiv` theorems relate the SAIL `execute_*`
computation to `execInstrBr`, but `execute_*` only ... | /-
EvmAsm.Rv64.SailEquiv.StepProofs
PC-aware step equivalence: the capstone that finally makes the **program
counter** part of the Rv64 ↔ SAIL comparison for control-flow instructions.
The per-instruction `*_sail_equiv` theorems relate the SAIL `execute_*`
computation to `execInstrBr`, but `execute_*` only ... | @@ -26,6 +26,30 @@
namespace EvmAsm.Rv64.SailEquiv
+/-- Generic `execute ; tick_pc` glue. If a SAIL computation `m` reduces to a
+ state `sSail'` that agrees with the post Rv64 state `sRv'` on registers and
+ memory (`StateRel`) and whose `nextPC` is the post Rv64 `pc`, then running
+ `m >>= tick_pc` com... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e10c2284cbe6_1 | 687d0d207be419c4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/StepProofs.lean | StepProofs | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 8 | [
{
"theorem_name": "beq_step_sail_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨sSail', h_exec, h_rel, h_np⟩ :=\n beq_sail_equiv sRv sSail hrelpc.toStateRel hrelpc.pc_agree h_nextpc h_misa... | [
{
"name": "step_of_execute",
"text": "/-- Generic `execute ; tick_pc` glue. If a SAIL computation `m` reduces to a\n state `sSail'` that agrees with the post Rv64 state `sRv'` on registers and\n memory (`StateRel`) and whose `nextPC` is the post Rv64 `pc`, then running\n `m >>= tick_pc` commits th... | [
{
"name": "bne_step_sail_equiv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 758,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_ne... | 1 | /-
EvmAsm.Rv64.SailEquiv.StepProofs
PC-aware step equivalence: the capstone that finally makes the **program
counter** part of the Rv64 ↔ SAIL comparison for control-flow instructions.
The per-instruction `*_sail_equiv` theorems relate the SAIL `execute_*`
computation to `execInstrBr`, but `execute_*` only ... | /-
EvmAsm.Rv64.SailEquiv.StepProofs
PC-aware step equivalence: the capstone that finally makes the **program
counter** part of the Rv64 ↔ SAIL comparison for control-flow instructions.
The per-instruction `*_sail_equiv` theorems relate the SAIL `execute_*`
computation to `execInstrBr`, but `execute_*` only ... | @@ -26,6 +26,30 @@
namespace EvmAsm.Rv64.SailEquiv
+/-- Generic `execute ; tick_pc` glue. If a SAIL computation `m` reduces to a
+ state `sSail'` that agrees with the post Rv64 state `sRv'` on registers and
+ memory (`StateRel`) and whose `nextPC` is the post Rv64 `pc`, then running
+ `m >>= tick_pc` com... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e10c2284cbe6_2 | 725b267d4172267e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/StepProofs.lean | StepProofs | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 8 | [
{
"theorem_name": "beq_step_sail_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨sSail', h_exec, h_rel, h_np⟩ :=\n beq_sail_equiv sRv sSail hrelpc.toStateRel hrelpc.pc_agree h_nextpc h_misa... | [
{
"name": "step_of_execute",
"text": "/-- Generic `execute ; tick_pc` glue. If a SAIL computation `m` reduces to a\n state `sSail'` that agrees with the post Rv64 state `sRv'` on registers and\n memory (`StateRel`) and whose `nextPC` is the post Rv64 `pc`, then running\n `m >>= tick_pc` commits th... | [
{
"name": "blt_step_sail_equiv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 758,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_ne... | 1 | /-
EvmAsm.Rv64.SailEquiv.StepProofs
PC-aware step equivalence: the capstone that finally makes the **program
counter** part of the Rv64 ↔ SAIL comparison for control-flow instructions.
The per-instruction `*_sail_equiv` theorems relate the SAIL `execute_*`
computation to `execInstrBr`, but `execute_*` only ... | /-
EvmAsm.Rv64.SailEquiv.StepProofs
PC-aware step equivalence: the capstone that finally makes the **program
counter** part of the Rv64 ↔ SAIL comparison for control-flow instructions.
The per-instruction `*_sail_equiv` theorems relate the SAIL `execute_*`
computation to `execInstrBr`, but `execute_*` only ... | @@ -26,6 +26,30 @@
namespace EvmAsm.Rv64.SailEquiv
+/-- Generic `execute ; tick_pc` glue. If a SAIL computation `m` reduces to a
+ state `sSail'` that agrees with the post Rv64 state `sRv'` on registers and
+ memory (`StateRel`) and whose `nextPC` is the post Rv64 `pc`, then running
+ `m >>= tick_pc` com... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e10c2284cbe6_3 | 5b46b03509fa783b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/StepProofs.lean | StepProofs | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 8 | [
{
"theorem_name": "beq_step_sail_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨sSail', h_exec, h_rel, h_np⟩ :=\n beq_sail_equiv sRv sSail hrelpc.toStateRel hrelpc.pc_agree h_nextpc h_misa... | [
{
"name": "step_of_execute",
"text": "/-- Generic `execute ; tick_pc` glue. If a SAIL computation `m` reduces to a\n state `sSail'` that agrees with the post Rv64 state `sRv'` on registers and\n memory (`StateRel`) and whose `nextPC` is the post Rv64 `pc`, then running\n `m >>= tick_pc` commits th... | [
{
"name": "bge_step_sail_equiv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 758,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_ne... | 1 | /-
EvmAsm.Rv64.SailEquiv.StepProofs
PC-aware step equivalence: the capstone that finally makes the **program
counter** part of the Rv64 ↔ SAIL comparison for control-flow instructions.
The per-instruction `*_sail_equiv` theorems relate the SAIL `execute_*`
computation to `execInstrBr`, but `execute_*` only ... | /-
EvmAsm.Rv64.SailEquiv.StepProofs
PC-aware step equivalence: the capstone that finally makes the **program
counter** part of the Rv64 ↔ SAIL comparison for control-flow instructions.
The per-instruction `*_sail_equiv` theorems relate the SAIL `execute_*`
computation to `execInstrBr`, but `execute_*` only ... | @@ -26,6 +26,30 @@
namespace EvmAsm.Rv64.SailEquiv
+/-- Generic `execute ; tick_pc` glue. If a SAIL computation `m` reduces to a
+ state `sSail'` that agrees with the post Rv64 state `sRv'` on registers and
+ memory (`StateRel`) and whose `nextPC` is the post Rv64 `pc`, then running
+ `m >>= tick_pc` com... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e10c2284cbe6_4 | 154a6c3f56155885 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/StepProofs.lean | StepProofs | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 8 | [
{
"theorem_name": "beq_step_sail_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨sSail', h_exec, h_rel, h_np⟩ :=\n beq_sail_equiv sRv sSail hrelpc.toStateRel hrelpc.pc_agree h_nextpc h_misa... | [
{
"name": "step_of_execute",
"text": "/-- Generic `execute ; tick_pc` glue. If a SAIL computation `m` reduces to a\n state `sSail'` that agrees with the post Rv64 state `sRv'` on registers and\n memory (`StateRel`) and whose `nextPC` is the post Rv64 `pc`, then running\n `m >>= tick_pc` commits th... | [
{
"name": "bltu_step_sail_equiv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 762,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_n... | 1 | /-
EvmAsm.Rv64.SailEquiv.StepProofs
PC-aware step equivalence: the capstone that finally makes the **program
counter** part of the Rv64 ↔ SAIL comparison for control-flow instructions.
The per-instruction `*_sail_equiv` theorems relate the SAIL `execute_*`
computation to `execInstrBr`, but `execute_*` only ... | /-
EvmAsm.Rv64.SailEquiv.StepProofs
PC-aware step equivalence: the capstone that finally makes the **program
counter** part of the Rv64 ↔ SAIL comparison for control-flow instructions.
The per-instruction `*_sail_equiv` theorems relate the SAIL `execute_*`
computation to `execInstrBr`, but `execute_*` only ... | @@ -26,6 +26,30 @@
namespace EvmAsm.Rv64.SailEquiv
+/-- Generic `execute ; tick_pc` glue. If a SAIL computation `m` reduces to a
+ state `sSail'` that agrees with the post Rv64 state `sRv'` on registers and
+ memory (`StateRel`) and whose `nextPC` is the post Rv64 `pc`, then running
+ `m >>= tick_pc` com... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e10c2284cbe6_5 | 370f45770212baf2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/StepProofs.lean | StepProofs | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 8 | [
{
"theorem_name": "beq_step_sail_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨sSail', h_exec, h_rel, h_np⟩ :=\n beq_sail_equiv sRv sSail hrelpc.toStateRel hrelpc.pc_agree h_nextpc h_misa... | [
{
"name": "step_of_execute",
"text": "/-- Generic `execute ; tick_pc` glue. If a SAIL computation `m` reduces to a\n state `sSail'` that agrees with the post Rv64 state `sRv'` on registers and\n memory (`StateRel`) and whose `nextPC` is the post Rv64 `pc`, then running\n `m >>= tick_pc` commits th... | [
{
"name": "bgeu_step_sail_equiv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 989,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_n... | 1 | /-
EvmAsm.Rv64.SailEquiv.StepProofs
PC-aware step equivalence: the capstone that finally makes the **program
counter** part of the Rv64 ↔ SAIL comparison for control-flow instructions.
The per-instruction `*_sail_equiv` theorems relate the SAIL `execute_*`
computation to `execInstrBr`, but `execute_*` only ... | /-
EvmAsm.Rv64.SailEquiv.StepProofs
PC-aware step equivalence: the capstone that finally makes the **program
counter** part of the Rv64 ↔ SAIL comparison for control-flow instructions.
The per-instruction `*_sail_equiv` theorems relate the SAIL `execute_*`
computation to `execInstrBr`, but `execute_*` only ... | @@ -26,6 +26,30 @@
namespace EvmAsm.Rv64.SailEquiv
+/-- Generic `execute ; tick_pc` glue. If a SAIL computation `m` reduces to a
+ state `sSail'` that agrees with the post Rv64 state `sRv'` on registers and
+ memory (`StateRel`) and whose `nextPC` is the post Rv64 `pc`, then running
+ `m >>= tick_pc` com... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e10c2284cbe6_6 | 7b1955c13efc6041 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/StepProofs.lean | StepProofs | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 8 | [
{
"theorem_name": "beq_step_sail_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨sSail', h_exec, h_rel, h_np⟩ :=\n beq_sail_equiv sRv sSail hrelpc.toStateRel hrelpc.pc_agree h_nextpc h_misa... | [
{
"name": "step_of_execute",
"text": "/-- Generic `execute ; tick_pc` glue. If a SAIL computation `m` reduces to a\n state `sSail'` that agrees with the post Rv64 state `sRv'` on registers and\n memory (`StateRel`) and whose `nextPC` is the post Rv64 `pc`, then running\n `m >>= tick_pc` commits th... | [
{
"name": "jal_step_sail_equiv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 714,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_ne... | 1 | /-
EvmAsm.Rv64.SailEquiv.StepProofs
PC-aware step equivalence: the capstone that finally makes the **program
counter** part of the Rv64 ↔ SAIL comparison for control-flow instructions.
The per-instruction `*_sail_equiv` theorems relate the SAIL `execute_*`
computation to `execInstrBr`, but `execute_*` only ... | /-
EvmAsm.Rv64.SailEquiv.StepProofs
PC-aware step equivalence: the capstone that finally makes the **program
counter** part of the Rv64 ↔ SAIL comparison for control-flow instructions.
The per-instruction `*_sail_equiv` theorems relate the SAIL `execute_*`
computation to `execInstrBr`, but `execute_*` only ... | @@ -26,6 +26,30 @@
namespace EvmAsm.Rv64.SailEquiv
+/-- Generic `execute ; tick_pc` glue. If a SAIL computation `m` reduces to a
+ state `sSail'` that agrees with the post Rv64 state `sRv'` on registers and
+ memory (`StateRel`) and whose `nextPC` is the post Rv64 `pc`, then running
+ `m >>= tick_pc` com... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e10c2284cbe6_7 | 34cc56ceb79e7910 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/StepProofs.lean | StepProofs | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 8 | [
{
"theorem_name": "beq_step_sail_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨sSail', h_exec, h_rel, h_np⟩ :=\n beq_sail_equiv sRv sSail hrelpc.toStateRel hrelpc.pc_agree h_nextpc h_misa... | [
{
"name": "step_of_execute",
"text": "/-- Generic `execute ; tick_pc` glue. If a SAIL computation `m` reduces to a\n state `sSail'` that agrees with the post Rv64 state `sRv'` on registers and\n memory (`StateRel`) and whose `nextPC` is the post Rv64 `pc`, then running\n `m >>= tick_pc` commits th... | [
{
"name": "jalr_step_sail_equiv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 842,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_n... | 1 | /-
EvmAsm.Rv64.SailEquiv.StepProofs
PC-aware step equivalence: the capstone that finally makes the **program
counter** part of the Rv64 ↔ SAIL comparison for control-flow instructions.
The per-instruction `*_sail_equiv` theorems relate the SAIL `execute_*`
computation to `execInstrBr`, but `execute_*` only ... | /-
EvmAsm.Rv64.SailEquiv.StepProofs
PC-aware step equivalence: the capstone that finally makes the **program
counter** part of the Rv64 ↔ SAIL comparison for control-flow instructions.
The per-instruction `*_sail_equiv` theorems relate the SAIL `execute_*`
computation to `execInstrBr`, but `execute_*` only ... | @@ -26,6 +26,30 @@
namespace EvmAsm.Rv64.SailEquiv
+/-- Generic `execute ; tick_pc` glue. If a SAIL computation `m` reduces to a
+ state `sSail'` that agrees with the post Rv64 state `sRv'` on registers and
+ memory (`StateRel`) and whose `nextPC` is the post Rv64 `pc`, then running
+ `m >>= tick_pc` com... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0cf7c32cdc79_0 | e29426138aec59fb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/PrefixChainV5.lean | PrefixChainV5 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "saveRa_dividendSign_then_preserve_spec_in_smodCodeV5",
"depth": 1,
"n_commands": 0,
"n_lines": 84,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let dividendSign := dividendTop >>> (63 : BitVec 6).toNat\n let pre : EvmAsm.Rv64.As... | [
{
"name": "saveRa_then_dividendSign_spec_in_smodCodeV5",
"text": "theorem saveRa_then_dividendSign_spec_in_smodCodeV5\n (vRa vSavedOld sp sOld dividendTop : Word) (base : Word) :\n EvmAsm.Rv64.cpsTripleWithin 3 base ((base + dividendSignOff) + 8) (smodCodeV5 base)\n (((.x1 ↦ᵣ vRa) ** (.x18 ↦ᵣ vSa... | [
{
"name": "saveRa_dividendSign_then_preserve_spec_in_smodCodeV5",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 103,
"n_chars": 4509,
"n_subproofs": 6,
"n_tactics": 84,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 5,
"... | 1 | /-
EvmAsm.Evm64.SMod.Compose.PrefixChainV5
v5 SMOD wrapper-prefix composition ladder over `smodCodeV5` — verbatim v4→v5
mirrors (the wrapper prefix is byte-identical between evm_smod_v4 and
evm_smod_v5; only the appended callable differs). Bottom-up: saveRa →
dividendSign → preserve → divisorSign → dividendA... | /-
EvmAsm.Evm64.SMod.Compose.PrefixChainV5
v5 SMOD wrapper-prefix composition ladder over `smodCodeV5` — verbatim v4→v5
mirrors (the wrapper prefix is byte-identical between evm_smod_v4 and
evm_smod_v5; only the appended callable differs). Bottom-up: saveRa →
dividendSign → preserve → divisorSign → dividendA... | @@ -17,6 +17,54 @@
open EvmAsm.Rv64.Tactics
+theorem saveRa_then_dividendSign_spec_in_smodCodeV5
+ (vRa vSavedOld sp sOld dividendTop : Word) (base : Word) :
+ EvmAsm.Rv64.cpsTripleWithin 3 base ((base + dividendSignOff) + 8) (smodCodeV5 base)
+ (((.x1 ↦ᵣ vRa) ** (.x18 ↦ᵣ vSavedOld)) **
+ ((.x12 ↦... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0cf7c32cdc79_1 | 9d089f3bc96d314e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/PrefixChainV5.lean | PrefixChainV5 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "saveRa_dividendSign_then_preserve_spec_in_smodCodeV5",
"depth": 1,
"n_commands": 0,
"n_lines": 84,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let dividendSign := dividendTop >>> (63 : BitVec 6).toNat\n let pre : EvmAsm.Rv64.As... | [
{
"name": "saveRa_then_dividendSign_spec_in_smodCodeV5",
"text": "theorem saveRa_then_dividendSign_spec_in_smodCodeV5\n (vRa vSavedOld sp sOld dividendTop : Word) (base : Word) :\n EvmAsm.Rv64.cpsTripleWithin 3 base ((base + dividendSignOff) + 8) (smodCodeV5 base)\n (((.x1 ↦ᵣ vRa) ** (.x18 ↦ᵣ vSa... | [
{
"name": "saveRa_dividendSign_preserve_then_divisorSign_spec_in_smodCodeV5",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 126,
"n_chars": 5883,
"n_subproofs": 6,
"n_tactics": 99,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 1,
"n_structura... | 2 | /-
EvmAsm.Evm64.SMod.Compose.PrefixChainV5
v5 SMOD wrapper-prefix composition ladder over `smodCodeV5` — verbatim v4→v5
mirrors (the wrapper prefix is byte-identical between evm_smod_v4 and
evm_smod_v5; only the appended callable differs). Bottom-up: saveRa →
dividendSign → preserve → divisorSign → dividendA... | /-
EvmAsm.Evm64.SMod.Compose.PrefixChainV5
v5 SMOD wrapper-prefix composition ladder over `smodCodeV5` — verbatim v4→v5
mirrors (the wrapper prefix is byte-identical between evm_smod_v4 and
evm_smod_v5; only the appended callable differs). Bottom-up: saveRa →
dividendSign → preserve → divisorSign → dividendA... | @@ -17,6 +17,54 @@
open EvmAsm.Rv64.Tactics
+theorem saveRa_then_dividendSign_spec_in_smodCodeV5
+ (vRa vSavedOld sp sOld dividendTop : Word) (base : Word) :
+ EvmAsm.Rv64.cpsTripleWithin 3 base ((base + dividendSignOff) + 8) (smodCodeV5 base)
+ (((.x1 ↦ᵣ vRa) ** (.x18 ↦ᵣ vSavedOld)) **
+ ((.x12 ↦... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0cf7c32cdc79_2 | 3e9a872c7261214a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/PrefixChainV5.lean | PrefixChainV5 | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "saveRa_dividendSign_then_preserve_spec_in_smodCodeV5",
"depth": 1,
"n_commands": 0,
"n_lines": 84,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let dividendSign := dividendTop >>> (63 : BitVec 6).toNat\n let pre : EvmAsm.Rv64.As... | [
{
"name": "saveRa_then_dividendSign_spec_in_smodCodeV5",
"text": "theorem saveRa_then_dividendSign_spec_in_smodCodeV5\n (vRa vSavedOld sp sOld dividendTop : Word) (base : Word) :\n EvmAsm.Rv64.cpsTripleWithin 3 base ((base + dividendSignOff) + 8) (smodCodeV5 base)\n (((.x1 ↦ᵣ vRa) ** (.x18 ↦ᵣ vSa... | [
{
"name": "saveRa_signs_then_dividendAbs_spec_in_smodCodeV5",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 140,
"n_chars": 7340,
"n_subproofs": 4,
"n_tactics": 91,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 0,
"auto... | 3 | /-
EvmAsm.Evm64.SMod.Compose.PrefixChainV5
v5 SMOD wrapper-prefix composition ladder over `smodCodeV5` — verbatim v4→v5
mirrors (the wrapper prefix is byte-identical between evm_smod_v4 and
evm_smod_v5; only the appended callable differs). Bottom-up: saveRa →
dividendSign → preserve → divisorSign → dividendA... | /-
EvmAsm.Evm64.SMod.Compose.PrefixChainV5
v5 SMOD wrapper-prefix composition ladder over `smodCodeV5` — verbatim v4→v5
mirrors (the wrapper prefix is byte-identical between evm_smod_v4 and
evm_smod_v5; only the appended callable differs). Bottom-up: saveRa →
dividendSign → preserve → divisorSign → dividendA... | @@ -17,6 +17,54 @@
open EvmAsm.Rv64.Tactics
+theorem saveRa_then_dividendSign_spec_in_smodCodeV5
+ (vRa vSavedOld sp sOld dividendTop : Word) (base : Word) :
+ EvmAsm.Rv64.cpsTripleWithin 3 base ((base + dividendSignOff) + 8) (smodCodeV5 base)
+ (((.x1 ↦ᵣ vRa) ** (.x18 ↦ᵣ vSavedOld)) **
+ ((.x12 ↦... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0cf7c32cdc79_3 | 5da9adb8e3960798 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/PrefixChainV5.lean | PrefixChainV5 | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "saveRa_dividendSign_then_preserve_spec_in_smodCodeV5",
"depth": 1,
"n_commands": 0,
"n_lines": 84,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let dividendSign := dividendTop >>> (63 : BitVec 6).toNat\n let pre : EvmAsm.Rv64.As... | [
{
"name": "saveRa_then_dividendSign_spec_in_smodCodeV5",
"text": "theorem saveRa_then_dividendSign_spec_in_smodCodeV5\n (vRa vSavedOld sp sOld dividendTop : Word) (base : Word) :\n EvmAsm.Rv64.cpsTripleWithin 3 base ((base + dividendSignOff) + 8) (smodCodeV5 base)\n (((.x1 ↦ᵣ vRa) ** (.x18 ↦ᵣ vSa... | [
{
"name": "saveRa_signs_abs_then_divisorAbs_spec_in_smodCodeV5",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 214,
"n_chars": 12656,
"n_subproofs": 3,
"n_tactics": 145,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 0,
... | 4 | /-
EvmAsm.Evm64.SMod.Compose.PrefixChainV5
v5 SMOD wrapper-prefix composition ladder over `smodCodeV5` — verbatim v4→v5
mirrors (the wrapper prefix is byte-identical between evm_smod_v4 and
evm_smod_v5; only the appended callable differs). Bottom-up: saveRa →
dividendSign → preserve → divisorSign → dividendA... | /-
EvmAsm.Evm64.SMod.Compose.PrefixChainV5
v5 SMOD wrapper-prefix composition ladder over `smodCodeV5` — verbatim v4→v5
mirrors (the wrapper prefix is byte-identical between evm_smod_v4 and
evm_smod_v5; only the appended callable differs). Bottom-up: saveRa →
dividendSign → preserve → divisorSign → dividendA... | @@ -17,6 +17,54 @@
open EvmAsm.Rv64.Tactics
+theorem saveRa_then_dividendSign_spec_in_smodCodeV5
+ (vRa vSavedOld sp sOld dividendTop : Word) (base : Word) :
+ EvmAsm.Rv64.cpsTripleWithin 3 base ((base + dividendSignOff) + 8) (smodCodeV5 base)
+ (((.x1 ↦ᵣ vRa) ** (.x18 ↦ᵣ vSavedOld)) **
+ ((.x12 ↦... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0cf7c32cdc79_4 | c32a55a751ac0ff9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/PrefixChainV5.lean | PrefixChainV5 | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "saveRa_dividendSign_preserve_then_divisorSign_spec_in_smodCodeV5",
"depth": 1,
"n_commands": 0,
"n_lines": 99,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let dividendSign := dividendTop >>> (63 : BitVec 6).toNat\n let divisorS... | [
{
"name": "saveRa_dividendSign_then_preserve_spec_in_smodCodeV5",
"text": "theorem saveRa_dividendSign_then_preserve_spec_in_smodCodeV5\n (vRa vSavedOld sp sOld x13Old dividendTop : Word) (base : Word) :\n EvmAsm.Rv64.cpsTripleWithin 4 base ((base + preserveDividendSignOff) + 4)\n (smodCodeV5 bas... | [
{
"name": "saveRa_signs_abs_then_modCall_spec_in_smodCodeV5",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 216,
"n_chars": 12639,
"n_subproofs": 5,
"n_tactics": 136,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 2,
"au... | 5 | /-
EvmAsm.Evm64.SMod.Compose.PrefixChainV5
v5 SMOD wrapper-prefix composition ladder over `smodCodeV5` — verbatim v4→v5
mirrors (the wrapper prefix is byte-identical between evm_smod_v4 and
evm_smod_v5; only the appended callable differs). Bottom-up: saveRa →
dividendSign → preserve → divisorSign → dividendA... | /-
EvmAsm.Evm64.SMod.Compose.PrefixChainV5
v5 SMOD wrapper-prefix composition ladder over `smodCodeV5` — verbatim v4→v5
mirrors (the wrapper prefix is byte-identical between evm_smod_v4 and
evm_smod_v5; only the appended callable differs). Bottom-up: saveRa →
dividendSign → preserve → divisorSign → dividendA... | @@ -65,6 +65,107 @@
have hSeq := EvmAsm.Rv64.cpsTripleWithin_seq_same_cr hSave hSign'
simpa [saveRaOff] using hSeq
+theorem saveRa_dividendSign_then_preserve_spec_in_smodCodeV5
+ (vRa vSavedOld sp sOld x13Old dividendTop : Word) (base : Word) :
+ EvmAsm.Rv64.cpsTripleWithin 4 base ((base + preserveDividen... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0cf7c32cdc79_5 | 37d6915ff80ae9ff | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/PrefixChainV5.lean | PrefixChainV5 | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "saveRa_dividendSign_preserve_then_divisorSign_spec_in_smodCodeV5",
"depth": 1,
"n_commands": 0,
"n_lines": 99,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let dividendSign := dividendTop >>> (63 : BitVec 6).toNat\n let divisorS... | [
{
"name": "saveRa_dividendSign_then_preserve_spec_in_smodCodeV5",
"text": "theorem saveRa_dividendSign_then_preserve_spec_in_smodCodeV5\n (vRa vSavedOld sp sOld x13Old dividendTop : Word) (base : Word) :\n EvmAsm.Rv64.cpsTripleWithin 4 base ((base + preserveDividendSignOff) + 4)\n (smodCodeV5 bas... | [
{
"name": "saveRa_signs_abs_then_modCall_dispatchReady_spec_in_smodCodeV5",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 55,
"n_chars": 2938,
"n_subproofs": 0,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural":... | 6 | /-
EvmAsm.Evm64.SMod.Compose.PrefixChainV5
v5 SMOD wrapper-prefix composition ladder over `smodCodeV5` — verbatim v4→v5
mirrors (the wrapper prefix is byte-identical between evm_smod_v4 and
evm_smod_v5; only the appended callable differs). Bottom-up: saveRa →
dividendSign → preserve → divisorSign → dividendA... | /-
EvmAsm.Evm64.SMod.Compose.PrefixChainV5
v5 SMOD wrapper-prefix composition ladder over `smodCodeV5` — verbatim v4→v5
mirrors (the wrapper prefix is byte-identical between evm_smod_v4 and
evm_smod_v5; only the appended callable differs). Bottom-up: saveRa →
dividendSign → preserve → divisorSign → dividendA... | @@ -65,6 +65,107 @@
have hSeq := EvmAsm.Rv64.cpsTripleWithin_seq_same_cr hSave hSign'
simpa [saveRaOff] using hSeq
+theorem saveRa_dividendSign_then_preserve_spec_in_smodCodeV5
+ (vRa vSavedOld sp sOld x13Old dividendTop : Word) (base : Word) :
+ EvmAsm.Rv64.cpsTripleWithin 4 base ((base + preserveDividen... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0cf7c32cdc79_6 | bcae0107edfa1a5d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/PrefixChainV5.lean | PrefixChainV5 | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "saveRa_dividendSign_preserve_then_divisorSign_spec_in_smodCodeV5",
"depth": 1,
"n_commands": 0,
"n_lines": 99,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let dividendSign := dividendTop >>> (63 : BitVec 6).toNat\n let divisorS... | [
{
"name": "saveRa_dividendSign_then_preserve_spec_in_smodCodeV5",
"text": "theorem saveRa_dividendSign_then_preserve_spec_in_smodCodeV5\n (vRa vSavedOld sp sOld x13Old dividendTop : Word) (base : Word) :\n EvmAsm.Rv64.cpsTripleWithin 4 base ((base + preserveDividendSignOff) + 4)\n (smodCodeV5 bas... | [
{
"name": "saveRa_signs_abs_then_modCall_dispatchReady_then_exact_callable_spec_in_smodCodeV5",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 57,
"n_chars": 3285,
"n_subproofs": 2,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,... | 7 | /-
EvmAsm.Evm64.SMod.Compose.PrefixChainV5
v5 SMOD wrapper-prefix composition ladder over `smodCodeV5` — verbatim v4→v5
mirrors (the wrapper prefix is byte-identical between evm_smod_v4 and
evm_smod_v5; only the appended callable differs). Bottom-up: saveRa →
dividendSign → preserve → divisorSign → dividendA... | /-
EvmAsm.Evm64.SMod.Compose.PrefixChainV5
v5 SMOD wrapper-prefix composition ladder over `smodCodeV5` — verbatim v4→v5
mirrors (the wrapper prefix is byte-identical between evm_smod_v4 and
evm_smod_v5; only the appended callable differs). Bottom-up: saveRa →
dividendSign → preserve → divisorSign → dividendA... | @@ -65,6 +65,107 @@
have hSeq := EvmAsm.Rv64.cpsTripleWithin_seq_same_cr hSave hSign'
simpa [saveRaOff] using hSeq
+theorem saveRa_dividendSign_then_preserve_spec_in_smodCodeV5
+ (vRa vSavedOld sp sOld x13Old dividendTop : Word) (base : Word) :
+ EvmAsm.Rv64.cpsTripleWithin 4 base ((base + preserveDividen... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c8e0e7da34d8_0 | 179eb0141bb092a6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6Shift0ChainBridge.lean | V6Shift0ChainBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 7 | [
{
"theorem_name": "v6chainQ3_shift0_eq_model",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [v6chainQ3, div128V5CodeQuot_eq_div128Quot_v5, ← iterN1V5_true]\n exact (iterN1V5_true_quot_eq_div128_of_v0_n... | [
{
"name": "s0_norm",
"text": "private theorem s0_norm (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :\n b0.toNat ≥ 2^63 := b0_ge_pow63_of_clz_zero b0 hb0nz hclz\n\n",
"fan_in": 7,
"n_lines": 4,
"n_chars": 139,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation":... | [
{
"name": "v6chainQ3_shift0_eq_model",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 348,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"m... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | @@ -31,6 +31,9 @@
variable (a0 a1 a2 a3 b0 : Word)
-- The shift=0 call regime: `b0 ≥ 2^63` and `0 < b0`.
+private theorem s0_norm (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :
+ b0.toNat ≥ 2^63 := b0_ge_pow63_of_clz_zero b0 hb0nz hclz
+
private theorem s0_zero_lt (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c8e0e7da34d8_1 | 9baf423b3aed5bc6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6Shift0ChainBridge.lean | V6Shift0ChainBridge | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 7 | [
{
"theorem_name": "v6chainQ3_shift0_eq_model",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [v6chainQ3, div128V5CodeQuot_eq_div128Quot_v5, ← iterN1V5_true]\n exact (iterN1V5_true_quot_eq_div128_of_v0_n... | [
{
"name": "s0_norm",
"text": "private theorem s0_norm (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :\n b0.toNat ≥ 2^63 := b0_ge_pow63_of_clz_zero b0 hb0nz hclz\n\n",
"fan_in": 7,
"n_lines": 4,
"n_chars": 139,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation":... | [
{
"name": "v6chainR3_shift0_eq_model",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 578,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | @@ -31,6 +31,9 @@
variable (a0 a1 a2 a3 b0 : Word)
-- The shift=0 call regime: `b0 ≥ 2^63` and `0 < b0`.
+private theorem s0_norm (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :
+ b0.toNat ≥ 2^63 := b0_ge_pow63_of_clz_zero b0 hb0nz hclz
+
private theorem s0_zero_lt (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c8e0e7da34d8_2 | 1855d02ccbe99a66 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6Shift0ChainBridge.lean | V6Shift0ChainBridge | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 7 | [
{
"theorem_name": "v6chainQ3_shift0_eq_model",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [v6chainQ3, div128V5CodeQuot_eq_div128Quot_v5, ← iterN1V5_true]\n exact (iterN1V5_true_quot_eq_div128_of_v0_n... | [
{
"name": "s0_norm",
"text": "private theorem s0_norm (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :\n b0.toNat ≥ 2^63 := b0_ge_pow63_of_clz_zero b0 hb0nz hclz\n\n",
"fan_in": 7,
"n_lines": 4,
"n_chars": 139,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation":... | [
{
"name": "v6chainQ2_shift0_eq_model",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 15,
"n_chars": 848,
"n_subproofs": 4,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | @@ -31,6 +31,9 @@
variable (a0 a1 a2 a3 b0 : Word)
-- The shift=0 call regime: `b0 ≥ 2^63` and `0 < b0`.
+private theorem s0_norm (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :
+ b0.toNat ≥ 2^63 := b0_ge_pow63_of_clz_zero b0 hb0nz hclz
+
private theorem s0_zero_lt (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c8e0e7da34d8_3 | 324d191e070297f1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6Shift0ChainBridge.lean | V6Shift0ChainBridge | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 7 | [
{
"theorem_name": "v6chainQ3_shift0_eq_model",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [v6chainQ3, div128V5CodeQuot_eq_div128Quot_v5, ← iterN1V5_true]\n exact (iterN1V5_true_quot_eq_div128_of_v0_n... | [
{
"name": "s0_norm",
"text": "private theorem s0_norm (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :\n b0.toNat ≥ 2^63 := b0_ge_pow63_of_clz_zero b0 hb0nz hclz\n\n",
"fan_in": 7,
"n_lines": 4,
"n_chars": 139,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation":... | [
{
"name": "v6chainR2_shift0_eq_model",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 19,
"n_chars": 1096,
"n_subproofs": 4,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
... | 4 | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | @@ -31,6 +31,9 @@
variable (a0 a1 a2 a3 b0 : Word)
-- The shift=0 call regime: `b0 ≥ 2^63` and `0 < b0`.
+private theorem s0_norm (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :
+ b0.toNat ≥ 2^63 := b0_ge_pow63_of_clz_zero b0 hb0nz hclz
+
private theorem s0_zero_lt (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c8e0e7da34d8_4 | 74c9ab7635e8b8c3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6Shift0ChainBridge.lean | V6Shift0ChainBridge | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 7 | [
{
"theorem_name": "v6chainQ3_shift0_eq_model",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [v6chainQ3, div128V5CodeQuot_eq_div128Quot_v5, ← iterN1V5_true]\n exact (iterN1V5_true_quot_eq_div128_of_v0_n... | [
{
"name": "s0_norm",
"text": "private theorem s0_norm (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :\n b0.toNat ≥ 2^63 := b0_ge_pow63_of_clz_zero b0 hb0nz hclz\n\n",
"fan_in": 7,
"n_lines": 4,
"n_chars": 139,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation":... | [
{
"name": "v6chainQ1_shift0_eq_model",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 15,
"n_chars": 742,
"n_subproofs": 4,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
... | 5 | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | @@ -31,6 +31,9 @@
variable (a0 a1 a2 a3 b0 : Word)
-- The shift=0 call regime: `b0 ≥ 2^63` and `0 < b0`.
+private theorem s0_norm (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :
+ b0.toNat ≥ 2^63 := b0_ge_pow63_of_clz_zero b0 hb0nz hclz
+
private theorem s0_zero_lt (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c8e0e7da34d8_5 | 576661f8089741e5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6Shift0ChainBridge.lean | V6Shift0ChainBridge | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 7 | [
{
"theorem_name": "v6chainQ3_shift0_eq_model",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [v6chainQ3, div128V5CodeQuot_eq_div128Quot_v5, ← iterN1V5_true]\n exact (iterN1V5_true_quot_eq_div128_of_v0_n... | [
{
"name": "s0_norm",
"text": "private theorem s0_norm (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :\n b0.toNat ≥ 2^63 := b0_ge_pow63_of_clz_zero b0 hb0nz hclz\n\n",
"fan_in": 7,
"n_lines": 4,
"n_chars": 139,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation":... | [
{
"name": "v6chainR1_shift0_eq_model",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 19,
"n_chars": 1009,
"n_subproofs": 4,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
... | 6 | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | @@ -31,6 +31,9 @@
variable (a0 a1 a2 a3 b0 : Word)
-- The shift=0 call regime: `b0 ≥ 2^63` and `0 < b0`.
+private theorem s0_norm (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :
+ b0.toNat ≥ 2^63 := b0_ge_pow63_of_clz_zero b0 hb0nz hclz
+
private theorem s0_zero_lt (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c8e0e7da34d8_6 | 8eadb6143d722d49 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6Shift0ChainBridge.lean | V6Shift0ChainBridge | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 7 | [
{
"theorem_name": "v6chainQ3_shift0_eq_model",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [v6chainQ3, div128V5CodeQuot_eq_div128Quot_v5, ← iterN1V5_true]\n exact (iterN1V5_true_quot_eq_div128_of_v0_n... | [
{
"name": "s0_norm",
"text": "private theorem s0_norm (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :\n b0.toNat ≥ 2^63 := b0_ge_pow63_of_clz_zero b0 hb0nz hclz\n\n",
"fan_in": 7,
"n_lines": 4,
"n_chars": 139,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation":... | [
{
"name": "v6chainQ0_shift0_eq_model",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 19,
"n_chars": 993,
"n_subproofs": 4,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
... | 7 | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | @@ -31,6 +31,9 @@
variable (a0 a1 a2 a3 b0 : Word)
-- The shift=0 call regime: `b0 ≥ 2^63` and `0 < b0`.
+private theorem s0_norm (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :
+ b0.toNat ≥ 2^63 := b0_ge_pow63_of_clz_zero b0 hb0nz hclz
+
private theorem s0_zero_lt (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c8e0e7da34d8_7 | ebd3c4d7e517df4b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6Shift0ChainBridge.lean | V6Shift0ChainBridge | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "v6chainQ3_shift0_eq_model",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [v6chainQ3, div128V5CodeQuot_eq_div128Quot_v5, ← iterN1V5_true]\n exact (iterN1V5_true_quot_eq_div128_of_v0_n... | [
{
"name": "s0_zero_lt",
"text": "private theorem s0_zero_lt (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :\n (0 : Word).toNat < b0.toNat := by\n have := b0_ge_pow63_of_clz_zero b0 hb0nz hclz; simp; omega\n\n-- ============================================================================\n-- Digit 3 (to... | [
{
"name": "v6n_quotient_word_shift0_eq_div",
"fan_in": 4,
"n_deps_direct": 5,
"n_deps_transitive": 10,
"n_lines": 31,
"n_chars": 1640,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": fal... | 10 | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | @@ -38,21 +38,57 @@
private theorem s0_norm (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :
b0.toNat ≥ 2^63 := b0_ge_pow63_of_clz_zero b0 hb0nz hclz
+private theorem s0_zero_lt (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :
+ (0 : Word).toNat < b0.toNat := by
+ have := b0_ge_pow63_of_clz_zero b0 hb0nz hc... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c8e0e7da34d8_8 | 390c94e80aea54f4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6Shift0ChainBridge.lean | V6Shift0ChainBridge | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "v6chainQ3_shift0_eq_model",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [v6chainQ3, div128V5CodeQuot_eq_div128Quot_v5, ← iterN1V5_true]\n exact (iterN1V5_true_quot_eq_div128_of_v0_n... | [
{
"name": "s0_zero_lt",
"text": "private theorem s0_zero_lt (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :\n (0 : Word).toNat < b0.toNat := by\n have := b0_ge_pow63_of_clz_zero b0 hb0nz hclz; simp; omega\n\n-- ============================================================================\n-- Digit 3 (to... | [
{
"name": "v6n_div_getLimbN_shift0_0",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 11,
"n_lines": 14,
"n_chars": 703,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 11 | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | @@ -38,21 +38,57 @@
private theorem s0_norm (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :
b0.toNat ≥ 2^63 := b0_ge_pow63_of_clz_zero b0 hb0nz hclz
+private theorem s0_zero_lt (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :
+ (0 : Word).toNat < b0.toNat := by
+ have := b0_ge_pow63_of_clz_zero b0 hb0nz hc... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c8e0e7da34d8_9 | d2920b190d009418 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6Shift0ChainBridge.lean | V6Shift0ChainBridge | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "v6chainQ3_shift0_eq_model",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [v6chainQ3, div128V5CodeQuot_eq_div128Quot_v5, ← iterN1V5_true]\n exact (iterN1V5_true_quot_eq_div128_of_v0_n... | [
{
"name": "s0_zero_lt",
"text": "private theorem s0_zero_lt (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :\n (0 : Word).toNat < b0.toNat := by\n have := b0_ge_pow63_of_clz_zero b0 hb0nz hclz; simp; omega\n\n-- ============================================================================\n-- Digit 3 (to... | [
{
"name": "v6n_div_getLimbN_shift0_1",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 11,
"n_lines": 14,
"n_chars": 700,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 11 | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | @@ -38,21 +38,57 @@
private theorem s0_norm (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :
b0.toNat ≥ 2^63 := b0_ge_pow63_of_clz_zero b0 hb0nz hclz
+private theorem s0_zero_lt (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :
+ (0 : Word).toNat < b0.toNat := by
+ have := b0_ge_pow63_of_clz_zero b0 hb0nz hc... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c8e0e7da34d8_10 | e9c004b255ff64e0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6Shift0ChainBridge.lean | V6Shift0ChainBridge | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "v6chainQ3_shift0_eq_model",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [v6chainQ3, div128V5CodeQuot_eq_div128Quot_v5, ← iterN1V5_true]\n exact (iterN1V5_true_quot_eq_div128_of_v0_n... | [
{
"name": "s0_zero_lt",
"text": "private theorem s0_zero_lt (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :\n (0 : Word).toNat < b0.toNat := by\n have := b0_ge_pow63_of_clz_zero b0 hb0nz hclz; simp; omega\n\n-- ============================================================================\n-- Digit 3 (to... | [
{
"name": "v6n_div_getLimbN_shift0_2",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 11,
"n_lines": 14,
"n_chars": 697,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 11 | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | @@ -38,21 +38,57 @@
private theorem s0_norm (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :
b0.toNat ≥ 2^63 := b0_ge_pow63_of_clz_zero b0 hb0nz hclz
+private theorem s0_zero_lt (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :
+ (0 : Word).toNat < b0.toNat := by
+ have := b0_ge_pow63_of_clz_zero b0 hb0nz hc... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c8e0e7da34d8_11 | a4f70d1507f74ae0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6Shift0ChainBridge.lean | V6Shift0ChainBridge | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "v6chainQ3_shift0_eq_model",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [v6chainQ3, div128V5CodeQuot_eq_div128Quot_v5, ← iterN1V5_true]\n exact (iterN1V5_true_quot_eq_div128_of_v0_n... | [
{
"name": "s0_zero_lt",
"text": "private theorem s0_zero_lt (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :\n (0 : Word).toNat < b0.toNat := by\n have := b0_ge_pow63_of_clz_zero b0 hb0nz hclz; simp; omega\n\n-- ============================================================================\n-- Digit 3 (to... | [
{
"name": "v6n_div_getLimbN_shift0_3",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 11,
"n_lines": 14,
"n_chars": 694,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 11 | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | /-
EvmAsm.Evm64.DivMod.Compose.V6Shift0ChainBridge
The shift=0 counterpart of `V6ChainModelBridge` / `V6BodyModelBridge`: when the
divisor is already normalized (`(clzResult b0).1 = 0`, i.e. `b0 ≥ 2^63`), the
fast-path body's copyAU lane runs the digit chain on the *un-normalized* window
`(0, a3, a2, a1, a0)... | @@ -38,21 +38,57 @@
private theorem s0_norm (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :
b0.toNat ≥ 2^63 := b0_ge_pow63_of_clz_zero b0 hb0nz hclz
+private theorem s0_zero_lt (hb0nz : b0 ≠ 0) (hclz : (clzResult b0).1 = 0) :
+ (0 : Word).toNat < b0.toNat := by
+ have := b0_ge_pow63_of_clz_zero b0 hb0nz hc... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b9c401591fcd_0 | 20906add60ebd88e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Compose/CarryBranch.lean | CarryBranch | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "cpsTripleWithin_pre_regOwn_under",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sepConj_left_comm']\n refine cpsTripleWithin_pre_regOwn (fun v => ?_)\n rw [sepConj_left_comm']\n e... | [
{
"name": "cpsTripleWithin_pre_regOwn",
"text": "/-- Choose the concrete value of a `regOwn` in the leading position of a\n `cpsTripleWithin` precondition. If the triple holds for every concrete\n `regIs r v` (leading a common tail `B`), it holds with the register merely\n owned. Used to thread the... | [
{
"name": "cpsTripleWithin_pre_regOwn_under",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 799,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false... | 1 | /-
EvmAsm.Evm64.AddMod.Compose.CarryBranch
Carry-branch (`N ≠ 0`, 257th carry bit set) machine-pipeline composition for
the total ADDMOD program. Chains the six carry-path prepare/finish blocks and
the three `evm_mod_callable_v5` near-calls (via `evm_addmod_v5_call_adapter`)
into the carry-branch stack spec ... | /-
EvmAsm.Evm64.AddMod.Compose.CarryBranch
Carry-branch (`N ≠ 0`, 257th carry bit set) machine-pipeline composition for
the total ADDMOD program. Chains the six carry-path prepare/finish blocks and
the three `evm_mod_callable_v5` near-calls (via `evm_addmod_v5_call_adapter`)
into the carry-branch stack spec ... | @@ -21,6 +21,23 @@
open EvmAsm.Rv64
open EvmAsm.Evm64
+/-- Choose the concrete value of a `regOwn` in the leading position of a
+ `cpsTripleWithin` precondition. If the triple holds for every concrete
+ `regIs r v` (leading a common tail `B`), it holds with the register merely
+ owned. Used to thread the c... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_271ab3919a24_0 | 243a2b05bb346d9a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/LoadWindowWord.lean | LoadWindowWord | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "mloadPackedLimb_toNat",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mloadPackedLimb\n rw [toNat_append_byte, toNat_append_byte, toNat_append_byte,\n toNat_append_byte, toNat_... | [
{
"name": "toNat_append_byte",
"text": "/-- One big-endian byte-append step at the `toNat` level: appending an\n 8-bit byte multiplies the prefix by 256 and adds the byte. -/\nprivate theorem toNat_append_byte {m : Nat} (x : BitVec m) (y : BitVec 8) :\n (x ++ y).toNat = x.toNat * 256 + y.toNat := by\n... | [
{
"name": "mloadPackedLimb_toNat",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 533,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_... | 1 | /-
EvmAsm.Evm64.Calldata.LoadWindowWord
Pure bridge between the CALLDATALOAD RV64 byte-window output word
(`calldataLoadWindowOutputWordFromArgs`, four big-endian packed limbs) and
the executable calldata semantics (`loadedWordFromArgs` /
`callDataLoadWord`, a big-endian 32-byte fold). Also provides the pur... | /-
EvmAsm.Evm64.Calldata.LoadWindowWord
Pure bridge between the CALLDATALOAD RV64 byte-window output word
(`calldataLoadWindowOutputWordFromArgs`, four big-endian packed limbs) and
the executable calldata semantics (`loadedWordFromArgs` /
`callDataLoadWord`, a big-endian 32-byte fold). Also provides the pur... | @@ -17,12 +17,22 @@
/-! ### Packed-limb / loaded-word `toNat` forms -/
+/-- One big-endian byte-append step at the `toNat` level: appending an
+ 8-bit byte multiplies the prefix by 256 and adds the byte. -/
+private theorem toNat_append_byte {m : Nat} (x : BitVec m) (y : BitVec 8) :
+ (x ++ y).toNat = x.toNa... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_271ab3919a24_1 | 11e55f22527ebfc3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/LoadWindowWord.lean | LoadWindowWord | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "calldataLoadWindowOutputWordFromArgs_eq_loadedWordFromArgs",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [CallDataLoadArgs.loadedWordFromArgs_toNat]\n... | [
{
"name": "mloadLoadedWord_toNat",
"text": "/-- `mloadLoadedWord` as a 4-limb value at the `toNat` level. -/\ntheorem mloadLoadedWord_toNat (l0 l1 l2 l3 : Word) :\n (mloadLoadedWord l0 l1 l2 l3).toNat =\n l0.toNat + l1.toNat * 2 ^ 64 + l2.toNat * 2 ^ 128\n + l3.toNat * 2 ^ 192 := by\n rw [Ev... | [
{
"name": "calldataLoadWindowOutputWordFromArgs_eq_loadedWordFromArgs",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 30,
"n_chars": 1241,
"n_subproofs": 1,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 5,
"n_structural": 1,
... | 3 | /-
EvmAsm.Evm64.Calldata.LoadWindowWord
Pure bridge between the CALLDATALOAD RV64 byte-window output word
(`calldataLoadWindowOutputWordFromArgs`, four big-endian packed limbs) and
the executable calldata semantics (`loadedWordFromArgs` /
`callDataLoadWord`, a big-endian 32-byte fold). Also provides the pur... | /-
EvmAsm.Evm64.Calldata.LoadWindowWord
Pure bridge between the CALLDATALOAD RV64 byte-window output word
(`calldataLoadWindowOutputWordFromArgs`, four big-endian packed limbs) and
the executable calldata semantics (`loadedWordFromArgs` /
`callDataLoadWord`, a big-endian 32-byte fold). Also provides the pur... | @@ -34,6 +34,19 @@
rw [toNat_append_byte, toNat_append_byte, toNat_append_byte,
toNat_append_byte, toNat_append_byte, toNat_append_byte, toNat_append_byte]
+/-- `mloadLoadedWord` as a 4-limb value at the `toNat` level. -/
+theorem mloadLoadedWord_toNat (l0 l1 l2 l3 : Word) :
+ (mloadLoadedWord l0 l1 l2 l3)... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_271ab3919a24_2 | e64db2927927cc28 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/LoadWindowWord.lean | LoadWindowWord | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "callDataLoadWord_zero_of_upper_or_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply callDataLoadWord_of_ge_length\n have h_ge := two_pow_64_le_toNat_of_upper_or_ne_zero h_upp... | [
{
"name": "two_pow_64_le_toNat_of_upper_or_ne_zero",
"text": "/-- With any upper limb nonzero, an `EvmWord`'s value is at least `2^64` —\n in particular past the end of any calldata buffer whose length fits in\n a 64-bit register. This is the pure fact behind the dispatch's\n OR-reduce of the thre... | [
{
"name": "callDataLoadWord_zero_of_upper_or_ne_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 592,
"n_subproofs": 2,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_onl... | 1 | /-
EvmAsm.Evm64.Calldata.LoadWindowWord
Pure bridge between the CALLDATALOAD RV64 byte-window output word
(`calldataLoadWindowOutputWordFromArgs`, four big-endian packed limbs) and
the executable calldata semantics (`loadedWordFromArgs` /
`callDataLoadWord`, a big-endian 32-byte fold). Also provides the pur... | /-
EvmAsm.Evm64.Calldata.LoadWindowWord
Pure bridge between the CALLDATALOAD RV64 byte-window output word
(`calldataLoadWindowOutputWordFromArgs`, four big-endian packed limbs) and
the executable calldata semantics (`loadedWordFromArgs` /
`callDataLoadWord`, a big-endian 32-byte fold). Also provides the pur... | @@ -17,6 +17,30 @@
/-! ### Packed-limb / loaded-word `toNat` forms -/
+/-- With any upper limb nonzero, an `EvmWord`'s value is at least `2^64` —
+ in particular past the end of any calldata buffer whose length fits in
+ a 64-bit register. This is the pure fact behind the dispatch's
+ OR-reduce of the th... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_271ab3919a24_3 | 886d9833abb17141 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/LoadWindowWord.lean | LoadWindowWord | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "callDataLoadWord_zero_of_low_ge_len",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply callDataLoadWord_of_ge_length\n rw [h_len, toNat_eq_getLimbN0_toNat_of_upper_or_zero h_upper]\n ... | [
{
"name": "toNat_eq_getLimbN0_toNat_of_upper_or_zero",
"text": "/-- With all three upper limbs zero, an `EvmWord`'s value is exactly its\n low limb's value. This is the pure fact behind the CALLDATALOAD\n dispatch reading only the low offset dword on the in-bounds arm. -/\ntheorem toNat_eq_getLimbN0_... | [
{
"name": "callDataLoadWord_zero_of_low_ge_len",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 606,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": fa... | 1 | /-
EvmAsm.Evm64.Calldata.LoadWindowWord
Pure bridge between the CALLDATALOAD RV64 byte-window output word
(`calldataLoadWindowOutputWordFromArgs`, four big-endian packed limbs) and
the executable calldata semantics (`loadedWordFromArgs` /
`callDataLoadWord`, a big-endian 32-byte fold). Also provides the pur... | /-
EvmAsm.Evm64.Calldata.LoadWindowWord
Pure bridge between the CALLDATALOAD RV64 byte-window output word
(`calldataLoadWindowOutputWordFromArgs`, four big-endian packed limbs) and
the executable calldata semantics (`loadedWordFromArgs` /
`callDataLoadWord`, a big-endian 32-byte fold). Also provides the pur... | @@ -17,6 +17,21 @@
/-! ### Packed-limb / loaded-word `toNat` forms -/
+/-- With all three upper limbs zero, an `EvmWord`'s value is exactly its
+ low limb's value. This is the pure fact behind the CALLDATALOAD
+ dispatch reading only the low offset dword on the in-bounds arm. -/
+theorem toNat_eq_getLimbN0_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_271ab3919a24_4 | 511facb7ac4a7b9d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/LoadWindowWord.lean | LoadWindowWord | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "callDataLoadWord_zero_of_low_ge_len",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply callDataLoadWord_of_ge_length\n rw [h_len, toNat_eq_getLimbN0_toNat_of_upper_or_zero h_upper]\n ... | [
{
"name": "toNat_eq_getLimbN0_toNat_of_upper_or_zero",
"text": "/-- With all three upper limbs zero, an `EvmWord`'s value is exactly its\n low limb's value. This is the pure fact behind the CALLDATALOAD\n dispatch reading only the low offset dword on the in-bounds arm. -/\ntheorem toNat_eq_getLimbN0_... | [
{
"name": "offset_toNat_lt_length_of_inbounds",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 600,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": fal... | 1 | /-
EvmAsm.Evm64.Calldata.LoadWindowWord
Pure bridge between the CALLDATALOAD RV64 byte-window output word
(`calldataLoadWindowOutputWordFromArgs`, four big-endian packed limbs) and
the executable calldata semantics (`loadedWordFromArgs` /
`callDataLoadWord`, a big-endian 32-byte fold). Also provides the pur... | /-
EvmAsm.Evm64.Calldata.LoadWindowWord
Pure bridge between the CALLDATALOAD RV64 byte-window output word
(`calldataLoadWindowOutputWordFromArgs`, four big-endian packed limbs) and
the executable calldata semantics (`loadedWordFromArgs` /
`callDataLoadWord`, a big-endian 32-byte fold). Also provides the pur... | @@ -17,6 +17,21 @@
/-! ### Packed-limb / loaded-word `toNat` forms -/
+/-- With all three upper limbs zero, an `EvmWord`'s value is exactly its
+ low limb's value. This is the pure fact behind the CALLDATALOAD
+ dispatch reading only the low offset dword on the in-bounds arm. -/
+theorem toNat_eq_getLimbN0_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_91503b99b044_0 | e05d5636ef286728 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/UnifiedDecodeItemReconvergeAllRegion.lean | UnifiedDecodeItemReconvergeAllRegion | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "rlp_decode_single_item_reconverged_all_region",
"depth": 1,
"n_commands": 0,
"n_lines": 125,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases h : classifyPrefix pfx with\n | singleByte =>\n have handler := rlp_phase1_e1_sin... | [
{
"name": "region_succ_ptr",
"text": "/-- The post pointer after the prefix byte: `(regionBase + off) + 1 = regionBase + (off+1)`. -/\nprivate theorem region_succ_ptr (regionBase : Word) (off : Nat) :\n (regionBase + BitVec.ofNat 64 off) + signExtend12 (1 : BitVec 12)\n = regionBase + BitVec.ofNat 6... | [
{
"name": "rlp_decode_single_item_reconverged_all_region",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 247,
"n_chars": 16002,
"n_subproofs": 14,
"n_tactics": 125,
"cyclomatic": 2,
"n_automation": 12,
"n_rewrites": 3,
"n_structural": 13,
"au... | 1 | /-
EvmAsm.Rv64.RLP.UnifiedDecodeItemReconvergeAllRegion
EL.3 — the 5-class reconverged single-item decoder re-derived over a multi-dword
`bytesRegion regionBase bs` instead of the single-dword `(dwordAddr ↦ₘ wordVal)`
model. Region analog of `rlp_decode_single_item_reconverged_all`
(`UnifiedDecodeItemReconve... | /-
EvmAsm.Rv64.RLP.UnifiedDecodeItemReconvergeAllRegion
EL.3 — the 5-class reconverged single-item decoder re-derived over a multi-dword
`bytesRegion regionBase bs` instead of the single-dword `(dwordAddr ↦ₘ wordVal)`
model. Region analog of `rlp_decode_single_item_reconverged_all`
(`UnifiedDecodeItemReconve... | @@ -56,6 +56,12 @@
| .shortList => regionBase + BitVec.ofNat 64 (off + 1)
| .longList => regionBase + BitVec.ofNat 64 ((off + 1) + rlpPrefixLongListLenOfLen pfx)
+/-- The post pointer after the prefix byte: `(regionBase + off) + 1 = regionBase + (off+1)`. -/
+private theorem region_succ_ptr (regionBase : Wor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_16c09abdbcd7_0 | 34def4e8e2036efb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/EpilogueV6.lean | EpilogueV6 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "divK_div_epilogue_spec_within_v6",
"depth": 1,
"n_commands": 0,
"n_lines": 29,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hload := divK_epilogue_load_spec_within 4088 4080 4072 4064 sp q0 q1 q2 q3 v5 v6 v7 v10\n (base +... | [
{
"name": "divK_div_epilogue_code_sub_divCodeV6",
"text": "/-- DIV epilogue block is subsumed by divCodeV6 (9 preceding blocks:\n dispatchN1, clz, fastSetup, normA, copyAU, digit3, digit2, digit1, digit0). -/\nprivate theorem divK_div_epilogue_code_sub_divCodeV6 {base : Word} :\n ∀ a i, (CodeReq.ofPro... | [
{
"name": "divK_div_epilogue_spec_within_v6",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 43,
"n_chars": 2682,
"n_subproofs": 7,
"n_tactics": 29,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": fal... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.EpilogueV6
v6 DIV epilogue brick (10 instrs, base+v6EpilogueOff → base+v6ExitOff) over
`divCodeV6`. Loads the quotient limbs q[0..3] from scratch, bumps sp by 32,
stores them to the output area, and `JAL x0 1412` to the embedded v5 NOP exit.
Mirror of the v1/v4 epilogue composi... | /-
EvmAsm.Evm64.DivMod.Compose.EpilogueV6
v6 DIV epilogue brick (10 instrs, base+v6EpilogueOff → base+v6ExitOff) over
`divCodeV6`. Loads the quotient limbs q[0..3] from scratch, bumps sp by 32,
stores them to the output area, and `JAL x0 1412` to the embedded v5 NOP exit.
Mirror of the v1/v4 epilogue composi... | @@ -22,6 +22,21 @@
-- Code subsumption: DIV epilogue (block index 9 of divCodeV6) into divCodeV6.
-- ============================================================================
+/-- DIV epilogue block is subsumed by divCodeV6 (9 preceding blocks:
+ dispatchN1, clz, fastSetup, normA, copyAU, digit3, digit2, digi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_763fc5d7bae0_0 | d22c4882255d32e0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/Base.lean | Base | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "expOneIterCode_block_subs",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact ⟨expOneIterCode_bit_test_sub, expOneIterCode_square_sub,\n expOneIterCode_cond_mul_sub, expOneIterCode_l... | [
{
"name": "expOneIterCode_cond_mul_sub",
"text": "theorem expOneIterCode_cond_mul_sub {base : Word}\n {mulOff : BitVec 21} {skipOff backOff : BitVec 13} :\n ∀ a i, (CodeReq.ofProg (base + 16)\n (EvmAsm.Evm64.exp_cond_mul_block mulOff skipOff)) a = some i →\n (expOneIterCode base mulOff skipO... | [
{
"name": "expOneIterCode_block_subs",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 17,
"n_chars": 908,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"... | 4 | /-
EvmAsm.Evm64.Exp.Compose.Base
Shared composition infrastructure for EXP: `expCode` (the union of all
sub-block `CodeReq`s), subsumption helpers tying sub-block codes back to
`expCode`, and shared length lemmas.
GH #92 composition work lands here and in sibling `Compose` modules. This
file keeps the sh... | /-
EvmAsm.Evm64.Exp.Compose.Base
Shared composition infrastructure for EXP: `expCode` (the union of all
sub-block `CodeReq`s), subsumption helpers tying sub-block codes back to
`expCode`, and shared length lemmas.
GH #92 composition work lands here and in sibling `Compose` modules. This
file keeps the sh... | @@ -58,6 +58,25 @@
base hk1 hk2))
exact CodeReq.union_mono_left
+theorem expOneIterCode_cond_mul_sub {base : Word}
+ {mulOff : BitVec 21} {skipOff backOff : BitVec 13} :
+ ∀ a i, (CodeReq.ofProg (base + 16)
+ (EvmAsm.Evm64.exp_cond_mul_block mulOff skipOff)) a = some i →
+ (expOneIterCode ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_763fc5d7bae0_1 | 895e17415ae956e3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/Base.lean | Base | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "expLoopCode_block_subs",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact ⟨expLoopCode_bit_test_sub, expLoopCode_square_sub,\n expLoopCode_cond_mul_sub, expLoopCode_loop_back_sub⟩",... | [
{
"name": "expLoopCode_cond_mul_sub",
"text": "theorem expLoopCode_cond_mul_sub {base : Word}\n {mulOff : BitVec 21} {skipOff backOff : BitVec 13} :\n ∀ a i, (CodeReq.ofProg (base + 16)\n (EvmAsm.Evm64.exp_cond_mul_block mulOff skipOff)) a = some i →\n (expLoopCode base mulOff skipOff backOf... | [
{
"name": "expLoopCode_block_subs",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 17,
"n_chars": 881,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max... | 4 | /-
EvmAsm.Evm64.Exp.Compose.Base
Shared composition infrastructure for EXP: `expCode` (the union of all
sub-block `CodeReq`s), subsumption helpers tying sub-block codes back to
`expCode`, and shared length lemmas.
GH #92 composition work lands here and in sibling `Compose` modules. This
file keeps the sh... | /-
EvmAsm.Evm64.Exp.Compose.Base
Shared composition infrastructure for EXP: `expCode` (the union of all
sub-block `CodeReq`s), subsumption helpers tying sub-block codes back to
`expCode`, and shared length lemmas.
GH #92 composition work lands here and in sibling `Compose` modules. This
file keeps the sh... | @@ -88,6 +88,30 @@
simp only [exp_loop_len]
norm_num)
+theorem expLoopCode_cond_mul_sub {base : Word}
+ {mulOff : BitVec 21} {skipOff backOff : BitVec 13} :
+ ∀ a i, (CodeReq.ofProg (base + 16)
+ (EvmAsm.Evm64.exp_cond_mul_block mulOff skipOff)) a = some i →
+ (expLoopCode base mulOff sk... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_763fc5d7bae0_2 | 4bf1cb5927964ecf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/Base.lean | Base | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "expLoopCode_block_subs",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact ⟨expLoopCode_bit_test_sub, expLoopCode_square_sub,\n expLoopCode_cond_mul_sub, expLoopCode_loop_back_sub⟩",... | [
{
"name": "expLoopCode_cond_mul_sub",
"text": "theorem expLoopCode_cond_mul_sub {base : Word}\n {mulOff : BitVec 21} {skipOff backOff : BitVec 13} :\n ∀ a i, (CodeReq.ofProg (base + 16)\n (EvmAsm.Evm64.exp_cond_mul_block mulOff skipOff)) a = some i →\n (expLoopCode base mulOff skipOff backOf... | [
{
"name": "expOneIterCode_loop_sub",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 26,
"n_chars": 828,
"n_subproofs": 0,
"n_tactics": 21,
"cyclomatic": 9,
"n_automation": 6,
"n_rewrites": 2,
"n_structural": 9,
"automation_only": false,
"m... | 4 | /-
EvmAsm.Evm64.Exp.Compose.Base
Shared composition infrastructure for EXP: `expCode` (the union of all
sub-block `CodeReq`s), subsumption helpers tying sub-block codes back to
`expCode`, and shared length lemmas.
GH #92 composition work lands here and in sibling `Compose` modules. This
file keeps the sh... | /-
EvmAsm.Evm64.Exp.Compose.Base
Shared composition infrastructure for EXP: `expCode` (the union of all
sub-block `CodeReq`s), subsumption helpers tying sub-block codes back to
`expCode`, and shared length lemmas.
GH #92 composition work lands here and in sibling `Compose` modules. This
file keeps the sh... | @@ -88,6 +88,30 @@
simp only [exp_loop_len]
norm_num)
+theorem expLoopCode_cond_mul_sub {base : Word}
+ {mulOff : BitVec 21} {skipOff backOff : BitVec 13} :
+ ∀ a i, (CodeReq.ofProg (base + 16)
+ (EvmAsm.Evm64.exp_cond_mul_block mulOff skipOff)) a = some i →
+ (expLoopCode base mulOff sk... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "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.