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_6d2fe83ad92a_6 | 753d9193cf55569d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStatePre.lean | SavedBitFixedIterStatePre | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "expTwoMulFixedIterPreNWithStateFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterPreNWithStateFrame_unfold]\n pcFree",
"n_chars": 63,
"n_subproof... | [
{
"name": "expTwoMulFixedIterPreNWithStateFrame_unfold",
"text": "theorem expTwoMulFixedIterPreNWithStateFrame_unfold\n {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}\n {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld\n r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3... | [
{
"name": "expTwoMulFixedIterPreNWithStateFrame_succ_no_reload",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 31,
"n_chars": 1416,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"aut... | 4 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | @@ -77,6 +77,23 @@
r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3 v7 v11 **
frame
+theorem expTwoMulFixedIterPreNWithStateFrame_unfold
+ {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}
+ {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld
+ r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6d2fe83ad92a_7 | 01b29f7db77261b7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStatePre.lean | SavedBitFixedIterStatePre | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "expTwoMulFixedIterPreNWithStateFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterPreNWithStateFrame_unfold]\n pcFree",
"n_chars": 63,
"n_subproof... | [
{
"name": "expTwoMulFixedIterPreNWithStateFrame_unfold",
"text": "theorem expTwoMulFixedIterPreNWithStateFrame_unfold\n {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}\n {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld\n r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3... | [
{
"name": "expTwoMulFixedIterPreNWithStateFrame_succ_reload",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 34,
"n_chars": 1499,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automa... | 4 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | @@ -77,6 +77,23 @@
r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3 v7 v11 **
frame
+theorem expTwoMulFixedIterPreNWithStateFrame_unfold
+ {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}
+ {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld
+ r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6d2fe83ad92a_8 | e75a176c10fc8612 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStatePre.lean | SavedBitFixedIterStatePre | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "expTwoMulFixedIterPreNWithStateFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterPreNWithStateFrame_unfold]\n pcFree",
"n_chars": 63,
"n_subproof... | [
{
"name": "expTwoMulFixedIterPreNWithStateFrame_unfold",
"text": "theorem expTwoMulFixedIterPreNWithStateFrame_unfold\n {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}\n {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld\n r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3... | [
{
"name": "expTwoMulFixedIterPreNWithStateFrame_pures",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 18,
"n_chars": 868,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_on... | 4 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | @@ -77,6 +77,23 @@
r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3 v7 v11 **
frame
+theorem expTwoMulFixedIterPreNWithStateFrame_unfold
+ {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}
+ {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld
+ r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6d2fe83ad92a_9 | a846dee0802d851c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStatePre.lean | SavedBitFixedIterStatePre | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "expTwoMulFixedIterPreNWithStateFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterPreNWithStateFrame_unfold]\n pcFree",
"n_chars": 63,
"n_subproof... | [
{
"name": "expTwoMulFixedIterPreNWithStateFrame_unfold",
"text": "theorem expTwoMulFixedIterPreNWithStateFrame_unfold\n {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}\n {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld\n r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3... | [
{
"name": "expTwoMulFixedIterPreNWithStateFrame_to_iterPreNWithControlFrame",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 6,
"n_lines": 35,
"n_chars": 1572,
"n_subproofs": 0,
"n_tactics": 19,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 4,
"n_structural... | 6 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | @@ -77,6 +77,23 @@
r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3 v7 v11 **
frame
+theorem expTwoMulFixedIterPreNWithStateFrame_unfold
+ {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}
+ {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld
+ r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6d2fe83ad92a_10 | f30527e892933239 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStatePre.lean | SavedBitFixedIterStatePre | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "expTwoMulFixedIterPreNWithStateFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterPreNWithStateFrame_unfold]\n pcFree",
"n_chars": 63,
"n_subproof... | [
{
"name": "expTwoMulFixedIterPreNWithStateFrame_unfold",
"text": "theorem expTwoMulFixedIterPreNWithStateFrame_unfold\n {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}\n {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld\n r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3... | [
{
"name": "expTwoMulFixedIterPreNWithControlFrame_to_iterPreNWithStateFrame",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 36,
"n_chars": 1624,
"n_subproofs": 0,
"n_tactics": 19,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 4,
"n_structural... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | @@ -77,6 +77,23 @@
r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3 v7 v11 **
frame
+theorem expTwoMulFixedIterPreNWithStateFrame_unfold
+ {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}
+ {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld
+ r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6d2fe83ad92a_11 | dc9a8eb5ff86b16a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStatePre.lean | SavedBitFixedIterStatePre | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "expTwoMulFixedIterPreNWithStateFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterPreNWithStateFrame_unfold]\n pcFree",
"n_chars": 63,
"n_subproof... | [
{
"name": "expTwoMulFixedIterPreNWithStateFrame_unfold",
"text": "theorem expTwoMulFixedIterPreNWithStateFrame_unfold\n {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}\n {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld\n r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3... | [
{
"name": "expTwoMulFixedIterPreNWithState_to_iterPreNWithControl",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 27,
"n_chars": 1295,
"n_subproofs": 2,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 1,
... | 7 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | @@ -77,6 +77,23 @@
r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3 v7 v11 **
frame
+theorem expTwoMulFixedIterPreNWithStateFrame_unfold
+ {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}
+ {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld
+ r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4a79c34ee8fa_0 | fe97e50a1fa59fb4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopComposeN3.lean | LoopComposeN3 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 10 | [
{
"theorem_name": "divK_loop_body_n3_max_unified_j1_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let uBase := sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat\n let qAddr := sp ... | [
{
"name": "loopBodyN3MaxUnifiedPre_unfold",
"text": "theorem loopBodyN3MaxUnifiedPre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :\n loopBodyN3MaxUnifiedPre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop... | [
{
"name": "divK_loop_body_n3_max_unified_j1_spec_within",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 42,
"n_chars": 2169,
"n_subproofs": 4,
"n_tactics": 34,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 6,
"n_structural": 6,
"automatio... | 1 | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | @@ -48,6 +48,27 @@
((uBase + signExtend12 4064) ↦ₘ uTop) **
(qAddr ↦ₘ qOld))
+theorem loopBodyN3MaxUnifiedPre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :
+ loopBodyN3MaxUnifiedPre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4a79c34ee8fa_1 | 55c109f8438a073a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopComposeN3.lean | LoopComposeN3 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 10 | [
{
"theorem_name": "divK_loop_body_n3_max_unified_j1_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let uBase := sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat\n let qAddr := sp ... | [
{
"name": "loopBodyN3MaxUnifiedPre_unfold",
"text": "theorem loopBodyN3MaxUnifiedPre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :\n loopBodyN3MaxUnifiedPre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop... | [
{
"name": "divK_loop_body_n3_max_unified_j1_spec_within_noNop",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 46,
"n_chars": 2482,
"n_subproofs": 4,
"n_tactics": 32,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 6,
"n_structural": 6,
"aut... | 1 | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | @@ -48,6 +48,27 @@
((uBase + signExtend12 4064) ↦ₘ uTop) **
(qAddr ↦ₘ qOld))
+theorem loopBodyN3MaxUnifiedPre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :
+ loopBodyN3MaxUnifiedPre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4a79c34ee8fa_2 | 31955c877a4436c5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopComposeN3.lean | LoopComposeN3 | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 10 | [
{
"theorem_name": "divK_loop_body_n3_max_unified_j1_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let uBase := sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat\n let qAddr := sp ... | [
{
"name": "loopBodyN3MaxUnifiedPre_unfold",
"text": "theorem loopBodyN3MaxUnifiedPre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :\n loopBodyN3MaxUnifiedPre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop... | [
{
"name": "divK_loop_body_n3_max_unified_j0_spec_within",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 42,
"n_chars": 2167,
"n_subproofs": 4,
"n_tactics": 34,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 6,
"n_structural": 6,
"automatio... | 1 | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | @@ -48,6 +48,27 @@
((uBase + signExtend12 4064) ↦ₘ uTop) **
(qAddr ↦ₘ qOld))
+theorem loopBodyN3MaxUnifiedPre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :
+ loopBodyN3MaxUnifiedPre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4a79c34ee8fa_3 | 44b82efc36f8a254 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopComposeN3.lean | LoopComposeN3 | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 10 | [
{
"theorem_name": "divK_loop_body_n3_max_unified_j1_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let uBase := sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat\n let qAddr := sp ... | [
{
"name": "loopBodyN3MaxUnifiedPre_unfold",
"text": "theorem loopBodyN3MaxUnifiedPre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :\n loopBodyN3MaxUnifiedPre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop... | [
{
"name": "divK_loop_body_n3_max_unified_j0_spec_within_noNop",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 46,
"n_chars": 2482,
"n_subproofs": 4,
"n_tactics": 32,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 6,
"n_structural": 6,
"aut... | 1 | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | @@ -48,6 +48,27 @@
((uBase + signExtend12 4064) ↦ₘ uTop) **
(qAddr ↦ₘ qOld))
+theorem loopBodyN3MaxUnifiedPre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :
+ loopBodyN3MaxUnifiedPre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4a79c34ee8fa_4 | 2e8569e5c63f4a01 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopComposeN3.lean | LoopComposeN3 | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 10 | [
{
"theorem_name": "divK_loop_body_n3_call_unified_j1_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let uBase := sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat\n let qAddr := sp... | [
{
"name": "loopBodyN3CallUnifiedPre_unfold",
"text": "theorem loopBodyN3CallUnifiedPre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld\n retMem dMem dloMem scratch_un0 : Word) :\n loopBodyN3CallUnifiedPre sp jOld v5Old v6Old v7Old v10Old v11Old v2O... | [
{
"name": "divK_loop_body_n3_call_unified_j1_spec_within",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 46,
"n_chars": 2351,
"n_subproofs": 4,
"n_tactics": 38,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 8,
"n_structural": 6,
"automati... | 1 | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | @@ -70,6 +70,37 @@
(sp + signExtend12 3952 ↦ₘ dloMem) **
((sp + signExtend12 3944 ↦ₘ scratch_un0) ** regOwn .x1))
+theorem loopBodyN3CallUnifiedPre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld
+ retMem dMem dloMem scratch_un0 : Word) :
+ loopBodyN... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4a79c34ee8fa_5 | 6cabe7d9c6066d66 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopComposeN3.lean | LoopComposeN3 | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 10 | [
{
"theorem_name": "divK_loop_body_n3_call_unified_j1_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let uBase := sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat\n let qAddr := sp... | [
{
"name": "loopBodyN3CallUnifiedPre_unfold",
"text": "theorem loopBodyN3CallUnifiedPre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld\n retMem dMem dloMem scratch_un0 : Word) :\n loopBodyN3CallUnifiedPre sp jOld v5Old v6Old v7Old v10Old v11Old v2O... | [
{
"name": "divK_loop_body_n3_call_unified_j1_spec_within_noNop",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 49,
"n_chars": 2629,
"n_subproofs": 4,
"n_tactics": 35,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 7,
"n_structural": 6,
"au... | 1 | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | @@ -70,6 +70,37 @@
(sp + signExtend12 3952 ↦ₘ dloMem) **
((sp + signExtend12 3944 ↦ₘ scratch_un0) ** regOwn .x1))
+theorem loopBodyN3CallUnifiedPre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld
+ retMem dMem dloMem scratch_un0 : Word) :
+ loopBodyN... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4a79c34ee8fa_6 | 2f486d2e70bca0e5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopComposeN3.lean | LoopComposeN3 | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 10 | [
{
"theorem_name": "divK_loop_body_n3_call_unified_j1_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let uBase := sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat\n let qAddr := sp... | [
{
"name": "loopBodyN3CallUnifiedPre_unfold",
"text": "theorem loopBodyN3CallUnifiedPre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld\n retMem dMem dloMem scratch_un0 : Word) :\n loopBodyN3CallUnifiedPre sp jOld v5Old v6Old v7Old v10Old v11Old v2O... | [
{
"name": "divK_loop_body_n3_call_unified_j0_spec_within",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 52,
"n_chars": 2631,
"n_subproofs": 4,
"n_tactics": 45,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 10,
"n_structural": 6,
"automat... | 1 | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | @@ -70,6 +70,37 @@
(sp + signExtend12 3952 ↦ₘ dloMem) **
((sp + signExtend12 3944 ↦ₘ scratch_un0) ** regOwn .x1))
+theorem loopBodyN3CallUnifiedPre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld
+ retMem dMem dloMem scratch_un0 : Word) :
+ loopBodyN... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4a79c34ee8fa_7 | cbd6e0ce9bd60701 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopComposeN3.lean | LoopComposeN3 | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 10 | [
{
"theorem_name": "divK_loop_body_n3_call_unified_j1_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let uBase := sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat\n let qAddr := sp... | [
{
"name": "loopBodyN3CallUnifiedPre_unfold",
"text": "theorem loopBodyN3CallUnifiedPre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld\n retMem dMem dloMem scratch_un0 : Word) :\n loopBodyN3CallUnifiedPre sp jOld v5Old v6Old v7Old v10Old v11Old v2O... | [
{
"name": "divK_loop_body_n3_call_unified_j0_spec_within_noNop",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 56,
"n_chars": 2997,
"n_subproofs": 4,
"n_tactics": 42,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 9,
"n_structural": 6,
"au... | 1 | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | @@ -70,6 +70,37 @@
(sp + signExtend12 3952 ↦ₘ dloMem) **
((sp + signExtend12 3944 ↦ₘ scratch_un0) ** regOwn .x1))
+theorem loopBodyN3CallUnifiedPre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld
+ retMem dMem dloMem scratch_un0 : Word) :
+ loopBodyN... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4a79c34ee8fa_8 | f24d2256150941d6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopComposeN3.lean | LoopComposeN3 | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 8 | [
{
"theorem_name": "divK_loop_n3_max_max_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 66,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n delta loopN3Pre; simp only []\n let u_base_1 := sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).t... | [
{
"name": "u_j1_4080_eq_j0_4072",
"text": "/-- j=1 un2 at uBase(1)-16 = j=0 u3 at uBase(0)-24 -/\ntheorem u_j1_4080_eq_j0_4072 {sp : Word} :\n (sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 =\n (sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat) + signExt... | [
{
"name": "divK_loop_n3_max_max_spec_within",
"fan_in": 0,
"n_deps_direct": 7,
"n_deps_transitive": 7,
"n_lines": 78,
"n_chars": 3583,
"n_subproofs": 6,
"n_tactics": 57,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 7,
"n_structural": 2,
"automation_only": fal... | 7 | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | @@ -43,6 +43,12 @@
(sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 := by
divmod_addr
+/-- j=1 un2 at uBase(1)-16 = j=0 u3 at uBase(0)-24 -/
+theorem u_j1_4080_eq_j0_4072 {sp : Word} :
+ (sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 =
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4a79c34ee8fa_9 | 5898c8d459dfe1c0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopComposeN3.lean | LoopComposeN3 | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 8 | [
{
"theorem_name": "divK_loop_n3_max_max_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 66,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n delta loopN3Pre; simp only []\n let u_base_1 := sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).t... | [
{
"name": "u_j1_4080_eq_j0_4072",
"text": "/-- j=1 un2 at uBase(1)-16 = j=0 u3 at uBase(0)-24 -/\ntheorem u_j1_4080_eq_j0_4072 {sp : Word} :\n (sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 =\n (sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat) + signExt... | [
{
"name": "divK_loop_n3_max_max_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 7,
"n_deps_transitive": 7,
"n_lines": 75,
"n_chars": 3529,
"n_subproofs": 6,
"n_tactics": 57,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 7,
"n_structural": 2,
"automation_only... | 7 | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | @@ -43,6 +43,12 @@
(sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 := by
divmod_addr
+/-- j=1 un2 at uBase(1)-16 = j=0 u3 at uBase(0)-24 -/
+theorem u_j1_4080_eq_j0_4072 {sp : Word} :
+ (sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 =
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4a79c34ee8fa_10 | 3f49d19ef1ea5850 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopComposeN3.lean | LoopComposeN3 | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 8 | [
{
"theorem_name": "divK_loop_n3_max_max_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 66,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n delta loopN3Pre; simp only []\n let u_base_1 := sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).t... | [
{
"name": "u_j1_4080_eq_j0_4072",
"text": "/-- j=1 un2 at uBase(1)-16 = j=0 u3 at uBase(0)-24 -/\ntheorem u_j1_4080_eq_j0_4072 {sp : Word} :\n (sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 =\n (sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat) + signExt... | [
{
"name": "divK_loop_n3_call_call_spec_within",
"fan_in": 0,
"n_deps_direct": 7,
"n_deps_transitive": 7,
"n_lines": 84,
"n_chars": 3944,
"n_subproofs": 6,
"n_tactics": 62,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 7,
"n_structural": 2,
"automation_only": f... | 7 | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | @@ -43,6 +43,12 @@
(sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 := by
divmod_addr
+/-- j=1 un2 at uBase(1)-16 = j=0 u3 at uBase(0)-24 -/
+theorem u_j1_4080_eq_j0_4072 {sp : Word} :
+ (sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 =
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4a79c34ee8fa_11 | b46696456404b983 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopComposeN3.lean | LoopComposeN3 | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 8 | [
{
"theorem_name": "divK_loop_n3_max_max_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 66,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n delta loopN3Pre; simp only []\n let u_base_1 := sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).t... | [
{
"name": "u_j1_4080_eq_j0_4072",
"text": "/-- j=1 un2 at uBase(1)-16 = j=0 u3 at uBase(0)-24 -/\ntheorem u_j1_4080_eq_j0_4072 {sp : Word} :\n (sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 =\n (sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat) + signExt... | [
{
"name": "divK_loop_n3_call_call_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 7,
"n_deps_transitive": 7,
"n_lines": 83,
"n_chars": 3984,
"n_subproofs": 6,
"n_tactics": 62,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 7,
"n_structural": 2,
"automation_on... | 7 | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | @@ -43,6 +43,12 @@
(sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 := by
divmod_addr
+/-- j=1 un2 at uBase(1)-16 = j=0 u3 at uBase(0)-24 -/
+theorem u_j1_4080_eq_j0_4072 {sp : Word} :
+ (sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 =
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4a79c34ee8fa_12 | c132bdb721f5ef37 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopComposeN3.lean | LoopComposeN3 | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 8 | [
{
"theorem_name": "divK_loop_n3_max_max_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 66,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n delta loopN3Pre; simp only []\n let u_base_1 := sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).t... | [
{
"name": "u_j1_4080_eq_j0_4072",
"text": "/-- j=1 un2 at uBase(1)-16 = j=0 u3 at uBase(0)-24 -/\ntheorem u_j1_4080_eq_j0_4072 {sp : Word} :\n (sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 =\n (sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat) + signExt... | [
{
"name": "divK_loop_n3_max_call_spec_within",
"fan_in": 0,
"n_deps_direct": 8,
"n_deps_transitive": 8,
"n_lines": 86,
"n_chars": 4118,
"n_subproofs": 6,
"n_tactics": 64,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 7,
"n_structural": 2,
"automation_only": fa... | 8 | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | @@ -43,6 +43,12 @@
(sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 := by
divmod_addr
+/-- j=1 un2 at uBase(1)-16 = j=0 u3 at uBase(0)-24 -/
+theorem u_j1_4080_eq_j0_4072 {sp : Word} :
+ (sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 =
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4a79c34ee8fa_13 | 5af3ebd9333a53fb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopComposeN3.lean | LoopComposeN3 | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 8 | [
{
"theorem_name": "divK_loop_n3_max_max_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 66,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n delta loopN3Pre; simp only []\n let u_base_1 := sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).t... | [
{
"name": "u_j1_4080_eq_j0_4072",
"text": "/-- j=1 un2 at uBase(1)-16 = j=0 u3 at uBase(0)-24 -/\ntheorem u_j1_4080_eq_j0_4072 {sp : Word} :\n (sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 =\n (sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat) + signExt... | [
{
"name": "divK_loop_n3_max_call_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 8,
"n_deps_transitive": 8,
"n_lines": 85,
"n_chars": 4120,
"n_subproofs": 6,
"n_tactics": 64,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 7,
"n_structural": 2,
"automation_onl... | 8 | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | @@ -43,6 +43,12 @@
(sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 := by
divmod_addr
+/-- j=1 un2 at uBase(1)-16 = j=0 u3 at uBase(0)-24 -/
+theorem u_j1_4080_eq_j0_4072 {sp : Word} :
+ (sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 =
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4a79c34ee8fa_14 | 3d25cce7004a8412 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopComposeN3.lean | LoopComposeN3 | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 8 | [
{
"theorem_name": "divK_loop_n3_max_max_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 66,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n delta loopN3Pre; simp only []\n let u_base_1 := sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).t... | [
{
"name": "u_j1_4080_eq_j0_4072",
"text": "/-- j=1 un2 at uBase(1)-16 = j=0 u3 at uBase(0)-24 -/\ntheorem u_j1_4080_eq_j0_4072 {sp : Word} :\n (sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 =\n (sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat) + signExt... | [
{
"name": "divK_loop_n3_call_max_spec_within",
"fan_in": 0,
"n_deps_direct": 8,
"n_deps_transitive": 8,
"n_lines": 83,
"n_chars": 3992,
"n_subproofs": 6,
"n_tactics": 61,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 7,
"n_structural": 2,
"automation_only": fa... | 8 | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | @@ -43,6 +43,12 @@
(sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 := by
divmod_addr
+/-- j=1 un2 at uBase(1)-16 = j=0 u3 at uBase(0)-24 -/
+theorem u_j1_4080_eq_j0_4072 {sp : Word} :
+ (sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 =
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4a79c34ee8fa_15 | 0111970245c36c4b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopComposeN3.lean | LoopComposeN3 | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 8 | [
{
"theorem_name": "divK_loop_n3_max_max_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 66,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n delta loopN3Pre; simp only []\n let u_base_1 := sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).t... | [
{
"name": "u_j1_4080_eq_j0_4072",
"text": "/-- j=1 un2 at uBase(1)-16 = j=0 u3 at uBase(0)-24 -/\ntheorem u_j1_4080_eq_j0_4072 {sp : Word} :\n (sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 =\n (sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat) + signExt... | [
{
"name": "divK_loop_n3_call_max_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 8,
"n_deps_transitive": 8,
"n_lines": 77,
"n_chars": 3683,
"n_subproofs": 6,
"n_tactics": 61,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 7,
"n_structural": 2,
"automation_onl... | 8 | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | /-
EvmAsm.Evm64.DivMod.LoopComposeN3
Two-iteration loop composition for n=3: composes j=1 (loop-back) with
j=0 (loop-exit) to produce a cpsTripleWithin from base+448 to base+904.
For n=3, the loop runs 2 iterations. The j=1 iteration modifies u[1]..u[4]
and stores q[1]. The j=0 iteration reads u[0]..u[4] (w... | @@ -43,6 +43,12 @@
(sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 := by
divmod_addr
+/-- j=1 un2 at uBase(1)-16 = j=0 u3 at uBase(0)-24 -/
+theorem u_j1_4080_eq_j0_4072 {sp : Word} :
+ (sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4080 =
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0d1f0958a0b8_0 | 6e29166537b99ace | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathV4NoNop.lean | FullPathV4NoNop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_div_phaseAB_n1_clz_c2_spec_v4_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hABCLZ := evm_div_phaseAB_n1_clz_spec_v4_noNop sp base b0 b1 b2 b3\n v5 v6 v7 v10 q0 q1 q2... | [
{
"name": "evm_div_phaseAB_n1_clz_spec_v4_noNop",
"text": "/-- DIV PhaseAB(n=1) + CLZ over `divCode_noNop_v4`.\n b≠0, b[3]=b[2]=b[1]=0; base → base+212. -/\ntheorem evm_div_phaseAB_n1_clz_spec_v4_noNop (sp base : Word)\n (b0 b1 b2 b3 v5 v6 v7 v10 : Word)\n (q0 q1 q2 q3 u5 u6 u7 nMem : Word)\n (h... | [
{
"name": "evm_div_phaseAB_n1_clz_c2_spec_v4_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 54,
"n_chars": 3433,
"n_subproofs": 5,
"n_tactics": 24,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_onl... | 1 | import EvmAsm.Evm64.DivMod.Compose.FullPath
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- DIV PhaseAB(n=1) + CLZ + PhaseC2(ntaken) over `divCode_noNop_v4`.
This is the shift≠0 prefix that reaches NormB. -/
theorem evm_div_phaseAB_n1_clz_c2_spec_v4_noNop (sp base : Word)
(b0 b1 b2 b3 v... | import EvmAsm.Evm64.DivMod.Compose.FullPath
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- DIV PhaseAB(n=1) + CLZ over `divCode_noNop_v4`.
b≠0, b[3]=b[2]=b[1]=0; base → base+212. -/
theorem evm_div_phaseAB_n1_clz_spec_v4_noNop (sp base : Word)
(b0 b1 b2 b3 v5 v6 v7 v10 : Word)
(q0 ... | @@ -6,6 +6,49 @@
open EvmAsm.Rv64
+/-- DIV PhaseAB(n=1) + CLZ over `divCode_noNop_v4`.
+ b≠0, b[3]=b[2]=b[1]=0; base → base+212. -/
+theorem evm_div_phaseAB_n1_clz_spec_v4_noNop (sp base : Word)
+ (b0 b1 b2 b3 v5 v6 v7 v10 : Word)
+ (q0 q1 q2 q3 u5 u6 u7 nMem : Word)
+ (hbnz : b0 ||| b1 ||| b2 ||| 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_0d1f0958a0b8_1 | af29c959bfc9b34c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathV4NoNop.lean | FullPathV4NoNop | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_div_n4_to_loopSetup_spec_v4_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 67,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let shift := (clzResult b3).1\n let antiShift := signExtend12 (0 : BitVec 12) - shift\n let b3' :=... | [
{
"name": "evm_div_n4_to_normB_spec_v4_noNop",
"text": "/-- PhaseAB(n=4) + CLZ + PhaseC2(shift≠0) + NormB over `divCode_noNop_v4`.\n base → base+312. b[0..3] normalized in-place. -/\ntheorem evm_div_n4_to_normB_spec_v4_noNop (sp base : Word)\n (b0 b1 b2 b3 v5 v6 v7 v10 : Word)\n (q0 q1 q2 q3 u5 u6 ... | [
{
"name": "evm_div_n4_to_loopSetup_spec_v4_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 93,
"n_chars": 5658,
"n_subproofs": 8,
"n_tactics": 69,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 1,
"automation_only"... | 1 | import EvmAsm.Evm64.DivMod.Compose.FullPath
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Full n=4 path from entry to loop body start over `divCode_noNop_v4`
(shift ≠ 0 case). Normalizes b[] and a[], then sets up loop parameters. -/
theorem evm_div_n4_to_loopSetup_spec_v4_noNop (sp base :... | import EvmAsm.Evm64.DivMod.Compose.FullPath
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- PhaseAB(n=4) + CLZ + PhaseC2(shift≠0) + NormB over `divCode_noNop_v4`.
base → base+312. b[0..3] normalized in-place. -/
theorem evm_div_n4_to_normB_spec_v4_noNop (sp base : Word)
(b0 b1 b2 b3 v5 ... | @@ -6,6 +6,66 @@
open EvmAsm.Rv64
+/-- PhaseAB(n=4) + CLZ + PhaseC2(shift≠0) + NormB over `divCode_noNop_v4`.
+ base → base+312. b[0..3] normalized in-place. -/
+theorem evm_div_n4_to_normB_spec_v4_noNop (sp base : Word)
+ (b0 b1 b2 b3 v5 v6 v7 v10 : Word)
+ (q0 q1 q2 q3 u5 u6 u7 nMem shiftMem : 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_bb971d729cf4_0 | 1d8c7a83e1e32064 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3CanonicalPointedEvidence.lean | N3CanonicalPointedEvidence | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "N3CanonicalPointedEvidence_iff_callableEvidence",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n ⟨N3CanonicalPointedEvidence.toCallableEvidence,\n N3CanonicalPointedEvidence.ofCallableEvide... | [
{
"name": "N3CanonicalPointedEvidence.ofCallableEvidence",
"text": "theorem N3CanonicalPointedEvidence.ofCallableEvidence {a b : EvmWord}\n (h : N3CallableSelectedShapeEvidence a b) :\n N3CanonicalPointedEvidence a b :=\n ⟨N3CallableSelectedShapeEvidence.selectedCarry_canonical h,\n N3CallableSelec... | [
{
"name": "N3CanonicalPointedEvidence_iff_callableEvidence",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 6,
"n_chars": 257,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automatio... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.N3CanonicalPointedEvidence
Single named abbreviation for the canonical pointed evidence used by the
N3 v4 selected callable route. Mirrors `N2CanonicalPointedEvidence` for
the n=3 lane.
-/
import EvmAsm.Evm64.DivMod.Spec.N3CallableSelectedShapeEvidenceCanonicalIff
namespace EvmAsm... | /-
EvmAsm.Evm64.DivMod.Spec.N3CanonicalPointedEvidence
Single named abbreviation for the canonical pointed evidence used by the
N3 v4 selected callable route. Mirrors `N2CanonicalPointedEvidence` for
the n=3 lane.
-/
import EvmAsm.Evm64.DivMod.Spec.N3CallableSelectedShapeEvidenceCanonicalIff
namespace EvmAsm... | @@ -32,8 +32,16 @@
N3CallableSelectedShapeEvidence a b :=
N3CallableSelectedShapeEvidence.of_canonical h.1 h.2
+theorem N3CanonicalPointedEvidence.ofCallableEvidence {a b : EvmWord}
+ (h : N3CallableSelectedShapeEvidence a b) :
+ N3CanonicalPointedEvidence a b :=
+ ⟨N3CallableSelectedShapeEvidence.sele... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_02d3acee13b1_0 | b448c4a236c91a6b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/TopIterSubs.lean | TopIterSubs | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evmExpMsbSavedBitCode_cond_mul_beq_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro a i h\n exact evmExpMsbSavedBitCode_iter_cond_mul_sub a i\n (EvmAsm.Evm64.exp_cond_mul_cal... | [
{
"name": "evmExpMsbSavedBitCode_iter_cond_mul_sub",
"text": "/-- Saved-bit conditional-multiply sub-block directly included in the\n corrected saved-bit top-level EXP code bundle. -/\ntheorem evmExpMsbSavedBitCode_iter_cond_mul_sub {base : Word}\n {mulOff : BitVec 21} {skipOff backOff : BitVec 13} :\... | [
{
"name": "evmExpMsbSavedBitCode_cond_mul_beq_sub",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 595,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only":... | 1 | /-
EvmAsm.Evm64.Exp.Compose.TopIterSubs
Iteration sub-block inclusion lemmas for the top-level EXP code bundles.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBase
import EvmAsm.Evm64.Exp.Compose.EvmExpCode
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Saved-bit conditio... | /-
EvmAsm.Evm64.Exp.Compose.TopIterSubs
Iteration sub-block inclusion lemmas for the top-level EXP code bundles.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBase
import EvmAsm.Evm64.Exp.Compose.EvmExpCode
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Saved-bit conditio... | @@ -12,13 +12,29 @@
open EvmAsm.Rv64
+/-- Saved-bit conditional-multiply sub-block directly included in the
+ corrected saved-bit top-level EXP code bundle. -/
+theorem evmExpMsbSavedBitCode_iter_cond_mul_sub {base : Word}
+ {mulOff : BitVec 21} {skipOff backOff : BitVec 13} :
+ ∀ a i, (EvmAsm.Evm64.exp_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_3306a48e683c_0 | 53cb2c29eddd3c38 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/LimbSpec.lean | LimbSpec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "evm_sdiv_cond_negate_limb_step_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro code\n rw [condNegateLimbStepPre_unfold, condNegateLimbStepPost_unfold]\n let mem := vA... | [
{
"name": "condNegateLimbStepPost_unfold",
"text": "theorem condNegateLimbStepPost_unfold\n {addrReg carryInReg maskReg valueReg carryReg : EvmAsm.Rv64.Reg}\n {limbOff : BitVec 12}\n {vAddr carryIn mask limbVal : Word} :\n condNegateLimbStepPost addrReg carryInReg maskReg valueReg carryReg\n ... | [
{
"name": "evm_sdiv_cond_negate_limb_step_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 36,
"n_chars": 1849,
"n_subproofs": 5,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_... | 2 | /-
EvmAsm.Evm64.SDiv.LimbSpec
Per-block / per-limb cpsTriple specs for SDIV sub-blocks (sign
extraction, abs negation, callable-divide JAL, sign-correction).
Per `OPCODE_TEMPLATE.md`, each sub-block gets exactly one cpsTriple
lemma; later Compose slices chain them.
-/
import EvmAsm.Evm64.SDiv.Program
impor... | /-
EvmAsm.Evm64.SDiv.LimbSpec
Per-block / per-limb cpsTriple specs for SDIV sub-blocks (sign
extraction, abs negation, callable-divide JAL, sign-correction).
Per `OPCODE_TEMPLATE.md`, each sub-block gets exactly one cpsTriple
lemma; later Compose slices chain them.
-/
import EvmAsm.Evm64.SDiv.Program
impor... | @@ -70,6 +70,21 @@
(maskReg ↦ᵣ mask) ** (valueReg ↦ᵣ sum) **
(carryReg ↦ᵣ carryOut) ** ((vAddr + EvmAsm.Rv64.signExtend12 limbOff) ↦ₘ sum)
+theorem condNegateLimbStepPost_unfold
+ {addrReg carryInReg maskReg valueReg carryReg : EvmAsm.Rv64.Reg}
+ {limbOff : BitVec 12}
+ {vAddr carryIn mask limbVal : Wo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3306a48e683c_1 | 692c9da946b3f768 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/LimbSpec.lean | LimbSpec | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "evm_sdiv_cond_negate_limb_step_self_carry_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro code\n rw [condNegateLimbStepSelfCarryPost_unfold]\n let mem := vAddr + EvmA... | [
{
"name": "condNegateLimbStepSelfCarryPost_unfold",
"text": "theorem condNegateLimbStepSelfCarryPost_unfold\n {addrReg maskReg valueReg carryReg : EvmAsm.Rv64.Reg}\n {limbOff : BitVec 12}\n {vAddr carryIn mask limbVal : Word} :\n condNegateLimbStepSelfCarryPost addrReg maskReg valueReg carryReg\... | [
{
"name": "evm_sdiv_cond_negate_limb_step_self_carry_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 35,
"n_chars": 1761,
"n_subproofs": 5,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"... | 1 | /-
EvmAsm.Evm64.SDiv.LimbSpec
Per-block / per-limb cpsTriple specs for SDIV sub-blocks (sign
extraction, abs negation, callable-divide JAL, sign-correction).
Per `OPCODE_TEMPLATE.md`, each sub-block gets exactly one cpsTriple
lemma; later Compose slices chain them.
-/
import EvmAsm.Evm64.SDiv.Program
impor... | /-
EvmAsm.Evm64.SDiv.LimbSpec
Per-block / per-limb cpsTriple specs for SDIV sub-blocks (sign
extraction, abs negation, callable-divide JAL, sign-correction).
Per `OPCODE_TEMPLATE.md`, each sub-block gets exactly one cpsTriple
lemma; later Compose slices chain them.
-/
import EvmAsm.Evm64.SDiv.Program
impor... | @@ -70,6 +70,20 @@
(valueReg ↦ᵣ sum) ** (carryReg ↦ᵣ carryOut) **
((vAddr + EvmAsm.Rv64.signExtend12 limbOff) ↦ₘ sum)
+theorem condNegateLimbStepSelfCarryPost_unfold
+ {addrReg maskReg valueReg carryReg : EvmAsm.Rv64.Reg}
+ {limbOff : BitVec 12}
+ {vAddr carryIn mask limbVal : Word} :
+ condNegateLi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3306a48e683c_2 | 6dd550ab7bff7c1e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/LimbSpec.lean | LimbSpec | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "evm_sdiv_cond_negate_256_block_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 64,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro code\n rw [condNegate256BlockPre_unfold, condNegate256BlockPost_unfold]\n let mem0 := v... | [
{
"name": "condNegate256BlockPost_unfold",
"text": "theorem condNegate256BlockPost_unfold\n {addrReg signReg maskReg valueReg carryReg : EvmAsm.Rv64.Reg}\n {limb0Off limb1Off limb2Off limb3Off : BitVec 12}\n {vAddr sign limb0 limb1 limb2 limb3 : Word} :\n condNegate256BlockPost addrReg signReg m... | [
{
"name": "evm_sdiv_cond_negate_256_block_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 85,
"n_chars": 4349,
"n_subproofs": 21,
"n_tactics": 64,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation... | 2 | /-
EvmAsm.Evm64.SDiv.LimbSpec
Per-block / per-limb cpsTriple specs for SDIV sub-blocks (sign
extraction, abs negation, callable-divide JAL, sign-correction).
Per `OPCODE_TEMPLATE.md`, each sub-block gets exactly one cpsTriple
lemma; later Compose slices chain them.
-/
import EvmAsm.Evm64.SDiv.Program
impor... | /-
EvmAsm.Evm64.SDiv.LimbSpec
Per-block / per-limb cpsTriple specs for SDIV sub-blocks (sign
extraction, abs negation, callable-divide JAL, sign-correction).
Per `OPCODE_TEMPLATE.md`, each sub-block gets exactly one cpsTriple
lemma; later Compose slices chain them.
-/
import EvmAsm.Evm64.SDiv.Program
impor... | @@ -137,6 +137,32 @@
((vAddr + EvmAsm.Rv64.signExtend12 limb2Off) ↦ₘ sum2) **
((vAddr + EvmAsm.Rv64.signExtend12 limb3Off) ↦ₘ sum3)
+theorem condNegate256BlockPost_unfold
+ {addrReg signReg maskReg valueReg carryReg : EvmAsm.Rv64.Reg}
+ {limb0Off limb1Off limb2Off limb3Off : BitVec 12}
+ {vAddr sign li... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cf5aaf98a2be_0 | d783fc351db54e2e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceOuterLoop.lean | ReduceOuterLoop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_loop_bit_loop_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (hmono := evm_mulmod_reduce512_loop_inner_code_sub base)\n ... | [
{
"name": "evm_mulmod_reduce512_loop_inner_code_sub",
"text": "/-- The inner reducer-step block sits at byte offset 8 within\n `evm_mulmod_reduce512_loop` (after `LD x17` and `ADDI x15`). -/\ntheorem evm_mulmod_reduce512_loop_inner_code_sub (base : Word) :\n ∀ a i, evm_mulmod_reduce512_inner_step_code... | [
{
"name": "evm_mulmod_reduce512_loop_bit_loop_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 782,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automatio... | 1 | /-
EvmAsm.Evm64.MulMod.ReduceOuterLoop
Outer eight-limb loop of the MULMOD 512-bit reducer. This file lifts the
inner 64-bit bit-loop spec into the enclosing `evm_mulmod_reduce512_loop`
code (the inner step sits at byte offset 8), and (later) composes the outer
loop body and its eight-limb induction.
-/
imp... | /-
EvmAsm.Evm64.MulMod.ReduceOuterLoop
Outer eight-limb loop of the MULMOD 512-bit reducer. This file lifts the
inner 64-bit bit-loop spec into the enclosing `evm_mulmod_reduce512_loop`
code (the inner step sits at byte offset 8), and (later) composes the outer
loop body and its eight-limb induction.
-/
imp... | @@ -16,6 +16,22 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
+/-- The inner reducer-step block sits at byte offset 8 within
+ `evm_mulmod_reduce512_loop` (after `LD x17` and `ADDI x15`). -/
+theorem evm_mulmod_reduce512_loop_inner_code_sub (base : Word) :
+ ∀ a i, evm_mulmod_reduce512_inner_step_code (base + ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cf5aaf98a2be_1 | 496930676d966b2d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceOuterLoop.lean | ReduceOuterLoop | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_loop_fold_one_limb_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hpf := cpsTripleWithin_frameR\n ((.x12 ↦ᵣ sp) ** (.x19 ↦ᵣ x19v) ** (.x20 ↦ᵣ x2... | [
{
"name": "evm_mulmod_reduce512_loop_prefix_spec_within",
"text": "/-- Outer-loop body prefix: `LD x17, [x16]` loads the current product limb and\n `ADDI x15, x0, 64` arms the inner bit counter, advancing to the inner loop\n at byte offset 8. -/\ntheorem evm_mulmod_reduce512_loop_prefix_spec_within\n ... | [
{
"name": "evm_mulmod_reduce512_loop_fold_one_limb_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 47,
"n_chars": 3072,
"n_subproofs": 2,
"n_tactics": 25,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 1,
"au... | 3 | /-
EvmAsm.Evm64.MulMod.ReduceOuterLoop
Outer eight-limb loop of the MULMOD 512-bit reducer. This file lifts the
inner 64-bit bit-loop spec into the enclosing `evm_mulmod_reduce512_loop`
code (the inner step sits at byte offset 8), and (later) composes the outer
loop body and its eight-limb induction.
-/
imp... | /-
EvmAsm.Evm64.MulMod.ReduceOuterLoop
Outer eight-limb loop of the MULMOD 512-bit reducer. This file lifts the
inner 64-bit bit-loop spec into the enclosing `evm_mulmod_reduce512_loop`
code (the inner step sits at byte offset 8), and (later) composes the outer
loop body and its eight-limb induction.
-/
imp... | @@ -46,6 +46,48 @@
(hmono := evm_mulmod_reduce512_loop_inner_code_sub base)
(h := evm_mulmod_reduce512_bit_loop_spec_within sp (base + 8) w x19v x20v r n)
+/-- Outer-loop body prefix: `LD x17, [x16]` loads the current product limb and
+ `ADDI x15, x0, 64` arms the inner bit counter, advancing to the inne... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cf5aaf98a2be_2 | e95cb75008750c43 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceOuterLoop.lean | ReduceOuterLoop | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_loop_advance_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h16 := cpsTripleWithin_extend_code (hmono := loop_addi16_code_sub base)\n (h := addi... | [
{
"name": "loop_addi18_code_sub",
"text": "/-- Single instruction `ADDI x18, x18, -1` at index 67 lives in `reduce512_loop`. -/\nprivate theorem loop_addi18_code_sub (base : Word) :\n ∀ a i, CodeReq.singleton (base + 276) (Instr.ADDI .x18 .x18 4095) a = some i →\n (CodeReq.ofProg base evm_mulmod_red... | [
{
"name": "evm_mulmod_reduce512_loop_advance_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 1290,
"n_subproofs": 4,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 1,
"automati... | 2 | /-
EvmAsm.Evm64.MulMod.ReduceOuterLoop
Outer eight-limb loop of the MULMOD 512-bit reducer. This file lifts the
inner 64-bit bit-loop spec into the enclosing `evm_mulmod_reduce512_loop`
code (the inner step sits at byte offset 8), and (later) composes the outer
loop body and its eight-limb induction.
-/
imp... | /-
EvmAsm.Evm64.MulMod.ReduceOuterLoop
Outer eight-limb loop of the MULMOD 512-bit reducer. This file lifts the
inner 64-bit bit-loop spec into the enclosing `evm_mulmod_reduce512_loop`
code (the inner step sits at byte offset 8), and (later) composes the outer
loop body and its eight-limb induction.
-/
imp... | @@ -28,13 +28,36 @@
· rw [evm_mulmod_reduce512_loop_length]; decide
· rw [evm_mulmod_reduce512_loop_length]; decide
+/-- Single instruction `ADDI x18, x18, -1` at index 67 lives in `reduce512_loop`. -/
+private theorem loop_addi18_code_sub (base : Word) :
+ ∀ a i, CodeReq.singleton (base + 276) (Instr.ADDI .... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cf5aaf98a2be_3 | f5ef6e6ed7c719bf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceOuterLoop.lean | ReduceOuterLoop | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_loop_fold_advance_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hfoldf := cpsTripleWithin_frameR ((.x18 ↦ᵣ x18v)) (by pcFree)\n (evm_mulmod_red... | [
{
"name": "evm_mulmod_reduce512_loop_advance_spec_within",
"text": "/-- Outer-loop pointer/counter advance: `ADDI x16, x16, -8 ; ADDI x18, x18, -1`. -/\ntheorem evm_mulmod_reduce512_loop_advance_spec_within (base x16v x18v : Word) :\n cpsTripleWithin 2 (base + 272) (base + 280)\n (CodeReq.ofProg bas... | [
{
"name": "evm_mulmod_reduce512_loop_fold_advance_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 36,
"n_chars": 2478,
"n_subproofs": 2,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 1,
"aut... | 7 | /-
EvmAsm.Evm64.MulMod.ReduceOuterLoop
Outer eight-limb loop of the MULMOD 512-bit reducer. This file lifts the
inner 64-bit bit-loop spec into the enclosing `evm_mulmod_reduce512_loop`
code (the inner step sits at byte offset 8), and (later) composes the outer
loop body and its eight-limb induction.
-/
imp... | /-
EvmAsm.Evm64.MulMod.ReduceOuterLoop
Outer eight-limb loop of the MULMOD 512-bit reducer. This file lifts the
inner 64-bit bit-loop spec into the enclosing `evm_mulmod_reduce512_loop`
code (the inner step sits at byte offset 8), and (later) composes the outer
loop body and its eight-limb induction.
-/
imp... | @@ -158,6 +158,25 @@
· rw [evm_mulmod_reduce512_loop_length]; decide
· rw [evm_mulmod_reduce512_loop_length]; decide
+/-- Outer-loop pointer/counter advance: `ADDI x16, x16, -8 ; ADDI x18, x18, -1`. -/
+theorem evm_mulmod_reduce512_loop_advance_spec_within (base x16v x18v : Word) :
+ cpsTripleWithin 2 (base ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cf5aaf98a2be_4 | 1e3c261a21e4a8c5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceOuterLoop.lean | ReduceOuterLoop | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_loop_body_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbnef := cpsBranchWithin_frameR\n ((.x12 ↦ᵣ sp) ** (.x15 ↦ᵣ (0 : Word)) **\n regOwn... | [
{
"name": "evm_mulmod_reduce512_loop_branch_spec_within",
"text": "/-- Outer-loop control `BNE x18, x0, -280` at byte offset 280: loops back to\n `base` while the eight-limb counter `x18` is nonzero, falls through to\n `base + 284` (the post-loop) when it reaches zero. -/\ntheorem evm_mulmod_reduce512... | [
{
"name": "evm_mulmod_reduce512_loop_body_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 52,
"n_chars": 3223,
"n_subproofs": 1,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 4,
"n_structural": 1,
"automation_... | 9 | /-
EvmAsm.Evm64.MulMod.ReduceOuterLoop
Outer eight-limb loop of the MULMOD 512-bit reducer. This file lifts the
inner 64-bit bit-loop spec into the enclosing `evm_mulmod_reduce512_loop`
code (the inner step sits at byte offset 8), and (later) composes the outer
loop body and its eight-limb induction.
-/
imp... | /-
EvmAsm.Evm64.MulMod.ReduceOuterLoop
Outer eight-limb loop of the MULMOD 512-bit reducer. This file lifts the
inner 64-bit bit-loop spec into the enclosing `evm_mulmod_reduce512_loop`
code (the inner step sits at byte offset 8), and (later) composes the outer
loop body and its eight-limb induction.
-/
imp... | @@ -212,6 +212,32 @@
exact cpsTripleWithin_weaken (fun h hp => by xperm_hyp hp) (fun h hp => by xperm_hyp hp)
(cpsTripleWithin_seq_perm_same_cr (fun h hp => by xperm_hyp hp) hfoldf hadvf)
+/-- Outer-loop control `BNE x18, x0, -280` at byte offset 280: loops back to
+ `base` while the eight-limb counter `x1... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cf5aaf98a2be_5 | ad9134d39f0c2852 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceOuterLoop.lean | ReduceOuterLoop | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_loop_body_regown_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 67,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine cpsBranchWithin_of_forall_regIs_to_regOwn (r := .x20) ?_\n intro v20\n have h19... | [
{
"name": "evm_mulmod_reduce512_loop_body_spec_within",
"text": "/-- One full outer-loop body iteration as a two-exit branch: fold the current\n product limb, advance the pointer/counter, then branch on the eight-limb\n counter — loop back to `base` while `x18` stays nonzero, fall through to\n `bas... | [
{
"name": "evm_mulmod_reduce512_loop_body_regown_spec_within",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 10,
"n_lines": 93,
"n_chars": 5372,
"n_subproofs": 3,
"n_tactics": 68,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 12,
"au... | 10 | /-
EvmAsm.Evm64.MulMod.ReduceOuterLoop
Outer eight-limb loop of the MULMOD 512-bit reducer. This file lifts the
inner 64-bit bit-loop spec into the enclosing `evm_mulmod_reduce512_loop`
code (the inner step sits at byte offset 8), and (later) composes the outer
loop body and its eight-limb induction.
-/
imp... | /-
EvmAsm.Evm64.MulMod.ReduceOuterLoop
Outer eight-limb loop of the MULMOD 512-bit reducer. This file lifts the
inner 64-bit bit-loop spec into the enclosing `evm_mulmod_reduce512_loop`
code (the inner step sits at byte offset 8), and (later) composes the outer
loop body and its eight-limb induction.
-/
imp... | @@ -238,6 +238,57 @@
rw [htaken, hnt] at hbne
exact cpsBranchWithin_extend_code (hmono := hsub) (h := hbne)
+/-- One full outer-loop body iteration as a two-exit branch: fold the current
+ product limb, advance the pointer/counter, then branch on the eight-limb
+ counter — loop back to `base` while `x18` ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cf5aaf98a2be_6 | c99cb3c0e132bd01 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceOuterLoop.lean | ReduceOuterLoop | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 2 | [
{
"theorem_name": "evm_mulmod_reduce512_loop_body_loop_path",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine cpsBranchWithin_takenPath\n (evm_mulmod_reduce512_loop_body_regown_spec_within sp base p... | [
{
"name": "evm_mulmod_reduce512_loop_body_regown_spec_within",
"text": "/-- Outer-loop body with the four scratch registers `x17`, `x15`, `x19`, `x20`\n carried as `regOwn` rather than pinned to concrete values. The body's prefix\n (`LD x17`, `ADDI x15`) and inner bit loop (`x19`/`x20`) overwrite all ... | [
{
"name": "evm_mulmod_reduce512_loop_body_loop_path",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 11,
"n_lines": 24,
"n_chars": 1263,
"n_subproofs": 3,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 6,
"automation_on... | 11 | /-
EvmAsm.Evm64.MulMod.ReduceOuterLoop
Outer eight-limb loop of the MULMOD 512-bit reducer. This file lifts the
inner 64-bit bit-loop spec into the enclosing `evm_mulmod_reduce512_loop`
code (the inner step sits at byte offset 8), and (later) composes the outer
loop body and its eight-limb induction.
-/
imp... | /-
EvmAsm.Evm64.MulMod.ReduceOuterLoop
Outer eight-limb loop of the MULMOD 512-bit reducer. This file lifts the
inner 64-bit bit-loop spec into the enclosing `evm_mulmod_reduce512_loop`
code (the inner step sits at byte offset 8), and (later) composes the outer
loop body and its eight-limb induction.
-/
imp... | @@ -309,6 +309,98 @@
((sp + signExtend12 (88 : BitVec 12)) ↦ₘ EvmWord.getLimbN n 3) **
((ptr + signExtend12 (0 : BitVec 12)) ↦ₘ limb)
+/-- Outer-loop body with the four scratch registers `x17`, `x15`, `x19`, `x20`
+ carried as `regOwn` rather than pinned to concrete values. The body's prefix
+ (`LD x17`, ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cf5aaf98a2be_7 | 20bb3c8b979ccc0e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceOuterLoop.lean | ReduceOuterLoop | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 2 | [
{
"theorem_name": "evm_mulmod_reduce512_loop_body_loop_path",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine cpsBranchWithin_takenPath\n (evm_mulmod_reduce512_loop_body_regown_spec_within sp base p... | [
{
"name": "evm_mulmod_reduce512_loop_body_regown_spec_within",
"text": "/-- Outer-loop body with the four scratch registers `x17`, `x15`, `x19`, `x20`\n carried as `regOwn` rather than pinned to concrete values. The body's prefix\n (`LD x17`, `ADDI x15`) and inner bit loop (`x19`/`x20`) overwrite all ... | [
{
"name": "evm_mulmod_reduce512_loop_body_done_path",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 11,
"n_lines": 24,
"n_chars": 1267,
"n_subproofs": 3,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 6,
"automation_on... | 11 | /-
EvmAsm.Evm64.MulMod.ReduceOuterLoop
Outer eight-limb loop of the MULMOD 512-bit reducer. This file lifts the
inner 64-bit bit-loop spec into the enclosing `evm_mulmod_reduce512_loop`
code (the inner step sits at byte offset 8), and (later) composes the outer
loop body and its eight-limb induction.
-/
imp... | /-
EvmAsm.Evm64.MulMod.ReduceOuterLoop
Outer eight-limb loop of the MULMOD 512-bit reducer. This file lifts the
inner 64-bit bit-loop spec into the enclosing `evm_mulmod_reduce512_loop`
code (the inner step sits at byte offset 8), and (later) composes the outer
loop body and its eight-limb induction.
-/
imp... | @@ -309,6 +309,98 @@
((sp + signExtend12 (88 : BitVec 12)) ↦ₘ EvmWord.getLimbN n 3) **
((ptr + signExtend12 (0 : BitVec 12)) ↦ₘ limb)
+/-- Outer-loop body with the four scratch registers `x17`, `x15`, `x19`, `x20`
+ carried as `regOwn` rather than pinned to concrete values. The body's prefix
+ (`LD x17`, ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ee6642e983df_0 | 3f1433b69e9a2b53 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/SpecPredicates.lean | SpecPredicates | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "isCallTrialN4Evm_of_shift_nz",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [isCallTrialN4Evm_def]\n exact isCallTrialN4_of_shift_nz (a.getLimbN 3) (b.getLimbN 2) (b.getLimbN 3)\n ... | [
{
"name": "isCallTrialN4Evm_def",
"text": "theorem isCallTrialN4Evm_def {a b : EvmWord} :\n isCallTrialN4Evm a b =\n isCallTrialN4 (a.getLimbN 3) (b.getLimbN 2) (b.getLimbN 3) := rfl\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 145,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic"... | [
{
"name": "isCallTrialN4Evm_of_shift_nz",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 860,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.SpecPredicates
EvmWord-level wrappers around the Word-tuple runtime condition predicates
used by the n=4 stack-level DIV/MOD specs.
Each definition is a thin shim over a Word-level predicate plus a `_def`
`rfl` lemma. Extracted from `Spec.lean` to keep that file under the file-size
... | /-
EvmAsm.Evm64.DivMod.SpecPredicates
EvmWord-level wrappers around the Word-tuple runtime condition predicates
used by the n=4 stack-level DIV/MOD specs.
Each definition is a thin shim over a Word-level predicate plus a `_def`
`rfl` lemma. Extracted from `Spec.lean` to keep that file under the file-size
... | @@ -63,6 +63,10 @@
isAddbackBorrowN4Call (a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2) (a.getLimbN 3)
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3)
+theorem isCallTrialN4Evm_def {a b : EvmWord} :
+ isCallTrialN4Evm a b =
+ isCallTrialN4 (a.getLimbN 3) (b.getLimbN 2) (b.g... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ee6642e983df_1 | 1c857b7a4155f071 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/SpecPredicates.lean | SpecPredicates | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "isAddbackCarry2NzN4CallV4Evm_raw",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [isAddbackCarry2NzN4CallV4Evm_def] at hcarry2_nz\n exact isAddbackCarry2NzN4CallV4Ab_raw hcarry2_nz",
... | [
{
"name": "isAddbackCarry2NzN4CallV4Evm_def",
"text": "theorem isAddbackCarry2NzN4CallV4Evm_def {a b : EvmWord} :\n isAddbackCarry2NzN4CallV4Evm a b =\n isAddbackCarry2NzN4CallV4Ab (a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2) (a.getLimbN 3)\n (b.getLimbN 0) (b.getLimbN 1... | [
{
"name": "isAddbackCarry2NzN4CallV4Evm_raw",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 32,
"n_chars": 1670,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": fals... | 1 | /-
EvmAsm.Evm64.DivMod.SpecPredicates
EvmWord-level wrappers around the Word-tuple runtime condition predicates
used by the n=4 stack-level DIV/MOD specs.
Each definition is a thin shim over a Word-level predicate plus a `_def`
`rfl` lemma. Extracted from `Spec.lean` to keep that file under the file-size
... | /-
EvmAsm.Evm64.DivMod.SpecPredicates
EvmWord-level wrappers around the Word-tuple runtime condition predicates
used by the n=4 stack-level DIV/MOD specs.
Each definition is a thin shim over a Word-level predicate plus a `_def`
`rfl` lemma. Extracted from `Spec.lean` to keep that file under the file-size
... | @@ -85,6 +85,11 @@
isAddbackCarry2NzN4CallV4Ab (a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2) (a.getLimbN 3)
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3)
+theorem isAddbackCarry2NzN4CallV4Evm_def {a b : EvmWord} :
+ isAddbackCarry2NzN4CallV4Evm a b =
+ isAddbackCar... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ee6642e983df_2 | ed147b218c7eeae2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/SpecPredicates.lean | SpecPredicates | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "isAddbackCarry2NzN4CallV4Evm_raw",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [isAddbackCarry2NzN4CallV4Evm_def] at hcarry2_nz\n exact isAddbackCarry2NzN4CallV4Ab_raw hcarry2_nz",
... | [
{
"name": "isAddbackCarry2NzN4CallV4Evm_def",
"text": "theorem isAddbackCarry2NzN4CallV4Evm_def {a b : EvmWord} :\n isAddbackCarry2NzN4CallV4Evm a b =\n isAddbackCarry2NzN4CallV4Ab (a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2) (a.getLimbN 3)\n (b.getLimbN 0) (b.getLimbN 1... | [
{
"name": "isAddbackCarry2NzN4CallV4Evm_of_first_carry_ne_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 29,
"n_chars": 1534,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"aut... | 1 | /-
EvmAsm.Evm64.DivMod.SpecPredicates
EvmWord-level wrappers around the Word-tuple runtime condition predicates
used by the n=4 stack-level DIV/MOD specs.
Each definition is a thin shim over a Word-level predicate plus a `_def`
`rfl` lemma. Extracted from `Spec.lean` to keep that file under the file-size
... | /-
EvmAsm.Evm64.DivMod.SpecPredicates
EvmWord-level wrappers around the Word-tuple runtime condition predicates
used by the n=4 stack-level DIV/MOD specs.
Each definition is a thin shim over a Word-level predicate plus a `_def`
`rfl` lemma. Extracted from `Spec.lean` to keep that file under the file-size
... | @@ -85,6 +85,11 @@
isAddbackCarry2NzN4CallV4Ab (a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2) (a.getLimbN 3)
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3)
+theorem isAddbackCarry2NzN4CallV4Evm_def {a b : EvmWord} :
+ isAddbackCarry2NzN4CallV4Evm a b =
+ isAddbackCar... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_28d706cb9676_0 | 6571ae6ff3c7ead5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStepBounds.lean | SavedBitFixedIterStepBounds | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "cpsTripleWithin_expTwoMulFixedIterPreNWithStateFrame_to_stepPost_bounded",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_weaken\n (fun _ h =>\n expTwoMulFixedIterPre... | [
{
"name": "cpsTripleWithin_expTwoMulFixedIterPreNWithControlFrame_to_stepPost_bounded",
"text": "theorem cpsTripleWithin_expTwoMulFixedIterPreNWithControlFrame_to_stepPost_bounded\n {baseWord exponentWord : EvmWord} {k : Nat}\n {nBound : Nat}\n (controlC6 e machineC6 iterCount v10 v18 ptr nextLimb\... | [
{
"name": "cpsTripleWithin_expTwoMulFixedIterPreNWithStateFrame_to_stepPost_bounded",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 37,
"n_chars": 1684,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_str... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStepBounds
Bounded wrappers for fixed EXP iteration step eliminators.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
theorem cpsTripleWithin_expTw... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStepBounds
Bounded wrappers for fixed EXP iteration step eliminators.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
theorem cpsTripleWithin_expTw... | @@ -11,6 +11,39 @@
open EvmAsm.Rv64
+theorem cpsTripleWithin_expTwoMulFixedIterPreNWithControlFrame_to_stepPost_bounded
+ {baseWord exponentWord : EvmWord} {k : Nat}
+ {nBound : Nat}
+ (controlC6 e machineC6 iterCount v10 v18 ptr nextLimb
+ nextNextLimb sp evmSp tOld vOld r0 r1 r2 r3 d0 d1 d2 d3
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_28d706cb9676_1 | 7736bee950a89343 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStepBounds.lean | SavedBitFixedIterStepBounds | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "cpsTripleWithin_expTwoMulFixedIterPreNWithState_to_stepPost_bounded",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_weaken\n (fun _ h => by\n rw [expTwoMulFixedIterP... | [
{
"name": "cpsTripleWithin_expTwoMulFixedIterPreNWithStateFrame_to_stepPost_bounded",
"text": "theorem cpsTripleWithin_expTwoMulFixedIterPreNWithStateFrame_to_stepPost_bounded\n {baseWord exponentWord : EvmWord} {k : Nat}\n {nBound : Nat}\n (controlC6 e machineC6 iterCount v10 v18 ptr nextLimb\n ... | [
{
"name": "cpsTripleWithin_expTwoMulFixedIterPreNWithState_to_stepPost_bounded",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 36,
"n_chars": 1652,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structu... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStepBounds
Bounded wrappers for fixed EXP iteration step eliminators.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
theorem cpsTripleWithin_expTw... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStepBounds
Bounded wrappers for fixed EXP iteration step eliminators.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
theorem cpsTripleWithin_expTw... | @@ -44,6 +44,42 @@
a0 a1 a2 a3 v7 v11 base frame hFrame hbase hControlMachine hne
hk hBase hNextNext)
+theorem cpsTripleWithin_expTwoMulFixedIterPreNWithStateFrame_to_stepPost_bounded
+ {baseWord exponentWord : EvmWord} {k : Nat}
+ {nBound : Nat}
+ (controlC6 e machineC6 iterCount v10 v18 ptr 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_28d706cb9676_2 | d01bb3268506b8d0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStepBounds.lean | SavedBitFixedIterStepBounds | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "cpsTripleWithin_expTwoMulFixedIterPreNWithStateFrame_seq_stepPost_bounded",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_weaken\n (fun _ h =>\n expTwoMulFixedIterPr... | [
{
"name": "cpsTripleWithin_expTwoMulFixedIterPreNWithControlFrame_seq_stepPost_bounded",
"text": "theorem cpsTripleWithin_expTwoMulFixedIterPreNWithControlFrame_seq_stepPost_bounded\n {baseWord exponentWord : EvmWord} {k : Nat}\n {nSteps nBound : Nat} {exit : Word} {frame Q : Assertion}\n (controlC... | [
{
"name": "cpsTripleWithin_expTwoMulFixedIterPreNWithStateFrame_seq_stepPost_bounded",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 41,
"n_chars": 1867,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_st... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStepBounds
Bounded wrappers for fixed EXP iteration step eliminators.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
theorem cpsTripleWithin_expTw... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStepBounds
Bounded wrappers for fixed EXP iteration step eliminators.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
theorem cpsTripleWithin_expTw... | @@ -11,6 +11,43 @@
open EvmAsm.Rv64
+theorem cpsTripleWithin_expTwoMulFixedIterPreNWithControlFrame_seq_stepPost_bounded
+ {baseWord exponentWord : EvmWord} {k : Nat}
+ {nSteps nBound : Nat} {exit : Word} {frame Q : Assertion}
+ (controlC6 e machineC6 iterCount v10 v18 ptr nextLimb
+ nextNextLimb 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_28d706cb9676_3 | 4d5af35deb92c4f1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStepBounds.lean | SavedBitFixedIterStepBounds | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "cpsTripleWithin_expTwoMulFixedIterPreNWithState_seq_stepPost_bounded",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_weaken\n (fun _ h => by\n rw [expTwoMulFixedIter... | [
{
"name": "cpsTripleWithin_expTwoMulFixedIterPreNWithStateFrame_seq_stepPost_bounded",
"text": "theorem cpsTripleWithin_expTwoMulFixedIterPreNWithStateFrame_seq_stepPost_bounded\n {baseWord exponentWord : EvmWord} {k : Nat}\n {nSteps nBound : Nat} {exit : Word} {frame Q : Assertion}\n (controlC6 e ... | [
{
"name": "cpsTripleWithin_expTwoMulFixedIterPreNWithState_seq_stepPost_bounded",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 41,
"n_chars": 1846,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_struct... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStepBounds
Bounded wrappers for fixed EXP iteration step eliminators.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
theorem cpsTripleWithin_expTw... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStepBounds
Bounded wrappers for fixed EXP iteration step eliminators.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
theorem cpsTripleWithin_expTw... | @@ -48,6 +48,46 @@
a0 a1 a2 a3 v7 v11 base hFrame hbase hControlMachine hne
hk hBase hNextNext hStepPost)
+theorem cpsTripleWithin_expTwoMulFixedIterPreNWithStateFrame_seq_stepPost_bounded
+ {baseWord exponentWord : EvmWord} {k : Nat}
+ {nSteps nBound : Nat} {exit : Word} {frame Q : Assertion}
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_28d706cb9676_4 | 1bc7412ceead0d5d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStepBounds.lean | SavedBitFixedIterStepBounds | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "cpsTripleWithin_expTwoMulFixedIterPreNWithStateFrame_stepPost_elim_bounded",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_weaken\n (fun _ h =>\n expTwoMulFixedIterP... | [
{
"name": "cpsTripleWithin_expTwoMulFixedIterPreNWithControlFrame_stepPost_elim_bounded",
"text": "theorem cpsTripleWithin_expTwoMulFixedIterPreNWithControlFrame_stepPost_elim_bounded\n {baseWord exponentWord : EvmWord} {k : Nat}\n {nSteps nBound : Nat} {exit : Word} {frame Q : Assertion}\n (contro... | [
{
"name": "cpsTripleWithin_expTwoMulFixedIterPreNWithStateFrame_stepPost_elim_bounded",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 54,
"n_chars": 2458,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_s... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStepBounds
Bounded wrappers for fixed EXP iteration step eliminators.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
theorem cpsTripleWithin_expTw... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStepBounds
Bounded wrappers for fixed EXP iteration step eliminators.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
theorem cpsTripleWithin_expTw... | @@ -11,6 +11,60 @@
open EvmAsm.Rv64
+theorem cpsTripleWithin_expTwoMulFixedIterPreNWithControlFrame_stepPost_elim_bounded
+ {baseWord exponentWord : EvmWord} {k : Nat}
+ {nSteps nBound : Nat} {exit : Word} {frame Q : Assertion}
+ (controlC6 e machineC6 iterCount v10 v18 ptr nextLimb
+ nextNextLimb 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_28d706cb9676_5 | f5237174263630af | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStepBounds.lean | SavedBitFixedIterStepBounds | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "cpsTripleWithin_expTwoMulFixedIterPreNWithStateFrame_stepPost_bit_elim_bounded",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_weaken\n (fun _ h =>\n expTwoMulFixedI... | [
{
"name": "cpsTripleWithin_expTwoMulFixedIterPreNWithControlFrame_stepPost_bit_elim_bounded",
"text": "theorem cpsTripleWithin_expTwoMulFixedIterPreNWithControlFrame_stepPost_bit_elim_bounded\n {baseWord exponentWord : EvmWord} {k : Nat}\n {nSteps nBound : Nat} {exit : Word} {frame Q : Assertion}\n ... | [
{
"name": "cpsTripleWithin_expTwoMulFixedIterPreNWithStateFrame_stepPost_bit_elim_bounded",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 71,
"n_chars": 3361,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStepBounds
Bounded wrappers for fixed EXP iteration step eliminators.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
theorem cpsTripleWithin_expTw... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStepBounds
Bounded wrappers for fixed EXP iteration step eliminators.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
theorem cpsTripleWithin_expTw... | @@ -11,6 +11,81 @@
open EvmAsm.Rv64
+theorem cpsTripleWithin_expTwoMulFixedIterPreNWithControlFrame_stepPost_bit_elim_bounded
+ {baseWord exponentWord : EvmWord} {k : Nat}
+ {nSteps nBound : Nat} {exit : Word} {frame Q : Assertion}
+ (controlC6 e machineC6 iterCount v10 v18 ptr nextLimb
+ nextNextLim... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3d40bceaab8a_0 | 96325be977219290 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V5ReuseV6.lean | V5ReuseV6 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "divCode_v5_addr_mul4",
"depth": 1,
"n_commands": 0,
"n_lines": 46,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold divCode_v5 at h\n obtain ⟨j, hj, hblk⟩ := CodeReq.unionAll_some_mem _ a i h\n simp only [List.length_cons, L... | [
{
"name": "CodeReq.unionAll_some_mem",
"text": "/-- A hit in a `unionAll` comes from some component block. -/\ntheorem CodeReq.unionAll_some_mem (crs : List CodeReq) (a : Word) (i : Instr)\n (h : (CodeReq.unionAll crs) a = some i) :\n ∃ j, ∃ (hj : j < crs.length), (crs.get ⟨j, hj⟩) a = some i := by\n ... | [
{
"name": "divCode_v5_addr_mul4",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 54,
"n_chars": 3372,
"n_subproofs": 15,
"n_tactics": 88,
"cyclomatic": 2,
"n_automation": 43,
"n_rewrites": 15,
"n_structural": 30,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.V5ReuseV6
Infrastructure for reusing the v5 unconditional stack spec inside `divCodeV6`.
The embedded `evm_div_v5` sits at `base + v6V5Off` and is the last (index 11)
element of `divCodeV6`'s `unionAll`. To frame the v5 spec into `divCodeV6` we
need each preceding fast-path blo... | /-
EvmAsm.Evm64.DivMod.Compose.V5ReuseV6
Infrastructure for reusing the v5 unconditional stack spec inside `divCodeV6`.
The embedded `evm_div_v5` sits at `base + v6V5Off` and is the last (index 11)
element of `divCodeV6`'s `unionAll`. To frame the v5 spec into `divCodeV6` we
need each preceding fast-path blo... | @@ -19,6 +19,22 @@
namespace EvmAsm.Rv64
+/-- A hit in a `unionAll` comes from some component block. -/
+theorem CodeReq.unionAll_some_mem (crs : List CodeReq) (a : Word) (i : Instr)
+ (h : (CodeReq.unionAll crs) a = some i) :
+ ∃ j, ∃ (hj : j < crs.length), (crs.get ⟨j, hj⟩) a = some i := by
+ induction cr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3d40bceaab8a_1 | 58cc861ad5320d91 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V5ReuseV6.lean | V5ReuseV6 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "fast_disjoint_divCode_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro a\n rcases Option.eq_none_or_eq_some (CodeReq.ofProg c pFast a) with hA | ⟨i, hA⟩\n · left; exact hA\n ·... | [
{
"name": "divCode_v5_addr_mul4",
"text": "/-- Support lemma: every address `divCode_v5 b` maps lies at `b + 4·K` for some\n `K < 353`. The 14 blocks are laid out contiguously (offsets\n `0/32/116/212/228/312/396/432/448/908/1008/1048/1068/1072`, lengths summing\n to 353), so block `j` starting at ... | [
{
"name": "fast_disjoint_divCode_v5",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 21,
"n_chars": 1006,
"n_subproofs": 3,
"n_tactics": 13,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 6,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.V5ReuseV6
Infrastructure for reusing the v5 unconditional stack spec inside `divCodeV6`.
The embedded `evm_div_v5` sits at `base + v6V5Off` and is the last (index 11)
element of `divCodeV6`'s `unionAll`. To frame the v5 spec into `divCodeV6` we
need each preceding fast-path blo... | /-
EvmAsm.Evm64.DivMod.Compose.V5ReuseV6
Infrastructure for reusing the v5 unconditional stack spec inside `divCodeV6`.
The embedded `evm_div_v5` sits at `base + v6V5Off` and is the last (index 11)
element of `divCodeV6`'s `unionAll`. To frame the v5 spec into `divCodeV6` we
need each preceding fast-path blo... | @@ -41,6 +41,59 @@
open EvmAsm.Rv64
+/-- Support lemma: every address `divCode_v5 b` maps lies at `b + 4·K` for some
+ `K < 353`. The 14 blocks are laid out contiguously (offsets
+ `0/32/116/212/228/312/396/432/448/908/1008/1048/1068/1072`, lengths summing
+ to 353), so block `j` starting at instruction `... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3d40bceaab8a_2 | ae207d9b2fa500d7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V5ReuseV6.lean | V5ReuseV6 | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "fast_disjoint_divCode_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro a\n rcases Option.eq_none_or_eq_some (CodeReq.ofProg c pFast a) with hA | ⟨i, hA⟩\n · left; exact hA\n ·... | [
{
"name": "divCode_v5_addr_mul4",
"text": "/-- Support lemma: every address `divCode_v5 b` maps lies at `b + 4·K` for some\n `K < 353`. The 14 blocks are laid out contiguously (offsets\n `0/32/116/212/228/312/396/432/448/908/1008/1048/1068/1072`, lengths summing\n to 353), so block `j` starting at ... | [
{
"name": "divCode_v5_sub_divCodeV6",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 25,
"n_chars": 1485,
"n_subproofs": 0,
"n_tactics": 21,
"cyclomatic": 2,
"n_automation": 15,
"n_rewrites": 1,
"n_structural": 15,
"automation_only": false,
... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.V5ReuseV6
Infrastructure for reusing the v5 unconditional stack spec inside `divCodeV6`.
The embedded `evm_div_v5` sits at `base + v6V5Off` and is the last (index 11)
element of `divCodeV6`'s `unionAll`. To frame the v5 spec into `divCodeV6` we
need each preceding fast-path blo... | /-
EvmAsm.Evm64.DivMod.Compose.V5ReuseV6
Infrastructure for reusing the v5 unconditional stack spec inside `divCodeV6`.
The embedded `evm_div_v5` sits at `base + v6V5Off` and is the last (index 11)
element of `divCodeV6`'s `unionAll`. To frame the v5 spec into `divCodeV6` we
need each preceding fast-path blo... | @@ -41,6 +41,59 @@
open EvmAsm.Rv64
+/-- Support lemma: every address `divCode_v5 b` maps lies at `b + 4·K` for some
+ `K < 353`. The 14 blocks are laid out contiguously (offsets
+ `0/32/116/212/228/312/396/432/448/908/1008/1048/1068/1072`, lengths summing
+ to 353), so block `j` starting at instruction `... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3d40bceaab8a_3 | 0c45bf798adf0749 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V5ReuseV6.lean | V5ReuseV6 | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "divCode_v5_sub_divCodeV6",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold divCodeV6\n refine CodeReq.mono_sub_unionAll (divCode_v5 (base + v6V5Off)) _ 11 ?_ ?_ ?_\n · simp only [... | [
{
"name": "fast_disjoint_divCode_v5",
"text": "/-- A fast-path block at base address `c = base + d` (`d` an instruction-byte\n offset) that fits entirely below `v6V5Off` (= 816) is disjoint from the\n embedded `divCode_v5` at `base + v6V5Off`: any shared address would be both\n `base + (d + 4·k₁)` ... | [
{
"name": "evm_div_v5_unconditional_over_divCodeV6",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 25,
"n_chars": 1458,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only... | 4 | /-
EvmAsm.Evm64.DivMod.Compose.V5ReuseV6
Infrastructure for reusing the v5 unconditional stack spec inside `divCodeV6`.
The embedded `evm_div_v5` sits at `base + v6V5Off` and is the last (index 11)
element of `divCodeV6`'s `unionAll`. To frame the v5 spec into `divCodeV6` we
need each preceding fast-path blo... | /-
EvmAsm.Evm64.DivMod.Compose.V5ReuseV6
Infrastructure for reusing the v5 unconditional stack spec inside `divCodeV6`.
The embedded `evm_div_v5` sits at `base + v6V5Off` and is the last (index 11)
element of `divCodeV6`'s `unionAll`. To frame the v5 spec into `divCodeV6` we
need each preceding fast-path blo... | @@ -94,6 +94,26 @@
exact ⟨268 + k, by simp only [divK_div128_v5_len] at hk; omega,
by rw [haddr]; simp only [div128Off]; bv_omega⟩
+/-- A fast-path block at base address `c = base + d` (`d` an instruction-byte
+ offset) that fits entirely below `v6V5Off` (= 816) is disjoint from the
+ embedded `divC... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74806e72ec5c_0 | b6132c4045048b03 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1PointCopy64SAsm.lean | Secp256k1PointCopy64SAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "copy_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 36,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hse0 : signExtend12 (0 : BitVec 12) = (0 : Word) := by decide\n have hloadAddr : rf.get .x10 + signExtend12 (0 : BitVec ... | [
{
"name": "execInstrRF_lbu_ro",
"text": "private theorem execInstrRF_lbu_ro (ro : Region) (rwBase : Word) (rf : RegFile)\n (ws : List (BitVec 8)) (rd rs1 : Reg) (ofs : BitVec 12)\n (h : ¬ inRw rwBase ws (rf.get rs1 + signExtend12 ofs) 1) :\n execInstrRF ro rwBase rf ws (.LBU rd rs1 ofs)\n = (r... | [
{
"name": "copy_engine",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 44,
"n_chars": 2147,
"n_subproofs": 5,
"n_tactics": 36,
"cyclomatic": 1,
"n_automation": 11,
"n_rewrites": 13,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 3 | /-
EvmAsm.Codegen.Programs.Secp256k1PointCopy64SAsm
Verified SAsm port of `secp256k1_point_copy64`: copy a 64-byte secp256k1 affine point
buffer from `a0` to `a1` using the emitted alignment-free byte loop.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
import EvmAsm.Rv64.SAsm.Tactic
impo... | /-
EvmAsm.Codegen.Programs.Secp256k1PointCopy64SAsm
Verified SAsm port of `secp256k1_point_copy64`: copy a 64-byte secp256k1 affine point
buffer from `a0` to `a1` using the emitted alignment-free byte loop.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
import EvmAsm.Rv64.SAsm.Tactic
impo... | @@ -23,6 +23,15 @@
def copyWin64 (srcBytes orig : List (BitVec 8)) (i : Nat) : List (BitVec 8) :=
srcBytes.take i ++ orig.drop i
+private theorem execInstrRF_lbu_ro (ro : Region) (rwBase : Word) (rf : RegFile)
+ (ws : List (BitVec 8)) (rd rs1 : Reg) (ofs : BitVec 12)
+ (h : ¬ inRw rwBase ws (rf.get rs1 + si... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74806e72ec5c_1 | 35b7d234342bc05d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1PointCopy64SAsm.lean | Secp256k1PointCopy64SAsm | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "copy_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 36,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hse0 : signExtend12 (0 : BitVec 12) = (0 : Word) := by decide\n have hloadAddr : rf.get .x10 + signExtend12 (0 : BitVec ... | [
{
"name": "execInstrRF_lbu_ro",
"text": "private theorem execInstrRF_lbu_ro (ro : Region) (rwBase : Word) (rf : RegFile)\n (ws : List (BitVec 8)) (rd rs1 : Reg) (ofs : BitVec 12)\n (h : ¬ inRw rwBase ws (rf.get rs1 + signExtend12 ofs) 1) :\n execInstrRF ro rwBase rf ws (.LBU rd rs1 ofs)\n = (r... | [
{
"name": "copy_blockVCs",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 44,
"n_chars": 1973,
"n_subproofs": 6,
"n_tactics": 37,
"cyclomatic": 2,
"n_automation": 12,
"n_rewrites": 15,
"n_structural": 5,
"automation_only": false,
"max_nest... | 2 | /-
EvmAsm.Codegen.Programs.Secp256k1PointCopy64SAsm
Verified SAsm port of `secp256k1_point_copy64`: copy a 64-byte secp256k1 affine point
buffer from `a0` to `a1` using the emitted alignment-free byte loop.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
import EvmAsm.Rv64.SAsm.Tactic
impo... | /-
EvmAsm.Codegen.Programs.Secp256k1PointCopy64SAsm
Verified SAsm port of `secp256k1_point_copy64`: copy a 64-byte secp256k1 affine point
buffer from `a0` to `a1` using the emitted alignment-free byte loop.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
import EvmAsm.Rv64.SAsm.Tactic
impo... | @@ -23,6 +23,15 @@
def copyWin64 (srcBytes orig : List (BitVec 8)) (i : Nat) : List (BitVec 8) :=
srcBytes.take i ++ orig.drop i
+private theorem execInstrRF_lbu_ro (ro : Region) (rwBase : Word) (rf : RegFile)
+ (ws : List (BitVec 8)) (rd rs1 : Reg) (ofs : BitVec 12)
+ (h : ¬ inRw rwBase ws (rf.get rs1 + si... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_74806e72ec5c_2 | e00d4e56d1680c4f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1PointCopy64SAsm.lean | Secp256k1PointCopy64SAsm | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "copy_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 36,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hse0 : signExtend12 (0 : BitVec 12) = (0 : Word) := by decide\n have hloadAddr : rf.get .x10 + signExtend12 (0 : BitVec ... | [
{
"name": "execInstrRF_lbu_ro",
"text": "private theorem execInstrRF_lbu_ro (ro : Region) (rwBase : Word) (rf : RegFile)\n (ws : List (BitVec 8)) (rd rs1 : Reg) (ofs : BitVec 12)\n (h : ¬ inRw rwBase ws (rf.get rs1 + signExtend12 ofs) 1) :\n execInstrRF ro rwBase rf ws (.LBU rd rs1 ofs)\n = (r... | [
{
"name": "secp256k1PointCopy64Fn_spec",
"fan_in": 0,
"n_deps_direct": 9,
"n_deps_transitive": 12,
"n_lines": 69,
"n_chars": 3370,
"n_subproofs": 8,
"n_tactics": 67,
"cyclomatic": 9,
"n_automation": 33,
"n_rewrites": 18,
"n_structural": 18,
"automation_only": fals... | 12 | /-
EvmAsm.Codegen.Programs.Secp256k1PointCopy64SAsm
Verified SAsm port of `secp256k1_point_copy64`: copy a 64-byte secp256k1 affine point
buffer from `a0` to `a1` using the emitted alignment-free byte loop.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
import EvmAsm.Rv64.SAsm.Tactic
impo... | /-
EvmAsm.Codegen.Programs.Secp256k1PointCopy64SAsm
Verified SAsm port of `secp256k1_point_copy64`: copy a 64-byte secp256k1 affine point
buffer from `a0` to `a1` using the emitted alignment-free byte loop.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
import EvmAsm.Rv64.SAsm.Tactic
impo... | @@ -61,6 +61,15 @@
simp only [List.set_append_right, hpre, Nat.le_refl, Nat.sub_self, List.set_cons_zero,
List.singleton_append, List.append_assoc]
+private theorem execInstrRF_lbu_ro (ro : Region) (rwBase : Word) (rf : RegFile)
+ (ws : List (BitVec 8)) (rd rs1 : Reg) (ofs : BitVec 12)
+ (h : ¬ inRw rwB... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_187dcd520790_0 | b60d7383f1070309 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Env/Program.lean | Program | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_env_load_length",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [evm_env_load, ADDI, single, seq, Program.length_append,\n env_one_limb_length]",
"n_chars": 92,
"n_sub... | [
{
"name": "env_one_limb_length",
"text": "/-- One limb block is exactly 2 instructions (LD + SD). -/\ntheorem env_one_limb_length\n (envBaseReg tmpReg : Reg) (field : SimpleEnvField) (i : Nat) :\n (env_one_limb envBaseReg tmpReg field i).length = 2 := by\n simp [env_one_limb, LD, SD, single, seq, Pro... | [
{
"name": "evm_env_load_length",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 302,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nest... | 1 | /-
EvmAsm.Evm64.Env.Program
Parameterized program implementing the simple environment opcodes
(`ADDRESS`, `CALLER`, `CALLVALUE`, `ORIGIN`, `GASPRICE`, `COINBASE`,
`TIMESTAMP`, `NUMBER`, `PREVRANDAO`, `GASLIMIT`, `CHAINID`, `BASEFEE`,
`SELFBALANCE` — see `EvmAsm.Evm64.Env.Field.SimpleEnvField`).
Slice 4 of... | /-
EvmAsm.Evm64.Env.Program
Parameterized program implementing the simple environment opcodes
(`ADDRESS`, `CALLER`, `CALLVALUE`, `ORIGIN`, `GASPRICE`, `COINBASE`,
`TIMESTAMP`, `NUMBER`, `PREVRANDAO`, `GASLIMIT`, `CHAINID`, `BASEFEE`,
`SELFBALANCE` — see `EvmAsm.Evm64.Env.Field.SimpleEnvField`).
Slice 4 of... | @@ -63,10 +63,18 @@
(envBaseReg tmpReg : Reg) (field : SimpleEnvField) (base : Word) : CodeReq :=
CodeReq.ofProg base (evm_env_load envBaseReg tmpReg field)
+/-- One limb block is exactly 2 instructions (LD + SD). -/
+theorem env_one_limb_length
+ (envBaseReg tmpReg : Reg) (field : SimpleEnvField) (i : Nat... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_187dcd520790_1 | 38a89f3f18b01e00 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Env/Program.lean | Program | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_env_load_length",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [evm_env_load, ADDI, single, seq, Program.length_append,\n env_one_limb_length]",
"n_chars": 92,
"n_sub... | [
{
"name": "env_one_limb_length",
"text": "/-- One limb block is exactly 2 instructions (LD + SD). -/\ntheorem env_one_limb_length\n (envBaseReg tmpReg : Reg) (field : SimpleEnvField) (i : Nat) :\n (env_one_limb envBaseReg tmpReg field i).length = 2 := by\n simp [env_one_limb, LD, SD, single, seq, Pro... | [
{
"name": "evm_env_load_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 6,
"n_chars": 183,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"ma... | 2 | /-
EvmAsm.Evm64.Env.Program
Parameterized program implementing the simple environment opcodes
(`ADDRESS`, `CALLER`, `CALLVALUE`, `ORIGIN`, `GASPRICE`, `COINBASE`,
`TIMESTAMP`, `NUMBER`, `PREVRANDAO`, `GASLIMIT`, `CHAINID`, `BASEFEE`,
`SELFBALANCE` — see `EvmAsm.Evm64.Env.Field.SimpleEnvField`).
Slice 4 of... | /-
EvmAsm.Evm64.Env.Program
Parameterized program implementing the simple environment opcodes
(`ADDRESS`, `CALLER`, `CALLVALUE`, `ORIGIN`, `GASPRICE`, `COINBASE`,
`TIMESTAMP`, `NUMBER`, `PREVRANDAO`, `GASLIMIT`, `CHAINID`, `BASEFEE`,
`SELFBALANCE` — see `EvmAsm.Evm64.Env.Field.SimpleEnvField`).
Slice 4 of... | @@ -63,10 +63,18 @@
(envBaseReg tmpReg : Reg) (field : SimpleEnvField) (base : Word) : CodeReq :=
CodeReq.ofProg base (evm_env_load envBaseReg tmpReg field)
+/-- One limb block is exactly 2 instructions (LD + SD). -/
+theorem env_one_limb_length
+ (envBaseReg tmpReg : Reg) (field : SimpleEnvField) (i : Nat... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b089cfcbd99d_0 | 5a68d936ff83caca | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2V4NoNopTMM.lean | FullPathN2V4NoNopTMM | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "divK_loop_n2_call_max_max_from_source_exact_loopIterScratch_v4_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 146,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loopN2CallMaxMaxSourceConds_unfold] at hconds\n simp only [r2CC... | [
{
"name": "loopN2CallMaxMaxSourceConds_unfold",
"text": "theorem loopN2CallMaxMaxSourceConds_unfold\n (v0 v1 v2 v3 u0 u1 u2 u3 uTop u0Orig1 u0Orig0 : Word) :\n loopN2CallMaxMaxSourceConds\n v0 v1 v2 v3 u0 u1 u2 u3 uTop u0Orig1 u0Orig0 =\n (let r2 := r2CCCN2V4 v0 v1 v2 v3 u0 u1 u2 u3 uTop\n ... | [
{
"name": "divK_loop_n2_call_max_max_from_source_exact_loopIterScratch_v4_noNop",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 169,
"n_chars": 8591,
"n_subproofs": 6,
"n_tactics": 142,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_stru... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V4NoNopTMM
Three-iteration call-max-max composition for the n=2 v4/no-NOP source path.
j=2 takes the callable trial-division (call) path; j=1 and j=0 take the
max-trial branch.
Conditions: bltu_2=true (call), bltu_1=false (max), bltu_0=false (max).
-/
import EvmAsm.E... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V4NoNopTMM
Three-iteration call-max-max composition for the n=2 v4/no-NOP source path.
j=2 takes the callable trial-division (call) path; j=1 and j=0 take the
max-trial branch.
Conditions: bltu_2=true (call), bltu_1=false (max), bltu_0=false (max).
-/
import EvmAsm.E... | @@ -99,6 +99,23 @@
isAddbackCarry2NzN2Max v0 v1 v2 v3
u0Orig0 r1.2.1 r1.2.2.1 r1.2.2.2.1 r1.2.2.2.2.1
+theorem loopN2CallMaxMaxSourceConds_unfold
+ (v0 v1 v2 v3 u0 u1 u2 u3 uTop u0Orig1 u0Orig0 : Word) :
+ loopN2CallMaxMaxSourceConds
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop u0Orig1 u0Orig0 =
+ (let r2 := ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cb0766015832_0 | dddd3670eb6c0499 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV5/Q1d.lean | Q1d | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "algorithmQ1dV5_lt_pow32",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [algorithmQ1dV5_unfold]\n dsimp only\n set q1c := algorithmQ1cV5 uHi vTop with hq1c\n set rhatc := algorithm... | [
{
"name": "algorithmQ1dV5_unfold",
"text": "theorem algorithmQ1dV5_unfold (uHi uLo vTop : Word) :\n algorithmQ1dV5 uHi uLo vTop =\n (let q1c := algorithmQ1cV5 uHi vTop\n let rhatc := algorithmRhatcV5 uHi vTop\n let qDlo := q1c * divKTrialCallV5DLo vTop\n let rhatUn1 := (rhatc <<< (... | [
{
"name": "algorithmQ1dV5_lt_pow32",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 30,
"n_chars": 1427,
"n_subproofs": 6,
"n_tactics": 26,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 6,
"n_structural": 3,
"automation_only": false,
"... | 1 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV5.Q1d
The post-Phase-1b-1st-correction V5 quotient `algorithmQ1dV5` and
remainder `algorithmRhatdV5`, plus the `< 2^32` bound that follows
from the V5 cap.
v5 analog of v4's `algorithmQ1dV4` / `algorithmRhatdV4`
(Phase1bBound.lean:20-36) but with the V5 guar... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV5.Q1d
The post-Phase-1b-1st-correction V5 quotient `algorithmQ1dV5` and
remainder `algorithmRhatdV5`, plus the `< 2^32` bound that follows
from the V5 cap.
v5 analog of v4's `algorithmQ1dV4` / `algorithmRhatdV4`
(Phase1bBound.lean:20-36) but with the V5 guar... | @@ -40,11 +40,44 @@
let fire := decide (rhatc >>> (32 : BitVec 6).toNat = 0) && BitVec.ult rhatUn1 qDlo
if fire then rhatc + dHi else rhatc
+theorem algorithmQ1dV5_unfold (uHi uLo vTop : Word) :
+ algorithmQ1dV5 uHi uLo vTop =
+ (let q1c := algorithmQ1cV5 uHi vTop
+ let rhatc := algorithmRhatcV5 u... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_34fef1cb23f2_0 | 57d2c36e6b5be6a0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedRelaxedBlock3StepBase.lean | SavedBitFixedRelaxedBlock3StepBase | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "exp_msb_bit_test_fixed_skip_relaxed_x16_evmExpMsbSavedBitTwoMulFixedCanonicalAppendedMulCode_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 52,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro bit c6New squareW rw baseFr... | [
{
"name": "exp_msb_bit_test_fixed_skip_full_iter_merged_exit_branch_reload_bound_relaxed_x16_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"text": "/-- Relaxed (block-3) raw skip branch: the pointer-frame-free skip branch\n (`SavedBitBaseTwoMulFixedIterMerged.lean:113`) framed with `regOwn .x16... | [
{
"name": "exp_msb_bit_test_fixed_skip_relaxed_x16_evmExpMsbSavedBitTwoMulFixedCanonicalAppendedMulCode_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 145,
"n_chars": 8084,
"n_subproofs": 3,
"n_tactics": 52,
"cyclomatic": 1,
"n_automation": ... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedRelaxedBlock3StepBase
First half of `EvmAsm.Evm64.Exp.Compose.SavedBitFixedRelaxedBlock3Step`,
split out to keep each file under the file-size guardrail
(`scripts/check-file-size.sh`). The parent module imports this and
re-exports it transitively, so importers are una... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedRelaxedBlock3StepBase
First half of `EvmAsm.Evm64.Exp.Compose.SavedBitFixedRelaxedBlock3Step`,
split out to keep each file under the file-size guardrail
(`scripts/check-file-size.sh`). The parent module imports this and
re-exports it transitively, so importers are una... | @@ -31,6 +31,112 @@
open EvmAsm.Rv64
+/-- Relaxed (block-3) raw skip branch: the pointer-frame-free skip branch
+ (`SavedBitBaseTwoMulFixedIterMerged.lean:113`) framed with `regOwn .x16`
+ (register only, no pointer cell), mirroring the `_pointer_frame` variant
+ (`:211`) which frames the full pointer fra... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_34fef1cb23f2_1 | 388239380072b4b3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedRelaxedBlock3StepBase.lean | SavedBitFixedRelaxedBlock3StepBase | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "exp_msb_bit_test_fixed_skip_relaxed_x16_evmExpMsbSavedBitTwoMulFixedCanonicalAppendedMulCode_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 52,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro bit c6New squareW rw baseFr... | [
{
"name": "exp_msb_bit_test_fixed_skip_full_iter_merged_exit_branch_reload_bound_relaxed_x16_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"text": "/-- Relaxed (block-3) raw skip branch: the pointer-frame-free skip branch\n (`SavedBitBaseTwoMulFixedIterMerged.lean:113`) framed with `regOwn .x16... | [
{
"name": "exp_msb_bit_test_fixed_skip_relaxed_x16_bodyonly_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 140,
"n_chars": 7795,
"n_subproofs": 2,
"n_tactics": 49,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": ... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedRelaxedBlock3StepBase
First half of `EvmAsm.Evm64.Exp.Compose.SavedBitFixedRelaxedBlock3Step`,
split out to keep each file under the file-size guardrail
(`scripts/check-file-size.sh`). The parent module imports this and
re-exports it transitively, so importers are una... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedRelaxedBlock3StepBase
First half of `EvmAsm.Evm64.Exp.Compose.SavedBitFixedRelaxedBlock3Step`,
split out to keep each file under the file-size guardrail
(`scripts/check-file-size.sh`). The parent module imports this and
re-exports it transitively, so importers are una... | @@ -31,6 +31,112 @@
open EvmAsm.Rv64
+/-- Relaxed (block-3) raw skip branch: the pointer-frame-free skip branch
+ (`SavedBitBaseTwoMulFixedIterMerged.lean:113`) framed with `regOwn .x16`
+ (register only, no pointer cell), mirroring the `_pointer_frame` variant
+ (`:211`) which frames the full pointer fra... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_34fef1cb23f2_2 | e48416e9a9d1d541 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedRelaxedBlock3StepBase.lean | SavedBitFixedRelaxedBlock3StepBase | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "exp_msb_bit_test_fixed_skip_relaxed_x16_evmExpMsbSavedBitTwoMulFixedCanonicalAppendedMulCode_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 52,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro bit c6New squareW rw baseFr... | [
{
"name": "exp_msb_bit_test_fixed_skip_full_iter_merged_exit_branch_reload_bound_relaxed_x16_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"text": "/-- Relaxed (block-3) raw skip branch: the pointer-frame-free skip branch\n (`SavedBitBaseTwoMulFixedIterMerged.lean:113`) framed with `regOwn .x16... | [
{
"name": "exp_fixed_relaxed_block3_merged_with_continuations_framed_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 50,
"n_chars": 2025,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 0,
"n_struc... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedRelaxedBlock3StepBase
First half of `EvmAsm.Evm64.Exp.Compose.SavedBitFixedRelaxedBlock3Step`,
split out to keep each file under the file-size guardrail
(`scripts/check-file-size.sh`). The parent module imports this and
re-exports it transitively, so importers are una... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedRelaxedBlock3StepBase
First half of `EvmAsm.Evm64.Exp.Compose.SavedBitFixedRelaxedBlock3Step`,
split out to keep each file under the file-size guardrail
(`scripts/check-file-size.sh`). The parent module imports this and
re-exports it transitively, so importers are una... | @@ -31,6 +31,112 @@
open EvmAsm.Rv64
+/-- Relaxed (block-3) raw skip branch: the pointer-frame-free skip branch
+ (`SavedBitBaseTwoMulFixedIterMerged.lean:113`) framed with `regOwn .x16`
+ (register only, no pointer cell), mirroring the `_pointer_frame` variant
+ (`:211`) which frames the full pointer fra... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_34fef1cb23f2_3 | b1a948fbf7242303 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedRelaxedBlock3StepBase.lean | SavedBitFixedRelaxedBlock3StepBase | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "exp_fixed_relaxed_block3_merged_with_continuations_framed_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hLoop hExit\n have hbr :=\n cpsBranchWithin_as_cpsNBranchW... | [
{
"name": "exp_msb_bit_test_fixed_skip_relaxed_x16_evmExpMsbSavedBitTwoMulFixedCanonicalAppendedMulCode_spec_within",
"text": "/-- Canonical-appended-code relaxed (block-3) skip branch: lifts the raw\n relaxed skip branch to `base+44`→`base+296`/`base+44` over the canonical\n appended-mul code, mirror... | [
{
"name": "exp_fixed_loop_body_succ_step_relaxed_block3_framed",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 56,
"n_chars": 2336,
"n_subproofs": 3,
"n_tactics": 27,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 3,
"au... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedRelaxedBlock3StepBase
First half of `EvmAsm.Evm64.Exp.Compose.SavedBitFixedRelaxedBlock3Step`,
split out to keep each file under the file-size guardrail
(`scripts/check-file-size.sh`). The parent module imports this and
re-exports it transitively, so importers are una... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedRelaxedBlock3StepBase
First half of `EvmAsm.Evm64.Exp.Compose.SavedBitFixedRelaxedBlock3Step`,
split out to keep each file under the file-size guardrail
(`scripts/check-file-size.sh`). The parent module imports this and
re-exports it transitively, so importers are una... | @@ -137,6 +137,150 @@
squaringMulOff condMulOff skipOff backOff base hc6 hbase hsqmt hcondmt
hskip hback hd)
+/-- Canonical-appended-code relaxed (block-3) skip branch: lifts the raw
+ relaxed skip branch to `base+44`→`base+296`/`base+44` over the canonical
+ appended-mul code, mirroring
+ `exp... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_65e181623722_0 | a688f486f15bfea6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Bls12G2AddResultBridge.lean | Bls12G2AddResultBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "acceleratorOutput_point_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n g2PointBytesList_length output.point",
"n_chars": 39,
"n_subproofs": 0,
"n_tactics": 1,
"cyclom... | [
{
"name": "g2PointBytesList_length",
"text": "theorem g2PointBytesList_length (point : G2PointBytes) :\n (g2PointBytesList point).length = 192 := by\n unfold g2PointBytesList\n exact List.length_ofFn\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 157,
"n_subproofs": 0,
"n_tactics": 3,
... | [
{
"name": "acceleratorOutput_point_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 162,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.EL.Bls12G2AddResultBridge
Bridge from the `zkvm_bls12_g2_add` accelerator output to the executable
precompile-result surface.
-/
import EvmAsm.Evm64.Accelerators.Status
import EvmAsm.EL.WorldState
namespace EvmAsm.EL
namespace Bls12G2AddResultBridge
abbrev ZkvmStatus := EvmAsm.Accelerators.ZkvmStat... | /-
EvmAsm.EL.Bls12G2AddResultBridge
Bridge from the `zkvm_bls12_g2_add` accelerator output to the executable
precompile-result surface.
-/
import EvmAsm.Evm64.Accelerators.Status
import EvmAsm.EL.WorldState
namespace EvmAsm.EL
namespace Bls12G2AddResultBridge
abbrev ZkvmStatus := EvmAsm.Accelerators.ZkvmStat... | @@ -27,8 +27,14 @@
def g2PointBytesList (point : G2PointBytes) : List Byte :=
List.ofFn point
+theorem g2PointBytesList_length (point : G2PointBytes) :
+ (g2PointBytesList point).length = 192 := by
+ unfold g2PointBytesList
+ exact List.length_ofFn
+
theorem acceleratorOutput_point_length (output : Accelera... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a05c338ce80f_0 | 99176f8a944fc6a0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/MultiDword.lean | MultiDword | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "packDword_at0",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [List.drop_zero, take8_dword_append, packBytes_dwordBytes]",
"n_chars": 67,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "take8_dword_append",
"text": "/-- The head cell of a dword-concatenation window. -/\ntheorem take8_dword_append (v : Word) (rest : List (BitVec 8)) :\n (dwordBytes v ++ rest).take 8 = dwordBytes v := by\n rw [List.take_append_of_le_length (by rw [length_dwordBytes]),\n List.take_of_length_... | [
{
"name": "packDword_at0",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 480,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting"... | 1 | /-
EvmAsm.Rv64.SAsm.MultiDword
Reusable algebra for multi-dword focus windows (docs/sasm-howto.md,
"Multi-dword focus blocks"): a window that is a concatenation of dword
cells (`dwordBytes a ++ (dwordBytes b ++ …)`), read and written at
literal offsets 0, 8, 16, ….
- The slice lemmas reduce `((win.drop k)... | /-
EvmAsm.Rv64.SAsm.MultiDword
Reusable algebra for multi-dword focus windows (docs/sasm-howto.md,
"Multi-dword focus blocks"): a window that is a concatenation of dword
cells (`dwordBytes a ++ (dwordBytes b ++ …)`), read and written at
literal offsets 0, 8, 16, ….
- The slice lemmas reduce `((win.drop k)... | @@ -25,9 +25,16 @@
-- Slices of dword-concatenation windows (for loads)
-- ============================================================================
+/-- The head cell of a dword-concatenation window. -/
+theorem take8_dword_append (v : Word) (rest : List (BitVec 8)) :
+ (dwordBytes v ++ rest).take 8 = dwordB... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a05c338ce80f_1 | e312bbf617a9841f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/MultiDword.lean | MultiDword | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "setBytes_dword_at0",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [setBytes_append_left _ _ _ _ (by rw [length_dwordBytes, length_dwordBytes]),\n setBytes_dword_full _ _ (length_dw... | [
{
"name": "setBytes_dword_full",
"text": "/-- A full-dword store replaces the window (the generic multi-dword\n splice building block). -/\ntheorem setBytes_dword_full (ws : List (BitVec 8)) (v : Word)\n (h : ws.length = 8) : setBytes ws 0 (dwordBytes v) = dwordBytes v := by\n have h1 := setBytes_slo... | [
{
"name": "setBytes_dword_at0",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 17,
"n_chars": 1006,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_ne... | 2 | /-
EvmAsm.Rv64.SAsm.MultiDword
Reusable algebra for multi-dword focus windows (docs/sasm-howto.md,
"Multi-dword focus blocks"): a window that is a concatenation of dword
cells (`dwordBytes a ++ (dwordBytes b ++ …)`), read and written at
literal offsets 0, 8, 16, ….
- The slice lemmas reduce `((win.drop k)... | /-
EvmAsm.Rv64.SAsm.MultiDword
Reusable algebra for multi-dword focus windows (docs/sasm-howto.md,
"Multi-dword focus blocks"): a window that is a concatenation of dword
cells (`dwordBytes a ++ (dwordBytes b ++ …)`), read and written at
literal offsets 0, 8, 16, ….
- The slice lemmas reduce `((win.drop k)... | @@ -25,6 +25,14 @@
-- Slices of dword-concatenation windows (for loads)
-- ============================================================================
+/-- A full-dword store replaces the window (the generic multi-dword
+ splice building block). -/
+theorem setBytes_dword_full (ws : List (BitVec 8)) (v : 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_a05c338ce80f_2 | 4865eb365dbb8149 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/MultiDword.lean | MultiDword | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "setBytes_dword_past",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [setBytes_append_right _ _ _ _ (by rw [length_dwordBytes]; omega),\n length_dwordBytes, show 8 + k - 8 = k from b... | [
{
"name": "setBytes_append_right",
"text": "/-- A splice entirely inside the right part of `a ++ b` stays right. -/\ntheorem setBytes_append_right (a b ns : List (BitVec 8)) (i : Nat)\n (h : a.length ≤ i) :\n setBytes (a ++ b) i ns = a ++ setBytes b (i - a.length) ns := by\n induction ns generalizing... | [
{
"name": "setBytes_dword_past",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 378,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
"max_nes... | 1 | /-
EvmAsm.Rv64.SAsm.MultiDword
Reusable algebra for multi-dword focus windows (docs/sasm-howto.md,
"Multi-dword focus blocks"): a window that is a concatenation of dword
cells (`dwordBytes a ++ (dwordBytes b ++ …)`), read and written at
literal offsets 0, 8, 16, ….
- The slice lemmas reduce `((win.drop k)... | /-
EvmAsm.Rv64.SAsm.MultiDword
Reusable algebra for multi-dword focus windows (docs/sasm-howto.md,
"Multi-dword focus blocks"): a window that is a concatenation of dword
cells (`dwordBytes a ++ (dwordBytes b ++ …)`), read and written at
literal offsets 0, 8, 16, ….
- The slice lemmas reduce `((win.drop k)... | @@ -25,10 +25,24 @@
-- Slices of dword-concatenation windows (for loads)
-- ============================================================================
+/-- A splice entirely inside the right part of `a ++ b` stays right. -/
+theorem setBytes_append_right (a b ns : List (BitVec 8)) (i : Nat)
+ (h : a.length ≤ i... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_966b9773e4f3_0 | 598d0a1ddcd29732 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/SharedLoopPost.lean | SharedLoopPost | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "pcFree_denormDoneSharedPre",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [denormDoneSharedPre_unfold]; pcFree",
"n_chars": 45,
"n_subproofs": 0,
"n_tactics": 3,
"cycl... | [
{
"name": "denormDoneSharedPre_unfold",
"text": "/-- Unfold lemma exposing the raw atoms of `denormDoneSharedPre`. Use this\nto bridge between the named assertion and an inline atom chain inside an\n`xperm_hyp` / `xperm` step. -/\ntheorem denormDoneSharedPre_unfold\n {sp shift u0 u1 u2 u3 q0 q1 q2 q3 m0 ... | [
{
"name": "pcFree_denormDoneSharedPre",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 312,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.SharedLoopPost
Issue #266 slice 2 — naming the shared intermediate assertion at the
DIV/MOD divergence point.
The DIV (`divCode`) and MOD (`modCode`) programs are byte-identical for the
first ten blocks (PhaseA … denorm) and only differ in block 10, the
epilogue:
* `div... | /-
EvmAsm.Evm64.DivMod.Compose.SharedLoopPost
Issue #266 slice 2 — naming the shared intermediate assertion at the
DIV/MOD divergence point.
The DIV (`divCode`) and MOD (`modCode`) programs are byte-identical for the
first ten blocks (PhaseA … denorm) and only differ in block 10, the
epilogue:
* `div... | @@ -76,10 +76,33 @@
((sp + 32) ↦ₘ m0) ** ((sp + 40) ↦ₘ m8) **
((sp + 48) ↦ₘ m16) ** ((sp + 56) ↦ₘ m24)
+/-- Unfold lemma exposing the raw atoms of `denormDoneSharedPre`. Use this
+to bridge between the named assertion and an inline atom chain inside an
+`xperm_hyp` / `xperm` step. -/
+theorem denormDoneSharedPr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_0 | 080c336602565004 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 3 | [
{
"theorem_name": "n4CallAddbackBeqShift_eq_raw",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [n4CallAddbackBeqShift_unfold]\n exact Nat.mod_eq_of_lt n4CallAddbackBeqShift_raw_lt_64",
"n_chars": 9... | [
{
"name": "n4CallAddbackBeqShift_unfold",
"text": "theorem n4CallAddbackBeqShift_unfold {b : EvmWord} :\n n4CallAddbackBeqShift b = (clzResult (b.getLimbN 3)).1.toNat % 64 :=\n rfl\n\n",
"fan_in": 3,
"n_lines": 5,
"n_chars": 133,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,... | [
{
"name": "n4CallAddbackBeqShift_eq_raw",
"fan_in": 12,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 6,
"n_chars": 218,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -78,13 +78,19 @@
def n4CallAddbackBeqShift (b : EvmWord) : Nat :=
(clzResult (b.getLimbN 3)).1.toNat % 64
+theorem n4CallAddbackBeqShift_unfold {b : EvmWord} :
+ n4CallAddbackBeqShift b = (clzResult (b.getLimbN 3)).1.toNat % 64 :=
+ rfl
+
theorem n4CallAddbackBeqShift_raw_lt_64 {b : EvmWord} :
(clzRe... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_1 | 27a8cff0a482a020 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 12 | [
{
"theorem_name": "n4CallAddbackBeqShift_pos_of_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [n4CallAddbackBeqShift_eq_raw]\n rcases Nat.eq_zero_or_pos (clzResult (b.getLimbN 3)).1.toNat with... | [
{
"name": "n4CallAddbackBeqShift_eq_raw",
"text": "theorem n4CallAddbackBeqShift_eq_raw {b : EvmWord} :\n n4CallAddbackBeqShift b = (clzResult (b.getLimbN 3)).1.toNat := by\n rw [n4CallAddbackBeqShift_unfold]\n exact Nat.mod_eq_of_lt n4CallAddbackBeqShift_raw_lt_64\n\n",
"fan_in": 12,
"n_lines"... | [
{
"name": "n4CallAddbackBeqShift_pos_of_ne_zero",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 11,
"n_chars": 373,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": f... | 3 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -87,9 +87,20 @@
have h_le := clzResult_fst_toNat_le (b.getLimbN 3)
omega
+theorem n4CallAddbackBeqShift_eq_raw {b : EvmWord} :
+ n4CallAddbackBeqShift b = (clzResult (b.getLimbN 3)).1.toNat := by
+ rw [n4CallAddbackBeqShift_unfold]
+ exact Nat.mod_eq_of_lt n4CallAddbackBeqShift_raw_lt_64
+
theorem n4Ca... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_2 | d7b698f2a360fd12 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 12 | [
{
"theorem_name": "n4CallAddbackBeqShift_pos_of_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [n4CallAddbackBeqShift_eq_raw]\n rcases Nat.eq_zero_or_pos (clzResult (b.getLimbN 3)).1.toNat with... | [
{
"name": "n4CallAddbackBeqShift_eq_raw",
"text": "theorem n4CallAddbackBeqShift_eq_raw {b : EvmWord} :\n n4CallAddbackBeqShift b = (clzResult (b.getLimbN 3)).1.toNat := by\n rw [n4CallAddbackBeqShift_unfold]\n exact Nat.mod_eq_of_lt n4CallAddbackBeqShift_raw_lt_64\n\n",
"fan_in": 12,
"n_lines"... | [
{
"name": "n4CallAddbackBeqAntiShift_eq_sub_shift",
"fan_in": 7,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 12,
"n_chars": 510,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 2,
"automation_only":... | 5 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -87,9 +87,20 @@
have h_le := clzResult_fst_toNat_le (b.getLimbN 3)
omega
+theorem n4CallAddbackBeqShift_eq_raw {b : EvmWord} :
+ n4CallAddbackBeqShift b = (clzResult (b.getLimbN 3)).1.toNat := by
+ rw [n4CallAddbackBeqShift_unfold]
+ exact Nat.mod_eq_of_lt n4CallAddbackBeqShift_raw_lt_64
+
theorem n4Ca... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_3 | 5639bd1bc6e25274 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 2 | [
{
"theorem_name": "n4CallAddbackBeqAntiShift_eq_sub_shift",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_pos_raw : 1 ≤ (clzResult (b.getLimbN 3)).1.toNat := by\n rw [← n4CallAddbackBeqShift_eq_ra... | [
{
"name": "n4CallAddbackBeqShift_pos_of_ne_zero",
"text": "theorem n4CallAddbackBeqShift_pos_of_ne_zero {b : EvmWord}\n (hshift_nz : (clzResult (b.getLimbN 3)).1 ≠ 0) :\n 0 < n4CallAddbackBeqShift b := by\n rw [n4CallAddbackBeqShift_eq_raw]\n rcases Nat.eq_zero_or_pos (clzResult (b.getLimbN 3)).1.to... | [
{
"name": "n4CallAddbackBeqB3Prime_eq_direct",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 7,
"n_lines": 10,
"n_chars": 447,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": fals... | 7 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -92,6 +92,16 @@
rw [n4CallAddbackBeqShift_unfold]
exact Nat.mod_eq_of_lt n4CallAddbackBeqShift_raw_lt_64
+theorem n4CallAddbackBeqShift_pos_of_ne_zero {b : EvmWord}
+ (hshift_nz : (clzResult (b.getLimbN 3)).1 ≠ 0) :
+ 0 < n4CallAddbackBeqShift b := by
+ rw [n4CallAddbackBeqShift_eq_raw]
+ rcases Nat.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_4 | 053b92ad56ee6ec0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 3 | [
{
"theorem_name": "n4CallAddbackBeqAntiShift_eq_sub_shift",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_pos_raw : 1 ≤ (clzResult (b.getLimbN 3)).1.toNat := by\n rw [← n4CallAddbackBeqShift_eq_ra... | [
{
"name": "n4CallAddbackBeqAntiShift_unfold",
"text": "theorem n4CallAddbackBeqAntiShift_unfold {b : EvmWord} :\n n4CallAddbackBeqAntiShift b =\n (signExtend12 (0 : BitVec 12) - (clzResult (b.getLimbN 3)).1).toNat % 64 :=\n rfl\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 180,
"n_sub... | [
{
"name": "n4CallAddbackBeqB3Prime_ge_pow63",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 17,
"n_chars": 696,
"n_subproofs": 2,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": fals... | 3 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -86,6 +86,11 @@
def n4CallAddbackBeqAntiShift (b : EvmWord) : Nat :=
(signExtend12 (0 : BitVec 12) - (clzResult (b.getLimbN 3)).1).toNat % 64
+theorem n4CallAddbackBeqAntiShift_unfold {b : EvmWord} :
+ n4CallAddbackBeqAntiShift b =
+ (signExtend12 (0 : BitVec 12) - (clzResult (b.getLimbN 3)).1).toNat %... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_5 | 230f2c1aede04025 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 3 | [
{
"theorem_name": "n4CallAddbackBeqAntiShift_eq_sub_shift",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_pos_raw : 1 ≤ (clzResult (b.getLimbN 3)).1.toNat := by\n rw [← n4CallAddbackBeqShift_eq_ra... | [
{
"name": "n4CallAddbackBeqAntiShift_unfold",
"text": "theorem n4CallAddbackBeqAntiShift_unfold {b : EvmWord} :\n n4CallAddbackBeqAntiShift b =\n (signExtend12 (0 : BitVec 12) - (clzResult (b.getLimbN 3)).1).toNat % 64 :=\n rfl\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 180,
"n_sub... | [
{
"name": "n4CallAddbackBeqDHi_ge_pow31",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 9,
"n_chars": 300,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 4 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -86,6 +86,11 @@
def n4CallAddbackBeqAntiShift (b : EvmWord) : Nat :=
(signExtend12 (0 : BitVec 12) - (clzResult (b.getLimbN 3)).1).toNat % 64
+theorem n4CallAddbackBeqAntiShift_unfold {b : EvmWord} :
+ n4CallAddbackBeqAntiShift b =
+ (signExtend12 (0 : BitVec 12) - (clzResult (b.getLimbN 3)).1).toNat %... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_6 | 9f88de188f1b76b7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 2 | [
{
"theorem_name": "n4CallAddbackBeqAntiShift_eq_sub_shift",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_pos_raw : 1 ≤ (clzResult (b.getLimbN 3)).1.toNat := by\n rw [← n4CallAddbackBeqShift_eq_ra... | [
{
"name": "n4CallAddbackBeqShift_pos_of_ne_zero",
"text": "theorem n4CallAddbackBeqShift_pos_of_ne_zero {b : EvmWord}\n (hshift_nz : (clzResult (b.getLimbN 3)).1 ≠ 0) :\n 0 < n4CallAddbackBeqShift b := by\n rw [n4CallAddbackBeqShift_eq_raw]\n rcases Nat.eq_zero_or_pos (clzResult (b.getLimbN 3)).1.to... | [
{
"name": "n4CallAddbackBeqB2Prime_eq_direct",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 7,
"n_lines": 10,
"n_chars": 447,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": fals... | 7 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -92,6 +92,16 @@
rw [n4CallAddbackBeqShift_unfold]
exact Nat.mod_eq_of_lt n4CallAddbackBeqShift_raw_lt_64
+theorem n4CallAddbackBeqShift_pos_of_ne_zero {b : EvmWord}
+ (hshift_nz : (clzResult (b.getLimbN 3)).1 ≠ 0) :
+ 0 < n4CallAddbackBeqShift b := by
+ rw [n4CallAddbackBeqShift_eq_raw]
+ rcases Nat.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_7 | 08c5f8ad03b3af26 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 2 | [
{
"theorem_name": "n4CallAddbackBeqAntiShift_eq_sub_shift",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_pos_raw : 1 ≤ (clzResult (b.getLimbN 3)).1.toNat := by\n rw [← n4CallAddbackBeqShift_eq_ra... | [
{
"name": "n4CallAddbackBeqShift_pos_of_ne_zero",
"text": "theorem n4CallAddbackBeqShift_pos_of_ne_zero {b : EvmWord}\n (hshift_nz : (clzResult (b.getLimbN 3)).1 ≠ 0) :\n 0 < n4CallAddbackBeqShift b := by\n rw [n4CallAddbackBeqShift_eq_raw]\n rcases Nat.eq_zero_or_pos (clzResult (b.getLimbN 3)).1.to... | [
{
"name": "n4CallAddbackBeqB1Prime_eq_direct",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 7,
"n_lines": 10,
"n_chars": 447,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": fals... | 7 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -92,6 +92,16 @@
rw [n4CallAddbackBeqShift_unfold]
exact Nat.mod_eq_of_lt n4CallAddbackBeqShift_raw_lt_64
+theorem n4CallAddbackBeqShift_pos_of_ne_zero {b : EvmWord}
+ (hshift_nz : (clzResult (b.getLimbN 3)).1 ≠ 0) :
+ 0 < n4CallAddbackBeqShift b := by
+ rw [n4CallAddbackBeqShift_eq_raw]
+ rcases Nat.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_8 | 3fd5c20f2fbee280 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 12 | [
{
"theorem_name": "n4CallAddbackBeqShift_pos_of_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [n4CallAddbackBeqShift_eq_raw]\n rcases Nat.eq_zero_or_pos (clzResult (b.getLimbN 3)).1.toNat with... | [
{
"name": "n4CallAddbackBeqShift_eq_raw",
"text": "theorem n4CallAddbackBeqShift_eq_raw {b : EvmWord} :\n n4CallAddbackBeqShift b = (clzResult (b.getLimbN 3)).1.toNat := by\n rw [n4CallAddbackBeqShift_unfold]\n exact Nat.mod_eq_of_lt n4CallAddbackBeqShift_raw_lt_64\n\n",
"fan_in": 12,
"n_lines"... | [
{
"name": "n4CallAddbackBeqB0Prime_eq_direct",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 285,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false... | 4 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -87,6 +87,11 @@
have h_le := clzResult_fst_toNat_le (b.getLimbN 3)
omega
+theorem n4CallAddbackBeqShift_eq_raw {b : EvmWord} :
+ n4CallAddbackBeqShift b = (clzResult (b.getLimbN 3)).1.toNat := by
+ rw [n4CallAddbackBeqShift_unfold]
+ exact Nat.mod_eq_of_lt n4CallAddbackBeqShift_raw_lt_64
+
/-- Anti-shi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_9 | 3525b7c57ad5a2ad | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 2 | [
{
"theorem_name": "n4CallAddbackBeqAntiShift_eq_sub_shift",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_pos_raw : 1 ≤ (clzResult (b.getLimbN 3)).1.toNat := by\n rw [← n4CallAddbackBeqShift_eq_ra... | [
{
"name": "n4CallAddbackBeqShift_pos_of_ne_zero",
"text": "theorem n4CallAddbackBeqShift_pos_of_ne_zero {b : EvmWord}\n (hshift_nz : (clzResult (b.getLimbN 3)).1 ≠ 0) :\n 0 < n4CallAddbackBeqShift b := by\n rw [n4CallAddbackBeqShift_eq_raw]\n rcases Nat.eq_zero_or_pos (clzResult (b.getLimbN 3)).1.to... | [
{
"name": "n4CallAddbackBeqU4_eq_direct",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 7,
"n_lines": 9,
"n_chars": 336,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
... | 7 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -92,6 +92,16 @@
rw [n4CallAddbackBeqShift_unfold]
exact Nat.mod_eq_of_lt n4CallAddbackBeqShift_raw_lt_64
+theorem n4CallAddbackBeqShift_pos_of_ne_zero {b : EvmWord}
+ (hshift_nz : (clzResult (b.getLimbN 3)).1 ≠ 0) :
+ 0 < n4CallAddbackBeqShift b := by
+ rw [n4CallAddbackBeqShift_eq_raw]
+ rcases Nat.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_10 | f63f841f5382d091 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 3 | [
{
"theorem_name": "n4CallAddbackBeqB3Prime_eq_direct",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [n4CallAddbackBeqB3Prime_unfold]\n rw [n4CallAddbackBeqShift_eq_raw, n4CallAddbackBeqAntiShift_eq_sub... | [
{
"name": "n4CallAddbackBeqB3Prime_unfold",
"text": "theorem n4CallAddbackBeqB3Prime_unfold {b : EvmWord} :\n n4CallAddbackBeqB3Prime b =\n ((b.getLimbN 3) <<< n4CallAddbackBeqShift b) |||\n ((b.getLimbN 2) >>> n4CallAddbackBeqAntiShift b) :=\n rfl\n\n",
"fan_in": 3,
"n_lines": 7,
... | [
{
"name": "n4CallAddbackBeqU4_lt_vTop_of_call",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 15,
"n_chars": 716,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": fal... | 4 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -96,6 +96,12 @@
((b.getLimbN 3) <<< n4CallAddbackBeqShift b) |||
((b.getLimbN 2) >>> n4CallAddbackBeqAntiShift b)
+theorem n4CallAddbackBeqB3Prime_unfold {b : EvmWord} :
+ n4CallAddbackBeqB3Prime b =
+ ((b.getLimbN 3) <<< n4CallAddbackBeqShift b) |||
+ ((b.getLimbN 2) >>> n4CallAddbackBeqAnt... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_11 | 61e41fb0ac1d1643 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 2 | [
{
"theorem_name": "n4CallAddbackBeqAntiShift_eq_sub_shift",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_pos_raw : 1 ≤ (clzResult (b.getLimbN 3)).1.toNat := by\n rw [← n4CallAddbackBeqShift_eq_ra... | [
{
"name": "n4CallAddbackBeqShift_pos_of_ne_zero",
"text": "theorem n4CallAddbackBeqShift_pos_of_ne_zero {b : EvmWord}\n (hshift_nz : (clzResult (b.getLimbN 3)).1 ≠ 0) :\n 0 < n4CallAddbackBeqShift b := by\n rw [n4CallAddbackBeqShift_eq_raw]\n rcases Nat.eq_zero_or_pos (clzResult (b.getLimbN 3)).1.to... | [
{
"name": "n4CallAddbackBeqU3_eq_direct",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 7,
"n_lines": 10,
"n_chars": 436,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
... | 7 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -92,6 +92,16 @@
rw [n4CallAddbackBeqShift_unfold]
exact Nat.mod_eq_of_lt n4CallAddbackBeqShift_raw_lt_64
+theorem n4CallAddbackBeqShift_pos_of_ne_zero {b : EvmWord}
+ (hshift_nz : (clzResult (b.getLimbN 3)).1 ≠ 0) :
+ 0 < n4CallAddbackBeqShift b := by
+ rw [n4CallAddbackBeqShift_eq_raw]
+ rcases Nat.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_12 | 12df371654e64484 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 2 | [
{
"theorem_name": "n4CallAddbackBeqAntiShift_eq_sub_shift",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_pos_raw : 1 ≤ (clzResult (b.getLimbN 3)).1.toNat := by\n rw [← n4CallAddbackBeqShift_eq_ra... | [
{
"name": "n4CallAddbackBeqShift_pos_of_ne_zero",
"text": "theorem n4CallAddbackBeqShift_pos_of_ne_zero {b : EvmWord}\n (hshift_nz : (clzResult (b.getLimbN 3)).1 ≠ 0) :\n 0 < n4CallAddbackBeqShift b := by\n rw [n4CallAddbackBeqShift_eq_raw]\n rcases Nat.eq_zero_or_pos (clzResult (b.getLimbN 3)).1.to... | [
{
"name": "n4CallAddbackBeqU2_eq_direct",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 7,
"n_lines": 10,
"n_chars": 436,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
... | 7 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -92,6 +92,16 @@
rw [n4CallAddbackBeqShift_unfold]
exact Nat.mod_eq_of_lt n4CallAddbackBeqShift_raw_lt_64
+theorem n4CallAddbackBeqShift_pos_of_ne_zero {b : EvmWord}
+ (hshift_nz : (clzResult (b.getLimbN 3)).1 ≠ 0) :
+ 0 < n4CallAddbackBeqShift b := by
+ rw [n4CallAddbackBeqShift_eq_raw]
+ rcases Nat.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_13 | 783322b6cff00e98 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 2 | [
{
"theorem_name": "n4CallAddbackBeqAntiShift_eq_sub_shift",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_pos_raw : 1 ≤ (clzResult (b.getLimbN 3)).1.toNat := by\n rw [← n4CallAddbackBeqShift_eq_ra... | [
{
"name": "n4CallAddbackBeqShift_pos_of_ne_zero",
"text": "theorem n4CallAddbackBeqShift_pos_of_ne_zero {b : EvmWord}\n (hshift_nz : (clzResult (b.getLimbN 3)).1 ≠ 0) :\n 0 < n4CallAddbackBeqShift b := by\n rw [n4CallAddbackBeqShift_eq_raw]\n rcases Nat.eq_zero_or_pos (clzResult (b.getLimbN 3)).1.to... | [
{
"name": "n4CallAddbackBeqU1_eq_direct",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 7,
"n_lines": 10,
"n_chars": 436,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
... | 7 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -92,6 +92,16 @@
rw [n4CallAddbackBeqShift_unfold]
exact Nat.mod_eq_of_lt n4CallAddbackBeqShift_raw_lt_64
+theorem n4CallAddbackBeqShift_pos_of_ne_zero {b : EvmWord}
+ (hshift_nz : (clzResult (b.getLimbN 3)).1 ≠ 0) :
+ 0 < n4CallAddbackBeqShift b := by
+ rw [n4CallAddbackBeqShift_eq_raw]
+ rcases Nat.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_14 | f832dd0c8c40a3df | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 12 | [
{
"theorem_name": "n4CallAddbackBeqShift_pos_of_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [n4CallAddbackBeqShift_eq_raw]\n rcases Nat.eq_zero_or_pos (clzResult (b.getLimbN 3)).1.toNat with... | [
{
"name": "n4CallAddbackBeqShift_eq_raw",
"text": "theorem n4CallAddbackBeqShift_eq_raw {b : EvmWord} :\n n4CallAddbackBeqShift b = (clzResult (b.getLimbN 3)).1.toNat := by\n rw [n4CallAddbackBeqShift_unfold]\n exact Nat.mod_eq_of_lt n4CallAddbackBeqShift_raw_lt_64\n\n",
"fan_in": 12,
"n_lines"... | [
{
"name": "n4CallAddbackBeqU0_eq_direct",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 274,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 4 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -87,6 +87,11 @@
have h_le := clzResult_fst_toNat_le (b.getLimbN 3)
omega
+theorem n4CallAddbackBeqShift_eq_raw {b : EvmWord} :
+ n4CallAddbackBeqShift b = (clzResult (b.getLimbN 3)).1.toNat := by
+ rw [n4CallAddbackBeqShift_unfold]
+ exact Nat.mod_eq_of_lt n4CallAddbackBeqShift_raw_lt_64
+
/-- Anti-shi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_15 | 953f1df9f0540ebf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 7 | [
{
"theorem_name": "n4CallAddbackBeqB3Prime_eq_direct",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [n4CallAddbackBeqB3Prime_unfold]\n rw [n4CallAddbackBeqShift_eq_raw, n4CallAddbackBeqAntiShift_eq_sub... | [
{
"name": "n4CallAddbackBeqAntiShift_eq_sub_shift",
"text": "theorem n4CallAddbackBeqAntiShift_eq_sub_shift {b : EvmWord}\n (hshift_nz : (clzResult (b.getLimbN 3)).1 ≠ 0) :\n n4CallAddbackBeqAntiShift b = 64 - n4CallAddbackBeqShift b := by\n have h_pos_raw : 1 ≤ (clzResult (b.getLimbN 3)).1.toNat := ... | [
{
"name": "n4CallAddbackBeqQHatV4_eq_direct",
"fan_in": 2,
"n_deps_direct": 4,
"n_deps_transitive": 13,
"n_lines": 15,
"n_chars": 716,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 4,
"n_structural": 0,
"automation_only": fals... | 13 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -111,6 +111,17 @@
(signExtend12 (0 : BitVec 12) - (clzResult (b.getLimbN 3)).1).toNat % 64 :=
rfl
+theorem n4CallAddbackBeqAntiShift_eq_sub_shift {b : EvmWord}
+ (hshift_nz : (clzResult (b.getLimbN 3)).1 ≠ 0) :
+ n4CallAddbackBeqAntiShift b = 64 - n4CallAddbackBeqShift b := by
+ have h_pos_raw : 1... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_16 | c490291769c482ed | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 3 | [
{
"theorem_name": "n4CallAddbackBeqQHatV4_eq_direct",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [n4CallAddbackBeqQHatV4_eq_normalized]\n rw [n4CallAddbackBeqU4_eq_direct hshift_nz]\n rw [n4CallAddb... | [
{
"name": "n4CallAddbackBeqQHatV4_eq_normalized",
"text": "theorem n4CallAddbackBeqQHatV4_eq_normalized {a b : EvmWord} :\n n4CallAddbackBeqQHatV4 a b =\n div128Quot_v4\n (n4CallAddbackBeqU4 a b)\n (n4CallAddbackBeqU3 a b)\n (n4CallAddbackBeqB3Prime b) :=\n rfl\n\n",
"fan_i... | [
{
"name": "n4CallAddbackBeqQHatV4_eq_trialCallQHat",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 322,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only"... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -133,12 +133,22 @@
let u3 := ((a.getLimbN 3) <<< shift) ||| ((a.getLimbN 2) >>> antiShift)
div128Quot_v4 u4 u3 b3'
+theorem n4CallAddbackBeqQHatV4_eq_normalized {a b : EvmWord} :
+ n4CallAddbackBeqQHatV4 a b =
+ div128Quot_v4
+ (n4CallAddbackBeqU4 a b)
+ (n4CallAddbackBeqU3 a 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_3a6fd34cb06e_17 | c1186e8fd4d38647 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 3 | [
{
"theorem_name": "n4CallAddbackBeqQHatV4_eq_direct",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [n4CallAddbackBeqQHatV4_eq_normalized]\n rw [n4CallAddbackBeqU4_eq_direct hshift_nz]\n rw [n4CallAddb... | [
{
"name": "n4CallAddbackBeqQHatV4_eq_normalized",
"text": "theorem n4CallAddbackBeqQHatV4_eq_normalized {a b : EvmWord} :\n n4CallAddbackBeqQHatV4 a b =\n div128Quot_v4\n (n4CallAddbackBeqU4 a b)\n (n4CallAddbackBeqU3 a b)\n (n4CallAddbackBeqB3Prime b) :=\n rfl\n\n",
"fan_i... | [
{
"name": "n4CallAddbackBeqQHatV4_toNat_eq_trialCall_halves_of_un21_lt",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 33,
"n_chars": 1403,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -133,6 +133,14 @@
let u3 := ((a.getLimbN 3) <<< shift) ||| ((a.getLimbN 2) >>> antiShift)
div128Quot_v4 u4 u3 b3'
+theorem n4CallAddbackBeqQHatV4_eq_normalized {a b : EvmWord} :
+ n4CallAddbackBeqQHatV4 a b =
+ div128Quot_v4
+ (n4CallAddbackBeqU4 a b)
+ (n4CallAddbackBeqU3 a 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_3a6fd34cb06e_18 | c9157eb46490f4c3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 1 | [
{
"theorem_name": "n4CallAddbackBeqDHi_ge_pow31",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [divKTrialCallV4DHi_eq]\n exact div128Quot_shift0_dHi_ge\n (n4CallAddbackBeqB3Prime b)\n (n4CallAddb... | [
{
"name": "n4CallAddbackBeqB3Prime_ge_pow63",
"text": "theorem n4CallAddbackBeqB3Prime_ge_pow63 {b : EvmWord}\n (hb3nz : b.getLimbN 3 ≠ 0) :\n (n4CallAddbackBeqB3Prime b).toNat ≥ 2^63 := by\n rw [n4CallAddbackBeqB3Prime_unfold]\n rw [n4CallAddbackBeqShift_unfold, n4CallAddbackBeqAntiShift_unfold]\n ... | [
{
"name": "n4CallAddbackBeqQHatV4_toNat_eq_trialCall_halves_of_runtime_bounds",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 9,
"n_lines": 30,
"n_chars": 1165,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structura... | 9 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -102,9 +102,29 @@
((b.getLimbN 2) >>> n4CallAddbackBeqAntiShift b) :=
rfl
+theorem n4CallAddbackBeqB3Prime_ge_pow63 {b : EvmWord}
+ (hb3nz : b.getLimbN 3 ≠ 0) :
+ (n4CallAddbackBeqB3Prime b).toNat ≥ 2^63 := by
+ rw [n4CallAddbackBeqB3Prime_unfold]
+ rw [n4CallAddbackBeqShift_unfold, n4CallAddba... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_19 | bc3ccedeb08199dc | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 1 | [
{
"theorem_name": "n4CallAddbackBeqQHatV4_toNat_eq_trialCall_halves_of_runtime_bounds",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact n4CallAddbackBeqQHatV4_toNat_eq_trialCall_halves_of_un21_lt\n (... | [
{
"name": "n4CallAddbackBeqDLo_lt_pow32",
"text": "theorem n4CallAddbackBeqDLo_lt_pow32 {b : EvmWord} :\n (divKTrialCallV4DLo (n4CallAddbackBeqB3Prime b)).toNat < 2^32 := by\n rw [divKTrialCallV4DLo_eq]\n exact lo32_toNat_lt_pow32 (n4CallAddbackBeqB3Prime b)\n\n",
"fan_in": 1,
"n_lines": 6,
... | [
{
"name": "n4CallAddbackBeqQHatV4_toNat_eq_trialCall_halves_of_call",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 12,
"n_lines": 26,
"n_chars": 977,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
... | 12 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -131,6 +131,11 @@
rw [divKTrialCallV4DHi_eq]
exact hi32_toNat_lt_pow32 (n4CallAddbackBeqB3Prime b)
+theorem n4CallAddbackBeqDLo_lt_pow32 {b : EvmWord} :
+ (divKTrialCallV4DLo (n4CallAddbackBeqB3Prime b)).toNat < 2^32 := by
+ rw [divKTrialCallV4DLo_eq]
+ exact lo32_toNat_lt_pow32 (n4CallAddbackBeqB3Prime... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_20 | 00550bbcf2b19860 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 2 | [
{
"theorem_name": "n4CallAddbackBeqU4_eq_direct",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [n4CallAddbackBeqU4_unfold]\n rw [n4CallAddbackBeqAntiShift_eq_sub_shift hshift_nz]\n rw [n4CallAddbackBe... | [
{
"name": "n4CallAddbackBeqU4_unfold",
"text": "theorem n4CallAddbackBeqU4_unfold {a b : EvmWord} :\n n4CallAddbackBeqU4 a b =\n (a.getLimbN 3) >>> n4CallAddbackBeqAntiShift b :=\n rfl\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 144,
"n_subproofs": 0,
"n_tactics": 1,
"cyclom... | [
{
"name": "n4CallAddbackBeqQHatV4_toNat_eq_trialCall_halves_of_call_un21_lt_b3prime",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 14,
"n_lines": 25,
"n_chars": 902,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_str... | 14 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -154,11 +154,24 @@
def n4CallAddbackBeqU4 (a b : EvmWord) : Word :=
(a.getLimbN 3) >>> n4CallAddbackBeqAntiShift b
+theorem n4CallAddbackBeqU4_unfold {a b : EvmWord} :
+ n4CallAddbackBeqU4 a b =
+ (a.getLimbN 3) >>> n4CallAddbackBeqAntiShift b :=
+ rfl
+
theorem n4CallAddbackBeqU4_lt_vTop_of_call {a ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_21 | 5a46c5a7f1a53c06 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 12 | [
{
"theorem_name": "n4CallAddbackBeqShift_pos_of_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [n4CallAddbackBeqShift_eq_raw]\n rcases Nat.eq_zero_or_pos (clzResult (b.getLimbN 3)).1.toNat with... | [
{
"name": "n4CallAddbackBeqShift_eq_raw",
"text": "theorem n4CallAddbackBeqShift_eq_raw {b : EvmWord} :\n n4CallAddbackBeqShift b = (clzResult (b.getLimbN 3)).1.toNat := by\n rw [n4CallAddbackBeqShift_unfold]\n exact Nat.mod_eq_of_lt n4CallAddbackBeqShift_raw_lt_64\n\n",
"fan_in": 12,
"n_lines"... | [
{
"name": "n4CallAddbackBeqRawTrialBound_direct",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 30,
"n_chars": 1572,
"n_subproofs": 5,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 2,
"automation_only":... | 4 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -87,9 +87,20 @@
have h_le := clzResult_fst_toNat_le (b.getLimbN 3)
omega
+theorem n4CallAddbackBeqShift_eq_raw {b : EvmWord} :
+ n4CallAddbackBeqShift b = (clzResult (b.getLimbN 3)).1.toNat := by
+ rw [n4CallAddbackBeqShift_unfold]
+ exact Nat.mod_eq_of_lt n4CallAddbackBeqShift_raw_lt_64
+
theorem n4Ca... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_22 | 6a8d242143be1430 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 12 | [
{
"theorem_name": "n4CallAddbackBeqShift_pos_of_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [n4CallAddbackBeqShift_eq_raw]\n rcases Nat.eq_zero_or_pos (clzResult (b.getLimbN 3)).1.toNat with... | [
{
"name": "n4CallAddbackBeqShift_eq_raw",
"text": "theorem n4CallAddbackBeqShift_eq_raw {b : EvmWord} :\n n4CallAddbackBeqShift b = (clzResult (b.getLimbN 3)).1.toNat := by\n rw [n4CallAddbackBeqShift_unfold]\n exact Nat.mod_eq_of_lt n4CallAddbackBeqShift_raw_lt_64\n\n",
"fan_in": 12,
"n_lines"... | [
{
"name": "n4CallAddbackBeqQHatV4_le_val256_div_plus_two_of_le_rawTrial",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 19,
"n_chars": 1009,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,... | 5 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -87,9 +87,20 @@
have h_le := clzResult_fst_toNat_le (b.getLimbN 3)
omega
+theorem n4CallAddbackBeqShift_eq_raw {b : EvmWord} :
+ n4CallAddbackBeqShift b = (clzResult (b.getLimbN 3)).1.toNat := by
+ rw [n4CallAddbackBeqShift_unfold]
+ exact Nat.mod_eq_of_lt n4CallAddbackBeqShift_raw_lt_64
+
theorem n4Ca... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_23 | 1abbc664a7cbcf2d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 1 | [
{
"theorem_name": "n4CallAddbackBeqB2Prime_eq_direct",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [n4CallAddbackBeqB2Prime_unfold]\n rw [n4CallAddbackBeqShift_eq_raw, n4CallAddbackBeqAntiShift_eq_sub... | [
{
"name": "n4CallAddbackBeqB2Prime_unfold",
"text": "theorem n4CallAddbackBeqB2Prime_unfold {b : EvmWord} :\n n4CallAddbackBeqB2Prime b =\n ((b.getLimbN 2) <<< n4CallAddbackBeqShift b) |||\n ((b.getLimbN 1) >>> n4CallAddbackBeqAntiShift b) :=\n rfl\n\n",
"fan_in": 1,
"n_lines": 7,
... | [
{
"name": "n4CallAddbackBeqCarryV4_eq_direct",
"fan_in": 1,
"n_deps_direct": 10,
"n_deps_transitive": 27,
"n_lines": 42,
"n_chars": 2003,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 10,
"n_structural": 0,
"automation_only":... | 27 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -147,11 +147,20 @@
((b.getLimbN 2) <<< n4CallAddbackBeqShift b) |||
((b.getLimbN 1) >>> n4CallAddbackBeqAntiShift b)
+theorem n4CallAddbackBeqB2Prime_unfold {b : EvmWord} :
+ n4CallAddbackBeqB2Prime b =
+ ((b.getLimbN 2) <<< n4CallAddbackBeqShift b) |||
+ ((b.getLimbN 1) >>> n4CallAddbackBeq... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_24 | 976549abeaa06ad4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 24 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 1 | [
{
"theorem_name": "n4CallAddbackBeqB1Prime_eq_direct",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [n4CallAddbackBeqB1Prime_unfold]\n rw [n4CallAddbackBeqShift_eq_raw, n4CallAddbackBeqAntiShift_eq_sub... | [
{
"name": "n4CallAddbackBeqB1Prime_unfold",
"text": "theorem n4CallAddbackBeqB1Prime_unfold {b : EvmWord} :\n n4CallAddbackBeqB1Prime b =\n ((b.getLimbN 1) <<< n4CallAddbackBeqShift b) |||\n ((b.getLimbN 0) >>> n4CallAddbackBeqAntiShift b) :=\n rfl\n\n",
"fan_in": 1,
"n_lines": 7,
... | [
{
"name": "n4CallAddbackBeqQOutV4_eq_direct",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 29,
"n_lines": 37,
"n_chars": 1776,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": fal... | 29 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -167,11 +167,20 @@
((b.getLimbN 1) <<< n4CallAddbackBeqShift b) |||
((b.getLimbN 0) >>> n4CallAddbackBeqAntiShift b)
+theorem n4CallAddbackBeqB1Prime_unfold {b : EvmWord} :
+ n4CallAddbackBeqB1Prime b =
+ ((b.getLimbN 1) <<< n4CallAddbackBeqShift b) |||
+ ((b.getLimbN 0) >>> n4CallAddbackBeq... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_25 | 3686902914b9471a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 25 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 2 | [
{
"theorem_name": "n4CallAddbackBeqQOutV4_eq_direct",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [n4CallAddbackBeqQOutV4_unfold]\n rw [n4CallAddbackBeqQHatV4_eq_direct hshift_nz]\n rw [n4CallAddback... | [
{
"name": "n4CallAddbackBeqQOutV4_unfold",
"text": "theorem n4CallAddbackBeqQOutV4_unfold {a b : EvmWord} :\n n4CallAddbackBeqQOutV4 a b =\n (let qHat := n4CallAddbackBeqQHatV4 a b\n let carry := n4CallAddbackBeqCarryV4 a b\n if carry = 0 then qHat + signExtend12 4095 + signExtend12 4095... | [
{
"name": "n4CallAddbackBeqIterWithDoubleAddback_qOutV4_of_borrow",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 52,
"n_chars": 2111,
"n_subproofs": 4,
"n_tactics": 24,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 5,
"n_structural": 4,
... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -175,6 +175,14 @@
if carry = 0 then qHat + signExtend12 4095 + signExtend12 4095
else qHat + signExtend12 4095
+theorem n4CallAddbackBeqQOutV4_unfold {a b : EvmWord} :
+ n4CallAddbackBeqQOutV4 a b =
+ (let qHat := n4CallAddbackBeqQHatV4 a b
+ let carry := n4CallAddbackBeqCarryV4 a b
+ if ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_26 | 38733a00dbff4036 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 26 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 1 | [
{
"theorem_name": "n4CallAddbackBeqQOutV4_toNat_of_carry_eq_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [n4CallAddbackBeqQOutV4_of_carry_eq_zero h_carry]",
"n_chars": 58,
"n_subproofs": ... | [
{
"name": "n4CallAddbackBeqQOutV4_of_carry_eq_zero",
"text": "/-- The zero-carry call+addback-BEQ case decrements the trial quotient twice. -/\ntheorem n4CallAddbackBeqQOutV4_of_carry_eq_zero {a b : EvmWord}\n (h_carry : n4CallAddbackBeqCarryV4 a b = 0) :\n n4CallAddbackBeqQOutV4 a b =\n n4CallAd... | [
{
"name": "n4CallAddbackBeqQOutV4_toNat_of_carry_eq_zero",
"fan_in": 5,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 370,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -156,11 +156,19 @@
if carry = 0 then qHat + signExtend12 4095 + signExtend12 4095
else qHat + signExtend12 4095
+/-- The zero-carry call+addback-BEQ case decrements the trial quotient twice. -/
+theorem n4CallAddbackBeqQOutV4_of_carry_eq_zero {a b : EvmWord}
+ (h_carry : n4CallAddbackBeqCarryV4 a b = 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_3a6fd34cb06e_27 | 7d73b29e37f6cbf1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 27 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 1 | [
{
"theorem_name": "n4CallAddbackBeqQOutV4_toNat_of_carry_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [n4CallAddbackBeqQOutV4_of_carry_ne_zero h_carry]",
"n_chars": 58,
"n_subproofs": ... | [
{
"name": "n4CallAddbackBeqQOutV4_of_carry_ne_zero",
"text": "/-- The nonzero-carry call+addback-BEQ case decrements the trial quotient once. -/\ntheorem n4CallAddbackBeqQOutV4_of_carry_ne_zero {a b : EvmWord}\n (h_carry : n4CallAddbackBeqCarryV4 a b ≠ 0) :\n n4CallAddbackBeqQOutV4 a b =\n n4Call... | [
{
"name": "n4CallAddbackBeqQOutV4_toNat_of_carry_ne_zero",
"fan_in": 5,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 355,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -156,11 +156,20 @@
if carry = 0 then qHat + signExtend12 4095 + signExtend12 4095
else qHat + signExtend12 4095
+/-- The nonzero-carry call+addback-BEQ case decrements the trial quotient once. -/
+theorem n4CallAddbackBeqQOutV4_of_carry_ne_zero {a b : EvmWord}
+ (h_carry : n4CallAddbackBeqCarryV4 a b ≠ 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_3a6fd34cb06e_28 | d5813154720ecb14 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 28 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 2 | [
{
"theorem_name": "n4CallAddbackBeqQHatBranchEqQTrue_of_carry_eq_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n (n4CallAddbackBeqQHatBranchEqQTrue_carry_eq_zero_iff h_carry).2 h_qHat",
"n_chars": 73,... | [
{
"name": "n4CallAddbackBeqQHatBranchEqQTrue_carry_eq_zero_iff",
"text": "theorem n4CallAddbackBeqQHatBranchEqQTrue_carry_eq_zero_iff {a b : EvmWord}\n (h_carry : n4CallAddbackBeqCarryV4 a b = 0) :\n n4CallAddbackBeqQHatBranchEqQTrue a b ↔\n (n4CallAddbackBeqQHatV4 a b + signExtend12 4095 + signE... | [
{
"name": "n4CallAddbackBeqQHatBranchEqQTrue_of_carry_eq_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 376,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automa... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -170,12 +170,20 @@
(n4CallAddbackBeqQHatV4 a b + signExtend12 4095).toNat =
n4CallAddbackBeqQTrue a b
+theorem n4CallAddbackBeqQHatBranchEqQTrue_carry_eq_zero_iff {a b : EvmWord}
+ (h_carry : n4CallAddbackBeqCarryV4 a b = 0) :
+ n4CallAddbackBeqQHatBranchEqQTrue a b ↔
+ (n4CallAddbackBeqQHat... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_29 | 8ae7d49e9db41305 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 29 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 2 | [
{
"theorem_name": "n4CallAddbackBeqQHatBranchEqQTrue_of_carry_eq_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n (n4CallAddbackBeqQHatBranchEqQTrue_carry_eq_zero_iff h_carry).2 h_qHat",
"n_chars": 73,... | [
{
"name": "n4CallAddbackBeqQHatBranchEqQTrue_carry_eq_zero_iff",
"text": "theorem n4CallAddbackBeqQHatBranchEqQTrue_carry_eq_zero_iff {a b : EvmWord}\n (h_carry : n4CallAddbackBeqCarryV4 a b = 0) :\n n4CallAddbackBeqQHatBranchEqQTrue a b ↔\n (n4CallAddbackBeqQHatV4 a b + signExtend12 4095 + signE... | [
{
"name": "n4CallAddbackBeqQHatBranchEqQTrue_carry_eq_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 365,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automatio... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -170,11 +170,19 @@
(n4CallAddbackBeqQHatV4 a b + signExtend12 4095).toNat =
n4CallAddbackBeqQTrue a b
+theorem n4CallAddbackBeqQHatBranchEqQTrue_carry_eq_zero_iff {a b : EvmWord}
+ (h_carry : n4CallAddbackBeqCarryV4 a b = 0) :
+ n4CallAddbackBeqQHatBranchEqQTrue a b ↔
+ (n4CallAddbackBeqQHat... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_30 | 4937dd7ff6fae7bf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 30 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 2 | [
{
"theorem_name": "n4CallAddbackBeqQHatBranchEqQTrue_of_carry_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n (n4CallAddbackBeqQHatBranchEqQTrue_carry_ne_zero_iff h_carry).2 h_qHat",
"n_chars": 73,... | [
{
"name": "n4CallAddbackBeqQHatBranchEqQTrue_carry_ne_zero_iff",
"text": "theorem n4CallAddbackBeqQHatBranchEqQTrue_carry_ne_zero_iff {a b : EvmWord}\n (h_carry : n4CallAddbackBeqCarryV4 a b ≠ 0) :\n n4CallAddbackBeqQHatBranchEqQTrue a b ↔\n (n4CallAddbackBeqQHatV4 a b + signExtend12 4095).toNat ... | [
{
"name": "n4CallAddbackBeqQHatBranchEqQTrue_of_carry_ne_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 358,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automa... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -170,12 +170,20 @@
(n4CallAddbackBeqQHatV4 a b + signExtend12 4095).toNat =
n4CallAddbackBeqQTrue a b
+theorem n4CallAddbackBeqQHatBranchEqQTrue_carry_ne_zero_iff {a b : EvmWord}
+ (h_carry : n4CallAddbackBeqCarryV4 a b ≠ 0) :
+ n4CallAddbackBeqQHatBranchEqQTrue a b ↔
+ (n4CallAddbackBeqQHat... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_31 | f58c3cbd57c670ab | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 31 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 2 | [
{
"theorem_name": "n4CallAddbackBeqQHatBranchEqQTrue_of_carry_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n (n4CallAddbackBeqQHatBranchEqQTrue_carry_ne_zero_iff h_carry).2 h_qHat",
"n_chars": 73,... | [
{
"name": "n4CallAddbackBeqQHatBranchEqQTrue_carry_ne_zero_iff",
"text": "theorem n4CallAddbackBeqQHatBranchEqQTrue_carry_ne_zero_iff {a b : EvmWord}\n (h_carry : n4CallAddbackBeqCarryV4 a b ≠ 0) :\n n4CallAddbackBeqQHatBranchEqQTrue a b ↔\n (n4CallAddbackBeqQHatV4 a b + signExtend12 4095).toNat ... | [
{
"name": "n4CallAddbackBeqQHatBranchEqQTrue_carry_ne_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 347,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automatio... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -170,11 +170,19 @@
(n4CallAddbackBeqQHatV4 a b + signExtend12 4095).toNat =
n4CallAddbackBeqQTrue a b
+theorem n4CallAddbackBeqQHatBranchEqQTrue_carry_ne_zero_iff {a b : EvmWord}
+ (h_carry : n4CallAddbackBeqCarryV4 a b ≠ 0) :
+ n4CallAddbackBeqQHatBranchEqQTrue a b ↔
+ (n4CallAddbackBeqQHat... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_32 | db36d929822e17b2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 32 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 5 | [
{
"theorem_name": "n4CallAddbackBeqQOutV4_toNat_eq_qTrue_carry_eq_zero_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [n4CallAddbackBeqQOutV4_toNat_of_carry_eq_zero h_carry]",
"n_chars": 64,
... | [
{
"name": "n4CallAddbackBeqQOutV4_toNat_of_carry_eq_zero",
"text": "/-- `toNat` form of the zero-carry double-decrement qOut case. -/\ntheorem n4CallAddbackBeqQOutV4_toNat_of_carry_eq_zero {a b : EvmWord}\n (h_carry : n4CallAddbackBeqCarryV4 a b = 0) :\n (n4CallAddbackBeqQOutV4 a b).toNat =\n (n4... | [
{
"name": "n4CallAddbackBeqQOutV4_toNat_eq_qTrue_carry_eq_zero_iff",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 386,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"a... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -163,6 +163,13 @@
n4CallAddbackBeqQHatV4 a b + signExtend12 4095 + signExtend12 4095 := by
simp [n4CallAddbackBeqQOutV4, h_carry]
+/-- `toNat` form of the zero-carry double-decrement qOut case. -/
+theorem n4CallAddbackBeqQOutV4_toNat_of_carry_eq_zero {a b : EvmWord}
+ (h_carry : n4CallAddbackBeqCarry... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a6fd34cb06e_33 | debb1eff8fb28791 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallAddback.lean | CallAddback | 33 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 68 | 5 | [
{
"theorem_name": "n4CallAddbackBeqQOutV4_toNat_eq_qTrue_carry_ne_zero_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [n4CallAddbackBeqQOutV4_toNat_of_carry_ne_zero h_carry]",
"n_chars": 64,
... | [
{
"name": "n4CallAddbackBeqQOutV4_toNat_of_carry_ne_zero",
"text": "/-- `toNat` form of the nonzero-carry single-decrement qOut case. -/\ntheorem n4CallAddbackBeqQOutV4_toNat_of_carry_ne_zero {a b : EvmWord}\n (h_carry : n4CallAddbackBeqCarryV4 a b ≠ 0) :\n (n4CallAddbackBeqQOutV4 a b).toNat =\n ... | [
{
"name": "n4CallAddbackBeqQOutV4_toNat_eq_qTrue_carry_ne_zero_iff",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 368,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"a... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | /-
EvmAsm.Evm64.DivMod.Spec.CallAddback
Call+addback BEQ semantic predicate marker (n=4, shift ≠ 0).
Contents:
- the predicate below, retained only as the Phase 2a algorithm-fix target
marker.
- a small rfl unfolding theorem.
The former stack specs, qHat sub-stubs, and Word-level Euclideans were
de... | @@ -164,6 +164,13 @@
rw [n4CallAddbackBeqQOutV4]
rw [if_neg h_carry]
+/-- `toNat` form of the nonzero-carry single-decrement qOut case. -/
+theorem n4CallAddbackBeqQOutV4_toNat_of_carry_ne_zero {a b : EvmWord}
+ (h_carry : n4CallAddbackBeqCarryV4 a b ≠ 0) :
+ (n4CallAddbackBeqQOutV4 a b).toNat =
+ (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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.