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_ea78c3bbaa84_0 | 64c25ec36cc35e59 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N4QHatLeOne.lean | N4QHatLeOne | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "n4CallAddbackBeqQHatV5_le_window_div_plus_one_of_u4_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := n4CallAddbackBeqQHatV5_le_one_of_u4_zero hb3nz hu4\n exact Nat.le_trans... | [
{
"name": "n4CallAddbackBeqQHatV5_le_one_of_u4_zero",
"text": "/-- Under `U4 = 0`, the n=4 call trial quotient is at most 1. -/\ntheorem n4CallAddbackBeqQHatV5_le_one_of_u4_zero {a b : EvmWord}\n (hb3nz : b.getLimbN 3 ≠ 0)\n (hu4 : (n4CallAddbackBeqU4 a b).toNat = 0) :\n (n4CallAddbackBeqQHatV5 a b... | [
{
"name": "n4CallAddbackBeqQHatV5_le_window_div_plus_one_of_u4_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 757,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N4QHatLeOne
Under `U4 = 0`, the n=4 call trial quotient is at most 1, hence overestimates the
normalized-window quotient by at most 1 (the `+1` `hq_over` the n=4 v5 semantic
`n4CallAddbackBeqSemanticHoldsV5_of_runtime_conditions_legacy` takes — tighter
than the `+2` of #7574).
... | /-
EvmAsm.Evm64.DivMod.Spec.N4QHatLeOne
Under `U4 = 0`, the n=4 call trial quotient is at most 1, hence overestimates the
normalized-window quotient by at most 1 (the `+1` `hq_over` the n=4 v5 semantic
`n4CallAddbackBeqSemanticHoldsV5_of_runtime_conditions_legacy` takes — tighter
than the `+2` of #7574).
... | @@ -20,6 +20,20 @@
open EvmWord EvmAsm.Rv64
+/-- Under `U4 = 0`, the n=4 call trial quotient is at most 1. -/
+theorem n4CallAddbackBeqQHatV5_le_one_of_u4_zero {a b : EvmWord}
+ (hb3nz : b.getLimbN 3 ≠ 0)
+ (hu4 : (n4CallAddbackBeqU4 a b).toNat = 0) :
+ (n4CallAddbackBeqQHatV5 a b).toNat ≤ 1 := by
+ have... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bcb06a2cd75f_0 | f6133e66bd25788d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DivN2NormVStructure.lean | DivN2NormVStructure | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "fullDivN2NormV_v2_zero_of_shape_shift_nz",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [fullDivN2NormV_unfold]\n show (b2 <<< ((fullDivN2Shift b1).toNat % 64)) |||\n (b1 >>> ... | [
{
"name": "fullDivN2AntiShift_toNat_mod_64",
"text": "/-- Auxiliary: when `shift = clzResult b1 .1` is in `[1, 63]`, the antiShift\n word's `toNat % 64` equals `64 - shift`. Used by the structural facts\n below to bring the shift amount into a usable range. -/\nprivate theorem fullDivN2AntiShift_toNa... | [
{
"name": "fullDivN2NormV_v2_zero_of_shape_shift_nz",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 25,
"n_chars": 982,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 9,
"n_structural": 3,
"automation_onl... | 1 | /-
EvmAsm.Evm64.EvmWordArith.DivN2NormVStructure
Structural facts about the normalised divisor `fullDivN2NormV` under the
n=2 shape predicate (`b3 = 0`, `b2 = 0`, `b1 ≠ 0`) and `shift_nz`.
Three facts are proved here:
1. `fullDivN2NormV_top_zero_of_shape_shift_nz`: `v3_norm = 0`.
2. `fullDivN2NormV_v2... | /-
EvmAsm.Evm64.EvmWordArith.DivN2NormVStructure
Structural facts about the normalised divisor `fullDivN2NormV` under the
n=2 shape predicate (`b3 = 0`, `b2 = 0`, `b1 ≠ 0`) and `shift_nz`.
Three facts are proved here:
1. `fullDivN2NormV_top_zero_of_shape_shift_nz`: `v3_norm = 0`.
2. `fullDivN2NormV_v2... | @@ -23,6 +23,41 @@
open EvmWord EvmAsm.Rv64
+/-- Auxiliary: when `shift = clzResult b1 .1` is in `[1, 63]`, the antiShift
+ word's `toNat % 64` equals `64 - shift`. Used by the structural facts
+ below to bring the shift amount into a usable range. -/
+private theorem fullDivN2AntiShift_toNat_mod_64
+ (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_fc4f0f569bb1_0 | a354d02a5779a7a0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase2LongLoopGeneral.lean | Phase2LongLoopGeneral | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "rlpLoopAcc_toNat",
"depth": 1,
"n_commands": 0,
"n_lines": 41,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing len ptr with\n | zero =>\n simp only [rlpLoopAcc, rlpLoopByteList, Nat.fromBytesBE, pow_zero... | [
{
"name": "rlpLoopByteList_length",
"text": "theorem rlpLoopByteList_length (wordVal ptr : Word) (n : Nat) :\n (rlpLoopByteList wordVal ptr n).length = n := by\n induction n generalizing ptr with\n | zero => rfl\n | succ k ih => simp [rlpLoopByteList, ih]\n\n-- ========================================... | [
{
"name": "rlpLoopAcc_toNat",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 48,
"n_chars": 2496,
"n_subproofs": 3,
"n_tactics": 39,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 6,
"n_structural": 4,
"automation_only": false,
"max_nes... | 1 | /-
EvmAsm.Rv64.RLP.Phase2LongLoopGeneral
EL.3 Phase 2 (long form) — foundations for the general n-iteration closure
of the long-form length loop:
* parametric counter arithmetic (the documented `BitVec.ofNat n` blocker),
* the loop accumulator `rlpLoopAcc` and the byte list `rlpLoopByteList`
(both ... | /-
EvmAsm.Rv64.RLP.Phase2LongLoopGeneral
EL.3 Phase 2 (long form) — foundations for the general n-iteration closure
of the long-form length loop:
* parametric counter arithmetic (the documented `BitVec.ofNat n` blocker),
* the loop accumulator `rlpLoopAcc` and the byte list `rlpLoopByteList`
(both ... | @@ -45,6 +45,16 @@
| ptr, (k + 1) => extractByte wordVal (byteOffset ptr)
:: rlpLoopByteList wordVal (ptr + 1) k
+theorem rlpLoopByteList_length (wordVal ptr : Word) (n : Nat) :
+ (rlpLoopByteList wordVal ptr n).length = n := by
+ induction n generalizing ptr with
+ | zero => rfl
+ | s... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fc4f0f569bb1_1 | c1cfe62b5158af3a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase2LongLoopGeneral.lean | Phase2LongLoopGeneral | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "rlpLoopAcc_zero_eq_fromBytesBE",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [rlpLoopAcc_toNat, BitVec.toNat_ofNat,\n show ((0 : Word).toNat) = 0 fr... | [
{
"name": "rlpLoopAcc_toNat",
"text": "/-- Mod-form accumulator invariant: after `n` iterations from `(len, ptr)`,\n `x11 = (len * 256^n + fromBytesBE bytes) mod 2^64`. -/\ntheorem rlpLoopAcc_toNat (wordVal : Word) (n : Nat) (len ptr : Word) :\n (rlpLoopAcc wordVal len ptr n).toNat\n = (len.toNat... | [
{
"name": "rlpLoopAcc_zero_eq_fromBytesBE",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 16,
"n_chars": 850,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
... | 2 | /-
EvmAsm.Rv64.RLP.Phase2LongLoopGeneral
EL.3 Phase 2 (long form) — foundations for the general n-iteration closure
of the long-form length loop:
* parametric counter arithmetic (the documented `BitVec.ofNat n` blocker),
* the loop accumulator `rlpLoopAcc` and the byte list `rlpLoopByteList`
(both ... | /-
EvmAsm.Rv64.RLP.Phase2LongLoopGeneral
EL.3 Phase 2 (long form) — foundations for the general n-iteration closure
of the long-form length loop:
* parametric counter arithmetic (the documented `BitVec.ofNat n` blocker),
* the loop accumulator `rlpLoopAcc` and the byte list `rlpLoopByteList`
(both ... | @@ -55,13 +55,63 @@
-- Bridge: rlpLoopAcc (from 0) decodes to the pure-spec Nat.fromBytesBE
-- ============================================================================
+/-- Mod-form accumulator invariant: after `n` iterations from `(len, ptr)`,
+ `x11 = (len * 256^n + fromBytesBE bytes) mod 2^64`. -/
+theore... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fc4f0f569bb1_2 | 27379394a1918129 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase2LongLoopGeneral.lean | Phase2LongLoopGeneral | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "rlp_phase2_long_loop_succ_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 64,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction k generalizing len ptr v12Old with\n | zero =>\n obtain ⟨ha0, hv0⟩ := hwin 0 (by omega... | [
{
"name": "rlpLoopAcc_zero",
"text": "/-- One-step unfolding equations for `rlpLoopAcc` (used for `rw`, since a bare\n `rfl` on a symbolic count loops). -/\ntheorem rlpLoopAcc_zero (wordVal len ptr : Word) :\n rlpLoopAcc wordVal len ptr 0 = len := rfl\n\n",
"fan_in": 1,
"n_lines": 6,
"n_ch... | [
{
"name": "rlp_phase2_long_loop_succ_spec_within",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 83,
"n_chars": 4678,
"n_subproofs": 12,
"n_tactics": 65,
"cyclomatic": 2,
"n_automation": 12,
"n_rewrites": 18,
"n_structural": 6,
"automation_on... | 5 | /-
EvmAsm.Rv64.RLP.Phase2LongLoopGeneral
EL.3 Phase 2 (long form) — foundations for the general n-iteration closure
of the long-form length loop:
* parametric counter arithmetic (the documented `BitVec.ofNat n` blocker),
* the loop accumulator `rlpLoopAcc` and the byte list `rlpLoopByteList`
(both ... | /-
EvmAsm.Rv64.RLP.Phase2LongLoopGeneral
EL.3 Phase 2 (long form) — foundations for the general n-iteration closure
of the long-form length loop:
* parametric counter arithmetic (the documented `BitVec.ofNat n` blocker),
* the loop accumulator `rlpLoopAcc` and the byte list `rlpLoopByteList`
(both ... | @@ -65,6 +65,11 @@
((len <<< 8) + (extractByte wordVal (byteOffset ptr)).zeroExtend 64)
(ptr + 1) k
+/-- One-step unfolding equations for `rlpLoopAcc` (used for `rw`, since a bare
+ `rfl` on a symbolic count loops). -/
+theorem rlpLoopAcc_zero (wordVal len ptr : Word) :
+ rlpLoopAcc wordVal le... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fc4f0f569bb1_3 | ddd2b0b394790959 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase2LongLoopGeneral.lean | Phase2LongLoopGeneral | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "rlpLoopAcc_zero_eq_fromBytesBE",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [rlpLoopAcc_toNat, BitVec.toNat_ofNat,\n show ((0 : Word).toNat) = 0 fr... | [
{
"name": "rlpLoopAcc_toNat",
"text": "/-- Mod-form accumulator invariant: after `n` iterations from `(len, ptr)`,\n `x11 = (len * 256^n + fromBytesBE bytes) mod 2^64`. -/\ntheorem rlpLoopAcc_toNat (wordVal : Word) (n : Nat) (len ptr : Word) :\n (rlpLoopAcc wordVal len ptr n).toNat\n = (len.toNat... | [
{
"name": "rlp_phase2_long_loop_n_byte_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 28,
"n_chars": 1682,
"n_subproofs": 2,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 2,
"automation_only... | 9 | /-
EvmAsm.Rv64.RLP.Phase2LongLoopGeneral
EL.3 Phase 2 (long form) — foundations for the general n-iteration closure
of the long-form length loop:
* parametric counter arithmetic (the documented `BitVec.ofNat n` blocker),
* the loop accumulator `rlpLoopAcc` and the byte list `rlpLoopByteList`
(both ... | /-
EvmAsm.Rv64.RLP.Phase2LongLoopGeneral
EL.3 Phase 2 (long form) — foundations for the general n-iteration closure
of the long-form length loop:
* parametric counter arithmetic (the documented `BitVec.ofNat n` blocker),
* the loop accumulator `rlpLoopAcc` and the byte list `rlpLoopByteList`
(both ... | @@ -93,13 +93,63 @@
-- Bridge: rlpLoopAcc (from 0) decodes to the pure-spec Nat.fromBytesBE
-- ============================================================================
+/-- Mod-form accumulator invariant: after `n` iterations from `(len, ptr)`,
+ `x11 = (len * 256^n + fromBytesBE bytes) mod 2^64`. -/
+theore... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e097692e4593_0 | f79233ad5360054d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/NormBV5Mod.lean | NormBV5Mod | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "divK_normB_half1_within_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro b3' b2'\n have hm1 := divK_normB_merge_spec_within 56 48 sp b3 b2 v5 v7 shift antiShift (base + no... | [
{
"name": "divK_normB_code_sub_modCode_noNop_v5",
"text": "/-- The normB block instructions are subsumed by `modCode_noNop_v5`. -/\nprivate theorem divK_normB_code_sub_modCode_noNop_v5 {base : Word} :\n ∀ a i, (CodeReq.ofProg (base + normBOff) divK_normB) a = some i →\n (modCode_noNop_v5 base) a = s... | [
{
"name": "divK_normB_half1_within_v5_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 44,
"n_chars": 2355,
"n_subproofs": 7,
"n_tactics": 30,
"cyclomatic": 1,
"n_automation": 9,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": fal... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.NormBV5Mod
v5 normalize-B brick (21 steps, normBOff → normAOff) over `modCode_noNop_v5`.
Mirror of `divK_normB_full_spec_within_v4_noNop` (Norm.lean): the normB
instructions don't touch div128, so the same version-agnostic merge/last bodies
are extended to the v5 code via the v... | /-
EvmAsm.Evm64.DivMod.Compose.NormBV5Mod
v5 normalize-B brick (21 steps, normBOff → normAOff) over `modCode_noNop_v5`.
Mirror of `divK_normB_full_spec_within_v4_noNop` (Norm.lean): the normB
instructions don't touch div128, so the same version-agnostic merge/last bodies
are extended to the v5 code via the v... | @@ -17,6 +17,13 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (se12_32 se12_40 se12_48 se12_56)
+/-- The normB block instructions are subsumed by `modCode_noNop_v5`. -/
+private theorem divK_normB_code_sub_modCode_noNop_v5 {base : Word} :
+ ∀ a i, (CodeReq.ofProg (base + normBOff) divK_normB) a = some 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_e097692e4593_1 | 59725ec22603f655 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/NormBV5Mod.lean | NormBV5Mod | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "divK_normB_half1_within_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro b3' b2'\n have hm1 := divK_normB_merge_spec_within 56 48 sp b3 b2 v5 v7 shift antiShift (base + no... | [
{
"name": "divK_normB_code_sub_modCode_noNop_v5",
"text": "/-- The normB block instructions are subsumed by `modCode_noNop_v5`. -/\nprivate theorem divK_normB_code_sub_modCode_noNop_v5 {base : Word} :\n ∀ a i, (CodeReq.ofProg (base + normBOff) divK_normB) a = some i →\n (modCode_noNop_v5 base) a = s... | [
{
"name": "divK_normB_half2_within_v5_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 46,
"n_chars": 2514,
"n_subproofs": 7,
"n_tactics": 32,
"cyclomatic": 1,
"n_automation": 9,
"n_rewrites": 4,
"n_structural": 2,
"automation_only": fal... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.NormBV5Mod
v5 normalize-B brick (21 steps, normBOff → normAOff) over `modCode_noNop_v5`.
Mirror of `divK_normB_full_spec_within_v4_noNop` (Norm.lean): the normB
instructions don't touch div128, so the same version-agnostic merge/last bodies
are extended to the v5 code via the v... | /-
EvmAsm.Evm64.DivMod.Compose.NormBV5Mod
v5 normalize-B brick (21 steps, normBOff → normAOff) over `modCode_noNop_v5`.
Mirror of `divK_normB_full_spec_within_v4_noNop` (Norm.lean): the normB
instructions don't touch div128, so the same version-agnostic merge/last bodies
are extended to the v5 code via the v... | @@ -17,6 +17,13 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (se12_32 se12_40 se12_48 se12_56)
+/-- The normB block instructions are subsumed by `modCode_noNop_v5`. -/
+private theorem divK_normB_code_sub_modCode_noNop_v5 {base : Word} :
+ ∀ a i, (CodeReq.ofProg (base + normBOff) divK_normB) a = some 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_e097692e4593_2 | 5018a98eac87f0c6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/NormBV5Mod.lean | NormBV5Mod | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "divK_normB_half1_within_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro b3' b2'\n have hm1 := divK_normB_merge_spec_within 56 48 sp b3 b2 v5 v7 shift antiShift (base + no... | [
{
"name": "divK_normB_code_sub_modCode_noNop_v5",
"text": "/-- The normB block instructions are subsumed by `modCode_noNop_v5`. -/\nprivate theorem divK_normB_code_sub_modCode_noNop_v5 {base : Word} :\n ∀ a i, (CodeReq.ofProg (base + normBOff) divK_normB) a = some i →\n (modCode_noNop_v5 base) a = s... | [
{
"name": "divK_normB_full_spec_within_v5_noNop_mod",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 23,
"n_chars": 1225,
"n_subproofs": 2,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_on... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.NormBV5Mod
v5 normalize-B brick (21 steps, normBOff → normAOff) over `modCode_noNop_v5`.
Mirror of `divK_normB_full_spec_within_v4_noNop` (Norm.lean): the normB
instructions don't touch div128, so the same version-agnostic merge/last bodies
are extended to the v5 code via the v... | /-
EvmAsm.Evm64.DivMod.Compose.NormBV5Mod
v5 normalize-B brick (21 steps, normBOff → normAOff) over `modCode_noNop_v5`.
Mirror of `divK_normB_full_spec_within_v4_noNop` (Norm.lean): the normB
instructions don't touch div128, so the same version-agnostic merge/last bodies
are extended to the v5 code via the v... | @@ -17,6 +17,13 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (se12_32 se12_40 se12_48 se12_56)
+/-- The normB block instructions are subsumed by `modCode_noNop_v5`. -/
+private theorem divK_normB_code_sub_modCode_noNop_v5 {base : Word} :
+ ∀ a i, (CodeReq.ofProg (base + normBOff) divK_normB) a = some 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_2b94425b1f54_0 | a4182468a1b0f2f5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/LoadProgram.lean | LoadProgram | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_calldataload_window_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_calldataload_window_program_length]",
"n_chars": 49,
"n_subproofs": 0,
"n_tactics":... | [
{
"name": "evm_calldataload_window_program_length",
"text": "/-- `evm_calldataload_window` is 94 RISC-V instructions. -/\ntheorem evm_calldataload_window_program_length\n (offReg byteReg accReg addrReg envPtrReg : Reg) :\n (evm_calldataload_window offReg byteReg accReg addrReg envPtrReg).length =\n ... | [
{
"name": "evm_calldataload_window_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 317,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fal... | 1 | /-
EvmAsm.Evm64.Calldata.LoadProgram
Straight-line byte-window core for the EVM `CALLDATALOAD` opcode
(GH #104). This program shape handles the in-bounds 32-byte read:
pop the calldata offset from the EVM stack, add it to the environment's
`callDataPtr`, pack four big-endian 8-byte limbs with LBU/SLLI/OR, a... | /-
EvmAsm.Evm64.Calldata.LoadProgram
Straight-line byte-window core for the EVM `CALLDATALOAD` opcode
(GH #104). This program shape handles the in-bounds 32-byte read:
pop the calldata offset from the EVM stack, add it to the environment's
`callDataPtr`, pack four big-endian 8-byte limbs with LBU/SLLI/OR, a... | @@ -43,11 +43,20 @@
CodeReq.ofProg base
(evm_calldataload_window offReg byteReg accReg addrReg envPtrReg)
+/-- `evm_calldataload_window` is 94 RISC-V instructions. -/
+theorem evm_calldataload_window_program_length
+ (offReg byteReg accReg addrReg envPtrReg : Reg) :
+ (evm_calldataload_window offReg byt... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2b94425b1f54_1 | 52c61af1133429e9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/LoadProgram.lean | LoadProgram | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_calldataload_window_code_eq_evm_mload_code",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold evm_calldataload_window_code evm_mload_code\n rw [evm_calldataload_window_eq_evm_mlo... | [
{
"name": "evm_calldataload_window_eq_evm_mload",
"text": "/-- The CALLDATALOAD byte-window core is program-identical to MLOAD with\n the base register interpreted as the calldata pointer register. -/\ntheorem evm_calldataload_window_eq_evm_mload\n (offReg byteReg accReg addrReg envPtrReg : Reg) :\n ... | [
{
"name": "evm_calldataload_window_code_eq_evm_mload_code",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 446,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation... | 1 | /-
EvmAsm.Evm64.Calldata.LoadProgram
Straight-line byte-window core for the EVM `CALLDATALOAD` opcode
(GH #104). This program shape handles the in-bounds 32-byte read:
pop the calldata offset from the EVM stack, add it to the environment's
`callDataPtr`, pack four big-endian 8-byte limbs with LBU/SLLI/OR, a... | /-
EvmAsm.Evm64.Calldata.LoadProgram
Straight-line byte-window core for the EVM `CALLDATALOAD` opcode
(GH #104). This program shape handles the in-bounds 32-byte read:
pop the calldata offset from the EVM stack, add it to the environment's
`callDataPtr`, pack four big-endian 8-byte limbs with LBU/SLLI/OR, a... | @@ -43,11 +43,21 @@
CodeReq.ofProg base
(evm_calldataload_window offReg byteReg accReg addrReg envPtrReg)
+/-- The CALLDATALOAD byte-window core is program-identical to MLOAD with
+ the base register interpreted as the calldata pointer register. -/
+theorem evm_calldataload_window_eq_evm_mload
+ (offReg... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fe9a9643dc4c_0 | b04315743d970f36 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/IsZero/Spec.lean | Spec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_iszero_stack_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro orAll result\n have h_main := evm_iszero_spec_within sp base\n (a.getLimbN 0) (a.getLimbN 1) (a.get... | [
{
"name": "evm_iszero_spec_within",
"text": "/-- Full 256-bit EVM ISZERO: result = 1 iff all 4 limbs are 0.\n Unary: reads 256-bit word at sp, overwrites with boolean result.\n 12 instructions = 48 bytes. -/\ntheorem evm_iszero_spec_within (sp : Word) (base : Word)\n (a0 a1 a2 a3 : Word)\n (v7 v... | [
{
"name": "evm_iszero_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 34,
"n_chars": 1445,
"n_subproofs": 1,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.IsZero.Spec
Full 256-bit EVM ISZERO spec composed from per-limb specs.
12 instructions total. Unary: pops 1, pushes 1, sp unchanged.
-/
import EvmAsm.Evm64.IsZero.LimbSpec
import EvmAsm.Evm64.IsZero.Program
import EvmAsm.Evm64.EvmWordArith.IsZero
import EvmAsm.Evm64.Stack
import EvmAsm.Rv64.Tact... | /-
EvmAsm.Evm64.IsZero.Spec
Full 256-bit EVM ISZERO spec composed from per-limb specs.
12 instructions total. Unary: pops 1, pushes 1, sp unchanged.
-/
import EvmAsm.Evm64.IsZero.LimbSpec
import EvmAsm.Evm64.IsZero.Program
import EvmAsm.Evm64.EvmWordArith.IsZero
import EvmAsm.Evm64.Stack
import EvmAsm.Rv64.Tact... | @@ -22,6 +22,45 @@
abbrev evm_iszero_code (base : Word) : CodeReq :=
CodeReq.ofProg base evm_iszero
+/-- Full 256-bit EVM ISZERO: result = 1 iff all 4 limbs are 0.
+ Unary: reads 256-bit word at sp, overwrites with boolean result.
+ 12 instructions = 48 bytes. -/
+theorem evm_iszero_spec_within (sp : 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_3c3cf86354cb_0 | d012a7dff1be890c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bls12Fq12IsZeroSAsm.lean | Bls12Fq12IsZeroSAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "add_idx_sub_self",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [BitVec.toNat_sub, BitVec.toNat_add, idx_toNat i hi]\n omega",
"n_chars": 69,
"n_subproofs": 0,
"n_tactics... | [
{
"name": "idx_toNat",
"text": "private theorem idx_toNat (i : Nat) (hi : i < 72) :\n (BitVec.ofNat 64 (8 * i)).toNat = 8 * i := by\n rw [BitVec.toNat_ofNat]\n omega\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 137,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automa... | [
{
"name": "add_idx_sub_self",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 201,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nestin... | 1 | /-
EvmAsm.Codegen.Programs.Bls12Fq12IsZeroSAsm
Verified SAsm port of `blq_is_zero`: OR the 72 64-bit limbs of a 576-byte
BLS12 Fq12 buffer and return `a0 = 1` iff the accumulator is zero.
-/
import EvmAsm.Rv64.SAsm.Tactic
import EvmAsm.Codegen.Programs.Bls12Fq12
namespace EvmAsm.Codegen
open EvmAsm.Rv64 EvmAs... | /-
EvmAsm.Codegen.Programs.Bls12Fq12IsZeroSAsm
Verified SAsm port of `blq_is_zero`: OR the 72 64-bit limbs of a 576-byte
BLS12 Fq12 buffer and return `a0 = 1` iff the accumulator is zero.
-/
import EvmAsm.Rv64.SAsm.Tactic
import EvmAsm.Codegen.Programs.Bls12Fq12
namespace EvmAsm.Codegen
open EvmAsm.Rv64 EvmAs... | @@ -52,8 +52,15 @@
post := fun rf ws _ => rf.get .x10 = fq12IsZeroResult bs ∧ ws = []
body := blqIsZeroBody src bs
+private theorem idx_toNat (i : Nat) (hi : i < 72) :
+ (BitVec.ofNat 64 (8 * i)).toNat = 8 * i := by
+ rw [BitVec.toNat_ofNat]
+ omega
+
private theorem add_idx_sub_self (src : Word) (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_3c3cf86354cb_1 | 5d11f4ab3152398f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bls12Fq12IsZeroSAsm.lean | Bls12Fq12IsZeroSAsm | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "add_idx_sub_self",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [BitVec.toNat_sub, BitVec.toNat_add, idx_toNat i hi]\n omega",
"n_chars": 69,
"n_subproofs": 0,
"n_tactics... | [
{
"name": "idx_toNat",
"text": "private theorem idx_toNat (i : Nat) (hi : i < 72) :\n (BitVec.ofNat 64 (8 * i)).toNat = 8 * i := by\n rw [BitVec.toNat_ofNat]\n omega\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 137,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automa... | [
{
"name": "fq12Dword_region",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 255,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_nestin... | 2 | /-
EvmAsm.Codegen.Programs.Bls12Fq12IsZeroSAsm
Verified SAsm port of `blq_is_zero`: OR the 72 64-bit limbs of a 576-byte
BLS12 Fq12 buffer and return `a0 = 1` iff the accumulator is zero.
-/
import EvmAsm.Rv64.SAsm.Tactic
import EvmAsm.Codegen.Programs.Bls12Fq12
namespace EvmAsm.Codegen
open EvmAsm.Rv64 EvmAs... | /-
EvmAsm.Codegen.Programs.Bls12Fq12IsZeroSAsm
Verified SAsm port of `blq_is_zero`: OR the 72 64-bit limbs of a 576-byte
BLS12 Fq12 buffer and return `a0 = 1` iff the accumulator is zero.
-/
import EvmAsm.Rv64.SAsm.Tactic
import EvmAsm.Codegen.Programs.Bls12Fq12
namespace EvmAsm.Codegen
open EvmAsm.Rv64 EvmAs... | @@ -52,8 +52,15 @@
post := fun rf ws _ => rf.get .x10 = fq12IsZeroResult bs ∧ ws = []
body := blqIsZeroBody src bs
+private theorem idx_toNat (i : Nat) (hi : i < 72) :
+ (BitVec.ofNat 64 (8 * i)).toNat = 8 * i := by
+ rw [BitVec.toNat_ofNat]
+ omega
+
private theorem add_idx_sub_self (src : Word) (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_3c3cf86354cb_2 | 95715bebd47f4f25 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bls12Fq12IsZeroSAsm.lean | Bls12Fq12IsZeroSAsm | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "add_idx_sub_self",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [BitVec.toNat_sub, BitVec.toNat_add, idx_toNat i hi]\n omega",
"n_chars": 69,
"n_subproofs": 0,
"n_tactics... | [
{
"name": "idx_toNat",
"text": "private theorem idx_toNat (i : Nat) (hi : i < 72) :\n (BitVec.ofNat 64 (8 * i)).toNat = 8 * i := by\n rw [BitVec.toNat_ofNat]\n omega\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 137,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automa... | [
{
"name": "blqIsZeroFn_spec",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 104,
"n_chars": 4427,
"n_subproofs": 23,
"n_tactics": 102,
"cyclomatic": 8,
"n_automation": 22,
"n_rewrites": 34,
"n_structural": 26,
"automation_only": false,
"m... | 3 | /-
EvmAsm.Codegen.Programs.Bls12Fq12IsZeroSAsm
Verified SAsm port of `blq_is_zero`: OR the 72 64-bit limbs of a 576-byte
BLS12 Fq12 buffer and return `a0 = 1` iff the accumulator is zero.
-/
import EvmAsm.Rv64.SAsm.Tactic
import EvmAsm.Codegen.Programs.Bls12Fq12
namespace EvmAsm.Codegen
open EvmAsm.Rv64 EvmAs... | /-
EvmAsm.Codegen.Programs.Bls12Fq12IsZeroSAsm
Verified SAsm port of `blq_is_zero`: OR the 72 64-bit limbs of a 576-byte
BLS12 Fq12 buffer and return `a0 = 1` iff the accumulator is zero.
-/
import EvmAsm.Rv64.SAsm.Tactic
import EvmAsm.Codegen.Programs.Bls12Fq12
namespace EvmAsm.Codegen
open EvmAsm.Rv64 EvmAs... | @@ -52,8 +52,15 @@
post := fun rf ws _ => rf.get .x10 = fq12IsZeroResult bs ∧ ws = []
body := blqIsZeroBody src bs
+private theorem idx_toNat (i : Nat) (hi : i < 72) :
+ (BitVec.ofNat 64 (8 * i)).toNat = 8 * i := by
+ rw [BitVec.toNat_ofNat]
+ omega
+
private theorem add_idx_sub_self (src : Word) (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_0ca9ba6e821b_0 | c545fdf541e7e21b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2V4NoNopCallablePost.lean | FullPathN2V4NoNopCallablePost | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "evm_div_n2_stack_pre_to_unified_post_v4_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 101,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbnz' : b.getLimbN 0 ||| b.getLimbN 1 ||| b.getLimbN 2 ||| b.getLimbN 3 ≠ 0 :=\n (E... | [
{
"name": "loopN2UnifiedPostV4NoX1_to_fullDivN2DenormPreV4_frame_TTF",
"text": "theorem loopN2UnifiedPostV4NoX1_to_fullDivN2DenormPreV4_frame_TTF\n (sp base a0 a1 a2 a3 b0 b1 b2 b3 retMem dMem dloMem scratchUn0\n scratchMem raVal : Word)\n (h : PartialState)\n (hp :\n ((loopN2UnifiedPostV... | [
{
"name": "evm_div_n2_stack_pre_to_unified_post_v4_noNop",
"fan_in": 0,
"n_deps_direct": 8,
"n_deps_transitive": 8,
"n_lines": 624,
"n_chars": 35189,
"n_subproofs": 6,
"n_tactics": 106,
"cyclomatic": 12,
"n_automation": 11,
"n_rewrites": 4,
"n_structural": 18,
"au... | 8 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V4NoNopCallablePost
Bridge lemmas `loopN2UnifiedPostV4NoX1_to_fullDivN2DenormPreV4_frame_*` (8 cases)
plus the combined `evm_div_n2_stack_pre_to_unified_post_v4_noNop` theorem.
Mirrors `FullPathN3V4.lean:374-640` and `N3V4StackPre.lean:496-619` for n=2.
-/
import EvmAs... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V4NoNopCallablePost
Bridge lemmas `loopN2UnifiedPostV4NoX1_to_fullDivN2DenormPreV4_frame_*` (8 cases)
plus the combined `evm_div_n2_stack_pre_to_unified_post_v4_noNop` theorem.
Mirrors `FullPathN3V4.lean:374-640` and `N3V4StackPre.lean:496-619` for n=2.
-/
import EvmAs... | @@ -274,6 +274,48 @@
se12_32, se12_40, se12_48, se12_56] at hp ⊢
sep_perm hp
+theorem loopN2UnifiedPostV4NoX1_to_fullDivN2DenormPreV4_frame_TTF
+ (sp base a0 a1 a2 a3 b0 b1 b2 b3 retMem dMem dloMem scratchUn0
+ scratchMem raVal : Word)
+ (h : PartialState)
+ (hp :
+ ((loopN2UnifiedPostV4No... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_09f192fb9888_0 | 0a24c5a9398f0860 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/LogDataBridge.lean | LogDataBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "appendLogFromMemory_lastTopicCountOk",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [appendLogFromMemory, LogArgsBridge.appendLogFromArgs, mkLogEntryFromMemory]\n using mkLogEnt... | [
{
"name": "mkLogEntryFromMemoryTopicCountOk",
"text": "theorem mkLogEntryFromMemoryTopicCountOk\n (kind : LogArgsBridge.LogKind) (emitter : Address) (readByte : MemoryReader)\n (args : LogArgs)\n (h_topics : EvmAsm.Evm64.LogArgs.topicCountOk kind args) :\n (mkLogEntryFromMemory emitter readByte ... | [
{
"name": "appendLogFromMemory_lastTopicCountOk",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 556,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": t... | 1 | /-
EvmAsm.EL.LogDataBridge
Bridge from LOG stack arguments to event data bytes (GH #112).
-/
import EvmAsm.EL.LogArgsBridge
namespace EvmAsm.EL
namespace LogDataBridge
abbrev LogArgs := EvmAsm.Evm64.LogArgs.Args
abbrev MemoryReader := Nat → Byte
/-- First memory byte consumed as LOG event data. -/
def dataSta... | /-
EvmAsm.EL.LogDataBridge
Bridge from LOG stack arguments to event data bytes (GH #112).
-/
import EvmAsm.EL.LogArgsBridge
namespace EvmAsm.EL
namespace LogDataBridge
abbrev LogArgs := EvmAsm.Evm64.LogArgs.Args
abbrev MemoryReader := Nat → Byte
/-- First memory byte consumed as LOG event data. -/
def dataSta... | @@ -42,6 +42,14 @@
{ data := { offset := rangeOffset, size := 0 }, topics := topics } =
[] := rfl
+theorem mkLogEntryFromMemoryTopicCountOk
+ (kind : LogArgsBridge.LogKind) (emitter : Address) (readByte : MemoryReader)
+ (args : LogArgs)
+ (h_topics : EvmAsm.Evm64.LogArgs.topicCountOk kind ar... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9b44d3d6a235_0 | b48c97ddabd241ab | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerTable.lean | HandlerTable | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "dispatchOpcode?_setHandler_ne",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [dispatchOpcode?, setHandler_ne table handler h_ne]",
"n_chars": 62,
"n_subproofs": 0,
"n_ta... | [
{
"name": "setHandler_ne",
"text": "theorem setHandler_ne (table : HandlerTable) {opcode opcode' : EvmOpcode}\n (handler : OpcodeHandler) (h_ne : opcode' ≠ opcode) :\n setHandler table opcode handler opcode' = table opcode' := by\n simp [setHandler, h_ne]\n\n",
"fan_in": 1,
"n_lines": 6,
... | [
{
"name": "dispatchOpcode?_setHandler_ne",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 351,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 1 | /-
EvmAsm.Evm64.HandlerTable
Pure opcode-handler table surface for the interpreter layer (GH #107).
-/
import EvmAsm.Evm64.Gas
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
/-- A pure opcode handler transforms an abstract EVM interpreter state. -/
abbrev OpcodeHandler := EvmState → EvmState
/-- Partia... | /-
EvmAsm.Evm64.HandlerTable
Pure opcode-handler table surface for the interpreter layer (GH #107).
-/
import EvmAsm.Evm64.Gas
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
/-- A pure opcode handler transforms an abstract EVM interpreter state. -/
abbrev OpcodeHandler := EvmState → EvmState
/-- Partia... | @@ -56,6 +56,11 @@
setHandler table opcode handler opcode = some handler := by
simp [setHandler]
+theorem setHandler_ne (table : HandlerTable) {opcode opcode' : EvmOpcode}
+ (handler : OpcodeHandler) (h_ne : opcode' ≠ opcode) :
+ setHandler table opcode handler opcode' = table opcode' := by
+ simp [set... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9b44d3d6a235_1 | 17145ae6c90b6c65 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerTable.lean | HandlerTable | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "dispatchOpcode?_setHandler_ne",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [dispatchOpcode?, setHandler_ne table handler h_ne]",
"n_chars": 62,
"n_subproofs": 0,
"n_ta... | [
{
"name": "setHandler_ne",
"text": "theorem setHandler_ne (table : HandlerTable) {opcode opcode' : EvmOpcode}\n (handler : OpcodeHandler) (h_ne : opcode' ≠ opcode) :\n setHandler table opcode handler opcode' = table opcode' := by\n simp [setHandler, h_ne]\n\n",
"fan_in": 1,
"n_lines": 6,
... | [
{
"name": "dispatchOpcode_setHandler_ne",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 369,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 2 | /-
EvmAsm.Evm64.HandlerTable
Pure opcode-handler table surface for the interpreter layer (GH #107).
-/
import EvmAsm.Evm64.Gas
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
/-- A pure opcode handler transforms an abstract EVM interpreter state. -/
abbrev OpcodeHandler := EvmState → EvmState
/-- Partia... | /-
EvmAsm.Evm64.HandlerTable
Pure opcode-handler table surface for the interpreter layer (GH #107).
-/
import EvmAsm.Evm64.Gas
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
/-- A pure opcode handler transforms an abstract EVM interpreter state. -/
abbrev OpcodeHandler := EvmState → EvmState
/-- Partia... | @@ -56,6 +56,11 @@
setHandler table opcode handler opcode = some handler := by
simp [setHandler]
+theorem setHandler_ne (table : HandlerTable) {opcode opcode' : EvmOpcode}
+ (handler : OpcodeHandler) (h_ne : opcode' ≠ opcode) :
+ setHandler table opcode handler opcode' = table opcode' := by
+ simp [set... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9b44d3d6a235_2 | ca2a08d2716898f7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerTable.lean | HandlerTable | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "dispatchOpcode_some",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [dispatchOpcode, dispatchOpcode?_some h_lookup]",
"n_chars": 58,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "dispatchOpcode?_some",
"text": "theorem dispatchOpcode?_some {table : HandlerTable} {opcode : EvmOpcode}\n {handler : OpcodeHandler} (h_lookup : table opcode = some handler)\n (state : EvmState) :\n dispatchOpcode? table opcode state = some (handler state) := by\n simp [dispatchOpcode?,... | [
{
"name": "dispatchOpcode_some",
"fan_in": 5,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 284,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nest... | 1 | /-
EvmAsm.Evm64.HandlerTable
Pure opcode-handler table surface for the interpreter layer (GH #107).
-/
import EvmAsm.Evm64.Gas
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
/-- A pure opcode handler transforms an abstract EVM interpreter state. -/
abbrev OpcodeHandler := EvmState → EvmState
/-- Partia... | /-
EvmAsm.Evm64.HandlerTable
Pure opcode-handler table surface for the interpreter layer (GH #107).
-/
import EvmAsm.Evm64.Gas
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
/-- A pure opcode handler transforms an abstract EVM interpreter state. -/
abbrev OpcodeHandler := EvmState → EvmState
/-- Partia... | @@ -68,10 +68,17 @@
handler state := by
simp [dispatchOpcode]
+theorem dispatchOpcode?_some {table : HandlerTable} {opcode : EvmOpcode}
+ {handler : OpcodeHandler} (h_lookup : table opcode = some handler)
+ (state : EvmState) :
+ dispatchOpcode? table opcode state = some (handler state) := by
+ 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_9b44d3d6a235_3 | 00b384e7aaaf7af9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerTable.lean | HandlerTable | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "dispatchOpcode_some_status",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatchOpcode_some h_lookup state]",
"n_chars": 45,
"n_subproofs": 0,
"n_tactics": 2,
"cycl... | [
{
"name": "dispatchOpcode_some",
"text": "theorem dispatchOpcode_some {table : HandlerTable} {opcode : EvmOpcode}\n {handler : OpcodeHandler} (h_lookup : table opcode = some handler)\n (state : EvmState) :\n dispatchOpcode table opcode state = handler state := by\n simp [dispatchOpcode, dispatchOp... | [
{
"name": "dispatchOpcode_some_status",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 296,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"... | 2 | /-
EvmAsm.Evm64.HandlerTable
Pure opcode-handler table surface for the interpreter layer (GH #107).
-/
import EvmAsm.Evm64.Gas
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
/-- A pure opcode handler transforms an abstract EVM interpreter state. -/
abbrev OpcodeHandler := EvmState → EvmState
/-- Partia... | /-
EvmAsm.Evm64.HandlerTable
Pure opcode-handler table surface for the interpreter layer (GH #107).
-/
import EvmAsm.Evm64.Gas
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
/-- A pure opcode handler transforms an abstract EVM interpreter state. -/
abbrev OpcodeHandler := EvmState → EvmState
/-- Partia... | @@ -74,10 +74,17 @@
dispatchOpcode? table opcode state = some (handler state) := by
simp [dispatchOpcode?, h_lookup]
+theorem dispatchOpcode_some {table : HandlerTable} {opcode : EvmOpcode}
+ {handler : OpcodeHandler} (h_lookup : table opcode = some handler)
+ (state : EvmState) :
+ dispatchOpcode ta... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9b44d3d6a235_4 | 6ccc16c19fbe6c2f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerTable.lean | HandlerTable | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "dispatchOpcode_some_status",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatchOpcode_some h_lookup state]",
"n_chars": 45,
"n_subproofs": 0,
"n_tactics": 2,
"cycl... | [
{
"name": "dispatchOpcode_some",
"text": "theorem dispatchOpcode_some {table : HandlerTable} {opcode : EvmOpcode}\n {handler : OpcodeHandler} (h_lookup : table opcode = some handler)\n (state : EvmState) :\n dispatchOpcode table opcode state = handler state := by\n simp [dispatchOpcode, dispatchOp... | [
{
"name": "dispatchOpcode_some_pc",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 284,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_... | 2 | /-
EvmAsm.Evm64.HandlerTable
Pure opcode-handler table surface for the interpreter layer (GH #107).
-/
import EvmAsm.Evm64.Gas
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
/-- A pure opcode handler transforms an abstract EVM interpreter state. -/
abbrev OpcodeHandler := EvmState → EvmState
/-- Partia... | /-
EvmAsm.Evm64.HandlerTable
Pure opcode-handler table surface for the interpreter layer (GH #107).
-/
import EvmAsm.Evm64.Gas
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
/-- A pure opcode handler transforms an abstract EVM interpreter state. -/
abbrev OpcodeHandler := EvmState → EvmState
/-- Partia... | @@ -74,10 +74,17 @@
dispatchOpcode? table opcode state = some (handler state) := by
simp [dispatchOpcode?, h_lookup]
+theorem dispatchOpcode_some {table : HandlerTable} {opcode : EvmOpcode}
+ {handler : OpcodeHandler} (h_lookup : table opcode = some handler)
+ (state : EvmState) :
+ dispatchOpcode ta... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9b44d3d6a235_5 | bd4087dee3b0d1a7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerTable.lean | HandlerTable | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "dispatchOpcode_some_status",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatchOpcode_some h_lookup state]",
"n_chars": 45,
"n_subproofs": 0,
"n_tactics": 2,
"cycl... | [
{
"name": "dispatchOpcode_some",
"text": "theorem dispatchOpcode_some {table : HandlerTable} {opcode : EvmOpcode}\n {handler : OpcodeHandler} (h_lookup : table opcode = some handler)\n (state : EvmState) :\n dispatchOpcode table opcode state = handler state := by\n simp [dispatchOpcode, dispatchOp... | [
{
"name": "dispatchOpcode_some_gas",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 287,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max... | 2 | /-
EvmAsm.Evm64.HandlerTable
Pure opcode-handler table surface for the interpreter layer (GH #107).
-/
import EvmAsm.Evm64.Gas
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
/-- A pure opcode handler transforms an abstract EVM interpreter state. -/
abbrev OpcodeHandler := EvmState → EvmState
/-- Partia... | /-
EvmAsm.Evm64.HandlerTable
Pure opcode-handler table surface for the interpreter layer (GH #107).
-/
import EvmAsm.Evm64.Gas
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
/-- A pure opcode handler transforms an abstract EVM interpreter state. -/
abbrev OpcodeHandler := EvmState → EvmState
/-- Partia... | @@ -74,10 +74,17 @@
dispatchOpcode? table opcode state = some (handler state) := by
simp [dispatchOpcode?, h_lookup]
+theorem dispatchOpcode_some {table : HandlerTable} {opcode : EvmOpcode}
+ {handler : OpcodeHandler} (h_lookup : table opcode = some handler)
+ (state : EvmState) :
+ dispatchOpcode ta... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9b44d3d6a235_6 | 722922d74bfb2979 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerTable.lean | HandlerTable | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "dispatchOpcode_some_status",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatchOpcode_some h_lookup state]",
"n_chars": 45,
"n_subproofs": 0,
"n_tactics": 2,
"cycl... | [
{
"name": "dispatchOpcode_some",
"text": "theorem dispatchOpcode_some {table : HandlerTable} {opcode : EvmOpcode}\n {handler : OpcodeHandler} (h_lookup : table opcode = some handler)\n (state : EvmState) :\n dispatchOpcode table opcode state = handler state := by\n simp [dispatchOpcode, dispatchOp... | [
{
"name": "dispatchOpcode_some_stack",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 293,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"m... | 2 | /-
EvmAsm.Evm64.HandlerTable
Pure opcode-handler table surface for the interpreter layer (GH #107).
-/
import EvmAsm.Evm64.Gas
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
/-- A pure opcode handler transforms an abstract EVM interpreter state. -/
abbrev OpcodeHandler := EvmState → EvmState
/-- Partia... | /-
EvmAsm.Evm64.HandlerTable
Pure opcode-handler table surface for the interpreter layer (GH #107).
-/
import EvmAsm.Evm64.Gas
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
/-- A pure opcode handler transforms an abstract EVM interpreter state. -/
abbrev OpcodeHandler := EvmState → EvmState
/-- Partia... | @@ -74,10 +74,17 @@
dispatchOpcode? table opcode state = some (handler state) := by
simp [dispatchOpcode?, h_lookup]
+theorem dispatchOpcode_some {table : HandlerTable} {opcode : EvmOpcode}
+ {handler : OpcodeHandler} (h_lookup : table opcode = some handler)
+ (state : EvmState) :
+ dispatchOpcode ta... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9b44d3d6a235_7 | ae1680a0c7983ad5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerTable.lean | HandlerTable | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "dispatchOpcode_some_status",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatchOpcode_some h_lookup state]",
"n_chars": 45,
"n_subproofs": 0,
"n_tactics": 2,
"cycl... | [
{
"name": "dispatchOpcode_some",
"text": "theorem dispatchOpcode_some {table : HandlerTable} {opcode : EvmOpcode}\n {handler : OpcodeHandler} (h_lookup : table opcode = some handler)\n (state : EvmState) :\n dispatchOpcode table opcode state = handler state := by\n simp [dispatchOpcode, dispatchOp... | [
{
"name": "dispatchOpcode_some_preserves_status",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 10,
"n_chars": 407,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": f... | 3 | /-
EvmAsm.Evm64.HandlerTable
Pure opcode-handler table surface for the interpreter layer (GH #107).
-/
import EvmAsm.Evm64.Gas
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
/-- A pure opcode handler transforms an abstract EVM interpreter state. -/
abbrev OpcodeHandler := EvmState → EvmState
/-- Partia... | /-
EvmAsm.Evm64.HandlerTable
Pure opcode-handler table surface for the interpreter layer (GH #107).
-/
import EvmAsm.Evm64.Gas
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
/-- A pure opcode handler transforms an abstract EVM interpreter state. -/
abbrev OpcodeHandler := EvmState → EvmState
/-- Partia... | @@ -74,10 +74,17 @@
dispatchOpcode? table opcode state = some (handler state) := by
simp [dispatchOpcode?, h_lookup]
+theorem dispatchOpcode_some {table : HandlerTable} {opcode : EvmOpcode}
+ {handler : OpcodeHandler} (h_lookup : table opcode = some handler)
+ (state : EvmState) :
+ dispatchOpcode ta... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9b44d3d6a235_8 | e9df935f6bc2fd8a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerTable.lean | HandlerTable | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "dispatchOpcode_some_status",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatchOpcode_some h_lookup state]",
"n_chars": 45,
"n_subproofs": 0,
"n_tactics": 2,
"cycl... | [
{
"name": "dispatchOpcode_some",
"text": "theorem dispatchOpcode_some {table : HandlerTable} {opcode : EvmOpcode}\n {handler : OpcodeHandler} (h_lookup : table opcode = some handler)\n (state : EvmState) :\n dispatchOpcode table opcode state = handler state := by\n simp [dispatchOpcode, dispatchOp... | [
{
"name": "dispatchOpcode_some_preserves_codeLenMatches",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 468,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_... | 2 | /-
EvmAsm.Evm64.HandlerTable
Pure opcode-handler table surface for the interpreter layer (GH #107).
-/
import EvmAsm.Evm64.Gas
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
/-- A pure opcode handler transforms an abstract EVM interpreter state. -/
abbrev OpcodeHandler := EvmState → EvmState
/-- Partia... | /-
EvmAsm.Evm64.HandlerTable
Pure opcode-handler table surface for the interpreter layer (GH #107).
-/
import EvmAsm.Evm64.Gas
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
/-- A pure opcode handler transforms an abstract EVM interpreter state. -/
abbrev OpcodeHandler := EvmState → EvmState
/-- Partia... | @@ -74,13 +74,21 @@
dispatchOpcode? table opcode state = some (handler state) := by
simp [dispatchOpcode?, h_lookup]
+theorem dispatchOpcode_some {table : HandlerTable} {opcode : EvmOpcode}
+ {handler : OpcodeHandler} (h_lookup : table opcode = some handler)
+ (state : EvmState) :
+ dispatchOpcode ta... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9b44d3d6a235_9 | 4bc13030ab0bf256 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerTable.lean | HandlerTable | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "dispatchOpcode_none",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [dispatchOpcode, dispatchOpcode?_none h_lookup]",
"n_chars": 58,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "dispatchOpcode?_none",
"text": "theorem dispatchOpcode?_none {table : HandlerTable} {opcode : EvmOpcode}\n (h_lookup : table opcode = none) (state : EvmState) :\n dispatchOpcode? table opcode state = none := by\n simp [dispatchOpcode?, h_lookup]\n\n",
"fan_in": 1,
"n_lines": 6,
... | [
{
"name": "dispatchOpcode_none",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 246,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nest... | 1 | /-
EvmAsm.Evm64.HandlerTable
Pure opcode-handler table surface for the interpreter layer (GH #107).
-/
import EvmAsm.Evm64.Gas
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
/-- A pure opcode handler transforms an abstract EVM interpreter state. -/
abbrev OpcodeHandler := EvmState → EvmState
/-- Partia... | /-
EvmAsm.Evm64.HandlerTable
Pure opcode-handler table surface for the interpreter layer (GH #107).
-/
import EvmAsm.Evm64.Gas
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
/-- A pure opcode handler transforms an abstract EVM interpreter state. -/
abbrev OpcodeHandler := EvmState → EvmState
/-- Partia... | @@ -68,9 +68,15 @@
handler state := by
simp [dispatchOpcode]
+theorem dispatchOpcode?_none {table : HandlerTable} {opcode : EvmOpcode}
+ (h_lookup : table opcode = none) (state : EvmState) :
+ dispatchOpcode? table opcode state = none := by
+ simp [dispatchOpcode?, h_lookup]
+
theorem dispatchOpcode... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9b44d3d6a235_10 | 8f7524ed3168dc6a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerTable.lean | HandlerTable | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "dispatchOpcode_none",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [dispatchOpcode, dispatchOpcode?_none h_lookup]",
"n_chars": 58,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "dispatchOpcode?_none",
"text": "theorem dispatchOpcode?_none {table : HandlerTable} {opcode : EvmOpcode}\n (h_lookup : table opcode = none) (state : EvmState) :\n dispatchOpcode? table opcode state = none := by\n simp [dispatchOpcode?, h_lookup]\n\n",
"fan_in": 1,
"n_lines": 6,
... | [
{
"name": "dispatchOpcode_none_status",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 280,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"... | 2 | /-
EvmAsm.Evm64.HandlerTable
Pure opcode-handler table surface for the interpreter layer (GH #107).
-/
import EvmAsm.Evm64.Gas
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
/-- A pure opcode handler transforms an abstract EVM interpreter state. -/
abbrev OpcodeHandler := EvmState → EvmState
/-- Partia... | /-
EvmAsm.Evm64.HandlerTable
Pure opcode-handler table surface for the interpreter layer (GH #107).
-/
import EvmAsm.Evm64.Gas
import EvmAsm.Evm64.Termination
namespace EvmAsm.Evm64
/-- A pure opcode handler transforms an abstract EVM interpreter state. -/
abbrev OpcodeHandler := EvmState → EvmState
/-- Partia... | @@ -68,9 +68,15 @@
handler state := by
simp [dispatchOpcode]
+theorem dispatchOpcode?_none {table : HandlerTable} {opcode : EvmOpcode}
+ (h_lookup : table opcode = none) (state : EvmState) :
+ dispatchOpcode? table opcode state = none := by
+ simp [dispatchOpcode?, h_lookup]
+
theorem dispatchOpcode... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2282df5aee88_0 | d0704d355bd44126 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/BzeroV5CallableExact.lean | BzeroV5CallableExact | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_div_bzero_stack_spec_noNop_v5_preNoX1_callableExactFrame",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hcore :=\n evm_div_bzero_stack_spec_within_dispatch_noNop_v5_concrete... | [
{
"name": "evm_div_bzero_stack_spec_within_dispatch_noNop_v5_concrete_callable_uni",
"text": "/-- v5 zero-divisor DIV dispatcher in the concrete callable post shape (no-X1\n pre, `divConcretePostNoX1Frame` post), over `divCode_noNop_v5`. Verbatim\n mirror of `evm_div_bzero_stack_spec_within_dispatch_... | [
{
"name": "evm_div_bzero_stack_spec_noNop_v5_preNoX1_callableExactFrame",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 37,
"n_chars": 1628,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.BzeroV5CallableExact
Zero-divisor (b = 0) v5 DIV callable-ExactFrame lane — the `lane_bzero`
hypothesis of the 5-lane callable scaffold
`evm_div_stack_spec_unconditional_of_lanes_v5_div_callableExact`.
Mirrors the proven v4 lane (`Spec/UnifiedBzero.lean` /
`Spec/BzeroV4ExactFra... | /-
EvmAsm.Evm64.DivMod.Spec.BzeroV5CallableExact
Zero-divisor (b = 0) v5 DIV callable-ExactFrame lane — the `lane_bzero`
hypothesis of the 5-lane callable scaffold
`evm_div_stack_spec_unconditional_of_lanes_v5_div_callableExact`.
Mirrors the proven v4 lane (`Spec/UnifiedBzero.lean` /
`Spec/BzeroV4ExactFra... | @@ -26,6 +26,54 @@
open EvmAsm.Rv64
+/-- v5 zero-divisor DIV dispatcher in the concrete callable post shape (no-X1
+ pre, `divConcretePostNoX1Frame` post), over `divCode_noNop_v5`. Verbatim
+ mirror of `evm_div_bzero_stack_spec_within_dispatch_noNop_v4_concrete_callable_uni`
+ over the v5 body. -/
+theor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8fb213ab6e1e_0 | 5747ae63e118a5b5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/CallingConvention.lean | CallingConvention | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "ret_spec_within'",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := ret_spec_within base ra_val\n simp only [signExtend12_0] at h\n rw [show ra_val + (0 : Word) = ra_val from by ... | [
{
"name": "ret_spec_within",
"text": "/-- Return: JALR x0, x1, 0.\n Jumps to (ra + 0) &&& ~1. Preserves ra in x1. -/\ntheorem ret_spec_within (base : Word) (ra_val : Word) :\n cpsTripleWithin 1 base ((ra_val + signExtend12 0) &&& ~~~1)\n (CodeReq.singleton base (.JALR .x0 .x1 0))\n (.x1 ↦ᵣ r... | [
{
"name": "ret_spec_within'",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 614,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 1 | /-
EvmAsm.Evm64.CallingConvention
LP64-aligned calling convention for RISC-V RV64IM, adapted to the
x0–x12 register subset used by this project.
Register conventions (per zkvm-standards LP64):
x0 (zero) — hardwired zero
x1 (ra) — return address (caller-saved)
x2 (sp) — call stack pointer, g... | /-
EvmAsm.Evm64.CallingConvention
LP64-aligned calling convention for RISC-V RV64IM, adapted to the
x0–x12 register subset used by this project.
Register conventions (per zkvm-standards LP64):
x0 (zero) — hardwired zero
x1 (ra) — return address (caller-saved)
x2 (sp) — call stack pointer, g... | @@ -60,12 +60,25 @@
-- Call / return specs
-- ============================================================================
+/-- Return: JALR x0, x1, 0.
+ Jumps to (ra + 0) &&& ~1. Preserves ra in x1. -/
+theorem ret_spec_within (base : Word) (ra_val : Word) :
+ cpsTripleWithin 1 base ((ra_val + signExtend12 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_8fb213ab6e1e_1 | fd182cba7d89fe21 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/CallingConvention.lean | CallingConvention | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "ret_spec_within'",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := ret_spec_within base ra_val\n simp only [signExtend12_0] at h\n rw [show ra_val + (0 : Word) = ra_val from by ... | [
{
"name": "ret_spec_within",
"text": "/-- Return: JALR x0, x1, 0.\n Jumps to (ra + 0) &&& ~1. Preserves ra in x1. -/\ntheorem ret_spec_within (base : Word) (ra_val : Word) :\n cpsTripleWithin 1 base ((ra_val + signExtend12 0) &&& ~~~1)\n (CodeReq.singleton base (.JALR .x0 .x1 0))\n (.x1 ↦ᵣ r... | [
{
"name": "cc_epilogue_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 24,
"n_chars": 1302,
"n_subproofs": 3,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"m... | 2 | /-
EvmAsm.Evm64.CallingConvention
LP64-aligned calling convention for RISC-V RV64IM, adapted to the
x0–x12 register subset used by this project.
Register conventions (per zkvm-standards LP64):
x0 (zero) — hardwired zero
x1 (ra) — return address (caller-saved)
x2 (sp) — call stack pointer, g... | /-
EvmAsm.Evm64.CallingConvention
LP64-aligned calling convention for RISC-V RV64IM, adapted to the
x0–x12 register subset used by this project.
Register conventions (per zkvm-standards LP64):
x0 (zero) — hardwired zero
x1 (ra) — return address (caller-saved)
x2 (sp) — call stack pointer, g... | @@ -60,12 +60,25 @@
-- Call / return specs
-- ============================================================================
+/-- Return: JALR x0, x1, 0.
+ Jumps to (ra + 0) &&& ~1. Preserves ra in x1. -/
+theorem ret_spec_within (base : Word) (ra_val : Word) :
+ cpsTripleWithin 1 base ((ra_val + signExtend12 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_9c133637208c_0 | 033e08a35a757cfd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductAlgebra.lean | ProductAlgebra | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 4 | [
{
"theorem_name": "productLimb_four_eq_mulHigh_getLimb_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact productLimb_high_eq_mulHigh_getLimb a b 0",
"n_chars": 53,
"n_subproofs": 0,
"n_... | [
{
"name": "productLimb_high_eq_mulHigh_getLimb",
"text": "/-- High limbs of the 512-bit product agree with the limbs of `mulHigh`. -/\nprivate theorem productLimb_high_eq_mulHigh_getLimb (a b : EvmWord) (i : Fin 4) :\n productLimb a b (i.val + 4) = (EvmWord.mulHigh a b).getLimb i := by\n apply BitVec.eq... | [
{
"name": "productLimb_four_eq_mulHigh_getLimb_zero",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 188,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only"... | 1 | /-
EvmAsm.Evm64.MulMod.ProductAlgebra
Pure model for the eight-limb 512-bit product produced by
`evm_mulmod_product_layout`.
This file is intentionally only the foundation for the later algebra bridge:
it fixes the little-endian product-limb order and the concrete product-window
offsets used by the runtim... | /-
EvmAsm.Evm64.MulMod.ProductAlgebra
Pure model for the eight-limb 512-bit product produced by
`evm_mulmod_product_layout`.
This file is intentionally only the foundation for the later algebra bridge:
it fixes the little-endian product-limb order and the concrete product-window
offsets used by the runtim... | @@ -119,17 +119,34 @@
productLimb a b 7] := by
rfl
+/-- High limbs of the 512-bit product agree with the limbs of `mulHigh`. -/
+private theorem productLimb_high_eq_mulHigh_getLimb (a b : EvmWord) (i : Fin 4) :
+ productLimb a b (i.val + 4) = (EvmWord.mulHigh a b).getLimb i := by
+ apply BitVec.eq_of_t... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9c133637208c_1 | 55d5b5d471b72eb0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductAlgebra.lean | ProductAlgebra | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 4 | [
{
"theorem_name": "productLimb_zero_eq_mul_getLimb",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact productLimb_low_eq_getLimb a b 0",
"n_chars": 44,
"n_subproofs": 0,
"n_tactics": 2,
"... | [
{
"name": "productLimb_low_eq_getLimb",
"text": "/-- Low limbs of the 512-bit product agree with the corresponding limbs of the\n truncated 256-bit EVM multiplication. -/\nprivate theorem productLimb_low_eq_getLimb (a b : EvmWord) (i : Fin 4) :\n productLimb a b i.val = (a * b).getLimb i := by\n appl... | [
{
"name": "productLimb_zero_eq_mul_getLimb",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.MulMod.ProductAlgebra
Pure model for the eight-limb 512-bit product produced by
`evm_mulmod_product_layout`.
This file is intentionally only the foundation for the later algebra bridge:
it fixes the little-endian product-limb order and the concrete product-window
offsets used by the runtim... | /-
EvmAsm.Evm64.MulMod.ProductAlgebra
Pure model for the eight-limb 512-bit product produced by
`evm_mulmod_product_layout`.
This file is intentionally only the foundation for the later algebra bridge:
it fixes the little-endian product-limb order and the concrete product-window
offsets used by the runtim... | @@ -212,17 +212,43 @@
(productHighLimbs a b)[3] = (EvmWord.mulHigh a b).getLimbN 3 := by
simp [productHighLimbs, EvmWord.getLimb_as_getLimbN_3]
+/-- Low limbs of the 512-bit product agree with the corresponding limbs of the
+ truncated 256-bit EVM multiplication. -/
+private theorem productLimb_low_eq_getL... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9c133637208c_2 | 21508ee8d6d91e56 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductAlgebra.lean | ProductAlgebra | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 4 | [
{
"theorem_name": "productLimb_zero_eq_mul_getLimb",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact productLimb_low_eq_getLimb a b 0",
"n_chars": 44,
"n_subproofs": 0,
"n_tactics": 2,
"... | [
{
"name": "productLimb_low_eq_getLimb",
"text": "/-- Low limbs of the 512-bit product agree with the corresponding limbs of the\n truncated 256-bit EVM multiplication. -/\nprivate theorem productLimb_low_eq_getLimb (a b : EvmWord) (i : Fin 4) :\n productLimb a b i.val = (a * b).getLimb i := by\n appl... | [
{
"name": "productLimb_one_eq_mul_correct_limb1",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 440,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": f... | 1 | /-
EvmAsm.Evm64.MulMod.ProductAlgebra
Pure model for the eight-limb 512-bit product produced by
`evm_mulmod_product_layout`.
This file is intentionally only the foundation for the later algebra bridge:
it fixes the little-endian product-limb order and the concrete product-window
offsets used by the runtim... | /-
EvmAsm.Evm64.MulMod.ProductAlgebra
Pure model for the eight-limb 512-bit product produced by
`evm_mulmod_product_layout`.
This file is intentionally only the foundation for the later algebra bridge:
it fixes the little-endian product-limb order and the concrete product-window
offsets used by the runtim... | @@ -212,17 +212,43 @@
(productHighLimbs a b)[3] = (EvmWord.mulHigh a b).getLimbN 3 := by
simp [productHighLimbs, EvmWord.getLimb_as_getLimbN_3]
+/-- Low limbs of the 512-bit product agree with the corresponding limbs of the
+ truncated 256-bit EVM multiplication. -/
+private theorem productLimb_low_eq_getL... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9c133637208c_3 | 5c303bd7a95074b1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductAlgebra.lean | ProductAlgebra | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 4 | [
{
"theorem_name": "productLimb_zero_eq_mul_getLimb",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact productLimb_low_eq_getLimb a b 0",
"n_chars": 44,
"n_subproofs": 0,
"n_tactics": 2,
"... | [
{
"name": "productLimb_low_eq_getLimb",
"text": "/-- Low limbs of the 512-bit product agree with the corresponding limbs of the\n truncated 256-bit EVM multiplication. -/\nprivate theorem productLimb_low_eq_getLimb (a b : EvmWord) (i : Fin 4) :\n productLimb a b i.val = (a * b).getLimb i := by\n appl... | [
{
"name": "productLimb_two_eq_mul_correct_limb2",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 25,
"n_chars": 953,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": f... | 1 | /-
EvmAsm.Evm64.MulMod.ProductAlgebra
Pure model for the eight-limb 512-bit product produced by
`evm_mulmod_product_layout`.
This file is intentionally only the foundation for the later algebra bridge:
it fixes the little-endian product-limb order and the concrete product-window
offsets used by the runtim... | /-
EvmAsm.Evm64.MulMod.ProductAlgebra
Pure model for the eight-limb 512-bit product produced by
`evm_mulmod_product_layout`.
This file is intentionally only the foundation for the later algebra bridge:
it fixes the little-endian product-limb order and the concrete product-window
offsets used by the runtim... | @@ -212,17 +212,43 @@
(productHighLimbs a b)[3] = (EvmWord.mulHigh a b).getLimbN 3 := by
simp [productHighLimbs, EvmWord.getLimb_as_getLimbN_3]
+/-- Low limbs of the 512-bit product agree with the corresponding limbs of the
+ truncated 256-bit EVM multiplication. -/
+private theorem productLimb_low_eq_getL... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9c133637208c_4 | c68e12cdf2391207 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductAlgebra.lean | ProductAlgebra | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 4 | [
{
"theorem_name": "productLimb_zero_eq_mul_getLimb",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact productLimb_low_eq_getLimb a b 0",
"n_chars": 44,
"n_subproofs": 0,
"n_tactics": 2,
"... | [
{
"name": "productLimb_low_eq_getLimb",
"text": "/-- Low limbs of the 512-bit product agree with the corresponding limbs of the\n truncated 256-bit EVM multiplication. -/\nprivate theorem productLimb_low_eq_getLimb (a b : EvmWord) (i : Fin 4) :\n productLimb a b i.val = (a * b).getLimb i := by\n appl... | [
{
"name": "productLimb_three_eq_mul_correct_limb3",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 40,
"n_chars": 1634,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only"... | 1 | /-
EvmAsm.Evm64.MulMod.ProductAlgebra
Pure model for the eight-limb 512-bit product produced by
`evm_mulmod_product_layout`.
This file is intentionally only the foundation for the later algebra bridge:
it fixes the little-endian product-limb order and the concrete product-window
offsets used by the runtim... | /-
EvmAsm.Evm64.MulMod.ProductAlgebra
Pure model for the eight-limb 512-bit product produced by
`evm_mulmod_product_layout`.
This file is intentionally only the foundation for the later algebra bridge:
it fixes the little-endian product-limb order and the concrete product-window
offsets used by the runtim... | @@ -212,17 +212,43 @@
(productHighLimbs a b)[3] = (EvmWord.mulHigh a b).getLimbN 3 := by
simp [productHighLimbs, EvmWord.getLimb_as_getLimbN_3]
+/-- Low limbs of the 512-bit product agree with the corresponding limbs of the
+ truncated 256-bit EVM multiplication. -/
+private theorem productLimb_low_eq_getL... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_051e21ba513b_0 | 763f28242859763d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Multiply/Callable.lean | Callable | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "mul_callable_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mul_callable_length]",
"n_chars": 30,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"... | [
{
"name": "mul_callable_length",
"text": "/-- 63 (`evm_mul`) + 1 (`cc_ret`) = 64 instructions. -/\ntheorem mul_callable_length : mul_callable.length = 64 := by decide\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 125,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation... | [
{
"name": "mul_callable_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 282,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"ma... | 1 | /-
EvmAsm.Evm64.Multiply.Callable
LP64-callable shim around `evm_mul`.
The base `evm_mul` program (`Multiply/Program.lean`) ends in an `ADDI` that
advances the EVM stack pointer; it does not return to the caller. To invoke
it via `JAL x1, …` from a non-leaf function (e.g. the upcoming EXP opcode
per `docs... | /-
EvmAsm.Evm64.Multiply.Callable
LP64-callable shim around `evm_mul`.
The base `evm_mul` program (`Multiply/Program.lean`) ends in an `ADDI` that
advances the EVM stack pointer; it does not return to the caller. To invoke
it via `JAL x1, …` from a non-leaf function (e.g. the upcoming EXP opcode
per `docs... | @@ -41,8 +41,12 @@
`JAL x1, mul_callable` get control back via `JALR x0, x1, 0`. -/
def mul_callable : Program := evm_mul ;; cc_ret
-theorem mul_callable_byte_length : 4 * mul_callable.length = 256 := sorry
+/-- 63 (`evm_mul`) + 1 (`cc_ret`) = 64 instructions. -/
+theorem mul_callable_length : mul_callable.leng... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_051e21ba513b_1 | f852ba2ef2ce7231 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Multiply/Callable.lean | Callable | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "mul_callable_code_eq_ofProg",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mul_callable_code mul_callable cc_ret_code\n rw [evm_mul_code_eq_ofProg]\n unfold seq\n symm\n have... | [
{
"name": "mul_callable_ret_byte_off",
"text": "theorem mul_callable_ret_byte_off : 4 * (evm_mul).length = 252 := by\n decide\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 79,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structu... | [
{
"name": "mul_callable_code_eq_ofProg",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 722,
"n_subproofs": 1,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 5,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.Multiply.Callable
LP64-callable shim around `evm_mul`.
The base `evm_mul` program (`Multiply/Program.lean`) ends in an `ADDI` that
advances the EVM stack pointer; it does not return to the caller. To invoke
it via `JAL x1, …` from a non-leaf function (e.g. the upcoming EXP opcode
per `docs... | /-
EvmAsm.Evm64.Multiply.Callable
LP64-callable shim around `evm_mul`.
The base `evm_mul` program (`Multiply/Program.lean`) ends in an `ADDI` that
advances the EVM stack pointer; it does not return to the caller. To invoke
it via `JAL x1, …` from a non-leaf function (e.g. the upcoming EXP opcode
per `docs... | @@ -41,6 +41,9 @@
`JAL x1, mul_callable` get control back via `JALR x0, x1, 0`. -/
def mul_callable : Program := evm_mul ;; cc_ret
+theorem mul_callable_ret_byte_off : 4 * (evm_mul).length = 252 := by
+ decide
+
/-- CodeReq for the full callable shim: union of `evm_mul_code` at `base`
with `cc_ret_code` ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_051e21ba513b_2 | 489640cface5ff89 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Multiply/Callable.lean | Callable | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "mul_callable_code_ret_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mul_callable_code\n apply CodeReq.mono_union_right (mul_callable_codes_disjoint base)\n intro a i h\n e... | [
{
"name": "mul_callable_codes_disjoint",
"text": "private theorem mul_callable_codes_disjoint (base : Word) :\n (evm_mul_code base).Disjoint (cc_ret_code (base + 252)) := by\n unfold evm_mul_code mul_col0_code mul_col1_code mul_col2_code mul_col3_code\n cc_ret_code cc_ret\n unfold mul_col0 mul_... | [
{
"name": "mul_callable_code_ret_sub",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 451,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"... | 1 | /-
EvmAsm.Evm64.Multiply.Callable
LP64-callable shim around `evm_mul`.
The base `evm_mul` program (`Multiply/Program.lean`) ends in an `ADDI` that
advances the EVM stack pointer; it does not return to the caller. To invoke
it via `JAL x1, …` from a non-leaf function (e.g. the upcoming EXP opcode
per `docs... | /-
EvmAsm.Evm64.Multiply.Callable
LP64-callable shim around `evm_mul`.
The base `evm_mul` program (`Multiply/Program.lean`) ends in an `ADDI` that
advances the EVM stack pointer; it does not return to the caller. To invoke
it via `JAL x1, …` from a non-leaf function (e.g. the upcoming EXP opcode
per `docs... | @@ -47,9 +47,20 @@
abbrev mul_callable_code (base : Word) : CodeReq :=
CodeReq.union (evm_mul_code base) (cc_ret_code (base + 252))
+private theorem mul_callable_codes_disjoint (base : Word) :
+ (evm_mul_code base).Disjoint (cc_ret_code (base + 252)) := by
+ unfold evm_mul_code mul_col0_code mul_col1_code mul... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_051e21ba513b_3 | 774a7c8b48f345b8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Multiply/Callable.lean | Callable | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "mul_callable_code_ret_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mul_callable_code\n apply CodeReq.mono_union_right (mul_callable_codes_disjoint base)\n intro a i h\n e... | [
{
"name": "mul_callable_codes_disjoint",
"text": "private theorem mul_callable_codes_disjoint (base : Word) :\n (evm_mul_code base).Disjoint (cc_ret_code (base + 252)) := by\n unfold evm_mul_code mul_col0_code mul_col1_code mul_col2_code mul_col3_code\n cc_ret_code cc_ret\n unfold mul_col0 mul_... | [
{
"name": "mul_callable_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 37,
"n_chars": 1897,
"n_subproofs": 7,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.Multiply.Callable
LP64-callable shim around `evm_mul`.
The base `evm_mul` program (`Multiply/Program.lean`) ends in an `ADDI` that
advances the EVM stack pointer; it does not return to the caller. To invoke
it via `JAL x1, …` from a non-leaf function (e.g. the upcoming EXP opcode
per `docs... | /-
EvmAsm.Evm64.Multiply.Callable
LP64-callable shim around `evm_mul`.
The base `evm_mul` program (`Multiply/Program.lean`) ends in an `ADDI` that
advances the EVM stack pointer; it does not return to the caller. To invoke
it via `JAL x1, …` from a non-leaf function (e.g. the upcoming EXP opcode
per `docs... | @@ -47,6 +47,13 @@
abbrev mul_callable_code (base : Word) : CodeReq :=
CodeReq.union (evm_mul_code base) (cc_ret_code (base + 252))
+private theorem mul_callable_codes_disjoint (base : Word) :
+ (evm_mul_code base).Disjoint (cc_ret_code (base + 252)) := by
+ unfold evm_mul_code mul_col0_code mul_col1_code mul... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_33a06ad1cac7_0 | 03a15ed0bb476959 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase2LongLoad.lean | Phase2LongLoad | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "rlp_phase2_long_load_acc_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 57,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [rlp_phase2_long_load_acc_post_unfold]\n -- Reshape the top-level CodeReq: `ofProg base (L... | [
{
"name": "rlp_phase2_long_load_acc_post_unfold",
"text": "theorem rlp_phase2_long_load_acc_post_unfold\n (len ptr byteZext wordVal dwordAddr : Word) :\n rlp_phase2_long_load_acc_post len ptr byteZext wordVal dwordAddr =\n ((.x11 ↦ᵣ ((len <<< 8) + byteZext)) ** (.x13 ↦ᵣ ptr) **\n (.x12 ↦ᵣ byteZ... | [
{
"name": "rlp_phase2_long_load_acc_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 74,
"n_chars": 3892,
"n_subproofs": 9,
"n_tactics": 54,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 7,
"n_structural": 7,
"automation_only":... | 1 | /-
EvmAsm.Rv64.RLP.Phase2LongLoad
EL.3 Phase 2 (long form) — load-and-accumulate step.
Composes the byte load (`LBU`) with the two-instruction arithmetic
accumulator `rlp_phase2_long_acc_prog` into a 3-instruction body that
reads one byte from memory and folds it into the running length:
LBU x12, x1... | /-
EvmAsm.Rv64.RLP.Phase2LongLoad
EL.3 Phase 2 (long form) — load-and-accumulate step.
Composes the byte load (`LBU`) with the two-instruction arithmetic
accumulator `rlp_phase2_long_acc_prog` into a 3-instruction body that
reads one byte from memory and folds it into the running length:
LBU x12, x1... | @@ -57,6 +57,13 @@
(.x11 ↦ᵣ length') ** (.x13 ↦ᵣ ptr) ** (.x12 ↦ᵣ byteZext) **
(dwordAddr ↦ₘ wordVal)
+theorem rlp_phase2_long_load_acc_post_unfold
+ (len ptr byteZext wordVal dwordAddr : Word) :
+ rlp_phase2_long_load_acc_post len ptr byteZext wordVal dwordAddr =
+ ((.x11 ↦ᵣ ((len <<< 8) + byteZext)... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_27e93d717298_0 | 96d627ce1e9ad0f5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Program.lean | Program | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "evm_mulmod_product_zero_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_product_zero_length]",
"n_chars": 41,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "evm_mulmod_product_zero_length",
"text": "theorem evm_mulmod_product_zero_length :\n evm_mulmod_product_zero.length = 8 := by rfl\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 91,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": ... | [
{
"name": "evm_mulmod_product_zero_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 135,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fal... | 1 | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | @@ -125,8 +125,12 @@
evm_mulmod_product_add_partial 16 56 3976 3984 [3992] ;;
evm_mulmod_product_add_partial 24 56 3984 3992 []
+theorem evm_mulmod_product_zero_length :
+ evm_mulmod_product_zero.length = 8 := by rfl
+
theorem evm_mulmod_product_zero_byte_length :
- 4 * evm_mulmod_product_zero.length = 3... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_27e93d717298_1 | 928baaa9051fb279 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Program.lean | Program | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 3 | [
{
"theorem_name": "evm_mulmod_product_layout_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_product_layout_length]",
"n_chars": 43,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "evm_mulmod_product_layout_length",
"text": "theorem evm_mulmod_product_layout_length :\n evm_mulmod_product_layout.length = 440 := by set_option maxRecDepth 1000 in rfl\n\n",
"fan_in": 3,
"n_lines": 4,
"n_chars": 128,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
... | [
{
"name": "evm_mulmod_product_layout_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 331,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": f... | 1 | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | @@ -125,8 +125,12 @@
evm_mulmod_product_add_partial 16 56 3976 3984 [3992] ;;
evm_mulmod_product_add_partial 24 56 3984 3992 []
+theorem evm_mulmod_product_layout_length :
+ evm_mulmod_product_layout.length = 440 := by set_option maxRecDepth 1000 in rfl
+
theorem evm_mulmod_product_layout_byte_length :
- ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_27e93d717298_2 | 022f1d86c1330b99 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Program.lean | Program | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "evm_mulmod_reduce_n_zero_test_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_reduce_n_zero_test_length]",
"n_chars": 47,
"n_subproofs": 0,
"n_tacti... | [
{
"name": "evm_mulmod_reduce_n_zero_test_length",
"text": "theorem evm_mulmod_reduce_n_zero_test_length (zeroPathOff : BitVec 13) :\n (evm_mulmod_reduce_n_zero_test zeroPathOff).length = 8 := by\n revert zeroPathOff\n decide\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 169,
"n_subproofs"... | [
{
"name": "evm_mulmod_reduce_n_zero_test_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 193,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only... | 1 | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | @@ -165,8 +165,14 @@
OR' .x6 .x6 .x5 ;;
single (.BEQ .x6 .x0 zeroPathOff)
+theorem evm_mulmod_reduce_n_zero_test_length (zeroPathOff : BitVec 13) :
+ (evm_mulmod_reduce_n_zero_test zeroPathOff).length = 8 := by
+ revert zeroPathOff
+ decide
+
theorem evm_mulmod_reduce_n_zero_test_byte_length (zeroPathOff ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_27e93d717298_3 | 2f18474185960d87 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Program.lean | Program | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 3 | [
{
"theorem_name": "evm_mulmod_reduce_prepare_mod_args_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_reduce_prepare_mod_args_length]",
"n_chars": 52,
"n_subproofs": 0,
... | [
{
"name": "evm_mulmod_reduce_prepare_mod_args_length",
"text": "theorem evm_mulmod_reduce_prepare_mod_args_length (src : BitVec 12) :\n (evm_mulmod_reduce_prepare_mod_args src).length = 16 := by\n revert src\n decide\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 156,
"n_subproofs": 0,
... | [
{
"name": "evm_mulmod_reduce_prepare_mod_args_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 192,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation... | 1 | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | @@ -195,8 +195,14 @@
LD .x5 .x12 88 ;;
SD .x12 .x5 216
+theorem evm_mulmod_reduce_prepare_mod_args_length (src : BitVec 12) :
+ (evm_mulmod_reduce_prepare_mod_args src).length = 16 := by
+ revert src
+ decide
+
theorem evm_mulmod_reduce_prepare_mod_args_byte_length (src : BitVec 12) :
- 4 * (evm_mulmod... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_27e93d717298_4 | 8a59382c03f5e4a7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Program.lean | Program | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 3 | [
{
"theorem_name": "evm_mulmod_reduce_call_mod_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_reduce_call_mod_length]",
"n_chars": 44,
"n_subproofs": 0,
"n_tactics": 2... | [
{
"name": "evm_mulmod_reduce_call_mod_length",
"text": "theorem evm_mulmod_reduce_call_mod_length (modOff : BitVec 21) :\n (evm_mulmod_reduce_call_mod modOff).length = 3 := by\n show (((ADDI .x12 .x12 160 ;; JAL .x1 modOff) ;;\n ADDI .x12 .x12 3904) : Program).length = 3\n simp only [seq, Prog... | [
{
"name": "evm_mulmod_reduce_call_mod_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 174,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": ... | 1 | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | @@ -212,8 +212,16 @@
JAL .x1 modOff ;;
ADDI .x12 .x12 3904
+theorem evm_mulmod_reduce_call_mod_length (modOff : BitVec 21) :
+ (evm_mulmod_reduce_call_mod modOff).length = 3 := by
+ show (((ADDI .x12 .x12 160 ;; JAL .x1 modOff) ;;
+ ADDI .x12 .x12 3904) : Program).length = 3
+ simp only [seq, Prog... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_27e93d717298_5 | 147adee588b0d159 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Program.lean | Program | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 3 | [
{
"theorem_name": "evm_mulmod_reduce_call_mod_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_reduce_call_mod_length]",
"n_chars": 44,
"n_subproofs": 0,
"n_tactics": 2... | [
{
"name": "evm_mulmod_reduce_call_mod_length",
"text": "theorem evm_mulmod_reduce_call_mod_length (modOff : BitVec 21) :\n (evm_mulmod_reduce_call_mod modOff).length = 3 := by\n show (((ADDI .x12 .x12 160 ;; JAL .x1 modOff) ;;\n ADDI .x12 .x12 3904) : Program).length = 3\n simp only [seq, Prog... | [
{
"name": "evm_mulmod_reduce_high_half_length",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 286,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fals... | 2 | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | @@ -217,6 +217,13 @@
JAL .x1 modOff ;;
ADDI .x12 .x12 3904
+theorem evm_mulmod_reduce_call_mod_length (modOff : BitVec 21) :
+ (evm_mulmod_reduce_call_mod modOff).length = 3 := by
+ show (((ADDI .x12 .x12 160 ;; JAL .x1 modOff) ;;
+ ADDI .x12 .x12 3904) : Program).length = 3
+ simp only [seq, Prog... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_27e93d717298_6 | fe39899fee490074 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Program.lean | Program | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 3 | [
{
"theorem_name": "evm_mulmod_reduce_call_mod_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_reduce_call_mod_length]",
"n_chars": 44,
"n_subproofs": 0,
"n_tactics": 2... | [
{
"name": "evm_mulmod_reduce_call_mod_length",
"text": "theorem evm_mulmod_reduce_call_mod_length (modOff : BitVec 21) :\n (evm_mulmod_reduce_call_mod modOff).length = 3 := by\n show (((ADDI .x12 .x12 160 ;; JAL .x1 modOff) ;;\n ADDI .x12 .x12 3904) : Program).length = 3\n simp only [seq, Prog... | [
{
"name": "evm_mulmod_reduce_high_half_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 5,
"n_chars": 177,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only":... | 3 | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | @@ -217,6 +217,13 @@
JAL .x1 modOff ;;
ADDI .x12 .x12 3904
+theorem evm_mulmod_reduce_call_mod_length (modOff : BitVec 21) :
+ (evm_mulmod_reduce_call_mod modOff).length = 3 := by
+ show (((ADDI .x12 .x12 160 ;; JAL .x1 modOff) ;;
+ ADDI .x12 .x12 3904) : Program).length = 3
+ simp only [seq, Prog... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_27e93d717298_7 | 9b32f1612c367279 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Program.lean | Program | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 3 | [
{
"theorem_name": "evm_mulmod_reduce_call_mod_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_reduce_call_mod_length]",
"n_chars": 44,
"n_subproofs": 0,
"n_tactics": 2... | [
{
"name": "evm_mulmod_reduce_call_mod_length",
"text": "theorem evm_mulmod_reduce_call_mod_length (modOff : BitVec 21) :\n (evm_mulmod_reduce_call_mod modOff).length = 3 := by\n show (((ADDI .x12 .x12 160 ;; JAL .x1 modOff) ;;\n ADDI .x12 .x12 3904) : Program).length = 3\n simp only [seq, Prog... | [
{
"name": "evm_mulmod_reduce_low_half_length",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 283,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false... | 2 | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | @@ -217,6 +217,13 @@
JAL .x1 modOff ;;
ADDI .x12 .x12 3904
+theorem evm_mulmod_reduce_call_mod_length (modOff : BitVec 21) :
+ (evm_mulmod_reduce_call_mod modOff).length = 3 := by
+ show (((ADDI .x12 .x12 160 ;; JAL .x1 modOff) ;;
+ ADDI .x12 .x12 3904) : Program).length = 3
+ simp only [seq, Prog... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_27e93d717298_8 | 7406435ed4db8ac0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Program.lean | Program | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 3 | [
{
"theorem_name": "evm_mulmod_reduce_call_mod_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_reduce_call_mod_length]",
"n_chars": 44,
"n_subproofs": 0,
"n_tactics": 2... | [
{
"name": "evm_mulmod_reduce_call_mod_length",
"text": "theorem evm_mulmod_reduce_call_mod_length (modOff : BitVec 21) :\n (evm_mulmod_reduce_call_mod modOff).length = 3 := by\n show (((ADDI .x12 .x12 160 ;; JAL .x1 modOff) ;;\n ADDI .x12 .x12 3904) : Program).length = 3\n simp only [seq, Prog... | [
{
"name": "evm_mulmod_reduce_low_half_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 5,
"n_chars": 174,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": ... | 3 | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | @@ -217,6 +217,13 @@
JAL .x1 modOff ;;
ADDI .x12 .x12 3904
+theorem evm_mulmod_reduce_call_mod_length (modOff : BitVec 21) :
+ (evm_mulmod_reduce_call_mod modOff).length = 3 := by
+ show (((ADDI .x12 .x12 160 ;; JAL .x1 modOff) ;;
+ ADDI .x12 .x12 3904) : Program).length = 3
+ simp only [seq, Prog... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_27e93d717298_9 | f40de5fe8471234c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Program.lean | Program | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 3 | [
{
"theorem_name": "evm_mulmod_reduce_zero_path_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_reduce_zero_path_length]",
"n_chars": 45,
"n_subproofs": 0,
"n_tactics":... | [
{
"name": "evm_mulmod_reduce_zero_path_length",
"text": "theorem evm_mulmod_reduce_zero_path_length :\n evm_mulmod_reduce_zero_path.length = 4 := by rfl\n\n",
"fan_in": 3,
"n_lines": 4,
"n_chars": 99,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n... | [
{
"name": "evm_mulmod_reduce_zero_path_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 147,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only":... | 1 | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | @@ -250,8 +250,12 @@
SD .x12 .x0 80 ;;
SD .x12 .x0 88
+theorem evm_mulmod_reduce_zero_path_length :
+ evm_mulmod_reduce_zero_path.length = 4 := by rfl
+
theorem evm_mulmod_reduce_zero_path_byte_length :
- 4 * evm_mulmod_reduce_zero_path.length = 16 := sorry
+ 4 * evm_mulmod_reduce_zero_path.length = 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_27e93d717298_10 | d9f5520d09ab553a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Program.lean | Program | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 4 | [
{
"theorem_name": "evm_mulmod_epilogue_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_epilogue_length]",
"n_chars": 37,
"n_subproofs": 0,
"n_tactics": 2,
"cycloma... | [
{
"name": "evm_mulmod_epilogue_length",
"text": "theorem evm_mulmod_epilogue_length :\n evm_mulmod_epilogue.length = 1 := by rfl\n\n",
"fan_in": 4,
"n_lines": 4,
"n_chars": 83,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_st... | [
{
"name": "evm_mulmod_epilogue_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 319,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,... | 1 | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | @@ -255,8 +255,12 @@
def evm_mulmod_epilogue : Program :=
ADDI .x12 .x12 64
+theorem evm_mulmod_epilogue_length :
+ evm_mulmod_epilogue.length = 1 := by rfl
+
theorem evm_mulmod_epilogue_byte_length :
- 4 * evm_mulmod_epilogue.length = 4 := sorry
+ 4 * evm_mulmod_epilogue.length = 4 := by
+ rw [evm_mul... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_27e93d717298_11 | a47bc50c88b03bf7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Program.lean | Program | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_length",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold evm_mulmod_reduce512\n simp only [seq, Program.length_append, evm_mulmod_reduce512_init_length,\n ev... | [
{
"name": "evm_mulmod_reduce512_loop_length",
"text": "theorem evm_mulmod_reduce512_loop_length :\n evm_mulmod_reduce512_loop.length = 71 := by set_option maxRecDepth 1000 in rfl\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 127,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
... | [
{
"name": "evm_mulmod_reduce512_length",
"fan_in": 2,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 299,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 4 | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | @@ -411,11 +411,18 @@
theorem evm_mulmod_reduce512_init_length :
evm_mulmod_reduce512_init.length = 6 := by rfl
+theorem evm_mulmod_reduce512_loop_length :
+ evm_mulmod_reduce512_loop.length = 71 := by set_option maxRecDepth 1000 in rfl
+
theorem evm_mulmod_reduce512_write_result_length :
evm_mulmod_re... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_27e93d717298_12 | 85c173b589b603d1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Program.lean | Program | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_length",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold evm_mulmod_reduce512\n simp only [seq, Program.length_append, evm_mulmod_reduce512_init_length,\n ev... | [
{
"name": "evm_mulmod_reduce512_init_length",
"text": "theorem evm_mulmod_reduce512_init_length :\n evm_mulmod_reduce512_init.length = 6 := by rfl\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 95,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewri... | [
{
"name": "evm_mulmod_length",
"fan_in": 1,
"n_deps_direct": 6,
"n_deps_transitive": 9,
"n_lines": 8,
"n_chars": 343,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesti... | 9 | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | @@ -420,6 +420,9 @@
theorem evm_mulmod_zero_path_skip_nonzero_length :
evm_mulmod_zero_path_skip_nonzero.length = 1 := by rfl
+theorem evm_mulmod_reduce512_init_length :
+ evm_mulmod_reduce512_init.length = 6 := by rfl
+
theorem evm_mulmod_reduce512_loop_length :
evm_mulmod_reduce512_loop.length = 71 :... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_27e93d717298_13 | 9e719e0782537063 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Program.lean | Program | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_length",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold evm_mulmod_reduce512\n simp only [seq, Program.length_append, evm_mulmod_reduce512_init_length,\n ev... | [
{
"name": "evm_mulmod_reduce512_loop_length",
"text": "theorem evm_mulmod_reduce512_loop_length :\n evm_mulmod_reduce512_loop.length = 71 := by set_option maxRecDepth 1000 in rfl\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 127,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
... | [
{
"name": "evm_mulmod_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 10,
"n_lines": 4,
"n_chars": 94,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_... | 10 | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | @@ -423,11 +423,18 @@
theorem evm_mulmod_reduce512_init_length :
evm_mulmod_reduce512_init.length = 6 := by rfl
+theorem evm_mulmod_reduce512_loop_length :
+ evm_mulmod_reduce512_loop.length = 71 := by set_option maxRecDepth 1000 in rfl
+
theorem evm_mulmod_reduce512_write_result_length :
evm_mulmod_re... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_27e93d717298_14 | 359781fbe8b9b8ef | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Program.lean | Program | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 2 | [
{
"theorem_name": "evm_mulmod_length",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold evm_mulmod\n simp only [seq, Program.length_append, evm_mulmod_nonzero_or_zero_prefix_length,\n evm_mulmod_red... | [
{
"name": "evm_mulmod_nonzero_or_zero_prefix_length",
"text": "theorem evm_mulmod_nonzero_or_zero_prefix_length :\n evm_mulmod_nonzero_or_zero_prefix.length = 8 := by rfl\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 111,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_aut... | [
{
"name": "evm_mulmod_nonzero_path_start_byte",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 387,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fals... | 4 | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | @@ -411,13 +411,18 @@
evm_mulmod_product_layout ;;
evm_mulmod_reduce512
+theorem evm_mulmod_nonzero_or_zero_prefix_length :
+ evm_mulmod_nonzero_or_zero_prefix.length = 8 := by rfl
+
theorem evm_mulmod_zero_path_skip_nonzero_length :
evm_mulmod_zero_path_skip_nonzero.length = 1 := by rfl
theorem evm... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_27e93d717298_15 | ebd578d2a71284ca | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Program.lean | Program | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 3 | [
{
"theorem_name": "evm_mulmod_product_layout_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_mulmod_product_layout_length]",
"n_chars": 43,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "evm_mulmod_product_layout_length",
"text": "theorem evm_mulmod_product_layout_length :\n evm_mulmod_product_layout.length = 440 := by set_option maxRecDepth 1000 in rfl\n\n",
"fan_in": 3,
"n_lines": 4,
"n_chars": 128,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
... | [
{
"name": "evm_mulmod_reduce512_start_byte",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 4,
"n_chars": 138,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | @@ -125,6 +125,9 @@
evm_mulmod_product_add_partial 16 56 3976 3984 [3992] ;;
evm_mulmod_product_add_partial 24 56 3984 3992 []
+theorem evm_mulmod_product_layout_length :
+ evm_mulmod_product_layout.length = 440 := by set_option maxRecDepth 1000 in rfl
+
/-- Scratch dividend base for 256-bit `evm_mod_callab... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_27e93d717298_16 | 902fed887a493080 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Program.lean | Program | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_length",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold evm_mulmod_reduce512\n simp only [seq, Program.length_append, evm_mulmod_reduce512_init_length,\n ev... | [
{
"name": "evm_mulmod_reduce512_write_result_length",
"text": "theorem evm_mulmod_reduce512_write_result_length :\n evm_mulmod_reduce512_write_result.length = 8 := by rfl\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 111,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_aut... | [
{
"name": "evm_mulmod_reduce512_end_byte",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 9,
"n_chars": 340,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 5 | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | /-
EvmAsm.Evm64.MulMod.Program
MULMOD opcode (`MULMOD(a, b, N)` = (a * b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
This file currently carries the product-layout foundation for the
eventual total `evm_mulmod`: a straight-line 4x4 schoolbook product
block that leaves b... | @@ -414,8 +414,15 @@
theorem evm_mulmod_reduce512_loop_length :
evm_mulmod_reduce512_loop.length = 71 := by set_option maxRecDepth 1000 in rfl
+theorem evm_mulmod_reduce512_write_result_length :
+ evm_mulmod_reduce512_write_result.length = 8 := by rfl
+
theorem evm_mulmod_reduce512_length :
- evm_mulmod_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5e0d30dbb8e5_0 | 543b7662dbe213b6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/UnalignedSpec.lean | UnalignedSpec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "mload_one_limb_unaligned_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 98,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mloadOneLimbUnalignedPre_unfold, mloadOneLimbUnalignedPost_unfold]\n dsimp only []\n set b0 := ... | [
{
"name": "mloadPackedLimbFromDwordPair_eq_fold",
"text": "/--\n Runtime shift/or byte packing for an unaligned 8-byte window computes the\n same big-endian limb as `mloadPackedLimbFromDwordPair`.\n-/\ntheorem mloadPackedLimbFromDwordPair_eq_fold\n (lo hi : Word) (start : Nat) :\n let b0 := mloadByt... | [
{
"name": "mload_one_limb_unaligned_spec_within",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 116,
"n_chars": 6165,
"n_subproofs": 9,
"n_tactics": 98,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 7,
"n_structural": 32,
"automation_only... | 3 | /-
EvmAsm.Evm64.MLoad.UnalignedSpec
Unaligned MLOAD byte-window helpers and the one-limb unaligned MLOAD
composition spec. Split out of `MLoad.Spec` (issue #1885 / beads
evm-asm-qgjp) to keep individual files under the 1500-line file-size
guardrail.
Contents:
* `mloadPackedLimbFromDwordPair` — pure by... | /-
EvmAsm.Evm64.MLoad.UnalignedSpec
Unaligned MLOAD byte-window helpers and the one-limb unaligned MLOAD
composition spec. Split out of `MLoad.Spec` (issue #1885 / beads
evm-asm-qgjp) to keep individual files under the 1500-line file-size
guardrail.
Contents:
* `mloadPackedLimbFromDwordPair` — pure by... | @@ -41,6 +41,40 @@
(mloadByteFromDwordPair lo hi start 7)
/--
+ Runtime shift/or byte packing for an unaligned 8-byte window computes the
+ same big-endian limb as `mloadPackedLimbFromDwordPair`.
+-/
+theorem mloadPackedLimbFromDwordPair_eq_fold
+ (lo hi : Word) (start : Nat) :
+ let b0 := mloadByteFrom... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5e0d30dbb8e5_1 | 3e38ad5984c07774 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/UnalignedSpec.lean | UnalignedSpec | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "mloadLoadedWordFromBytes_evmStackIs_fold",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mloadLoadedWordFromBytes_evmWordIs_fold]\n rfl",
"n_chars": 56,
"n_subproofs": 0,
... | [
{
"name": "mloadLoadedWordFromBytes_evmWordIs_fold",
"text": "/-- Fold the four byte-packed MLOAD limbs directly into the loaded-word assertion. -/\ntheorem mloadLoadedWordFromBytes_evmWordIs_fold\n (sp : Word)\n (b00 b01 b02 b03 b04 b05 b06 b07 : BitVec 8)\n (b08 b09 b10 b11 b12 b13 b14 b15 : BitV... | [
{
"name": "mloadLoadedWordFromBytes_evmStackIs_fold",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 989,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only... | 1 | /-
EvmAsm.Evm64.MLoad.UnalignedSpec
Unaligned MLOAD byte-window helpers and the one-limb unaligned MLOAD
composition spec. Split out of `MLoad.Spec` (issue #1885 / beads
evm-asm-qgjp) to keep individual files under the 1500-line file-size
guardrail.
Contents:
* `mloadPackedLimbFromDwordPair` — pure by... | /-
EvmAsm.Evm64.MLoad.UnalignedSpec
Unaligned MLOAD byte-window helpers and the one-limb unaligned MLOAD
composition spec. Split out of `MLoad.Spec` (issue #1885 / beads
evm-asm-qgjp) to keep individual files under the 1500-line file-size
guardrail.
Contents:
* `mloadPackedLimbFromDwordPair` — pure by... | @@ -86,6 +86,25 @@
(mloadPackedLimb b08 b09 b10 b11 b12 b13 b14 b15)
(mloadPackedLimb b00 b01 b02 b03 b04 b05 b06 b07)
+/-- Fold the four byte-packed MLOAD limbs directly into the loaded-word assertion. -/
+theorem mloadLoadedWordFromBytes_evmWordIs_fold
+ (sp : Word)
+ (b00 b01 b02 b03 b04 b05 b06 b0... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_69c6ad23d586_0 | e5d408f64d909b84 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomFullLoop.lean | SavedBitFixedHeadroomFullLoop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "exp_headroom_epilogue_word_canonical_appended",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := exp_headroom_epilogue_word_lifted sp evmSp tOld r0 r1 r2 r3\n d0 d1 d2 d3 base\... | [
{
"name": "exp_headroom_epilogue_word_lifted",
"text": "/-- Word-folded epilogue block (instr idx 93, byte +372..408) lifted onto the\n headroom program. This keeps the result stack word folded for the final\n EXP wrapper composition. -/\ntheorem exp_headroom_epilogue_word_lifted\n (sp evmSp tOld r... | [
{
"name": "exp_headroom_epilogue_word_canonical_appended",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 33,
"n_chars": 1637,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automati... | 1 | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Canonical appended-code variant of `exp_headroom_epilogue_word_lifted`. -/
theorem exp_headroom_epilogue_word_canonical_appended
(sp evmSp tOld r0 r1 r2 r3 d0 d1 d2 d3 base : Word) :
cpsTriple... | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Word-folded epilogue block (instr idx 93, byte +372..408) lifted onto the
headroom program. This keeps the result stack word folded for the final
EXP wrapper composition. -/
theorem exp_headro... | @@ -4,6 +4,46 @@
open EvmAsm.Rv64
+/-- Word-folded epilogue block (instr idx 93, byte +372..408) lifted onto the
+ headroom program. This keeps the result stack word folded for the final
+ EXP wrapper composition. -/
+theorem exp_headroom_epilogue_word_lifted
+ (sp evmSp tOld r0 r1 r2 r3 d0 d1 d2 d3 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_69c6ad23d586_1 | 37964016289422bd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomFullLoop.lean | SavedBitFixedHeadroomFullLoop | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "exp_headroom_epilogue_word_canonical_appended",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := exp_headroom_epilogue_word_lifted sp evmSp tOld r0 r1 r2 r3\n d0 d1 d2 d3 base\... | [
{
"name": "exp_headroom_epilogue_word_lifted",
"text": "/-- Word-folded epilogue block (instr idx 93, byte +372..408) lifted onto the\n headroom program. This keeps the result stack word folded for the final\n EXP wrapper composition. -/\ntheorem exp_headroom_epilogue_word_lifted\n (sp evmSp tOld r... | [
{
"name": "exp_headroom_final_advance_then_epilogue_word_canonical_appended",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 79,
"n_chars": 3801,
"n_subproofs": 6,
"n_tactics": 52,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural... | 2 | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Canonical appended-code variant of `exp_headroom_epilogue_word_lifted`. -/
theorem exp_headroom_epilogue_word_canonical_appended
(sp evmSp tOld r0 r1 r2 r3 d0 d1 d2 d3 base : Word) :
cpsTriple... | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Word-folded epilogue block (instr idx 93, byte +372..408) lifted onto the
headroom program. This keeps the result stack word folded for the final
EXP wrapper composition. -/
theorem exp_headro... | @@ -4,6 +4,46 @@
open EvmAsm.Rv64
+/-- Word-folded epilogue block (instr idx 93, byte +372..408) lifted onto the
+ headroom program. This keeps the result stack word folded for the final
+ EXP wrapper composition. -/
+theorem exp_headroom_epilogue_word_lifted
+ (sp evmSp tOld r0 r1 r2 r3 d0 d1 d2 d3 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_69c6ad23d586_2 | e5f98649c28dff77 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomFullLoop.lean | SavedBitFixedHeadroomFullLoop | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "exp_headroom_final_advance_then_epilogue_word_canonical_appended",
"depth": 1,
"n_commands": 0,
"n_lines": 52,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let epilogueFrame : Assertion :=\n (.x2 ↦ᵣ sp) ** (.x5 ↦ᵣ tOld) **\n ... | [
{
"name": "exp_headroom_epilogue_word_canonical_appended",
"text": "/-- Canonical appended-code variant of `exp_headroom_epilogue_word_lifted`. -/\ntheorem exp_headroom_epilogue_word_canonical_appended\n (sp evmSp tOld r0 r1 r2 r3 d0 d1 d2 d3 base : Word) :\n cpsTripleWithin 9 (base + 372) (base + 408... | [
{
"name": "exp_headroom_final_advance_then_epilogue_full_post_stack_canonical_appended",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 53,
"n_chars": 2608,
"n_subproofs": 2,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 5,
"n... | 3 | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Word-folded epilogue block (instr idx 93, byte +372..408) lifted onto the
headroom program. This keeps the result stack word folded for the final
EXP wrapper composition. -/
theorem exp_headro... | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Word-folded epilogue block (instr idx 93, byte +372..408) lifted onto the
headroom program. This keeps the result stack word folded for the final
EXP wrapper composition. -/
theorem exp_headro... | @@ -44,6 +44,38 @@
(by rw [evm_exp_msb_saved_bit_two_mul_fixed_headroom_length]; decide)
a i ha
+/-- Canonical appended-code variant of `exp_headroom_epilogue_word_lifted`. -/
+theorem exp_headroom_epilogue_word_canonical_appended
+ (sp evmSp tOld r0 r1 r2 r3 d0 d1 d2 d3 base : Word) :
+ cpsTripleWith... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_69c6ad23d586_3 | 5b5d1f5b8dfd037f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomFullLoop.lean | SavedBitFixedHeadroomFullLoop | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 3 | [
{
"theorem_name": "expHeadroomLoopExitFullStackPreFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expHeadroomLoopExitFullStackPreFrame_unfold]\n pcFree",
"n_chars": 63,
"n_subproof... | [
{
"name": "expHeadroomLoopExitFullStackPreFrame_unfold",
"text": "theorem expHeadroomLoopExitFullStackPreFrame_unfold\n {sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word}\n {baseWord : EvmWord} {rest : List EvmWord} {exitCond : Prop} :\n expHeadroomLoopExitFullStackPreFrame\n sp evmSp... | [
{
"name": "expHeadroomLoopExitFullStackPreFrame_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 386,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_o... | 1 | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expHeadroomLoopExitFullStackPreFrame
(sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word)
(baseWord : EvmWord) (rest : List EvmWord) (exitCond : Prop) : Assertion :=
ex... | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expHeadroomLoopExitFullStackPreFrame
(sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word)
(baseWord : EvmWord) (rest : List EvmWord) (exitCond : Prop) : Assertion :=
ex... | @@ -17,12 +17,31 @@
((sp + signExtend12 (24 : BitVec 12)) ↦ₘ r3))) **
evmStackIs evmSp (baseWord :: expResultWord d0 d1 d2 d3 :: rest)
+theorem expHeadroomLoopExitFullStackPreFrame_unfold
+ {sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word}
+ {baseWord : EvmWord} {rest : List EvmWord} {exitCond... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_69c6ad23d586_4 | cb0bf49a7591c298 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomFullLoop.lean | SavedBitFixedHeadroomFullLoop | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 3 | [
{
"theorem_name": "expHeadroomLoopExitFullStackPostFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expHeadroomLoopExitFullStackPostFrame_unfold]\n pcFree",
"n_chars": 64,
"n_subpro... | [
{
"name": "expHeadroomLoopExitFullStackPostFrame_unfold",
"text": "theorem expHeadroomLoopExitFullStackPostFrame_unfold\n {sp evmSp iterCountNew r0 r1 r2 r3 : Word}\n {baseWord : EvmWord} {rest : List EvmWord} {exitCond : Prop} :\n expHeadroomLoopExitFullStackPostFrame\n sp evmSp iterCountNew ... | [
{
"name": "expHeadroomLoopExitFullStackPostFrame_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 349,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_o... | 1 | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expHeadroomLoopExitFullStackPreFrame
(sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word)
(baseWord : EvmWord) (rest : List EvmWord) (exitCond : Prop) : Assertion :=
ex... | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expHeadroomLoopExitFullStackPreFrame
(sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word)
(baseWord : EvmWord) (rest : List EvmWord) (exitCond : Prop) : Assertion :=
ex... | @@ -66,11 +66,30 @@
((sp + signExtend12 (24 : BitVec 12)) ↦ₘ r3) **
evmStackIs evmSp (baseWord :: expResultWord r0 r1 r2 r3 :: rest))
+theorem expHeadroomLoopExitFullStackPostFrame_unfold
+ {sp evmSp iterCountNew r0 r1 r2 r3 : Word}
+ {baseWord : EvmWord} {rest : List EvmWord} {exitCond : Prop} :
+ 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_69c6ad23d586_5 | 9349f8876369ad51 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomFullLoop.lean | SavedBitFixedHeadroomFullLoop | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "exp_headroom_loop_exit_full_stack_frame_then_final_epilogue_canonical_appended",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := exp_headroom_final_advance_then_epilogue_full_pos... | [
{
"name": "exp_headroom_final_advance_then_epilogue_full_post_stack_canonical_appended",
"text": "/-- Headroom final block with loop-exit control and the caller stack tail framed\n around the folded epilogue. This is the live-stack-facing form needed after\n the fixed loop has produced the final accum... | [
{
"name": "exp_headroom_loop_exit_full_stack_frame_then_final_epilogue_canonical_appended",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 6,
"n_lines": 44,
"n_chars": 2122,
"n_subproofs": 1,
"n_tactics": 31,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 21,
... | 6 | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Word-folded epilogue block (instr idx 93, byte +372..408) lifted onto the
headroom program. This keeps the result stack word folded for the final
EXP wrapper composition. -/
theorem exp_headro... | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Word-folded epilogue block (instr idx 93, byte +372..408) lifted onto the
headroom program. This keeps the result stack word folded for the final
EXP wrapper composition. -/
theorem exp_headro... | @@ -154,6 +154,57 @@
(fun _ hp => hp)
hSeq
+/-- Headroom final block with loop-exit control and the caller stack tail framed
+ around the folded epilogue. This is the live-stack-facing form needed after
+ the fixed loop has produced the final accumulator in scratch. -/
+theorem exp_headroom_final_adva... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_69c6ad23d586_6 | 38e4033e87cbe02d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomFullLoop.lean | SavedBitFixedHeadroomFullLoop | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 2 | [
{
"theorem_name": "expHeadroomFinalLoopExtraFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expHeadroomFinalLoopExtraFrame_unfold]\n pcFree",
"n_chars": 57,
"n_subproofs": 0,
"... | [
{
"name": "expHeadroomFinalLoopExtraFrame_unfold",
"text": "theorem expHeadroomFinalLoopExtraFrame_unfold\n {evmSp : Word} {baseWord exponentWord scratchWord resultWord : EvmWord} :\n expHeadroomFinalLoopExtraFrame evmSp baseWord exponentWord scratchWord resultWord =\n (evmStackIs (evmSp + signEx... | [
{
"name": "expHeadroomFinalLoopExtraFrame_pcFree",
"fan_in": 5,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 280,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": f... | 1 | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expHeadroomLoopExitFullStackPreFrame
(sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word)
(baseWord : EvmWord) (rest : List EvmWord) (exitCond : Prop) : Assertion :=
ex... | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expHeadroomLoopExitFullStackPreFrame
(sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word)
(baseWord : EvmWord) (rest : List EvmWord) (exitCond : Prop) : Assertion :=
ex... | @@ -107,9 +107,21 @@
(regOwn .x19 ** regOwn .x20 ** regOwn .x18 ** regOwn .x16 **
regOwn .x1 ** regOwn .x6 ** regOwn .x7 ** regOwn .x10 ** regOwn .x11)
+theorem expHeadroomFinalLoopExtraFrame_unfold
+ {evmSp : Word} {baseWord exponentWord scratchWord resultWord : EvmWord} :
+ expHeadroomFinalLoopExtr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_69c6ad23d586_7 | 4dacaadd0dbe492f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomFullLoop.lean | SavedBitFixedHeadroomFullLoop | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 3 | [
{
"theorem_name": "expHeadroomLoopExitFullStackPreFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expHeadroomLoopExitFullStackPreFrame_unfold]\n pcFree",
"n_chars": 63,
"n_subproof... | [
{
"name": "expHeadroomLoopExitFullStackPreFrame_unfold",
"text": "theorem expHeadroomLoopExitFullStackPreFrame_unfold\n {sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word}\n {baseWord : EvmWord} {rest : List EvmWord} {exitCond : Prop} :\n expHeadroomLoopExitFullStackPreFrame\n sp evmSp... | [
{
"name": "expFinalLoopFirstIterPost_to_headroom_epilogue_pre",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 72,
"n_chars": 3994,
"n_subproofs": 3,
"n_tactics": 51,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 21,
"n_structural": 3,
"au... | 2 | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expHeadroomLoopExitFullStackPreFrame
(sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word)
(baseWord : EvmWord) (rest : List EvmWord) (exitCond : Prop) : Assertion :=
ex... | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expHeadroomLoopExitFullStackPreFrame
(sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word)
(baseWord : EvmWord) (rest : List EvmWord) (exitCond : Prop) : Assertion :=
ex... | @@ -17,12 +17,31 @@
((sp + signExtend12 (24 : BitVec 12)) ↦ₘ r3))) **
evmStackIs evmSp (baseWord :: expResultWord d0 d1 d2 d3 :: rest)
+theorem expHeadroomLoopExitFullStackPreFrame_unfold
+ {sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word}
+ {baseWord : EvmWord} {rest : List EvmWord} {exitCond... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_69c6ad23d586_8 | 9deef484f7406141 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomFullLoop.lean | SavedBitFixedHeadroomFullLoop | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 3 | [
{
"theorem_name": "expHeadroomLoopExitFullStackPreFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expHeadroomLoopExitFullStackPreFrame_unfold]\n pcFree",
"n_chars": 63,
"n_subproof... | [
{
"name": "expHeadroomLoopExitFullStackPreFrame_unfold",
"text": "theorem expHeadroomLoopExitFullStackPreFrame_unfold\n {sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word}\n {baseWord : EvmWord} {rest : List EvmWord} {exitCond : Prop} :\n expHeadroomLoopExitFullStackPreFrame\n sp evmSp... | [
{
"name": "exp_headroom_final_loop_post_then_epilogue_framed",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 10,
"n_lines": 38,
"n_chars": 1763,
"n_subproofs": 2,
"n_tactics": 28,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 6,
"aut... | 10 | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Word-folded epilogue block (instr idx 93, byte +372..408) lifted onto the
headroom program. This keeps the result stack word folded for the final
EXP wrapper composition. -/
theorem exp_headro... | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Word-folded epilogue block (instr idx 93, byte +372..408) lifted onto the
headroom program. This keeps the result stack word folded for the final
EXP wrapper composition. -/
theorem exp_headro... | @@ -218,12 +218,31 @@
((sp + signExtend12 (24 : BitVec 12)) ↦ₘ r3))) **
evmStackIs evmSp (baseWord :: expResultWord d0 d1 d2 d3 :: rest)
+theorem expHeadroomLoopExitFullStackPreFrame_unfold
+ {sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word}
+ {baseWord : EvmWord} {rest : List EvmWord} {exitCo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_69c6ad23d586_9 | 30bbd5bbe8a472aa | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomFullLoop.lean | SavedBitFixedHeadroomFullLoop | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 3 | [
{
"theorem_name": "expHeadroomLoopExitFullStackPreFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expHeadroomLoopExitFullStackPreFrame_unfold]\n pcFree",
"n_chars": 63,
"n_subproof... | [
{
"name": "expHeadroomLoopExitFullStackPreFrame_unfold",
"text": "theorem expHeadroomLoopExitFullStackPreFrame_unfold\n {sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word}\n {baseWord : EvmWord} {rest : List EvmWord} {exitCond : Prop} :\n expHeadroomLoopExitFullStackPreFrame\n sp evmSp... | [
{
"name": "exp_headroom_entry_to_final_epilogue_framed",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 12,
"n_lines": 49,
"n_chars": 2792,
"n_subproofs": 2,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 3,
"automatio... | 12 | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Word-folded epilogue block (instr idx 93, byte +372..408) lifted onto the
headroom program. This keeps the result stack word folded for the final
EXP wrapper composition. -/
theorem exp_headro... | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Word-folded epilogue block (instr idx 93, byte +372..408) lifted onto the
headroom program. This keeps the result stack word folded for the final
EXP wrapper composition. -/
theorem exp_headro... | @@ -218,12 +218,31 @@
((sp + signExtend12 (24 : BitVec 12)) ↦ₘ r3))) **
evmStackIs evmSp (baseWord :: expResultWord d0 d1 d2 d3 :: rest)
+theorem expHeadroomLoopExitFullStackPreFrame_unfold
+ {sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word}
+ {baseWord : EvmWord} {rest : List EvmWord} {exitCo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_69c6ad23d586_10 | 6ac2b7a6346ee7a2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomFullLoop.lean | SavedBitFixedHeadroomFullLoop | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "expHeadroomFinalCleanVisiblePost_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ps h_post\n rw [expHeadroomFinalCleanVisiblePost_unfold] at h_post\n obtain ⟨scratchWord, ... | [
{
"name": "expHeadroomFinalCleanVisiblePost_unfold",
"text": "theorem expHeadroomFinalCleanVisiblePost_unfold\n {sp evmSp : Word} {baseWord exponentWord : EvmWord} {rest : List EvmWord} :\n expHeadroomFinalCleanVisiblePost sp evmSp baseWord exponentWord rest =\n (fun ps => ∃ (scratchWord : EvmWor... | [
{
"name": "expHeadroomFinalCleanVisiblePost_pcFree",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 27,
"n_chars": 1321,
"n_subproofs": 3,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 3,
"automation_onl... | 2 | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expHeadroomLoopExitFullStackPreFrame
(sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word)
(baseWord : EvmWord) (rest : List EvmWord) (exitCond : Prop) : Assertion :=
ex... | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expHeadroomLoopExitFullStackPreFrame
(sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word)
(baseWord : EvmWord) (rest : List EvmWord) (exitCond : Prop) : Assertion :=
ex... | @@ -237,9 +237,54 @@
expHeadroomFinalLoopExtraFrame evmSp baseWord exponentWord scratchWord
(EvmWord.exp baseWord exponentWord)) ps
+theorem expHeadroomFinalCleanVisiblePost_unfold
+ {sp evmSp : Word} {baseWord exponentWord : EvmWord} {rest : List EvmWord} :
+ expHeadroomFinalCleanVisiblePost 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_69c6ad23d586_11 | 9079a770d873b184 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomFullLoop.lean | SavedBitFixedHeadroomFullLoop | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 3 | [
{
"theorem_name": "expHeadroomFinalCleanLiveStackPost_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ps h_post\n rw [expHeadroomFinalCleanLiveStackPost_unfold] at h_post\n obtain ⟨scratchWo... | [
{
"name": "expHeadroomFinalCleanLiveStackPost_unfold",
"text": "theorem expHeadroomFinalCleanLiveStackPost_unfold\n {sp evmSp : Word} {baseWord exponentWord : EvmWord} {rest : List EvmWord} :\n expHeadroomFinalCleanLiveStackPost sp evmSp baseWord exponentWord rest =\n (fun ps => ∃ (scratchWord : ... | [
{
"name": "expHeadroomFinalCleanLiveStackPost_to_ownedBasePost",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 14,
"n_chars": 746,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 3,
"auto... | 3 | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expHeadroomLoopExitFullStackPreFrame
(sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word)
(baseWord : EvmWord) (rest : List EvmWord) (exitCond : Prop) : Assertion :=
ex... | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expHeadroomLoopExitFullStackPreFrame
(sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word)
(baseWord : EvmWord) (rest : List EvmWord) (exitCond : Prop) : Assertion :=
ex... | @@ -358,9 +358,40 @@
expHeadroomFinalLoopExtraFrame evmSp baseWord exponentWord scratchWord
(EvmWord.exp baseWord exponentWord)) ps
+theorem expHeadroomFinalCleanLiveStackPost_unfold
+ {sp evmSp : Word} {baseWord exponentWord : EvmWord} {rest : List EvmWord} :
+ expHeadroomFinalCleanLiveStackPos... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_69c6ad23d586_12 | 4e01d73c14fdcc97 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomFullLoop.lean | SavedBitFixedHeadroomFullLoop | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "expHeadroomFinalCleanVisiblePost_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ps h_post\n rw [expHeadroomFinalCleanVisiblePost_unfold] at h_post\n obtain ⟨scratchWord, ... | [
{
"name": "expHeadroomFinalCleanVisiblePost_unfold",
"text": "theorem expHeadroomFinalCleanVisiblePost_unfold\n {sp evmSp : Word} {baseWord exponentWord : EvmWord} {rest : List EvmWord} :\n expHeadroomFinalCleanVisiblePost sp evmSp baseWord exponentWord rest =\n (fun ps => ∃ (scratchWord : EvmWor... | [
{
"name": "expHeadroomFinalCleanVisiblePost_to_cleanLiveStackPost",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 21,
"n_chars": 1041,
"n_subproofs": 1,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 5,
"n_structural": 2,
... | 2 | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expHeadroomLoopExitFullStackPreFrame
(sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word)
(baseWord : EvmWord) (rest : List EvmWord) (exitCond : Prop) : Assertion :=
ex... | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expHeadroomLoopExitFullStackPreFrame
(sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word)
(baseWord : EvmWord) (rest : List EvmWord) (exitCond : Prop) : Assertion :=
ex... | @@ -237,9 +237,54 @@
expHeadroomFinalLoopExtraFrame evmSp baseWord exponentWord scratchWord
(EvmWord.exp baseWord exponentWord)) ps
+theorem expHeadroomFinalCleanVisiblePost_unfold
+ {sp evmSp : Word} {baseWord exponentWord : EvmWord} {rest : List EvmWord} :
+ expHeadroomFinalCleanVisiblePost 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_69c6ad23d586_13 | b820e678b36e25c9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomFullLoop.lean | SavedBitFixedHeadroomFullLoop | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "expHeadroomFinalCleanVisiblePost_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ps h_post\n rw [expHeadroomFinalCleanVisiblePost_unfold] at h_post\n obtain ⟨scratchWord, ... | [
{
"name": "expHeadroomFinalCleanVisiblePost_unfold",
"text": "theorem expHeadroomFinalCleanVisiblePost_unfold\n {sp evmSp : Word} {baseWord exponentWord : EvmWord} {rest : List EvmWord} :\n expHeadroomFinalCleanVisiblePost sp evmSp baseWord exponentWord rest =\n (fun ps => ∃ (scratchWord : EvmWor... | [
{
"name": "expHeadroomFinalCleanVisiblePost_to_cleanStackVisiblePost",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 23,
"n_chars": 1128,
"n_subproofs": 1,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 6,
"n_structural": 2,
... | 2 | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expHeadroomLoopExitFullStackPreFrame
(sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word)
(baseWord : EvmWord) (rest : List EvmWord) (exitCond : Prop) : Assertion :=
ex... | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expHeadroomLoopExitFullStackPreFrame
(sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word)
(baseWord : EvmWord) (rest : List EvmWord) (exitCond : Prop) : Assertion :=
ex... | @@ -237,9 +237,54 @@
expHeadroomFinalLoopExtraFrame evmSp baseWord exponentWord scratchWord
(EvmWord.exp baseWord exponentWord)) ps
+theorem expHeadroomFinalCleanVisiblePost_unfold
+ {sp evmSp : Word} {baseWord exponentWord : EvmWord} {rest : List EvmWord} :
+ expHeadroomFinalCleanVisiblePost 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_69c6ad23d586_14 | 2c72d0b6f29ec2f5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomFullLoop.lean | SavedBitFixedHeadroomFullLoop | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 3 | [
{
"theorem_name": "expHeadroomFinalVisiblePost_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ps h_post\n rw [expHeadroomFinalVisiblePost_unfold] at h_post\n obtain ⟨icNew, scratchWord, h_p... | [
{
"name": "expHeadroomFinalVisiblePost_unfold",
"text": "theorem expHeadroomFinalVisiblePost_unfold\n {sp evmSp : Word} {baseWord exponentWord : EvmWord} {rest : List EvmWord} :\n expHeadroomFinalVisiblePost sp evmSp baseWord exponentWord rest =\n (fun ps => ∃ (icNew : Word) (scratchWord : EvmWor... | [
{
"name": "expHeadroomFinalVisiblePost_to_cleanVisiblePost",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 21,
"n_chars": 1072,
"n_subproofs": 5,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 4,
"automa... | 2 | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expHeadroomLoopExitFullStackPreFrame
(sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word)
(baseWord : EvmWord) (rest : List EvmWord) (exitCond : Prop) : Assertion :=
ex... | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expHeadroomLoopExitFullStackPreFrame
(sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word)
(baseWord : EvmWord) (rest : List EvmWord) (exitCond : Prop) : Assertion :=
ex... | @@ -163,9 +163,52 @@
expHeadroomFinalLoopExtraFrame evmSp baseWord exponentWord scratchWord
(EvmWord.exp baseWord exponentWord)) ps
+theorem expHeadroomFinalVisiblePost_unfold
+ {sp evmSp : Word} {baseWord exponentWord : EvmWord} {rest : List EvmWord} :
+ expHeadroomFinalVisiblePost sp evmSp bas... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_69c6ad23d586_15 | 87c0ae688cb10bd2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomFullLoop.lean | SavedBitFixedHeadroomFullLoop | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 3 | [
{
"theorem_name": "expHeadroomLoopExitFullStackPostFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expHeadroomLoopExitFullStackPostFrame_unfold]\n pcFree",
"n_chars": 64,
"n_subpro... | [
{
"name": "expHeadroomLoopExitFullStackPostFrame_unfold",
"text": "theorem expHeadroomLoopExitFullStackPostFrame_unfold\n {sp evmSp iterCountNew r0 r1 r2 r3 : Word}\n {baseWord : EvmWord} {rest : List EvmWord} {exitCond : Prop} :\n expHeadroomLoopExitFullStackPostFrame\n sp evmSp iterCountNew ... | [
{
"name": "expHeadroomFinalEpilogueFramedPost_to_visiblePost",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 22,
"n_chars": 1088,
"n_subproofs": 1,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 11,
"n_structural": 2,
"aut... | 3 | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expHeadroomLoopExitFullStackPreFrame
(sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word)
(baseWord : EvmWord) (rest : List EvmWord) (exitCond : Prop) : Assertion :=
ex... | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expHeadroomLoopExitFullStackPreFrame
(sp evmSp iterCountNew tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word)
(baseWord : EvmWord) (rest : List EvmWord) (exitCond : Prop) : Assertion :=
ex... | @@ -66,11 +66,30 @@
((sp + signExtend12 (24 : BitVec 12)) ↦ₘ r3) **
evmStackIs evmSp (baseWord :: expResultWord r0 r1 r2 r3 :: rest))
+theorem expHeadroomLoopExitFullStackPostFrame_unfold
+ {sp evmSp iterCountNew r0 r1 r2 r3 : Word}
+ {baseWord : EvmWord} {rest : List EvmWord} {exitCond : Prop} :
+ 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_69c6ad23d586_16 | 5a7bff7706d228b8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomFullLoop.lean | SavedBitFixedHeadroomFullLoop | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 3 | [
{
"theorem_name": "expHeadroomLoopExitFullStackPostFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expHeadroomLoopExitFullStackPostFrame_unfold]\n pcFree",
"n_chars": 64,
"n_subpro... | [
{
"name": "expHeadroomLoopExitFullStackPostFrame_unfold",
"text": "theorem expHeadroomLoopExitFullStackPostFrame_unfold\n {sp evmSp iterCountNew r0 r1 r2 r3 : Word}\n {baseWord : EvmWord} {rest : List EvmWord} {exitCond : Prop} :\n expHeadroomLoopExitFullStackPostFrame\n sp evmSp iterCountNew ... | [
{
"name": "exp_headroom_entry_to_final_visible_post",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 15,
"n_lines": 45,
"n_chars": 2569,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_on... | 15 | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Word-folded epilogue block (instr idx 93, byte +372..408) lifted onto the
headroom program. This keeps the result stack word folded for the final
EXP wrapper composition. -/
theorem exp_headro... | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Word-folded epilogue block (instr idx 93, byte +372..408) lifted onto the
headroom program. This keeps the result stack word folded for the final
EXP wrapper composition. -/
theorem exp_headro... | @@ -267,11 +267,30 @@
((sp + signExtend12 (24 : BitVec 12)) ↦ₘ r3) **
evmStackIs evmSp (baseWord :: expResultWord r0 r1 r2 r3 :: rest))
+theorem expHeadroomLoopExitFullStackPostFrame_unfold
+ {sp evmSp iterCountNew r0 r1 r2 r3 : Word}
+ {baseWord : EvmWord} {rest : List EvmWord} {exitCond : Prop} :
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_69c6ad23d586_17 | 910dbeb92f34fc6b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomFullLoop.lean | SavedBitFixedHeadroomFullLoop | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 3 | [
{
"theorem_name": "expHeadroomLoopExitFullStackPostFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expHeadroomLoopExitFullStackPostFrame_unfold]\n pcFree",
"n_chars": 64,
"n_subpro... | [
{
"name": "expHeadroomLoopExitFullStackPostFrame_unfold",
"text": "theorem expHeadroomLoopExitFullStackPostFrame_unfold\n {sp evmSp iterCountNew r0 r1 r2 r3 : Word}\n {baseWord : EvmWord} {rest : List EvmWord} {exitCond : Prop} :\n expHeadroomLoopExitFullStackPostFrame\n sp evmSp iterCountNew ... | [
{
"name": "exp_headroom_entry_to_final_clean_visible_post",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 18,
"n_lines": 45,
"n_chars": 2597,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automat... | 18 | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Word-folded epilogue block (instr idx 93, byte +372..408) lifted onto the
headroom program. This keeps the result stack word folded for the final
EXP wrapper composition. -/
theorem exp_headro... | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Word-folded epilogue block (instr idx 93, byte +372..408) lifted onto the
headroom program. This keeps the result stack word folded for the final
EXP wrapper composition. -/
theorem exp_headro... | @@ -267,11 +267,30 @@
((sp + signExtend12 (24 : BitVec 12)) ↦ₘ r3) **
evmStackIs evmSp (baseWord :: expResultWord r0 r1 r2 r3 :: rest))
+theorem expHeadroomLoopExitFullStackPostFrame_unfold
+ {sp evmSp iterCountNew r0 r1 r2 r3 : Word}
+ {baseWord : EvmWord} {rest : List EvmWord} {exitCond : Prop} :
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_69c6ad23d586_18 | 91c32e8469036ca7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomFullLoop.lean | SavedBitFixedHeadroomFullLoop | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "exp_headroom_entry_to_final_epilogue_framed",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hLoop := exp_headroom_entry_to_final_loop_post\n sp evmSp cOld tOld c6Old c16Old c19Ol... | [
{
"name": "exp_headroom_entry_to_final_loop_post",
"text": "/-- Entry prefix plus the fixed 256-step loop, with the explicit bridge frame\n folded into the first-iteration residual precondition. This is the main\n headroom body surface before the final epilogue writes the result back. -/\ntheorem exp_... | [
{
"name": "exp_headroom_entry_to_final_clean_stack_visible_post",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 21,
"n_lines": 47,
"n_chars": 2655,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"a... | 21 | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Word-folded epilogue block (instr idx 93, byte +372..408) lifted onto the
headroom program. This keeps the result stack word folded for the final
EXP wrapper composition. -/
theorem exp_headro... | import EvmAsm.Evm64.Exp.Compose.SavedBitFixedHeadroomCompose
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Word-folded epilogue block (instr idx 93, byte +372..408) lifted onto the
headroom program. This keeps the result stack word folded for the final
EXP wrapper composition. -/
theorem exp_headro... | @@ -343,6 +343,65 @@
xperm_hyp hp)
h
+/-- Entry prefix plus the fixed 256-step loop, with the explicit bridge frame
+ folded into the first-iteration residual precondition. This is the main
+ headroom body surface before the final epilogue writes the result back. -/
+theorem exp_headroom_entry_to_fi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b291cb99b2fb_0 | 898aba9b003222b9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/StageWindow.lean | StageWindow | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "calldataloadOutputLimb_stagedWindow",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold calldataloadOutputLimb\n simp only [Nat.zero_add]\n rw [callDataByte_stagedWindow data off w ... | [
{
"name": "callDataByte_stagedWindow",
"text": "/-- Reading window byte `j < 32` of the staged buffer recovers the calldata\n byte `off + j` (zero past the end). -/\ntheorem callDataByte_stagedWindow\n (data : List (BitVec 8)) (off j : Nat) (h : j < 32) :\n callDataByte (stagedWindowBytes data off)... | [
{
"name": "calldataloadOutputLimb_stagedWindow",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 26,
"n_chars": 1302,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 10,
"n_rewrites": 2,
"n_structural": 0,
"automation_only":... | 1 | /-
EvmAsm.Evm64.Calldata.StageWindow
Pure read-side bridge for the ARENA-FREE (staged) CALLDATALOAD (bead
evm-asm-t1iqb, phase B). The staging step materializes the 32-byte
CALLDATALOAD window into a small fixed buffer as
`stagedWindowBytes data offset = callDataCopyBytes data offset 32` — the
window byte... | /-
EvmAsm.Evm64.Calldata.StageWindow
Pure read-side bridge for the ARENA-FREE (staged) CALLDATALOAD (bead
evm-asm-t1iqb, phase B). The staging step materializes the 32-byte
CALLDATALOAD window into a small fixed buffer as
`stagedWindowBytes data offset = callDataCopyBytes data offset 32` — the
window byte... | @@ -42,12 +42,33 @@
(stagedWindowBytes data off).length = 32 := by
simp [stagedWindowBytes]
+/-- Reading window byte `j < 32` of the staged buffer recovers the calldata
+ byte `off + j` (zero past the end). -/
+theorem callDataByte_stagedWindow
+ (data : List (BitVec 8)) (off j : Nat) (h : j < 32) :
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b291cb99b2fb_1 | 0985382daffc13a7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/StageWindow.lean | StageWindow | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 4 | [
{
"theorem_name": "callDataLoadWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← window_word_eq data offset,\n getLimbN_calldataLoadWindowOutputWordFromArgs_0]\n unfold calldataloadO... | [
{
"name": "window_word_eq",
"text": "/-- Bridge: the window word decoded from the raw offset `N` (via `loadArgs`\n of any word whose `toNat` is `N`) is `callDataLoadWord data N`. -/\nprivate theorem window_word_eq (data : List (BitVec 8)) (offset : EvmWord) :\n calldataLoadWindowOutputWordFromArgs dat... | [
{
"name": "callDataLoadWord_getLimbN_0",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 437,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.Calldata.StageWindow
Pure read-side bridge for the ARENA-FREE (staged) CALLDATALOAD (bead
evm-asm-t1iqb, phase B). The staging step materializes the 32-byte
CALLDATALOAD window into a small fixed buffer as
`stagedWindowBytes data offset = callDataCopyBytes data offset 32` — the
window byte... | /-
EvmAsm.Evm64.Calldata.StageWindow
Pure read-side bridge for the ARENA-FREE (staged) CALLDATALOAD (bead
evm-asm-t1iqb, phase B). The staging step materializes the 32-byte
CALLDATALOAD window into a small fixed buffer as
`stagedWindowBytes data offset = callDataCopyBytes data offset 32` — the
window byte... | @@ -42,9 +42,22 @@
(stagedWindowBytes data off).length = 32 := by
simp [stagedWindowBytes]
+/-- Bridge: the window word decoded from the raw offset `N` (via `loadArgs`
+ of any word whose `toNat` is `N`) is `callDataLoadWord data N`. -/
+private theorem window_word_eq (data : List (BitVec 8)) (offset : Evm... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b291cb99b2fb_2 | fcdb27987f22f30b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/StageWindow.lean | StageWindow | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 4 | [
{
"theorem_name": "callDataLoadWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← window_word_eq data offset,\n getLimbN_calldataLoadWindowOutputWordFromArgs_0]\n unfold calldataloadO... | [
{
"name": "window_word_eq",
"text": "/-- Bridge: the window word decoded from the raw offset `N` (via `loadArgs`\n of any word whose `toNat` is `N`) is `callDataLoadWord data N`. -/\nprivate theorem window_word_eq (data : List (BitVec 8)) (offset : EvmWord) :\n calldataLoadWindowOutputWordFromArgs dat... | [
{
"name": "callDataLoadWord_getLimbN_1",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 437,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.Calldata.StageWindow
Pure read-side bridge for the ARENA-FREE (staged) CALLDATALOAD (bead
evm-asm-t1iqb, phase B). The staging step materializes the 32-byte
CALLDATALOAD window into a small fixed buffer as
`stagedWindowBytes data offset = callDataCopyBytes data offset 32` — the
window byte... | /-
EvmAsm.Evm64.Calldata.StageWindow
Pure read-side bridge for the ARENA-FREE (staged) CALLDATALOAD (bead
evm-asm-t1iqb, phase B). The staging step materializes the 32-byte
CALLDATALOAD window into a small fixed buffer as
`stagedWindowBytes data offset = callDataCopyBytes data offset 32` — the
window byte... | @@ -42,9 +42,22 @@
(stagedWindowBytes data off).length = 32 := by
simp [stagedWindowBytes]
+/-- Bridge: the window word decoded from the raw offset `N` (via `loadArgs`
+ of any word whose `toNat` is `N`) is `callDataLoadWord data N`. -/
+private theorem window_word_eq (data : List (BitVec 8)) (offset : Evm... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b291cb99b2fb_3 | c11847121ed70ed2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/StageWindow.lean | StageWindow | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 4 | [
{
"theorem_name": "callDataLoadWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← window_word_eq data offset,\n getLimbN_calldataLoadWindowOutputWordFromArgs_0]\n unfold calldataloadO... | [
{
"name": "window_word_eq",
"text": "/-- Bridge: the window word decoded from the raw offset `N` (via `loadArgs`\n of any word whose `toNat` is `N`) is `callDataLoadWord data N`. -/\nprivate theorem window_word_eq (data : List (BitVec 8)) (offset : EvmWord) :\n calldataLoadWindowOutputWordFromArgs dat... | [
{
"name": "callDataLoadWord_getLimbN_2",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 436,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.Calldata.StageWindow
Pure read-side bridge for the ARENA-FREE (staged) CALLDATALOAD (bead
evm-asm-t1iqb, phase B). The staging step materializes the 32-byte
CALLDATALOAD window into a small fixed buffer as
`stagedWindowBytes data offset = callDataCopyBytes data offset 32` — the
window byte... | /-
EvmAsm.Evm64.Calldata.StageWindow
Pure read-side bridge for the ARENA-FREE (staged) CALLDATALOAD (bead
evm-asm-t1iqb, phase B). The staging step materializes the 32-byte
CALLDATALOAD window into a small fixed buffer as
`stagedWindowBytes data offset = callDataCopyBytes data offset 32` — the
window byte... | @@ -42,9 +42,22 @@
(stagedWindowBytes data off).length = 32 := by
simp [stagedWindowBytes]
+/-- Bridge: the window word decoded from the raw offset `N` (via `loadArgs`
+ of any word whose `toNat` is `N`) is `callDataLoadWord data N`. -/
+private theorem window_word_eq (data : List (BitVec 8)) (offset : Evm... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b291cb99b2fb_4 | 4aa00e7423749a4c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/StageWindow.lean | StageWindow | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 4 | [
{
"theorem_name": "callDataLoadWord_getLimbN_0",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← window_word_eq data offset,\n getLimbN_calldataLoadWindowOutputWordFromArgs_0]\n unfold calldataloadO... | [
{
"name": "window_word_eq",
"text": "/-- Bridge: the window word decoded from the raw offset `N` (via `loadArgs`\n of any word whose `toNat` is `N`) is `callDataLoadWord data N`. -/\nprivate theorem window_word_eq (data : List (BitVec 8)) (offset : EvmWord) :\n calldataLoadWindowOutputWordFromArgs dat... | [
{
"name": "callDataLoadWord_getLimbN_3",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 436,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.Calldata.StageWindow
Pure read-side bridge for the ARENA-FREE (staged) CALLDATALOAD (bead
evm-asm-t1iqb, phase B). The staging step materializes the 32-byte
CALLDATALOAD window into a small fixed buffer as
`stagedWindowBytes data offset = callDataCopyBytes data offset 32` — the
window byte... | /-
EvmAsm.Evm64.Calldata.StageWindow
Pure read-side bridge for the ARENA-FREE (staged) CALLDATALOAD (bead
evm-asm-t1iqb, phase B). The staging step materializes the 32-byte
CALLDATALOAD window into a small fixed buffer as
`stagedWindowBytes data offset = callDataCopyBytes data offset 32` — the
window byte... | @@ -42,9 +42,22 @@
(stagedWindowBytes data off).length = 32 := by
simp [stagedWindowBytes]
+/-- Bridge: the window word decoded from the raw offset `N` (via `loadArgs`
+ of any word whose `toNat` is `N`) is `callDataLoadWord data N`. -/
+private theorem window_word_eq (data : List (BitVec 8)) (offset : Evm... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_81b6610cc77d_0 | 238211aa076efe1c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Add/LimbSpec.lean | LimbSpec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "add_limb_carry_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have p1 := add_limb_carry_spec_phase1_within offA offB sp aLimb bLimb v7 v6 carryIn v11 base\n have p2 := add_l... | [
{
"name": "add_limb_carry_spec_phase2_within",
"text": "/-- ADD carry limb phase 2 (4 instructions): ADD, SLTU, OR, SD.\n Takes psum, carry1, carryIn, computes result = psum + carryIn,\n carry2 = (result < carryIn ? 1 : 0), carryOut = carry1 ||| carry2. -/\ntheorem add_limb_carry_spec_phase2_within (o... | [
{
"name": "add_limb_carry_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 32,
"n_chars": 1827,
"n_subproofs": 2,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.Add.LimbSpec
Per-limb ADD specs (from Arithmetic.lean).
-/
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- ADD carry limb phase 1 (4 instructions): LD, LD, ADD, SLTU.
Loads aLimb and bLimb, computes ps... | /-
EvmAsm.Evm64.Add.LimbSpec
Per-limb ADD specs (from Arithmetic.lean).
-/
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- ADD carry limb phase 1 (4 instructions): LD, LD, ADD, SLTU.
Loads aLimb and bLimb, computes ps... | @@ -38,6 +38,32 @@
have C := sltu_spec_gen_within .x11 .x7 .x6 v11 psum bLimb (base + 12) (by nofun)
runBlock L0 L1 A C
+/-- ADD carry limb phase 2 (4 instructions): ADD, SLTU, OR, SD.
+ Takes psum, carry1, carryIn, computes result = psum + carryIn,
+ carry2 = (result < carryIn ? 1 : 0), carryOut = carry1... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7e1c69cd65c0_0 | c3ba1487e1cbd409 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2TrialWitnesses.lean | N2TrialWitnesses | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "n2TrialWitnesses_of_getLimbN_shape_shift_nz",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨bltu_2, bltu_1, bltu_0, hbltu_2, hbltu_1, hbltu_0⟩ :=\n n2_trial_witnesses\n (a... | [
{
"name": "n2_trial_witnesses",
"text": "/-- The three n=2 trial-branch booleans always have canonical witnesses.\n\n This packages the mechanical branch-enumeration part needed by\n unconditional n=2 stack wrappers. The remaining non-mechanical\n obligations are the carry/addback and semantic divi... | [
{
"name": "n2TrialWitnesses_of_getLimbN_shape_shift_nz",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 731,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_o... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | @@ -34,6 +34,39 @@
(a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2) (a.getLimbN 3)
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3))
+/-- The three n=2 trial-branch booleans always have canonical witnesses.
+
+ This packages the mechanical branch-enumeration part needed by
+ uncondition... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7e1c69cd65c0_1 | ef67fa7cceab3ecd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2TrialWitnesses.lean | N2TrialWitnesses | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "n2V4TrialWitnesses_of_getLimbN",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨bltu_2, bltu_1, bltu_0, hbltu_2, hbltu_1, hbltu_0⟩ :=\n n2_v4_trial_witnesses\n (a.getLimbN ... | [
{
"name": "n2_v4_trial_witnesses",
"text": "/-- The three n=2 V4 trial-branch booleans always have canonical witnesses. -/\ntheorem n2_v4_trial_witnesses (a0 a1 a2 a3 b0 b1 b2 b3 : Word) :\n ∃ bltu_2 bltu_1 bltu_0,\n isTrialN2V4_j2 bltu_2 a0 a1 a2 a3 b0 b1 b2 b3 ∧\n isTrialN2V4_j1 bltu_2 bltu_1... | [
{
"name": "n2V4TrialWitnesses_of_getLimbN",
"fan_in": 6,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 451,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | @@ -52,10 +52,40 @@
(a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2) (a.getLimbN 3)
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3))
+/-- The three n=2 V4 trial-branch booleans always have canonical witnesses. -/
+theorem n2_v4_trial_witnesses (a0 a1 a2 a3 b0 b1 b2 b3 : Word) :
+ ∃ bltu_2... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7e1c69cd65c0_2 | c17cfcc3ab5f341f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2TrialWitnesses.lean | N2TrialWitnesses | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "N2V4TrialWitnesses.exists_quotient_word_of_path_conditions",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨bltu_2, bltu_1, bltu_0, hpath⟩ :=\n N2V4TrialWitnesses.exists_path_co... | [
{
"name": "N2V4TrialWitnesses.exists_path_conditions",
"text": "/-- Legacy: assemble an existential bundled N2 V4 path predicate from the mechanical\n trial witness bundle plus the remaining carry/arithmetic obligations.\n\n The arithmetic continuation receives the concrete branch booleans and\n th... | [
{
"name": "N2V4TrialWitnesses.exists_quotient_word_of_path_conditions",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 52,
"n_chars": 2789,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | @@ -52,6 +52,42 @@
(a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2) (a.getLimbN 3)
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3))
+/-- Legacy: assemble an existential bundled N2 V4 path predicate from the mechanical
+ trial witness bundle plus the remaining carry/arithmetic obligations.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7e1c69cd65c0_3 | cd0782aa10ec456f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2TrialWitnesses.lean | N2TrialWitnesses | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "N2V4TrialWitnesses.exists_quotient_word_of_selected_path_conditions",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨bltu_2, bltu_1, bltu_0, hpath⟩ :=\n N2V4TrialWitnesses.exist... | [
{
"name": "N2V4TrialWitnesses.exists_selected_path_conditions",
"text": "/-- Assemble an existential selected-carry N2 V4 path predicate from the\n mechanical trial witness bundle plus selected carry/arithmetic obligations.\n\n Unlike `N2V4TrialWitnesses.exists_path_conditions`, this does not require\... | [
{
"name": "N2V4TrialWitnesses.exists_quotient_word_of_selected_path_conditions",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 61,
"n_chars": 3421,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structur... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | @@ -52,6 +52,54 @@
(a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2) (a.getLimbN 3)
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3))
+/-- Assemble an existential selected-carry N2 V4 path predicate from the
+ mechanical trial witness bundle plus selected carry/arithmetic obligations.
+
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7e1c69cd65c0_4 | 4d021590ebac9344 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2TrialWitnesses.lean | N2TrialWitnesses | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "N2V4TrialWitnesses.exists_hdivs_of_path_conditions",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨bltu_2, bltu_1, bltu_0,\n hbltu_2, hbltu_1, hbltu_0, hdivWord⟩ :=\n N2V... | [
{
"name": "N2V4TrialWitnesses.exists_quotient_word_of_path_conditions",
"text": "/-- Legacy: assemble a V4 quotient-word equality from an `N2V4TrialWitnesses`\n bundle plus the remaining path-condition obligations.\n\n This still consumes `fullDivN2Carry2NzV4`; prefer the selected-path\n variant fo... | [
{
"name": "N2V4TrialWitnesses.exists_hdivs_of_path_conditions",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 61,
"n_chars": 3140,
"n_subproofs": 1,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"aut... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | @@ -88,6 +88,57 @@
exact ⟨bltu_2', bltu_1', bltu_0',
hbltu_2, hbltu_1, hbltu_0, hcarry2, hmulsub, hover⟩
+/-- Legacy: assemble a V4 quotient-word equality from an `N2V4TrialWitnesses`
+ bundle plus the remaining path-condition obligations.
+
+ This still consumes `fullDivN2Carry2NzV4`; prefer th... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7e1c69cd65c0_5 | 48f01f1dc99f532d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2TrialWitnesses.lean | N2TrialWitnesses | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "N2V4TrialWitnesses.exists_hdivs_of_selected_path_conditions",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨bltu_2, bltu_1, bltu_0,\n hbltu_2, hbltu_1, hbltu_0, hdivWord⟩ :=... | [
{
"name": "N2V4TrialWitnesses.exists_quotient_word_of_selected_path_conditions",
"text": "/-- Assemble a V4 quotient-word equality from an `N2V4TrialWitnesses` bundle\n plus selected carry/path obligations, avoiding the false universal\n `fullDivN2Carry2NzV4` package. -/\ntheorem N2V4TrialWitnesses.ex... | [
{
"name": "N2V4TrialWitnesses.exists_hdivs_of_selected_path_conditions",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 73,
"n_chars": 3864,
"n_subproofs": 1,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | @@ -100,6 +100,66 @@
hcarry bltu_2' bltu_1' bltu_0' hbltu_2 hbltu_1 hbltu_0,
hmulsub, hover⟩
+/-- Assemble a V4 quotient-word equality from an `N2V4TrialWitnesses` bundle
+ plus selected carry/path obligations, avoiding the false universal
+ `fullDivN2Carry2NzV4` package. -/
+theorem N2V4Trial... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7e1c69cd65c0_6 | 18a59aa8d6252d8b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2TrialWitnesses.lean | N2TrialWitnesses | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "N2V4TrialWitnesses.exists_hdivs_of_selected_path_conditions",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨bltu_2, bltu_1, bltu_0,\n hbltu_2, hbltu_1, hbltu_0, hdivWord⟩ :=... | [
{
"name": "N2V4TrialWitnesses.exists_quotient_word_of_selected_path_conditions",
"text": "/-- Assemble a V4 quotient-word equality from an `N2V4TrialWitnesses` bundle\n plus selected carry/path obligations, avoiding the false universal\n `fullDivN2Carry2NzV4` package. -/\ntheorem N2V4TrialWitnesses.ex... | [
{
"name": "N2V4TrialWitnesses.exists_quotient_word_of_selected_path_conditions_ne_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 53,
"n_chars": 2924,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | @@ -100,6 +100,66 @@
hcarry bltu_2' bltu_1' bltu_0' hbltu_2 hbltu_1 hbltu_0,
hmulsub, hover⟩
+/-- Assemble a V4 quotient-word equality from an `N2V4TrialWitnesses` bundle
+ plus selected carry/path obligations, avoiding the false universal
+ `fullDivN2Carry2NzV4` package. -/
+theorem N2V4Trial... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7e1c69cd65c0_7 | 9a0a75dffd7d7f75 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2TrialWitnesses.lean | N2TrialWitnesses | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "N2V4TrialWitnesses.exists_hdivs_of_selected_path_conditions_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact N2V4TrialWitnesses.exists_hdivs_of_selected_path_conditions\n ... | [
{
"name": "N2V4TrialWitnesses.exists_hdivs_of_selected_path_conditions",
"text": "/-- Assemble concrete V4 quotient-limb witnesses from an `N2V4TrialWitnesses`\n bundle plus selected carry/path obligations, avoiding the false universal\n `fullDivN2Carry2NzV4` package. -/\ntheorem N2V4TrialWitnesses.ex... | [
{
"name": "N2V4TrialWitnesses.exists_hdivs_of_selected_path_conditions_ne_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 62,
"n_chars": 3404,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structur... | 3 | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | @@ -160,6 +160,78 @@
fullDivN2QuotientWordV4_eq_div_of_selected_word_path_conditions
bltu_2 bltu_1 bltu_0 a b hbnz hpath⟩
+/-- Assemble concrete V4 quotient-limb witnesses from an `N2V4TrialWitnesses`
+ bundle plus selected carry/path obligations, avoiding the false universal
+ `fullDivN2Carry2NzV4`... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7e1c69cd65c0_8 | 2abfc323c16f7aa7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2TrialWitnesses.lean | N2TrialWitnesses | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "N2V4TrialWitnesses.exists_quotient_word_of_path_conditions",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨bltu_2, bltu_1, bltu_0, hpath⟩ :=\n N2V4TrialWitnesses.exists_path_co... | [
{
"name": "N2V4TrialWitnesses.exists_path_conditions",
"text": "/-- Legacy: assemble an existential bundled N2 V4 path predicate from the mechanical\n trial witness bundle plus the remaining carry/arithmetic obligations.\n\n The arithmetic continuation receives the concrete branch booleans and\n th... | [
{
"name": "N2V4TrialWitnesses.exists_quotient_word_of_path_conditions_ne_zero",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 50,
"n_chars": 2686,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structura... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | @@ -52,6 +52,42 @@
(a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2) (a.getLimbN 3)
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3))
+/-- Legacy: assemble an existential bundled N2 V4 path predicate from the mechanical
+ trial witness bundle plus the remaining carry/arithmetic obligations.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7e1c69cd65c0_9 | 63e009f248894cf9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2TrialWitnesses.lean | N2TrialWitnesses | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "N2V4TrialWitnesses.exists_quotient_word_of_path_conditions",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨bltu_2, bltu_1, bltu_0, hpath⟩ :=\n N2V4TrialWitnesses.exists_path_co... | [
{
"name": "N2V4TrialWitnesses.exists_path_conditions",
"text": "/-- Legacy: assemble an existential bundled N2 V4 path predicate from the mechanical\n trial witness bundle plus the remaining carry/arithmetic obligations.\n\n The arithmetic continuation receives the concrete branch booleans and\n th... | [
{
"name": "N2V4TrialWitnesses.exists_hdivs_of_path_conditions_ne_zero",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 63,
"n_chars": 3174,
"n_subproofs": 1,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | @@ -52,6 +52,42 @@
(a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2) (a.getLimbN 3)
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3))
+/-- Legacy: assemble an existential bundled N2 V4 path predicate from the mechanical
+ trial witness bundle plus the remaining carry/arithmetic obligations.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7e1c69cd65c0_10 | 99e0e9777d50b8a0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2TrialWitnesses.lean | N2TrialWitnesses | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "N2V4TrialWitnesses.exists_quotient_word_of_path_conditions",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨bltu_2, bltu_1, bltu_0, hpath⟩ :=\n N2V4TrialWitnesses.exists_path_co... | [
{
"name": "N2V4TrialWitnesses.exists_path_conditions",
"text": "/-- Legacy: assemble an existential bundled N2 V4 path predicate from the mechanical\n trial witness bundle plus the remaining carry/arithmetic obligations.\n\n The arithmetic continuation receives the concrete branch booleans and\n th... | [
{
"name": "n2V4_exists_quotient_word_of_path_conditions",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 47,
"n_chars": 2483,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation... | 4 | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | @@ -87,6 +87,42 @@
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3)
exact N2V4TrialWitnesses.mk bltu_2 bltu_1 bltu_0 hbltu_2 hbltu_1 hbltu_0
+/-- Legacy: assemble an existential bundled N2 V4 path predicate from the mechanical
+ trial witness bundle plus the remaining carry/arithmetic obligati... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7e1c69cd65c0_11 | 15d786e9b808a4c0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2TrialWitnesses.lean | N2TrialWitnesses | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "N2V4TrialWitnesses.exists_quotient_word_of_selected_path_conditions",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨bltu_2, bltu_1, bltu_0, hpath⟩ :=\n N2V4TrialWitnesses.exist... | [
{
"name": "N2V4TrialWitnesses.exists_selected_path_conditions",
"text": "/-- Assemble an existential selected-carry N2 V4 path predicate from the\n mechanical trial witness bundle plus selected carry/arithmetic obligations.\n\n Unlike `N2V4TrialWitnesses.exists_path_conditions`, this does not require\... | [
{
"name": "n2V4_exists_quotient_word_of_selected_path_conditions",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 57,
"n_chars": 3058,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"a... | 4 | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | @@ -87,6 +87,54 @@
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3)
exact N2V4TrialWitnesses.mk bltu_2 bltu_1 bltu_0 hbltu_2 hbltu_1 hbltu_0
+/-- Assemble an existential selected-carry N2 V4 path predicate from the
+ mechanical trial witness bundle plus selected carry/arithmetic obligations.
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7e1c69cd65c0_12 | 2dce731abf9b2fe8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2TrialWitnesses.lean | N2TrialWitnesses | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "N2V4TrialWitnesses.exists_quotient_word_of_path_conditions",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨bltu_2, bltu_1, bltu_0, hpath⟩ :=\n N2V4TrialWitnesses.exists_path_co... | [
{
"name": "N2V4TrialWitnesses.exists_path_conditions",
"text": "/-- Legacy: assemble an existential bundled N2 V4 path predicate from the mechanical\n trial witness bundle plus the remaining carry/arithmetic obligations.\n\n The arithmetic continuation receives the concrete branch booleans and\n th... | [
{
"name": "n2V4_quotient_word_of_path_conditions",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 37,
"n_chars": 1918,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only":... | 5 | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | @@ -87,6 +87,42 @@
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3)
exact N2V4TrialWitnesses.mk bltu_2 bltu_1 bltu_0 hbltu_2 hbltu_1 hbltu_0
+/-- Legacy: assemble an existential bundled N2 V4 path predicate from the mechanical
+ trial witness bundle plus the remaining carry/arithmetic obligati... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7e1c69cd65c0_13 | 9b03db04f63e5b56 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2TrialWitnesses.lean | N2TrialWitnesses | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 6 | [
{
"theorem_name": "n2V4_exists_quotient_word_of_path_conditions",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n N2V4TrialWitnesses.exists_quotient_word_of_path_conditions\n (n2V4TrialWitnesses_of_getLimbN a... | [
{
"name": "n2V4TrialWitnesses_of_getLimbN",
"text": "/-- Bundled public-surface n=2 V4 branch witnesses. -/\ntheorem n2V4TrialWitnesses_of_getLimbN\n (a b : EvmWord) :\n N2V4TrialWitnesses a b := by\n obtain ⟨bltu_2, bltu_1, bltu_0, hbltu_2, hbltu_1, hbltu_0⟩ :=\n n2_v4_trial_witnesses\n (a.g... | [
{
"name": "n2V4_quotient_word_of_path_conditions_ne_zero",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 40,
"n_chars": 2016,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automatio... | 3 | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | @@ -77,6 +77,16 @@
· unfold isTrialN2V4_j0
rfl
+/-- Bundled public-surface n=2 V4 branch witnesses. -/
+theorem n2V4TrialWitnesses_of_getLimbN
+ (a b : EvmWord) :
+ N2V4TrialWitnesses a b := by
+ obtain ⟨bltu_2, bltu_1, bltu_0, hbltu_2, hbltu_1, hbltu_0⟩ :=
+ n2_v4_trial_witnesses
+ (a.getLimbN... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7e1c69cd65c0_14 | 7f6268df6aadb1db | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2TrialWitnesses.lean | N2TrialWitnesses | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "N2V4TrialWitnesses.exists_hdivs_of_path_conditions",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨bltu_2, bltu_1, bltu_0,\n hbltu_2, hbltu_1, hbltu_0, hdivWord⟩ :=\n N2V... | [
{
"name": "N2V4TrialWitnesses.exists_quotient_word_of_path_conditions",
"text": "/-- Legacy: assemble a V4 quotient-word equality from an `N2V4TrialWitnesses`\n bundle plus the remaining path-condition obligations.\n\n This still consumes `fullDivN2Carry2NzV4`; prefer the selected-path\n variant fo... | [
{
"name": "n2V4_shape_quotient_word_of_path_conditions",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 38,
"n_chars": 1953,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_... | 6 | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | @@ -123,6 +123,57 @@
exact ⟨bltu_2', bltu_1', bltu_0',
hbltu_2, hbltu_1, hbltu_0, hcarry2, hmulsub, hover⟩
+/-- Legacy: assemble a V4 quotient-word equality from an `N2V4TrialWitnesses`
+ bundle plus the remaining path-condition obligations.
+
+ This still consumes `fullDivN2Carry2NzV4`; prefer ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "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.