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_1bce24d33254_1 | 0859a21b5c762531 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bls12G1Copy96SAsm.lean | Bls12G1Copy96SAsm | 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": "ld_romiss",
"text": "private theorem ld_romiss (reg : Region) (rwb : Word) (rf : RegFile)\n (ws : List (BitVec 8)) (rd rs1 : Reg) (ofs : BitVec 12)\n (h : ¬ inRw rwb ws (rf.get rs1 + signExtend12 ofs) 8) :\n execInstrRF reg rwb rf ws (.LD rd rs1 ofs)\n = (rf.set rd (reg.dwordAt (rf.... | [
{
"name": "copy_blockVCs",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 46,
"n_chars": 2038,
"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.Bls12G1Copy96SAsm
Verified SAsm port of `blsg_copy96`: copy the 96-byte BLS12-381 G1 buffer from
`a0` to the writable destination at `a1`. The emitted routine is a
bottom-test dword loop over 12 limbs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
import Evm... | /-
EvmAsm.Codegen.Programs.Bls12G1Copy96SAsm
Verified SAsm port of `blsg_copy96`: copy the 96-byte BLS12-381 G1 buffer from
`a0` to the writable destination at `a1`. The emitted routine is a
bottom-test dword loop over 12 limbs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
import Evm... | @@ -37,6 +37,15 @@
let r3 := r2.set .x11 (r2.get .x11 + signExtend12 (8 : BitVec 12))
r3.set .x5 (r3.get .x5 + signExtend12 (-1 : BitVec 12))
+private theorem ld_romiss (reg : Region) (rwb : Word) (rf : RegFile)
+ (ws : List (BitVec 8)) (rd rs1 : Reg) (ofs : BitVec 12)
+ (h : ¬ inRw rwb ws (rf.get rs1 + s... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1bce24d33254_2 | 762d7b25b966fc22 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bls12G1Copy96SAsm.lean | Bls12G1Copy96SAsm | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "blsgCopy96Fn_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 88,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbase : (blsgCopy96Fn src dst srcBytes orig).rw.base = dst := rfl\n vcgen\n case region => exact ⟨hwf, hrww⟩\n c... | [
{
"name": "copyStepRf_get_x10",
"text": "theorem copyStepRf_get_x10 (rf : RegFile) (v : Word) :\n (copyStepRf rf v).get .x10 = rf.get .x10 + signExtend12 (8 : BitVec 12) := by\n unfold copyStepRf\n simp only [RegFile.get_set_self, RegFile.get_set_ne, ne_eq, reduceCtorEq, not_false_eq_true]\n\n",
"f... | [
{
"name": "blsgCopy96Fn_spec",
"fan_in": 0,
"n_deps_direct": 9,
"n_deps_transitive": 12,
"n_lines": 92,
"n_chars": 4816,
"n_subproofs": 8,
"n_tactics": 90,
"cyclomatic": 14,
"n_automation": 48,
"n_rewrites": 24,
"n_structural": 22,
"automation_only": false,
"m... | 12 | /-
EvmAsm.Codegen.Programs.Bls12G1Copy96SAsm
Verified SAsm port of `blsg_copy96`: copy the 96-byte BLS12-381 G1 buffer from
`a0` to the writable destination at `a1`. The emitted routine is a
bottom-test dword loop over 12 limbs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
import Evm... | /-
EvmAsm.Codegen.Programs.Bls12G1Copy96SAsm
Verified SAsm port of `blsg_copy96`: copy the 96-byte BLS12-381 G1 buffer from
`a0` to the writable destination at `a1`. The emitted routine is a
bottom-test dword loop over 12 limbs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
import Evm... | @@ -100,6 +100,11 @@
let r3 := r2.set .x11 (r2.get .x11 + signExtend12 (8 : BitVec 12))
r3.set .x5 (r3.get .x5 + signExtend12 (-1 : BitVec 12))
+theorem copyStepRf_get_x10 (rf : RegFile) (v : Word) :
+ (copyStepRf rf v).get .x10 = rf.get .x10 + signExtend12 (8 : BitVec 12) := by
+ unfold copyStepRf
+ simp ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cf1f48bd2c0a_0 | dc38ad5fcf1ef553 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutCall07.lean | ProductLayoutCall07 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_mulmod_product_layout_call07_code_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n CodeReq.union_sub (evm_mulmod_product_layout_call07_core_code_sub base)\n (by\n intro a i h\... | [
{
"name": "evm_mulmod_product_layout_call07_carry_code_sub",
"text": "/-- Carry-propagation code for layout call 07 is contained in `evm_mulmod_product_layout`. -/\ntheorem evm_mulmod_product_layout_call07_carry_code_sub (base : Word) :\n ∀ a i, (evm_mulmod_product_propagate_carry_code (base + 1008) [397... | [
{
"name": "evm_mulmod_product_layout_call07_code_sub",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 716,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 3,
"automation_onl... | 2 | /-
EvmAsm.Evm64.MulMod.ProductLayoutCall07
Product-layout call07 suffix composition for MULMOD.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall06
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
local macro "evm_mulmod_product_layout_slice_rfl" : tactic =>
`(tactic|
first
| rfl
... | /-
EvmAsm.Evm64.MulMod.ProductLayoutCall07
Product-layout call07 suffix composition for MULMOD.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall06
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
local macro "evm_mulmod_product_layout_slice_rfl" : tactic =>
`(tactic|
first
| rfl
... | @@ -35,12 +35,31 @@
· rw [evm_mulmod_product_layout_length]
decide
+/-- Carry-propagation code for layout call 07 is contained in `evm_mulmod_product_layout`. -/
+theorem evm_mulmod_product_layout_call07_carry_code_sub (base : Word) :
+ ∀ a i, (evm_mulmod_product_propagate_carry_code (base + 1008) [3976, 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_71703b1f592a_0 | b4b1cace8da7a630 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Proofs/BlobHashGuardedHandlerSpec.lean | BlobHashGuardedHandlerSpec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 3 | [
{
"theorem_name": "laX15_body_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 72,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- The la pair: AUIPC x15 at hbase+40, ADDI x15 at hbase+44; x15g → tblAddr.\n have s1 := auipc_spec_within .x15 x... | [
{
"name": "laX15_body_length",
"text": "/-- Length of the inline `la x15 ;; body` combined program (2 + 24 = 26). -/\ntheorem laX15_body_length (hi3 : BitVec 20) (lo3 : BitVec 12) :\n (laX15Prog hi3 lo3 ;; evm_blobhash .x20 .x15 .x14 .x16 .x17).length = 26 := by\n show (laX15Prog hi3 lo3 ++ evm_blobhash... | [
{
"name": "laX15_body_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 111,
"n_chars": 6312,
"n_subproofs": 15,
"n_tactics": 68,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 14,
"n_structural": 8,
"automation_only": false,
... | 1 | /-
EvmAsm.Codegen.Proofs.BlobHashGuardedHandlerSpec
Handler-glue proof for `h_BLOBHASH` (opcode 0x49, EIP-4844), closing the
DRIFT.md "codegen is unverified by design" surface for this opcode. This is
the direct BLOBHASH analogue of #9904's CALLDATALOAD glue proof
(`CalldataLoadGuardedHandlerSpec.lean`).
... | /-
EvmAsm.Codegen.Proofs.BlobHashGuardedHandlerSpec
Handler-glue proof for `h_BLOBHASH` (opcode 0x49, EIP-4844), closing the
DRIFT.md "codegen is unverified by design" surface for this opcode. This is
the direct BLOBHASH analogue of #9904's CALLDATALOAD glue proof
(`CalldataLoadGuardedHandlerSpec.lean`).
... | @@ -76,6 +76,16 @@
@[simp] theorem laX15Prog_length (hi3 : BitVec 20) (lo3 : BitVec 12) :
(laX15Prog hi3 lo3).length = 2 := rfl
+/-- Length of the inline `la x15 ;; body` combined program (2 + 24 = 26). -/
+theorem laX15_body_length (hi3 : BitVec 20) (lo3 : BitVec 12) :
+ (laX15Prog hi3 lo3 ;; evm_blobhash .... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_71703b1f592a_1 | 813799a5f5f117f5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Proofs/BlobHashGuardedHandlerSpec.lean | BlobHashGuardedHandlerSpec | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 3 | [
{
"theorem_name": "laX15_body_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 72,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- The la pair: AUIPC x15 at hbase+40, ADDI x15 at hbase+44; x15g → tblAddr.\n have s1 := auipc_spec_within .x15 x... | [
{
"name": "laX15_body_length",
"text": "/-- Length of the inline `la x15 ;; body` combined program (2 + 24 = 26). -/\ntheorem laX15_body_length (hi3 : BitVec 20) (lo3 : BitVec 12) :\n (laX15Prog hi3 lo3 ;; evm_blobhash .x20 .x15 .x14 .x16 .x17).length = 26 := by\n show (laX15Prog hi3 lo3 ++ evm_blobhash... | [
{
"name": "evm_blobhash_guarded_handler_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 88,
"n_chars": 5388,
"n_subproofs": 2,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": fa... | 2 | /-
EvmAsm.Codegen.Proofs.BlobHashGuardedHandlerSpec
Handler-glue proof for `h_BLOBHASH` (opcode 0x49, EIP-4844), closing the
DRIFT.md "codegen is unverified by design" surface for this opcode. This is
the direct BLOBHASH analogue of #9904's CALLDATALOAD glue proof
(`CalldataLoadGuardedHandlerSpec.lean`).
... | /-
EvmAsm.Codegen.Proofs.BlobHashGuardedHandlerSpec
Handler-glue proof for `h_BLOBHASH` (opcode 0x49, EIP-4844), closing the
DRIFT.md "codegen is unverified by design" surface for this opcode. This is
the direct BLOBHASH analogue of #9904's CALLDATALOAD glue proof
(`CalldataLoadGuardedHandlerSpec.lean`).
... | @@ -76,6 +76,16 @@
@[simp] theorem laX15Prog_length (hi3 : BitVec 20) (lo3 : BitVec 12) :
(laX15Prog hi3 lo3).length = 2 := rfl
+/-- Length of the inline `la x15 ;; body` combined program (2 + 24 = 26). -/
+theorem laX15_body_length (hi3 : BitVec 20) (lo3 : BitVec 12) :
+ (laX15Prog hi3 lo3 ;; evm_blobhash .... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_81eb47a55e54_0 | 1586c72135986b61 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DivN4DoubleAddbackVal256.lean | DivN4DoubleAddbackVal256 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "iterDoubleAddback_val256_conservation_gen",
"depth": 1,
"n_commands": 0,
"n_lines": 50,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Abbreviate the mulsub result and the first addback.\n set ms := mulsubN4 q v0 v1 v2 v3 u0 u1... | [
{
"name": "double_addback_conservation_arith",
"text": "/-- Pure-`Nat` arithmetic core of the double-addback conservation (`2^256` kept as\n a variable `W` to keep `omega` away from large-literal recursion-depth). -/\nprivate theorem double_addback_conservation_arith\n (A U MR B AB AB' QV W : Nat)\n ... | [
{
"name": "iterDoubleAddback_val256_conservation_gen",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 227,
"n_chars": 12678,
"n_subproofs": 11,
"n_tactics": 45,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 11,
"n_structural": 1,
"automati... | 1 | /-
EvmAsm.Evm64.EvmWordArith.DivN4DoubleAddbackVal256
U4-general double-addback value conservation for the n=4 double-addback iterate.
The carry=0 branch of `iterWithDoubleAddback` performs TWO corrective addbacks,
emitting quotient `qHat - 2` (= `qHat + signExtend12 4095 + signExtend12 4095`)
and the secon... | /-
EvmAsm.Evm64.EvmWordArith.DivN4DoubleAddbackVal256
U4-general double-addback value conservation for the n=4 double-addback iterate.
The carry=0 branch of `iterWithDoubleAddback` performs TWO corrective addbacks,
emitting quotient `qHat - 2` (= `qHat + signExtend12 4095 + signExtend12 4095`)
and the secon... | @@ -30,6 +30,18 @@
open EvmWord EvmAsm.Rv64
+/-- Pure-`Nat` arithmetic core of the double-addback conservation (`2^256` kept as
+ a variable `W` to keep `omega` away from large-literal recursion-depth). -/
+private theorem double_addback_conservation_arith
+ (A U MR B AB AB' QV W : Nat)
+ (hms : A + (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_4d4c2bd4fcce_0 | 373b8009bfc6eb1a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/ModFullPathN3.lean | ModFullPathN3 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_mod_n3_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 b2).1\n let antiShift := signExtend12 (0 : BitVec 12) - shift\n let b3' := ... | [
{
"name": "evm_mod_phaseAB_n3_clz_spec_within",
"text": "/-- MOD PhaseAB(n=3) + CLZ: b≠0, b[3]=0, b[2]≠0.\n base → base+212. CLZ on b2, x6 = shift = clzResult(b2).1. -/\ntheorem evm_mod_phaseAB_n3_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 : Wo... | [
{
"name": "evm_mod_n3_to_loopSetup_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 137,
"n_chars": 8276,
"n_subproofs": 14,
"n_tactics": 107,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 1,
"automation_only... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.ModFullPathN3
MOD full path compositions for b[3]=0, b[2]≠0 (n=3) case.
MOD mirrors of FullPathN3.lean with modCode.
-/
import EvmAsm.Evm64.DivMod.Compose.Epilogue
import EvmAsm.Evm64.DivMod.Compose.ModPhaseBn3
import EvmAsm.Evm64.DivMod.Compose.ModCLZ
import EvmAsm.Evm64.DivMod.C... | /-
EvmAsm.Evm64.DivMod.Compose.ModFullPathN3
MOD full path compositions for b[3]=0, b[2]≠0 (n=3) case.
MOD mirrors of FullPathN3.lean with modCode.
-/
import EvmAsm.Evm64.DivMod.Compose.Epilogue
import EvmAsm.Evm64.DivMod.Compose.ModPhaseBn3
import EvmAsm.Evm64.DivMod.Compose.ModCLZ
import EvmAsm.Evm64.DivMod.C... | @@ -22,6 +22,70 @@
-- Phase A(ntaken) + Phase B(n=3) + CLZ: base → base+212
-- ============================================================================
+/-- MOD PhaseAB(n=3) + CLZ: b≠0, b[3]=0, b[2]≠0.
+ base → base+212. CLZ on b2, x6 = shift = clzResult(b2).1. -/
+theorem evm_mod_phaseAB_n3_clz_spec_within ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5b1d4ed3d52a_0 | 48e6580a9c45b53e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/AbiFrame.lean | AbiFrame | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "storeSeq_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 54,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction frame generalizing startAddr with\n | nil =>\n simp only [List.length_nil, Nat.mul_zero, storeProg_nil, CodeRe... | [
{
"name": "add_ofNat_add_ofNat",
"text": "/-- Fold two `ofNat` offsets from the same base into one (pure wrap-around\n BitVec arithmetic — no overflow side condition). -/\nprivate theorem add_ofNat_add_ofNat (b : Word) (i j : Nat) :\n (b + BitVec.ofNat 64 i) + BitVec.ofNat 64 j = b + BitVec.ofNat 64 (... | [
{
"name": "storeSeq_spec",
"fan_in": 1,
"n_deps_direct": 13,
"n_deps_transitive": 13,
"n_lines": 70,
"n_chars": 3789,
"n_subproofs": 15,
"n_tactics": 52,
"cyclomatic": 2,
"n_automation": 9,
"n_rewrites": 8,
"n_structural": 7,
"automation_only": false,
"max_nes... | 4 | /-
EvmAsm.Rv64.SAsm.AbiFrame
ABI stack-frame support for SAsm (bead evm-asm-4ch8f.76, extending .3).
Bead .3 modelled frames as *static* stack-arena windows and deliberately
deferred the guest's *dynamic* C-ABI leaf frames — the `addi sp, sp, -N`
prologue that saves `ra`/callee-saved `s`-registers, uses the... | /-
EvmAsm.Rv64.SAsm.AbiFrame
ABI stack-frame support for SAsm (bead evm-asm-4ch8f.76, extending .3).
Bead .3 modelled frames as *static* stack-arena windows and deliberately
deferred the guest's *dynamic* C-ABI leaf frames — the `addi sp, sp, -N`
prologue that saves `ra`/callee-saved `s`-registers, uses the... | @@ -160,6 +160,16 @@
| nil => intro h hp; rw [hp]; rfl
| cons p rest ih => exact pcFree_sepConj pcFree_memOwn ih
+/-- Fold two `ofNat` offsets from the same base into one (pure wrap-around
+ BitVec arithmetic — no overflow side condition). -/
+private theorem add_ofNat_add_ofNat (b : Word) (i j : Nat) :
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5b1d4ed3d52a_1 | 380ca5050e0f3405 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/AbiFrame.lean | AbiFrame | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "storeSeq_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 54,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction frame generalizing startAddr with\n | nil =>\n simp only [List.length_nil, Nat.mul_zero, storeProg_nil, CodeRe... | [
{
"name": "add_ofNat_add_ofNat",
"text": "/-- Fold two `ofNat` offsets from the same base into one (pure wrap-around\n BitVec arithmetic — no overflow side condition). -/\nprivate theorem add_ofNat_add_ofNat (b : Word) (i j : Nat) :\n (b + BitVec.ofNat 64 i) + BitVec.ofNat 64 j = b + BitVec.ofNat 64 (... | [
{
"name": "loadSeq_spec",
"fan_in": 1,
"n_deps_direct": 11,
"n_deps_transitive": 11,
"n_lines": 72,
"n_chars": 3986,
"n_subproofs": 17,
"n_tactics": 54,
"cyclomatic": 2,
"n_automation": 9,
"n_rewrites": 8,
"n_structural": 7,
"automation_only": false,
"max_nest... | 4 | /-
EvmAsm.Rv64.SAsm.AbiFrame
ABI stack-frame support for SAsm (bead evm-asm-4ch8f.76, extending .3).
Bead .3 modelled frames as *static* stack-arena windows and deliberately
deferred the guest's *dynamic* C-ABI leaf frames — the `addi sp, sp, -N`
prologue that saves `ra`/callee-saved `s`-registers, uses the... | /-
EvmAsm.Rv64.SAsm.AbiFrame
ABI stack-frame support for SAsm (bead evm-asm-4ch8f.76, extending .3).
Bead .3 modelled frames as *static* stack-arena windows and deliberately
deferred the guest's *dynamic* C-ABI leaf frames — the `addi sp, sp, -N`
prologue that saves `ra`/callee-saved `s`-registers, uses the... | @@ -164,6 +164,16 @@
-- Address arithmetic helper
-- ============================================================================
+/-- Fold two `ofNat` offsets from the same base into one (pure wrap-around
+ BitVec arithmetic — no overflow side condition). -/
+private theorem add_ofNat_add_ofNat (b : Word) (i j ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5b1d4ed3d52a_2 | 8f5b1f5807a6c17e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/AbiFrame.lean | AbiFrame | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "storeSeq_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 54,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction frame generalizing startAddr with\n | nil =>\n simp only [List.length_nil, Nat.mul_zero, storeProg_nil, CodeRe... | [
{
"name": "add_ofNat_add_ofNat",
"text": "/-- Fold two `ofNat` offsets from the same base into one (pure wrap-around\n BitVec arithmetic — no overflow side condition). -/\nprivate theorem add_ofNat_add_ofNat (b : Word) (i j : Nat) :\n (b + BitVec.ofNat 64 i) + BitVec.ofNat 64 j = b + BitVec.ofNat 64 (... | [
{
"name": "abiFrame_spec",
"fan_in": 0,
"n_deps_direct": 11,
"n_deps_transitive": 20,
"n_lines": 164,
"n_chars": 9360,
"n_subproofs": 38,
"n_tactics": 104,
"cyclomatic": 1,
"n_automation": 17,
"n_rewrites": 22,
"n_structural": 2,
"automation_only": false,
"max... | 8 | /-
EvmAsm.Rv64.SAsm.AbiFrame
ABI stack-frame support for SAsm (bead evm-asm-4ch8f.76, extending .3).
Bead .3 modelled frames as *static* stack-arena windows and deliberately
deferred the guest's *dynamic* C-ABI leaf frames — the `addi sp, sp, -N`
prologue that saves `ra`/callee-saved `s`-registers, uses the... | /-
EvmAsm.Rv64.SAsm.AbiFrame
ABI stack-frame support for SAsm (bead evm-asm-4ch8f.76, extending .3).
Bead .3 modelled frames as *static* stack-arena windows and deliberately
deferred the guest's *dynamic* C-ABI leaf frames — the `addi sp, sp, -N`
prologue that saves `ra`/callee-saved `s`-registers, uses the... | @@ -170,6 +170,16 @@
-- Address arithmetic helper
-- ============================================================================
+/-- Fold two `ofNat` offsets from the same base into one (pure wrap-around
+ BitVec arithmetic — no overflow side condition). -/
+private theorem add_ofNat_add_ofNat (b : Word) (i j ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_89cbc9dc87c9_0 | 032622d09d767248 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2V5TrialBranch.lean | N2V5TrialBranch | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "div_getLimbN_eq_digit_n2_v5_of_path",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n div_getLimbN_eq_digit_n2_v5_of_conditions bltu_2 bltu_1 bltu_0\n ha0 ha1 ha2 ha3 hb0 hb1 hb2 hb3 hbnz\n... | [
{
"name": "fullDivN2PathConditionsV5_overestimate",
"text": "theorem fullDivN2PathConditionsV5_overestimate\n (bltu_2 bltu_1 bltu_0 : Bool) (a0 a1 a2 a3 b0 b1 b2 b3 : Word)\n (hpath : fullDivN2PathConditionsV5 bltu_2 bltu_1 bltu_0 a0 a1 a2 a3 b0 b1 b2 b3) :\n fullDivN2QuotientOverestimateV5 bltu_2 ... | [
{
"name": "div_getLimbN_eq_digit_n2_v5_of_path",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 1189,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": f... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.N2V5TrialBranch
The v5 n=2 per-digit trial-branch predicates `isTrialN2V5_j{2,1,0}` (each `bltu`
flag = whether the running remainder's top limb is `< v.2.1`, the divisor's top
normalized limb) and the bundled v5 n=2 path predicate `fullDivN2PathConditionsV5`
(trial branches + the... | /-
EvmAsm.Evm64.DivMod.Spec.N2V5TrialBranch
The v5 n=2 per-digit trial-branch predicates `isTrialN2V5_j{2,1,0}` (each `bltu`
flag = whether the running remainder's top limb is `< v.2.1`, the divisor's top
normalized limb) and the bundled v5 n=2 path predicate `fullDivN2PathConditionsV5`
(trial branches + the... | @@ -54,6 +54,12 @@
fullDivN2MulSubEqV5 bltu_2 bltu_1 bltu_0 a0 a1 a2 a3 b0 b1 b2 b3 :=
hpath.2.2.2.1
+theorem fullDivN2PathConditionsV5_overestimate
+ (bltu_2 bltu_1 bltu_0 : Bool) (a0 a1 a2 a3 b0 b1 b2 b3 : Word)
+ (hpath : fullDivN2PathConditionsV5 bltu_2 bltu_1 bltu_0 a0 a1 a2 a3 b0 b1 b2 b3) :
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_97f7d3bd593d_0 | 514b3e8794023495 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/LogArgsGas.lean | LogArgsGas | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "logDynamicCostFromArgs_log0_eq_data_cost_of_no_growth",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa using\n logDynamicCostFromArgs_eq_charges_of_no_growth\n (kind := .log0... | [
{
"name": "logDynamicCostFromArgs_eq_charges_of_no_growth",
"text": "theorem logDynamicCostFromArgs_eq_charges_of_no_growth\n {kind : LogArgs.Kind} {sizeBytes : Nat} {args : LogArgs.Args}\n (h_no_growth :\n evmMemExpand sizeBytes args.data.offset.toNat args.data.size.toNat = sizeBytes) :\n log... | [
{
"name": "logDynamicCostFromArgs_log0_eq_data_cost_of_no_growth",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 462,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"au... | 1 | /-
EvmAsm.Evm64.LogArgsGas
Bridge from LOG stack arguments to dynamic gas helpers (GH #112).
-/
import EvmAsm.Evm64.LogGas
namespace EvmAsm.Evm64
namespace LogArgsGas
/-- LOG data offset converted to host `Nat` for executable memory/gas helpers. -/
def dataOffsetNat (args : LogArgs.Args) : Nat :=
args.data.of... | /-
EvmAsm.Evm64.LogArgsGas
Bridge from LOG stack arguments to dynamic gas helpers (GH #112).
-/
import EvmAsm.Evm64.LogGas
namespace EvmAsm.Evm64
namespace LogArgsGas
/-- LOG data offset converted to host `Nat` for executable memory/gas helpers. -/
def dataOffsetNat (args : LogArgs.Args) : Nat :=
args.data.of... | @@ -29,12 +29,23 @@
{ data := { offset := offset, size := 0 }, topics := [] } = 0 := by
simp [logDynamicCostFromArgs, dataOffsetNat, dataSizeNat]
+theorem logDynamicCostFromArgs_eq_charges_of_no_growth
+ {kind : LogArgs.Kind} {sizeBytes : Nat} {args : LogArgs.Args}
+ (h_no_growth :
+ evmMemExpand... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_75699a4a1e7b_0 | 2a113ce908042c99 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2CallableSelectedShapeEvidenceCanonical.lean | N2CallableSelectedShapeEvidenceCanonical | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "N2CallableSelectedShapeEvidence.of_canonical",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n N2CallableSelectedShapeEvidence.of_parts\n (n2CallableSelectedShapeEvidence_selectedCarry_of_c... | [
{
"name": "n2CallableSelectedShapeEvidence_arithmetic_of_canonical",
"text": "/-- Universal `arithmetic` callback (mulsub ∧ overestimate) from a pointed\n proof at the canonical bltu triple. -/\ntheorem n2CallableSelectedShapeEvidence_arithmetic_of_canonical\n (a b : EvmWord)\n (h : fullDivN2MulSub... | [
{
"name": "N2CallableSelectedShapeEvidence.of_canonical",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 21,
"n_chars": 1174,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.N2CallableSelectedShapeEvidenceCanonical
Single-instance form for the universal callbacks inside
`N2CallableSelectedShapeEvidence`. The trial-witness predicates
`isTrialN2V4_j{2,1,0}` are by definition `bltu_X = BitVec.ult …`, so
they uniquely determine the bltu triple from `(a, b... | /-
EvmAsm.Evm64.DivMod.Spec.N2CallableSelectedShapeEvidenceCanonical
Single-instance form for the universal callbacks inside
`N2CallableSelectedShapeEvidence`. The trial-witness predicates
`isTrialN2V4_j{2,1,0}` are by definition `bltu_X = BitVec.ult …`, so
they uniquely determine the bltu triple from `(a, b... | @@ -78,6 +78,43 @@
subst h0
exact h
+/-- Universal `arithmetic` callback (mulsub ∧ overestimate) from a pointed
+ proof at the canonical bltu triple. -/
+theorem n2CallableSelectedShapeEvidence_arithmetic_of_canonical
+ (a b : EvmWord)
+ (h : fullDivN2MulSubEqV4
+ (n2V4CanonicalBltu2 a b) (n2V4C... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_597419622066_0 | 4a1d577d0b3b4bde | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V5NoNop.lean | V5NoNop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "sharedDivModCodeNoNop_v5_sub_divCode_noNop_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold sharedDivModCodeNoNop_v5; simp only [CodeReq.unionAll_cons]\n exact CodeReq.union_sp... | [
{
"name": "sharedNoNop_v5_b2_div",
"text": "theorem sharedNoNop_v5_b2_div {b : Word} :\n ∀ a i, (CodeReq.ofProg (b + clzOff) divK_clz) a = some i →\n (divCode_noNop_v5 b) a = some i := by\n unfold divCode_noNop_v5; simp only [CodeReq.unionAll_cons]; skipBlock; skipBlock; exact CodeReq.union_mono_le... | [
{
"name": "sharedDivModCodeNoNop_v5_sub_divCode_noNop_v5",
"fan_in": 0,
"n_deps_direct": 12,
"n_deps_transitive": 12,
"n_lines": 21,
"n_chars": 1096,
"n_subproofs": 0,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automa... | 12 | /-
EvmAsm.Evm64.DivMod.Compose.V5NoNop
Full DIV/MOD CodeReq bundles for the v5 div128 migration.
Mechanical mirror of `EvmAsm.Evm64.DivMod.Compose.V4NoNop` and
`EvmAsm.Evm64.DivMod.Compose.V4Code`, swapping `divK_div128_v4`
→ `divK_div128_v5` at the `div128Off` block. All other 13 blocks are
identical. Th... | /-
EvmAsm.Evm64.DivMod.Compose.V5NoNop
Full DIV/MOD CodeReq bundles for the v5 div128 migration.
Mechanical mirror of `EvmAsm.Evm64.DivMod.Compose.V4NoNop` and
`EvmAsm.Evm64.DivMod.Compose.V4Code`, swapping `divK_div128_v4`
→ `divK_div128_v5` at the `div128Off` block. All other 13 blocks are
identical. Th... | @@ -67,6 +67,10 @@
∀ a i, (CodeReq.ofProg (b + phaseBOff) divK_phaseB) a = some i →
(divCode_noNop_v5 b) a = some i := by
unfold divCode_noNop_v5; simp only [CodeReq.unionAll_cons]; skipBlock; exact CodeReq.union_mono_left
+theorem sharedNoNop_v5_b2_div {b : Word} :
+ ∀ a i, (CodeReq.ofProg (b + clzOf... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_597419622066_1 | b564dc8187fcdbeb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V5NoNop.lean | V5NoNop | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "sharedDivModCodeNoNop_v5_sub_modCode_noNop_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold sharedDivModCodeNoNop_v5; simp only [CodeReq.unionAll_cons]\n exact CodeReq.union_sp... | [
{
"name": "sharedNoNop_v5_b2_mod",
"text": "theorem sharedNoNop_v5_b2_mod {b : Word} :\n ∀ a i, (CodeReq.ofProg (b + clzOff) divK_clz) a = some i →\n (modCode_noNop_v5 b) a = some i := by\n unfold modCode_noNop_v5; simp only [CodeReq.unionAll_cons]; skipBlock; skipBlock; exact CodeReq.union_mono_le... | [
{
"name": "sharedDivModCodeNoNop_v5_sub_modCode_noNop_v5",
"fan_in": 0,
"n_deps_direct": 12,
"n_deps_transitive": 12,
"n_lines": 21,
"n_chars": 1096,
"n_subproofs": 0,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automa... | 12 | /-
EvmAsm.Evm64.DivMod.Compose.V5NoNop
Full DIV/MOD CodeReq bundles for the v5 div128 migration.
Mechanical mirror of `EvmAsm.Evm64.DivMod.Compose.V4NoNop` and
`EvmAsm.Evm64.DivMod.Compose.V4Code`, swapping `divK_div128_v4`
→ `divK_div128_v5` at the `div128Off` block. All other 13 blocks are
identical. Th... | /-
EvmAsm.Evm64.DivMod.Compose.V5NoNop
Full DIV/MOD CodeReq bundles for the v5 div128 migration.
Mechanical mirror of `EvmAsm.Evm64.DivMod.Compose.V4NoNop` and
`EvmAsm.Evm64.DivMod.Compose.V4Code`, swapping `divK_div128_v4`
→ `divK_div128_v5` at the `div128Off` block. All other 13 blocks are
identical. Th... | @@ -67,6 +67,10 @@
∀ a i, (CodeReq.ofProg (b + phaseBOff) divK_phaseB) a = some i →
(modCode_noNop_v5 b) a = some i := by
unfold modCode_noNop_v5; simp only [CodeReq.unionAll_cons]; skipBlock; exact CodeReq.union_mono_left
+theorem sharedNoNop_v5_b2_mod {b : Word} :
+ ∀ a i, (CodeReq.ofProg (b + clzOf... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e2f6e608735e_0 | 26a5fcda2546f511 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/UnalignedFramedStackSpec.lean | UnalignedFramedStackSpec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 2 | [
{
"theorem_name": "evm_mstore_prologue_stack_spec_within_framed",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_evm_mstore_of_stack\n offReg valReg byteReg accReg addrReg memBaseReg... | [
{
"name": "mstore_prologue_stack_spec_within_framed",
"text": "/--\nSibling-framed MSTORE prologue stack spec: `mstore_prologue_stack_spec_within`\nwith an arbitrary `pcFree` assertion `F` framed on both pre and post.\n\nThis is the prologue counterpart to the q0..q3 sibling-framed lemmas below.\nThe full u... | [
{
"name": "evm_mstore_prologue_stack_spec_within_framed",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 31,
"n_chars": 1345,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation... | 1 | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | @@ -30,6 +30,42 @@
open EvmAsm.Rv64
/--
+Sibling-framed MSTORE prologue stack spec: `mstore_prologue_stack_spec_within`
+with an arbitrary `pcFree` assertion `F` framed on both pre and post.
+
+This is the prologue counterpart to the q0..q3 sibling-framed lemmas below.
+The full unaligned MSTORE compose slice uses ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e2f6e608735e_1 | 3cd48820dae19059 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/UnalignedFramedStackSpec.lean | UnalignedFramedStackSpec | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 2 | [
{
"theorem_name": "evm_mstore_prologue_stack_spec_within_framed",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_evm_mstore_of_stack\n offReg valReg byteReg accReg addrReg memBaseReg... | [
{
"name": "mstore_prologue_stack_spec_within_framed",
"text": "/--\nSibling-framed MSTORE prologue stack spec: `mstore_prologue_stack_spec_within`\nwith an arbitrary `pcFree` assertion `F` framed on both pre and post.\n\nThis is the prologue counterpart to the q0..q3 sibling-framed lemmas below.\nThe full u... | [
{
"name": "evm_mstore_combined_one_limb_sequence_stack_spec_within_threaded_frame",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 58,
"n_chars": 2550,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_stru... | 1 | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | @@ -30,6 +30,42 @@
open EvmAsm.Rv64
/--
+Sibling-framed MSTORE prologue stack spec: `mstore_prologue_stack_spec_within`
+with an arbitrary `pcFree` assertion `F` framed on both pre and post.
+
+This is the prologue counterpart to the q0..q3 sibling-framed lemmas below.
+The full unaligned MSTORE compose slice uses ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e2f6e608735e_2 | 60c39e5c9d095ec0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/UnalignedFramedStackSpec.lean | UnalignedFramedStackSpec | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "cpsTripleWithin_evm_mstore_of_one_limb_q0",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := h)\n (hmono := evm_mstore_code_one_limb_q0_sub\n offR... | [
{
"name": "evm_mstore_code_one_limb_q0_sub",
"text": "/--\nPublic-code subsumption for the q0 MSTORE one-limb byte-window write block.\n\nThis bridges the concrete quarter block directly to `evm_mstore_code`, avoiding\nrepeat composition through `mstoreFourLimbsCode` and `mstoreStackCode` at call\nsites tha... | [
{
"name": "cpsTripleWithin_evm_mstore_of_one_limb_q0",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 675,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_onl... | 1 | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | @@ -29,6 +29,26 @@
open EvmAsm.Rv64
+/--
+Public-code subsumption for the q0 MSTORE one-limb byte-window write block.
+
+This bridges the concrete quarter block directly to `evm_mstore_code`, avoiding
+repeat composition through `mstoreFourLimbsCode` and `mstoreStackCode` at call
+sites that transport individual f... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e2f6e608735e_3 | d33d4055e61e88e8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/UnalignedFramedStackSpec.lean | UnalignedFramedStackSpec | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "cpsTripleWithin_evm_mstore_of_one_limb_q1",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := h)\n (hmono := evm_mstore_code_one_limb_q1_sub\n offR... | [
{
"name": "evm_mstore_code_one_limb_q1_sub",
"text": "/-- Public-code subsumption for the q1 MSTORE one-limb byte-window write block. -/\ntheorem evm_mstore_code_one_limb_q1_sub\n (offReg valReg byteReg accReg addrReg memBaseReg : Reg) (base : Word) :\n ∀ a i,\n (mstoreOneLimbCode addrReg byteReg... | [
{
"name": "cpsTripleWithin_evm_mstore_of_one_limb_q1",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 680,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_onl... | 1 | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | @@ -29,6 +29,18 @@
open EvmAsm.Rv64
+/-- Public-code subsumption for the q1 MSTORE one-limb byte-window write block. -/
+theorem evm_mstore_code_one_limb_q1_sub
+ (offReg valReg byteReg accReg addrReg memBaseReg : Reg) (base : Word) :
+ ∀ a i,
+ (mstoreOneLimbCode addrReg byteReg accReg
+ 40 16 1... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e2f6e608735e_4 | 122bde3a8b4c4e13 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/UnalignedFramedStackSpec.lean | UnalignedFramedStackSpec | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "cpsTripleWithin_evm_mstore_of_one_limb_q2",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := h)\n (hmono := evm_mstore_code_one_limb_q2_sub\n offR... | [
{
"name": "evm_mstore_code_one_limb_q2_sub",
"text": "/-- Public-code subsumption for the q2 MSTORE one-limb byte-window write block. -/\ntheorem evm_mstore_code_one_limb_q2_sub\n (offReg valReg byteReg accReg addrReg memBaseReg : Reg) (base : Word) :\n ∀ a i,\n (mstoreOneLimbCode addrReg byteReg... | [
{
"name": "cpsTripleWithin_evm_mstore_of_one_limb_q2",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 681,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_onl... | 1 | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | @@ -29,6 +29,18 @@
open EvmAsm.Rv64
+/-- Public-code subsumption for the q2 MSTORE one-limb byte-window write block. -/
+theorem evm_mstore_code_one_limb_q2_sub
+ (offReg valReg byteReg accReg addrReg memBaseReg : Reg) (base : Word) :
+ ∀ a i,
+ (mstoreOneLimbCode addrReg byteReg accReg
+ 48 8 9 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e2f6e608735e_5 | 753103d470356fbe | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/UnalignedFramedStackSpec.lean | UnalignedFramedStackSpec | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "cpsTripleWithin_evm_mstore_of_one_limb_q3",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := h)\n (hmono := evm_mstore_code_one_limb_q3_sub\n offR... | [
{
"name": "evm_mstore_code_one_limb_q3_sub",
"text": "/-- Public-code subsumption for the q3 MSTORE one-limb byte-window write block. -/\ntheorem evm_mstore_code_one_limb_q3_sub\n (offReg valReg byteReg accReg addrReg memBaseReg : Reg) (base : Word) :\n ∀ a i,\n (mstoreOneLimbCode addrReg byteReg... | [
{
"name": "cpsTripleWithin_evm_mstore_of_one_limb_q3",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 675,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_onl... | 1 | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | @@ -29,6 +29,18 @@
open EvmAsm.Rv64
+/-- Public-code subsumption for the q3 MSTORE one-limb byte-window write block. -/
+theorem evm_mstore_code_one_limb_q3_sub
+ (offReg valReg byteReg accReg addrReg memBaseReg : Reg) (base : Word) :
+ ∀ a i,
+ (mstoreOneLimbCode addrReg byteReg accReg
+ 56 0 1 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e2f6e608735e_6 | 0f1f52683365b185 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/UnalignedFramedStackSpec.lean | UnalignedFramedStackSpec | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "evm_mstore_public_one_limb_sequence_with_prologue_framed",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_seq_same_cr\n (evm_mstore_prologue_stack_spec_within_fram... | [
{
"name": "evm_mstore_prologue_stack_spec_within_framed",
"text": "/--\nEVM-code transport of `mstore_prologue_stack_spec_within_framed`.\n\nLater full-stack unaligned MSTORE composition can use this theorem directly at\nthe public `evm_mstore_code` boundary instead of carrying an extra stack-code\ntranspor... | [
{
"name": "evm_mstore_public_one_limb_sequence_with_prologue_framed",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 49,
"n_chars": 2111,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
... | 3 | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | @@ -66,6 +66,36 @@
framed
/--
+EVM-code transport of `mstore_prologue_stack_spec_within_framed`.
+
+Later full-stack unaligned MSTORE composition can use this theorem directly at
+the public `evm_mstore_code` boundary instead of carrying an extra stack-code
+transport step.
+
+Distinctive token: evm_mstore_prol... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e2f6e608735e_7 | 1d7728c92c9d550e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/UnalignedFramedStackSpec.lean | UnalignedFramedStackSpec | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 2 | [
{
"theorem_name": "evm_mstore_public_one_limb_sequence_with_prologue_framed_perm",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_seq_same_cr\n (evm_mstore_prologue_stack_spec_within... | [
{
"name": "evm_mstore_public_one_limb_sequence_spec_within_perm",
"text": "/--\nPermutation-aware public-code MSTORE q0..q3 composition.\n\nThis variant lets callers stitch concrete quarter specs whose postconditions\nmatch the next precondition only after rearranging or weakening separation\nconjunction at... | [
{
"name": "evm_mstore_public_one_limb_sequence_with_prologue_framed_perm",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 53,
"n_chars": 2273,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1... | 3 | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | @@ -96,6 +96,44 @@
h_off_ne_x0 h_addr_ne_x0)
/--
+Permutation-aware public-code MSTORE q0..q3 composition.
+
+This variant lets callers stitch concrete quarter specs whose postconditions
+match the next precondition only after rearranging or weakening separation
+conjunction atoms.
+
+Distinctive token: evm_m... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e2f6e608735e_8 | 8122671cc0301eaf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/UnalignedFramedStackSpec.lean | UnalignedFramedStackSpec | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "evm_mstore_public_one_limb_sequence_with_prologue_framed",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_seq_same_cr\n (evm_mstore_prologue_stack_spec_within_fram... | [
{
"name": "evm_mstore_prologue_stack_spec_within_framed",
"text": "/--\nEVM-code transport of `mstore_prologue_stack_spec_within_framed`.\n\nLater full-stack unaligned MSTORE composition can use this theorem directly at\nthe public `evm_mstore_code` boundary instead of carrying an extra stack-code\ntranspor... | [
{
"name": "evm_mstore_public_body_with_prologue_framed",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 36,
"n_chars": 1477,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_... | 2 | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | @@ -66,6 +66,36 @@
framed
/--
+EVM-code transport of `mstore_prologue_stack_spec_within_framed`.
+
+Later full-stack unaligned MSTORE composition can use this theorem directly at
+the public `evm_mstore_code` boundary instead of carrying an extra stack-code
+transport step.
+
+Distinctive token: evm_mstore_prol... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e2f6e608735e_9 | 7bf158cb34c27711 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/UnalignedFramedStackSpec.lean | UnalignedFramedStackSpec | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "evm_mstore_unaligned_one_limb_q0_spec_within_framed_public_code",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_evm_mstore_of_one_limb_q0\n offReg valReg byteReg ... | [
{
"name": "evm_mstore_unaligned_one_limb_q0_stack_spec_within_framed",
"text": "/--\nSibling-framed q0 stack spec: `evm_mstore_unaligned_one_limb_q0_stack_spec_within`\nwith an arbitrary `pcFree` assertion `F` framed on both pre and post.\n\nUsed by the compose slice `evm_mstore_unaligned_full_stack_spec_wi... | [
{
"name": "evm_mstore_unaligned_one_limb_q0_spec_within_framed_public_code",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 43,
"n_chars": 2068,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural":... | 3 | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | @@ -65,6 +65,55 @@
offReg valReg byteReg accReg addrReg memBaseReg base)
/--
+Sibling-framed q0 stack spec: `evm_mstore_unaligned_one_limb_q0_stack_spec_within`
+with an arbitrary `pcFree` assertion `F` framed on both pre and post.
+
+Used by the compose slice `evm_mstore_unaligned_full_stack_spec_within`
+(e... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e2f6e608735e_10 | 0a3e670abba8d5db | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/UnalignedFramedStackSpec.lean | UnalignedFramedStackSpec | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "evm_mstore_unaligned_one_limb_q1_spec_within_framed_public_code",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_evm_mstore_of_one_limb_q1\n offReg valReg byteReg ... | [
{
"name": "evm_mstore_unaligned_one_limb_q1_stack_spec_within_framed",
"text": "/--\nSibling-framed q1 stack spec: `evm_mstore_unaligned_one_limb_q1_stack_spec_within`\nwith an arbitrary `pcFree` assertion `F` framed on both pre and post.\n\nDistinctive token: evm_mstore_unaligned_one_limb_q1_stack_spec_wit... | [
{
"name": "evm_mstore_unaligned_one_limb_q1_spec_within_framed_public_code",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 43,
"n_chars": 2070,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural":... | 3 | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | @@ -57,6 +57,51 @@
offReg valReg byteReg accReg addrReg memBaseReg base)
/--
+Sibling-framed q1 stack spec: `evm_mstore_unaligned_one_limb_q1_stack_spec_within`
+with an arbitrary `pcFree` assertion `F` framed on both pre and post.
+
+Distinctive token: evm_mstore_unaligned_one_limb_q1_stack_spec_within_frame... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e2f6e608735e_11 | d8e9224a914e2e9f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/UnalignedFramedStackSpec.lean | UnalignedFramedStackSpec | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "evm_mstore_unaligned_one_limb_q2_spec_within_framed_public_code",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_evm_mstore_of_one_limb_q2\n offReg valReg byteReg ... | [
{
"name": "evm_mstore_unaligned_one_limb_q2_stack_spec_within_framed",
"text": "/--\nSibling-framed q2 stack spec: `evm_mstore_unaligned_one_limb_q2_stack_spec_within`\nwith an arbitrary `pcFree` assertion `F` framed on both pre and post.\n\nDistinctive token: evm_mstore_unaligned_one_limb_q2_stack_spec_wit... | [
{
"name": "evm_mstore_unaligned_one_limb_q2_spec_within_framed_public_code",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 43,
"n_chars": 2069,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural":... | 3 | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | @@ -57,6 +57,51 @@
offReg valReg byteReg accReg addrReg memBaseReg base)
/--
+Sibling-framed q2 stack spec: `evm_mstore_unaligned_one_limb_q2_stack_spec_within`
+with an arbitrary `pcFree` assertion `F` framed on both pre and post.
+
+Distinctive token: evm_mstore_unaligned_one_limb_q2_stack_spec_within_frame... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e2f6e608735e_12 | 84c5c28fa838d3f8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/UnalignedFramedStackSpec.lean | UnalignedFramedStackSpec | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "evm_mstore_unaligned_one_limb_q3_spec_within_framed_public_code",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_evm_mstore_of_one_limb_q3\n offReg valReg byteReg ... | [
{
"name": "evm_mstore_unaligned_one_limb_q3_stack_spec_within_framed",
"text": "/--\nSibling-framed q3 stack spec: `evm_mstore_unaligned_one_limb_q3_stack_spec_within`\nwith an arbitrary `pcFree` assertion `F` framed on both pre and post.\n\nDistinctive token: evm_mstore_unaligned_one_limb_q3_stack_spec_wit... | [
{
"name": "evm_mstore_unaligned_one_limb_q3_spec_within_framed_public_code",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 43,
"n_chars": 2063,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural":... | 3 | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | @@ -57,6 +57,51 @@
offReg valReg byteReg accReg addrReg memBaseReg base)
/--
+Sibling-framed q3 stack spec: `evm_mstore_unaligned_one_limb_q3_stack_spec_within`
+with an arbitrary `pcFree` assertion `F` framed on both pre and post.
+
+Distinctive token: evm_mstore_unaligned_one_limb_q3_stack_spec_within_frame... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e2f6e608735e_13 | 4d8814be99800e26 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/UnalignedFramedStackSpec.lean | UnalignedFramedStackSpec | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "evm_mstore_unaligned_one_limb_q1_spec_within_framed_public_code",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_evm_mstore_of_one_limb_q1\n offReg valReg byteReg ... | [
{
"name": "evm_mstore_unaligned_one_limb_q1_stack_spec_within_framed",
"text": "/--\nSibling-framed q1 stack spec: `evm_mstore_unaligned_one_limb_q1_stack_spec_within`\nwith an arbitrary `pcFree` assertion `F` framed on both pre and post.\n\nDistinctive token: evm_mstore_unaligned_one_limb_q1_stack_spec_wit... | [
{
"name": "evm_mstore_unaligned_full_stack_spec_within_public",
"fan_in": 1,
"n_deps_direct": 6,
"n_deps_transitive": 19,
"n_lines": 142,
"n_chars": 7415,
"n_subproofs": 0,
"n_tactics": 82,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"a... | 19 | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | @@ -341,6 +341,51 @@
h_byte_ne_x0 h_acc_ne_x0 h_window)
/--
+Sibling-framed q1 stack spec: `evm_mstore_unaligned_one_limb_q1_stack_spec_within`
+with an arbitrary `pcFree` assertion `F` framed on both pre and post.
+
+Distinctive token: evm_mstore_unaligned_one_limb_q1_stack_spec_within_framed
+sibling-quarte... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e2f6e608735e_14 | 901397cfe08b3020 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/UnalignedFramedStackSpec.lean | UnalignedFramedStackSpec | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "evm_mstore_unaligned_full_stack_spec_within_public",
"depth": 1,
"n_commands": 0,
"n_lines": 82,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let Fpre : Assertion :=\n (byteReg ↦ᵣ byteOld) ** (accReg ↦ᵣ accOld) **\n (loAddr... | [
{
"name": "evm_mstore_unaligned_one_limb_q1_spec_within_framed_public_code",
"text": "/--\nPublic-code q1 framed MSTORE spec: transports\n`evm_mstore_unaligned_one_limb_q1_stack_spec_within_framed` from the q1\none-limb block to the full `evm_mstore_code` code requirement.\n\nDistinctive token:\nevm_mstore_... | [
{
"name": "evm_mstore_unaligned_full_stack_spec_within_public_epilogue",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 20,
"n_lines": 99,
"n_chars": 5143,
"n_subproofs": 0,
"n_tactics": 38,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1... | 20 | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | @@ -386,6 +386,48 @@
framed
/--
+Public-code q1 framed MSTORE spec: transports
+`evm_mstore_unaligned_one_limb_q1_stack_spec_within_framed` from the q1
+one-limb block to the full `evm_mstore_code` code requirement.
+
+Distinctive token:
+evm_mstore_unaligned_one_limb_q1_spec_within_framed_public_code #53.
+-/
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e2f6e608735e_15 | e60d500bf59368a5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/UnalignedFramedStackSpec.lean | UnalignedFramedStackSpec | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "evm_mstore_unaligned_one_limb_q2_spec_within_framed_public_code",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_evm_mstore_of_one_limb_q2\n offReg valReg byteReg ... | [
{
"name": "evm_mstore_unaligned_one_limb_q2_stack_spec_within_framed",
"text": "/--\nSibling-framed q2 stack spec: `evm_mstore_unaligned_one_limb_q2_stack_spec_within`\nwith an arbitrary `pcFree` assertion `F` framed on both pre and post.\n\nDistinctive token: evm_mstore_unaligned_one_limb_q2_stack_spec_wit... | [
{
"name": "evm_mstore_unaligned_full_stack_spec_within_public_stack_tail",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 21,
"n_lines": 82,
"n_chars": 4070,
"n_subproofs": 1,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural":... | 21 | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | @@ -428,6 +428,51 @@
h_byte_ne_x0 h_acc_ne_x0 h_window)
/--
+Sibling-framed q2 stack spec: `evm_mstore_unaligned_one_limb_q2_stack_spec_within`
+with an arbitrary `pcFree` assertion `F` framed on both pre and post.
+
+Distinctive token: evm_mstore_unaligned_one_limb_q2_stack_spec_within_framed
+sibling-quarte... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e2f6e608735e_16 | 42b5a197e08ca1bf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/UnalignedFramedStackSpec.lean | UnalignedFramedStackSpec | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "evm_mstore_unaligned_full_stack_spec_within_public",
"depth": 1,
"n_commands": 0,
"n_lines": 82,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let Fpre : Assertion :=\n (byteReg ↦ᵣ byteOld) ** (accReg ↦ᵣ accOld) **\n (loAddr... | [
{
"name": "evm_mstore_unaligned_one_limb_q2_spec_within_framed_public_code",
"text": "/--\nPublic-code q2 framed MSTORE spec: transports\n`evm_mstore_unaligned_one_limb_q2_stack_spec_within_framed` from the q2\none-limb block to the full `evm_mstore_code` code requirement.\n\nDistinctive token:\nevm_mstore_... | [
{
"name": "evm_mstore_unaligned_full_stack_spec_within_public_stack_pre",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 22,
"n_lines": 114,
"n_chars": 5348,
"n_subproofs": 1,
"n_tactics": 49,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 12,
"n_structural"... | 22 | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | @@ -473,6 +473,48 @@
framed
/--
+Public-code q2 framed MSTORE spec: transports
+`evm_mstore_unaligned_one_limb_q2_stack_spec_within_framed` from the q2
+one-limb block to the full `evm_mstore_code` code requirement.
+
+Distinctive token:
+evm_mstore_unaligned_one_limb_q2_spec_within_framed_public_code #53.
+-/
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e2f6e608735e_17 | 07ae0603a427d795 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/UnalignedFramedStackSpec.lean | UnalignedFramedStackSpec | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "evm_mstore_unaligned_full_stack_spec_within_public",
"depth": 1,
"n_commands": 0,
"n_lines": 82,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let Fpre : Assertion :=\n (byteReg ↦ᵣ byteOld) ** (accReg ↦ᵣ accOld) **\n (loAddr... | [
{
"name": "evm_mstore_unaligned_one_limb_q2_spec_within_framed_public_code",
"text": "/--\nPublic-code q2 framed MSTORE spec: transports\n`evm_mstore_unaligned_one_limb_q2_stack_spec_within_framed` from the q2\none-limb block to the full `evm_mstore_code` code requirement.\n\nDistinctive token:\nevm_mstore_... | [
{
"name": "evm_mstore_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 23,
"n_lines": 87,
"n_chars": 4131,
"n_subproofs": 1,
"n_tactics": 25,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,... | 23 | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | /-
EvmAsm.Evm64.MStore.UnalignedFramedStackSpec
Sibling-frame variants of the per-quarter stack specs in
`EvmAsm/Evm64/MStore/UnalignedStackSpec.lean`. Each wrapper takes an
arbitrary `pcFree` assertion `F` and frames it on both pre and post.
These are the prerequisite for the four-quarter compose slice tow... | @@ -473,6 +473,48 @@
framed
/--
+Public-code q2 framed MSTORE spec: transports
+`evm_mstore_unaligned_one_limb_q2_stack_spec_within_framed` from the q2
+one-limb block to the full `evm_mstore_code` code requirement.
+
+Distinctive token:
+evm_mstore_unaligned_one_limb_q2_spec_within_framed_public_code #53.
+-/
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cc50a8926e2b_0 | 3072e94ff1c91014 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/ZeroPadLoop.lean | ZeroPadLoop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "zeroPadLoop_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 96,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hNlt : N < 2 ^ 64 := by omega\n -- the per-iteration body: SB ; ADDI cur ; ADDI ctr\n have hbody : ∀ n, n < N →\n ... | [
{
"name": "ctr_dec",
"text": "private theorem ctr_dec (n : Nat) (_hn : n + 1 < 2 ^ 64) :\n BitVec.ofNat 64 (n + 1) + signExtend12 (-1 : BitVec 12)\n = BitVec.ofNat 64 n := by\n rw [show signExtend12 (-1 : BitVec 12) = (-1 : Word) from by decide]\n apply BitVec.eq_of_toNat_eq\n rw [BitVec.toNat_ad... | [
{
"name": "zeroPadLoop_spec",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 126,
"n_chars": 5604,
"n_subproofs": 14,
"n_tactics": 91,
"cyclomatic": 1,
"n_automation": 21,
"n_rewrites": 33,
"n_structural": 4,
"automation_only": false,
"max... | 3 | /-
EvmAsm.Rv64.SAsm.ZeroPadLoop
The **reusable zero-pad countdown loop** and the nested-loop-in-count-up
template (bead evm-asm-db2jq).
Wire-format encoders (`blsk_g2_wire`, `blsk_g1_wire`) zero-pad each
output record with an embedded byte-store countdown INSIDE the outer
count-up call loop:
```
... | /-
EvmAsm.Rv64.SAsm.ZeroPadLoop
The **reusable zero-pad countdown loop** and the nested-loop-in-count-up
template (bead evm-asm-db2jq).
Wire-format encoders (`blsk_g2_wire`, `blsk_g1_wire`) zero-pad each
output record with an embedded byte-store countdown INSIDE the outer
count-up call loop:
```
... | @@ -86,6 +86,15 @@
BitVec.toNat_ofNat, BitVec.toNat_ofNat]
omega
+private theorem ctr_dec (n : Nat) (_hn : n + 1 < 2 ^ 64) :
+ BitVec.ofNat 64 (n + 1) + signExtend12 (-1 : BitVec 12)
+ = BitVec.ofNat 64 n := by
+ rw [show signExtend12 (-1 : BitVec 12) = (-1 : Word) from by decide]
+ apply BitVec.eq_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_13c365a6a25f_0 | ac95ce66386050b4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/ControlFlow/PcSpec.lean | PcSpec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_pc_stack_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_weaken\n (fun _ hp => by xperm_hyp hp)\n (fun _ hq => by\n rw [evmStackIs_cons, evmWordIs... | [
{
"name": "evm_pc_spec_within",
"text": "/-- Raw memory-cell-level PC spec: compute `x10 - codeBaseReg` into `tmpReg`,\n decrement EVM SP by 32, write it at the new top-of-stack low limb and zero\n the upper three limbs. The pushed low limb is `x10val - codeBase`; under\n the dispatcher invariant `... | [
{
"name": "evm_pc_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 31,
"n_chars": 1383,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.ControlFlow.PcSpec
Stack-level cpsTripleWithin specification for the EVM `PC` opcode
(see `evm_pc` in `EvmAsm/Evm64/ControlFlow/Program.lean`).
PC (0x58) pushes the byte offset of the PC opcode within the running
bytecode. The dispatcher keeps the *absolute* code pointer of the opcode
bein... | /-
EvmAsm.Evm64.ControlFlow.PcSpec
Stack-level cpsTripleWithin specification for the EVM `PC` opcode
(see `evm_pc` in `EvmAsm/Evm64/ControlFlow/Program.lean`).
PC (0x58) pushes the byte offset of the PC opcode within the running
bytecode. The dispatcher keeps the *absolute* code pointer of the opcode
bein... | @@ -73,6 +73,41 @@
hhigh 2 (by decide) (by decide),
hhigh 3 (by decide) (by decide)]
+/-- Raw memory-cell-level PC spec: compute `x10 - codeBaseReg` into `tmpReg`,
+ decrement EVM SP by 32, write it at the new top-of-stack low limb and zero
+ the upper three limbs. The pushed low limb is `x10val -... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5cf983f074ee_0 | 9dc14dfd0fe71200 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/StackSpec.lean | StackSpec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "cpsTripleWithin_evm_mstore_of_stack",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := h)\n (hmono := evm_mstore_code_stack_sub\n offReg valReg by... | [
{
"name": "evm_mstore_code_stack_sub",
"text": "/-- Sub-monotonicity: `mstoreStackCode` is contained in `evm_mstore_code` (they\n are in fact equal by `mstoreStackCode_eq_evm_mstore_code`). Direct MSTORE\n analog of `evm_mload_code_stack_sub` (PR #3102, evm-asm-rw24y).\n\n Distinctive token: evm_m... | [
{
"name": "cpsTripleWithin_evm_mstore_of_stack",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 25,
"n_chars": 1052,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": f... | 1 | /-
EvmAsm.Evm64.MStore.StackSpec
Stack-level bridge helpers for MSTORE. Direct MSTORE analogs of the
`MLoad/StackSpec.lean` lemmas: lift triples over `mstoreStackCode`
to triples over `evm_mstore_code`.
-/
import EvmAsm.Evm64.MStore.Spec
import EvmAsm.Evm64.MStore.CombinedSequenceSpec
namespace EvmAsm.Evm64... | /-
EvmAsm.Evm64.MStore.StackSpec
Stack-level bridge helpers for MSTORE. Direct MSTORE analogs of the
`MLoad/StackSpec.lean` lemmas: lift triples over `mstoreStackCode`
to triples over `evm_mstore_code`.
-/
import EvmAsm.Evm64.MStore.Spec
import EvmAsm.Evm64.MStore.CombinedSequenceSpec
namespace EvmAsm.Evm64... | @@ -13,6 +13,20 @@
open EvmAsm.Rv64
+/-- Sub-monotonicity: `mstoreStackCode` is contained in `evm_mstore_code` (they
+ are in fact equal by `mstoreStackCode_eq_evm_mstore_code`). Direct MSTORE
+ analog of `evm_mload_code_stack_sub` (PR #3102, evm-asm-rw24y).
+
+ Distinctive token: evm_mstore_code_stack_s... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5cf983f074ee_1 | 685651192c7c106a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/StackSpec.lean | StackSpec | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 4 | [
{
"theorem_name": "evm_mstore_combined_one_limb_sequence_stack_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_evm_mstore_of_stack\n offReg valReg byteReg accReg addrReg memBaseR... | [
{
"name": "cpsTripleWithin_evm_mstore_of_stack",
"text": "/-- Transport a `cpsTripleWithin` over `mstoreStackCode` to one over\n `evm_mstore_code`. Subsequent slices use this to land\n `evm_mstore_stack_spec_within` (evm-asm-ln8t5 / GH #53 follow-up) by\n composing the existing `mstore_combined_*_... | [
{
"name": "evm_mstore_combined_one_limb_sequence_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 55,
"n_chars": 2516,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 2 | /-
EvmAsm.Evm64.MStore.StackSpec
Stack-level bridge helpers for MSTORE. Direct MSTORE analogs of the
`MLoad/StackSpec.lean` lemmas: lift triples over `mstoreStackCode`
to triples over `evm_mstore_code`.
-/
import EvmAsm.Evm64.MStore.Spec
import EvmAsm.Evm64.MStore.CombinedSequenceSpec
namespace EvmAsm.Evm64... | /-
EvmAsm.Evm64.MStore.StackSpec
Stack-level bridge helpers for MSTORE. Direct MSTORE analogs of the
`MLoad/StackSpec.lean` lemmas: lift triples over `mstoreStackCode`
to triples over `evm_mstore_code`.
-/
import EvmAsm.Evm64.MStore.Spec
import EvmAsm.Evm64.MStore.CombinedSequenceSpec
namespace EvmAsm.Evm64... | @@ -27,6 +27,30 @@
offReg valReg byteReg accReg addrReg memBaseReg base]
intro _ _ h; exact h
+/-- Transport a `cpsTripleWithin` over `mstoreStackCode` to one over
+ `evm_mstore_code`. Subsequent slices use this to land
+ `evm_mstore_stack_spec_within` (evm-asm-ln8t5 / GH #53 follow-up) by
+ composi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5cf983f074ee_2 | 985ea21ef1cf5afa | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/StackSpec.lean | StackSpec | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 4 | [
{
"theorem_name": "evm_mstore_combined_one_limb_sequence_stack_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_evm_mstore_of_stack\n offReg valReg byteReg accReg addrReg memBaseR... | [
{
"name": "cpsTripleWithin_evm_mstore_of_stack",
"text": "/-- Transport a `cpsTripleWithin` over `mstoreStackCode` to one over\n `evm_mstore_code`. Subsequent slices use this to land\n `evm_mstore_stack_spec_within` (evm-asm-ln8t5 / GH #53 follow-up) by\n composing the existing `mstore_combined_*_... | [
{
"name": "evm_mstore_combined_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 38,
"n_chars": 1712,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only":... | 2 | /-
EvmAsm.Evm64.MStore.StackSpec
Stack-level bridge helpers for MSTORE. Direct MSTORE analogs of the
`MLoad/StackSpec.lean` lemmas: lift triples over `mstoreStackCode`
to triples over `evm_mstore_code`.
-/
import EvmAsm.Evm64.MStore.Spec
import EvmAsm.Evm64.MStore.CombinedSequenceSpec
namespace EvmAsm.Evm64... | /-
EvmAsm.Evm64.MStore.StackSpec
Stack-level bridge helpers for MSTORE. Direct MSTORE analogs of the
`MLoad/StackSpec.lean` lemmas: lift triples over `mstoreStackCode`
to triples over `evm_mstore_code`.
-/
import EvmAsm.Evm64.MStore.Spec
import EvmAsm.Evm64.MStore.CombinedSequenceSpec
namespace EvmAsm.Evm64... | @@ -27,6 +27,30 @@
offReg valReg byteReg accReg addrReg memBaseReg base]
intro _ _ h; exact h
+/-- Transport a `cpsTripleWithin` over `mstoreStackCode` to one over
+ `evm_mstore_code`. Subsequent slices use this to land
+ `evm_mstore_stack_spec_within` (evm-asm-ln8t5 / GH #53 follow-up) by
+ composi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5cf983f074ee_3 | ca485b3d216c2623 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/StackSpec.lean | StackSpec | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 4 | [
{
"theorem_name": "evm_mstore_combined_one_limb_sequence_stack_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_evm_mstore_of_stack\n offReg valReg byteReg accReg addrReg memBaseR... | [
{
"name": "cpsTripleWithin_evm_mstore_of_stack",
"text": "/-- Transport a `cpsTripleWithin` over `mstoreStackCode` to one over\n `evm_mstore_code`. Subsequent slices use this to land\n `evm_mstore_stack_spec_within` (evm-asm-ln8t5 / GH #53 follow-up) by\n composing the existing `mstore_combined_*_... | [
{
"name": "evm_mstore_full_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 42,
"n_chars": 1915,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": fal... | 2 | /-
EvmAsm.Evm64.MStore.StackSpec
Stack-level bridge helpers for MSTORE. Direct MSTORE analogs of the
`MLoad/StackSpec.lean` lemmas: lift triples over `mstoreStackCode`
to triples over `evm_mstore_code`.
-/
import EvmAsm.Evm64.MStore.Spec
import EvmAsm.Evm64.MStore.CombinedSequenceSpec
namespace EvmAsm.Evm64... | /-
EvmAsm.Evm64.MStore.StackSpec
Stack-level bridge helpers for MSTORE. Direct MSTORE analogs of the
`MLoad/StackSpec.lean` lemmas: lift triples over `mstoreStackCode`
to triples over `evm_mstore_code`.
-/
import EvmAsm.Evm64.MStore.Spec
import EvmAsm.Evm64.MStore.CombinedSequenceSpec
namespace EvmAsm.Evm64... | @@ -27,6 +27,30 @@
offReg valReg byteReg accReg addrReg memBaseReg base]
intro _ _ h; exact h
+/-- Transport a `cpsTripleWithin` over `mstoreStackCode` to one over
+ `evm_mstore_code`. Subsequent slices use this to land
+ `evm_mstore_stack_spec_within` (evm-asm-ln8t5 / GH #53 follow-up) by
+ composi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5cf983f074ee_4 | 542152fd23744ef2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/StackSpec.lean | StackSpec | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 4 | [
{
"theorem_name": "evm_mstore_combined_one_limb_sequence_stack_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_evm_mstore_of_stack\n offReg valReg byteReg accReg addrReg memBaseR... | [
{
"name": "cpsTripleWithin_evm_mstore_of_stack",
"text": "/-- Transport a `cpsTripleWithin` over `mstoreStackCode` to one over\n `evm_mstore_code`. Subsequent slices use this to land\n `evm_mstore_stack_spec_within` (evm-asm-ln8t5 / GH #53 follow-up) by\n composing the existing `mstore_combined_*_... | [
{
"name": "evm_mstore_combined_four_limb_sequence_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 53,
"n_chars": 2459,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 2 | /-
EvmAsm.Evm64.MStore.StackSpec
Stack-level bridge helpers for MSTORE. Direct MSTORE analogs of the
`MLoad/StackSpec.lean` lemmas: lift triples over `mstoreStackCode`
to triples over `evm_mstore_code`.
-/
import EvmAsm.Evm64.MStore.Spec
import EvmAsm.Evm64.MStore.CombinedSequenceSpec
namespace EvmAsm.Evm64... | /-
EvmAsm.Evm64.MStore.StackSpec
Stack-level bridge helpers for MSTORE. Direct MSTORE analogs of the
`MLoad/StackSpec.lean` lemmas: lift triples over `mstoreStackCode`
to triples over `evm_mstore_code`.
-/
import EvmAsm.Evm64.MStore.Spec
import EvmAsm.Evm64.MStore.CombinedSequenceSpec
namespace EvmAsm.Evm64... | @@ -27,6 +27,30 @@
offReg valReg byteReg accReg addrReg memBaseReg base]
intro _ _ h; exact h
+/-- Transport a `cpsTripleWithin` over `mstoreStackCode` to one over
+ `evm_mstore_code`. Subsequent slices use this to land
+ `evm_mstore_stack_spec_within` (evm-asm-ln8t5 / GH #53 follow-up) by
+ composi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3dabaf7d56cd_0 | 6afe3999fdeac2e9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/DivCallResultSignFixPost.lean | DivCallResultSignFixPost | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "saveRaDivCallResultSignFixPost_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [saveRaDivCallResultSignFixPost_unfold]\n dsimp\n rw [resultSignFixPost_unfold, saveRaDivCallBze... | [
{
"name": "saveRaDivCallResultSignFixPost_unfold",
"text": "theorem saveRaDivCallResultSignFixPost_unfold\n {vRa sp base dividendLimb0 dividendLimb1 dividendLimb2 dividendTop\n divisorLimb0 divisorLimb1 divisorLimb2 divisorTop : Word} :\n saveRaDivCallResultSignFixPost vRa sp base\n divide... | [
{
"name": "saveRaDivCallResultSignFixPost_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 587,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": ... | 1 | import EvmAsm.Evm64.EvmWordArith.Div
import EvmAsm.Evm64.SDiv.Compose.BzeroFrames
import EvmAsm.Evm64.SDiv.Compose.BaseResultSignFix
import EvmAsm.Evm64.SDiv.Compose.Words
namespace EvmAsm.Evm64.SDiv.Compose
@[irreducible]
def saveRaDivCallResultSignFixPost
(vRa sp base dividendLimb0 dividendLimb1 dividendLimb2 d... | import EvmAsm.Evm64.EvmWordArith.Div
import EvmAsm.Evm64.SDiv.Compose.BzeroFrames
import EvmAsm.Evm64.SDiv.Compose.BaseResultSignFix
import EvmAsm.Evm64.SDiv.Compose.Words
namespace EvmAsm.Evm64.SDiv.Compose
@[irreducible]
def saveRaDivCallResultSignFixPost
(vRa sp base dividendLimb0 dividendLimb1 dividendLimb2 d... | @@ -23,12 +23,40 @@
(quotientWord.getLimbN 2) (quotientWord.getLimbN 3) **
saveRaDivCallBzeroResultSignFixFrame vRa sp base divisorSign dividendAbsWord
+theorem saveRaDivCallResultSignFixPost_unfold
+ {vRa sp base dividendLimb0 dividendLimb1 dividendLimb2 dividendTop
+ divisorLimb0 divisorLimb1 diviso... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3dabaf7d56cd_1 | 13632554567a7912 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/DivCallResultSignFixPost.lean | DivCallResultSignFixPost | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "saveRaDivCallResultSignFixPostNoX9_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [saveRaDivCallResultSignFixPostNoX9_unfold]\n dsimp\n rw [resultSignFixPost_unfold, saveRaDi... | [
{
"name": "saveRaDivCallResultSignFixPostNoX9_unfold",
"text": "theorem saveRaDivCallResultSignFixPostNoX9_unfold\n {vRa sp base dividendLimb0 dividendLimb1 dividendLimb2 dividendTop\n divisorLimb0 divisorLimb1 divisorLimb2 divisorTop : Word} :\n saveRaDivCallResultSignFixPostNoX9 vRa sp base\n ... | [
{
"name": "saveRaDivCallResultSignFixPostNoX9_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 598,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_onl... | 1 | import EvmAsm.Evm64.EvmWordArith.Div
import EvmAsm.Evm64.SDiv.Compose.BzeroFrames
import EvmAsm.Evm64.SDiv.Compose.BaseResultSignFix
import EvmAsm.Evm64.SDiv.Compose.Words
namespace EvmAsm.Evm64.SDiv.Compose
@[irreducible]
def saveRaDivCallResultSignFixPost
(vRa sp base dividendLimb0 dividendLimb1 dividendLimb2 d... | import EvmAsm.Evm64.EvmWordArith.Div
import EvmAsm.Evm64.SDiv.Compose.BzeroFrames
import EvmAsm.Evm64.SDiv.Compose.BaseResultSignFix
import EvmAsm.Evm64.SDiv.Compose.Words
namespace EvmAsm.Evm64.SDiv.Compose
@[irreducible]
def saveRaDivCallResultSignFixPost
(vRa sp base dividendLimb0 dividendLimb1 dividendLimb2 d... | @@ -84,12 +84,39 @@
(quotientWord.getLimbN 2) (quotientWord.getLimbN 3) **
saveRaDivCallResultSignFixFrameNoX9 vRa sp base dividendAbsWord
+theorem saveRaDivCallResultSignFixPostNoX9_unfold
+ {vRa sp base dividendLimb0 dividendLimb1 dividendLimb2 dividendTop
+ divisorLimb0 divisorLimb1 divisorLimb2 di... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1f2fa2f525f2_0 | ad8b129499d02ae3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/TreeDemo.lean | TreeDemo | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "treeMin_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 48,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h0 : ((rf₀.get .x10 + signExtend12 (0 : BitVec 12))\n - rf₀.get .x10).toNat = 0 := by\n rw [show signExtend12 ... | [
{
"name": "nodeBytes_left",
"text": "/-- The left-pointer dword of a node's byte image. -/\ntheorem nodeBytes_left (k pl pr : Word) :\n ((nodeBytes k pl pr).drop 8).take 8 = dwordBytes pl := by\n rw [nodeBytes, List.drop_append_of_le_length (by rw [length_dwordBytes]),\n List.drop_eq_nil_of_le (by rw... | [
{
"name": "treeMin_engine",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 58,
"n_chars": 2638,
"n_subproofs": 4,
"n_tactics": 48,
"cyclomatic": 1,
"n_automation": 16,
"n_rewrites": 26,
"n_structural": 3,
"automation_only": false,
"max_nes... | 2 | /-
EvmAsm.Rv64.SAsm.TreeDemo
The tree-walk integration demo (Assertion-state milestone, stage 5):
`treeMinFn` walks a `treeAt`-owned binary tree to its leftmost key,
exercising every mechanism at once — a `while` loop whose invariant
carries existentially-quantified zipper ghosts, focus blocks opening
node... | /-
EvmAsm.Rv64.SAsm.TreeDemo
The tree-walk integration demo (Assertion-state milestone, stage 5):
`treeMinFn` walks a `treeAt`-owned binary tree to its leftmost key,
exercising every mechanism at once — a `while` loop whose invariant
carries existentially-quantified zipper ghosts, focus blocks opening
node... | @@ -50,6 +50,18 @@
List.take_append_of_le_length (by rw [length_dwordBytes]),
List.take_of_length_le (by rw [length_dwordBytes])]
+/-- The left-pointer dword of a node's byte image. -/
+theorem nodeBytes_left (k pl pr : Word) :
+ ((nodeBytes k pl pr).drop 8).take 8 = dwordBytes pl := by
+ rw [nodeBytes,... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1f2fa2f525f2_1 | 2985f717da784951 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/TreeDemo.lean | TreeDemo | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "treeMinFn_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 171,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n vcgen\n case treeMin.enter =>\n rintro rf ws A ⟨rf₀, ws₀, -, ⟨hx10, hx12, hA⟩, rfl, rfl⟩ hApc hsat\n obtain ⟨hp, hh... | [
{
"name": "treeMin_engine",
"text": "/-- The visit block's register effect (the routing conditions discharge\n against the 24-byte window). -/\nprivate theorem treeMin_engine (reg : Region) (rf₀ : RegFile) (k pl pr : Word) :\n (execBlock reg (rf₀.get .x10) rf₀ (nodeBytes k pl pr) treeMinBlock).1.get .... | [
{
"name": "treeMinFn_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 175,
"n_chars": 7835,
"n_subproofs": 30,
"n_tactics": 173,
"cyclomatic": 13,
"n_automation": 62,
"n_rewrites": 40,
"n_structural": 46,
"automation_only": false,
"ma... | 3 | /-
EvmAsm.Rv64.SAsm.TreeDemo
The tree-walk integration demo (Assertion-state milestone, stage 5):
`treeMinFn` walks a `treeAt`-owned binary tree to its leftmost key,
exercising every mechanism at once — a `while` loop whose invariant
carries existentially-quantified zipper ghosts, focus blocks opening
node... | /-
EvmAsm.Rv64.SAsm.TreeDemo
The tree-walk integration demo (Assertion-state milestone, stage 5):
`treeMinFn` walks a `treeAt`-owned binary tree to its leftmost key,
exercising every mechanism at once — a `while` loop whose invariant
carries existentially-quantified zipper ghosts, focus blocks opening
node... | @@ -129,9 +129,236 @@
.ghost "step" (treeMinStepR root d0 t0)) ;;;
.ghost "fold" (fun _ _ _ A' => A' = treeAt root t0)
+/-- The visit block's register effect (the routing conditions discharge
+ against the 24-byte window). -/
+private theorem treeMin_engine (reg : Region) (rf₀ : RegFile) (k pl pr : Wo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_d153163f7ec1_0 | af65254620cbce6c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Program.lean | Program | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "evm_smod_save_ra_block_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_smod_save_ra_block_length]",
"n_chars": 40,
"n_subproofs": 0,
"n_tactics": 2,
"c... | [
{
"name": "evm_smod_save_ra_block_length",
"text": "theorem evm_smod_save_ra_block_length (savedRaReg : Reg) :\n (evm_smod_save_ra_block savedRaReg).length = 1 := rfl\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 118,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automat... | [
{
"name": "evm_smod_save_ra_block_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 163,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fals... | 1 | /-
EvmAsm.Evm64.SMod.Program
Signed remainder opcode SMOD (`SMOD(a, b)` = signed-remainder under EVM
rules) as a 64-bit RISC-V program.
Per `docs/sdiv-smod-design.md` the algorithm is
1. extract sign of each operand (top bit of limb 3)
2. conditionally two's-complement negate operands so both are... | /-
EvmAsm.Evm64.SMod.Program
Signed remainder opcode SMOD (`SMOD(a, b)` = signed-remainder under EVM
rules) as a 64-bit RISC-V program.
Per `docs/sdiv-smod-design.md` the algorithm is
1. extract sign of each operand (top bit of limb 3)
2. conditionally two's-complement negate operands so both are... | @@ -36,8 +36,12 @@
def evm_smod_save_ra_block (savedRaReg : Reg) : Program :=
ADDI savedRaReg .x1 0
+theorem evm_smod_save_ra_block_length (savedRaReg : Reg) :
+ (evm_smod_save_ra_block savedRaReg).length = 1 := rfl
+
theorem evm_smod_save_ra_block_byte_length (savedRaReg : Reg) :
- 4 * (evm_smod_save_ra_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_d153163f7ec1_1 | b20fcf201027fc5c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Program.lean | Program | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "evm_smod_saved_ra_ret_block_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_smod_saved_ra_ret_block_length]",
"n_chars": 45,
"n_subproofs": 0,
"n_tactics":... | [
{
"name": "evm_smod_saved_ra_ret_block_length",
"text": "theorem evm_smod_saved_ra_ret_block_length (savedRaReg : Reg) :\n (evm_smod_saved_ra_ret_block savedRaReg).length = 1 := rfl\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 128,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,... | [
{
"name": "evm_smod_saved_ra_ret_block_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 178,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only":... | 1 | /-
EvmAsm.Evm64.SMod.Program
Signed remainder opcode SMOD (`SMOD(a, b)` = signed-remainder under EVM
rules) as a 64-bit RISC-V program.
Per `docs/sdiv-smod-design.md` the algorithm is
1. extract sign of each operand (top bit of limb 3)
2. conditionally two's-complement negate operands so both are... | /-
EvmAsm.Evm64.SMod.Program
Signed remainder opcode SMOD (`SMOD(a, b)` = signed-remainder under EVM
rules) as a 64-bit RISC-V program.
Per `docs/sdiv-smod-design.md` the algorithm is
1. extract sign of each operand (top bit of limb 3)
2. conditionally two's-complement negate operands so both are... | @@ -40,8 +40,12 @@
def evm_smod_saved_ra_ret_block (savedRaReg : Reg) : Program :=
JALR .x0 savedRaReg 0
+theorem evm_smod_saved_ra_ret_block_length (savedRaReg : Reg) :
+ (evm_smod_saved_ra_ret_block savedRaReg).length = 1 := rfl
+
theorem evm_smod_saved_ra_ret_block_byte_length (savedRaReg : Reg) :
- 4 *... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_d153163f7ec1_2 | ecdd05ea9b47f9d3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Program.lean | Program | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "evm_smod_wrapper_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_smod_wrapper_length]",
"n_chars": 34,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": ... | [
{
"name": "evm_smod_wrapper_length",
"text": "theorem evm_smod_wrapper_length : evm_smod_wrapper.length = 71 := by\n decide\n\n",
"fan_in": 5,
"n_lines": 4,
"n_chars": 79,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structura... | [
{
"name": "evm_smod_wrapper_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 115,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.SMod.Program
Signed remainder opcode SMOD (`SMOD(a, b)` = signed-remainder under EVM
rules) as a 64-bit RISC-V program.
Per `docs/sdiv-smod-design.md` the algorithm is
1. extract sign of each operand (top bit of limb 3)
2. conditionally two's-complement negate operands so both are... | /-
EvmAsm.Evm64.SMod.Program
Signed remainder opcode SMOD (`SMOD(a, b)` = signed-remainder under EVM
rules) as a 64-bit RISC-V program.
Per `docs/sdiv-smod-design.md` the algorithm is
1. extract sign of each operand (top bit of limb 3)
2. conditionally two's-complement negate operands so both are... | @@ -62,8 +62,12 @@
evm_sdiv_cond_negate_256_block .x12 .x13 .x10 .x7 .x11 0 8 16 24 ;;
evm_smod_saved_ra_ret_block .x18
+theorem evm_smod_wrapper_length : evm_smod_wrapper.length = 71 := by
+ decide
+
theorem evm_smod_wrapper_byte_length :
- 4 * evm_smod_wrapper.length = 284 := sorry
+ 4 * evm_smod_wrap... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_d153163f7ec1_3 | 1b7101f168a5111f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Program.lean | Program | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "evm_smod_wrapper_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_smod_wrapper_length]",
"n_chars": 34,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": ... | [
{
"name": "evm_smod_wrapper_length",
"text": "theorem evm_smod_wrapper_length : evm_smod_wrapper.length = 71 := by\n decide\n\n",
"fan_in": 5,
"n_lines": 4,
"n_chars": 79,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structura... | [
{
"name": "evm_smod_legacy_length",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 592,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max... | 1 | /-
EvmAsm.Evm64.SMod.Program
Signed remainder opcode SMOD (`SMOD(a, b)` = signed-remainder under EVM
rules) as a 64-bit RISC-V program.
Per `docs/sdiv-smod-design.md` the algorithm is
1. extract sign of each operand (top bit of limb 3)
2. conditionally two's-complement negate operands so both are... | /-
EvmAsm.Evm64.SMod.Program
Signed remainder opcode SMOD (`SMOD(a, b)` = signed-remainder under EVM
rules) as a 64-bit RISC-V program.
Per `docs/sdiv-smod-design.md` the algorithm is
1. extract sign of each operand (top bit of limb 3)
2. conditionally two's-complement negate operands so both are... | @@ -62,6 +62,9 @@
evm_sdiv_cond_negate_256_block .x12 .x13 .x10 .x7 .x11 0 8 16 24 ;;
evm_smod_saved_ra_ret_block .x18
+theorem evm_smod_wrapper_length : evm_smod_wrapper.length = 71 := by
+ decide
+
/-- Legacy SMOD code region. The wrapper returns via `x18`; the appended
`evm_mod_callable_v1` block is 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_d153163f7ec1_4 | 277779346ab8bc04 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Program.lean | Program | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "evm_smod_wrapper_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_smod_wrapper_length]",
"n_chars": 34,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": ... | [
{
"name": "evm_smod_wrapper_length",
"text": "theorem evm_smod_wrapper_length : evm_smod_wrapper.length = 71 := by\n decide\n\n",
"fan_in": 5,
"n_lines": 4,
"n_chars": 79,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structura... | [
{
"name": "evm_smod_length",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 187,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting"... | 1 | /-
EvmAsm.Evm64.SMod.Program
Signed remainder opcode SMOD (`SMOD(a, b)` = signed-remainder under EVM
rules) as a 64-bit RISC-V program.
Per `docs/sdiv-smod-design.md` the algorithm is
1. extract sign of each operand (top bit of limb 3)
2. conditionally two's-complement negate operands so both are... | /-
EvmAsm.Evm64.SMod.Program
Signed remainder opcode SMOD (`SMOD(a, b)` = signed-remainder under EVM
rules) as a 64-bit RISC-V program.
Per `docs/sdiv-smod-design.md` the algorithm is
1. extract sign of each operand (top bit of limb 3)
2. conditionally two's-complement negate operands so both are... | @@ -62,6 +62,9 @@
evm_sdiv_cond_negate_256_block .x12 .x13 .x10 .x7 .x11 0 8 16 24 ;;
evm_smod_saved_ra_ret_block .x18
+theorem evm_smod_wrapper_length : evm_smod_wrapper.length = 71 := by
+ decide
+
/-- Legacy SMOD code region. The wrapper returns via `x18`; the appended
`evm_mod_callable_v1` block is 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_d153163f7ec1_5 | edb176e6003295ae | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Program.lean | Program | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "evm_smod_wrapper_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_smod_wrapper_length]",
"n_chars": 34,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": ... | [
{
"name": "evm_smod_wrapper_length",
"text": "theorem evm_smod_wrapper_length : evm_smod_wrapper.length = 71 := by\n decide\n\n",
"fan_in": 5,
"n_lines": 4,
"n_chars": 79,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structura... | [
{
"name": "evm_smod_v4_length",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 196,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesti... | 1 | /-
EvmAsm.Evm64.SMod.Program
Signed remainder opcode SMOD (`SMOD(a, b)` = signed-remainder under EVM
rules) as a 64-bit RISC-V program.
Per `docs/sdiv-smod-design.md` the algorithm is
1. extract sign of each operand (top bit of limb 3)
2. conditionally two's-complement negate operands so both are... | /-
EvmAsm.Evm64.SMod.Program
Signed remainder opcode SMOD (`SMOD(a, b)` = signed-remainder under EVM
rules) as a 64-bit RISC-V program.
Per `docs/sdiv-smod-design.md` the algorithm is
1. extract sign of each operand (top bit of limb 3)
2. conditionally two's-complement negate operands so both are... | @@ -62,6 +62,9 @@
evm_sdiv_cond_negate_256_block .x12 .x13 .x10 .x7 .x11 0 8 16 24 ;;
evm_smod_saved_ra_ret_block .x18
+theorem evm_smod_wrapper_length : evm_smod_wrapper.length = 71 := by
+ decide
+
/-- Legacy SMOD code region. The wrapper returns via `x18`; the appended
`evm_mod_callable_v1` block is 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_d153163f7ec1_6 | 08152904c505f033 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Program.lean | Program | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "evm_smod_wrapper_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_smod_wrapper_length]",
"n_chars": 34,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": ... | [
{
"name": "evm_smod_wrapper_length",
"text": "theorem evm_smod_wrapper_length : evm_smod_wrapper.length = 71 := by\n decide\n\n",
"fan_in": 5,
"n_lines": 4,
"n_chars": 79,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structura... | [
{
"name": "evm_smod_v5_length",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 196,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesti... | 1 | /-
EvmAsm.Evm64.SMod.Program
Signed remainder opcode SMOD (`SMOD(a, b)` = signed-remainder under EVM
rules) as a 64-bit RISC-V program.
Per `docs/sdiv-smod-design.md` the algorithm is
1. extract sign of each operand (top bit of limb 3)
2. conditionally two's-complement negate operands so both are... | /-
EvmAsm.Evm64.SMod.Program
Signed remainder opcode SMOD (`SMOD(a, b)` = signed-remainder under EVM
rules) as a 64-bit RISC-V program.
Per `docs/sdiv-smod-design.md` the algorithm is
1. extract sign of each operand (top bit of limb 3)
2. conditionally two's-complement negate operands so both are... | @@ -62,6 +62,9 @@
evm_sdiv_cond_negate_256_block .x12 .x13 .x10 .x7 .x11 0 8 16 24 ;;
evm_smod_saved_ra_ret_block .x18
+theorem evm_smod_wrapper_length : evm_smod_wrapper.length = 71 := by
+ decide
+
/-- Legacy SMOD code region. The wrapper returns via `x18`; the appended
`evm_mod_callable_v1` block is 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_d153163f7ec1_7 | 86553cf086531b02 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Program.lean | Program | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "evm_smod_wrapper_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_smod_wrapper_length]",
"n_chars": 34,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": ... | [
{
"name": "evm_smod_wrapper_length",
"text": "theorem evm_smod_wrapper_length : evm_smod_wrapper.length = 71 := by\n decide\n\n",
"fan_in": 5,
"n_lines": 4,
"n_chars": 79,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structura... | [
{
"name": "evm_smod_legacy_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 4,
"n_chars": 109,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.SMod.Program
Signed remainder opcode SMOD (`SMOD(a, b)` = signed-remainder under EVM
rules) as a 64-bit RISC-V program.
Per `docs/sdiv-smod-design.md` the algorithm is
1. extract sign of each operand (top bit of limb 3)
2. conditionally two's-complement negate operands so both are... | /-
EvmAsm.Evm64.SMod.Program
Signed remainder opcode SMOD (`SMOD(a, b)` = signed-remainder under EVM
rules) as a 64-bit RISC-V program.
Per `docs/sdiv-smod-design.md` the algorithm is
1. extract sign of each operand (top bit of limb 3)
2. conditionally two's-complement negate operands so both are... | @@ -62,6 +62,9 @@
evm_sdiv_cond_negate_256_block .x12 .x13 .x10 .x7 .x11 0 8 16 24 ;;
evm_smod_saved_ra_ret_block .x18
+theorem evm_smod_wrapper_length : evm_smod_wrapper.length = 71 := by
+ decide
+
/-- Legacy SMOD code region. The wrapper returns via `x18`; the appended
`evm_mod_callable_v1` block is 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_d153163f7ec1_8 | d764be2537ddf108 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Program.lean | Program | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "evm_smod_wrapper_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_smod_wrapper_length]",
"n_chars": 34,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": ... | [
{
"name": "evm_smod_wrapper_length",
"text": "theorem evm_smod_wrapper_length : evm_smod_wrapper.length = 71 := by\n decide\n\n",
"fan_in": 5,
"n_lines": 4,
"n_chars": 79,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structura... | [
{
"name": "evm_smod_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 4,
"n_chars": 88,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nes... | 2 | /-
EvmAsm.Evm64.SMod.Program
Signed remainder opcode SMOD (`SMOD(a, b)` = signed-remainder under EVM
rules) as a 64-bit RISC-V program.
Per `docs/sdiv-smod-design.md` the algorithm is
1. extract sign of each operand (top bit of limb 3)
2. conditionally two's-complement negate operands so both are... | /-
EvmAsm.Evm64.SMod.Program
Signed remainder opcode SMOD (`SMOD(a, b)` = signed-remainder under EVM
rules) as a 64-bit RISC-V program.
Per `docs/sdiv-smod-design.md` the algorithm is
1. extract sign of each operand (top bit of limb 3)
2. conditionally two's-complement negate operands so both are... | @@ -62,6 +62,9 @@
evm_sdiv_cond_negate_256_block .x12 .x13 .x10 .x7 .x11 0 8 16 24 ;;
evm_smod_saved_ra_ret_block .x18
+theorem evm_smod_wrapper_length : evm_smod_wrapper.length = 71 := by
+ decide
+
/-- Legacy SMOD code region. The wrapper returns via `x18`; the appended
`evm_mod_callable_v1` block is 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_d153163f7ec1_9 | 466536f24aed8c80 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Program.lean | Program | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "evm_smod_wrapper_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_smod_wrapper_length]",
"n_chars": 34,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": ... | [
{
"name": "evm_smod_wrapper_length",
"text": "theorem evm_smod_wrapper_length : evm_smod_wrapper.length = 71 := by\n decide\n\n",
"fan_in": 5,
"n_lines": 4,
"n_chars": 79,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structura... | [
{
"name": "evm_smod_v4_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 4,
"n_chars": 97,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_... | 2 | /-
EvmAsm.Evm64.SMod.Program
Signed remainder opcode SMOD (`SMOD(a, b)` = signed-remainder under EVM
rules) as a 64-bit RISC-V program.
Per `docs/sdiv-smod-design.md` the algorithm is
1. extract sign of each operand (top bit of limb 3)
2. conditionally two's-complement negate operands so both are... | /-
EvmAsm.Evm64.SMod.Program
Signed remainder opcode SMOD (`SMOD(a, b)` = signed-remainder under EVM
rules) as a 64-bit RISC-V program.
Per `docs/sdiv-smod-design.md` the algorithm is
1. extract sign of each operand (top bit of limb 3)
2. conditionally two's-complement negate operands so both are... | @@ -62,6 +62,9 @@
evm_sdiv_cond_negate_256_block .x12 .x13 .x10 .x7 .x11 0 8 16 24 ;;
evm_smod_saved_ra_ret_block .x18
+theorem evm_smod_wrapper_length : evm_smod_wrapper.length = 71 := by
+ decide
+
/-- Legacy SMOD code region. The wrapper returns via `x18`; the appended
`evm_mod_callable_v1` block is 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_d153163f7ec1_10 | 97e4a6e44439a355 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Program.lean | Program | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "evm_smod_wrapper_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_smod_wrapper_length]",
"n_chars": 34,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": ... | [
{
"name": "evm_smod_wrapper_length",
"text": "theorem evm_smod_wrapper_length : evm_smod_wrapper.length = 71 := by\n decide\n\n",
"fan_in": 5,
"n_lines": 4,
"n_chars": 79,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structura... | [
{
"name": "evm_smod_v5_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 4,
"n_chars": 97,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_... | 2 | /-
EvmAsm.Evm64.SMod.Program
Signed remainder opcode SMOD (`SMOD(a, b)` = signed-remainder under EVM
rules) as a 64-bit RISC-V program.
Per `docs/sdiv-smod-design.md` the algorithm is
1. extract sign of each operand (top bit of limb 3)
2. conditionally two's-complement negate operands so both are... | /-
EvmAsm.Evm64.SMod.Program
Signed remainder opcode SMOD (`SMOD(a, b)` = signed-remainder under EVM
rules) as a 64-bit RISC-V program.
Per `docs/sdiv-smod-design.md` the algorithm is
1. extract sign of each operand (top bit of limb 3)
2. conditionally two's-complement negate operands so both are... | @@ -62,6 +62,9 @@
evm_sdiv_cond_negate_256_block .x12 .x13 .x10 .x7 .x11 0 8 16 24 ;;
evm_smod_saved_ra_ret_block .x18
+theorem evm_smod_wrapper_length : evm_smod_wrapper.length = 71 := by
+ decide
+
/-- Legacy SMOD code region. The wrapper returns via `x18`; the appended
`evm_mod_callable_v1` block is 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_c6383a7d6a39_0 | 21981b1901d745dd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 12 | [
{
"theorem_name": "exp_zero_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [exp_correct]\n decide",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "exp_correct",
"text": "/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/\ntheorem exp_correct (base exponent : EvmWord) :\n (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by\n simp [exp, BitVec.toNat_ofNat]\n\n",
"fan_in": 12,
"n_lines": 6... | [
{
"name": "exp_zero_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 169,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -15,8 +15,16 @@
def exp (base exponent : EvmWord) : EvmWord :=
BitVec.ofNat 256 (base.toNat ^ exponent.toNat)
+/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/
+theorem exp_correct (base exponent : EvmWord) :
+ (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6383a7d6a39_1 | c73d3ff31b00a836 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 12 | [
{
"theorem_name": "exp_zero_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [exp_correct]\n decide",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "exp_correct",
"text": "/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/\ntheorem exp_correct (base exponent : EvmWord) :\n (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by\n simp [exp, BitVec.toNat_ofNat]\n\n",
"fan_in": 12,
"n_lines": 6... | [
{
"name": "exp_zero_right",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 172,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting"... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -15,11 +15,22 @@
def exp (base exponent : EvmWord) : EvmWord :=
BitVec.ofNat 256 (base.toNat ^ exponent.toNat)
+/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/
+theorem exp_correct (base exponent : EvmWord) :
+ (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6383a7d6a39_2 | 59bcdcb34f820060 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 12 | [
{
"theorem_name": "exp_zero_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [exp_correct]\n decide",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "exp_correct",
"text": "/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/\ntheorem exp_correct (base exponent : EvmWord) :\n (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by\n simp [exp, BitVec.toNat_ofNat]\n\n",
"fan_in": 12,
"n_lines": 6... | [
{
"name": "exp_max_zero_right",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 150,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nest... | 2 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -15,11 +15,22 @@
def exp (base exponent : EvmWord) : EvmWord :=
BitVec.ofNat 256 (base.toNat ^ exponent.toNat)
+/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/
+theorem exp_correct (base exponent : EvmWord) :
+ (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6383a7d6a39_3 | 568387f4b5d44db0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 12 | [
{
"theorem_name": "exp_zero_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [exp_correct]\n decide",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "exp_correct",
"text": "/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/\ntheorem exp_correct (base exponent : EvmWord) :\n (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by\n simp [exp, BitVec.toNat_ofNat]\n\n",
"fan_in": 12,
"n_lines": 6... | [
{
"name": "exp_one_left",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 173,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": ... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -15,11 +15,22 @@
def exp (base exponent : EvmWord) : EvmWord :=
BitVec.ofNat 256 (base.toNat ^ exponent.toNat)
+/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/
+theorem exp_correct (base exponent : EvmWord) :
+ (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6383a7d6a39_4 | bb0e6e1265d18aba | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 12 | [
{
"theorem_name": "exp_zero_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [exp_correct]\n decide",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "exp_correct",
"text": "/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/\ntheorem exp_correct (base exponent : EvmWord) :\n (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by\n simp [exp, BitVec.toNat_ofNat]\n\n",
"fan_in": 12,
"n_lines": 6... | [
{
"name": "exp_zero_left_of_ne_zero",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 418,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
"m... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -15,12 +15,27 @@
def exp (base exponent : EvmWord) : EvmWord :=
BitVec.ofNat 256 (base.toNat ^ exponent.toNat)
+/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/
+theorem exp_correct (base exponent : EvmWord) :
+ (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6383a7d6a39_5 | de6a999194760e61 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 12 | [
{
"theorem_name": "exp_zero_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [exp_correct]\n decide",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "exp_correct",
"text": "/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/\ntheorem exp_correct (base exponent : EvmWord) :\n (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by\n simp [exp, BitVec.toNat_ofNat]\n\n",
"fan_in": 12,
"n_lines": 6... | [
{
"name": "exp_zero_left_of_toNat_pos",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 300,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -15,12 +15,27 @@
def exp (base exponent : EvmWord) : EvmWord :=
BitVec.ofNat 256 (base.toNat ^ exponent.toNat)
+/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/
+theorem exp_correct (base exponent : EvmWord) :
+ (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6383a7d6a39_6 | 3cce8aa48f21fad1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 12 | [
{
"theorem_name": "exp_zero_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [exp_correct]\n decide",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "exp_correct",
"text": "/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/\ntheorem exp_correct (base exponent : EvmWord) :\n (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by\n simp [exp, BitVec.toNat_ofNat]\n\n",
"fan_in": 12,
"n_lines": 6... | [
{
"name": "exp_zero_one",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 141,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": ... | 2 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -15,12 +15,27 @@
def exp (base exponent : EvmWord) : EvmWord :=
BitVec.ofNat 256 (base.toNat ^ exponent.toNat)
+/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/
+theorem exp_correct (base exponent : EvmWord) :
+ (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6383a7d6a39_7 | 865fc16fb094fc93 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 12 | [
{
"theorem_name": "exp_zero_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [exp_correct]\n decide",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "exp_correct",
"text": "/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/\ntheorem exp_correct (base exponent : EvmWord) :\n (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by\n simp [exp, BitVec.toNat_ofNat]\n\n",
"fan_in": 12,
"n_lines": 6... | [
{
"name": "exp_zero_left_max",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 186,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 2 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -15,12 +15,27 @@
def exp (base exponent : EvmWord) : EvmWord :=
BitVec.ofNat 256 (base.toNat ^ exponent.toNat)
+/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/
+theorem exp_correct (base exponent : EvmWord) :
+ (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6383a7d6a39_8 | ca41a9c918bb2e8e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 12 | [
{
"theorem_name": "exp_zero_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [exp_correct]\n decide",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "exp_correct",
"text": "/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/\ntheorem exp_correct (base exponent : EvmWord) :\n (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by\n simp [exp, BitVec.toNat_ofNat]\n\n",
"fan_in": 12,
"n_lines": 6... | [
{
"name": "exp_one_right",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 205,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -15,11 +15,22 @@
def exp (base exponent : EvmWord) : EvmWord :=
BitVec.ofNat 256 (base.toNat ^ exponent.toNat)
+/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/
+theorem exp_correct (base exponent : EvmWord) :
+ (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6383a7d6a39_9 | fe03a43b403bc761 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 12 | [
{
"theorem_name": "exp_zero_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [exp_correct]\n decide",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "exp_correct",
"text": "/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/\ntheorem exp_correct (base exponent : EvmWord) :\n (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by\n simp [exp, BitVec.toNat_ofNat]\n\n",
"fan_in": 12,
"n_lines": 6... | [
{
"name": "exp_max_one_right",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 182,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 2 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -15,11 +15,22 @@
def exp (base exponent : EvmWord) : EvmWord :=
BitVec.ofNat 256 (base.toNat ^ exponent.toNat)
+/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/
+theorem exp_correct (base exponent : EvmWord) :
+ (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6383a7d6a39_10 | b7e80cbb8f57e8af | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 12 | [
{
"theorem_name": "exp_zero_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [exp_correct]\n decide",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "exp_correct",
"text": "/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/\ntheorem exp_correct (base exponent : EvmWord) :\n (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by\n simp [exp, BitVec.toNat_ofNat]\n\n",
"fan_in": 12,
"n_lines": 6... | [
{
"name": "exp_two_one",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 127,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2... | 2 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -15,11 +15,22 @@
def exp (base exponent : EvmWord) : EvmWord :=
BitVec.ofNat 256 (base.toNat ^ exponent.toNat)
+/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/
+theorem exp_correct (base exponent : EvmWord) :
+ (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6383a7d6a39_11 | 5ba3a9321b64e8ac | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 12 | [
{
"theorem_name": "exp_zero_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [exp_correct]\n decide",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "exp_correct",
"text": "/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/\ntheorem exp_correct (base exponent : EvmWord) :\n (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by\n simp [exp, BitVec.toNat_ofNat]\n\n",
"fan_in": 12,
"n_lines": 6... | [
{
"name": "exp_succ_right_of_toNat_lt",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 661,
"n_subproofs": 2,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 10,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -15,13 +15,35 @@
def exp (base exponent : EvmWord) : EvmWord :=
BitVec.ofNat 256 (base.toNat ^ exponent.toNat)
+/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/
+theorem exp_correct (base exponent : EvmWord) :
+ (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6383a7d6a39_12 | cc3056c19e9552fc | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 12 | [
{
"theorem_name": "exp_zero_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [exp_correct]\n decide",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "exp_correct",
"text": "/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/\ntheorem exp_correct (base exponent : EvmWord) :\n (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by\n simp [exp, BitVec.toNat_ofNat]\n\n",
"fan_in": 12,
"n_lines": 6... | [
{
"name": "exp_double_right_of_toNat_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 621,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 7,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -15,14 +15,29 @@
def exp (base exponent : EvmWord) : EvmWord :=
BitVec.ofNat 256 (base.toNat ^ exponent.toNat)
+/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/
+theorem exp_correct (base exponent : EvmWord) :
+ (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6383a7d6a39_13 | 7ec3b10363decb7e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 12 | [
{
"theorem_name": "exp_zero_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [exp_correct]\n decide",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "exp_correct",
"text": "/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/\ntheorem exp_correct (base exponent : EvmWord) :\n (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by\n simp [exp, BitVec.toNat_ofNat]\n\n",
"fan_in": 12,
"n_lines": 6... | [
{
"name": "exp_double_add_one_right_of_toNat_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 27,
"n_chars": 1155,
"n_subproofs": 0,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 11,
"n_structural": 1,
"automation_only"... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -15,15 +15,42 @@
def exp (base exponent : EvmWord) : EvmWord :=
BitVec.ofNat 256 (base.toNat ^ exponent.toNat)
+/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/
+theorem exp_correct (base exponent : EvmWord) :
+ (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6383a7d6a39_14 | f2f539f5dfb867a0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 12 | [
{
"theorem_name": "exp_zero_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [exp_correct]\n decide",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "exp_correct",
"text": "/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/\ntheorem exp_correct (base exponent : EvmWord) :\n (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by\n simp [exp, BitVec.toNat_ofNat]\n\n",
"fan_in": 12,
"n_lines": 6... | [
{
"name": "expSqMulStep_correct",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 23,
"n_chars": 1132,
"n_subproofs": 2,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": false,
"max... | 3 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -15,21 +15,55 @@
def exp (base exponent : EvmWord) : EvmWord :=
BitVec.ofNat 256 (base.toNat ^ exponent.toNat)
+/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/
+theorem exp_correct (base exponent : EvmWord) :
+ (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6383a7d6a39_15 | f8c71fe46a55400e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 3 | [
{
"theorem_name": "exp_max_zero_right",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact exp_zero_right (-1 : EvmWord)",
"n_chars": 41,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
... | [
{
"name": "exp_zero_right",
"text": "/-- Any base raised to the zero EVM word is one. -/\ntheorem exp_zero_right (base : EvmWord) : exp base 0 = 1 := by\n apply BitVec.eq_of_toNat_eq\n rw [exp_correct]\n simp\n\n",
"fan_in": 3,
"n_lines": 7,
"n_chars": 172,
"n_subproofs": 0,
"n_tactic... | [
{
"name": "expSqMulStep_one",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 10,
"n_chars": 481,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 5 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -26,6 +26,12 @@
rw [exp_correct]
decide
+/-- Any base raised to the zero EVM word is one. -/
+theorem exp_zero_right (base : EvmWord) : exp base 0 = 1 := by
+ apply BitVec.eq_of_toNat_eq
+ rw [exp_correct]
+ simp
+
/-- Squaring recurrence for EXP when the next exponent is twice the previous
exponent... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6383a7d6a39_16 | 7233d8b20d1ba345 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 12 | [
{
"theorem_name": "exp_zero_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [exp_correct]\n decide",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "exp_correct",
"text": "/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/\ntheorem exp_correct (base exponent : EvmWord) :\n (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by\n simp [exp, BitVec.toNat_ofNat]\n\n",
"fan_in": 12,
"n_lines": 6... | [
{
"name": "expSqMulFold_exp",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 52,
"n_chars": 2703,
"n_subproofs": 7,
"n_tactics": 40,
"cyclomatic": 2,
"n_automation": 11,
"n_rewrites": 8,
"n_structural": 7,
"automation_only": false,
"max_ne... | 4 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -15,21 +15,55 @@
def exp (base exponent : EvmWord) : EvmWord :=
BitVec.ofNat 256 (base.toNat ^ exponent.toNat)
+/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/
+theorem exp_correct (base exponent : EvmWord) :
+ (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6383a7d6a39_17 | 51c49fc7fa9a08f4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 3 | [
{
"theorem_name": "exp_max_zero_right",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact exp_zero_right (-1 : EvmWord)",
"n_chars": 41,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
... | [
{
"name": "exp_zero_right",
"text": "/-- Any base raised to the zero EVM word is one. -/\ntheorem exp_zero_right (base : EvmWord) : exp base 0 = 1 := by\n apply BitVec.eq_of_toNat_eq\n rw [exp_correct]\n simp\n\n",
"fan_in": 3,
"n_lines": 7,
"n_chars": 172,
"n_subproofs": 0,
"n_tactic... | [
{
"name": "expSqMulFold_one",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 15,
"n_chars": 806,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 6 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -26,6 +26,12 @@
rw [exp_correct]
decide
+/-- Any base raised to the zero EVM word is one. -/
+theorem exp_zero_right (base : EvmWord) : exp base 0 = 1 := by
+ apply BitVec.eq_of_toNat_eq
+ rw [exp_correct]
+ simp
+
/-- Squaring recurrence for EXP when the next exponent is twice the previous
exponent... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6383a7d6a39_18 | 892d8a738ec5cd24 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "bitsToNatMsb_natBitsMsb",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction k generalizing v with\n | zero => simp [natBitsMsb, bitsToNatMsb, Nat.pow_zero, Nat.mod_one]\n | succ ... | [
{
"name": "natBitsMsb_length",
"text": "/-- `natBitsMsb k v` has exactly `k` bits. -/\ntheorem natBitsMsb_length (k v : Nat) : (natBitsMsb k v).length = k := by\n induction k generalizing v with\n | zero => rfl\n | succ k ih => simp [natBitsMsb, ih]\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars":... | [
{
"name": "bitsToNatMsb_natBitsMsb",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 670,
"n_subproofs": 1,
"n_tactics": 14,
"cyclomatic": 5,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
"m... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -50,12 +50,26 @@
| 0, _ => []
| k + 1, v => decide (v / 2 ^ k % 2 = 1) :: natBitsMsb k v
+/-- `natBitsMsb k v` has exactly `k` bits. -/
+theorem natBitsMsb_length (k v : Nat) : (natBitsMsb k v).length = k := by
+ induction k generalizing v with
+ | zero => rfl
+ | succ k ih => simp [natBitsMsb, ih]
+
/--... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6383a7d6a39_19 | d6da3b743e2a99bc | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "bitsToNatMsb_natBitsMsb_toNat",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [bitsToNatMsb_natBitsMsb, Nat.mod_eq_of_lt w.isLt]",
"n_chars": 59,
"n_subproofs": 0,
"n_tacti... | [
{
"name": "bitsToNatMsb_natBitsMsb",
"text": "/-- The MSB-first value of `natBitsMsb k v` is `v` reduced mod `2^k`. -/\ntheorem bitsToNatMsb_natBitsMsb (k v : Nat) :\n bitsToNatMsb (natBitsMsb k v) = v % 2 ^ k := by\n induction k generalizing v with\n | zero => simp [natBitsMsb, bitsToNatMsb, Nat.pow_z... | [
{
"name": "bitsToNatMsb_natBitsMsb_toNat",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 323,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -56,10 +56,26 @@
| zero => rfl
| succ k ih => simp [natBitsMsb, ih]
+/-- The MSB-first value of `natBitsMsb k v` is `v` reduced mod `2^k`. -/
+theorem bitsToNatMsb_natBitsMsb (k v : Nat) :
+ bitsToNatMsb (natBitsMsb k v) = v % 2 ^ k := by
+ induction k generalizing v with
+ | zero => simp [natBitsMsb, 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_c6383a7d6a39_20 | 99fc7c064af7cc6e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "expSqMulStep_correct",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold expSqMulStep\n cases bit with\n | false =>\n show exp base e * exp base e = exp base e'\n have hNext' ... | [
{
"name": "exp_double_add_one_right_of_toNat_eq",
"text": "/-- Square-and-multiply recurrence for EXP when the next exponent is twice the\n previous exponent plus one. -/\ntheorem exp_double_add_one_right_of_toNat_eq\n (base exponent nextExponent : EvmWord)\n (hNext : nextExponent.toNat = 2 * expon... | [
{
"name": "expSqMulFold_natBitsMsb",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 10,
"n_lines": 9,
"n_chars": 539,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"ma... | 10 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -45,6 +45,32 @@
rw [Nat.pow_add]]
rw [← Nat.mul_mod]
+/-- Square-and-multiply recurrence for EXP when the next exponent is twice the
+ previous exponent plus one. -/
+theorem exp_double_add_one_right_of_toNat_eq
+ (base exponent nextExponent : EvmWord)
+ (hNext : nextExponent.toNat = 2 * exponent.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6383a7d6a39_21 | 5e74143364d663d1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 12 | [
{
"theorem_name": "exp_zero_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [exp_correct]\n decide",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "exp_correct",
"text": "/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/\ntheorem exp_correct (base exponent : EvmWord) :\n (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by\n simp [exp, BitVec.toNat_ofNat]\n\n",
"fan_in": 12,
"n_lines": 6... | [
{
"name": "exp_two_64",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 206,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -15,8 +15,16 @@
def exp (base exponent : EvmWord) : EvmWord :=
BitVec.ofNat 256 (base.toNat ^ exponent.toNat)
+/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/
+theorem exp_correct (base exponent : EvmWord) :
+ (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6383a7d6a39_22 | df979557313f4bf4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 12 | [
{
"theorem_name": "exp_zero_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [exp_correct]\n decide",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "exp_correct",
"text": "/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/\ntheorem exp_correct (base exponent : EvmWord) :\n (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by\n simp [exp, BitVec.toNat_ofNat]\n\n",
"fan_in": 12,
"n_lines": 6... | [
{
"name": "exp_two_128",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 208,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -15,8 +15,16 @@
def exp (base exponent : EvmWord) : EvmWord :=
BitVec.ofNat 256 (base.toNat ^ exponent.toNat)
+/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/
+theorem exp_correct (base exponent : EvmWord) :
+ (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6383a7d6a39_23 | 8f046933f9cb003e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Exp.lean | Exp | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 12 | [
{
"theorem_name": "exp_zero_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n rw [exp_correct]\n decide",
"n_chars": 61,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "exp_correct",
"text": "/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/\ntheorem exp_correct (base exponent : EvmWord) :\n (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by\n simp [exp, BitVec.toNat_ofNat]\n\n",
"fan_in": 12,
"n_lines": 6... | [
{
"name": "exp_two_255",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 224,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | /-
EvmAsm.Evm64.EvmWordArith.Exp
Pure EVM EXP semantics over 256-bit words. This is the semantic target for
the executable EXP opcode proof: exponentiation in Nat, reduced modulo 2^256.
-/
import EvmAsm.Evm64.Basic
namespace EvmAsm.Evm64
namespace EvmWord
/-- EVM EXP semantics: `base ^ exponent`, reduced mod... | @@ -15,8 +15,16 @@
def exp (base exponent : EvmWord) : EvmWord :=
BitVec.ofNat 256 (base.toNat ^ exponent.toNat)
+/-- `EvmWord.exp` is Nat exponentiation modulo the 256-bit word modulus. -/
+theorem exp_correct (base exponent : EvmWord) :
+ (exp base exponent).toNat = base.toNat ^ exponent.toNat % 2^256 := by
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_008350ac82e8_0 | 4b4402ab0e96e16c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/V4QHatBoundCounterexamples.lean | V4QHatBoundCounterexamples | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "div128Quot_v4_not_le_q_true_plus_one_under_normalisation",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n ⟨cePlus2_uHi, cePlus2_uLo, cePlus2_vTop,\n cePlus2_vTop_ge_pow63,\n cePlus2_uHi... | [
{
"name": "cePlus2_vTop_ge_pow63",
"text": "/-- Normalisation holds for the overshoot witness. -/\ntheorem cePlus2_vTop_ge_pow63 : cePlus2_vTop.toNat ≥ 2^63 := by decide\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 128,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automat... | [
{
"name": "div128Quot_v4_not_le_q_true_plus_one_under_normalisation",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 17,
"n_chars": 619,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
... | 3 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.V4QHatBoundCounterexamples
Kernel-checked counterexamples refuting the Knuth-A `+1` bound on
`div128Quot_v4` (bead `evm-asm-9iqmw.7.1.4.1`) AND demonstrating that
`div128Quot_v4` can significantly UNDERSHOOT the true quotient.
Found by a python search of the... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.V4QHatBoundCounterexamples
Kernel-checked counterexamples refuting the Knuth-A `+1` bound on
`div128Quot_v4` (bead `evm-asm-9iqmw.7.1.4.1`) AND demonstrating that
`div128Quot_v4` can significantly UNDERSHOOT the true quotient.
Found by a python search of the... | @@ -40,6 +40,9 @@
abbrev cePlus2_uLo : Word := BitVec.ofNat 64 0xC3887FC013FF1573
abbrev cePlus2_vTop : Word := BitVec.ofNat 64 0x928ED451C34118C1
+/-- Normalisation holds for the overshoot witness. -/
+theorem cePlus2_vTop_ge_pow63 : cePlus2_vTop.toNat ≥ 2^63 := by decide
+
/-- Call regime holds for the overshoot... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_008350ac82e8_1 | c22a6a88d06a4495 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/V4QHatBoundCounterexamples.lean | V4QHatBoundCounterexamples | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "div128Quot_v4_not_ge_q_true_minus_pow32_under_normalisation",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n ⟨ceUnd_uHi, ceUnd_uLo, ceUnd_vTop,\n ceUnd_vTop_ge_pow63,\n ceUnd_uHi_lt_vTo... | [
{
"name": "ceUnd_vTop_ge_pow63",
"text": "/-- Normalisation holds for the undershoot witness. -/\ntheorem ceUnd_vTop_ge_pow63 : ceUnd_vTop.toNat ≥ 2^63 := by decide\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 125,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation":... | [
{
"name": "div128Quot_v4_not_ge_q_true_minus_pow32_under_normalisation",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 17,
"n_chars": 622,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
... | 3 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.V4QHatBoundCounterexamples
Kernel-checked counterexamples refuting the Knuth-A `+1` bound on
`div128Quot_v4` (bead `evm-asm-9iqmw.7.1.4.1`) AND demonstrating that
`div128Quot_v4` can significantly UNDERSHOOT the true quotient.
Found by a python search of the... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.V4QHatBoundCounterexamples
Kernel-checked counterexamples refuting the Knuth-A `+1` bound on
`div128Quot_v4` (bead `evm-asm-9iqmw.7.1.4.1`) AND demonstrating that
`div128Quot_v4` can significantly UNDERSHOOT the true quotient.
Found by a python search of the... | @@ -45,6 +45,9 @@
abbrev ceUnd_uLo : Word := BitVec.ofNat 64 0xAB97850C4B79C4F7
abbrev ceUnd_vTop : Word := BitVec.ofNat 64 0x81A6C3EA83EB4E16
+/-- Normalisation holds for the undershoot witness. -/
+theorem ceUnd_vTop_ge_pow63 : ceUnd_vTop.toNat ≥ 2^63 := by decide
+
/-- Call regime holds for the undershoot witne... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_008350ac82e8_2 | 6588c4ab636ce8df | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/V4QHatBoundCounterexamples.lean | V4QHatBoundCounterexamples | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "div128Quot_v4_not_le_q_true_plus_one_under_normalisation",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n ⟨cePlus2_uHi, cePlus2_uLo, cePlus2_vTop,\n cePlus2_vTop_ge_pow63,\n cePlus2_uHi... | [
{
"name": "cePlus2_div128Quot_v4_eq_q_true_plus_two",
"text": "/-- **Bead 7.1.4.1 refutation.** Under just normalisation + call regime,\n `div128Quot_v4` can exceed the true quotient by `2`, refuting the\n Knuth-A `+1` bound. -/\ntheorem cePlus2_div128Quot_v4_eq_q_true_plus_two :\n (div128Quot_v4 c... | [
{
"name": "cePlus2_div128Quot_v4_le_q_true_plus_two",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 545,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only... | 1 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.V4QHatBoundCounterexamples
Kernel-checked counterexamples refuting the Knuth-A `+1` bound on
`div128Quot_v4` (bead `evm-asm-9iqmw.7.1.4.1`) AND demonstrating that
`div128Quot_v4` can significantly UNDERSHOOT the true quotient.
Found by a python search of the... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.V4QHatBoundCounterexamples
Kernel-checked counterexamples refuting the Knuth-A `+1` bound on
`div128Quot_v4` (bead `evm-asm-9iqmw.7.1.4.1`) AND demonstrating that
`div128Quot_v4` can significantly UNDERSHOOT the true quotient.
Found by a python search of the... | @@ -40,6 +40,14 @@
abbrev cePlus2_uLo : Word := BitVec.ofNat 64 0xC3887FC013FF1573
abbrev cePlus2_vTop : Word := BitVec.ofNat 64 0x928ED451C34118C1
+/-- **Bead 7.1.4.1 refutation.** Under just normalisation + call regime,
+ `div128Quot_v4` can exceed the true quotient by `2`, refuting the
+ Knuth-A `+1` bound... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_89868b3f28dc_0 | 9dfd3f0c4e897d47 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV5/NoWrap.lean | NoWrap | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "algorithmQ1cV5_dLo_no_wrap",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [BitVec.toNat_mul]\n apply Nat.mod_eq_of_lt\n have h_q := algorithmQ1cV5_lt_pow32 uHi vTop\n have h_d := ... | [
{
"name": "divKTrialCallV5DLo_lt_pow32",
"text": "/-- The v5 normalized `dLo = (vTop << 32) >> 32` is bounded by `2^32`.\n Mirrors the v4 lemma at `Phase1bBound.lean:138`. -/\ntheorem divKTrialCallV5DLo_lt_pow32 (vTop : Word) :\n (divKTrialCallV5DLo vTop).toNat < 2^32 := by\n unfold divKTrialCallV5DL... | [
{
"name": "algorithmQ1cV5_dLo_no_wrap",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 718,
"n_subproofs": 3,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV5.NoWrap
No-wrap properties for the V5 cap-bounded multiplications: under
`algorithmQ{1,0}cV5 < 2^32` (from `CapBounds`) and `dLo < 2^32`, the
product `q*c * dLo` fits in BitVec 64 unconditionally.
v4's `algorithmQ1dV4_dLo_no_wrap` (Phase1bBound.lean:1007) req... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV5.NoWrap
No-wrap properties for the V5 cap-bounded multiplications: under
`algorithmQ{1,0}cV5 < 2^32` (from `CapBounds`) and `dLo < 2^32`, the
product `q*c * dLo` fits in BitVec 64 unconditionally.
v4's `algorithmQ1dV4_dLo_no_wrap` (Phase1bBound.lean:1007) req... | @@ -19,11 +19,27 @@
open EvmAsm.Rv64
+/-- The v5 normalized `dLo = (vTop << 32) >> 32` is bounded by `2^32`.
+ Mirrors the v4 lemma at `Phase1bBound.lean:138`. -/
+theorem divKTrialCallV5DLo_lt_pow32 (vTop : Word) :
+ (divKTrialCallV5DLo vTop).toNat < 2^32 := by
+ unfold divKTrialCallV5DLo
+ exact Word_ush... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_89868b3f28dc_1 | ef7ef64bc7c0ce35 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV5/NoWrap.lean | NoWrap | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "algorithmQ1cV5_dLo_no_wrap",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [BitVec.toNat_mul]\n apply Nat.mod_eq_of_lt\n have h_q := algorithmQ1cV5_lt_pow32 uHi vTop\n have h_d := ... | [
{
"name": "divKTrialCallV5DLo_lt_pow32",
"text": "/-- The v5 normalized `dLo = (vTop << 32) >> 32` is bounded by `2^32`.\n Mirrors the v4 lemma at `Phase1bBound.lean:138`. -/\ntheorem divKTrialCallV5DLo_lt_pow32 (vTop : Word) :\n (divKTrialCallV5DLo vTop).toNat < 2^32 := by\n unfold divKTrialCallV5DL... | [
{
"name": "algorithmQ0cV5_dLo_no_wrap",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 677,
"n_subproofs": 3,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV5.NoWrap
No-wrap properties for the V5 cap-bounded multiplications: under
`algorithmQ{1,0}cV5 < 2^32` (from `CapBounds`) and `dLo < 2^32`, the
product `q*c * dLo` fits in BitVec 64 unconditionally.
v4's `algorithmQ1dV4_dLo_no_wrap` (Phase1bBound.lean:1007) req... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV5.NoWrap
No-wrap properties for the V5 cap-bounded multiplications: under
`algorithmQ{1,0}cV5 < 2^32` (from `CapBounds`) and `dLo < 2^32`, the
product `q*c * dLo` fits in BitVec 64 unconditionally.
v4's `algorithmQ1dV4_dLo_no_wrap` (Phase1bBound.lean:1007) req... | @@ -19,10 +19,26 @@
open EvmAsm.Rv64
+/-- The v5 normalized `dLo = (vTop << 32) >> 32` is bounded by `2^32`.
+ Mirrors the v4 lemma at `Phase1bBound.lean:138`. -/
+theorem divKTrialCallV5DLo_lt_pow32 (vTop : Word) :
+ (divKTrialCallV5DLo vTop).toNat < 2^32 := by
+ unfold divKTrialCallV5DLo
+ exact Word_ush... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_89868b3f28dc_2 | e8f57c43f34fc7e3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV5/NoWrap.lean | NoWrap | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "algorithmQ1cV5_dLo_no_wrap",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [BitVec.toNat_mul]\n apply Nat.mod_eq_of_lt\n have h_q := algorithmQ1cV5_lt_pow32 uHi vTop\n have h_d := ... | [
{
"name": "divKTrialCallV5DLo_lt_pow32",
"text": "/-- The v5 normalized `dLo = (vTop << 32) >> 32` is bounded by `2^32`.\n Mirrors the v4 lemma at `Phase1bBound.lean:138`. -/\ntheorem divKTrialCallV5DLo_lt_pow32 (vTop : Word) :\n (divKTrialCallV5DLo vTop).toNat < 2^32 := by\n unfold divKTrialCallV5DL... | [
{
"name": "divKTrialCallV5Q0c_dLo_no_wrap",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 424,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV5.NoWrap
No-wrap properties for the V5 cap-bounded multiplications: under
`algorithmQ{1,0}cV5 < 2^32` (from `CapBounds`) and `dLo < 2^32`, the
product `q*c * dLo` fits in BitVec 64 unconditionally.
v4's `algorithmQ1dV4_dLo_no_wrap` (Phase1bBound.lean:1007) req... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV5.NoWrap
No-wrap properties for the V5 cap-bounded multiplications: under
`algorithmQ{1,0}cV5 < 2^32` (from `CapBounds`) and `dLo < 2^32`, the
product `q*c * dLo` fits in BitVec 64 unconditionally.
v4's `algorithmQ1dV4_dLo_no_wrap` (Phase1bBound.lean:1007) req... | @@ -19,10 +19,26 @@
open EvmAsm.Rv64
+/-- The v5 normalized `dLo = (vTop << 32) >> 32` is bounded by `2^32`.
+ Mirrors the v4 lemma at `Phase1bBound.lean:138`. -/
+theorem divKTrialCallV5DLo_lt_pow32 (vTop : Word) :
+ (divKTrialCallV5DLo vTop).toNat < 2^32 := by
+ unfold divKTrialCallV5DLo
+ exact Word_ush... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6cfa2e77dfe9_0 | f75e40e9b2eca053 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerLoopBridge.lean | HandlerLoopBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "stepWithTableHandler_of_lookup",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [stepWithTableHandler_of_decode table h_decode]\n exact HandlerTable.dispatchOpcode_some h_lookup state"... | [
{
"name": "stepWithTableHandler_of_decode",
"text": "theorem stepWithTableHandler_of_decode\n (table : HandlerTable) {state : EvmState} {opcode : EvmOpcode}\n (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some opcode) :\n InterpreterLoop.stepWithHandler (toLoopHandler table) state =\n ... | [
{
"name": "stepWithTableHandler_of_lookup",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 453,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | @@ -25,12 +25,21 @@
toLoopHandler table opcode state =
HandlerTable.dispatchOpcode table opcode state := rfl
+theorem stepWithTableHandler_of_decode
+ (table : HandlerTable) {state : EvmState} {opcode : EvmOpcode}
+ (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some opcode) :
+ Interpr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6cfa2e77dfe9_1 | 54ff8a0f61312c40 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerLoopBridge.lean | HandlerLoopBridge | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "stepWithTableHandler_of_lookup",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [stepWithTableHandler_of_decode table h_decode]\n exact HandlerTable.dispatchOpcode_some h_lookup state"... | [
{
"name": "stepWithTableHandler_of_decode",
"text": "theorem stepWithTableHandler_of_decode\n (table : HandlerTable) {state : EvmState} {opcode : EvmOpcode}\n (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some opcode) :\n InterpreterLoop.stepWithHandler (toLoopHandler table) state =\n ... | [
{
"name": "stepWithTableHandler_of_decode_status",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 386,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": f... | 1 | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | @@ -25,11 +25,19 @@
toLoopHandler table opcode state =
HandlerTable.dispatchOpcode table opcode state := rfl
+theorem stepWithTableHandler_of_decode
+ (table : HandlerTable) {state : EvmState} {opcode : EvmOpcode}
+ (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some opcode) :
+ Interpr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6cfa2e77dfe9_2 | ec0a9a39b0a30a51 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerLoopBridge.lean | HandlerLoopBridge | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "stepWithTableHandler_of_lookup_status",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [stepWithTableHandler_of_lookup h_decode h_lookup]",
"n_chars": 59,
"n_subproofs": 0,
... | [
{
"name": "stepWithTableHandler_of_lookup",
"text": "theorem stepWithTableHandler_of_lookup\n {table : HandlerTable} {state : EvmState} {opcode : EvmOpcode}\n {handler : OpcodeHandler}\n (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some opcode)\n (h_lookup : table opcode = some handl... | [
{
"name": "stepWithTableHandler_of_lookup_status",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 431,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": ... | 2 | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | @@ -32,13 +32,23 @@
HandlerTable.dispatchOpcode table opcode state := by
simp [InterpreterLoop.stepWithHandler, h_decode, toLoopHandler]
+theorem stepWithTableHandler_of_lookup
+ {table : HandlerTable} {state : EvmState} {opcode : EvmOpcode}
+ {handler : OpcodeHandler}
+ (h_decode : InterpreterLoop... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6cfa2e77dfe9_3 | 67be76063c550a52 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerLoopBridge.lean | HandlerLoopBridge | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "stepWithTableHandler_of_lookup_preserves_status",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [stepWithTableHandler_of_lookup_status h_decode h_lookup]\n exact h_status state",
... | [
{
"name": "stepWithTableHandler_of_lookup_status",
"text": "theorem stepWithTableHandler_of_lookup_status\n {table : HandlerTable} {state : EvmState} {opcode : EvmOpcode}\n {handler : OpcodeHandler}\n (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some opcode)\n (h_lookup : table opcod... | [
{
"name": "stepWithTableHandler_of_lookup_preserves_status",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 538,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automati... | 3 | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | @@ -41,6 +41,15 @@
rw [stepWithTableHandler_of_decode table h_decode]
exact HandlerTable.dispatchOpcode_some h_lookup state
+theorem stepWithTableHandler_of_lookup_status
+ {table : HandlerTable} {state : EvmState} {opcode : EvmOpcode}
+ {handler : OpcodeHandler}
+ (h_decode : InterpreterLoop.decodeCur... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6cfa2e77dfe9_4 | 3a1f3f864519169c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerLoopBridge.lean | HandlerLoopBridge | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "stepWithTableHandler_of_lookup_status",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [stepWithTableHandler_of_lookup h_decode h_lookup]",
"n_chars": 59,
"n_subproofs": 0,
... | [
{
"name": "stepWithTableHandler_of_lookup",
"text": "theorem stepWithTableHandler_of_lookup\n {table : HandlerTable} {state : EvmState} {opcode : EvmOpcode}\n {handler : OpcodeHandler}\n (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some opcode)\n (h_lookup : table opcode = some handl... | [
{
"name": "stepWithTableHandler_of_lookup_preserves_codeLenMatches",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 597,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"... | 2 | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | @@ -32,6 +32,15 @@
HandlerTable.dispatchOpcode table opcode state := by
simp [InterpreterLoop.stepWithHandler, h_decode, toLoopHandler]
+theorem stepWithTableHandler_of_lookup
+ {table : HandlerTable} {state : EvmState} {opcode : EvmOpcode}
+ {handler : OpcodeHandler}
+ (h_decode : InterpreterLoop.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6cfa2e77dfe9_5 | 41dc1d8b70028712 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerLoopBridge.lean | HandlerLoopBridge | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "stepWithTableHandler_of_lookup",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [stepWithTableHandler_of_decode table h_decode]\n exact HandlerTable.dispatchOpcode_some h_lookup state"... | [
{
"name": "stepWithTableHandler_of_decode",
"text": "theorem stepWithTableHandler_of_decode\n (table : HandlerTable) {state : EvmState} {opcode : EvmOpcode}\n (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some opcode) :\n InterpreterLoop.stepWithHandler (toLoopHandler table) state =\n ... | [
{
"name": "stepWithTableHandler_missing_invalid",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 421,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": fa... | 1 | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | @@ -25,11 +25,20 @@
toLoopHandler table opcode state =
HandlerTable.dispatchOpcode table opcode state := rfl
+theorem stepWithTableHandler_of_decode
+ (table : HandlerTable) {state : EvmState} {opcode : EvmOpcode}
+ (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some opcode) :
+ Interpr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6cfa2e77dfe9_6 | 3d6c77b68dd9c7ce | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerLoopBridge.lean | HandlerLoopBridge | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "stepWithTableHandler_missing_invalid_status",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [stepWithTableHandler_missing_invalid h_decode h_lookup]\n exact EvmState.invalid_status st... | [
{
"name": "stepWithTableHandler_missing_invalid",
"text": "theorem stepWithTableHandler_missing_invalid\n {table : HandlerTable} {state : EvmState} {opcode : EvmOpcode}\n (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some opcode)\n (h_lookup : table opcode = none) :\n InterpreterLoop.... | [
{
"name": "stepWithTableHandler_missing_invalid_status",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 427,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_o... | 2 | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | @@ -32,12 +32,22 @@
HandlerTable.dispatchOpcode table opcode state := by
simp [InterpreterLoop.stepWithHandler, h_decode, toLoopHandler]
+theorem stepWithTableHandler_missing_invalid
+ {table : HandlerTable} {state : EvmState} {opcode : EvmOpcode}
+ (h_decode : InterpreterLoop.decodeCurrentOpcode? sta... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6cfa2e77dfe9_7 | fb1092fd060bb8b9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerLoopBridge.lean | HandlerLoopBridge | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "stepWithTableHandler_missing_invalid_status",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [stepWithTableHandler_missing_invalid h_decode h_lookup]\n exact EvmState.invalid_status st... | [
{
"name": "stepWithTableHandler_missing_invalid",
"text": "theorem stepWithTableHandler_missing_invalid\n {table : HandlerTable} {state : EvmState} {opcode : EvmOpcode}\n (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some opcode)\n (h_lookup : table opcode = none) :\n InterpreterLoop.... | [
{
"name": "stepWithTableHandler_empty_of_decode",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 359,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": fa... | 2 | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | @@ -32,11 +32,20 @@
HandlerTable.dispatchOpcode table opcode state := by
simp [InterpreterLoop.stepWithHandler, h_decode, toLoopHandler]
+theorem stepWithTableHandler_missing_invalid
+ {table : HandlerTable} {state : EvmState} {opcode : EvmOpcode}
+ (h_decode : InterpreterLoop.decodeCurrentOpcode? sta... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6cfa2e77dfe9_8 | 773d3734ae954a91 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerLoopBridge.lean | HandlerLoopBridge | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "stepWithTableHandler_empty_of_decode_status",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [stepWithTableHandler_empty_of_decode h_decode]\n exact EvmState.invalid_status state",
... | [
{
"name": "stepWithTableHandler_empty_of_decode",
"text": "theorem stepWithTableHandler_empty_of_decode\n {state : EvmState} {opcode : EvmOpcode}\n (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some opcode) :\n InterpreterLoop.stepWithHandler (toLoopHandler HandlerTable.empty) state =\n ... | [
{
"name": "stepWithTableHandler_empty_of_decode_status",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 371,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_on... | 3 | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | @@ -40,11 +40,20 @@
rw [stepWithTableHandler_of_decode table h_decode]
exact HandlerTable.dispatchOpcode_none h_lookup state
+theorem stepWithTableHandler_empty_of_decode
+ {state : EvmState} {opcode : EvmOpcode}
+ (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some opcode) :
+ InterpreterLoo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6cfa2e77dfe9_9 | f55f119543921383 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerLoopBridge.lean | HandlerLoopBridge | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "stepWithTableHandler_eof_invalid_status",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [stepWithTableHandler_eof_invalid table h_pc]\n exact EvmState.invalid_status state",
"n_ch... | [
{
"name": "stepWithTableHandler_eof_invalid",
"text": "theorem stepWithTableHandler_eof_invalid\n (table : HandlerTable) {state : EvmState}\n (h_pc : state.code.length ≤ state.pc) :\n InterpreterLoop.stepWithHandler (toLoopHandler table) state = state.invalid := by\n exact InterpreterLoop.stepWith... | [
{
"name": "stepWithTableHandler_eof_invalid_status",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 318,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only":... | 1 | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | @@ -25,10 +25,18 @@
toLoopHandler table opcode state =
HandlerTable.dispatchOpcode table opcode state := rfl
+theorem stepWithTableHandler_eof_invalid
+ (table : HandlerTable) {state : EvmState}
+ (h_pc : state.code.length ≤ state.pc) :
+ InterpreterLoop.stepWithHandler (toLoopHandler table) stat... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6cfa2e77dfe9_10 | 21a4ef21e45c20c5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerLoopBridge.lean | HandlerLoopBridge | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "stepWithTableHandler_of_lookup",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [stepWithTableHandler_of_decode table h_decode]\n exact HandlerTable.dispatchOpcode_some h_lookup state"... | [
{
"name": "stepWithTableHandler_of_decode",
"text": "theorem stepWithTableHandler_of_decode\n (table : HandlerTable) {state : EvmState} {opcode : EvmOpcode}\n (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some opcode) :\n InterpreterLoop.stepWithHandler (toLoopHandler table) state =\n ... | [
{
"name": "loopFuel_succ_running_decode",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 574,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | @@ -25,13 +25,22 @@
toLoopHandler table opcode state =
HandlerTable.dispatchOpcode table opcode state := rfl
+theorem stepWithTableHandler_of_decode
+ (table : HandlerTable) {state : EvmState} {opcode : EvmOpcode}
+ (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some opcode) :
+ Interpr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6cfa2e77dfe9_11 | 4c35df2336a1b930 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerLoopBridge.lean | HandlerLoopBridge | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "loopFuel_succ_running_decode_status",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loopFuel_succ_running_decode table nSteps h_status h_decode]",
"n_chars": 70,
"n_subproofs"... | [
{
"name": "loopFuel_succ_running_decode",
"text": "theorem loopFuel_succ_running_decode\n (table : HandlerTable) (nSteps : Nat) {state : EvmState} {opcode : EvmOpcode}\n (h_status : state.status = .running)\n (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some opcode) :\n InterpreterLo... | [
{
"name": "loopFuel_succ_running_decode_status",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 524,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fa... | 2 | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | @@ -32,13 +32,24 @@
HandlerTable.dispatchOpcode table opcode state := by
simp [InterpreterLoop.stepWithHandler, h_decode, toLoopHandler]
+theorem loopFuel_succ_running_decode
+ (table : HandlerTable) (nSteps : Nat) {state : EvmState} {opcode : EvmOpcode}
+ (h_status : state.status = .running)
+ (h_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6cfa2e77dfe9_12 | da21d4d424ac516e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerLoopBridge.lean | HandlerLoopBridge | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "loopFuel_succ_running_decode_status",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loopFuel_succ_running_decode table nSteps h_status h_decode]",
"n_chars": 70,
"n_subproofs"... | [
{
"name": "loopFuel_succ_running_decode",
"text": "theorem loopFuel_succ_running_decode\n (table : HandlerTable) (nSteps : Nat) {state : EvmState} {opcode : EvmOpcode}\n (h_status : state.status = .running)\n (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some opcode) :\n InterpreterLo... | [
{
"name": "loopFuel_succ_running_lookup",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 12,
"n_chars": 588,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | @@ -32,6 +32,16 @@
HandlerTable.dispatchOpcode table opcode state := by
simp [InterpreterLoop.stepWithHandler, h_decode, toLoopHandler]
+theorem loopFuel_succ_running_decode
+ (table : HandlerTable) (nSteps : Nat) {state : EvmState} {opcode : EvmOpcode}
+ (h_status : state.status = .running)
+ (h_d... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6cfa2e77dfe9_13 | 67f883a4cdf4686d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerLoopBridge.lean | HandlerLoopBridge | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "loopFuel_succ_running_decode_status",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loopFuel_succ_running_decode table nSteps h_status h_decode]",
"n_chars": 70,
"n_subproofs"... | [
{
"name": "loopFuel_succ_running_decode",
"text": "theorem loopFuel_succ_running_decode\n (table : HandlerTable) (nSteps : Nat) {state : EvmState} {opcode : EvmOpcode}\n (h_status : state.status = .running)\n (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some opcode) :\n InterpreterLo... | [
{
"name": "loopFuel_succ_running_lookup_status",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 11,
"n_chars": 561,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fa... | 3 | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | @@ -32,6 +32,16 @@
HandlerTable.dispatchOpcode table opcode state := by
simp [InterpreterLoop.stepWithHandler, h_decode, toLoopHandler]
+theorem loopFuel_succ_running_decode
+ (table : HandlerTable) (nSteps : Nat) {state : EvmState} {opcode : EvmOpcode}
+ (h_status : state.status = .running)
+ (h_d... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6cfa2e77dfe9_14 | f0bbc7e566983af3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/HandlerLoopBridge.lean | HandlerLoopBridge | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "loopFuel_succ_running_decode_status",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loopFuel_succ_running_decode table nSteps h_status h_decode]",
"n_chars": 70,
"n_subproofs"... | [
{
"name": "loopFuel_succ_running_decode",
"text": "theorem loopFuel_succ_running_decode\n (table : HandlerTable) (nSteps : Nat) {state : EvmState} {opcode : EvmOpcode}\n (h_status : state.status = .running)\n (h_decode : InterpreterLoop.decodeCurrentOpcode? state = some opcode) :\n InterpreterLo... | [
{
"name": "loopFuel_succ_running_missing_invalid",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 12,
"n_chars": 561,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": ... | 2 | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | /-
EvmAsm.Evm64.HandlerLoopBridge
Adapter from handler tables to the pure interpreter loop (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
import EvmAsm.Evm64.InterpreterSimulation
namespace EvmAsm.Evm64
namespace HandlerLoopBridge
/--
Adapt a partial opcode handler table to the total handler expected by
`Inter... | @@ -32,6 +32,16 @@
HandlerTable.dispatchOpcode table opcode state := by
simp [InterpreterLoop.stepWithHandler, h_decode, toLoopHandler]
+theorem loopFuel_succ_running_decode
+ (table : HandlerTable) (nSteps : Nat) {state : EvmState} {opcode : EvmOpcode}
+ (h_status : state.status = .running)
+ (h_d... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.