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_a62b14314659_2 | 9adb05568b8183a8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN3V5NoNopPreloopMod.lean | FullPathN3V5NoNopPreloopMod | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "evm_mod_n3_to_loopSetup_spec_within_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 66,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let shift := (clzResult b2).1\n let antiShift := signExtend12 (0 : BitVec 12) - shift\n let... | [
{
"name": "evm_mod_n3_to_normB_spec_within_v5_noNop",
"text": "/-- PhaseAB(n=3) + CLZ + PhaseC2(ntaken) + NormB over `modCode_noNop_v5`. -/\ntheorem evm_mod_n3_to_normB_spec_within_v5_noNop (sp base : Word)\n (b0 b1 b2 b3 v5 v6 v7 v10 : Word)\n (q0 q1 q2 q3 u5 u6 u7 nMem shiftMem x2In : Word)\n (hb... | [
{
"name": "evm_mod_n3_to_loopSetup_spec_within_v5_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 91,
"n_chars": 5543,
"n_subproofs": 8,
"n_tactics": 68,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 1,
"automatio... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5NoNopPreloopMod
The v5 n=3 preloop execution-spec chain (entry → loop setup) over
`modCode_noNop_v5`. MOD mirror of `FullPathN3V5NoNopPreloop` (the DIV n=3
preloop): the preloop instructions precede the div128 block and are identical
between div and mod code, so ea... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5NoNopPreloopMod
The v5 n=3 preloop execution-spec chain (entry → loop setup) over
`modCode_noNop_v5`. MOD mirror of `FullPathN3V5NoNopPreloop` (the DIV n=3
preloop): the preloop instructions precede the div128 block and are identical
between div and mod code, so ea... | @@ -214,6 +214,65 @@
(fun h hq => by xperm_hyp hq)
hABCLZ
+/-- PhaseAB(n=3) + CLZ + PhaseC2(ntaken) + NormB over `modCode_noNop_v5`. -/
+theorem evm_mod_n3_to_normB_spec_within_v5_noNop (sp base : Word)
+ (b0 b1 b2 b3 v5 v6 v7 v10 : Word)
+ (q0 q1 q2 q3 u5 u6 u7 nMem shiftMem x2In : Word)
+ (hbnz :... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a62b14314659_3 | 0fd3aec3a2ba05e2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN3V5NoNopPreloopMod.lean | FullPathN3V5NoNopPreloopMod | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "evm_mod_n3_to_loopSetup_spec_within_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 66,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let shift := (clzResult b2).1\n let antiShift := signExtend12 (0 : BitVec 12) - shift\n let... | [
{
"name": "evm_mod_n3_to_normB_spec_within_v5_noNop",
"text": "/-- PhaseAB(n=3) + CLZ + PhaseC2(ntaken) + NormB over `modCode_noNop_v5`. -/\ntheorem evm_mod_n3_to_normB_spec_within_v5_noNop (sp base : Word)\n (b0 b1 b2 b3 v5 v6 v7 v10 : Word)\n (q0 q1 q2 q3 u5 u6 u7 nMem shiftMem x2In : Word)\n (hb... | [
{
"name": "evm_mod_n3_to_loopSetup_spec_within_v5_noNop_exact_x1_scratch_frame",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 61,
"n_chars": 3319,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structu... | 4 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5NoNopPreloopMod
The v5 n=3 preloop execution-spec chain (entry → loop setup) over
`modCode_noNop_v5`. MOD mirror of `FullPathN3V5NoNopPreloop` (the DIV n=3
preloop): the preloop instructions precede the div128 block and are identical
between div and mod code, so ea... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5NoNopPreloopMod
The v5 n=3 preloop execution-spec chain (entry → loop setup) over
`modCode_noNop_v5`. MOD mirror of `FullPathN3V5NoNopPreloop` (the DIV n=3
preloop): the preloop instructions precede the div128 block and are identical
between div and mod code, so ea... | @@ -214,6 +214,65 @@
(fun h hq => by xperm_hyp hq)
hABCLZ
+/-- PhaseAB(n=3) + CLZ + PhaseC2(ntaken) + NormB over `modCode_noNop_v5`. -/
+theorem evm_mod_n3_to_normB_spec_within_v5_noNop (sp base : Word)
+ (b0 b1 b2 b3 v5 v6 v7 v10 : Word)
+ (q0 q1 q2 q3 u5 u6 u7 nMem shiftMem x2In : Word)
+ (hbnz :... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a1b66e5b45d9_0 | 3cf1f0d81239a684 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/HandleWiden.lean | HandleWiden | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "window_heap_split",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [bytesRegion_append rw'.base (preB ++ win) sufB\n (by rw [List.length_append, hwl]; exact Nat.dvd_add hpre8 hwin... | [
{
"name": "bytesRegion_append",
"text": "/-- **Split a byte region at a dword boundary**: a region holding `xs ++ ys`\n with `8 ∣ xs.length` is the separating conjunction of the two\n sub-regions. This is the frame seam for per-frame writable windows. -/\ntheorem bytesRegion_append (b : Word) (xs ys ... | [
{
"name": "window_heap_split",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 36,
"n_chars": 1934,
"n_subproofs": 0,
"n_tactics": 25,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 5,
"n_structural": 1,
"automation_only": false,
"max_ne... | 1 | /-
EvmAsm.Rv64.SAsm.HandleWiden
Per-frame writable sub-regions for deep call trees (bead evm-asm-4ch8f.3).
`Stmt.CalleesIn` requires a callee to declare the *same* writable region
as its caller, so today a whole call tree shares one `RwRegion` and every
callee's contract must thread the caller's private sta... | /-
EvmAsm.Rv64.SAsm.HandleWiden
Per-frame writable sub-regions for deep call trees (bead evm-asm-4ch8f.3).
`Stmt.CalleesIn` requires a callee to declare the *same* writable region
as its caller, so today a whole call tree shares one `RwRegion` and every
callee's contract must thread the caller's private sta... | @@ -81,6 +81,20 @@
← sepConj_assoc',
← bytesRegion_eq_cons b xs hne]
+/-- **Split a byte region at a dword boundary**: a region holding `xs ++ ys`
+ with `8 ∣ xs.length` is the separating conjunction of the two
+ sub-regions. This is the frame seam for per-frame writable windows. -/
+theorem ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a1b66e5b45d9_1 | 31be9b4a0c436d14 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/HandleWiden.lean | HandleWiden | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "wLeafFn_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 29,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hx13' : ∀ rf : RegFile, rf.get .x13 = 0x10008 →\n (rf.set .x10 5).get .x13 = 0x10008 := by\n intro rf h\n rw ... | [
{
"name": "wleaf_hidx",
"text": "private theorem wleaf_hidx : ∀ rf : RegFile, rf.get .x13 = 0x10008 →\n ((rf.get .x13 + signExtend12 (0 : BitVec 12)) - (0x10008 : Word)).toNat = 0 := by\n intro rf h\n rw [h, show signExtend12 (0 : BitVec 12) = (0 : Word) from by decide]\n bv_omega\n\n",
"fan_in": ... | [
{
"name": "wLeafFn_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 31,
"n_chars": 1264,
"n_subproofs": 4,
"n_tactics": 31,
"cyclomatic": 3,
"n_automation": 13,
"n_rewrites": 7,
"n_structural": 8,
"automation_only": false,
"max_nestin... | 1 | /-
EvmAsm.Rv64.SAsm.HandleWiden
Per-frame writable sub-regions for deep call trees (bead evm-asm-4ch8f.3).
`Stmt.CalleesIn` requires a callee to declare the *same* writable region
as its caller, so today a whole call tree shares one `RwRegion` and every
callee's contract must thread the caller's private sta... | /-
EvmAsm.Rv64.SAsm.HandleWiden
Per-frame writable sub-regions for deep call trees (bead evm-asm-4ch8f.3).
`Stmt.CalleesIn` requires a callee to declare the *same* writable region
as its caller, so today a whole call tree shares one `RwRegion` and every
callee's contract must thread the caller's private sta... | @@ -345,8 +345,42 @@
∧ ws = dwordBytes 5
body := .block "store" [.LI .x10 5, .SD .x13 .x10 0]
-theorem wLeafFn_spec : wLeafFn.Spec 0x2000 := sorry
+private theorem wleaf_hidx : ∀ rf : RegFile, rf.get .x13 = 0x10008 →
+ ((rf.get .x13 + signExtend12 (0 : BitVec 12)) - (0x10008 : Word)).toNat = 0 := by
+ int... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a1b66e5b45d9_2 | cc53c2e1015f4c11 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/HandleWiden.lean | HandleWiden | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "roLeafFn_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n vcgen\n case region => exact ⟨hwf, RwRegion.empty_wf⟩\n case roleaf.load.mem =>\n rintro rf ws A hws ⟨hx11, hne⟩\n o... | [
{
"name": "roleaf_hidx",
"text": "private theorem roleaf_hidx (b : Word) : ∀ rf : RegFile, rf.get .x11 = b →\n ((rf.get .x11 + signExtend12 (0 : BitVec 12)) - b).toNat = 0 := by\n intro rf h\n rw [h, show signExtend12 (0 : BitVec 12) = (0 : Word) from by decide]\n bv_omega\n\n",
"fan_in": 1,
"... | [
{
"name": "roLeafFn_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 29,
"n_chars": 1206,
"n_subproofs": 3,
"n_tactics": 26,
"cyclomatic": 3,
"n_automation": 9,
"n_rewrites": 7,
"n_structural": 6,
"automation_only": false,
"max_nestin... | 1 | /-
EvmAsm.Rv64.SAsm.HandleWiden
Per-frame writable sub-regions for deep call trees (bead evm-asm-4ch8f.3).
`Stmt.CalleesIn` requires a callee to declare the *same* writable region
as its caller, so today a whole call tree shares one `RwRegion` and every
callee's contract must thread the caller's private sta... | /-
EvmAsm.Rv64.SAsm.HandleWiden
Per-frame writable sub-regions for deep call trees (bead evm-asm-4ch8f.3).
`Stmt.CalleesIn` requires a callee to declare the *same* writable region
as its caller, so today a whole call tree shares one `RwRegion` and every
callee's contract must thread the caller's private sta... | @@ -548,8 +548,39 @@
post := fun rf _ _ => rf.get .x10 = (xs.getD 0 0).zeroExtend 64
body := .block "load" [.LBU .x10 .x11 0]
+private theorem roleaf_hidx (b : Word) : ∀ rf : RegFile, rf.get .x11 = b →
+ ((rf.get .x11 + signExtend12 (0 : BitVec 12)) - b).toNat = 0 := by
+ intro rf h
+ rw [h, show signExten... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_05d83947c0d4_0 | f87ecb5eff15e5f8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Bls12G1MsmResultBridge.lean | Bls12G1MsmResultBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "acceleratorOutput_point_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n g1PointBytesList_length output.point",
"n_chars": 39,
"n_subproofs": 0,
"n_tactics": 1,
"cyclom... | [
{
"name": "g1PointBytesList_length",
"text": "theorem g1PointBytesList_length (point : G1PointBytes) :\n (g1PointBytesList point).length = 96 := by\n simp [g1PointBytesList]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 131,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n... | [
{
"name": "acceleratorOutput_point_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 161,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.EL.Bls12G1MsmResultBridge
Bridge from the `zkvm_bls12_g1_msm` accelerator output to the executable
precompile-result surface.
-/
import EvmAsm.Evm64.Accelerators.Status
import EvmAsm.EL.WorldState
namespace EvmAsm.EL
namespace Bls12G1MsmResultBridge
abbrev ZkvmStatus := EvmAsm.Accelerators.ZkvmStat... | /-
EvmAsm.EL.Bls12G1MsmResultBridge
Bridge from the `zkvm_bls12_g1_msm` accelerator output to the executable
precompile-result surface.
-/
import EvmAsm.Evm64.Accelerators.Status
import EvmAsm.EL.WorldState
namespace EvmAsm.EL
namespace Bls12G1MsmResultBridge
abbrev ZkvmStatus := EvmAsm.Accelerators.ZkvmStat... | @@ -27,8 +27,13 @@
def g1PointBytesList (point : G1PointBytes) : List Byte :=
List.ofFn point
+theorem g1PointBytesList_length (point : G1PointBytes) :
+ (g1PointBytesList point).length = 96 := by
+ simp [g1PointBytesList]
+
theorem acceleratorOutput_point_length (output : AcceleratorOutput) :
- (g1PointB... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_80924934a925_0 | 4b89fc027ab936ba | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase2LongLoopFour.lean | Phase2LongLoopFour | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "rlp_phase2_long_loop_four_byte_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 49,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [rlp_phase2_long_loop_four_byte_post_unfold]\n -- Iter 1: body at cnt = 4. cnt' = 3.... | [
{
"name": "rlp_phase2_long_loop_four_byte_post_unfold",
"text": "theorem rlp_phase2_long_loop_four_byte_post_unfold\n (len ptr byte1 byte2 byte3 byte4 wordVal dwordAddr : Word) :\n rlp_phase2_long_loop_four_byte_post len ptr byte1 byte2 byte3 byte4\n wordVal dwordAddr =\n ((.x11 ↦ᵣ (((((len ... | [
{
"name": "rlp_phase2_long_loop_four_byte_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 76,
"n_chars": 3734,
"n_subproofs": 9,
"n_tactics": 51,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 11,
"n_structural": 5,
"automation... | 1 | /-
EvmAsm.Rv64.RLP.Phase2LongLoopFour
EL.3 Phase 2 (long form) — four-iteration closure of the loop body.
Specializes `rlp_phase2_long_loop_body_spec` (#333) at `x14 = 4`,
composed with `rlp_phase2_long_loop_three_byte_spec` (#337) for the
remaining three iterations.
Corresponds to RLP prefixes `0xBB` an... | /-
EvmAsm.Rv64.RLP.Phase2LongLoopFour
EL.3 Phase 2 (long form) — four-iteration closure of the loop body.
Specializes `rlp_phase2_long_loop_body_spec` (#333) at `x14 = 4`,
composed with `rlp_phase2_long_loop_three_byte_spec` (#337) for the
remaining three iterations.
Corresponds to RLP prefixes `0xBB` an... | @@ -35,6 +35,18 @@
(.x12 ↦ᵣ byte4) ** (.x0 ↦ᵣ (0 : Word)) **
(dwordAddr ↦ₘ wordVal)
+theorem rlp_phase2_long_loop_four_byte_post_unfold
+ (len ptr byte1 byte2 byte3 byte4 wordVal dwordAddr : Word) :
+ rlp_phase2_long_loop_four_byte_post len ptr byte1 byte2 byte3 byte4
+ wordVal dwordAddr =
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ac691831c190_0 | 2cd3bef82bd6edf5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/StmtSoundCall.lean | StmtSoundCall | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "Stmt.soundR",
"depth": 1,
"n_commands": 0,
"n_lines": 2094,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction s generalizing base pfx reach cr with\n | block lbl is =>\n exact cpsTripleWithin_frameR (regOwn .x1) pcFree... | [
{
"name": "pcFree_asrtR",
"text": "theorem pcFree_asrtR (reg : Region) (rw : RwRegion) (reach : Reach) :\n (asrtR reg rw reach).pcFree :=\n pcFree_sepConj (pcFree_asrtM _ _ _) pcFree_regOwn\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 158,
"n_subproofs": 0,
"n_tactics": 1,
"cyclom... | [
{
"name": "Stmt.soundR",
"fan_in": 0,
"n_deps_direct": 8,
"n_deps_transitive": 8,
"n_lines": 2110,
"n_chars": 121495,
"n_subproofs": 390,
"n_tactics": 2124,
"cyclomatic": 44,
"n_automation": 257,
"n_rewrites": 541,
"n_structural": 420,
"automation_only": false,
... | 8 | /-
EvmAsm.Rv64.SAsm.StmtSoundCall
Caller-shaped soundness of the SAsm VC generator: like `Stmt.sound`, but
the triple carries ownership of `ra` (`regOwn .x1`) so that `call` nodes
can be verified via `WP.cpsCallWithin` against the callee's `FnHandle`.
Compared to the leaf theorem, the pre/postcondition is
... | /-
EvmAsm.Rv64.SAsm.StmtSoundCall
Caller-shaped soundness of the SAsm VC generator: like `Stmt.sound`, but
the triple carries ownership of `ra` (`regOwn .x1`) so that `call` nodes
can be verified via `WP.cpsCallWithin` against the callee's `FnHandle`.
Compared to the leaf theorem, the pre/postcondition is
... | @@ -30,139 +30,2236 @@
-theorem asrtR_mono {reg : Region} {rw : RwRegion} {r₁ r₂ : Reach}
- (h : ∀ rf ws A, r₁ rf ws A → r₂ rf ws A) :
- ∀ hp, asrtR reg rw r₁ hp → asrtR reg rw r₂ hp :=
- fun hp => sepConj_mono_left (asrtM_mono h) hp
-
-theorem asrtR_unsat {reg : Region} {rw : RwRegion} {r : Reach}
- (h : ∀ r... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e1d1233c58c6_0 | ca9d6650c71cb84f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedBoolStep.lean | SavedBitFixedBoolStep | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "expTwoMulFixedBranchResult_decide_highBit_eq_squareW_of_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hDecide :\n decide ((e >>> (63 : BitVec 6).toNat) +\n signExt... | [
{
"name": "expTwoMulFixedBranchResult_false",
"text": "theorem expTwoMulFixedBranchResult_false\n (a0 a1 a2 a3 r0 r1 r2 r3 : Word) :\n expTwoMulFixedBranchResult false a0 a1 a2 a3 r0 r1 r2 r3 =\n expSquaringCallSquareW r0 r1 r2 r3 := by\n rfl\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars... | [
{
"name": "expTwoMulFixedBranchResult_decide_highBit_eq_squareW_of_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 608,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
Bool-indexed semantic result bridge for one fixed saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Concrete accumulator word produced by one fixed-loop iteration, inde... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
Bool-indexed semantic result bridge for one fixed saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Concrete accumulator word produced by one fixed-loop iteration, inde... | @@ -20,6 +20,12 @@
else
expSquaringCallSquareW r0 r1 r2 r3
+theorem expTwoMulFixedBranchResult_false
+ (a0 a1 a2 a3 r0 r1 r2 r3 : Word) :
+ expTwoMulFixedBranchResult false a0 a1 a2 a3 r0 r1 r2 r3 =
+ expSquaringCallSquareW r0 r1 r2 r3 := by
+ rfl
+
theorem expTwoMulFixedBranchResult_decide_highB... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e1d1233c58c6_1 | a07c7834bee2eb78 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedBoolStep.lean | SavedBitFixedBoolStep | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "expTwoMulFixedBranchResult_decide_highBit_eq_condRw_of_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hDecide :\n decide ((e >>> (63 : BitVec 6).toNat) +\n signE... | [
{
"name": "expTwoMulFixedBranchResult_true",
"text": "theorem expTwoMulFixedBranchResult_true\n (a0 a1 a2 a3 r0 r1 r2 r3 : Word) :\n expTwoMulFixedBranchResult true a0 a1 a2 a3 r0 r1 r2 r3 =\n expTwoMulCondRw (expSquaringCallSquareW r0 r1 r2 r3)\n a0 a1 a2 a3 := by\n rfl\n\n",
"fan_in... | [
{
"name": "expTwoMulFixedBranchResult_decide_highBit_eq_condRw_of_ne_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 649,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
Bool-indexed semantic result bridge for one fixed saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Concrete accumulator word produced by one fixed-loop iteration, inde... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
Bool-indexed semantic result bridge for one fixed saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Concrete accumulator word produced by one fixed-loop iteration, inde... | @@ -20,6 +20,13 @@
else
expSquaringCallSquareW r0 r1 r2 r3
+theorem expTwoMulFixedBranchResult_true
+ (a0 a1 a2 a3 r0 r1 r2 r3 : Word) :
+ expTwoMulFixedBranchResult true a0 a1 a2 a3 r0 r1 r2 r3 =
+ expTwoMulCondRw (expSquaringCallSquareW r0 r1 r2 r3)
+ a0 a1 a2 a3 := by
+ rfl
+
theorem ex... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e1d1233c58c6_2 | aa3f458a51cc8a26 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedBoolStep.lean | SavedBitFixedBoolStep | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "expTwoMulFixedAccumulatorInvariant_succ_of_branchResult",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine\n expTwoMulFixedAccumulatorInvariant_succ_of_step (bit := bit)\n hIn... | [
{
"name": "expTwoMulFixedAccumulatorStep_eq_branchResult",
"text": "theorem expTwoMulFixedAccumulatorStep_eq_branchResult\n {baseWord : EvmWord} {bit : Bool}\n {a0 a1 a2 a3 r0 r1 r2 r3 : Word}\n (hBase : baseWord = expResultWord a0 a1 a2 a3) :\n expTwoMulFixedAccumulatorStep baseWord\n (e... | [
{
"name": "expTwoMulFixedAccumulatorInvariant_succ_of_branchResult",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 34,
"n_chars": 1448,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 3,
... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
Bool-indexed semantic result bridge for one fixed saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Concrete accumulator word produced by one fixed-loop iteration, inde... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
Bool-indexed semantic result bridge for one fixed saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Concrete accumulator word produced by one fixed-loop iteration, inde... | @@ -20,6 +20,18 @@
else
expSquaringCallSquareW r0 r1 r2 r3
+theorem expTwoMulFixedAccumulatorStep_eq_branchResult
+ {baseWord : EvmWord} {bit : Bool}
+ {a0 a1 a2 a3 r0 r1 r2 r3 : Word}
+ (hBase : baseWord = expResultWord a0 a1 a2 a3) :
+ expTwoMulFixedAccumulatorStep baseWord
+ (expResultWo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e1d1233c58c6_3 | 9b905cad46098994 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedBoolStep.lean | SavedBitFixedBoolStep | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "expTwoMulFixedAccumulatorInvariant_succ_of_branchResult",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine\n expTwoMulFixedAccumulatorInvariant_succ_of_step (bit := bit)\n hIn... | [
{
"name": "expTwoMulFixedAccumulatorStep_eq_branchResult",
"text": "theorem expTwoMulFixedAccumulatorStep_eq_branchResult\n {baseWord : EvmWord} {bit : Bool}\n {a0 a1 a2 a3 r0 r1 r2 r3 : Word}\n (hBase : baseWord = expResultWord a0 a1 a2 a3) :\n expTwoMulFixedAccumulatorStep baseWord\n (e... | [
{
"name": "expTwoMulFixedNoReloadInvariants_succ_of_branchResult",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 39,
"n_chars": 1720,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"a... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
Bool-indexed semantic result bridge for one fixed saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Concrete accumulator word produced by one fixed-loop iteration, inde... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
Bool-indexed semantic result bridge for one fixed saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Concrete accumulator word produced by one fixed-loop iteration, inde... | @@ -20,6 +20,18 @@
else
expSquaringCallSquareW r0 r1 r2 r3
+theorem expTwoMulFixedAccumulatorStep_eq_branchResult
+ {baseWord : EvmWord} {bit : Bool}
+ {a0 a1 a2 a3 r0 r1 r2 r3 : Word}
+ (hBase : baseWord = expResultWord a0 a1 a2 a3) :
+ expTwoMulFixedAccumulatorStep baseWord
+ (expResultWo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e1d1233c58c6_4 | f950d61a33008422 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedBoolStep.lean | SavedBitFixedBoolStep | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "expTwoMulFixedAccumulatorInvariant_succ_of_branchResult",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine\n expTwoMulFixedAccumulatorInvariant_succ_of_step (bit := bit)\n hIn... | [
{
"name": "expTwoMulFixedAccumulatorStep_eq_branchResult",
"text": "theorem expTwoMulFixedAccumulatorStep_eq_branchResult\n {baseWord : EvmWord} {bit : Bool}\n {a0 a1 a2 a3 r0 r1 r2 r3 : Word}\n (hBase : baseWord = expResultWord a0 a1 a2 a3) :\n expTwoMulFixedAccumulatorStep baseWord\n (e... | [
{
"name": "expTwoMulFixedReloadInvariants_succ_of_branchResult",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 40,
"n_chars": 1718,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"aut... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
Bool-indexed semantic result bridge for one fixed saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Concrete accumulator word produced by one fixed-loop iteration, inde... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
Bool-indexed semantic result bridge for one fixed saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Concrete accumulator word produced by one fixed-loop iteration, inde... | @@ -20,6 +20,18 @@
else
expSquaringCallSquareW r0 r1 r2 r3
+theorem expTwoMulFixedAccumulatorStep_eq_branchResult
+ {baseWord : EvmWord} {bit : Bool}
+ {a0 a1 a2 a3 r0 r1 r2 r3 : Word}
+ (hBase : baseWord = expResultWord a0 a1 a2 a3) :
+ expTwoMulFixedAccumulatorStep baseWord
+ (expResultWo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e1d1233c58c6_5 | f749909038f1068a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedBoolStep.lean | SavedBitFixedBoolStep | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "expTwoMulFixedAccumulatorInvariant_succ_of_branchResult",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine\n expTwoMulFixedAccumulatorInvariant_succ_of_step (bit := bit)\n hIn... | [
{
"name": "expTwoMulFixedAccumulatorStep_eq_branchResult",
"text": "theorem expTwoMulFixedAccumulatorStep_eq_branchResult\n {baseWord : EvmWord} {bit : Bool}\n {a0 a1 a2 a3 r0 r1 r2 r3 : Word}\n (hBase : baseWord = expResultWord a0 a1 a2 a3) :\n expTwoMulFixedAccumulatorStep baseWord\n (e... | [
{
"name": "expTwoMulFixedNoReloadInvariants_succ_of_decideBranchResult",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 46,
"n_chars": 2041,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
... | 4 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
Bool-indexed semantic result bridge for one fixed saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Concrete accumulator word produced by one fixed-loop iteration, inde... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
Bool-indexed semantic result bridge for one fixed saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Concrete accumulator word produced by one fixed-loop iteration, inde... | @@ -20,6 +20,18 @@
else
expSquaringCallSquareW r0 r1 r2 r3
+theorem expTwoMulFixedAccumulatorStep_eq_branchResult
+ {baseWord : EvmWord} {bit : Bool}
+ {a0 a1 a2 a3 r0 r1 r2 r3 : Word}
+ (hBase : baseWord = expResultWord a0 a1 a2 a3) :
+ expTwoMulFixedAccumulatorStep baseWord
+ (expResultWo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e1d1233c58c6_6 | c5e35edebc217898 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedBoolStep.lean | SavedBitFixedBoolStep | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "expTwoMulFixedAccumulatorInvariant_succ_of_branchResult",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine\n expTwoMulFixedAccumulatorInvariant_succ_of_step (bit := bit)\n hIn... | [
{
"name": "expTwoMulFixedAccumulatorStep_eq_branchResult",
"text": "theorem expTwoMulFixedAccumulatorStep_eq_branchResult\n {baseWord : EvmWord} {bit : Bool}\n {a0 a1 a2 a3 r0 r1 r2 r3 : Word}\n (hBase : baseWord = expResultWord a0 a1 a2 a3) :\n expTwoMulFixedAccumulatorStep baseWord\n (e... | [
{
"name": "expTwoMulFixedReloadInvariants_succ_of_decideBranchResult",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 44,
"n_chars": 1896,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
... | 4 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
Bool-indexed semantic result bridge for one fixed saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Concrete accumulator word produced by one fixed-loop iteration, inde... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
Bool-indexed semantic result bridge for one fixed saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Concrete accumulator word produced by one fixed-loop iteration, inde... | @@ -20,6 +20,18 @@
else
expSquaringCallSquareW r0 r1 r2 r3
+theorem expTwoMulFixedAccumulatorStep_eq_branchResult
+ {baseWord : EvmWord} {bit : Bool}
+ {a0 a1 a2 a3 r0 r1 r2 r3 : Word}
+ (hBase : baseWord = expResultWord a0 a1 a2 a3) :
+ expTwoMulFixedAccumulatorStep baseWord
+ (expResultWo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c43dc721a782_0 | 36a3649cd7c69d08 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Bls12G2MsmResultBridge.lean | Bls12G2MsmResultBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "acceleratorOutput_point_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n g2PointBytesList_length output.point",
"n_chars": 39,
"n_subproofs": 0,
"n_tactics": 1,
"cyclom... | [
{
"name": "g2PointBytesList_length",
"text": "theorem g2PointBytesList_length (point : G2PointBytes) :\n (g2PointBytesList point).length = 192 := by\n unfold g2PointBytesList\n exact List.length_ofFn\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 157,
"n_subproofs": 0,
"n_tactics": 3,
... | [
{
"name": "acceleratorOutput_point_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 162,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.EL.Bls12G2MsmResultBridge
Bridge from the `zkvm_bls12_g2_msm` accelerator output to the executable
precompile-result surface.
-/
import EvmAsm.Evm64.Accelerators.Status
import EvmAsm.EL.WorldState
namespace EvmAsm.EL
namespace Bls12G2MsmResultBridge
abbrev ZkvmStatus := EvmAsm.Accelerators.ZkvmStat... | /-
EvmAsm.EL.Bls12G2MsmResultBridge
Bridge from the `zkvm_bls12_g2_msm` accelerator output to the executable
precompile-result surface.
-/
import EvmAsm.Evm64.Accelerators.Status
import EvmAsm.EL.WorldState
namespace EvmAsm.EL
namespace Bls12G2MsmResultBridge
abbrev ZkvmStatus := EvmAsm.Accelerators.ZkvmStat... | @@ -27,8 +27,14 @@
def g2PointBytesList (point : G2PointBytes) : List Byte :=
List.ofFn point
+theorem g2PointBytesList_length (point : G2PointBytes) :
+ (g2PointBytesList point).length = 192 := by
+ unfold g2PointBytesList
+ exact List.length_ofFn
+
theorem acceleratorOutput_point_length (output : Accelera... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a821e2399bfd_0 | 1acb6898196b2758 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Bn254G1AddPrecompileDispatch.lean | Bn254G1AddPrecompileDispatch | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "dispatch_success_output_length",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatch_success accelerator h_target h_gas h_status]\n simp [Bn254PrecompileResultBridge.addOutputByte... | [
{
"name": "dispatch_success",
"text": "theorem dispatch_success\n (accelerator : AcceleratorInput -> EvmAsm.Accelerators.ZkvmStatus × AcceleratorOutput)\n {input : EvmAsm.Evm64.PrecompileInput}\n (h_target : input.target = .bn254Add)\n (h_gas : gasCost input.input <= input.gas)\n (h_status : ... | [
{
"name": "dispatch_success_output_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 550,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.EL.Bn254G1AddPrecompileDispatch
Pure EVM BN254 G1 addition precompile framing. Point decoding and addition
are supplied by the accelerator boundary; this module fixes the
execution-specs-visible target, fixed gas, call-data slicing, and common
precompile result shape.
-/
import EvmAsm.EL.Bn254Prec... | /-
EvmAsm.EL.Bn254G1AddPrecompileDispatch
Pure EVM BN254 G1 addition precompile framing. Point decoding and addition
are supplied by the accelerator boundary; this module fixes the
execution-specs-visible target, fixed gas, call-data slicing, and common
precompile result shape.
-/
import EvmAsm.EL.Bn254Prec... | @@ -70,6 +70,25 @@
else
EvmAsm.Evm64.PrecompileResult.fail input.gas
+theorem dispatch_success
+ (accelerator : AcceleratorInput -> EvmAsm.Accelerators.ZkvmStatus × AcceleratorOutput)
+ {input : EvmAsm.Evm64.PrecompileInput}
+ (h_target : input.target = .bn254Add)
+ (h_gas : gasCost input.input <=... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a19f05ed98a8_0 | c8ada267b688fc2a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DivN3MaxOverestimate.lean | DivN3MaxOverestimate | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "max_trial_local_overestimate_n3_of_not_ult",
"depth": 1,
"n_commands": 0,
"n_lines": 51,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [signExtend12_4095_toNat]\n unfold EvmWord.val256\n -- Powers of two; folded back through ... | [
{
"name": "core_overestimate_step_n3",
"text": "/-- Core Nat-level inequality for the N3 max-path overestimate:\n `(B - 3) * (V0 + V1*B + V2*B²) ≤ U0 + U1*B + U2*B² + U3*B³`\n when `V0, V1 < B`, `2 * 2^63 = B`, `2^63 ≤ V2`, and `V2 ≤ U3`. -/\nprivate theorem core_overestimate_step_n3\n (B V0 V1 V2 ... | [
{
"name": "max_trial_local_overestimate_n3_of_not_ult",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 62,
"n_chars": 2700,
"n_subproofs": 17,
"n_tactics": 48,
"cyclomatic": 1,
"n_automation": 15,
"n_rewrites": 9,
"n_structural": 2,
"automatio... | 1 | /-
EvmAsm.Evm64.EvmWordArith.DivN3MaxOverestimate
Max-path local quotient overestimate bound for the n=3 outer-loop iteration.
In Knuth's Algorithm D, when the divisor has exactly three (pre-normalisation)
significant limbs (b3 = 0, b2 ≠ 0) and the leading-zero shift is applied so
the normalised v has v2 ≥ ... | /-
EvmAsm.Evm64.EvmWordArith.DivN3MaxOverestimate
Max-path local quotient overestimate bound for the n=3 outer-loop iteration.
In Knuth's Algorithm D, when the divisor has exactly three (pre-normalisation)
significant limbs (b3 = 0, b2 ≠ 0) and the leading-zero shift is applied so
the normalised v has v2 ≥ ... | @@ -18,6 +18,99 @@
open EvmWord EvmAsm.Rv64
+/-- Core Nat-level inequality for the N3 max-path overestimate:
+ `(B - 3) * (V0 + V1*B + V2*B²) ≤ U0 + U1*B + U2*B² + U3*B³`
+ when `V0, V1 < B`, `2 * 2^63 = B`, `2^63 ≤ V2`, and `V2 ≤ U3`. -/
+private theorem core_overestimate_step_n3
+ (B V0 V1 V2 U0 U1 U2 U... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a19f05ed98a8_1 | e59c1e42531b887e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DivN3MaxOverestimate.lean | DivN3MaxOverestimate | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "max_trial_local_overestimate_n3_of_not_ult",
"depth": 1,
"n_commands": 0,
"n_lines": 51,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [signExtend12_4095_toNat]\n unfold EvmWord.val256\n -- Powers of two; folded back through ... | [
{
"name": "core_overestimate_step_n3",
"text": "/-- Core Nat-level inequality for the N3 max-path overestimate:\n `(B - 3) * (V0 + V1*B + V2*B²) ≤ U0 + U1*B + U2*B² + U3*B³`\n when `V0, V1 < B`, `2 * 2^63 = B`, `2^63 ≤ V2`, and `V2 ≤ U3`. -/\nprivate theorem core_overestimate_step_n3\n (B V0 V1 V2 ... | [
{
"name": "isAddbackCarry2NzN3Max_of_not_ult_c3_one_of_carry_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 35,
"n_chars": 1596,
"n_subproofs": 4,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 4,
... | 2 | /-
EvmAsm.Evm64.EvmWordArith.DivN3MaxOverestimate
Max-path local quotient overestimate bound for the n=3 outer-loop iteration.
In Knuth's Algorithm D, when the divisor has exactly three (pre-normalisation)
significant limbs (b3 = 0, b2 ≠ 0) and the leading-zero shift is applied so
the normalised v has v2 ≥ ... | /-
EvmAsm.Evm64.EvmWordArith.DivN3MaxOverestimate
Max-path local quotient overestimate bound for the n=3 outer-loop iteration.
In Knuth's Algorithm D, when the divisor has exactly three (pre-normalisation)
significant limbs (b3 = 0, b2 ≠ 0) and the leading-zero shift is applied so
the normalised v has v2 ≥ ... | @@ -18,6 +18,99 @@
open EvmWord EvmAsm.Rv64
+/-- Core Nat-level inequality for the N3 max-path overestimate:
+ `(B - 3) * (V0 + V1*B + V2*B²) ≤ U0 + U1*B + U2*B² + U3*B³`
+ when `V0, V1 < B`, `2 * 2^63 = B`, `2^63 ≤ V2`, and `V2 ≤ U3`. -/
+private theorem core_overestimate_step_n3
+ (B V0 V1 V2 U0 U1 U2 U... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8c723ba60787_0 | 34e28d60d4d1824e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN2.lean | LoopIterN2 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 4 | [
{
"theorem_name": "divK_loop_body_n2_max_skip_j0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 77,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hborrow\n let uBase := sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat\n le... | [
{
"name": "loopBodyN2MaxSkipJ0Pre_unfold",
"text": "theorem loopBodyN2MaxSkipJ0Pre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :\n loopBodyN2MaxSkipJ0Pre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld =... | [
{
"name": "divK_loop_body_n2_max_skip_j0_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 88,
"n_chars": 4447,
"n_subproofs": 7,
"n_tactics": 80,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 7,
"n_structural": 2,
"automation_o... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | @@ -47,6 +47,26 @@
((uBase + signExtend12 4064) ↦ₘ uTop) **
(qAddr ↦ₘ qOld)
+theorem loopBodyN2MaxSkipJ0Pre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :
+ loopBodyN2MaxSkipJ0Pre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8c723ba60787_1 | e681b469b265ce85 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN2.lean | LoopIterN2 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 4 | [
{
"theorem_name": "divK_loop_body_n2_max_skip_j0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 77,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hborrow\n let uBase := sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat\n le... | [
{
"name": "loopBodyN2MaxSkipJ0Pre_unfold",
"text": "theorem loopBodyN2MaxSkipJ0Pre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :\n loopBodyN2MaxSkipJ0Pre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld =... | [
{
"name": "divK_loop_body_n2_max_skip_j0_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 84,
"n_chars": 4343,
"n_subproofs": 7,
"n_tactics": 80,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 7,
"n_structural": 2,
"automa... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | @@ -47,6 +47,26 @@
((uBase + signExtend12 4064) ↦ₘ uTop) **
(qAddr ↦ₘ qOld)
+theorem loopBodyN2MaxSkipJ0Pre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :
+ loopBodyN2MaxSkipJ0Pre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8c723ba60787_2 | a242e10ab65f5450 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN2.lean | LoopIterN2 | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 3 | [
{
"theorem_name": "divK_loop_body_n2_call_skip_j0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 105,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let uBase := sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat\n let qAddr := sp +... | [
{
"name": "loopBodyN2CallSkipJ0Pre_unfold",
"text": "theorem loopBodyN2CallSkipJ0Pre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)\n (retMem dMem dloMem scratch_un0 : Word) :\n loopBodyN2CallSkipJ0Pre sp jOld v5Old v6Old v7Old v10Old v11Old ... | [
{
"name": "divK_loop_body_n2_call_skip_j0_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 118,
"n_chars": 6377,
"n_subproofs": 8,
"n_tactics": 114,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 9,
"n_structural": 1,
"automatio... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | @@ -72,6 +72,31 @@
(sp + signExtend12 3952 ↦ₘ dloMem) **
(sp + signExtend12 3944 ↦ₘ scratch_un0) ** regOwn .x1
+theorem loopBodyN2CallSkipJ0Pre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)
+ (retMem dMem dloMem scratch_un0 : Word) :
+ loopBodyN... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8c723ba60787_3 | 1d67eb6531f6478f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN2.lean | LoopIterN2 | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 3 | [
{
"theorem_name": "divK_loop_body_n2_call_skip_j0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 105,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let uBase := sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat\n let qAddr := sp +... | [
{
"name": "loopBodyN2CallSkipJ0Pre_unfold",
"text": "theorem loopBodyN2CallSkipJ0Pre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)\n (retMem dMem dloMem scratch_un0 : Word) :\n loopBodyN2CallSkipJ0Pre sp jOld v5Old v6Old v7Old v10Old v11Old ... | [
{
"name": "divK_loop_body_n2_call_skip_j0_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 113,
"n_chars": 6317,
"n_subproofs": 8,
"n_tactics": 114,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 9,
"n_structural": 1,
"aut... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | @@ -72,6 +72,31 @@
(sp + signExtend12 3952 ↦ₘ dloMem) **
(sp + signExtend12 3944 ↦ₘ scratch_un0) ** regOwn .x1
+theorem loopBodyN2CallSkipJ0Pre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)
+ (retMem dMem dloMem scratch_un0 : Word) :
+ loopBodyN... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8c723ba60787_4 | f311ea0ae5ce27e2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN2.lean | LoopIterN2 | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 3 | [
{
"theorem_name": "divK_loop_body_n2_max_skip_jgt0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 62,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hborrow\n let uBase := sp + signExtend12 4056 - j <<< (3 : BitVec 6).toNat\n let qAddr... | [
{
"name": "loopBodyN2MaxJgt0Pre_unfold",
"text": "theorem loopBodyN2MaxJgt0Pre_unfold (j : Word)\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :\n loopBodyN2MaxJgt0Pre j sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop... | [
{
"name": "divK_loop_body_n2_max_skip_jgt0_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 74,
"n_chars": 4023,
"n_subproofs": 7,
"n_tactics": 80,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 7,
"n_structural": 2,
"automation... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | @@ -91,6 +91,26 @@
((uBase + signExtend12 4064) ↦ₘ uTop) **
(qAddr ↦ₘ qOld)
+theorem loopBodyN2MaxJgt0Pre_unfold (j : Word)
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :
+ loopBodyN2MaxJgt0Pre j sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8c723ba60787_5 | a65daccbe93cf316 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN2.lean | LoopIterN2 | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 3 | [
{
"theorem_name": "divK_loop_body_n2_max_skip_jgt0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 62,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hborrow\n let uBase := sp + signExtend12 4056 - j <<< (3 : BitVec 6).toNat\n let qAddr... | [
{
"name": "loopBodyN2MaxJgt0Pre_unfold",
"text": "theorem loopBodyN2MaxJgt0Pre_unfold (j : Word)\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :\n loopBodyN2MaxJgt0Pre j sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop... | [
{
"name": "divK_loop_body_n2_max_skip_jgt0_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 79,
"n_chars": 4439,
"n_subproofs": 7,
"n_tactics": 80,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 7,
"n_structural": 2,
"auto... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | @@ -91,6 +91,26 @@
((uBase + signExtend12 4064) ↦ₘ uTop) **
(qAddr ↦ₘ qOld)
+theorem loopBodyN2MaxJgt0Pre_unfold (j : Word)
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :
+ loopBodyN2MaxJgt0Pre j sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8c723ba60787_6 | d206ec3170df839c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN2.lean | LoopIterN2 | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 3 | [
{
"theorem_name": "divK_loop_body_n2_call_skip_jgt0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 95,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let uBase := sp + signExtend12 4056 - j <<< (3 : BitVec 6).toNat\n let qAddr := sp + signExt... | [
{
"name": "loopBodyN2CallJgt0Pre_unfold",
"text": "theorem loopBodyN2CallJgt0Pre_unfold (j : Word)\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)\n (retMem dMem dloMem scratch_un0 : Word) :\n loopBodyN2CallJgt0Pre j sp jOld v5Old v6Old v7Old v10Old ... | [
{
"name": "divK_loop_body_n2_call_skip_jgt0_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 109,
"n_chars": 5925,
"n_subproofs": 8,
"n_tactics": 114,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 9,
"n_structural": 1,
"automat... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | @@ -115,6 +115,31 @@
(sp + signExtend12 3952 ↦ₘ dloMem) **
(sp + signExtend12 3944 ↦ₘ scratch_un0) ** regOwn .x1
+theorem loopBodyN2CallJgt0Pre_unfold (j : Word)
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)
+ (retMem dMem dloMem scratch_un0 : 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_8c723ba60787_7 | 0f9c9511ff0321a0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN2.lean | LoopIterN2 | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 3 | [
{
"theorem_name": "divK_loop_body_n2_call_skip_jgt0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 95,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let uBase := sp + signExtend12 4056 - j <<< (3 : BitVec 6).toNat\n let qAddr := sp + signExt... | [
{
"name": "loopBodyN2CallJgt0Pre_unfold",
"text": "theorem loopBodyN2CallJgt0Pre_unfold (j : Word)\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)\n (retMem dMem dloMem scratch_un0 : Word) :\n loopBodyN2CallJgt0Pre j sp jOld v5Old v6Old v7Old v10Old ... | [
{
"name": "divK_loop_body_n2_call_skip_jgt0_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 120,
"n_chars": 6623,
"n_subproofs": 8,
"n_tactics": 114,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 9,
"n_structural": 1,
"a... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | @@ -115,6 +115,31 @@
(sp + signExtend12 3952 ↦ₘ dloMem) **
(sp + signExtend12 3944 ↦ₘ scratch_un0) ** regOwn .x1
+theorem loopBodyN2CallJgt0Pre_unfold (j : Word)
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)
+ (retMem dMem dloMem scratch_un0 : 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_8c723ba60787_8 | e4d63c3b87af7c57 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN2.lean | LoopIterN2 | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 4 | [
{
"theorem_name": "divK_loop_body_n2_max_skip_j0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 77,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hborrow\n let uBase := sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat\n le... | [
{
"name": "loopBodyN2MaxSkipJ0Pre_unfold",
"text": "theorem loopBodyN2MaxSkipJ0Pre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :\n loopBodyN2MaxSkipJ0Pre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld =... | [
{
"name": "divK_loop_body_n2_max_addback_j0_beq_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 71,
"n_chars": 3855,
"n_subproofs": 7,
"n_tactics": 62,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 8,
"n_structural": 2,
"autom... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | @@ -47,6 +47,26 @@
((uBase + signExtend12 4064) ↦ₘ uTop) **
(qAddr ↦ₘ qOld)
+theorem loopBodyN2MaxSkipJ0Pre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :
+ loopBodyN2MaxSkipJ0Pre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8c723ba60787_9 | 70d32f8d0e70c0f2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN2.lean | LoopIterN2 | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 4 | [
{
"theorem_name": "divK_loop_body_n2_max_skip_j0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 77,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hborrow\n let uBase := sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat\n le... | [
{
"name": "loopBodyN2MaxSkipJ0Pre_unfold",
"text": "theorem loopBodyN2MaxSkipJ0Pre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :\n loopBodyN2MaxSkipJ0Pre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld =... | [
{
"name": "divK_loop_body_n2_max_addback_j0_beq_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 75,
"n_chars": 4195,
"n_subproofs": 7,
"n_tactics": 62,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 8,
"n_structural": 2,
... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | @@ -47,6 +47,26 @@
((uBase + signExtend12 4064) ↦ₘ uTop) **
(qAddr ↦ₘ qOld)
+theorem loopBodyN2MaxSkipJ0Pre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :
+ loopBodyN2MaxSkipJ0Pre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8c723ba60787_10 | d636e142168f47a7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN2.lean | LoopIterN2 | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 3 | [
{
"theorem_name": "divK_loop_body_n2_call_skip_j0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 105,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let uBase := sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat\n let qAddr := sp +... | [
{
"name": "loopBodyN2CallSkipJ0Pre_unfold",
"text": "theorem loopBodyN2CallSkipJ0Pre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)\n (retMem dMem dloMem scratch_un0 : Word) :\n loopBodyN2CallSkipJ0Pre sp jOld v5Old v6Old v7Old v10Old v11Old ... | [
{
"name": "divK_loop_body_n2_call_addback_j0_beq_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 121,
"n_chars": 6496,
"n_subproofs": 8,
"n_tactics": 97,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 10,
"n_structural": 1,
"au... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | @@ -72,6 +72,31 @@
(sp + signExtend12 3952 ↦ₘ dloMem) **
(sp + signExtend12 3944 ↦ₘ scratch_un0) ** regOwn .x1
+theorem loopBodyN2CallSkipJ0Pre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)
+ (retMem dMem dloMem scratch_un0 : Word) :
+ loopBodyN... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8c723ba60787_11 | 93549971c22cda32 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN2.lean | LoopIterN2 | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 3 | [
{
"theorem_name": "divK_loop_body_n2_max_skip_jgt0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 62,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hborrow\n let uBase := sp + signExtend12 4056 - j <<< (3 : BitVec 6).toNat\n let qAddr... | [
{
"name": "loopBodyN2MaxJgt0Pre_unfold",
"text": "theorem loopBodyN2MaxJgt0Pre_unfold (j : Word)\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :\n loopBodyN2MaxJgt0Pre j sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop... | [
{
"name": "divK_loop_body_n2_max_addback_jgt0_beq_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 77,
"n_chars": 4199,
"n_subproofs": 7,
"n_tactics": 62,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 8,
"n_structural": 2,
"aut... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | @@ -91,6 +91,26 @@
((uBase + signExtend12 4064) ↦ₘ uTop) **
(qAddr ↦ₘ qOld)
+theorem loopBodyN2MaxJgt0Pre_unfold (j : Word)
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :
+ loopBodyN2MaxJgt0Pre j sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8c723ba60787_12 | 8d4ee40b624433a3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN2.lean | LoopIterN2 | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 3 | [
{
"theorem_name": "divK_loop_body_n2_call_skip_jgt0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 95,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let uBase := sp + signExtend12 4056 - j <<< (3 : BitVec 6).toNat\n let qAddr := sp + signExt... | [
{
"name": "loopBodyN2CallJgt0Pre_unfold",
"text": "theorem loopBodyN2CallJgt0Pre_unfold (j : Word)\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)\n (retMem dMem dloMem scratch_un0 : Word) :\n loopBodyN2CallJgt0Pre j sp jOld v5Old v6Old v7Old v10Old ... | [
{
"name": "divK_loop_body_n2_call_addback_jgt0_beq_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 108,
"n_chars": 5846,
"n_subproofs": 8,
"n_tactics": 97,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 10,
"n_structural": 1,
"... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | /-
EvmAsm.Evm64.DivMod.LoopIterN2
Loop body cpsTripleWithin specs for n=2 (2-limb divisor).
These specialize the generic LoopBodyN2 cpsBranchWithin specs to specific j values,
producing cpsTripleWithin specs using divK_store_loop_j0_spec_within (j=0) and
divK_store_loop_jgt0_spec_within (j>0).
For n=2, th... | @@ -115,6 +115,31 @@
(sp + signExtend12 3952 ↦ₘ dloMem) **
(sp + signExtend12 3944 ↦ₘ scratch_un0) ** regOwn .x1
+theorem loopBodyN2CallJgt0Pre_unfold (j : Word)
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)
+ (retMem dMem dloMem scratch_un0 : 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_44d1461aabb8_0 | 88a8f44cc62ee521 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/CopyProgram.lean | CopyProgram | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_calldatacopy_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_calldatacopy_length]",
"n_chars": 34,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": ... | [
{
"name": "evm_calldatacopy_length",
"text": "/-- `evm_calldatacopy` is exactly 19 RISC-V instructions. -/\ntheorem evm_calldatacopy_length\n (envBaseReg memBaseReg destReg srcReg cntReg cdpReg endReg\n byteReg : Reg) :\n (evm_calldatacopy envBaseReg memBaseReg destReg srcReg cntReg\n cdpR... | [
{
"name": "evm_calldatacopy_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 339,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.Calldata.CopyProgram
Top-level RISC-V program implementing the EVM `CALLDATACOPY` opcode
(GH #104).
Stack convention: CALLDATACOPY pops three EVM words from the EVM stack
(located at `x12`):
- top (`x12 + 0..31`) : `destOffset` — destination memory offset
- 2nd (`x12 + 32..63`) :... | /-
EvmAsm.Evm64.Calldata.CopyProgram
Top-level RISC-V program implementing the EVM `CALLDATACOPY` opcode
(GH #104).
Stack convention: CALLDATACOPY pops three EVM words from the EVM stack
(located at `x12`):
- top (`x12 + 0..31`) : `destOffset` — destination memory offset
- 2nd (`x12 + 32..63`) :... | @@ -137,12 +137,22 @@
(evm_calldatacopy envBaseReg memBaseReg destReg srcReg cntReg
cdpReg endReg byteReg)
+/-- `evm_calldatacopy` is exactly 19 RISC-V instructions. -/
+theorem evm_calldatacopy_length
+ (envBaseReg memBaseReg destReg srcReg cntReg cdpReg endReg
+ byteReg : Reg) :
+ (evm_callda... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1e93cd808147_0 | 3e3d087cbc283b93 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIterLoop.lean | SavedBitBaseTwoMulFixedIterLoop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "exp_cond_mul_call_then_loop_back_expIterBodyFullMsbSavedBitTwoMulFixedCode_call_scratch_owned_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 82,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro r aw rw preCore rest exits... | [
{
"name": "exp_cond_mul_call_then_loop_back_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"text": "/-- Fixed conditional-multiply call block followed by the loop-back counter\n update. This is the concrete-limb continuation for the saved-bit nonzero\n branch before later owned-scratch adapte... | [
{
"name": "exp_cond_mul_call_then_loop_back_expIterBodyFullMsbSavedBitTwoMulFixedCode_call_scratch_owned_spec_within",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 144,
"n_chars": 7647,
"n_subproofs": 13,
"n_tactics": 82,
"cyclomatic": 1,
"n_automation"... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIterLoop
Continuation compositions for the fixed x19 two-MUL saved-bit EXP iteration.
This file extends `SavedBitBaseTwoMulFixedIter` without pushing that module
over the Compose file-size cap.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
im... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIterLoop
Continuation compositions for the fixed x19 two-MUL saved-bit EXP iteration.
This file extends `SavedBitBaseTwoMulFixedIter` without pushing that module
over the Compose file-size cap.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
im... | @@ -15,6 +15,97 @@
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
+/-- Fixed conditional-multiply call block followed by the loop-back counter
+ update. This is the concrete-limb continuation for the saved-bit nonzero
+ branch before later owned-scratch adapters. -/
+theorem exp_cond_mul_call_then_loop_back_expIte... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1e93cd808147_1 | bc2760d1f535cb60 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIterLoop.lean | SavedBitBaseTwoMulFixedIterLoop | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "exp_cond_mul_call_then_loop_back_expIterBodyFullMsbSavedBitTwoMulFixedCode_call_scratch_owned_branch_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsNBranchWithin_as_... | [
{
"name": "exp_cond_mul_call_then_loop_back_expIterBodyFullMsbSavedBitTwoMulFixedCode_call_scratch_owned_spec_within",
"text": "/-- Owned-scratch variant of the fixed conditional-multiply call plus\n loop-back continuation. The value limbs stay concrete; only call-clobbered\n scratch registers and mem... | [
{
"name": "exp_cond_mul_call_then_loop_back_expIterBodyFullMsbSavedBitTwoMulFixedCode_call_scratch_owned_branch_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 65,
"n_chars": 3564,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automat... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIterLoop
Continuation compositions for the fixed x19 two-MUL saved-bit EXP iteration.
This file extends `SavedBitBaseTwoMulFixedIter` without pushing that module
over the Compose file-size cap.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
im... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIterLoop
Continuation compositions for the fixed x19 two-MUL saved-bit EXP iteration.
This file extends `SavedBitBaseTwoMulFixedIter` without pushing that module
over the Compose file-size cap.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
im... | @@ -106,6 +106,149 @@
exact cpsNBranchWithin_weaken_pre
(fun _ hp => by xperm_hyp hp) hSeqN
+/-- Owned-scratch variant of the fixed conditional-multiply call plus
+ loop-back continuation. The value limbs stay concrete; only call-clobbered
+ scratch registers and memory cells are existentially owned. -/... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1e93cd808147_2 | b72e385e3b76e825 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIterLoop.lean | SavedBitBaseTwoMulFixedIterLoop | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "exp_cond_mul_call_then_loop_back_expIterBodyFullMsbSavedBitTwoMulFixedCode_call_scratch_owned_branch_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsNBranchWithin_as_... | [
{
"name": "exp_cond_mul_call_then_loop_back_expIterBodyFullMsbSavedBitTwoMulFixedCode_call_scratch_owned_spec_within",
"text": "/-- Owned-scratch variant of the fixed conditional-multiply call plus\n loop-back continuation. The value limbs stay concrete; only call-clobbered\n scratch registers and mem... | [
{
"name": "exp_cond_mul_call_then_loop_back_expIterBodyFullMsbSavedBitTwoMulFixedCode_folded_owned_spec_within",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 91,
"n_chars": 4806,
"n_subproofs": 1,
"n_tactics": 50,
"cyclomatic": 1,
"n_automation": 3,
... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIterLoop
Continuation compositions for the fixed x19 two-MUL saved-bit EXP iteration.
This file extends `SavedBitBaseTwoMulFixedIter` without pushing that module
over the Compose file-size cap.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
im... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIterLoop
Continuation compositions for the fixed x19 two-MUL saved-bit EXP iteration.
This file extends `SavedBitBaseTwoMulFixedIter` without pushing that module
over the Compose file-size cap.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
im... | @@ -106,6 +106,149 @@
exact cpsNBranchWithin_weaken_pre
(fun _ hp => by xperm_hyp hp) hSeqN
+/-- Owned-scratch variant of the fixed conditional-multiply call plus
+ loop-back continuation. The value limbs stay concrete; only call-clobbered
+ scratch registers and memory cells are existentially owned. -/... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1e93cd808147_3 | e37abb1c0f82b0c6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIterLoop.lean | SavedBitBaseTwoMulFixedIterLoop | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "exp_cond_mul_call_then_loop_back_expIterBodyFullMsbSavedBitTwoMulFixedCode_folded_owned_branch_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsNBranchWithin_as_cpsBra... | [
{
"name": "exp_cond_mul_call_then_loop_back_expIterBodyFullMsbSavedBitTwoMulFixedCode_folded_owned_spec_within",
"text": "/-- Folded-word variant of the fixed conditional-multiply call plus loop-back\n adapter. The precondition consumes the current result as `evmWordIs` at\n both the stack scratch and... | [
{
"name": "exp_cond_mul_call_then_loop_back_expIterBodyFullMsbSavedBitTwoMulFixedCode_folded_owned_branch_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 44,
"n_chars": 2300,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": ... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIterLoop
Continuation compositions for the fixed x19 two-MUL saved-bit EXP iteration.
This file extends `SavedBitBaseTwoMulFixedIter` without pushing that module
over the Compose file-size cap.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
im... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIterLoop
Continuation compositions for the fixed x19 two-MUL saved-bit EXP iteration.
This file extends `SavedBitBaseTwoMulFixedIter` without pushing that module
over the Compose file-size cap.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
im... | @@ -249,6 +249,96 @@
xperm_hyp hp)
hConcrete
+/-- Folded-word variant of the fixed conditional-multiply call plus loop-back
+ adapter. The precondition consumes the current result as `evmWordIs` at
+ both the stack scratch and EVM stack result slots, matching the squaring
+ prefix postcondition. ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1e93cd808147_4 | 6d31719c7ad4aa33 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIterLoop.lean | SavedBitBaseTwoMulFixedIterLoop | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "exp_cond_mul_call_then_loop_back_expIterBodyFullMsbSavedBitTwoMulFixedCode_folded_owned_branch_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsNBranchWithin_as_cpsBra... | [
{
"name": "exp_cond_mul_call_then_loop_back_expIterBodyFullMsbSavedBitTwoMulFixedCode_folded_owned_spec_within",
"text": "/-- Folded-word variant of the fixed conditional-multiply call plus loop-back\n adapter. The precondition consumes the current result as `evmWordIs` at\n both the stack scratch and... | [
{
"name": "exp_msb_bit_test_fixed_skip_full_iter_four_exit_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 142,
"n_chars": 7601,
"n_subproofs": 6,
"n_tactics": 50,
"cyclomatic": 1,
"n_automation": 1,
... | 4 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIterLoop
Continuation compositions for the fixed x19 two-MUL saved-bit EXP iteration.
This file extends `SavedBitBaseTwoMulFixedIter` without pushing that module
over the Compose file-size cap.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
im... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIterLoop
Continuation compositions for the fixed x19 two-MUL saved-bit EXP iteration.
This file extends `SavedBitBaseTwoMulFixedIter` without pushing that module
over the Compose file-size cap.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
im... | @@ -350,6 +350,96 @@
xperm_hyp hp)
hConcrete
+/-- Folded-word variant of the fixed conditional-multiply call plus loop-back
+ adapter. The precondition consumes the current result as `evmWordIs` at
+ both the stack scratch and EVM stack result slots, matching the squaring
+ prefix postcondition. ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1e93cd808147_5 | 2a80ce99229699db | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIterLoop.lean | SavedBitBaseTwoMulFixedIterLoop | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "exp_cond_mul_call_then_loop_back_expIterBodyFullMsbSavedBitTwoMulFixedCode_folded_owned_branch_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsNBranchWithin_as_cpsBra... | [
{
"name": "exp_cond_mul_call_then_loop_back_expIterBodyFullMsbSavedBitTwoMulFixedCode_folded_owned_spec_within",
"text": "/-- Folded-word variant of the fixed conditional-multiply call plus loop-back\n adapter. The precondition consumes the current result as `evmWordIs` at\n both the stack scratch and... | [
{
"name": "exp_msb_bit_test_fixed_skip_full_iter_merged_exit_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 144,
"n_chars": 7597,
"n_subproofs": 1,
"n_tactics": 52,
"cyclomatic": 2,
"n_automation": 9... | 5 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIterLoop
Continuation compositions for the fixed x19 two-MUL saved-bit EXP iteration.
This file extends `SavedBitBaseTwoMulFixedIter` without pushing that module
over the Compose file-size cap.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
im... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIterLoop
Continuation compositions for the fixed x19 two-MUL saved-bit EXP iteration.
This file extends `SavedBitBaseTwoMulFixedIter` without pushing that module
over the Compose file-size cap.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
im... | @@ -350,6 +350,96 @@
xperm_hyp hp)
hConcrete
+/-- Folded-word variant of the fixed conditional-multiply call plus loop-back
+ adapter. The precondition consumes the current result as `evmWordIs` at
+ both the stack scratch and EVM stack result slots, matching the squaring
+ prefix postcondition. ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1e93cd808147_6 | 980222fd6499db02 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIterLoop.lean | SavedBitBaseTwoMulFixedIterLoop | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "exp_cond_mul_call_then_loop_back_expIterBodyFullMsbSavedBitTwoMulFixedCode_folded_owned_branch_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsNBranchWithin_as_cpsBra... | [
{
"name": "exp_cond_mul_call_then_loop_back_expIterBodyFullMsbSavedBitTwoMulFixedCode_folded_owned_spec_within",
"text": "/-- Folded-word variant of the fixed conditional-multiply call plus loop-back\n adapter. The precondition consumes the current result as `evmWordIs` at\n both the stack scratch and... | [
{
"name": "exp_msb_bit_test_fixed_reload_full_iter_four_exit_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 149,
"n_chars": 7993,
"n_subproofs": 6,
"n_tactics": 50,
"cyclomatic": 1,
"n_automation": 1... | 4 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIterLoop
Continuation compositions for the fixed x19 two-MUL saved-bit EXP iteration.
This file extends `SavedBitBaseTwoMulFixedIter` without pushing that module
over the Compose file-size cap.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
im... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIterLoop
Continuation compositions for the fixed x19 two-MUL saved-bit EXP iteration.
This file extends `SavedBitBaseTwoMulFixedIter` without pushing that module
over the Compose file-size cap.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
im... | @@ -356,6 +356,96 @@
xperm_hyp hp)
hConcrete
+/-- Folded-word variant of the fixed conditional-multiply call plus loop-back
+ adapter. The precondition consumes the current result as `evmWordIs` at
+ both the stack scratch and EVM stack result slots, matching the squaring
+ prefix postcondition. ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fdb87f6495b6_0 | 1259fdfacd014f70 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/ModFullPathN1.lean | ModFullPathN1 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_mod_n1_to_loopSetup_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 112,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let shift := (clzResult b0).1\n let antiShift := signExtend12 (0 : BitVec 12) - shift\n let b3' := ... | [
{
"name": "evm_mod_phaseAB_n1_clz_spec_within",
"text": "/-- MOD PhaseAB(n=1) + CLZ: b≠0, b[3]=b[2]=b[1]=0.\n base → base+212. CLZ on b0, x6 = shift = clzResult(b0).1. -/\ntheorem evm_mod_phaseAB_n1_clz_spec_within (sp base : Word)\n (b0 b1 b2 b3 v5 v6 v7 v10 : Word)\n (q0 q1 q2 q3 u5 u6 u7 nMem : ... | [
{
"name": "evm_mod_n1_to_loopSetup_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 137,
"n_chars": 8293,
"n_subproofs": 14,
"n_tactics": 107,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 1,
"automation_only... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.ModFullPathN1
MOD full path compositions for b[3]=b[2]=b[1]=0 (n=1) case.
MOD mirrors of FullPathN1.lean with modCode.
-/
import EvmAsm.Evm64.DivMod.Compose.Epilogue
import EvmAsm.Evm64.DivMod.Compose.ModPhaseBn21
import EvmAsm.Evm64.DivMod.Compose.ModCLZ
import EvmAsm.Evm64.DivMo... | /-
EvmAsm.Evm64.DivMod.Compose.ModFullPathN1
MOD full path compositions for b[3]=b[2]=b[1]=0 (n=1) case.
MOD mirrors of FullPathN1.lean with modCode.
-/
import EvmAsm.Evm64.DivMod.Compose.Epilogue
import EvmAsm.Evm64.DivMod.Compose.ModPhaseBn21
import EvmAsm.Evm64.DivMod.Compose.ModCLZ
import EvmAsm.Evm64.DivMo... | @@ -22,6 +22,67 @@
-- Phase A(ntaken) + Phase B(n=1) + CLZ: base → base+212
-- ============================================================================
+/-- MOD PhaseAB(n=1) + CLZ: b≠0, b[3]=b[2]=b[1]=0.
+ base → base+212. CLZ on b0, x6 = shift = clzResult(b0).1. -/
+theorem evm_mod_phaseAB_n1_clz_spec_withi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e3277810ea96_0 | 108ddbc9240845b7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/TriCmpStoreJoin.lean | TriCmpStoreJoin | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "triCmpStoreJoin_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n breakStation_spec hbrA hentAT hentAF htailLt\n (fun hnLt => breakStation_spec (hbrB hnLt) hentBT hentBF\n (htailG... | [
{
"name": "liStoreRetTail_spec",
"text": "/-- **The value-loading writable-output return tail**\n `LI rs, c ; SD rb, rs, ofs ; LI rd, cRes ; ret`: loads the tail's\n constant `c` into the scratch register `rs`, stores it into the OWNED\n output dword cell `[rb + ofs]`, loads the result register, an... | [
{
"name": "triCmpStoreJoin_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 36,
"n_chars": 1932,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_... | 1 | /-
EvmAsm.Rv64.SAsm.TriCmpStoreJoin
The **three-outcome compare/store join** (bead evm-asm-4ch8f.38.2.2.3).
`TwoBreakWritable` gives the two-outcome comparison shape (`u256_lt_be`):
a scan loop whose iterations route through TWO break guards to TWO
writable-output return tails. Compare-against-modulus rout... | /-
EvmAsm.Rv64.SAsm.TriCmpStoreJoin
The **three-outcome compare/store join** (bead evm-asm-4ch8f.38.2.2.3).
`TwoBreakWritable` gives the two-outcome comparison shape (`u256_lt_be`):
a scan loop whose iterations route through TWO break guards to TWO
writable-output return tails. Compare-against-modulus rout... | @@ -63,6 +63,53 @@
-- §1 The value-loading writable-output return tail
-- ============================================================================
+/-- **The value-loading writable-output return tail**
+ `LI rs, c ; SD rb, rs, ofs ; LI rd, cRes ; ret`: loads the tail's
+ constant `c` into the scratch reg... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f474b5710789_0 | 0950835dfaa4e8f4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Push/Immediate.lean | Immediate | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "codeByteAt_nil",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact codeByteAt_of_ge (code := []) (idx := idx) (by simp)",
"n_chars": 64,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "codeByteAt_of_ge",
"text": "theorem codeByteAt_of_ge {code : List (BitVec 8)} {idx : Nat}\n (h : code.length ≤ idx) :\n codeByteAt code idx = 0 := by\n simp [codeByteAt, show ¬idx < code.length from by omega]\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 189,
"n_subproofs": 0... | [
{
"name": "codeByteAt_nil",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 139,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting"... | 1 | /-
EvmAsm.Evm64.Push.Immediate
Executable PUSH immediate-byte bridge for GH #101.
-/
import EvmAsm.Evm64.Push.Spec
namespace EvmAsm.Evm64
namespace PushImmediate
open EvmAsm.Rv64
/-- Read one EVM code byte, returning zero past EOF. PUSH immediates use the
same executable-spec convention as calldata windows... | /-
EvmAsm.Evm64.Push.Immediate
Executable PUSH immediate-byte bridge for GH #101.
-/
import EvmAsm.Evm64.Push.Spec
namespace EvmAsm.Evm64
namespace PushImmediate
open EvmAsm.Rv64
/-- Read one EVM code byte, returning zero past EOF. PUSH immediates use the
same executable-spec convention as calldata windows... | @@ -33,8 +33,14 @@
def pcAfterPush (pc n : Nat) : Nat :=
pc + 1 + n
+theorem codeByteAt_of_ge {code : List (BitVec 8)} {idx : Nat}
+ (h : code.length ≤ idx) :
+ codeByteAt code idx = 0 := by
+ simp [codeByteAt, show ¬idx < code.length from by omega]
+
@[simp] theorem codeByteAt_nil (idx : Nat) :
- 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_f474b5710789_1 | 5ed52e41ae500f56 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Push/Immediate.lean | Immediate | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "pushImmediateByteAt_of_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [pushImmediateByteAt, codeByteAt_of_lt h]",
"n_chars": 52,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "codeByteAt_of_lt",
"text": "theorem codeByteAt_of_lt {code : List (BitVec 8)} {idx : Nat}\n (h : idx < code.length) :\n codeByteAt code idx = code[idx] := by\n simp [codeByteAt, h]\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 158,
"n_subproofs": 0,
"n_tactics": 2,
"c... | [
{
"name": "pushImmediateByteAt_of_lt",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 218,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"ma... | 1 | /-
EvmAsm.Evm64.Push.Immediate
Executable PUSH immediate-byte bridge for GH #101.
-/
import EvmAsm.Evm64.Push.Spec
namespace EvmAsm.Evm64
namespace PushImmediate
open EvmAsm.Rv64
/-- Read one EVM code byte, returning zero past EOF. PUSH immediates use the
same executable-spec convention as calldata windows... | /-
EvmAsm.Evm64.Push.Immediate
Executable PUSH immediate-byte bridge for GH #101.
-/
import EvmAsm.Evm64.Push.Spec
namespace EvmAsm.Evm64
namespace PushImmediate
open EvmAsm.Rv64
/-- Read one EVM code byte, returning zero past EOF. PUSH immediates use the
same executable-spec convention as calldata windows... | @@ -33,6 +33,11 @@
def pcAfterPush (pc n : Nat) : Nat :=
pc + 1 + n
+theorem codeByteAt_of_lt {code : List (BitVec 8)} {idx : Nat}
+ (h : idx < code.length) :
+ codeByteAt code idx = code[idx] := by
+ simp [codeByteAt, h]
+
theorem codeByteAt_of_ge {code : List (BitVec 8)} {idx : Nat}
(h : code.lengt... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f474b5710789_2 | f0826140e5054df4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Push/Immediate.lean | Immediate | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "codeByteAt_nil",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact codeByteAt_of_ge (code := []) (idx := idx) (by simp)",
"n_chars": 64,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "codeByteAt_of_ge",
"text": "theorem codeByteAt_of_ge {code : List (BitVec 8)} {idx : Nat}\n (h : code.length ≤ idx) :\n codeByteAt code idx = 0 := by\n simp [codeByteAt, show ¬idx < code.length from by omega]\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 189,
"n_subproofs": 0... | [
{
"name": "pushImmediateByteAt_of_ge",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 205,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"ma... | 1 | /-
EvmAsm.Evm64.Push.Immediate
Executable PUSH immediate-byte bridge for GH #101.
-/
import EvmAsm.Evm64.Push.Spec
namespace EvmAsm.Evm64
namespace PushImmediate
open EvmAsm.Rv64
/-- Read one EVM code byte, returning zero past EOF. PUSH immediates use the
same executable-spec convention as calldata windows... | /-
EvmAsm.Evm64.Push.Immediate
Executable PUSH immediate-byte bridge for GH #101.
-/
import EvmAsm.Evm64.Push.Spec
namespace EvmAsm.Evm64
namespace PushImmediate
open EvmAsm.Rv64
/-- Read one EVM code byte, returning zero past EOF. PUSH immediates use the
same executable-spec convention as calldata windows... | @@ -33,12 +33,19 @@
def pcAfterPush (pc n : Nat) : Nat :=
pc + 1 + n
+theorem codeByteAt_of_ge {code : List (BitVec 8)} {idx : Nat}
+ (h : code.length ≤ idx) :
+ codeByteAt code idx = 0 := by
+ simp [codeByteAt, show ¬idx < code.length from by omega]
+
@[simp] theorem codeByteAt_nil (idx : Nat) :
- cod... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cd1b042eff26_0 | 2c3208f39a015b04 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseABNoNop.lean | PhaseABNoNop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 10 | [
{
"theorem_name": "divK_phaseB_init1_code_sub_divCode_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold divCode_noNop; simp only [CodeReq.unionAll_cons]\n intro a i h\n have h1 := CodeReq.ofPro... | [
{
"name": "sub_divCodeNoNop_of_phaseB_left",
"text": "private theorem sub_divCodeNoNop_of_phaseB_left {base : Word} {rest : CodeReq} :\n ∀ a i,\n CodeReq.ofProg (base + phaseBOff) divK_phaseB a = some i →\n ((CodeReq.ofProg base (divK_phaseA 1020)).union\n ((CodeReq.ofProg (base + phaseB... | [
{
"name": "divK_phaseB_init1_code_sub_divCode_noNop",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 482,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 2,
"automation_only... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | @@ -16,9 +16,26 @@
(bv64_4mul_9 bv64_4mul_10 bv64_4mul_11 bv64_4mul_12 bv64_4mul_13
bv64_4mul_14 bv64_4mul_15)
+private theorem sub_divCodeNoNop_of_phaseB_left {base : Word} {rest : CodeReq} :
+ ∀ a i,
+ CodeReq.ofProg (base + phaseBOff) divK_phaseB a = some i →
+ ((CodeReq.ofProg base (divK_phase... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cd1b042eff26_1 | 3f609aa76f23b9ed | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseABNoNop.lean | PhaseABNoNop | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 10 | [
{
"theorem_name": "divK_phaseB_init1_code_sub_divCode_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold divCode_noNop; simp only [CodeReq.unionAll_cons]\n intro a i h\n have h1 := CodeReq.ofPro... | [
{
"name": "sub_divCodeNoNop_of_phaseB_left",
"text": "private theorem sub_divCodeNoNop_of_phaseB_left {base : Word} {rest : CodeReq} :\n ∀ a i,\n CodeReq.ofProg (base + phaseBOff) divK_phaseB a = some i →\n ((CodeReq.ofProg base (divK_phaseA 1020)).union\n ((CodeReq.ofProg (base + phaseB... | [
{
"name": "divK_phaseB_init2_code_sub_divCode_noNop",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 502,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 2,
"automation_only... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | @@ -16,9 +16,26 @@
(bv64_4mul_9 bv64_4mul_10 bv64_4mul_11 bv64_4mul_12 bv64_4mul_13
bv64_4mul_14 bv64_4mul_15)
+private theorem sub_divCodeNoNop_of_phaseB_left {base : Word} {rest : CodeReq} :
+ ∀ a i,
+ CodeReq.ofProg (base + phaseBOff) divK_phaseB a = some i →
+ ((CodeReq.ofProg base (divK_phase... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cd1b042eff26_2 | 09ccea7754b991d4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseABNoNop.lean | PhaseABNoNop | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 10 | [
{
"theorem_name": "divK_phaseB_init1_code_sub_divCode_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold divCode_noNop; simp only [CodeReq.unionAll_cons]\n intro a i h\n have h1 := CodeReq.ofPro... | [
{
"name": "sub_divCodeNoNop_of_phaseB_left",
"text": "private theorem sub_divCodeNoNop_of_phaseB_left {base : Word} {rest : CodeReq} :\n ∀ a i,\n CodeReq.ofProg (base + phaseBOff) divK_phaseB a = some i →\n ((CodeReq.ofProg base (divK_phaseA 1020)).union\n ((CodeReq.ofProg (base + phaseB... | [
{
"name": "divK_phaseB_tail_code_sub_divCode_noNop",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 490,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 2,
"automation_only"... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | @@ -16,9 +16,26 @@
(bv64_4mul_9 bv64_4mul_10 bv64_4mul_11 bv64_4mul_12 bv64_4mul_13
bv64_4mul_14 bv64_4mul_15)
+private theorem sub_divCodeNoNop_of_phaseB_left {base : Word} {rest : CodeReq} :
+ ∀ a i,
+ CodeReq.ofProg (base + phaseBOff) divK_phaseB a = some i →
+ ((CodeReq.ofProg base (divK_phase... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cd1b042eff26_3 | cc312bbb1f661365 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseABNoNop.lean | PhaseABNoNop | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 10 | [
{
"theorem_name": "divK_phaseB_init1_code_sub_divCode_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold divCode_noNop; simp only [CodeReq.unionAll_cons]\n intro a i h\n have h1 := CodeReq.ofPro... | [
{
"name": "sub_divCodeNoNop_of_phaseB_left",
"text": "private theorem sub_divCodeNoNop_of_phaseB_left {base : Word} {rest : CodeReq} :\n ∀ a i,\n CodeReq.ofProg (base + phaseBOff) divK_phaseB a = some i →\n ((CodeReq.ofProg base (divK_phaseA 1020)).union\n ((CodeReq.ofProg (base + phaseB... | [
{
"name": "addi_x5_singleton_sub_divCode_noNop",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 572,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": fa... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | @@ -16,9 +16,27 @@
(bv64_4mul_9 bv64_4mul_10 bv64_4mul_11 bv64_4mul_12 bv64_4mul_13
bv64_4mul_14 bv64_4mul_15)
+private theorem sub_divCodeNoNop_of_phaseB_left {base : Word} {rest : CodeReq} :
+ ∀ a i,
+ CodeReq.ofProg (base + phaseBOff) divK_phaseB a = some i →
+ ((CodeReq.ofProg base (divK_phase... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cd1b042eff26_4 | a373938b76efd573 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseABNoNop.lean | PhaseABNoNop | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 10 | [
{
"theorem_name": "divK_phaseB_init1_code_sub_divCode_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold divCode_noNop; simp only [CodeReq.unionAll_cons]\n intro a i h\n have h1 := CodeReq.ofPro... | [
{
"name": "sub_divCodeNoNop_of_phaseB_left",
"text": "private theorem sub_divCodeNoNop_of_phaseB_left {base : Word} {rest : CodeReq} :\n ∀ a i,\n CodeReq.ofProg (base + phaseBOff) divK_phaseB a = some i →\n ((CodeReq.ofProg base (divK_phaseA 1020)).union\n ((CodeReq.ofProg (base + phaseB... | [
{
"name": "bne_x10_singleton_sub_divCode_noNop",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 571,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": fa... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | @@ -16,9 +16,27 @@
(bv64_4mul_9 bv64_4mul_10 bv64_4mul_11 bv64_4mul_12 bv64_4mul_13
bv64_4mul_14 bv64_4mul_15)
+private theorem sub_divCodeNoNop_of_phaseB_left {base : Word} {rest : CodeReq} :
+ ∀ a i,
+ CodeReq.ofProg (base + phaseBOff) divK_phaseB a = some i →
+ ((CodeReq.ofProg base (divK_phase... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cd1b042eff26_5 | f206d8aeb5e0ca19 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseABNoNop.lean | PhaseABNoNop | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 10 | [
{
"theorem_name": "divK_phaseB_init1_code_sub_divCode_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold divCode_noNop; simp only [CodeReq.unionAll_cons]\n intro a i h\n have h1 := CodeReq.ofPro... | [
{
"name": "sub_divCodeNoNop_of_phaseB_left",
"text": "private theorem sub_divCodeNoNop_of_phaseB_left {base : Word} {rest : CodeReq} :\n ∀ a i,\n CodeReq.ofProg (base + phaseBOff) divK_phaseB a = some i →\n ((CodeReq.ofProg base (divK_phaseA 1020)).union\n ((CodeReq.ofProg (base + phaseB... | [
{
"name": "addi_x5_3_sub_divCode_noNop",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 566,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | @@ -16,9 +16,27 @@
(bv64_4mul_9 bv64_4mul_10 bv64_4mul_11 bv64_4mul_12 bv64_4mul_13
bv64_4mul_14 bv64_4mul_15)
+private theorem sub_divCodeNoNop_of_phaseB_left {base : Word} {rest : CodeReq} :
+ ∀ a i,
+ CodeReq.ofProg (base + phaseBOff) divK_phaseB a = some i →
+ ((CodeReq.ofProg base (divK_phase... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cd1b042eff26_6 | 106aa089b0f442e9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseABNoNop.lean | PhaseABNoNop | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 10 | [
{
"theorem_name": "divK_phaseB_init1_code_sub_divCode_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold divCode_noNop; simp only [CodeReq.unionAll_cons]\n intro a i h\n have h1 := CodeReq.ofPro... | [
{
"name": "sub_divCodeNoNop_of_phaseB_left",
"text": "private theorem sub_divCodeNoNop_of_phaseB_left {base : Word} {rest : CodeReq} :\n ∀ a i,\n CodeReq.ofProg (base + phaseBOff) divK_phaseB a = some i →\n ((CodeReq.ofProg base (divK_phaseA 1020)).union\n ((CodeReq.ofProg (base + phaseB... | [
{
"name": "bne_x7_16_sub_divCode_noNop",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 564,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | @@ -16,9 +16,27 @@
(bv64_4mul_9 bv64_4mul_10 bv64_4mul_11 bv64_4mul_12 bv64_4mul_13
bv64_4mul_14 bv64_4mul_15)
+private theorem sub_divCodeNoNop_of_phaseB_left {base : Word} {rest : CodeReq} :
+ ∀ a i,
+ CodeReq.ofProg (base + phaseBOff) divK_phaseB a = some i →
+ ((CodeReq.ofProg base (divK_phase... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cd1b042eff26_7 | 9e312fb670ad3683 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseABNoNop.lean | PhaseABNoNop | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 10 | [
{
"theorem_name": "divK_phaseB_init1_code_sub_divCode_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold divCode_noNop; simp only [CodeReq.unionAll_cons]\n intro a i h\n have h1 := CodeReq.ofPro... | [
{
"name": "sub_divCodeNoNop_of_phaseB_left",
"text": "private theorem sub_divCodeNoNop_of_phaseB_left {base : Word} {rest : CodeReq} :\n ∀ a i,\n CodeReq.ofProg (base + phaseBOff) divK_phaseB a = some i →\n ((CodeReq.ofProg base (divK_phaseA 1020)).union\n ((CodeReq.ofProg (base + phaseB... | [
{
"name": "addi_x5_2_sub_divCode_noNop",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 566,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | @@ -16,9 +16,27 @@
(bv64_4mul_9 bv64_4mul_10 bv64_4mul_11 bv64_4mul_12 bv64_4mul_13
bv64_4mul_14 bv64_4mul_15)
+private theorem sub_divCodeNoNop_of_phaseB_left {base : Word} {rest : CodeReq} :
+ ∀ a i,
+ CodeReq.ofProg (base + phaseBOff) divK_phaseB a = some i →
+ ((CodeReq.ofProg base (divK_phase... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cd1b042eff26_8 | 93ea9914011ef824 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseABNoNop.lean | PhaseABNoNop | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 10 | [
{
"theorem_name": "divK_phaseB_init1_code_sub_divCode_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold divCode_noNop; simp only [CodeReq.unionAll_cons]\n intro a i h\n have h1 := CodeReq.ofPro... | [
{
"name": "sub_divCodeNoNop_of_phaseB_left",
"text": "private theorem sub_divCodeNoNop_of_phaseB_left {base : Word} {rest : CodeReq} :\n ∀ a i,\n CodeReq.ofProg (base + phaseBOff) divK_phaseB a = some i →\n ((CodeReq.ofProg base (divK_phaseA 1020)).union\n ((CodeReq.ofProg (base + phaseB... | [
{
"name": "bne_x6_8_sub_divCode_noNop",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 562,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | @@ -16,9 +16,27 @@
(bv64_4mul_9 bv64_4mul_10 bv64_4mul_11 bv64_4mul_12 bv64_4mul_13
bv64_4mul_14 bv64_4mul_15)
+private theorem sub_divCodeNoNop_of_phaseB_left {base : Word} {rest : CodeReq} :
+ ∀ a i,
+ CodeReq.ofProg (base + phaseBOff) divK_phaseB a = some i →
+ ((CodeReq.ofProg base (divK_phase... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cd1b042eff26_9 | 2420f4f6e4bb947a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseABNoNop.lean | PhaseABNoNop | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 10 | [
{
"theorem_name": "divK_phaseB_init1_code_sub_divCode_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold divCode_noNop; simp only [CodeReq.unionAll_cons]\n intro a i h\n have h1 := CodeReq.ofPro... | [
{
"name": "sub_divCodeNoNop_of_phaseB_left",
"text": "private theorem sub_divCodeNoNop_of_phaseB_left {base : Word} {rest : CodeReq} :\n ∀ a i,\n CodeReq.ofProg (base + phaseBOff) divK_phaseB a = some i →\n ((CodeReq.ofProg base (divK_phaseA 1020)).union\n ((CodeReq.ofProg (base + phaseB... | [
{
"name": "addi_x5_1_sub_divCode_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 566,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | @@ -16,9 +16,27 @@
(bv64_4mul_9 bv64_4mul_10 bv64_4mul_11 bv64_4mul_12 bv64_4mul_13
bv64_4mul_14 bv64_4mul_15)
+private theorem sub_divCodeNoNop_of_phaseB_left {base : Word} {rest : CodeReq} :
+ ∀ a i,
+ CodeReq.ofProg (base + phaseBOff) divK_phaseB a = some i →
+ ((CodeReq.ofProg base (divK_phase... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cd1b042eff26_10 | 4d059c2e486d5de6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseABNoNop.lean | PhaseABNoNop | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 1 | [
{
"theorem_name": "evm_div_phaseA_ntaken_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbody := cpsTripleWithin_extend_code divK_phaseA_code_sub_divCode_noNop\n (divK_phaseA_bod... | [
{
"name": "beq_singleton_sub_divCode_noNop",
"text": "private theorem beq_singleton_sub_divCode_noNop {base : Word} :\n ∀ a i, (CodeReq.singleton (base + phaseABeqOff) (.BEQ .x5 .x0 1020)) a = some i →\n (divCode_noNop base) a = some i := by\n unfold divCode_noNop; simp only [CodeReq.unionAll_cons]... | [
{
"name": "evm_div_phaseA_ntaken_spec_within_noNop",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 33,
"n_chars": 1843,
"n_subproofs": 7,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 3,
"automation_onl... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | @@ -21,6 +21,15 @@
unfold divCode_noNop divK_phaseA_code; simp only [CodeReq.unionAll_cons]
exact CodeReq.union_mono_left
+private theorem beq_singleton_sub_divCode_noNop {base : Word} :
+ ∀ a i, (CodeReq.singleton (base + phaseABeqOff) (.BEQ .x5 .x0 1020)) a = some i →
+ (divCode_noNop base) 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_cd1b042eff26_11 | 2c93b2247048b06f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseABNoNop.lean | PhaseABNoNop | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 3 | [
{
"theorem_name": "evm_div_phaseB_n1_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 154,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hinit1_raw := divK_phaseB_init1_spec_within sp (base + phaseBOff) q0 q1 q2 q3 u5 u6 u7\n simp o... | [
{
"name": "addi_x5_3_sub_divCode_noNop",
"text": "private theorem addi_x5_3_sub_divCode_noNop {base : Word} :\n ∀ a i, (CodeReq.singleton (base + phaseBStep1Off) (.ADDI .x5 .x0 3)) a = some i →\n (divCode_noNop base) a = some i := by\n unfold divCode_noNop; simp only [CodeReq.unionAll_cons]\n intr... | [
{
"name": "evm_div_phaseB_n1_spec_within_noNop",
"fan_in": 1,
"n_deps_direct": 21,
"n_deps_transitive": 22,
"n_lines": 176,
"n_chars": 11962,
"n_subproofs": 45,
"n_tactics": 154,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 6,
"n_structural": 7,
"automation_o... | 22 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | @@ -102,6 +102,17 @@
show (base + phaseBOff : Word) + 40 = base + phaseBBneOff from by bv_addr] at hlookup
exact sub_divCodeNoNop_of_phaseB_left a i (CodeReq.singleton_mono hlookup a i h)
+private theorem addi_x5_3_sub_divCode_noNop {base : Word} :
+ ∀ a i, (CodeReq.singleton (base + phaseBStep1Off) (.AD... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cd1b042eff26_12 | b311351b4609a994 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseABNoNop.lean | PhaseABNoNop | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 3 | [
{
"theorem_name": "evm_div_phaseB_n1_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 154,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hinit1_raw := divK_phaseB_init1_spec_within sp (base + phaseBOff) q0 q1 q2 q3 u5 u6 u7\n simp o... | [
{
"name": "addi_x5_3_sub_divCode_noNop",
"text": "private theorem addi_x5_3_sub_divCode_noNop {base : Word} :\n ∀ a i, (CodeReq.singleton (base + phaseBStep1Off) (.ADDI .x5 .x0 3)) a = some i →\n (divCode_noNop base) a = some i := by\n unfold divCode_noNop; simp only [CodeReq.unionAll_cons]\n intr... | [
{
"name": "evm_div_phaseB_n2_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 19,
"n_deps_transitive": 20,
"n_lines": 162,
"n_chars": 10683,
"n_subproofs": 41,
"n_tactics": 140,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 6,
"n_structural": 7,
"automation_o... | 20 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | @@ -100,6 +100,17 @@
show (base + phaseBOff : Word) + 40 = base + phaseBBneOff from by bv_addr] at hlookup
exact sub_divCodeNoNop_of_phaseB_left a i (CodeReq.singleton_mono hlookup a i h)
+private theorem addi_x5_3_sub_divCode_noNop {base : Word} :
+ ∀ a i, (CodeReq.singleton (base + phaseBStep1Off) (.AD... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cd1b042eff26_13 | 6d8bd8c712d8b384 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseABNoNop.lean | PhaseABNoNop | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 4 | [
{
"theorem_name": "evm_div_phaseB_n1_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 154,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hinit1_raw := divK_phaseB_init1_spec_within sp (base + phaseBOff) q0 q1 q2 q3 u5 u6 u7\n simp o... | [
{
"name": "addi_x5_singleton_sub_divCode_noNop",
"text": "private theorem addi_x5_singleton_sub_divCode_noNop {base : Word} :\n ∀ a i, (CodeReq.singleton (base + phaseBStep0Off) (.ADDI .x5 .x0 4)) a = some i →\n (divCode_noNop base) a = some i := by\n unfold divCode_noNop; simp only [CodeReq.unionA... | [
{
"name": "evm_div_phaseB_n4_spec_within_noNop",
"fan_in": 1,
"n_deps_direct": 11,
"n_deps_transitive": 12,
"n_lines": 57,
"n_chars": 3613,
"n_subproofs": 13,
"n_tactics": 35,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 2,
"n_structural": 3,
"automation_only... | 12 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | @@ -71,6 +71,17 @@
(by bv_addr) (by decide) (by decide) (by decide) a i h
exact sub_divCodeNoNop_of_phaseB_left a i h1
+private theorem addi_x5_singleton_sub_divCode_noNop {base : Word} :
+ ∀ a i, (CodeReq.singleton (base + phaseBStep0Off) (.ADDI .x5 .x0 4)) a = some i →
+ (divCode_noNop base) a = som... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cd1b042eff26_14 | 635c27433e2b3566 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseABNoNop.lean | PhaseABNoNop | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 4 | [
{
"theorem_name": "evm_div_phaseB_n1_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 154,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hinit1_raw := divK_phaseB_init1_spec_within sp (base + phaseBOff) q0 q1 q2 q3 u5 u6 u7\n simp o... | [
{
"name": "bne_x10_singleton_sub_divCode_noNop",
"text": "private theorem bne_x10_singleton_sub_divCode_noNop {base : Word} :\n ∀ a i, (CodeReq.singleton (base + phaseBBneOff) (.BNE .x10 .x0 24)) a = some i →\n (divCode_noNop base) a = some i := by\n unfold divCode_noNop; simp only [CodeReq.unionAl... | [
{
"name": "evm_div_phaseB_n3_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 15,
"n_deps_transitive": 16,
"n_lines": 129,
"n_chars": 8473,
"n_subproofs": 31,
"n_tactics": 107,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 4,
"n_structural": 5,
"automation_on... | 16 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | @@ -85,6 +85,17 @@
show (base + phaseBOff : Word) + 36 = base + phaseBStep0Off from by bv_addr] at hlookup
exact sub_divCodeNoNop_of_phaseB_left a i (CodeReq.singleton_mono hlookup a i h)
+private theorem bne_x10_singleton_sub_divCode_noNop {base : Word} :
+ ∀ a i, (CodeReq.singleton (base + phaseBBneOff... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cd1b042eff26_15 | 3a5c8b0cf14df456 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseABNoNop.lean | PhaseABNoNop | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 4 | [
{
"theorem_name": "evm_div_phaseB_n1_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 154,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hinit1_raw := divK_phaseB_init1_spec_within sp (base + phaseBOff) q0 q1 q2 q3 u5 u6 u7\n simp o... | [
{
"name": "bne_x10_singleton_sub_divCode_noNop",
"text": "private theorem bne_x10_singleton_sub_divCode_noNop {base : Word} :\n ∀ a i, (CodeReq.singleton (base + phaseBBneOff) (.BNE .x10 .x0 24)) a = some i →\n (divCode_noNop base) a = some i := by\n unfold divCode_noNop; simp only [CodeReq.unionAl... | [
{
"name": "evm_div_phaseAB_n4_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 16,
"n_lines": 44,
"n_chars": 2545,
"n_subproofs": 5,
"n_tactics": 21,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only"... | 16 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | @@ -96,6 +96,17 @@
show (base + phaseBOff : Word) + 36 = base + phaseBStep0Off from by bv_addr] at hlookup
exact sub_divCodeNoNop_of_phaseB_left a i (CodeReq.singleton_mono hlookup a i h)
+private theorem bne_x10_singleton_sub_divCode_noNop {base : Word} :
+ ∀ a i, (CodeReq.singleton (base + phaseBBneOff... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cd1b042eff26_16 | fee3b850ccff5f74 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/PhaseABNoNop.lean | PhaseABNoNop | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 3 | [
{
"theorem_name": "evm_div_phaseB_n1_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 154,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hinit1_raw := divK_phaseB_init1_spec_within sp (base + phaseBOff) q0 q1 q2 q3 u5 u6 u7\n simp o... | [
{
"name": "bne_x7_16_sub_divCode_noNop",
"text": "private theorem bne_x7_16_sub_divCode_noNop {base : Word} :\n ∀ a i, (CodeReq.singleton (base + phaseBBne2Off) (.BNE .x7 .x0 16)) a = some i →\n (divCode_noNop base) a = some i := by\n unfold divCode_noNop; simp only [CodeReq.unionAll_cons]\n intro... | [
{
"name": "evm_div_phaseAB_n1_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 26,
"n_lines": 41,
"n_chars": 2501,
"n_subproofs": 4,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only"... | 26 | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | /-
EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
No-NOP DIV Phase A/B wrappers used by callable DIV/SDIV composition.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Rv64.Tactics.XPermChunked
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm
(bv64_4mul_9 bv64_4... | @@ -127,6 +127,17 @@
show (base + phaseBOff : Word) + 44 = base + phaseBStep1Off from by bv_addr] at hlookup
exact sub_divCodeNoNop_of_phaseB_left a i (CodeReq.singleton_mono hlookup a i h)
+private theorem bne_x7_16_sub_divCode_noNop {base : Word} :
+ ∀ a i, (CodeReq.singleton (base + phaseBBne2Off) (.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_f442dc1b9c1e_0 | 2a75270b640884c6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1V5Shift0ModRemainder.lean | N1V5Shift0ModRemainder | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "fullModN1RemainderWordShift0V5_eq_mod_of_shape",
"depth": 1,
"n_commands": 0,
"n_lines": 48,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hb0nz : b0 ≠ 0 := by\n rw [hb1z, hb2z, hb3z] at hbnz; simpa using hbnz\n have rem_... | [
{
"name": "val256_lo2_mod",
"text": "private theorem val256_lo2_mod (x y : Word) :\n val256 x y 0 0 = x.toNat + 2 ^ 64 * y.toNat := by\n unfold val256\n simp only [show (0 : Word).toNat = 0 from by decide]\n ring\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 179,
"n_subproofs": 0,
"n... | [
{
"name": "fullModN1RemainderWordShift0V5_eq_mod_of_shape",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 60,
"n_chars": 3297,
"n_subproofs": 19,
"n_tactics": 60,
"cyclomatic": 1,
"n_automation": 12,
"n_rewrites": 12,
"n_structural": 10,
"aut... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N1V5Shift0ModRemainder
v5 n=1 **shift=0** MOD remainder correctness: the shift=0 schoolbook leaves the
exact remainder `EvmWord.mod a b` in the low u-cell, from the divisor shape
`(clzResult b0).1 = 0` (single-limb divisor, already top-bit aligned, no
normalization scaling).
MO... | /-
EvmAsm.Evm64.DivMod.Spec.N1V5Shift0ModRemainder
v5 n=1 **shift=0** MOD remainder correctness: the shift=0 schoolbook leaves the
exact remainder `EvmWord.mod a b` in the low u-cell, from the divisor shape
`(clzResult b0).1 = 0` (single-limb divisor, already top-bit aligned, no
normalization scaling).
MO... | @@ -23,6 +23,12 @@
open EvmAsm.Rv64
open EvmWord
+private theorem val256_lo2_mod (x y : Word) :
+ val256 x y 0 0 = x.toNat + 2 ^ 64 * y.toNat := by
+ unfold val256
+ simp only [show (0 : Word).toNat = 0 from by decide]
+ ring
+
/-- Pack the four shift=0 MOD remainder limbs (the loop's un-normalized u-cells,
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f442dc1b9c1e_1 | 2d0f9d74af75752e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1V5Shift0ModRemainder.lean | N1V5Shift0ModRemainder | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "fullModN1RemainderWordShift0V5_eq_mod_of_shape",
"depth": 1,
"n_commands": 0,
"n_lines": 48,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hb0nz : b0 ≠ 0 := by\n rw [hb1z, hb2z, hb3z] at hbnz; simpa using hbnz\n have rem_... | [
{
"name": "val256_lo2_mod",
"text": "private theorem val256_lo2_mod (x y : Word) :\n val256 x y 0 0 = x.toNat + 2 ^ 64 * y.toNat := by\n unfold val256\n simp only [show (0 : Word).toNat = 0 from by decide]\n ring\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 179,
"n_subproofs": 0,
"n... | [
{
"name": "fullModN1RemainderWordShift0V5_eq_mod_lane_of_shape",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 952,
"n_subproofs": 1,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 9,
"n_structural": 3,
"aut... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.N1V5Shift0ModRemainder
v5 n=1 **shift=0** MOD remainder correctness: the shift=0 schoolbook leaves the
exact remainder `EvmWord.mod a b` in the low u-cell, from the divisor shape
`(clzResult b0).1 = 0` (single-limb divisor, already top-bit aligned, no
normalization scaling).
MO... | /-
EvmAsm.Evm64.DivMod.Spec.N1V5Shift0ModRemainder
v5 n=1 **shift=0** MOD remainder correctness: the shift=0 schoolbook leaves the
exact remainder `EvmWord.mod a b` in the low u-cell, from the divisor shape
`(clzResult b0).1 = 0` (single-limb divisor, already top-bit aligned, no
normalization scaling).
MO... | @@ -23,6 +23,12 @@
open EvmAsm.Rv64
open EvmWord
+private theorem val256_lo2_mod (x y : Word) :
+ val256 x y 0 0 = x.toNat + 2 ^ 64 * y.toNat := by
+ unfold val256
+ simp only [show (0 : Word).toNat = 0 from by decide]
+ ring
+
/-- Pack the four shift=0 MOD remainder limbs (the loop's un-normalized u-cells,
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1792983c05a3_0 | fa8beb213c2cd3f2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254PtCopySAsm.lean | Bn254PtCopySAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "copy_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 37,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hse0 : signExtend12 (0 : BitVec 12) = (0 : Word) := by decide\n have hloadAddr : rf.get .x10 + signExtend12 (0 : BitVec ... | [
{
"name": "src_miss8",
"text": "private theorem src_miss8 (src dst : Word) (ws : List (BitVec 8)) (k : Nat)\n (hk : k < 144) (hws : ws.length = 1152) (hfr : frameOk1152 src dst) :\n ¬ inRw dst ws (src + BitVec.ofNat 64 (8 * k)) 8 := by\n obtain ⟨hnws, hnwd, hdisj⟩ := hfr\n unfold inRw\n rw [hws]\n ... | [
{
"name": "copy_engine",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 46,
"n_chars": 2250,
"n_subproofs": 5,
"n_tactics": 37,
"cyclomatic": 1,
"n_automation": 11,
"n_rewrites": 13,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 3 | /-
EvmAsm.Codegen.Programs.Bn254PtCopySAsm
Verified SAsm port of `bnq_pt_copy`: copy the 1152-byte BN254 FQ12 projective point from
`a0` to the writable destination at `a1`. The emitted routine is a
bottom-test dword loop over 144 limbs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
i... | /-
EvmAsm.Codegen.Programs.Bn254PtCopySAsm
Verified SAsm port of `bnq_pt_copy`: copy the 1152-byte BN254 FQ12 projective point from
`a0` to the writable destination at `a1`. The emitted routine is a
bottom-test dword loop over 144 limbs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
i... | @@ -46,6 +46,14 @@
dsimp only [aluSem, loadSem]
rw [if_neg h]
+private theorem src_miss8 (src dst : Word) (ws : List (BitVec 8)) (k : Nat)
+ (hk : k < 144) (hws : ws.length = 1152) (hfr : frameOk1152 src dst) :
+ ¬ inRw dst ws (src + BitVec.ofNat 64 (8 * k)) 8 := by
+ obtain ⟨hnws, hnwd, hdisj⟩ := hfr
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1792983c05a3_1 | 3afc41ee36835bdf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254PtCopySAsm.lean | Bn254PtCopySAsm | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "copy_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 37,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hse0 : signExtend12 (0 : BitVec 12) = (0 : Word) := by decide\n have hloadAddr : rf.get .x10 + signExtend12 (0 : BitVec ... | [
{
"name": "src_miss8",
"text": "private theorem src_miss8 (src dst : Word) (ws : List (BitVec 8)) (k : Nat)\n (hk : k < 144) (hws : ws.length = 1152) (hfr : frameOk1152 src dst) :\n ¬ inRw dst ws (src + BitVec.ofNat 64 (8 * k)) 8 := by\n obtain ⟨hnws, hnwd, hdisj⟩ := hfr\n unfold inRw\n rw [hws]\n ... | [
{
"name": "copy_blockVCs",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 46,
"n_chars": 2050,
"n_subproofs": 6,
"n_tactics": 39,
"cyclomatic": 2,
"n_automation": 11,
"n_rewrites": 16,
"n_structural": 6,
"automation_only": false,
"max_nest... | 2 | /-
EvmAsm.Codegen.Programs.Bn254PtCopySAsm
Verified SAsm port of `bnq_pt_copy`: copy the 1152-byte BN254 FQ12 projective point from
`a0` to the writable destination at `a1`. The emitted routine is a
bottom-test dword loop over 144 limbs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
i... | /-
EvmAsm.Codegen.Programs.Bn254PtCopySAsm
Verified SAsm port of `bnq_pt_copy`: copy the 1152-byte BN254 FQ12 projective point from
`a0` to the writable destination at `a1`. The emitted routine is a
bottom-test dword loop over 144 limbs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
i... | @@ -46,6 +46,14 @@
dsimp only [aluSem, loadSem]
rw [if_neg h]
+private theorem src_miss8 (src dst : Word) (ws : List (BitVec 8)) (k : Nat)
+ (hk : k < 144) (hws : ws.length = 1152) (hfr : frameOk1152 src dst) :
+ ¬ inRw dst ws (src + BitVec.ofNat 64 (8 * k)) 8 := by
+ obtain ⟨hnws, hnwd, hdisj⟩ := hfr
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1792983c05a3_2 | 39590323e0737f6a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254PtCopySAsm.lean | Bn254PtCopySAsm | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "copy_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 37,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hse0 : signExtend12 (0 : BitVec 12) = (0 : Word) := by decide\n have hloadAddr : rf.get .x10 + signExtend12 (0 : BitVec ... | [
{
"name": "src_miss8",
"text": "private theorem src_miss8 (src dst : Word) (ws : List (BitVec 8)) (k : Nat)\n (hk : k < 144) (hws : ws.length = 1152) (hfr : frameOk1152 src dst) :\n ¬ inRw dst ws (src + BitVec.ofNat 64 (8 * k)) 8 := by\n obtain ⟨hnws, hnwd, hdisj⟩ := hfr\n unfold inRw\n rw [hws]\n ... | [
{
"name": "bnqPtCopyFn_spec",
"fan_in": 0,
"n_deps_direct": 9,
"n_deps_transitive": 12,
"n_lines": 94,
"n_chars": 4878,
"n_subproofs": 8,
"n_tactics": 91,
"cyclomatic": 14,
"n_automation": 48,
"n_rewrites": 24,
"n_structural": 22,
"automation_only": false,
"ma... | 12 | /-
EvmAsm.Codegen.Programs.Bn254PtCopySAsm
Verified SAsm port of `bnq_pt_copy`: copy the 1152-byte BN254 FQ12 projective point from
`a0` to the writable destination at `a1`. The emitted routine is a
bottom-test dword loop over 144 limbs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
i... | /-
EvmAsm.Codegen.Programs.Bn254PtCopySAsm
Verified SAsm port of `bnq_pt_copy`: copy the 1152-byte BN254 FQ12 projective point from
`a0` to the writable destination at `a1`. The emitted routine is a
bottom-test dword loop over 144 limbs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
i... | @@ -124,6 +124,14 @@
dsimp only [aluSem, loadSem]
rw [if_neg h]
+private theorem src_miss8 (src dst : Word) (ws : List (BitVec 8)) (k : Nat)
+ (hk : k < 144) (hws : ws.length = 1152) (hfr : frameOk1152 src dst) :
+ ¬ inRw dst ws (src + BitVec.ofNat 64 (8 * k)) 8 := by
+ obtain ⟨hnws, hnwd, hdisj⟩ := hfr
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9cf7fcc29c59_0 | 1d133b51ba7bbafb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductSuffix.lean | ProductSuffix | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "evm_mulmod_product_tenth_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_finish_spec_withi... | [
{
"name": "evm_mulmod_program_code_product_tenth_finish_sub",
"text": "/-- The finish suffix of the tenth product partial at offset 1272 is subsumed by\n the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_tenth_finish_sub\n (base : Word) :\n ∀ a i, (CodeReq.ofProg ... | [
{
"name": "evm_mulmod_product_tenth_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 1017,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | @@ -25,6 +25,23 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The finish suffix of the tenth product partial at offset 1272 is subsumed by
+ the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_tenth_finish_sub
+ (base : Word) :
+ ∀ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9cf7fcc29c59_1 | 0697111d578fa37e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductSuffix.lean | ProductSuffix | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "evm_mulmod_product_tenth_carry_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_propagate_carry_136_144_152_sp... | [
{
"name": "evm_mulmod_program_code_product_tenth_carry_sub",
"text": "/-- The carry-propagation suffix of the tenth product partial at offset 1280 is\n subsumed by the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_tenth_carry_sub\n (base : Word) :\n ∀ a i, (CodeRe... | [
{
"name": "evm_mulmod_product_tenth_carry_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 26,
"n_chars": 1385,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"a... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | @@ -25,6 +25,23 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The carry-propagation suffix of the tenth product partial at offset 1280 is
+ subsumed by the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_tenth_carry_sub
+ (base : Word)... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9cf7fcc29c59_2 | 79dd017aa10c7ac7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductSuffix.lean | ProductSuffix | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "evm_mulmod_product_eleventh_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_finish_spec_wi... | [
{
"name": "evm_mulmod_program_code_product_eleventh_finish_sub",
"text": "/-- The finish suffix of the eleventh product partial at offset 1380 is subsumed by\n the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_eleventh_finish_sub\n (base : Word) :\n ∀ a i, (CodeRe... | [
{
"name": "evm_mulmod_product_eleventh_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 1026,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | @@ -25,6 +25,23 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The finish suffix of the eleventh product partial at offset 1380 is subsumed by
+ the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_eleventh_finish_sub
+ (base : Word) :
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9cf7fcc29c59_3 | b2882bacf942cc9b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductSuffix.lean | ProductSuffix | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "evm_mulmod_product_eleventh_carry_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_propagate_carry_144_152_spe... | [
{
"name": "evm_mulmod_program_code_product_eleventh_carry_sub",
"text": "/-- The carry-propagation suffix of the eleventh product partial at offset 1388 is\n subsumed by the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_eleventh_carry_sub\n (base : Word) :\n ∀ a i... | [
{
"name": "evm_mulmod_product_eleventh_carry_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 1083,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | @@ -25,6 +25,23 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The carry-propagation suffix of the eleventh product partial at offset 1388 is
+ subsumed by the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_eleventh_carry_sub
+ (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_9cf7fcc29c59_4 | 36207729e6d4643a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductSuffix.lean | ProductSuffix | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "evm_mulmod_product_twelfth_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_finish_spec_wit... | [
{
"name": "evm_mulmod_program_code_product_twelfth_finish_sub",
"text": "/-- The finish suffix of the twelfth product partial at offset 1472 is subsumed by\n the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_twelfth_finish_sub\n (base : Word) :\n ∀ a i, (CodeReq.o... | [
{
"name": "evm_mulmod_product_twelfth_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 1023,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | @@ -25,6 +25,23 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The finish suffix of the twelfth product partial at offset 1472 is subsumed by
+ the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_twelfth_finish_sub
+ (base : Word) :
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9cf7fcc29c59_5 | 6901e27f04474acf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductSuffix.lean | ProductSuffix | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "evm_mulmod_product_twelfth_carry_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_propagate_carry_144_152_spec... | [
{
"name": "evm_mulmod_program_code_product_twelfth_carry_sub",
"text": "/-- The carry-propagation suffix of the twelfth product partial at offset 1480 is\n subsumed by the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_twelfth_carry_sub\n (base : Word) :\n ∀ a i, (... | [
{
"name": "evm_mulmod_product_twelfth_carry_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 1080,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | @@ -25,6 +25,23 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The carry-propagation suffix of the twelfth product partial at offset 1480 is
+ subsumed by the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_twelfth_carry_sub
+ (base : W... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9cf7fcc29c59_6 | 8b3fbe703a6f73da | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductSuffix.lean | ProductSuffix | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "evm_mulmod_product_thirteenth_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_finish_spec_... | [
{
"name": "evm_mulmod_program_code_product_thirteenth_finish_sub",
"text": "/-- The finish suffix of the thirteenth product partial at offset 1564 is subsumed by\n the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_thirteenth_finish_sub\n (base : Word) :\n ∀ a i, (... | [
{
"name": "evm_mulmod_product_thirteenth_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 1032,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | @@ -25,6 +25,23 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The finish suffix of the thirteenth product partial at offset 1564 is subsumed by
+ the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_thirteenth_finish_sub
+ (base : Word)... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9cf7fcc29c59_7 | 8b1ff93dc38bdb33 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductSuffix.lean | ProductSuffix | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "evm_mulmod_product_thirteenth_carry_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_propagate_carry_144_152_s... | [
{
"name": "evm_mulmod_program_code_product_thirteenth_carry_sub",
"text": "/-- The carry-propagation suffix of the thirteenth product partial at offset 1572 is\n subsumed by the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_thirteenth_carry_sub\n (base : Word) :\n ... | [
{
"name": "evm_mulmod_product_thirteenth_carry_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 1089,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | @@ -25,6 +25,23 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The carry-propagation suffix of the thirteenth product partial at offset 1572 is
+ subsumed by the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_thirteenth_carry_sub
+ (ba... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9cf7fcc29c59_8 | f4cfeae7ac8e9df2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductSuffix.lean | ProductSuffix | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "evm_mulmod_product_fourteenth_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_finish_spec_... | [
{
"name": "evm_mulmod_program_code_product_fourteenth_finish_sub",
"text": "/-- The finish suffix of the fourteenth product partial at offset 1656 is subsumed by\n the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_fourteenth_finish_sub\n (base : Word) :\n ∀ a i, (... | [
{
"name": "evm_mulmod_product_fourteenth_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 1032,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | @@ -25,6 +25,23 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The finish suffix of the fourteenth product partial at offset 1656 is subsumed by
+ the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_fourteenth_finish_sub
+ (base : Word)... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9cf7fcc29c59_9 | 752b75d7a66ad12f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductSuffix.lean | ProductSuffix | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "evm_mulmod_product_fourteenth_carry_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_propagate_carry_one_spec_... | [
{
"name": "evm_mulmod_program_code_product_fourteenth_carry_sub",
"text": "/-- The carry-propagation suffix of the fourteenth product partial at offset 1664 is\n subsumed by the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_fourteenth_carry_sub\n (base : Word) :\n ... | [
{
"name": "evm_mulmod_product_fourteenth_carry_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 862,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | @@ -25,6 +25,23 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The carry-propagation suffix of the fourteenth product partial at offset 1664 is
+ subsumed by the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_fourteenth_carry_sub
+ (ba... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9cf7fcc29c59_10 | 50dfb72e3b631af2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductSuffix.lean | ProductSuffix | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "evm_mulmod_product_fifteenth_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_finish_spec_w... | [
{
"name": "evm_mulmod_program_code_product_fifteenth_finish_sub",
"text": "/-- The finish suffix of the fifteenth product partial at offset 1732 is subsumed by\n the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_fifteenth_finish_sub\n (base : Word) :\n ∀ a i, (Cod... | [
{
"name": "evm_mulmod_product_fifteenth_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 1029,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | @@ -25,6 +25,23 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The finish suffix of the fifteenth product partial at offset 1732 is subsumed by
+ the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_fifteenth_finish_sub
+ (base : Word) :... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9cf7fcc29c59_11 | 555b59b6d1b67421 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductSuffix.lean | ProductSuffix | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "evm_mulmod_product_fifteenth_carry_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_propagate_carry_one_spec_w... | [
{
"name": "evm_mulmod_program_code_product_fifteenth_carry_sub",
"text": "/-- The carry-propagation suffix of the fifteenth product partial at offset 1740 is\n subsumed by the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_fifteenth_carry_sub\n (base : Word) :\n ∀ ... | [
{
"name": "evm_mulmod_product_fifteenth_carry_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 859,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | @@ -25,6 +25,23 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The carry-propagation suffix of the fifteenth product partial at offset 1740 is
+ subsumed by the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_fifteenth_carry_sub
+ (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_9cf7fcc29c59_12 | 3553ba706c8aa41d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductSuffix.lean | ProductSuffix | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "evm_mulmod_product_sixteenth_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_finish_spec_w... | [
{
"name": "evm_mulmod_program_code_product_sixteenth_finish_sub",
"text": "/-- The finish suffix of the final product partial at offset 1808 is subsumed by\n the top-level `evm_mulmod_program_code`. The final partial has no carry tail,\n so this suffix reaches the reducer start at offset 1816. -/\nthe... | [
{
"name": "evm_mulmod_product_sixteenth_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 1025,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | /-
EvmAsm.Evm64.MulMod.Compose.ProductSuffix
Additional product-partial suffix lifts for MULMOD, kept separate from
`Compose.Base` so the base infrastructure stays below the file-size cap.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv6... | @@ -25,6 +25,24 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The finish suffix of the final product partial at offset 1808 is subsumed by
+ the top-level `evm_mulmod_program_code`. The final partial has no carry tail,
+ so this suffix reaches the reducer start at off... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_84f6f8ee38ea_0 | 9c12d4278b12fa6d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/AddMod.lean | AddMod | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "addmod_eq_carry_split",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [addmod_correct, if_neg h, ← addCarry_spec]",
"n_chars": 54,
"n_subproofs": 0,
"n_tactics": 2,
"cy... | [
{
"name": "addmod_correct",
"text": "/-- Algebraic correctness of `EvmWord.addmod`. -/\ntheorem addmod_correct (a b N : EvmWord) :\n (EvmWord.addmod a b N).toNat =\n if N = 0 then 0 else (a.toNat + b.toNat) % N.toNat := by\n unfold addmod\n by_cases h : N = 0\n · simp [h]\n · simp only [if_neg h... | [
{
"name": "addmod_eq_carry_split",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 15,
"n_chars": 744,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_... | 2 | /-
EvmAsm.Evm64.EvmWordArith.AddMod
EVM ADDMOD semantics: word-level definition and correctness theorem.
Provides:
* `EvmWord.addmod a b N` — the EVM `ADDMOD` operation: `(a + b) mod N`
with `N = 0 ⇒ 0`, where the intermediate sum `a + b` is taken at
full 257-bit precision (carry out of bit 255).
* ... | /-
EvmAsm.Evm64.EvmWordArith.AddMod
EVM ADDMOD semantics: word-level definition and correctness theorem.
Provides:
* `EvmWord.addmod a b N` — the EVM `ADDMOD` operation: `(a + b) mod N`
with `N = 0 ⇒ 0`, where the intermediate sum `a + b` is taken at
full 257-bit precision (carry out of bit 255).
* ... | @@ -67,6 +67,29 @@
def addmod (a b N : EvmWord) : EvmWord :=
if N = 0 then 0 else BitVec.ofNat 256 ((a.toNat + b.toNat) % N.toNat)
+/-- Algebraic correctness of `EvmWord.addmod`. -/
+theorem addmod_correct (a b N : EvmWord) :
+ (EvmWord.addmod a b N).toNat =
+ if N = 0 then 0 else (a.toNat + b.toNat) % N.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_84f6f8ee38ea_1 | 8485874726d9f8b7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/AddMod.lean | AddMod | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "addmod_eq_carry_split",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [addmod_correct, if_neg h, ← addCarry_spec]",
"n_chars": 54,
"n_subproofs": 0,
"n_tactics": 2,
"cy... | [
{
"name": "addmod_correct",
"text": "/-- Algebraic correctness of `EvmWord.addmod`. -/\ntheorem addmod_correct (a b N : EvmWord) :\n (EvmWord.addmod a b N).toNat =\n if N = 0 then 0 else (a.toNat + b.toNat) % N.toNat := by\n unfold addmod\n by_cases h : N = 0\n · simp [h]\n · simp only [if_neg h... | [
{
"name": "mod_truncated_sum_eq_addmod_of_no_overflow",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 37,
"n_chars": 1589,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 1,
"automation_o... | 1 | /-
EvmAsm.Evm64.EvmWordArith.AddMod
EVM ADDMOD semantics: word-level definition and correctness theorem.
Provides:
* `EvmWord.addmod a b N` — the EVM `ADDMOD` operation: `(a + b) mod N`
with `N = 0 ⇒ 0`, where the intermediate sum `a + b` is taken at
full 257-bit precision (carry out of bit 255).
* ... | /-
EvmAsm.Evm64.EvmWordArith.AddMod
EVM ADDMOD semantics: word-level definition and correctness theorem.
Provides:
* `EvmWord.addmod a b N` — the EVM `ADDMOD` operation: `(a + b) mod N`
with `N = 0 ⇒ 0`, where the intermediate sum `a + b` is taken at
full 257-bit precision (carry out of bit 255).
* ... | @@ -42,6 +42,29 @@
def addmod (a b N : EvmWord) : EvmWord :=
if N = 0 then 0 else BitVec.ofNat 256 ((a.toNat + b.toNat) % N.toNat)
+/-- Algebraic correctness of `EvmWord.addmod`. -/
+theorem addmod_correct (a b N : EvmWord) :
+ (EvmWord.addmod a b N).toNat =
+ if N = 0 then 0 else (a.toNat + b.toNat) % N.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_84f6f8ee38ea_2 | e907e5e671c1b5c2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/AddMod.lean | AddMod | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "pow256ModN_runtime_construction",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hNpos : 0 < N.toNat := by\n rcases Nat.eq_zero_or_pos N.toNat with h | h\n · exact absurd (BitV... | [
{
"name": "pow256ModN_correct",
"text": "/-- Algebraic correctness of `EvmWord.pow256ModN`. -/\ntheorem pow256ModN_correct (N : EvmWord) :\n (EvmWord.pow256ModN N).toNat =\n if N = 0 then 0 else 2 ^ 256 % N.toNat := by\n unfold pow256ModN\n by_cases h : N = 0\n · simp [h]\n · simp only [if_neg h... | [
{
"name": "pow256ModN_runtime_construction",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 42,
"n_chars": 2093,
"n_subproofs": 9,
"n_tactics": 25,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 7,
"n_structural": 5,
"automation_only": fals... | 1 | /-
EvmAsm.Evm64.EvmWordArith.AddMod
EVM ADDMOD semantics: word-level definition and correctness theorem.
Provides:
* `EvmWord.addmod a b N` — the EVM `ADDMOD` operation: `(a + b) mod N`
with `N = 0 ⇒ 0`, where the intermediate sum `a + b` is taken at
full 257-bit precision (carry out of bit 255).
* ... | /-
EvmAsm.Evm64.EvmWordArith.AddMod
EVM ADDMOD semantics: word-level definition and correctness theorem.
Provides:
* `EvmWord.addmod a b N` — the EVM `ADDMOD` operation: `(a + b) mod N`
with `N = 0 ⇒ 0`, where the intermediate sum `a + b` is taken at
full 257-bit precision (carry out of bit 255).
* ... | @@ -77,6 +77,37 @@
def pow256ModN (N : EvmWord) : EvmWord :=
if N = 0 then 0 else BitVec.ofNat 256 (2 ^ 256 % N.toNat)
+/-- Algebraic correctness of `EvmWord.pow256ModN`. -/
+theorem pow256ModN_correct (N : EvmWord) :
+ (EvmWord.pow256ModN N).toNat =
+ if N = 0 then 0 else 2 ^ 256 % N.toNat := by
+ unfol... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_84f6f8ee38ea_3 | a97e27d68786c267 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/AddMod.lean | AddMod | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "pow256ModN_runtime_construction",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hNpos : 0 < N.toNat := by\n rcases Nat.eq_zero_or_pos N.toNat with h | h\n · exact absurd (BitV... | [
{
"name": "pow256ModN_correct",
"text": "/-- Algebraic correctness of `EvmWord.pow256ModN`. -/\ntheorem pow256ModN_correct (N : EvmWord) :\n (EvmWord.pow256ModN N).toNat =\n if N = 0 then 0 else 2 ^ 256 % N.toNat := by\n unfold pow256ModN\n by_cases h : N = 0\n · simp [h]\n · simp only [if_neg h... | [
{
"name": "pow256ModN_lt",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 483,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
"max_nesting"... | 1 | /-
EvmAsm.Evm64.EvmWordArith.AddMod
EVM ADDMOD semantics: word-level definition and correctness theorem.
Provides:
* `EvmWord.addmod a b N` — the EVM `ADDMOD` operation: `(a + b) mod N`
with `N = 0 ⇒ 0`, where the intermediate sum `a + b` is taken at
full 257-bit precision (carry out of bit 255).
* ... | /-
EvmAsm.Evm64.EvmWordArith.AddMod
EVM ADDMOD semantics: word-level definition and correctness theorem.
Provides:
* `EvmWord.addmod a b N` — the EVM `ADDMOD` operation: `(a + b) mod N`
with `N = 0 ⇒ 0`, where the intermediate sum `a + b` is taken at
full 257-bit precision (carry out of bit 255).
* ... | @@ -77,10 +77,47 @@
def pow256ModN (N : EvmWord) : EvmWord :=
if N = 0 then 0 else BitVec.ofNat 256 (2 ^ 256 % N.toNat)
+/-- Algebraic correctness of `EvmWord.pow256ModN`. -/
+theorem pow256ModN_correct (N : EvmWord) :
+ (EvmWord.pow256ModN N).toNat =
+ if N = 0 then 0 else 2 ^ 256 % N.toNat := by
+ unfo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_84f6f8ee38ea_4 | 9f3e0b9ad53db100 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/AddMod.lean | AddMod | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "pow256ModN_runtime_construction",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hNpos : 0 < N.toNat := by\n rcases Nat.eq_zero_or_pos N.toNat with h | h\n · exact absurd (BitV... | [
{
"name": "pow256ModN_correct",
"text": "/-- Algebraic correctness of `EvmWord.pow256ModN`. -/\ntheorem pow256ModN_correct (N : EvmWord) :\n (EvmWord.pow256ModN N).toNat =\n if N = 0 then 0 else 2 ^ 256 % N.toNat := by\n unfold pow256ModN\n by_cases h : N = 0\n · simp [h]\n · simp only [if_neg h... | [
{
"name": "addmod_carry_eq_modAdd",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 42,
"n_chars": 2257,
"n_subproofs": 11,
"n_tactics": 28,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 8,
"n_structural": 5,
"automation_only": false,
"... | 4 | /-
EvmAsm.Evm64.EvmWordArith.AddMod
EVM ADDMOD semantics: word-level definition and correctness theorem.
Provides:
* `EvmWord.addmod a b N` — the EVM `ADDMOD` operation: `(a + b) mod N`
with `N = 0 ⇒ 0`, where the intermediate sum `a + b` is taken at
full 257-bit precision (carry out of bit 255).
* ... | /-
EvmAsm.Evm64.EvmWordArith.AddMod
EVM ADDMOD semantics: word-level definition and correctness theorem.
Provides:
* `EvmWord.addmod a b N` — the EVM `ADDMOD` operation: `(a + b) mod N`
with `N = 0 ⇒ 0`, where the intermediate sum `a + b` is taken at
full 257-bit precision (carry out of bit 255).
* ... | @@ -125,10 +125,47 @@
def pow256ModN (N : EvmWord) : EvmWord :=
if N = 0 then 0 else BitVec.ofNat 256 (2 ^ 256 % N.toNat)
+/-- Algebraic correctness of `EvmWord.pow256ModN`. -/
+theorem pow256ModN_correct (N : EvmWord) :
+ (EvmWord.pow256ModN N).toNat =
+ if N = 0 then 0 else 2 ^ 256 % N.toNat := by
+ un... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_84f6f8ee38ea_5 | 271c67ca33ab0806 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/AddMod.lean | AddMod | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "modAdd_eq_condSub_of",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hNpos : 0 < N.toNat := Nat.lt_of_le_of_lt (Nat.zero_le _) hm\n have hN256 : N.toNat < 2 ^ 256 := N.isLt\n have... | [
{
"name": "modAdd_correct",
"text": "/-- Algebraic correctness of `EvmWord.modAdd` under the pre-reduced\n precondition `a, b < N`: the `BitVec` truncation is a no-op because\n `(a + b) mod N < N ≤ 2^256`. -/\ntheorem modAdd_correct (a b N : EvmWord)\n (ha : a.toNat < N.toNat) (_hb : b.toNat < N.to... | [
{
"name": "modAdd_eq_condSub_of",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 39,
"n_chars": 2058,
"n_subproofs": 7,
"n_tactics": 22,
"cyclomatic": 2,
"n_automation": 7,
"n_rewrites": 4,
"n_structural": 3,
"automation_only": false,
"max... | 1 | /-
EvmAsm.Evm64.EvmWordArith.AddMod
EVM ADDMOD semantics: word-level definition and correctness theorem.
Provides:
* `EvmWord.addmod a b N` — the EVM `ADDMOD` operation: `(a + b) mod N`
with `N = 0 ⇒ 0`, where the intermediate sum `a + b` is taken at
full 257-bit precision (carry out of bit 255).
* ... | /-
EvmAsm.Evm64.EvmWordArith.AddMod
EVM ADDMOD semantics: word-level definition and correctness theorem.
Provides:
* `EvmWord.addmod a b N` — the EVM `ADDMOD` operation: `(a + b) mod N`
with `N = 0 ⇒ 0`, where the intermediate sum `a + b` is taken at
full 257-bit precision (carry out of bit 255).
* ... | @@ -70,6 +70,24 @@
def modAdd (a b N : EvmWord) : EvmWord :=
BitVec.ofNat 256 ((a.toNat + b.toNat) % N.toNat)
+/-- Algebraic correctness of `EvmWord.modAdd` under the pre-reduced
+ precondition `a, b < N`: the `BitVec` truncation is a no-op because
+ `(a + b) mod N < N ≤ 2^256`. -/
+theorem modAdd_correct (... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_84f6f8ee38ea_6 | 3317d4bab98cef34 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/AddMod.lean | AddMod | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "masked_sub_eq_modAdd",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [modAdd_eq_condSub_of m rMod N hm hr take htake, condSubMask]\n cases take with\n | true =>\n rw [if_pos rfl, ... | [
{
"name": "modAdd_eq_condSub_of",
"text": "/-- Word-level correctness of the branch-free conditional subtract that closes\n the pre-reduced modular add. With both operands `< N`, the true sum\n `σ = m.toNat + rMod.toNat < 2N`, so `σ mod N = σ − N` exactly when `σ ≥ N`.\n The runtime detects `σ ≥ N`... | [
{
"name": "masked_sub_eq_modAdd",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 1015,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
"max_... | 2 | /-
EvmAsm.Evm64.EvmWordArith.AddMod
EVM ADDMOD semantics: word-level definition and correctness theorem.
Provides:
* `EvmWord.addmod a b N` — the EVM `ADDMOD` operation: `(a + b) mod N`
with `N = 0 ⇒ 0`, where the intermediate sum `a + b` is taken at
full 257-bit precision (carry out of bit 255).
* ... | /-
EvmAsm.Evm64.EvmWordArith.AddMod
EVM ADDMOD semantics: word-level definition and correctness theorem.
Provides:
* `EvmWord.addmod a b N` — the EVM `ADDMOD` operation: `(a + b) mod N`
with `N = 0 ⇒ 0`, where the intermediate sum `a + b` is taken at
full 257-bit precision (carry out of bit 255).
* ... | @@ -95,6 +95,44 @@
def pow256ModN (N : EvmWord) : EvmWord :=
if N = 0 then 0 else BitVec.ofNat 256 (2 ^ 256 % N.toNat)
+/-- Word-level correctness of the branch-free conditional subtract that closes
+ the pre-reduced modular add. With both operands `< N`, the true sum
+ `σ = m.toNat + rMod.toNat < 2N`, so `... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1fe3ec20d5ce_0 | c0640b4511b04922 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V4NoNopLoopBodyConditional.lean | FullPathN1V4NoNopLoopBodyConditional | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 3 | [
{
"theorem_name": "divK_loop_n1_iter10_maxmax_exact_x1_v4_noNop_selected_carry_if_borrow",
"depth": 1,
"n_commands": 0,
"n_lines": 60,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let u_base_1 := sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec ... | [
{
"name": "divK_loop_body_n1_max_jgt0_exact_loopIter_v4_noNop_if_borrow",
"text": "/-- Loop body n=1, max path, j>0 over `divCode_noNop_v4`, requiring the\n double-addback progress fact only when the addback branch is taken. -/\ntheorem divK_loop_body_n1_max_jgt0_exact_loopIter_v4_noNop_if_borrow (j sp b... | [
{
"name": "divK_loop_n1_iter10_maxmax_exact_x1_v4_noNop_selected_carry_if_borrow",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 81,
"n_chars": 4338,
"n_subproofs": 6,
"n_tactics": 60,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 8,
"n_struc... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopLoopBodyConditional
Conditional-carry wrappers for the n=1 v4/no-NOP full DIV loop body.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopLoopBody
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopLoopBodyConditional
Conditional-carry wrappers for the n=1 v4/no-NOP full DIV loop body.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopLoopBody
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se... | @@ -15,6 +15,82 @@
open EvmAsm.Evm64.DivMod.AddrNorm
(jpred_1 jpred_2 jpred_3 slt_jpos_1 slt_jpos_2 slt_jpos_3)
+/-- Loop body n=1, max path, j>0 over `divCode_noNop_v4`, requiring the
+ double-addback progress fact only when the addback branch is taken. -/
+theorem divK_loop_body_n1_max_jgt0_exact_loopIter_v4... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1fe3ec20d5ce_1 | df3a4d99db8a18d7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V4NoNopLoopBodyConditional.lean | FullPathN1V4NoNopLoopBodyConditional | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 3 | [
{
"theorem_name": "divK_loop_n1_iter10_maxmax_exact_x1_v4_noNop_selected_carry_if_borrow",
"depth": 1,
"n_commands": 0,
"n_lines": 60,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let u_base_1 := sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec ... | [
{
"name": "divK_loop_body_n1_max_jgt0_exact_loopIter_v4_noNop_if_borrow",
"text": "/-- Loop body n=1, max path, j>0 over `divCode_noNop_v4`, requiring the\n double-addback progress fact only when the addback branch is taken. -/\ntheorem divK_loop_body_n1_max_jgt0_exact_loopIter_v4_noNop_if_borrow (j sp b... | [
{
"name": "divK_loop_n1_iter210_maxmaxmax_exact_x1_v4_noNop_selected_carry_if_borrow",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 106,
"n_chars": 5768,
"n_subproofs": 6,
"n_tactics": 57,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 8,
"n_... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopLoopBodyConditional
Conditional-carry wrappers for the n=1 v4/no-NOP full DIV loop body.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopLoopBody
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopLoopBodyConditional
Conditional-carry wrappers for the n=1 v4/no-NOP full DIV loop body.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopLoopBody
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se... | @@ -15,6 +15,82 @@
open EvmAsm.Evm64.DivMod.AddrNorm
(jpred_1 jpred_2 jpred_3 slt_jpos_1 slt_jpos_2 slt_jpos_3)
+/-- Loop body n=1, max path, j>0 over `divCode_noNop_v4`, requiring the
+ double-addback progress fact only when the addback branch is taken. -/
+theorem divK_loop_body_n1_max_jgt0_exact_loopIter_v4... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1fe3ec20d5ce_2 | c8bc7626cb218a2c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V4NoNopLoopBodyConditional.lean | FullPathN1V4NoNopLoopBodyConditional | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 3 | [
{
"theorem_name": "divK_loop_n1_iter10_maxmax_exact_x1_v4_noNop_selected_carry_if_borrow",
"depth": 1,
"n_commands": 0,
"n_lines": 60,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let u_base_1 := sp + signExtend12 4056 - (1 : Word) <<< (3 : BitVec ... | [
{
"name": "divK_loop_body_n1_max_jgt0_exact_loopIter_v4_noNop_if_borrow",
"text": "/-- Loop body n=1, max path, j>0 over `divCode_noNop_v4`, requiring the\n double-addback progress fact only when the addback branch is taken. -/\ntheorem divK_loop_body_n1_max_jgt0_exact_loopIter_v4_noNop_if_borrow (j sp b... | [
{
"name": "divK_loop_n1_maxmaxmaxmax_exact_x1_v4_noNop_selected_carry_if_borrow",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 222,
"n_chars": 12262,
"n_subproofs": 6,
"n_tactics": 65,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 8,
"n_stru... | 4 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopLoopBodyConditional
Conditional-carry wrappers for the n=1 v4/no-NOP full DIV loop body.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopLoopBody
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopLoopBodyConditional
Conditional-carry wrappers for the n=1 v4/no-NOP full DIV loop body.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopLoopBody
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se... | @@ -15,6 +15,82 @@
open EvmAsm.Evm64.DivMod.AddrNorm
(jpred_1 jpred_2 jpred_3 slt_jpos_1 slt_jpos_2 slt_jpos_3)
+/-- Loop body n=1, max path, j>0 over `divCode_noNop_v4`, requiring the
+ double-addback progress fact only when the addback branch is taken. -/
+theorem divK_loop_body_n1_max_jgt0_exact_loopIter_v4... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4ef959057385_0 | 4449e7bda477cc29 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2LoopUnified.lean | FullPathN2LoopUnified | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_div_n2_preloop_loop_unified_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 60,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- 1. Pre-loop: base → base+448\n have hPre := evm_div_n2_to_loopSetup_spec_within sp base\n a0 a... | [
{
"name": "evm_div_n2_loop_unified_inst",
"text": "/-- Helper: instantiate unified n=2 loop (double-addback) with explicit normalized values.\n Separates the loop application from the composition for heartbeat budgeting.\n\n Legacy compatibility surface: this still consumes the raw `Carry2NzAll`\n ... | [
{
"name": "evm_div_n2_preloop_loop_unified_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 108,
"n_chars": 6261,
"n_subproofs": 5,
"n_tactics": 53,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 1,
"automation_only"... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2LoopUnified
Bool-parameterized unified preloop+loop composition for n=2.
Issue #262: Single theorem covers all 8 path combinations at the
preloop+loop level (base → base+904).
Directly composes:
- Preloop: evm_div_n2_to_loopSetup_spec_within (base → base+448)
- L... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2LoopUnified
Bool-parameterized unified preloop+loop composition for n=2.
Issue #262: Single theorem covers all 8 path combinations at the
preloop+loop level (base → base+904).
Directly composes:
- Preloop: evm_div_n2_to_loopSetup_spec_within (base → base+448)
- L... | @@ -110,6 +110,44 @@
-- Double-addback loop instantiation helper (heartbeat isolation)
-- ============================================================================
+/-- Helper: instantiate unified n=2 loop (double-addback) with explicit normalized values.
+ Separates the loop application from the composition ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4ef959057385_1 | 74320189e9bfee64 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2LoopUnified.lean | FullPathN2LoopUnified | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_div_n2_preloop_loop_unified_spec_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 60,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- 1. Pre-loop: base → base+448\n have hPre := evm_div_n2_to_loopSetup_spec_within_noNop sp ba... | [
{
"name": "evm_div_n2_loop_unified_inst_noNop",
"text": "/-- Helper: instantiate unified n=2 loop (double-addback) over `divCode_noNop`.\n\n Legacy compatibility surface: this still consumes the raw `Carry2NzAll`\n package. New v4 n=2 work should route through selected carry evidence. -/\ntheorem evm_... | [
{
"name": "evm_div_n2_preloop_loop_unified_spec_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 105,
"n_chars": 6092,
"n_subproofs": 5,
"n_tactics": 53,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 1,
"automation... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2LoopUnified
Bool-parameterized unified preloop+loop composition for n=2.
Issue #262: Single theorem covers all 8 path combinations at the
preloop+loop level (base → base+904).
Directly composes:
- Preloop: evm_div_n2_to_loopSetup_spec_within (base → base+448)
- L... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2LoopUnified
Bool-parameterized unified preloop+loop composition for n=2.
Issue #262: Single theorem covers all 8 path combinations at the
preloop+loop level (base → base+904).
Directly composes:
- Preloop: evm_div_n2_to_loopSetup_spec_within (base → base+448)
- L... | @@ -110,6 +110,47 @@
-- Double-addback loop instantiation helper (heartbeat isolation)
-- ============================================================================
+/-- Helper: instantiate unified n=2 loop (double-addback) over `divCode_noNop`.
+
+ Legacy compatibility surface: this still consumes the raw `Ca... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2d809b4166b2_0 | 5409215fd0e50fd1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitLoopBodyFromLoopPost.lean | SavedBitLoopBodyFromLoopPost | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "exp_loop_from_looppost_full_body_general_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [show expTwoMulFullLoopBodyBound = 256 * 189 from\n expTwoMulIterationsBodyBound... | [
{
"name": "word256_ne_zero",
"text": "/-- `(256 : Word) ≠ 0`. -/\nprivate theorem word256_ne_zero : (256 : Word) ≠ 0 := by decide\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 96,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_stru... | [
{
"name": "exp_loop_from_looppost_full_body_general_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 39,
"n_chars": 2057,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"au... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBodyFromLoopPost
Concrete 256-iteration instantiation of the abstract loop-body induction
`exp_loop_from_looppost_induction_general`.
This wraps the abstract `n`-step induction at `n = 256`, producing a body
spec at the named `expTwoMulFullLoopBodyBound` step count. ... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitLoopBodyFromLoopPost
Concrete 256-iteration instantiation of the abstract loop-body induction
`exp_loop_from_looppost_induction_general`.
This wraps the abstract `n`-step induction at `n = 256`, producing a body
spec at the named `expTwoMulFullLoopBodyBound` step count. ... | @@ -23,6 +23,9 @@
open EvmAsm.Rv64
+/-- `(256 : Word) ≠ 0`. -/
+private theorem word256_ne_zero : (256 : Word) ≠ 0 := by decide
+
/-- `(256 : Word).toNat = 256`. -/
private theorem word256_toNat : (256 : Word).toNat = 256 := by decide
@@ -54,7 +57,15 @@
(expTwoMulIterLoopPost (256 : Word) bit sp evmSp 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_a186ccecee3d_0 | 7d698d657269bbd0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN3V5FamiliesMod.lean | FullPathN3V5FamiliesMod | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_mod_n3_denorm_epilogue_bundled_spec_noNop_v5Final_exact_x1_frame",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hDenorm := evm_mod_n3_denorm_epilogue_bundled_spec_noNop_v5Final... | [
{
"name": "evm_mod_n3_denorm_epilogue_bundled_spec_noNop_v5Final",
"text": "/-- v5 MOD n=3 denorm + epilogue (denormOff → nopOff): the SHARED DIV denorm pre\n drives the MOD epilogue (loads the denormalized remainder), yielding the MOD\n denorm post. Mirror of `evm_mod_n2_denorm_epilogue_bundled_spec... | [
{
"name": "evm_mod_n3_denorm_epilogue_bundled_spec_noNop_v5Final_exact_x1_frame",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 36,
"n_chars": 1657,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_struct... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5FamiliesMod
v5 MOD n=3 denorm + epilogue bundle (denormOff → nopOff), over `modCode_noNop_v5`.
The MOD mirror of the DIV n=3 denorm-epilogue families (`FullPathN3V5NoNopDenormDefs`):
it shares the DIV denorm PRE (`fullDivN3DenormPreV5`) and the loop frame
(`fullDivN... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5FamiliesMod
v5 MOD n=3 denorm + epilogue bundle (denormOff → nopOff), over `modCode_noNop_v5`.
The MOD mirror of the DIV n=3 denorm-epilogue families (`FullPathN3V5NoNopDenormDefs`):
it shares the DIV denorm PRE (`fullDivN3DenormPreV5`) and the loop frame
(`fullDivN... | @@ -46,6 +46,43 @@
((sp + signExtend12 3936) ↦ₘ
fullDivN3ScratchMemV5 bltu_1 bltu_0 a0 a1 a2 a3 b0 b1 b2 b3 scratchMem)
+/-- v5 MOD n=3 denorm + epilogue (denormOff → nopOff): the SHARED DIV denorm pre
+ drives the MOD epilogue (loads the denormalized remainder), yielding the MOD
+ denorm post. Mirror ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4f9350709c64_0 | c5bf7e2fbd813164 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2V5Shift0Quotient.lean | N2V5Shift0Quotient | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "n2_shift0_quotient_word_eq_div",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h0 : (0:Word).toNat = 0 := rfl\n have hbnz : b0 ||| b1 ||| (0:Word) ||| 0 ≠ 0 := by\n intro h; hav... | [
{
"name": "n2_shift0_acc_quot",
"text": "/-- **v5 n=2 accumulated quotient correctness (shift=0).** The three v5 n=2\n digits over the raw 2-limb divisor combine to `val256 a / val256 b`. -/\ntheorem n2_shift0_acc_quot\n (a0 a1 a2 a3 b0 b1 : Word) (hb1 : b1.toNat ≥ 2^63) (bltu_2 bltu_1 bltu_0 : Bool)\... | [
{
"name": "n2_shift0_quotient_word_eq_div",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 33,
"n_chars": 2868,
"n_subproofs": 7,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N2V5Shift0Quotient
**v5 n=2 accumulated quotient correctness for the shift=0 path.**
When the divisor's top limb `b1` is already normalized (`b1 ≥ 2^63`, i.e.
`clz b1 = 0`), the algorithm skips normalization and runs the schoolbook
directly on the RAW divisor `(b0,b1,0,0)` and the... | /-
EvmAsm.Evm64.DivMod.Spec.N2V5Shift0Quotient
**v5 n=2 accumulated quotient correctness for the shift=0 path.**
When the divisor's top limb `b1` is already normalized (`b1 ≥ 2^63`, i.e.
`clz b1 = 0`), the algorithm skips normalization and runs the schoolbook
directly on the RAW divisor `(b0,b1,0,0)` and the... | @@ -22,6 +22,52 @@
open EvmWord EvmAsm.Rv64
+/-- **v5 n=2 accumulated quotient correctness (shift=0).** The three v5 n=2
+ digits over the raw 2-limb divisor combine to `val256 a / val256 b`. -/
+theorem n2_shift0_acc_quot
+ (a0 a1 a2 a3 b0 b1 : Word) (hb1 : b1.toNat ≥ 2^63) (bltu_2 bltu_1 bltu_0 : Bool)
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ba96813f4257_0 | eac2d42cc4d10c2f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutColumn6Target.lean | ProductLayoutColumn6Target | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 70 | 1 | [
{
"theorem_name": "mulModProductLayoutLowPartBound5ForLimb6",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_bound0 : d0 % w ≤ w - 1 := by\n omega\n have h_bound1 : d1c1 % w * w ≤ (w - 1) * w :=\... | [
{
"name": "mulModProductLayoutGeoSeriesIdentity5ForLimb6",
"text": "private theorem mulModProductLayoutGeoSeriesIdentity5ForLimb6 (w : Nat) (h_w : 0 < w) :\n (w - 1) + (w - 1) * w + (w - 1) * w ^ 2 + (w - 1) * w ^ 3 +\n (w - 1) * w ^ 4 + 1 = w ^ 5 := by\n obtain ⟨n, rfl⟩ : ∃ n, w = n + 1 := ⟨w - ... | [
{
"name": "mulModProductLayoutLowPartBound5ForLimb6",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 904,
"n_subproofs": 6,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 0,
"n_structural": 0,
"automation_onl... | 1 | import EvmAsm.Evm64.MulMod.ProductLayoutColumn5Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutLowPartBound5ForLimb6
(d0 d1c1 d2c2 d3c3 d4c4 w : Nat) (h_w : 0 < w)
(h0 : d0 % w < w) (h1 : d1c1 % w < w) (h2 : d2c2 % w < w)
(h3 : d3c... | import EvmAsm.Evm64.MulMod.ProductLayoutColumn5Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutGeoSeriesIdentity5ForLimb6 (w : Nat) (h_w : 0 < w) :
(w - 1) + (w - 1) * w + (w - 1) * w ^ 2 + (w - 1) * w ^ 3 +
(w - 1) * w ^ 4 + 1 = w... | @@ -5,12 +5,31 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
+private theorem mulModProductLayoutGeoSeriesIdentity5ForLimb6 (w : Nat) (h_w : 0 < w) :
+ (w - 1) + (w - 1) * w + (w - 1) * w ^ 2 + (w - 1) * w ^ 3 +
+ (w - 1) * w ^ 4 + 1 = w ^ 5 := by
+ obtain ⟨n, rfl⟩ : ∃ n, w = n + 1 := ⟨w - ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ba96813f4257_1 | 215b50d87f4c7c6f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutColumn6Target.lean | ProductLayoutColumn6Target | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 70 | 1 | [
{
"theorem_name": "mulModProductLayoutSchoolbookLimb6",
"depth": 1,
"n_commands": 0,
"n_lines": 73,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n dsimp only\n set w := (2 : Nat) ^ 64\n have h128 : (2 : Nat) ^ 128 = w ^ 2 := by\n norm_num [w]\n ... | [
{
"name": "mulModProductLayoutProductExpansion5ForLimb6",
"text": "private theorem mulModProductLayoutProductExpansion5ForLimb6\n (a0 a1 a2 a3 b0 b1 b2 b3 w : Nat) :\n (a0 + a1 * w + a2 * w ^ 2 + a3 * w ^ 3) *\n (b0 + b1 * w + b2 * w ^ 2 + b3 * w ^ 3) =\n a0 * b0 + (a0 * b1 + a1 * b0) * w ... | [
{
"name": "mulModProductLayoutSchoolbookLimb6",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 96,
"n_chars": 3443,
"n_subproofs": 10,
"n_tactics": 73,
"cyclomatic": 1,
"n_automation": 9,
"n_rewrites": 11,
"n_structural": 1,
"automation_only":... | 4 | import EvmAsm.Evm64.MulMod.ProductLayoutColumn5Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCarryTelescoping5ForLimb6
(d0 d1 d2 d3 d4 c1 c2 c3 c4 c5 w : Nat)
(h0 : w * c1 + d0 % w = d0)
(h1 : w * c2 + (d1 + c1) % w = d1 + c1)
... | import EvmAsm.Evm64.MulMod.ProductLayoutColumn5Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCarryTelescoping5ForLimb6
(d0 d1 d2 d3 d4 c1 c2 c3 c4 c5 w : Nat)
(h0 : w * c1 + d0 % w = d0)
(h1 : w * c2 + (d1 + c1) % w = d1 + c1)
... | @@ -82,6 +82,17 @@
have h_geo := mulModProductLayoutGeoSeriesIdentity5ForLimb6 w h_w
linarith [h_bound0, h_bound1, h_bound2, h_bound3, h_bound4, h_geo]
+private theorem mulModProductLayoutProductExpansion5ForLimb6
+ (a0 a1 a2 a3 b0 b1 b2 b3 w : Nat) :
+ (a0 + a1 * w + a2 * w ^ 2 + a3 * w ^ 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_ba96813f4257_2 | 14967afbc2ce0f9f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutColumn6Target.lean | ProductLayoutColumn6Target | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 70 | 2 | [
{
"theorem_name": "mulModProductLayoutCall00P136_zero_forColumn6",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mulModProductLayoutCall00P136 mulModCarryStepValue\n rw [mulModProductLayoutCall00Car... | [
{
"name": "mulModProductLayoutCall00Carry128_zero_forColumn6",
"text": "private theorem mulModProductLayoutCall00Carry128_zero_forColumn6 (a b : EvmWord) :\n mulModProductLayoutCall00Carry128 a b = 0 := by\n unfold mulModProductLayoutCall00Carry128\n rw [mulModProductLayoutCall00Carry120_zero]\n exact... | [
{
"name": "mulModProductLayoutCall00P136_zero_forColumn6",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 252,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_... | 1 | import EvmAsm.Evm64.MulMod.ProductLayoutColumn5Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00P136_zero_forColumn6 (a b : EvmWord) :
mulModProductLayoutCall00P136 a b = 0 := sorry
/-- The finalized product-layout column-six cell at... | import EvmAsm.Evm64.MulMod.ProductLayoutColumn5Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00Carry128_zero_forColumn6 (a b : EvmWord) :
mulModProductLayoutCall00Carry128 a b = 0 := by
unfold mulModProductLayoutCall00Carry128
rw... | @@ -5,8 +5,17 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
+private theorem mulModProductLayoutCall00Carry128_zero_forColumn6 (a b : EvmWord) :
+ mulModProductLayoutCall00Carry128 a b = 0 := by
+ unfold mulModProductLayoutCall00Carry128
+ rw [mulModProductLayoutCall00Carry120_zero]
+ exact mulM... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ba96813f4257_3 | 438b2dffbb405c89 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutColumn6Target.lean | ProductLayoutColumn6Target | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 70 | 2 | [
{
"theorem_name": "mulModProductLayoutCall00P136_zero_forColumn6",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mulModProductLayoutCall00P136 mulModCarryStepValue\n rw [mulModProductLayoutCall00Car... | [
{
"name": "mulModProductLayoutCall00Carry128_zero_forColumn6",
"text": "private theorem mulModProductLayoutCall00Carry128_zero_forColumn6 (a b : EvmWord) :\n mulModProductLayoutCall00Carry128 a b = 0 := by\n unfold mulModProductLayoutCall00Carry128\n rw [mulModProductLayoutCall00Carry120_zero]\n exact... | [
{
"name": "mulModProductLayoutCall00Carry136_zero_forColumn6",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 276,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automat... | 1 | import EvmAsm.Evm64.MulMod.ProductLayoutColumn5Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00Carry136_zero_forColumn6 (a b : EvmWord) :
mulModProductLayoutCall00Carry136 a b = 0 := sorry
/-- The finalized product-layout column-six... | import EvmAsm.Evm64.MulMod.ProductLayoutColumn5Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00Carry128_zero_forColumn6 (a b : EvmWord) :
mulModProductLayoutCall00Carry128 a b = 0 := by
unfold mulModProductLayoutCall00Carry128
rw... | @@ -5,8 +5,17 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
+private theorem mulModProductLayoutCall00Carry128_zero_forColumn6 (a b : EvmWord) :
+ mulModProductLayoutCall00Carry128 a b = 0 := by
+ unfold mulModProductLayoutCall00Carry128
+ rw [mulModProductLayoutCall00Carry120_zero]
+ exact mulM... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ba96813f4257_4 | e432c91605fe6519 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutColumn6Target.lean | ProductLayoutColumn6Target | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 70 | 1 | [
{
"theorem_name": "mulModProductLayoutCall00P144_zero_forColumn6",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mulModProductLayoutCall00P144 mulModCarryStepValue\n rw [mulModProductLayoutCall00Car... | [
{
"name": "mulModProductLayoutCall00Carry136_zero_forColumn6",
"text": "private theorem mulModProductLayoutCall00Carry136_zero_forColumn6 (a b : EvmWord) :\n mulModProductLayoutCall00Carry136 a b = 0 := by\n unfold mulModProductLayoutCall00Carry136\n rw [mulModProductLayoutCall00Carry128_zero_forColumn... | [
{
"name": "mulModProductLayoutCall00P144_zero_forColumn6",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 252,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_... | 2 | import EvmAsm.Evm64.MulMod.ProductLayoutColumn5Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00Carry128_zero_forColumn6 (a b : EvmWord) :
mulModProductLayoutCall00Carry128 a b = 0 := by
unfold mulModProductLayoutCall00Carry128
rw... | import EvmAsm.Evm64.MulMod.ProductLayoutColumn5Target
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
private theorem mulModProductLayoutCall00Carry128_zero_forColumn6 (a b : EvmWord) :
mulModProductLayoutCall00Carry128 a b = 0 := by
unfold mulModProductLayoutCall00Carry128
rw... | @@ -11,8 +11,17 @@
rw [mulModProductLayoutCall00Carry120_zero]
exact mulModCarryStepCarry_zero_zero
+private theorem mulModProductLayoutCall00Carry136_zero_forColumn6 (a b : EvmWord) :
+ mulModProductLayoutCall00Carry136 a b = 0 := by
+ unfold mulModProductLayoutCall00Carry136
+ rw [mulModProductLayoutCall... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "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.