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_9738ceeea606_7 | e864ffd75b86e295 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceOuterInduction.lean | ReduceOuterInduction | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "evm_mulmod_reduce512_write_result_total_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (hmono := evm_mulmod_reduce512_write_result_code_sub base... | [
{
"name": "evm_mulmod_reduce512_write_result_code_sub",
"text": "/-- `evm_mulmod_reduce512_write_result` sits at byte offset 308 (after `init`\n and the 71-instruction `loop`) within the total reducer program. -/\ntheorem evm_mulmod_reduce512_write_result_code_sub (base : Word) :\n ∀ a i, (CodeReq.ofP... | [
{
"name": "evm_mulmod_reduce512_write_result_regown_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 30,
"n_chars": 1757,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"au... | 2 | /-
EvmAsm.Evm64.MulMod.ReduceOuterInduction
Eight-limb induction for the MULMOD 512-bit reducer outer loop. The outer
loop walks the eight 64-bit product limbs from high to low (`x16` starts at
the top limb and decreases by 8 each iteration), folding each into the
running remainder via the inner bit loop. Un... | /-
EvmAsm.Evm64.MulMod.ReduceOuterInduction
Eight-limb induction for the MULMOD 512-bit reducer outer loop. The outer
loop walks the eight 64-bit product limbs from high to low (`x16` starts at
the top limb and decreases by 8 each iteration), folding each into the
running remainder via the inner bit loop. Un... | @@ -45,6 +45,23 @@
regOwn .x17 ** regOwn .x15 ** regOwn .x19 ** regOwn .x20 **
mulModReduceCompareMem sp r n
+/-- `evm_mulmod_reduce512_write_result` sits at byte offset 308 (after `init`
+ and the 71-instruction `loop`) within the total reducer program. -/
+theorem evm_mulmod_reduce512_write_result_code_sub... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9738ceeea606_8 | f44ad0fd41e48b77 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceOuterInduction.lean | ReduceOuterInduction | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "outer_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 74,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction m with\n | zero => intro h1 _; omega\n | succ k ih =>\n intro _ h8 sp base ptr r n limbs\n rcases Nat.eq_zero_... | [
{
"name": "limbChain_pcFree",
"text": "/-- The product-limb window constrains only memory, never the program counter,\n so it is a valid frame for `cpsTripleWithin_frameR`. -/\ntheorem limbChain_pcFree (ptr : Word) (limbs : Nat → Word) (m : Nat) :\n (limbChain ptr limbs m).pcFree := by\n induction m ... | [
{
"name": "evm_mulmod_reduce512_init_loop_wr_spec_within",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 13,
"n_lines": 57,
"n_chars": 4309,
"n_subproofs": 2,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 2,
"automat... | 12 | /-
EvmAsm.Evm64.MulMod.ReduceOuterInduction
Eight-limb induction for the MULMOD 512-bit reducer outer loop. The outer
loop walks the eight 64-bit product limbs from high to low (`x16` starts at
the top limb and decreases by 8 each iteration), folding each into the
running remainder via the inner bit loop. Un... | /-
EvmAsm.Evm64.MulMod.ReduceOuterInduction
Eight-limb induction for the MULMOD 512-bit reducer outer loop. The outer
loop walks the eight 64-bit product limbs from high to low (`x16` starts at
the top limb and decreases by 8 each iteration), folding each into the
running remainder via the inner bit loop. Un... | @@ -45,6 +45,14 @@
limbChain (ptr + signExtend12 (4088 : BitVec 12)) (fun i => limbs (i + 1)) m) :=
rfl
+/-- The product-limb window constrains only memory, never the program counter,
+ so it is a valid frame for `cpsTripleWithin_frameR`. -/
+theorem limbChain_pcFree (ptr : Word) (limbs : Nat → Word) (... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9738ceeea606_9 | 4a2ddcbc42fbcb99 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceOuterInduction.lean | ReduceOuterInduction | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "outer_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 74,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction m with\n | zero => intro h1 _; omega\n | succ k ih =>\n intro _ h8 sp base ptr r n limbs\n rcases Nat.eq_zero_... | [
{
"name": "limbChain_pcFree",
"text": "/-- The product-limb window constrains only memory, never the program counter,\n so it is a valid frame for `cpsTripleWithin_frameR`. -/\ntheorem limbChain_pcFree (ptr : Word) (limbs : Nat → Word) (m : Nat) :\n (limbChain ptr limbs m).pcFree := by\n induction m ... | [
{
"name": "evm_mulmod_reduce512_spec_within",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 16,
"n_lines": 59,
"n_chars": 5034,
"n_subproofs": 2,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 4,
"n_structural": 2,
"automation_only": fa... | 15 | /-
EvmAsm.Evm64.MulMod.ReduceOuterInduction
Eight-limb induction for the MULMOD 512-bit reducer outer loop. The outer
loop walks the eight 64-bit product limbs from high to low (`x16` starts at
the top limb and decreases by 8 each iteration), folding each into the
running remainder via the inner bit loop. Un... | /-
EvmAsm.Evm64.MulMod.ReduceOuterInduction
Eight-limb induction for the MULMOD 512-bit reducer outer loop. The outer
loop walks the eight 64-bit product limbs from high to low (`x16` starts at
the top limb and decreases by 8 each iteration), folding each into the
running remainder via the inner bit loop. Un... | @@ -45,6 +45,14 @@
limbChain (ptr + signExtend12 (4088 : BitVec 12)) (fun i => limbs (i + 1)) m) :=
rfl
+/-- The product-limb window constrains only memory, never the program counter,
+ so it is a valid frame for `cpsTripleWithin_frameR`. -/
+theorem limbChain_pcFree (ptr : Word) (limbs : Nat → Word) (... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_347da7223396_0 | 344dcd248d810307 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Bn254G1MulPrecompileDispatch.lean | Bn254G1MulPrecompileDispatch | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "dispatch_success_output_length",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatch_success accelerator h_target h_gas h_status]\n simp [Bn254PrecompileResultBridge.mulOutputByte... | [
{
"name": "dispatch_success",
"text": "theorem dispatch_success\n (accelerator : AcceleratorInput -> AcceleratorResult)\n {input : EvmAsm.Evm64.PrecompileInput}\n (h_target : input.target = .bn254Mul)\n (h_gas : gasCost input.input <= input.gas)\n (h_status : (accelerator (acceleratorInput in... | [
{
"name": "dispatch_success_output_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 521,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.EL.Bn254G1MulPrecompileDispatch
Pure EVM BN254 G1 scalar-multiplication precompile framing. Point decoding
and multiplication are supplied by the accelerator boundary; this module
fixes the execution-specs-visible target, fixed gas, call-data slicing, and
common precompile result shape.
-/
import ... | /-
EvmAsm.EL.Bn254G1MulPrecompileDispatch
Pure EVM BN254 G1 scalar-multiplication precompile framing. Point decoding
and multiplication are supplied by the accelerator boundary; this module
fixes the execution-specs-visible target, fixed gas, call-data slicing, and
common precompile result shape.
-/
import ... | @@ -70,6 +70,25 @@
else
EvmAsm.Evm64.PrecompileResult.fail input.gas
+theorem dispatch_success
+ (accelerator : AcceleratorInput -> AcceleratorResult)
+ {input : EvmAsm.Evm64.PrecompileInput}
+ (h_target : input.target = .bn254Mul)
+ (h_gas : gasCost input.input <= input.gas)
+ (h_status : (acc... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b450366ebf55_0 | 3cacc96f0be2765a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/MultiRw.lean | MultiRw | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "copy_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hs0 : signExtend12 (0 : BitVec 12) = (0 : Word) := by decide\n have haddr : rf.get .x12 + signExtend12 (0 : BitVec 12) =... | [
{
"name": "execInstrRF_ld_romiss",
"text": "/-- An `LD` that misses the writable window reads the read-only region;\n stated fully resolved (address and value) for one-`rw` chaining. -/\nprivate theorem execInstrRF_ld_romiss (ro : Region) (rwBase : Word)\n (rf : RegFile) (ws : List (BitVec 8)) (rd rs1... | [
{
"name": "copy_engine",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 33,
"n_chars": 1343,
"n_subproofs": 2,
"n_tactics": 26,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 14,
"n_structural": 2,
"automation_only": false,
"max_nesting... | 2 | /-
EvmAsm.Rv64.SAsm.MultiRw
Multiple writable regions for SAsm functions (bead evm-asm-4ch8f.67).
## The design decision (recorded)
A routine that writes TWO OR MORE independent writable pointers (e.g. a
`dst` buffer via `SB` plus an output-length dword at a separate pointer
via `SD`, with a live gap bet... | /-
EvmAsm.Rv64.SAsm.MultiRw
Multiple writable regions for SAsm functions (bead evm-asm-4ch8f.67).
## The design decision (recorded)
A routine that writes TWO OR MORE independent writable pointers (e.g. a
`dst` buffer via `SB` plus an output-length dword at a separate pointer
via `SD`, with a live gap bet... | @@ -139,6 +139,18 @@
-- Position independence: no PC-relative instructions.
#guard ((twoRwBody 0 []).flatten 0 = (twoRwBody 0 []).flatten 0x80000000)
+/-- An `LD` that misses the writable window reads the read-only region;
+ stated fully resolved (address and value) for one-`rw` chaining. -/
+private theorem exe... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b450366ebf55_1 | 6e6fb5134ff77d85 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/MultiRw.lean | MultiRw | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "twoRwFn_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 39,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n vcgen\n case region => exact ⟨hro, hrwA⟩\n case twoRw.copyA.mem =>\n rintro rf ws A hws ⟨hx10, hx12, hx11, hA⟩\n exac... | [
{
"name": "count_blockVCs",
"text": "/-- Address side conditions of the count block: the store fits region B's\n window at offset 0, aligned. -/\nprivate theorem count_blockVCs (reg : Region) (rf : RegFile)\n (hx11 : rf.get .x11 = cnt) (hw2 : w2.length = 8) :\n blockVCs reg cnt rf w2 countBlock := ... | [
{
"name": "twoRwFn_spec",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 7,
"n_lines": 50,
"n_chars": 2465,
"n_subproofs": 3,
"n_tactics": 39,
"cyclomatic": 5,
"n_automation": 8,
"n_rewrites": 11,
"n_structural": 15,
"automation_only": false,
"max_nesti... | 7 | /-
EvmAsm.Rv64.SAsm.MultiRw
Multiple writable regions for SAsm functions (bead evm-asm-4ch8f.67).
## The design decision (recorded)
A routine that writes TWO OR MORE independent writable pointers (e.g. a
`dst` buffer via `SB` plus an output-length dword at a separate pointer
via `SD`, with a live gap bet... | /-
EvmAsm.Rv64.SAsm.MultiRw
Multiple writable regions for SAsm functions (bead evm-asm-4ch8f.67).
## The design decision (recorded)
A routine that writes TWO OR MORE independent writable pointers (e.g. a
`dst` buffer via `SB` plus an output-length dword at a separate pointer
via `SD`, with a live gap bet... | @@ -249,6 +249,20 @@
· rw [haddr2, show ((dst - dst : Word)).toNat = 0 from by bv_omega]
exact ⟨0, rfl⟩
+/-- Address side conditions of the count block: the store fits region B's
+ window at offset 0, aligned. -/
+private theorem count_blockVCs (reg : Region) (rf : RegFile)
+ (hx11 : rf.get .x11 = c... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_191e74369f6e_0 | 4d55e13a95bfa858 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Proofs/JumpdestBitmap.lean | JumpdestBitmap | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "bitmapBit_setBit",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold bitmapBit\n by_cases hbyte : idx / 8 = pc / 8\n · rw [hbyte, getD_set_self hlen, BitVec.getLsbD_or,\n mask_g... | [
{
"name": "getD_set_ne",
"text": "private theorem getD_set_ne {l : List (BitVec 8)} {i j : Nat} {b d : BitVec 8}\n (h : i ≠ j) : (l.set i b).getD j d = l.getD j d := by\n rw [List.getD_eq_getElem?_getD, List.getElem?_set_ne h, List.getD_eq_getElem?_getD]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_c... | [
{
"name": "bitmapBit_setBit",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 17,
"n_chars": 863,
"n_subproofs": 2,
"n_tactics": 11,
"cyclomatic": 3,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"max_nest... | 3 | /-
EvmAsm.Codegen.Proofs.JumpdestBitmap
The jumpdest-bitmap prologue's build loop (bead `evm-asm-cfjzu`, child of
`.49.2`). The dispatcher precomputes, once before the main loop, a bit per
code byte marking the valid JUMPDEST positions (`emitJumpdestBitmapBuild`,
`Dispatch.lean:142-206`); JUMP/JUMPI then te... | /-
EvmAsm.Codegen.Proofs.JumpdestBitmap
The jumpdest-bitmap prologue's build loop (bead `evm-asm-cfjzu`, child of
`.49.2`). The dispatcher precomputes, once before the main loop, a bit per
code byte marking the valid JUMPDEST positions (`emitJumpdestBitmapBuild`,
`Dispatch.lean:142-206`); JUMP/JUMPI then te... | @@ -40,6 +40,10 @@
(h : i < l.length) : (l.set i b).getD i d = b := by
rw [List.getD_eq_getElem?_getD, List.getElem?_set_self h]; rfl
+private theorem getD_set_ne {l : List (BitVec 8)} {i j : Nat} {b d : BitVec 8}
+ (h : i ≠ j) : (l.set i b).getD j d = l.getD j d := by
+ rw [List.getD_eq_getElem?_getD, Li... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_191e74369f6e_1 | 501f04e61d5b6fb5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Proofs/JumpdestBitmap.lean | JumpdestBitmap | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "jdset_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hsub : codeBase + BitVec.ofNat 64 pc - codeBase = BitVec.ofNat 64 pc := by bv_omega\n have hsh : ((BitVec.ofNat 64 pc) ... | [
{
"name": "truncate_zext_or",
"text": "private theorem truncate_zext_or (a : BitVec 8) (b : BitVec 64) :\n BitVec.truncate 8 (a.zeroExtend 64 ||| b) = a ||| BitVec.truncate 8 b := by\n apply BitVec.eq_of_getLsbD_eq; intro i hi\n by_cases h : (i : Nat) < 8 <;>\n simp [BitVec.getLsbD_or, BitVec.getLsb... | [
{
"name": "jdset_engine",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 42,
"n_chars": 2868,
"n_subproofs": 6,
"n_tactics": 30,
"cyclomatic": 1,
"n_automation": 10,
"n_rewrites": 10,
"n_structural": 3,
"automation_only": false,
"max_nesti... | 1 | /-
EvmAsm.Codegen.Proofs.JumpdestBitmap
The jumpdest-bitmap prologue's build loop (bead `evm-asm-cfjzu`, child of
`.49.2`). The dispatcher precomputes, once before the main loop, a bit per
code byte marking the valid JUMPDEST positions (`emitJumpdestBitmapBuild`,
`Dispatch.lean:142-206`); JUMP/JUMPI then te... | /-
EvmAsm.Codegen.Proofs.JumpdestBitmap
The jumpdest-bitmap prologue's build loop (bead `evm-asm-cfjzu`, child of
`.49.2`). The dispatcher precomputes, once before the main loop, a bit per
code byte marking the valid JUMPDEST positions (`emitJumpdestBitmapBuild`,
`Dispatch.lean:142-206`); JUMP/JUMPI then te... | @@ -152,6 +152,12 @@
body := .«while» "scan" (.bltu .x5 .x6) code.length (scanInv codeBase bitmapBase code) scanBody
/-! ## Unsigned-compare bridges for the scan pointer (no address wraparound) -/
+private theorem truncate_zext_or (a : BitVec 8) (b : BitVec 64) :
+ BitVec.truncate 8 (a.zeroExtend 64 ||| b) = a... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_191e74369f6e_2 | e78d43311c1814f9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Proofs/JumpdestBitmap.lean | JumpdestBitmap | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "eip8024ImmArm_step",
"depth": 1,
"n_commands": 0,
"n_lines": 187,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hse1 : signExtend12 (1 : BitVec 12) = (1 : Word) := by decide\n have hse2 : signExtend12 (2 : BitVec 12) = (2 : ... | [
{
"name": "plainArm_exec",
"text": "/-- `execBlock` of the plain arm (over an abstract entry `rf`), so the leaves\n apply it without unfolding the block over a deeply-nested register file. -/\ntheorem plainArm_exec (reg : Region) (rwB : Word) (rf : RegFile) (ws : List (BitVec 8)) :\n execBlock reg rwB... | [
{
"name": "eip8024ImmArm_step",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 219,
"n_chars": 11799,
"n_subproofs": 47,
"n_tactics": 192,
"cyclomatic": 8,
"n_automation": 46,
"n_rewrites": 37,
"n_structural": 35,
"automation_only": false,
... | 2 | /-
EvmAsm.Codegen.Proofs.JumpdestBitmap
The jumpdest-bitmap prologue's build loop (bead `evm-asm-cfjzu`, child of
`.49.2`). The dispatcher precomputes, once before the main loop, a bit per
code byte marking the valid JUMPDEST positions (`emitJumpdestBitmapBuild`,
`Dispatch.lean:142-206`); JUMP/JUMPI then te... | /-
EvmAsm.Codegen.Proofs.JumpdestBitmap
The jumpdest-bitmap prologue's build loop (bead `evm-asm-cfjzu`, child of
`.49.2`). The dispatcher precomputes, once before the main loop, a bit per
code byte marking the valid JUMPDEST positions (`emitJumpdestBitmapBuild`,
`Dispatch.lean:142-206`); JUMP/JUMPI then te... | @@ -152,6 +152,12 @@
body := .«while» "scan" (.bltu .x5 .x6) code.length (scanInv codeBase bitmapBase code) scanBody
/-! ## Unsigned-compare bridges for the scan pointer (no address wraparound) -/
+/-- `execBlock` of the plain arm (over an abstract entry `rf`), so the leaves
+ apply it without unfolding the bl... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_191e74369f6e_3 | 139801d1adcb7619 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Proofs/JumpdestBitmap.lean | JumpdestBitmap | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "scanFn_inv_step",
"depth": 1,
"n_commands": 0,
"n_lines": 286,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases hsp with h | h\n · -- JUMPDEST arm\n obtain ⟨rfB, wsB, hwsBlen, hR2jd, hrfe, hwse⟩ := h\n obtain ⟨h... | [
{
"name": "lt_of_ult",
"text": "/-- `x5 <u x6` holding forces the pointer below the code end. -/\nprivate theorem lt_of_ult (cb : Word) (a b : Nat) (hb : cb.toNat + b < 2 ^ 64)\n (ha : cb.toNat + a < 2 ^ 64)\n (h : BitVec.ult (cb + BitVec.ofNat 64 a) (cb + BitVec.ofNat 64 b) = true) : a < b := by\n s... | [
{
"name": "scanFn_inv_step",
"fan_in": 1,
"n_deps_direct": 6,
"n_deps_transitive": 10,
"n_lines": 300,
"n_chars": 19465,
"n_subproofs": 95,
"n_tactics": 337,
"cyclomatic": 4,
"n_automation": 125,
"n_rewrites": 119,
"n_structural": 46,
"automation_only": false,
... | 10 | /-
EvmAsm.Codegen.Proofs.JumpdestBitmap
The jumpdest-bitmap prologue's build loop (bead `evm-asm-cfjzu`, child of
`.49.2`). The dispatcher precomputes, once before the main loop, a bit per
code byte marking the valid JUMPDEST positions (`emitJumpdestBitmapBuild`,
`Dispatch.lean:142-206`); JUMP/JUMPI then te... | /-
EvmAsm.Codegen.Proofs.JumpdestBitmap
The jumpdest-bitmap prologue's build loop (bead `evm-asm-cfjzu`, child of
`.49.2`). The dispatcher precomputes, once before the main loop, a bit per
code byte marking the valid JUMPDEST positions (`emitJumpdestBitmapBuild`,
`Dispatch.lean:142-206`); JUMP/JUMPI then te... | @@ -182,6 +182,13 @@
body := .«while» "scan" (.bltu .x5 .x6) code.length (scanInv codeBase bitmapBase code) scanBody
/-! ## Unsigned-compare bridges for the scan pointer (no address wraparound) -/
+/-- `x5 <u x6` holding forces the pointer below the code end. -/
+private theorem lt_of_ult (cb : Word) (a b : 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_191e74369f6e_4 | d4b90ea7e2904733 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Proofs/JumpdestBitmap.lean | JumpdestBitmap | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "scanFn_inv_step",
"depth": 1,
"n_commands": 0,
"n_lines": 286,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases hsp with h | h\n · -- JUMPDEST arm\n obtain ⟨rfB, wsB, hwsBlen, hR2jd, hrfe, hwse⟩ := h\n obtain ⟨h... | [
{
"name": "lt_of_ult",
"text": "/-- `x5 <u x6` holding forces the pointer below the code end. -/\nprivate theorem lt_of_ult (cb : Word) (a b : Nat) (hb : cb.toNat + b < 2 ^ 64)\n (ha : cb.toNat + a < 2 ^ 64)\n (h : BitVec.ult (cb + BitVec.ofNat 64 a) (cb + BitVec.ofNat 64 b) = true) : a < b := by\n s... | [
{
"name": "scanFn_spec",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 14,
"n_lines": 110,
"n_chars": 6425,
"n_subproofs": 28,
"n_tactics": 111,
"cyclomatic": 7,
"n_automation": 43,
"n_rewrites": 33,
"n_structural": 22,
"automation_only": false,
"max_n... | 14 | /-
EvmAsm.Codegen.Proofs.JumpdestBitmap
The jumpdest-bitmap prologue's build loop (bead `evm-asm-cfjzu`, child of
`.49.2`). The dispatcher precomputes, once before the main loop, a bit per
code byte marking the valid JUMPDEST positions (`emitJumpdestBitmapBuild`,
`Dispatch.lean:142-206`); JUMP/JUMPI then te... | /-
EvmAsm.Codegen.Proofs.JumpdestBitmap
The jumpdest-bitmap prologue's build loop (bead `evm-asm-cfjzu`, child of
`.49.2`). The dispatcher precomputes, once before the main loop, a bit per
code byte marking the valid JUMPDEST positions (`emitJumpdestBitmapBuild`,
`Dispatch.lean:142-206`); JUMP/JUMPI then te... | @@ -210,6 +210,13 @@
simp only [BitVec.ult, decide_eq_true_eq, Nat.not_lt, BitVec.toNat_add, BitVec.toNat_ofNat]
omega
+/-- `x5 <u x6` holding forces the pointer below the code end. -/
+private theorem lt_of_ult (cb : Word) (a b : Nat) (hb : cb.toNat + b < 2 ^ 64)
+ (ha : cb.toNat + a < 2 ^ 64)
+ (h : Bit... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_254cff1e62dd_0 | 83117072362cc3dd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopBody/TrialCallPath.lean | TrialCallPath | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 6 | [
{
"theorem_name": "divK_trial_call_path_spec_within_exact_x1",
"depth": 1,
"n_commands": 0,
"n_lines": 68,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Reuse the bundled `div128SpecPost` from `Compose/Div128Post.lean`. The\n -- post atoms here ... | [
{
"name": "lb_jal_ret",
"text": "private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr\n\n",
"fan_in": 6,
"n_lines": 3,
"n_chars": 116,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrit... | [
{
"name": "divK_trial_call_path_spec_within_exact_x1",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 87,
"n_chars": 4304,
"n_subproofs": 6,
"n_tactics": 57,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 2,
"automation_o... | 2 | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | @@ -28,6 +28,8 @@
private theorem lb_jal_target {base : Word} : (base + trialJalOff : Word) + signExtend21 (560 : BitVec 21) = base + div128Off := by
rv64_addr
+private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr
+
/-- Trial call path: JAL x2 560 (in... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_254cff1e62dd_1 | 7ec1560b3a43c875 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopBody/TrialCallPath.lean | TrialCallPath | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 6 | [
{
"theorem_name": "divK_trial_call_path_spec_within_exact_x1",
"depth": 1,
"n_commands": 0,
"n_lines": 68,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Reuse the bundled `div128SpecPost` from `Compose/Div128Post.lean`. The\n -- post atoms here ... | [
{
"name": "lb_jal_ret",
"text": "private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr\n\n",
"fan_in": 6,
"n_lines": 3,
"n_chars": 116,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrit... | [
{
"name": "divK_trial_call_path_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 24,
"n_chars": 1309,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": fals... | 3 | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | @@ -28,6 +28,8 @@
private theorem lb_jal_target {base : Word} : (base + trialJalOff : Word) + signExtend21 (560 : BitVec 21) = base + div128Off := by
rv64_addr
+private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr
+
/-- Trial call path: JAL x2 560 (in... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_254cff1e62dd_2 | 59644396aa1ff590 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopBody/TrialCallPath.lean | TrialCallPath | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 6 | [
{
"theorem_name": "divK_trial_call_path_spec_within_exact_x1",
"depth": 1,
"n_commands": 0,
"n_lines": 68,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Reuse the bundled `div128SpecPost` from `Compose/Div128Post.lean`. The\n -- post atoms here ... | [
{
"name": "lb_jal_ret",
"text": "private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr\n\n",
"fan_in": 6,
"n_lines": 3,
"n_chars": 116,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrit... | [
{
"name": "divK_trial_call_path_v4_spec_within_exact_x1",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 49,
"n_chars": 2425,
"n_subproofs": 6,
"n_tactics": 28,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 2,
"automatio... | 2 | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | @@ -28,6 +28,8 @@
private theorem lb_jal_target {base : Word} : (base + trialJalOff : Word) + signExtend21 (560 : BitVec 21) = base + div128Off := by
rv64_addr
+private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr
+
/-- Trial call path over `sharedDiv... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_254cff1e62dd_3 | 122c3836bb9c6130 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopBody/TrialCallPath.lean | TrialCallPath | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 6 | [
{
"theorem_name": "divK_trial_call_path_spec_within_exact_x1",
"depth": 1,
"n_commands": 0,
"n_lines": 68,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Reuse the bundled `div128SpecPost` from `Compose/Div128Post.lean`. The\n -- post atoms here ... | [
{
"name": "lb_jal_ret",
"text": "private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr\n\n",
"fan_in": 6,
"n_lines": 3,
"n_chars": 116,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrit... | [
{
"name": "divK_trial_call_path_v4_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 26,
"n_chars": 1291,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": f... | 3 | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | @@ -28,6 +28,8 @@
private theorem lb_jal_target {base : Word} : (base + trialJalOff : Word) + signExtend21 (560 : BitVec 21) = base + div128Off := by
rv64_addr
+private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr
+
/-- Trial call path over `sharedDiv... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_254cff1e62dd_4 | b625e37bd6d8c9c4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopBody/TrialCallPath.lean | TrialCallPath | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 6 | [
{
"theorem_name": "divK_trial_call_path_spec_within_exact_x1",
"depth": 1,
"n_commands": 0,
"n_lines": 68,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Reuse the bundled `div128SpecPost` from `Compose/Div128Post.lean`. The\n -- post atoms here ... | [
{
"name": "lb_jal_ret",
"text": "private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr\n\n",
"fan_in": 6,
"n_lines": 3,
"n_chars": 116,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrit... | [
{
"name": "divK_trial_call_path_spec_within_noNop_exact_x1",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 76,
"n_chars": 3619,
"n_subproofs": 6,
"n_tactics": 57,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 2,
"automa... | 2 | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | @@ -28,6 +28,8 @@
private theorem lb_jal_target {base : Word} : (base + trialJalOff : Word) + signExtend21 (560 : BitVec 21) = base + div128Off := by
rv64_addr
+private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr
+
/-- Trial call path over `divCode_n... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_254cff1e62dd_5 | b4c157dc1badc601 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopBody/TrialCallPath.lean | TrialCallPath | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 6 | [
{
"theorem_name": "divK_trial_call_path_spec_within_exact_x1",
"depth": 1,
"n_commands": 0,
"n_lines": 68,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Reuse the bundled `div128SpecPost` from `Compose/Div128Post.lean`. The\n -- post atoms here ... | [
{
"name": "lb_jal_ret",
"text": "private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr\n\n",
"fan_in": 6,
"n_lines": 3,
"n_chars": 116,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrit... | [
{
"name": "divK_trial_call_path_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 23,
"n_chars": 1230,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only"... | 3 | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | @@ -28,6 +28,8 @@
private theorem lb_jal_target {base : Word} : (base + trialJalOff : Word) + signExtend21 (560 : BitVec 21) = base + div128Off := by
rv64_addr
+private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr
+
/-- Trial call path over `divCode_n... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_254cff1e62dd_6 | 6feb2385beff3a7b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopBody/TrialCallPath.lean | TrialCallPath | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 6 | [
{
"theorem_name": "divK_trial_call_path_spec_within_exact_x1",
"depth": 1,
"n_commands": 0,
"n_lines": 68,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Reuse the bundled `div128SpecPost` from `Compose/Div128Post.lean`. The\n -- post atoms here ... | [
{
"name": "lb_jal_ret",
"text": "private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr\n\n",
"fan_in": 6,
"n_lines": 3,
"n_chars": 116,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrit... | [
{
"name": "divK_trial_call_path_v4_spec_within_noNop_preserving_x1",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 47,
"n_chars": 2422,
"n_subproofs": 6,
"n_tactics": 26,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
... | 2 | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | @@ -28,6 +28,8 @@
private theorem lb_jal_target {base : Word} : (base + trialJalOff : Word) + signExtend21 (560 : BitVec 21) = base + div128Off := by
rv64_addr
+private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr
+
/-- Trial call path over `sharedDiv... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_254cff1e62dd_7 | 98407ff40c391ff8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopBody/TrialCallPath.lean | TrialCallPath | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 6 | [
{
"theorem_name": "divK_trial_call_path_spec_within_exact_x1",
"depth": 1,
"n_commands": 0,
"n_lines": 68,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Reuse the bundled `div128SpecPost` from `Compose/Div128Post.lean`. The\n -- post atoms here ... | [
{
"name": "lb_jal_ret",
"text": "private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr\n\n",
"fan_in": 6,
"n_lines": 3,
"n_chars": 116,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrit... | [
{
"name": "divK_trial_call_path_v4_spec_within_noNop_exact_x1",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 30,
"n_chars": 1550,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"auto... | 3 | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | @@ -28,6 +28,8 @@
private theorem lb_jal_target {base : Word} : (base + trialJalOff : Word) + signExtend21 (560 : BitVec 21) = base + div128Off := by
rv64_addr
+private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr
+
/-- Trial call path over `sharedDiv... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_254cff1e62dd_8 | a274a579e79e21af | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopBody/TrialCallPath.lean | TrialCallPath | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 6 | [
{
"theorem_name": "divK_trial_call_path_spec_within_exact_x1",
"depth": 1,
"n_commands": 0,
"n_lines": 68,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Reuse the bundled `div128SpecPost` from `Compose/Div128Post.lean`. The\n -- post atoms here ... | [
{
"name": "lb_jal_ret",
"text": "private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr\n\n",
"fan_in": 6,
"n_lines": 3,
"n_chars": 116,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrit... | [
{
"name": "divK_trial_call_path_v4_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 26,
"n_chars": 1313,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_on... | 4 | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | @@ -28,6 +28,8 @@
private theorem lb_jal_target {base : Word} : (base + trialJalOff : Word) + signExtend21 (560 : BitVec 21) = base + div128Off := by
rv64_addr
+private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr
+
/-- Trial call path over `sharedDiv... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_254cff1e62dd_9 | f83f116537e5f58e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopBody/TrialCallPath.lean | TrialCallPath | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 6 | [
{
"theorem_name": "divK_trial_call_path_spec_within_exact_x1",
"depth": 1,
"n_commands": 0,
"n_lines": 68,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Reuse the bundled `div128SpecPost` from `Compose/Div128Post.lean`. The\n -- post atoms here ... | [
{
"name": "lb_jal_ret",
"text": "private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr\n\n",
"fan_in": 6,
"n_lines": 3,
"n_chars": 116,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrit... | [
{
"name": "divK_trial_call_path_v5_spec_within_exact_x1",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 49,
"n_chars": 2425,
"n_subproofs": 6,
"n_tactics": 28,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 2,
"automatio... | 2 | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | @@ -28,6 +28,8 @@
private theorem lb_jal_target {base : Word} : (base + trialJalOff : Word) + signExtend21 (560 : BitVec 21) = base + div128Off := by
rv64_addr
+private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr
+
/-- Trial call path over `sharedDiv... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_254cff1e62dd_10 | f50d51d5a37c48bf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopBody/TrialCallPath.lean | TrialCallPath | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 6 | [
{
"theorem_name": "divK_trial_call_path_spec_within_exact_x1",
"depth": 1,
"n_commands": 0,
"n_lines": 68,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Reuse the bundled `div128SpecPost` from `Compose/Div128Post.lean`. The\n -- post atoms here ... | [
{
"name": "lb_jal_ret",
"text": "private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr\n\n",
"fan_in": 6,
"n_lines": 3,
"n_chars": 116,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrit... | [
{
"name": "divK_trial_call_path_v5_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 26,
"n_chars": 1291,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": f... | 3 | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | @@ -28,6 +28,8 @@
private theorem lb_jal_target {base : Word} : (base + trialJalOff : Word) + signExtend21 (560 : BitVec 21) = base + div128Off := by
rv64_addr
+private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr
+
/-- Trial call path over `sharedDiv... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_254cff1e62dd_11 | a1b11fb8fcc2de6b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopBody/TrialCallPath.lean | TrialCallPath | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 6 | [
{
"theorem_name": "divK_trial_call_path_spec_within_exact_x1",
"depth": 1,
"n_commands": 0,
"n_lines": 68,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Reuse the bundled `div128SpecPost` from `Compose/Div128Post.lean`. The\n -- post atoms here ... | [
{
"name": "lb_jal_ret",
"text": "private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr\n\n",
"fan_in": 6,
"n_lines": 3,
"n_chars": 116,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrit... | [
{
"name": "divK_trial_call_path_v5_spec_within_noNop_preserving_x1",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 47,
"n_chars": 2422,
"n_subproofs": 6,
"n_tactics": 26,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
... | 2 | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | @@ -28,6 +28,8 @@
private theorem lb_jal_target {base : Word} : (base + trialJalOff : Word) + signExtend21 (560 : BitVec 21) = base + div128Off := by
rv64_addr
+private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr
+
/-- Trial call path over `sharedDiv... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_254cff1e62dd_12 | 89afdaa93e84b442 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopBody/TrialCallPath.lean | TrialCallPath | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 6 | [
{
"theorem_name": "divK_trial_call_path_spec_within_exact_x1",
"depth": 1,
"n_commands": 0,
"n_lines": 68,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Reuse the bundled `div128SpecPost` from `Compose/Div128Post.lean`. The\n -- post atoms here ... | [
{
"name": "lb_jal_ret",
"text": "private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr\n\n",
"fan_in": 6,
"n_lines": 3,
"n_chars": 116,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrit... | [
{
"name": "divK_trial_call_path_v5_spec_within_noNop_exact_x1",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 30,
"n_chars": 1550,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"auto... | 3 | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | @@ -28,6 +28,8 @@
private theorem lb_jal_target {base : Word} : (base + trialJalOff : Word) + signExtend21 (560 : BitVec 21) = base + div128Off := by
rv64_addr
+private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr
+
/-- Trial call path over `sharedDiv... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_254cff1e62dd_13 | 63378f0100cef9e6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopBody/TrialCallPath.lean | TrialCallPath | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 6 | [
{
"theorem_name": "divK_trial_call_path_spec_within_exact_x1",
"depth": 1,
"n_commands": 0,
"n_lines": 68,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Reuse the bundled `div128SpecPost` from `Compose/Div128Post.lean`. The\n -- post atoms here ... | [
{
"name": "lb_jal_ret",
"text": "private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr\n\n",
"fan_in": 6,
"n_lines": 3,
"n_chars": 116,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrit... | [
{
"name": "divK_trial_call_path_v5_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 26,
"n_chars": 1313,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_on... | 4 | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | /-
EvmAsm.Evm64.DivMod.LoopBody.TrialCallPath
Extracted from `LoopBody.lean` (Section 8b).
`divK_trial_call_path_spec_within`: trial-quotient TAKEN path (uHi < vTop) —
JAL x2 560 (instr [16]) at base+512 + div128 subroutine, returning
to base+516 with x11 = q.
Address-normalization helpers `lb_jal_target... | @@ -28,6 +28,8 @@
private theorem lb_jal_target {base : Word} : (base + trialJalOff : Word) + signExtend21 (560 : BitVec 21) = base + div128Off := by
rv64_addr
+private theorem lb_jal_ret {base : Word} : (base + trialJalOff : Word) + 4 = base + div128CallRetOff := by bv_addr
+
/-- Trial call path over `sharedDiv... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_db66011618f8_0 | 425666cbf6b5c4b7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase6WriteOutput.lean | Phase6WriteOutput | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "readBytes_of_bytesRegion",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Generalised: reading `n` bytes from offset `off` returns `(bs.drop off).take n`.\n have key : ∀ n off, off + ... | [
{
"name": "getByte_of_bytesRegion",
"text": "/-- **A byte read from a held `bytesRegion`.** When `bytesRegion regionBase bs ** R` holds in `s`\n (region dword-aligned, byte `i` in range, no address overflow), `s.getByte (regionBase + i)`\n is `bs[i]` — the `holdsFor`-level byte read underlying `bytesR... | [
{
"name": "readBytes_of_bytesRegion",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 34,
"n_chars": 1816,
"n_subproofs": 3,
"n_tactics": 18,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 4,
"automation_only": false,
... | 1 | /-
EvmAsm.Rv64.RLP.Phase6WriteOutput
EL.3 / Phase 6 — the pipeline's output half. The `write_output` syscall appends
`readBytes ptr size` (byte-granular) to the public output; the decoder leaves its result as a
`bytesRegion` (dword-packed). This file bridges them — `readBytes_of_bytesRegion`: when
`bytesRegi... | /-
EvmAsm.Rv64.RLP.Phase6WriteOutput
EL.3 / Phase 6 — the pipeline's output half. The `write_output` syscall appends
`readBytes ptr size` (byte-granular) to the public output; the decoder leaves its result as a
`bytesRegion` (dword-packed). This file bridges them — `readBytes_of_bytesRegion`: when
`bytesRegi... | @@ -21,6 +21,31 @@
Assertion.PCFree (bytesRegion regionBase bs) :=
⟨bytesRegion_pcFree _ _⟩
+/-- **A byte read from a held `bytesRegion`.** When `bytesRegion regionBase bs ** R` holds in `s`
+ (region dword-aligned, byte `i` in range, no address overflow), `s.getByte (regionBase + i)`
+ is `bs[i]` — the... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_db66011618f8_1 | d5930f65fa4910e3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase6WriteOutput.lean | Phase6WriteOutput | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "holdsFor_sepConj_publicValuesIs_appendPublicValues",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨hp, hcompat, h1, h2, hdisj, hunion, hh1, hh2⟩ := hPR\n rw [publicValuesIs] at ... | [
{
"name": "compatibleWith_appendPublicValues",
"text": "/-- If a partial state doesn't own the public values, then appending to the\n public-values stream preserves compatibility (the `appendPublicValues`\n analogue of `PartialState.CompatibleWith_setMem`). -/\ntheorem compatibleWith_appendPublicValue... | [
{
"name": "holdsFor_sepConj_publicValuesIs_appendPublicValues",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 50,
"n_chars": 3250,
"n_subproofs": 7,
"n_tactics": 31,
"cyclomatic": 2,
"n_automation": 12,
"n_rewrites": 4,
"n_structural": 5,
"au... | 1 | /-
EvmAsm.Rv64.RLP.Phase6WriteOutput
EL.3 / Phase 6 — the pipeline's output half. The `write_output` syscall appends
`readBytes ptr size` (byte-granular) to the public output; the decoder leaves its result as a
`bytesRegion` (dword-packed). This file bridges them — `readBytes_of_bytesRegion`: when
`bytesRegi... | /-
EvmAsm.Rv64.RLP.Phase6WriteOutput
EL.3 / Phase 6 — the pipeline's output half. The `write_output` syscall appends
`readBytes ptr size` (byte-granular) to the public output; the decoder leaves its result as a
`bytesRegion` (dword-packed). This file bridges them — `readBytes_of_bytesRegion`: when
`bytesRegi... | @@ -21,6 +21,22 @@
Assertion.PCFree (bytesRegion regionBase bs) :=
⟨bytesRegion_pcFree _ _⟩
+/-- If a partial state doesn't own the public values, then appending to the
+ public-values stream preserves compatibility (the `appendPublicValues`
+ analogue of `PartialState.CompatibleWith_setMem`). -/
+theor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_db66011618f8_2 | 06c0623c0ae72df2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase6WriteOutput.lean | Phase6WriteOutput | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "holdsFor_sepConj_publicValuesIs_appendPublicValues",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨hp, hcompat, h1, h2, hdisj, hunion, hh1, hh2⟩ := hPR\n rw [publicValuesIs] at ... | [
{
"name": "compatibleWith_appendPublicValues",
"text": "/-- If a partial state doesn't own the public values, then appending to the\n public-values stream preserves compatibility (the `appendPublicValues`\n analogue of `PartialState.CompatibleWith_setMem`). -/\ntheorem compatibleWith_appendPublicValue... | [
{
"name": "ecall_write_output_spec_gen_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 79,
"n_chars": 4491,
"n_subproofs": 15,
"n_tactics": 51,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 4,
"n_structural": 9,
"automation_only": ... | 4 | /-
EvmAsm.Rv64.RLP.Phase6WriteOutput
EL.3 / Phase 6 — the pipeline's output half. The `write_output` syscall appends
`readBytes ptr size` (byte-granular) to the public output; the decoder leaves its result as a
`bytesRegion` (dword-packed). This file bridges them — `readBytes_of_bytesRegion`: when
`bytesRegi... | /-
EvmAsm.Rv64.RLP.Phase6WriteOutput
EL.3 / Phase 6 — the pipeline's output half. The `write_output` syscall appends
`readBytes ptr size` (byte-granular) to the public output; the decoder leaves its result as a
`bytesRegion` (dword-packed). This file bridges them — `readBytes_of_bytesRegion`: when
`bytesRegi... | @@ -79,6 +79,22 @@
-- (an append to the public-values stream) through a separation-logic frame.
-- ============================================================================
+/-- If a partial state doesn't own the public values, then appending to the
+ public-values stream preserves compatibility (the `appendP... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_db66011618f8_3 | 0ea90272a2ea62b7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase6WriteOutput.lean | Phase6WriteOutput | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "rlp_phase6_write_output_spec_within_exact",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [rlp_phase6_write_output_code_eq_ofProg]\n have haddi1 := addi_spec_gen_within .x10 rOut v10... | [
{
"name": "ecall_write_output_spec_gen_within",
"text": "/-- `write_output` (zkvm-standards C ABI, t0 = 0x10) appends `readBytes ptr size` to the\n public-values stream. When the source `[ptr, ptr+bs.length)` is a held `bytesRegion ptr bs`\n (dword-aligned, no overflow) and `x11 = bs.length`, the emit... | [
{
"name": "rlp_phase6_write_output_spec_within_exact",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 34,
"n_chars": 1917,
"n_subproofs": 5,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 4,
"n_structural": 0,
"automation_o... | 6 | /-
EvmAsm.Rv64.RLP.Phase6WriteOutput
EL.3 / Phase 6 — the pipeline's output half. The `write_output` syscall appends
`readBytes ptr size` (byte-granular) to the public output; the decoder leaves its result as a
`bytesRegion` (dword-packed). This file bridges them — `readBytes_of_bytesRegion`: when
`bytesRegi... | /-
EvmAsm.Rv64.RLP.Phase6WriteOutput
EL.3 / Phase 6 — the pipeline's output half. The `write_output` syscall appends
`readBytes ptr size` (byte-granular) to the public output; the decoder leaves its result as a
`bytesRegion` (dword-packed). This file bridges them — `readBytes_of_bytesRegion`: when
`bytesRegi... | @@ -144,6 +144,84 @@
-- the appended bytes are exactly `bs`.
-- ============================================================================
+/-- `write_output` (zkvm-standards C ABI, t0 = 0x10) appends `readBytes ptr size` to the
+ public-values stream. When the source `[ptr, ptr+bs.length)` is a held `bytesReg... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_58ecece00519_0 | a8a67b79f2a7a3d1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/HandleFocus.lean | HandleFocus | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "reach_exact_eq_window",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hwl : ((ws₀.drop off).take winLen).length = winLen := by\n rw [List.length_take, List.length_drop]; omega\n ... | [
{
"name": "take_take_drop_reassemble",
"text": "/-- Reassemble a list from a prefix, a mid-window, and a suffix cut at an\n arbitrary (data-dependent) offset — the list-level identity behind the\n focus embedding. `take off ++ (drop off).take winLen ++ drop (off+winLen)`\n recovers the whole list ... | [
{
"name": "reach_exact_eq_window",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 26,
"n_chars": 1296,
"n_subproofs": 1,
"n_tactics": 14,
"cyclomatic": 4,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 8,
"automation_only": false,
"ma... | 1 | /-
EvmAsm.Rv64.SAsm.HandleFocus
Data-dependent writable-window embedding for `callRegS` dispatch
(bead evm-asm-4ch8f.49.1).
`Stmt.callRegS` soundness (`StmtSoundCall.lean`, via `Stmt.CalleesIn`)
forces every callee handle to declare the *same* writable region as its
caller: `h.rw = caller.rw`, FIXED. But... | /-
EvmAsm.Rv64.SAsm.HandleFocus
Data-dependent writable-window embedding for `callRegS` dispatch
(bead evm-asm-4ch8f.49.1).
`Stmt.callRegS` soundness (`StmtSoundCall.lean`, via `Stmt.CalleesIn`)
forces every callee handle to declare the *same* writable region as its
caller: `h.rw = caller.rw`, FIXED. But... | @@ -54,6 +54,19 @@
-- List reassembly at a data-dependent split
-- ============================================================================
+/-- Reassemble a list from a prefix, a mid-window, and a suffix cut at an
+ arbitrary (data-dependent) offset — the list-level identity behind the
+ focus embedding.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_734f074c49b8_0 | d68257a851143cd3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN3V5PreloopShift0Mod.lean | FullPathN3V5PreloopShift0Mod | 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_shift0_spec_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 32,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hC2 := evm_mod_phaseAB_n3_clz_c2taken_spec_v5_noNop sp base b0 b1 b2 b3\n v2 v5 v6 v7... | [
{
"name": "evm_mod_phaseAB_n3_clz_c2taken_spec_v5_noNop",
"text": "/-- v5 n=3 phaseAB-clz + phaseC2(shift=0 taken), `base → copyAUOff`, over\n `modCode_noNop_v5`. Shift=0 branch (`(clzResult b2).1 = 0`). -/\ntheorem evm_mod_phaseAB_n3_clz_c2taken_spec_v5_noNop (sp base : Word)\n (b0 b1 b2 b3 v2 v5 v6... | [
{
"name": "evm_mod_n3_to_loopSetup_shift0_spec_v5_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 74,
"n_chars": 4660,
"n_subproofs": 5,
"n_tactics": 34,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 1,
"automatio... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5PreloopShift0Mod
v5 n=3 shift=0 preloop pieces over `modCode_noNop_v5`. MOD mirror of
`FullPathN3V5PreloopShift0`: on the shift=0 branch the divisor is already
top-bit-aligned (`(clzResult b2).1 = 0`), so phase-C2 takes the BEQ to copyAU
and the dividend is copied ... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5PreloopShift0Mod
v5 n=3 shift=0 preloop pieces over `modCode_noNop_v5`. MOD mirror of
`FullPathN3V5PreloopShift0`: on the shift=0 branch the divisor is already
top-bit-aligned (`(clzResult b2).1 = 0`), so phase-C2 takes the BEQ to copyAU
and the dividend is copied ... | @@ -18,6 +18,58 @@
open EvmAsm.Rv64
+/-- v5 n=3 phaseAB-clz + phaseC2(shift=0 taken), `base → copyAUOff`, over
+ `modCode_noNop_v5`. Shift=0 branch (`(clzResult b2).1 = 0`). -/
+theorem evm_mod_phaseAB_n3_clz_c2taken_spec_v5_noNop (sp base : Word)
+ (b0 b1 b2 b3 v2 v5 v6 v7 v10 : Word)
+ (q0 q1 q2 q3 u5 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_918f0cfcfd86_0 | 608ac4e4027dff18 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/LimbSpecEight.lean | LimbSpecEight | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "mload_byte_pack_eight_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 118,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨h_align0, h_valid0, h_align1, h_valid1, h_align2, h_valid2,\n h_align3, h_valid3, h_al... | [
{
"name": "mloadBytePackEightPre_unfold",
"text": "theorem mloadBytePackEightPre_unfold\n {addrReg byteReg accReg : Reg}\n {addrPtr accOld byteOld wordVal dwordAddr : Word} :\n mloadBytePackEightPre addrReg byteReg accReg\n addrPtr accOld byteOld wordVal dwordAddr =\n ((addrReg ↦ᵣ addrPtr... | [
{
"name": "mload_byte_pack_eight_spec_within",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 150,
"n_chars": 7941,
"n_subproofs": 5,
"n_tactics": 106,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 8,
"n_structural": 28,
"automation_only":... | 2 | /-
EvmAsm.Evm64.MLoad.LimbSpecEight
Eight-byte byte-pack spec for the MLOAD per-limb loop, extracted from
`LimbSpec.lean` to satisfy the 1500-line file-size guardrail (slice 3c
brought the merged file to 1528 lines). The seven-byte spec and its
helper definitions (`mloadBytePackSevenCode`,
`mloadBytePackSe... | /-
EvmAsm.Evm64.MLoad.LimbSpecEight
Eight-byte byte-pack spec for the MLOAD per-limb loop, extracted from
`LimbSpec.lean` to satisfy the 1500-line file-size guardrail (slice 3c
brought the merged file to 1528 lines). The seven-byte spec and its
helper definitions (`mloadBytePackSevenCode`,
`mloadBytePackSe... | @@ -126,6 +126,15 @@
(addrReg ↦ᵣ addrPtr) ** (byteReg ↦ᵣ byteOld) ** (accReg ↦ᵣ accOld) **
(dwordAddr ↦ₘ wordVal)
+theorem mloadBytePackEightPre_unfold
+ {addrReg byteReg accReg : Reg}
+ {addrPtr accOld byteOld wordVal dwordAddr : Word} :
+ mloadBytePackEightPre addrReg byteReg accReg
+ addrPtr ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_918f0cfcfd86_1 | c20624d906cf22eb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/LimbSpecEight.lean | LimbSpecEight | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "mload_byte_pack_eight_via_assertion_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mloadAlignedDwordIs\n -- AC-rearrange the precondition into `<original-pre> ** ⌜fa... | [
{
"name": "mload_byte_pack_eight_spec_within",
"text": "/-- Eight-byte big-endian byte-pack spec (22 instructions): seed `LBU`\n loading `b0`, then seven `LBU + SLLI + OR` triples folding `b1`..`b7`\n in big-endian order, yielding\n `(((((((b0 <<< 8) ||| b1) <<< 8 ||| b2) <<< 8 ||| b3) <<< 8 ||| b4... | [
{
"name": "mload_byte_pack_eight_via_assertion_spec_within",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 61,
"n_chars": 3105,
"n_subproofs": 2,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 2,
"automa... | 4 | /-
EvmAsm.Evm64.MLoad.LimbSpecEight
Eight-byte byte-pack spec for the MLOAD per-limb loop, extracted from
`LimbSpec.lean` to satisfy the 1500-line file-size guardrail (slice 3c
brought the merged file to 1528 lines). The seven-byte spec and its
helper definitions (`mloadBytePackSevenCode`,
`mloadBytePackSe... | /-
EvmAsm.Evm64.MLoad.LimbSpecEight
Eight-byte byte-pack spec for the MLOAD per-limb loop, extracted from
`LimbSpec.lean` to satisfy the 1500-line file-size guardrail (slice 3c
brought the merged file to 1528 lines). The seven-byte spec and its
helper definitions (`mloadBytePackSevenCode`,
`mloadBytePackSe... | @@ -198,6 +198,155 @@
(dwordAddr ↦ₘ wordVal)) := by
delta mloadBytePackEightPost; rfl
+/-- Eight-byte big-endian byte-pack spec (22 instructions): seed `LBU`
+ loading `b0`, then seven `LBU + SLLI + OR` triples folding `b1`..`b7`
+ in big-endian order, yielding
+ `(((((((b0 <<< 8) ||| b1) <<< 8 ||| ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_918f0cfcfd86_2 | cc7b3aff2edf27d1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/LimbSpecEight.lean | LimbSpecEight | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "mloadOneLimbCode_eq_ofProg",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mloadOneLimbCode mloadOneLimbProg\n rw [mloadBytePackEightCode_eq_ofProg]\n let pack := mloadBytePackE... | [
{
"name": "mloadBytePackEightCode_eq_ofProg",
"text": "theorem mloadBytePackEightCode_eq_ofProg\n (addrReg byteReg accReg : Reg)\n (off0 off1 off2 off3 off4 off5 off6 off7 : BitVec 12)\n (base : Word) :\n mloadBytePackEightCode addrReg byteReg accReg\n off0 off1 off2 off3 off4 off5 off6 off... | [
{
"name": "mloadOneLimbCode_eq_ofProg",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 32,
"n_chars": 1365,
"n_subproofs": 0,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 8,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.MLoad.LimbSpecEight
Eight-byte byte-pack spec for the MLOAD per-limb loop, extracted from
`LimbSpec.lean` to satisfy the 1500-line file-size guardrail (slice 3c
brought the merged file to 1528 lines). The seven-byte spec and its
helper definitions (`mloadBytePackSevenCode`,
`mloadBytePackSe... | /-
EvmAsm.Evm64.MLoad.LimbSpecEight
Eight-byte byte-pack spec for the MLOAD per-limb loop, extracted from
`LimbSpec.lean` to satisfy the 1500-line file-size guardrail (slice 3c
brought the merged file to 1528 lines). The seven-byte spec and its
helper definitions (`mloadBytePackSevenCode`,
`mloadBytePackSe... | @@ -111,6 +111,45 @@
LBU byteReg addrReg off7 ;; SLLI accReg accReg (BitVec.ofNat 6 8) ;;
OR' accReg accReg byteReg
+theorem mloadBytePackEightCode_eq_ofProg
+ (addrReg byteReg accReg : Reg)
+ (off0 off1 off2 off3 off4 off5 off6 off7 : BitVec 12)
+ (base : Word) :
+ mloadBytePackEightCode addrReg 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_918f0cfcfd86_3 | a3e62245c6cdfa3e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/LimbSpecEight.lean | LimbSpecEight | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "mloadTwoLimbsCode_eq_ofProg",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mloadTwoLimbsCode mloadTwoLimbsProg\n rw [mloadOneLimbCode_eq_ofProg, mloadOneLimbCode_eq_ofProg]\n l... | [
{
"name": "mloadOneLimbCode_eq_ofProg",
"text": "theorem mloadOneLimbCode_eq_ofProg\n (addrReg byteReg accReg : Reg)\n (off0 off1 off2 off3 off4 off5 off6 off7 dstOff : BitVec 12)\n (base : Word) :\n mloadOneLimbCode addrReg byteReg accReg\n off0 off1 off2 off3 off4 off5 off6 off7 dstOff ba... | [
{
"name": "mloadTwoLimbsCode_eq_ofProg",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 26,
"n_chars": 1065,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 6,
"n_structural": 1,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.MLoad.LimbSpecEight
Eight-byte byte-pack spec for the MLOAD per-limb loop, extracted from
`LimbSpec.lean` to satisfy the 1500-line file-size guardrail (slice 3c
brought the merged file to 1528 lines). The seven-byte spec and its
helper definitions (`mloadBytePackSevenCode`,
`mloadBytePackSe... | /-
EvmAsm.Evm64.MLoad.LimbSpecEight
Eight-byte byte-pack spec for the MLOAD per-limb loop, extracted from
`LimbSpec.lean` to satisfy the 1500-line file-size guardrail (slice 3c
brought the merged file to 1528 lines). The seven-byte spec and its
helper definitions (`mloadBytePackSevenCode`,
`mloadBytePackSe... | @@ -218,6 +218,37 @@
off0 off1 off2 off3 off4 off5 off6 off7 ;;
SD .x12 accReg dstOff
+theorem mloadOneLimbCode_eq_ofProg
+ (addrReg byteReg accReg : Reg)
+ (off0 off1 off2 off3 off4 off5 off6 off7 dstOff : BitVec 12)
+ (base : Word) :
+ mloadOneLimbCode addrReg byteReg accReg
+ off0 off1 off... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_918f0cfcfd86_4 | 76aab231916e839d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/LimbSpecEight.lean | LimbSpecEight | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "mload_byte_pack_eight_via_assertion_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mloadAlignedDwordIs\n -- AC-rearrange the precondition into `<original-pre> ** ⌜fa... | [
{
"name": "mload_byte_pack_eight_spec_within",
"text": "/-- Eight-byte big-endian byte-pack spec (22 instructions): seed `LBU`\n loading `b0`, then seven `LBU + SLLI + OR` triples folding `b1`..`b7`\n in big-endian order, yielding\n `(((((((b0 <<< 8) ||| b1) <<< 8 ||| b2) <<< 8 ||| b3) <<< 8 ||| b4... | [
{
"name": "mload_one_limb_spec_within",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 181,
"n_chars": 8934,
"n_subproofs": 8,
"n_tactics": 120,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 7,
"n_structural": 31,
"automation_only": false,... | 5 | /-
EvmAsm.Evm64.MLoad.LimbSpecEight
Eight-byte byte-pack spec for the MLOAD per-limb loop, extracted from
`LimbSpec.lean` to satisfy the 1500-line file-size guardrail (slice 3c
brought the merged file to 1528 lines). The seven-byte spec and its
helper definitions (`mloadBytePackSevenCode`,
`mloadBytePackSe... | /-
EvmAsm.Evm64.MLoad.LimbSpecEight
Eight-byte byte-pack spec for the MLOAD per-limb loop, extracted from
`LimbSpec.lean` to satisfy the 1500-line file-size guardrail (slice 3c
brought the merged file to 1528 lines). The seven-byte spec and its
helper definitions (`mloadBytePackSevenCode`,
`mloadBytePackSe... | @@ -198,6 +198,155 @@
(dwordAddr ↦ₘ wordVal)) := by
delta mloadBytePackEightPost; rfl
+/-- Eight-byte big-endian byte-pack spec (22 instructions): seed `LBU`
+ loading `b0`, then seven `LBU + SLLI + OR` triples folding `b1`..`b7`
+ in big-endian order, yielding
+ `(((((((b0 <<< 8) ||| b1) <<< 8 ||| ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_918f0cfcfd86_5 | 6299773a0acd2068 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/LimbSpecEight.lean | LimbSpecEight | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 2 | [
{
"theorem_name": "mload_byte_pack_eight_via_assertion_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mloadAlignedDwordIs\n -- AC-rearrange the precondition into `<original-pre> ** ⌜fa... | [
{
"name": "cpsTripleWithin_of_pure_imp",
"text": "/-- Local structural rule used by the `…_via_assertion_spec_within` migration\n (slice 3 of `evm-asm-8xc6` / GH #2278). Lifts a fact-parameterised\n triple `fact → cpsTripleWithin … P Q` to one whose precondition bundles\n the fact as a pure conjunc... | [
{
"name": "mload_one_limb_via_assertion_spec_within",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 7,
"n_lines": 59,
"n_chars": 3022,
"n_subproofs": 2,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 2,
"automation_on... | 7 | /-
EvmAsm.Evm64.MLoad.LimbSpecEight
Eight-byte byte-pack spec for the MLOAD per-limb loop, extracted from
`LimbSpec.lean` to satisfy the 1500-line file-size guardrail (slice 3c
brought the merged file to 1528 lines). The seven-byte spec and its
helper definitions (`mloadBytePackSevenCode`,
`mloadBytePackSe... | /-
EvmAsm.Evm64.MLoad.LimbSpecEight
Eight-byte byte-pack spec for the MLOAD per-limb loop, extracted from
`LimbSpec.lean` to satisfy the 1500-line file-size guardrail (slice 3c
brought the merged file to 1528 lines). The seven-byte spec and its
helper definitions (`mloadBytePackSevenCode`,
`mloadBytePackSe... | @@ -347,6 +347,25 @@
-- The final code-req shape is `mloadBytePackEightCode = seven.union triple`.
exact cpsTripleWithin_seq hd_step sevenRaw step
+/-- Local structural rule used by the `…_via_assertion_spec_within` migration
+ (slice 3 of `evm-asm-8xc6` / GH #2278). Lifts a fact-parameterised
+ triple `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_b26b67ba098b_0 | 20f452f90cd8cc75 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/DivCallReturnV5.lean | DivCallReturnV5 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "saveRa_signs_abs_signXor_then_divCall_then_return_of_callable_post_noX9_spec_in_sdivCodeV5",
"depth": 1,
"n_commands": 0,
"n_lines": 71,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [saveRaDivCallCallableReturnPostNoX9_unfold]... | [
{
"name": "saveRa_signs_abs_signXor_then_divCall_then_resultSignFix_named_post_of_callable_post_noX9_spec_in_sdivCodeV5",
"text": "/-- B6: v5 result-sign-fix with the named post `saveRaDivCallResultSignFixPostNoX9`\n (+ trailing frame). -/\ntheorem saveRa_signs_abs_signXor_then_divCall_then_resultSignFix... | [
{
"name": "saveRa_signs_abs_signXor_then_divCall_then_return_of_callable_post_noX9_spec_in_sdivCodeV5",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 111,
"n_chars": 5769,
"n_subproofs": 7,
"n_tactics": 71,
"cyclomatic": 1,
"n_automation": 2,
"n_rewr... | 1 | /-
EvmAsm.Evm64.SDiv.Compose.DivCallReturnV5
v5 SDIV return chain (B6, B7), over `sdivCodeV5`. Mirrors of the v4 rungs
`..._resultSignFix_named_post_...` (DivCallResultSignFixNamedPost.lean:140) and
`..._then_return_of_callable_post_noX9_...` (DivCallReturnGeneric.lean:323),
carrying the trailing PCFree fra... | /-
EvmAsm.Evm64.SDiv.Compose.DivCallReturnV5
v5 SDIV return chain (B6, B7), over `sdivCodeV5`. Mirrors of the v4 rungs
`..._resultSignFix_named_post_...` (DivCallResultSignFixNamedPost.lean:140) and
`..._then_return_of_callable_post_noX9_...` (DivCallReturnGeneric.lean:323),
carrying the trailing PCFree fra... | @@ -19,6 +19,57 @@
open EvmAsm.Rv64
+/-- B6: v5 result-sign-fix with the named post `saveRaDivCallResultSignFixPostNoX9`
+ (+ trailing frame). -/
+theorem saveRa_signs_abs_signXor_then_divCall_then_resultSignFix_named_post_of_callable_post_noX9_spec_in_sdivCodeV5
+ {nSteps : Nat}
+ (vRa vSavedOld sp sDivi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_0 | c1f87596da242504 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 5 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg]\n exact CodeReq.ofProg_mo... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg (base : Word)\n (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :\n expIterBodyFullMsbSavedBitTwoMulFixedCode\n base squaringMulOff condMul... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 1032,
"n_subproofs": 0,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 1,
... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -27,12 +27,73 @@
CodeReq.ofProg (base + 244) (EvmAsm.Evm64.exp_loop_back backOff)
]
+theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg (base : Word)
+ (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :
+ expIterBodyFullMsbSavedBitTwoMulFixedCode
+ base squaringMu... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_1 | b87a146addbf9f75 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 5 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg]\n exact CodeReq.ofProg_mo... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg (base : Word)\n (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :\n expIterBodyFullMsbSavedBitTwoMulFixedCode\n base squaringMulOff condMul... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_save_bit_sub",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 1016,
"n_subproofs": 0,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 1,
... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -27,12 +27,73 @@
CodeReq.ofProg (base + 244) (EvmAsm.Evm64.exp_loop_back backOff)
]
+theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg (base : Word)
+ (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :
+ expIterBodyFullMsbSavedBitTwoMulFixedCode
+ base squaringMu... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_2 | e80ac89dd42d7bb0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 5 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg]\n exact CodeReq.ofProg_mo... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg (base : Word)\n (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :\n expIterBodyFullMsbSavedBitTwoMulFixedCode\n base squaringMulOff condMul... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_squaring_sub",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 24,
"n_chars": 1084,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 1,
... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -27,12 +27,74 @@
CodeReq.ofProg (base + 244) (EvmAsm.Evm64.exp_loop_back backOff)
]
+theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg (base : Word)
+ (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :
+ expIterBodyFullMsbSavedBitTwoMulFixedCode
+ base squaringMu... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_3 | 46b78469e291425f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 5 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg]\n exact CodeReq.ofProg_mo... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg (base : Word)\n (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :\n expIterBodyFullMsbSavedBitTwoMulFixedCode\n base squaringMulOff condMul... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_cond_mul_sub",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 25,
"n_chars": 1207,
"n_subproofs": 0,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 1,
... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -27,12 +27,75 @@
CodeReq.ofProg (base + 244) (EvmAsm.Evm64.exp_loop_back backOff)
]
+theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg (base : Word)
+ (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :
+ expIterBodyFullMsbSavedBitTwoMulFixedCode
+ base squaringMu... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_4 | 7ce933555e86d53e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 5 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg]\n exact CodeReq.ofProg_mo... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg (base : Word)\n (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :\n expIterBodyFullMsbSavedBitTwoMulFixedCode\n base squaringMulOff condMul... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_loop_back_sub",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 1025,
"n_subproofs": 0,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 1,
... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -27,12 +27,73 @@
CodeReq.ofProg (base + 244) (EvmAsm.Evm64.exp_loop_back backOff)
]
+theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg (base : Word)
+ (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :
+ expIterBodyFullMsbSavedBitTwoMulFixedCode
+ base squaringMu... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_5 | bf3ab4f4db415752 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_block_subs",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact ⟨expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub,\n expIterBodyFullMsb... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_squaring_sub",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_squaring_sub {base : Word}\n {squaringMulOff condMulOff : BitVec 21} {skipOff backOff : BitVec 13} :\n ∀ a i, (exp_squaring_call_block_code (base + 32) squaringMulOff)\n ... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_block_subs",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 6,
"n_lines": 29,
"n_chars": 1590,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"au... | 6 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -117,6 +117,29 @@
EvmAsm.Evm64.exp_save_bit_block_length])
(by simp [EvmAsm.Evm64.exp_iter_body_full_msb_saved_bit_two_mul_fixed_length])
+theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_squaring_sub {base : Word}
+ {squaringMulOff condMulOff : BitVec 21} {skipOff backOff : BitVec 13} :
+ ∀ a... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_6 | d09435a86dc8d378 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 3 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_block_subs",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact ⟨expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub,\n expIterBodyFullMsb... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub {base : Word}\n {squaringMulOff condMulOff : BitVec 21} {skipOff backOff : BitVec 13} :\n ∀ a i, (CodeReq.ofProg base EvmAsm.Evm64.exp_msb_bit_test_block_fixed)\n... | [
{
"name": "exp_msb_bit_test_block_fixed_skip_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 1039,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites"... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -73,6 +73,28 @@
(base + 136) condMulOff skipOff]
simp only [CodeReq.unionAll_cons, CodeReq.unionAll_nil, CodeReq.union_empty_right]
+theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub {base : Word}
+ {squaringMulOff condMulOff : BitVec 21} {skipOff backOff : BitVec 13} :
+ ∀ a i, (CodeReq... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_7 | 87a00297064e2c77 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 3 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_block_subs",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact ⟨expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub,\n expIterBodyFullMsb... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub {base : Word}\n {squaringMulOff condMulOff : BitVec 21} {skipOff backOff : BitVec 13} :\n ∀ a i, (CodeReq.ofProg base EvmAsm.Evm64.exp_msb_bit_test_block_fixed)\n... | [
{
"name": "exp_msb_bit_test_block_fixed_reload_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 23,
"n_chars": 1270,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrite... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -73,6 +73,28 @@
(base + 136) condMulOff skipOff]
simp only [CodeReq.unionAll_cons, CodeReq.unionAll_nil, CodeReq.union_empty_right]
+theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub {base : Word}
+ {squaringMulOff condMulOff : BitVec 21} {skipOff backOff : BitVec 13} :
+ ∀ a i, (CodeReq... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_8 | be1904dbe73a6396 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 5 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg]\n exact CodeReq.ofProg_mo... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg (base : Word)\n (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :\n expIterBodyFullMsbSavedBitTwoMulFixedCode\n base squaringMulOff condMul... | [
{
"name": "exp_save_bit_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 18,
"n_chars": 822,
"n_subproofs": 2,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -27,12 +27,73 @@
CodeReq.ofProg (base + 244) (EvmAsm.Evm64.exp_loop_back backOff)
]
+theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg (base : Word)
+ (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :
+ expIterBodyFullMsbSavedBitTwoMulFixedCode
+ base squaringMu... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_9 | 97e223403db8b76c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_block_subs",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact ⟨expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub,\n expIterBodyFullMsb... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_save_bit_sub",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_save_bit_sub {base : Word}\n {squaringMulOff condMulOff : BitVec 21} {skipOff backOff : BitVec 13} :\n ∀ a i, (CodeReq.ofProg (base + 28) EvmAsm.Evm64.exp_save_bit_block)\n ... | [
{
"name": "exp_msb_bit_test_fixed_skip_then_save_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 37,
"n_chars": 1757,
"n_subproofs": 5,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 0,
"n_rewr... | 5 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -95,6 +95,28 @@
EvmAsm.Evm64.exp_msb_bit_test_block_fixed_length])
(by simp [EvmAsm.Evm64.exp_iter_body_full_msb_saved_bit_two_mul_fixed_length])
+theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_save_bit_sub {base : Word}
+ {squaringMulOff condMulOff : BitVec 21} {skipOff backOff : BitVec 13} :
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_10 | 9dd818d5348393a3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_block_subs",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact ⟨expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub,\n expIterBodyFullMsb... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_save_bit_sub",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_save_bit_sub {base : Word}\n {squaringMulOff condMulOff : BitVec 21} {skipOff backOff : BitVec 13} :\n ∀ a i, (CodeReq.ofProg (base + 28) EvmAsm.Evm64.exp_save_bit_block)\n ... | [
{
"name": "exp_msb_bit_test_fixed_skip_then_save_expIterBodyFullMsbSavedBitTwoMulFixedCode_union_mul_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 25,
"n_chars": 1354,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
... | 6 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -95,6 +95,28 @@
EvmAsm.Evm64.exp_msb_bit_test_block_fixed_length])
(by simp [EvmAsm.Evm64.exp_iter_body_full_msb_saved_bit_two_mul_fixed_length])
+theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_save_bit_sub {base : Word}
+ {squaringMulOff condMulOff : BitVec 21} {skipOff backOff : BitVec 13} :
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_11 | cde0d70a3b985ccf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_block_subs",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact ⟨expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub,\n expIterBodyFullMsb... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_save_bit_sub",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_save_bit_sub {base : Word}\n {squaringMulOff condMulOff : BitVec 21} {skipOff backOff : BitVec 13} :\n ∀ a i, (CodeReq.ofProg (base + 28) EvmAsm.Evm64.exp_save_bit_block)\n ... | [
{
"name": "exp_msb_bit_test_fixed_reload_then_save_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 45,
"n_chars": 2176,
"n_subproofs": 5,
"n_tactics": 24,
"cyclomatic": 1,
"n_automation": 0,
"n_re... | 5 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -95,6 +95,28 @@
EvmAsm.Evm64.exp_msb_bit_test_block_fixed_length])
(by simp [EvmAsm.Evm64.exp_iter_body_full_msb_saved_bit_two_mul_fixed_length])
+theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_save_bit_sub {base : Word}
+ {squaringMulOff condMulOff : BitVec 21} {skipOff backOff : BitVec 13} :
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_12 | 5ba1b9b1eeed25a4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_block_subs",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact ⟨expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub,\n expIterBodyFullMsb... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_save_bit_sub",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_save_bit_sub {base : Word}\n {squaringMulOff condMulOff : BitVec 21} {skipOff backOff : BitVec 13} :\n ∀ a i, (CodeReq.ofProg (base + 28) EvmAsm.Evm64.exp_save_bit_block)\n ... | [
{
"name": "exp_msb_bit_test_fixed_reload_then_save_expIterBodyFullMsbSavedBitTwoMulFixedCode_union_mul_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 29,
"n_chars": 1600,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
... | 6 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -95,6 +95,28 @@
EvmAsm.Evm64.exp_msb_bit_test_block_fixed_length])
(by simp [EvmAsm.Evm64.exp_iter_body_full_msb_saved_bit_two_mul_fixed_length])
+theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_save_bit_sub {base : Word}
+ {squaringMulOff condMulOff : BitVec 21} {skipOff backOff : BitVec 13} :
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_13 | bba1a12a83289180 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 5 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg]\n exact CodeReq.ofProg_mo... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg (base : Word)\n (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :\n expIterBodyFullMsbSavedBitTwoMulFixedCode\n base squaringMulOff condMul... | [
{
"name": "exp_squaring_call_block_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 87,
"n_chars": 4227,
"n_subproofs": 8,
"n_tactics": 46,
"cyclomatic": 4,
"n_automation": 5,
"n_rewrites": 2,
... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -54,12 +54,74 @@
CodeReq.ofProg (base + 244) (EvmAsm.Evm64.exp_loop_back backOff)
]
+theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg (base : Word)
+ (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :
+ expIterBodyFullMsbSavedBitTwoMulFixedCode
+ base squaringMu... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_14 | 0e23e7e19c6343cb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "exp_msb_bit_test_fixed_skip_then_save_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro bit c6New\n have hBit :=\n exp_msb_b... | [
{
"name": "exp_msb_bit_test_block_fixed_skip_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"text": "/-- Fixed x19 bit-test skip path lifted to the decomposed fixed iteration body. -/\ntheorem exp_msb_bit_test_block_fixed_skip_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within\n (e c6 c10 : W... | [
{
"name": "exp_msb_bit_test_fixed_skip_save_then_squaring_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 10,
"n_lines": 88,
"n_chars": 4593,
"n_subproofs": 5,
"n_tactics": 39,
"cyclomatic": 1,
"n_automation": 0,
... | 10 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -167,6 +167,25 @@
EvmAsm.Evm64.exp_squaring_call_block_length])
(by simp [EvmAsm.Evm64.exp_iter_body_full_msb_saved_bit_two_mul_fixed_length])
+/-- Fixed x19 bit-test skip path lifted to the decomposed fixed iteration body. -/
+theorem exp_msb_bit_test_block_fixed_skip_expIterBodyFullMsbSavedBitTwoMu... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_15 | 17af3b96de6fcf7c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 1 | [
{
"theorem_name": "exp_msb_bit_test_fixed_reload_then_save_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro bit\n have hBit :=\n exp_msb_bit_t... | [
{
"name": "exp_msb_bit_test_block_fixed_reload_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"text": "/-- Fixed x19 bit-test reload path lifted to the decomposed fixed iteration body. -/\ntheorem exp_msb_bit_test_block_fixed_reload_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within\n (e c6 c... | [
{
"name": "exp_msb_bit_test_fixed_reload_save_then_squaring_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 10,
"n_lines": 93,
"n_chars": 4997,
"n_subproofs": 5,
"n_tactics": 42,
"cyclomatic": 1,
"n_automation": 0,... | 10 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -167,6 +167,28 @@
EvmAsm.Evm64.exp_squaring_call_block_length])
(by simp [EvmAsm.Evm64.exp_iter_body_full_msb_saved_bit_two_mul_fixed_length])
+/-- Fixed x19 bit-test reload path lifted to the decomposed fixed iteration body. -/
+theorem exp_msb_bit_test_block_fixed_reload_expIterBodyFullMsbSavedBitT... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_16 | d6fe40ceecde7fa1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 5 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg]\n exact CodeReq.ofProg_mo... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg (base : Word)\n (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :\n expIterBodyFullMsbSavedBitTwoMulFixedCode\n base squaringMulOff condMul... | [
{
"name": "exp_cond_mul_call_block_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 104,
"n_chars": 5249,
"n_subproofs": 9,
"n_tactics": 53,
"cyclomatic": 4,
"n_automation": 5,
"n_rewrites": 3,
... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -54,12 +54,75 @@
CodeReq.ofProg (base + 244) (EvmAsm.Evm64.exp_loop_back backOff)
]
+theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg (base : Word)
+ (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :
+ expIterBodyFullMsbSavedBitTwoMulFixedCode
+ base squaringMu... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_17 | 57a28078369739c6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 3 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_block_subs",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact ⟨expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub,\n expIterBodyFullMsb... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_cond_mul_sub",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_cond_mul_sub {base : Word}\n {squaringMulOff condMulOff : BitVec 21} {skipOff backOff : BitVec 13} :\n ∀ a i, (EvmAsm.Evm64.exp_cond_mul_call_with_saved_bit_skip_block_code\n ... | [
{
"name": "exp_cond_mul_saved_bit_beq_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 28,
"n_chars": 1435,
"n_subproofs": 2,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -73,6 +73,30 @@
(base + 136) condMulOff skipOff]
simp only [CodeReq.unionAll_cons, CodeReq.unionAll_nil, CodeReq.union_empty_right]
+theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_cond_mul_sub {base : Word}
+ {squaringMulOff condMulOff : BitVec 21} {skipOff backOff : BitVec 13} :
+ ∀ a i, (EvmAsm.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_18 | d1f7978c19675048 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 3 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_block_subs",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact ⟨expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub,\n expIterBodyFullMsb... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_cond_mul_sub",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_cond_mul_sub {base : Word}\n {squaringMulOff condMulOff : BitVec 21} {skipOff backOff : BitVec 13} :\n ∀ a i, (EvmAsm.Evm64.exp_cond_mul_call_with_saved_bit_skip_block_code\n ... | [
{
"name": "exp_cond_mul_saved_bit_beq_expIterBodyFullMsbSavedBitTwoMulFixedCode_union_mul_spec_within",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 20,
"n_chars": 1099,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrit... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -73,6 +73,30 @@
(base + 136) condMulOff skipOff]
simp only [CodeReq.unionAll_cons, CodeReq.unionAll_nil, CodeReq.union_empty_right]
+theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_cond_mul_sub {base : Word}
+ {squaringMulOff condMulOff : BitVec 21} {skipOff backOff : BitVec 13} :
+ ∀ a i, (EvmAsm.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_19 | 1390129855638ebc | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "exp_msb_bit_test_fixed_skip_then_save_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro bit c6New\n have hBit :=\n exp_msb_b... | [
{
"name": "exp_save_bit_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"text": "/-- Saved-bit block lifted to the decomposed fixed iteration body. -/\ntheorem exp_save_bit_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within\n (bit v18 : Word)\n (squaringMulOff condMulOff : BitVec 21) (skipO... | [
{
"name": "exp_msb_bit_test_fixed_skip_save_squaring_then_cond_mul_beq_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 14,
"n_lines": 113,
"n_chars": 5308,
"n_subproofs": 4,
"n_tactics": 48,
"cyclomatic": 1,
"n_aut... | 14 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -210,6 +210,23 @@
e c6 c10 base hc6)
(hmono := expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub)
+/-- Saved-bit block lifted to the decomposed fixed iteration body. -/
+theorem exp_save_bit_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within
+ (bit v18 : Word)
+ (squaringMulOff condMulOff... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_20 | be489b1c87af145e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "exp_msb_bit_test_fixed_skip_then_save_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro bit c6New\n have hBit :=\n exp_msb_b... | [
{
"name": "exp_save_bit_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"text": "/-- Saved-bit block lifted to the decomposed fixed iteration body. -/\ntheorem exp_save_bit_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within\n (bit v18 : Word)\n (squaringMulOff condMulOff : BitVec 21) (skipO... | [
{
"name": "exp_msb_bit_test_fixed_reload_save_squaring_then_cond_mul_beq_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 14,
"n_lines": 121,
"n_chars": 5890,
"n_subproofs": 4,
"n_tactics": 50,
"cyclomatic": 1,
"n_a... | 14 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -213,6 +213,23 @@
e c6 c10 ptr nextLimb base hc6)
(hmono := expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub)
+/-- Saved-bit block lifted to the decomposed fixed iteration body. -/
+theorem exp_save_bit_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within
+ (bit v18 : Word)
+ (squaringMulO... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_21 | 43564da8a56437a7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 5 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg]\n exact CodeReq.ofProg_mo... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg (base : Word)\n (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :\n expIterBodyFullMsbSavedBitTwoMulFixedCode\n base squaringMulOff condMul... | [
{
"name": "exp_loop_back_expIterBodyFullMsbSavedBitTwoMulFixedCode_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 30,
"n_chars": 1341,
"n_subproofs": 3,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structu... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -27,12 +27,73 @@
CodeReq.ofProg (base + 244) (EvmAsm.Evm64.exp_loop_back backOff)
]
+theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_eq_ofProg (base : Word)
+ (squaringMulOff condMulOff : BitVec 21) (skipOff backOff : BitVec 13) :
+ expIterBodyFullMsbSavedBitTwoMulFixedCode
+ base squaringMu... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aad06f1d1512_22 | 3f78795617ad73cf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitBaseTwoMulFixedIter.lean | SavedBitBaseTwoMulFixedIter | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_block_subs",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact ⟨expIterBodyFullMsbSavedBitTwoMulFixedCode_bit_test_sub,\n expIterBodyFullMsb... | [
{
"name": "expIterBodyFullMsbSavedBitTwoMulFixedCode_loop_back_sub",
"text": "theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_loop_back_sub {base : Word}\n {squaringMulOff condMulOff : BitVec 21} {skipOff backOff : BitVec 13} :\n ∀ a i, (CodeReq.ofProg (base + 244)\n (EvmAsm.Evm64.exp_loop_back... | [
{
"name": "exp_loop_back_expIterBodyFullMsbSavedBitTwoMulFixedCode_union_mul_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 25,
"n_chars": 1170,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulFixedIter
CodeReq decomposition for the fixed x19 two-MUL saved-bit EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitBaseTwoMulIter
import EvmAsm.Evm64.Exp.SquaringPairThenMulCall
import EvmAsm.Evm64.Exp.CondMulPairThenMulCall
namespace EvmAsm.Evm64.Exp.Comp... | @@ -73,6 +73,28 @@
(base + 136) condMulOff skipOff]
simp only [CodeReq.unionAll_cons, CodeReq.unionAll_nil, CodeReq.union_empty_right]
+theorem expIterBodyFullMsbSavedBitTwoMulFixedCode_loop_back_sub {base : Word}
+ {squaringMulOff condMulOff : BitVec 21} {skipOff backOff : BitVec 13} :
+ ∀ a i, (CodeRe... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_82642cdd24d9_0 | 87298b326164a4d3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DivN3NormVStructure.lean | DivN3NormVStructure | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "fullDivN3NormV_top_zero_of_shape_shift_nz",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [fullDivN3NormV_unfold]\n show (b3 <<< ((fullDivN3Shift b2).toNat % 64)) |||\n (b2 >>>... | [
{
"name": "fullDivN3AntiShift_toNat_mod_64",
"text": "/-- Auxiliary: when `shift = clzResult b2 .1` is in `[1, 63]`, the antiShift\n word's `toNat % 64` equals `64 - shift`. Used by the structural facts\n below to bring the shift amount into a usable range. -/\nprivate theorem fullDivN3AntiShift_toNa... | [
{
"name": "fullDivN3NormV_top_zero_of_shape_shift_nz",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 29,
"n_chars": 1040,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 9,
"n_structural": 3,
"automation_o... | 1 | /-
EvmAsm.Evm64.EvmWordArith.DivN3NormVStructure
Structural facts about the normalised divisor `fullDivN3NormV` under the
n=3 shape predicate (`b3 = 0`, `b2 ≠ 0`) and `shift_nz`.
Two facts are proved here:
1. `fullDivN3NormV_top_zero_of_shape_shift_nz`: the top limb v3_norm is 0.
2. `fullDivN3NormV_ms... | /-
EvmAsm.Evm64.EvmWordArith.DivN3NormVStructure
Structural facts about the normalised divisor `fullDivN3NormV` under the
n=3 shape predicate (`b3 = 0`, `b2 ≠ 0`) and `shift_nz`.
Two facts are proved here:
1. `fullDivN3NormV_top_zero_of_shape_shift_nz`: the top limb v3_norm is 0.
2. `fullDivN3NormV_ms... | @@ -24,13 +24,79 @@
open EvmWord EvmAsm.Rv64
+/-- Auxiliary: when `shift = clzResult b2 .1` is in `[1, 63]`, the antiShift
+ word's `toNat % 64` equals `64 - shift`. Used by the structural facts
+ below to bring the shift amount into a usable range. -/
+private theorem fullDivN3AntiShift_toNat_mod_64
+ (... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c2af41b57154_0 | 43c08f01d97d088a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/VmemReduction.lean | VmemReduction | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 2 | [
{
"theorem_name": "readBytes8_eq_reconstruct",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [runSail, readBytes, readByte, bind, EStateM.bind, pure, EStateM.pure,\n get, getThe, MonadStateOf.g... | [
{
"name": "append8_eq_or_shifts",
"text": "/-- Pure `BitVec` identity: the little-endian nested `append` that `readBytes 8`\n produces equals the or-of-shifts that `reconstructDword` uses (`b0` = lowest byte). -/\ntheorem append8_eq_or_shifts (b0 b1 b2 b3 b4 b5 b6 b7 : BitVec 8) :\n (((((((b7.append b... | [
{
"name": "readBytes8_eq_reconstruct",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 1227,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"... | 1 | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | @@ -47,6 +47,93 @@
| `(tactic| sail_reduce) => `(tactic| simp +decide only [sail_step])
| `(tactic| sail_reduce [$args,*]) => `(tactic| simp +decide only [sail_step, $args,*])
+/-- Pure `BitVec` identity: the little-endian nested `append` that `readBytes 8`
+ produces equals the or-of-shifts that `reconstruc... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c2af41b57154_1 | 9a342c49af2c8b60 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/VmemReduction.lean | VmemReduction | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 2 | [
{
"theorem_name": "untilFuelM_one_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [untilFuelM_one]\n simp only [pure_bind, bind_pure]",
"n_chars": 60,
"n_subproofs": 0,
"n_tactics": 3,
... | [
{
"name": "untilFuelM_one",
"text": "/-- **Lemma #5 — `untilFuelM` single iteration.** With `fuel = 1` the Sail bounded loop\n runs its body once and evaluates the condition (whose result is discarded — both `if`\n branches return the same `x`). Used to unwrap `vmem_read_addr`'s outer access loop,\n ... | [
{
"name": "untilFuelM_one_pure",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 429,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nes... | 1 | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | @@ -47,11 +47,27 @@
| `(tactic| sail_reduce) => `(tactic| simp +decide only [sail_step])
| `(tactic| sail_reduce [$args,*]) => `(tactic| simp +decide only [sail_step, $args,*])
+/-- **Lemma #5 — `untilFuelM` single iteration.** With `fuel = 1` the Sail bounded loop
+ runs its body once and evaluates the cond... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c2af41b57154_2 | 9bb777762e68a6d8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/VmemReduction.lean | VmemReduction | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "pmpCheck_machine_off",
"depth": 1,
"n_commands": 0,
"n_lines": 27,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold pmpCheck\n simp +decide only [SailME.run, PreSail.PreSailME.run, sys_pmp_count,\n bind, EStateM.bind,\n ... | [
{
"name": "forIn'_noop_except",
"text": "/-- **Lemma #4 — `IntRange.forIn'` no-op invariant in the `SailME`/`ExceptT` monad.**\n The `forIn'_noop` analogue for loops that run inside `SailME.run` (i.e. in\n `ExceptT ε SailM`), such as `pmpCheck`'s PMP scan. If the body, run on a fixed state\n `s`, r... | [
{
"name": "pmpCheck_machine_off",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 40,
"n_chars": 1840,
"n_subproofs": 1,
"n_tactics": 27,
"cyclomatic": 2,
"n_automation": 7,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": false,
"max... | 3 | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | @@ -47,6 +47,33 @@
| `(tactic| sail_reduce) => `(tactic| simp +decide only [sail_step])
| `(tactic| sail_reduce [$args,*]) => `(tactic| simp +decide only [sail_step, $args,*])
+/-- **Lemma #4 — `IntRange.forIn'` no-op invariant in the `SailME`/`ExceptT` monad.**
+ The `forIn'_noop` analogue for loops that ru... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c2af41b57154_3 | bd9904f54023b98f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/VmemReduction.lean | VmemReduction | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 2 | [
{
"theorem_name": "transform_effective_address_bare",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold transform_effective_address\n sail_reduce [h_priv, h_mst, effectivePrivilege_machine s _ mst _ h_m... | [
{
"name": "effectivePrivilege_machine",
"text": "/-- **Lemma #2b — `effectivePrivilege` is the identity in Machine mode with `MPRV = 0`.**\n A data access (not an `InstructionFetch`) only switches privilege when `MPRV = 1`; with\n `MPRV = 0` the guard is false and the passed-in privilege is returned u... | [
{
"name": "transform_effective_address_bare",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 20,
"n_chars": 1100,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fals... | 3 | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | @@ -47,6 +47,17 @@
| `(tactic| sail_reduce) => `(tactic| simp +decide only [sail_step])
| `(tactic| sail_reduce [$args,*]) => `(tactic| simp +decide only [sail_step, $args,*])
+/-- **Lemma #2b — `effectivePrivilege` is the identity in Machine mode with `MPRV = 0`.**
+ A data access (not an `InstructionFetch`... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c2af41b57154_4 | 6e81b060c4723e45 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/VmemReduction.lean | VmemReduction | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 2 | [
{
"theorem_name": "readBytes8_eq_reconstruct",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [runSail, readBytes, readByte, bind, EStateM.bind, pure, EStateM.pure,\n get, getThe, MonadStateOf.g... | [
{
"name": "append8_eq_or_shifts",
"text": "/-- Pure `BitVec` identity: the little-endian nested `append` that `readBytes 8`\n produces equals the or-of-shifts that `reconstructDword` uses (`b0` = lowest byte). -/\ntheorem append8_eq_or_shifts (b0 b1 b2 b3 b4 b5 b6 b7 : BitVec 8) :\n (((((((b7.append b... | [
{
"name": "readBytes8_raw",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 1085,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting... | 1 | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | @@ -47,6 +47,93 @@
| `(tactic| sail_reduce) => `(tactic| simp +decide only [sail_step])
| `(tactic| sail_reduce [$args,*]) => `(tactic| simp +decide only [sail_step, $args,*])
+/-- Pure `BitVec` identity: the little-endian nested `append` that `readBytes 8`
+ produces equals the or-of-shifts that `reconstruc... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c2af41b57154_5 | 3459421bd342607b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/VmemReduction.lean | VmemReduction | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 2 | [
{
"theorem_name": "readBytes8_eq_reconstruct",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [runSail, readBytes, readByte, bind, EStateM.bind, pure, EStateM.pure,\n get, getThe, MonadStateOf.g... | [
{
"name": "append8_eq_or_shifts",
"text": "/-- Pure `BitVec` identity: the little-endian nested `append` that `readBytes 8`\n produces equals the or-of-shifts that `reconstructDword` uses (`b0` = lowest byte). -/\ntheorem append8_eq_or_shifts (b0 b1 b2 b3 b4 b5 b6 b7 : BitVec 8) :\n (((((((b7.append b... | [
{
"name": "read_ram_plain_load",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 1207,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_n... | 2 | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | @@ -47,6 +47,93 @@
| `(tactic| sail_reduce) => `(tactic| simp +decide only [sail_step])
| `(tactic| sail_reduce [$args,*]) => `(tactic| simp +decide only [sail_step, $args,*])
+/-- Pure `BitVec` identity: the little-endian nested `append` that `readBytes 8`
+ produces equals the or-of-shifts that `reconstruc... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c2af41b57154_6 | acfaf63450a2604e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/VmemReduction.lean | VmemReduction | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "phys_access_check_load_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold phys_access_check\n simp only [bind, EStateM.bind,\n pmpCheck_machine_off (physaddr.Physaddr addr) wid... | [
{
"name": "pmaCheck_load_ok",
"text": "/-- **Lemma #7 — `pmaCheck` permits an aligned readable Load.** If `paddr` lies in a PMA\n region (`matching_pma_region` finds it) that is `readable` and the access is aligned,\n a `Load Data` PMA check (with `PBMT_PMA`, non-reservation) returns `none` (permitted... | [
{
"name": "phys_access_check_load_ok",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 22,
"n_chars": 1334,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 5 | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | @@ -74,6 +74,25 @@
show IntRange.forIn'.loop range f init range.start _ s = _
exact aux init range.start _
+/-- **Lemma #7 — `pmaCheck` permits an aligned readable Load.** If `paddr` lies in a PMA
+ region (`matching_pma_region` finds it) that is `readable` and the access is aligned,
+ a `Load Data` PMA c... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c2af41b57154_7 | 710a7ea94d802b03 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/VmemReduction.lean | VmemReduction | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "phys_access_check_load_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold phys_access_check\n simp only [bind, EStateM.bind,\n pmpCheck_machine_off (physaddr.Physaddr addr) wid... | [
{
"name": "pmaCheck_load_ok",
"text": "/-- **Lemma #7 — `pmaCheck` permits an aligned readable Load.** If `paddr` lies in a PMA\n region (`matching_pma_region` finds it) that is `readable` and the access is aligned,\n a `Load Data` PMA check (with `PBMT_PMA`, non-reservation) returns `none` (permitted... | [
{
"name": "checked_mem_read_load",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 10,
"n_lines": 36,
"n_chars": 2310,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"ma... | 10 | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | @@ -161,6 +161,25 @@
show IntRange.forIn'.loop range f init range.start _ s = _
exact aux init range.start _
+/-- **Lemma #7 — `pmaCheck` permits an aligned readable Load.** If `paddr` lies in a PMA
+ region (`matching_pma_region` finds it) that is `readable` and the access is aligned,
+ a `Load Data` PMA... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c2af41b57154_8 | c8d75ec095228973 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/VmemReduction.lean | VmemReduction | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "pmpCheck_machine_off",
"depth": 1,
"n_commands": 0,
"n_lines": 27,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold pmpCheck\n simp +decide only [SailME.run, PreSail.PreSailME.run, sys_pmp_count,\n bind, EStateM.bind,\n ... | [
{
"name": "pmpReadAddrReg_noop",
"text": "/-- `pmpReadAddrReg` is read-only: it reads `pmpcfg_n`/`pmpaddr_n` and returns the stored\n address (the grain-`0` mask branches are trivial), leaving the state untouched. -/\ntheorem pmpReadAddrReg_noop (s : SailState) (n : Nat)\n (cfgs : Vector (BitVec 8) 64... | [
{
"name": "mem_read_load_bare",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 12,
"n_lines": 41,
"n_chars": 2650,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_... | 12 | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | @@ -180,6 +180,22 @@
get, MonadState.get, getThe, MonadStateOf.get,
Sail.assert, PreSail.assert]
+/-- `pmpReadAddrReg` is read-only: it reads `pmpcfg_n`/`pmpaddr_n` and returns the stored
+ address (the grain-`0` mask branches are trivial), leaving the state untouched. -/
+theorem pmpReadAddrReg_noop (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_c2af41b57154_9 | 5934180864c6183b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/VmemReduction.lean | VmemReduction | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "pmpCheck_machine_off",
"depth": 1,
"n_commands": 0,
"n_lines": 27,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold pmpCheck\n simp +decide only [SailME.run, PreSail.PreSailME.run, sys_pmp_count,\n bind, EStateM.bind,\n ... | [
{
"name": "pmpReadAddrReg_noop",
"text": "/-- `pmpReadAddrReg` is read-only: it reads `pmpcfg_n`/`pmpaddr_n` and returns the stored\n address (the grain-`0` mask branches are trivial), leaving the state untouched. -/\ntheorem pmpReadAddrReg_noop (s : SailState) (n : Nat)\n (cfgs : Vector (BitVec 8) 64... | [
{
"name": "vmem_read_addr_load_bare",
"fan_in": 1,
"n_deps_direct": 8,
"n_deps_transitive": 20,
"n_lines": 64,
"n_chars": 4331,
"n_subproofs": 3,
"n_tactics": 24,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 7,
"n_structural": 0,
"automation_only": false,
... | 20 | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | @@ -215,6 +215,22 @@
get, MonadState.get, getThe, MonadStateOf.get,
Sail.assert, PreSail.assert]
+/-- `pmpReadAddrReg` is read-only: it reads `pmpcfg_n`/`pmpaddr_n` and returns the stored
+ address (the grain-`0` mask branches are trivial), leaving the state untouched. -/
+theorem pmpReadAddrReg_noop (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_c2af41b57154_10 | 617cf09913866bf9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/VmemReduction.lean | VmemReduction | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "phys_access_check_load_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold phys_access_check\n simp only [bind, EStateM.bind,\n pmpCheck_machine_off (physaddr.Physaddr addr) wid... | [
{
"name": "pmpCheck_machine_off",
"text": "/-- **Lemma #8 — `pmpCheck` permits access in Machine mode with all PMP entries OFF.**\n Returns `none` (access permitted), state untouched. The 16-entry PMP scan is a\n read-only no-op (every entry OFF ⇒ `pmpMatchAddr` = `PMP_NoMatch`), collapsed via\n `f... | [
{
"name": "vmem_read_load_bare",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 25,
"n_lines": 40,
"n_chars": 2690,
"n_subproofs": 3,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 13,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"ma... | 25 | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | @@ -240,6 +240,45 @@
unfold pmpMatchAddr
simp +decide only [h_off, pure, EStateM.pure]
+/-- **Lemma #8 — `pmpCheck` permits access in Machine mode with all PMP entries OFF.**
+ Returns `none` (access permitted), state untouched. The 16-entry PMP scan is a
+ read-only no-op (every entry OFF ⇒ `pmpMatchAddr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c2af41b57154_11 | fa16dd6b0d7be2bd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/VmemReduction.lean | VmemReduction | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "checked_mem_read_load",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold checked_mem_read\n simp only [bind, EStateM.bind,\n phys_access_check_load_ok addr 8 s cfgs pmpaddrs regio... | [
{
"name": "within_mmio_readable_ram",
"text": "/-- **Lemma #9 — `within_mmio_readable` is `false` off the MMIO ranges.** With RVFI off\n (`get_config_rvfi () = false`, definitional) the check reduces to\n `within_clint || within_sig || (within_htif_readable && 1≤width)`. If all three\n sub-checks r... | [
{
"name": "ld_sail_equiv",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 27,
"n_lines": 69,
"n_chars": 4212,
"n_subproofs": 6,
"n_tactics": 35,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 7,
"n_structural": 3,
"automation_only": false,
"max_nesti... | 27 | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | /-
EvmAsm.Rv64.SailEquiv.VmemReduction
Building blocks for discharging the `h_exec` hypothesis carried by the `MemProofs`
`*_sail_equiv` lemmas — i.e. for proving the SAIL `execute_LOAD`/`execute_STORE`
bare-mode `vmem_read`/`vmem_write` reduction the original lemmas defer.
This file currently establishes *... | @@ -279,6 +279,23 @@
EStateM.map]
rfl
+/-- **Lemma #9 — `within_mmio_readable` is `false` off the MMIO ranges.** With RVFI off
+ (`get_config_rvfi () = false`, definitional) the check reduces to
+ `within_clint || within_sig || (within_htif_readable && 1≤width)`. If all three
+ sub-checks return ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_45cac6bfc0c0_0 | fa1334b5a6ae1cdd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1ExactV4.lean | N1ExactV4 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "fullDivN1CallMaxmaxmaxQuotientWordV4_eq_div_of_semantic_facts",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact fullDivN1CallMaxmaxmaxQuotientWordV4_eq_div_of_mulsub_overestimate\n ... | [
{
"name": "fullDivN1CallMaxmaxmaxQuotientWordV4_eq_div_of_mulsub_overestimate",
"text": "/-- Semantic bridge for the selected N1 v4 call/max/max/max quotient word\n once the loop proof supplies the selected accumulated mulsub equation and\n quotient-overestimate bound. -/\ntheorem fullDivN1CallMaxmaxm... | [
{
"name": "fullDivN1CallMaxmaxmaxQuotientWordV4_eq_div_of_semantic_facts",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 740,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4
Caller-facing full-v4 wrappers for exact N1 DIV stack specs.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactNoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4PreloopCallMax
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64... | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4
Caller-facing full-v4 wrappers for exact N1 DIV stack specs.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactNoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4PreloopCallMax
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64... | @@ -193,6 +193,94 @@
q3Old q2Old q1Old q0Old retMem dMem dloMem scratchUn0 scratchMem raVal ∧
FullDivN1CallMaxmaxmaxSemanticFactsV4 a0 a1 a2 a3 b0 b1 b2 b3
+/-- Semantic bridge for the selected N1 v4 call/max/max/max quotient word
+ once the loop proof supplies the selected accumulated mulsub equation and
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_45cac6bfc0c0_1 | 56602de878d0f30b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1ExactV4.lean | N1ExactV4 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "fullDivN1CallMaxmaxmaxQuotientWordV4_eq_div_of_semantic_facts",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact fullDivN1CallMaxmaxmaxQuotientWordV4_eq_div_of_mulsub_overestimate\n ... | [
{
"name": "fullDivN1CallMaxmaxmaxQuotientWordV4_eq_div_of_mulsub_overestimate",
"text": "/-- Semantic bridge for the selected N1 v4 call/max/max/max quotient word\n once the loop proof supplies the selected accumulated mulsub equation and\n quotient-overestimate bound. -/\ntheorem fullDivN1CallMaxmaxm... | [
{
"name": "fullDivN1CallMaxmaxmaxQuotientWordV4_eq_div_of_semantic_facts_word",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 28,
"n_chars": 1265,
"n_subproofs": 3,
"n_tactics": 14,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 2,
"n_structur... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4
Caller-facing full-v4 wrappers for exact N1 DIV stack specs.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactNoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4PreloopCallMax
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64... | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4
Caller-facing full-v4 wrappers for exact N1 DIV stack specs.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactNoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4PreloopCallMax
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64... | @@ -193,6 +193,94 @@
q3Old q2Old q1Old q0Old retMem dMem dloMem scratchUn0 scratchMem raVal ∧
FullDivN1CallMaxmaxmaxSemanticFactsV4 a0 a1 a2 a3 b0 b1 b2 b3
+/-- Semantic bridge for the selected N1 v4 call/max/max/max quotient word
+ once the loop proof supplies the selected accumulated mulsub equation and
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_45cac6bfc0c0_2 | d68dd9c6e283f651 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1ExactV4.lean | N1ExactV4 | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected_carry",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hselected :=\n ... | [
{
"name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected",
"text": "/-- Selected-carry full-v4 form of the N1 call/max/max/max exact-frame stack spec. -/\ntheorem evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_ex... | [
{
"name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected_carry",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 175,
"n_chars": 7743,
"n_subproofs": 1,
"n_tactics": 18,
"cyclomatic": 1,
"n_au... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4
Caller-facing full-v4 wrappers for exact N1 DIV stack specs.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactNoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4PreloopCallMax
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64... | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4
Caller-facing full-v4 wrappers for exact N1 DIV stack specs.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactNoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4PreloopCallMax
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64... | @@ -193,6 +193,175 @@
q3Old q2Old q1Old q0Old retMem dMem dloMem scratchUn0 scratchMem raVal ∧
FullDivN1CallMaxmaxmaxSemanticFactsV4 a0 a1 a2 a3 b0 b1 b2 b3
+/-- Selected-carry full-v4 form of the N1 call/max/max/max exact-frame stack spec. -/
+theorem evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_45cac6bfc0c0_3 | f5723fabec5dc63a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1ExactV4.lean | N1ExactV4 | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected_carry",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hselected :=\n ... | [
{
"name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected",
"text": "/-- Selected-carry full-v4 form of the N1 call/max/max/max exact-frame stack spec. -/\ntheorem evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_ex... | [
{
"name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected_hdivs",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 53,
"n_chars": 2832,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 1,
"n_aut... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4
Caller-facing full-v4 wrappers for exact N1 DIV stack specs.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactNoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4PreloopCallMax
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64... | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4
Caller-facing full-v4 wrappers for exact N1 DIV stack specs.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactNoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4PreloopCallMax
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64... | @@ -193,6 +193,175 @@
q3Old q2Old q1Old q0Old retMem dMem dloMem scratchUn0 scratchMem raVal ∧
FullDivN1CallMaxmaxmaxSemanticFactsV4 a0 a1 a2 a3 b0 b1 b2 b3
+/-- Selected-carry full-v4 form of the N1 call/max/max/max exact-frame stack spec. -/
+theorem evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_45cac6bfc0c0_4 | 73f44f8f0039a18b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1ExactV4.lean | N1ExactV4 | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected_carry",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hselected :=\n ... | [
{
"name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected",
"text": "/-- Selected-carry full-v4 form of the N1 call/max/max/max exact-frame stack spec. -/\ntheorem evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_ex... | [
{
"name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected_carry_hdivs",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 92,
"n_chars": 4300,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 1,
... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4
Caller-facing full-v4 wrappers for exact N1 DIV stack specs.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactNoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4PreloopCallMax
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64... | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4
Caller-facing full-v4 wrappers for exact N1 DIV stack specs.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactNoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4PreloopCallMax
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64... | @@ -193,6 +193,175 @@
q3Old q2Old q1Old q0Old retMem dMem dloMem scratchUn0 scratchMem raVal ∧
FullDivN1CallMaxmaxmaxSemanticFactsV4 a0 a1 a2 a3 b0 b1 b2 b3
+/-- Selected-carry full-v4 form of the N1 call/max/max/max exact-frame stack spec. -/
+theorem evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_45cac6bfc0c0_5 | b93d5d33514f9019 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1ExactV4.lean | N1ExactV4 | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected_carry",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hselected :=\n ... | [
{
"name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected",
"text": "/-- Selected-carry full-v4 form of the N1 call/max/max/max exact-frame stack spec. -/\ntheorem evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_ex... | [
{
"name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected_word",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 54,
"n_chars": 2881,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_auto... | 3 | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4
Caller-facing full-v4 wrappers for exact N1 DIV stack specs.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactNoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4PreloopCallMax
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64... | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4
Caller-facing full-v4 wrappers for exact N1 DIV stack specs.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactNoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4PreloopCallMax
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64... | @@ -214,6 +214,175 @@
delta fullDivN1CallMaxmaxmaxQuotientWordV4
exact EvmWord.getLimbN_fromLimbs_3
+/-- Selected-carry full-v4 form of the N1 call/max/max/max exact-frame stack spec. -/
+theorem evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_45cac6bfc0c0_6 | 9562735aaa8e603d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1ExactV4.lean | N1ExactV4 | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "fullDivN1CallMaxmaxmaxQuotientWordV4_eq_div_of_semantic_facts_word",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hword := fullDivN1CallMaxmaxmaxQuotientWordV4_eq_div_of_semantic_f... | [
{
"name": "fullDivN1CallMaxmaxmaxQuotientWordV4_eq_div_of_semantic_facts",
"text": "/-- Package-form semantic bridge for the selected N1 v4 call/max/max/max\n quotient word. -/\ntheorem fullDivN1CallMaxmaxmaxQuotientWordV4_eq_div_of_semantic_facts\n {a0 a1 a2 a3 b0 b1 b2 b3 : Word}\n (hbnz : b0 |||... | [
{
"name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected_semantic_facts",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 55,
"n_chars": 2947,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 1,
... | 7 | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4
Caller-facing full-v4 wrappers for exact N1 DIV stack specs.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactNoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4PreloopCallMax
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64... | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4
Caller-facing full-v4 wrappers for exact N1 DIV stack specs.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactNoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4PreloopCallMax
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64... | @@ -302,6 +302,22 @@
match i with | 0 => b0 | 1 => b1 | 2 => b2 | 3 => b3)
exact h_correct.1
+/-- Package-form semantic bridge for the selected N1 v4 call/max/max/max
+ quotient word. -/
+theorem fullDivN1CallMaxmaxmaxQuotientWordV4_eq_div_of_semantic_facts
+ {a0 a1 a2 a3 b0 b1 b2 b3 : Word}
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_45cac6bfc0c0_7 | b1d0a47ec93dda6c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1ExactV4.lean | N1ExactV4 | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected_semantic_facts",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact evm_div... | [
{
"name": "fullDivN1CallMaxmaxmaxQuotientWordV4_eq_div_of_semantic_facts_word",
"text": "/-- Caller-word form of the package semantic bridge for the selected N1 v4\n call/max/max/max quotient word. -/\ntheorem fullDivN1CallMaxmaxmaxQuotientWordV4_eq_div_of_semantic_facts_word\n (a b : EvmWord) (a0 a1 ... | [
{
"name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected_semantic_evidence",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 50,
"n_chars": 2688,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,... | 8 | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4
Caller-facing full-v4 wrappers for exact N1 DIV stack specs.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactNoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4PreloopCallMax
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64... | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4
Caller-facing full-v4 wrappers for exact N1 DIV stack specs.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactNoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4PreloopCallMax
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64... | @@ -318,6 +318,33 @@
exact fullDivN1CallMaxmaxmaxQuotientWordV4_eq_div_of_mulsub_overestimate
hbnz hfacts.1 hfacts.2
+/-- Caller-word form of the package semantic bridge for the selected N1 v4
+ call/max/max/max quotient word. -/
+theorem fullDivN1CallMaxmaxmaxQuotientWordV4_eq_div_of_semantic_facts_word
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_45cac6bfc0c0_8 | 6fd7527673a36b27 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1ExactV4.lean | N1ExactV4 | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected_carry",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hselected :=\n ... | [
{
"name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected",
"text": "/-- Selected-carry full-v4 form of the N1 call/max/max/max exact-frame stack spec. -/\ntheorem evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_ex... | [
{
"name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected_carry_word",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 93,
"n_chars": 4349,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"... | 4 | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4
Caller-facing full-v4 wrappers for exact N1 DIV stack specs.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactNoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4PreloopCallMax
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64... | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4
Caller-facing full-v4 wrappers for exact N1 DIV stack specs.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactNoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4PreloopCallMax
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64... | @@ -214,6 +214,175 @@
delta fullDivN1CallMaxmaxmaxQuotientWordV4
exact EvmWord.getLimbN_fromLimbs_3
+/-- Selected-carry full-v4 form of the N1 call/max/max/max exact-frame stack spec. -/
+theorem evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_45cac6bfc0c0_9 | 3d2073c20c361d7b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1ExactV4.lean | N1ExactV4 | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "fullDivN1CallMaxmaxmaxQuotientWordV4_eq_div_of_semantic_facts_word",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hword := fullDivN1CallMaxmaxmaxQuotientWordV4_eq_div_of_semantic_f... | [
{
"name": "fullDivN1CallMaxmaxmaxQuotientWordV4_eq_div_of_semantic_facts",
"text": "/-- Package-form semantic bridge for the selected N1 v4 call/max/max/max\n quotient word. -/\ntheorem fullDivN1CallMaxmaxmaxQuotientWordV4_eq_div_of_semantic_facts\n {a0 a1 a2 a3 b0 b1 b2 b3 : Word}\n (hbnz : b0 |||... | [
{
"name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected_carry_semantic_facts",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 10,
"n_lines": 99,
"n_chars": 4656,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic... | 10 | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4
Caller-facing full-v4 wrappers for exact N1 DIV stack specs.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactNoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4PreloopCallMax
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64... | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4
Caller-facing full-v4 wrappers for exact N1 DIV stack specs.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactNoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4PreloopCallMax
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64... | @@ -369,6 +369,22 @@
match i with | 0 => b0 | 1 => b1 | 2 => b2 | 3 => b3)
exact h_correct.1
+/-- Package-form semantic bridge for the selected N1 v4 call/max/max/max
+ quotient word. -/
+theorem fullDivN1CallMaxmaxmaxQuotientWordV4_eq_div_of_semantic_facts
+ {a0 a1 a2 a3 b0 b1 b2 b3 : Word}
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3564d66d57c6_0 | 84295df05e572e28 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/MemoryExpansionGasSAsm.lean | MemoryExpansionGasSAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "memoryExpansionGas_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hsound := Stmt.retSound Region.empty RwRegion.empty memoryExpansionGasBody base ret\n \"memoryExpansionGas... | [
{
"name": "memoryExpansionGas_sp_post",
"text": "private theorem memoryExpansionGas_sp_post (oldBytes newBytes : Word) :\n ∀ rf ws A,\n Stmt.sp Region.empty RwRegion.empty memoryExpansionGasBody\n (memoryExpansionGasPre oldBytes newBytes) rf ws A →\n memoryExpansionGasPost oldBytes n... | [
{
"name": "memoryExpansionGas_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 25,
"n_chars": 1158,
"n_subproofs": 1,
"n_tactics": 16,
"cyclomatic": 3,
"n_automation": 8,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
"... | 1 | /-
EvmAsm.Codegen.Programs.MemoryExpansionGasSAsm
Byte-identical return-terminating SAsm proof for `memory_expansion_gas`.
The emitted routine has an early zero-return tail, so this uses `Stmt.retIf`
rather than the single-exit `Fn.Spec` path.
-/
import EvmAsm.Rv64.SAsm.StmtSound
import EvmAsm.Codegen.Program... | /-
EvmAsm.Codegen.Programs.MemoryExpansionGasSAsm
Byte-identical return-terminating SAsm proof for `memory_expansion_gas`.
The emitted routine has an early zero-return tail, so this uses `Stmt.retIf`
rather than the single-exit `Fn.Spec` path.
-/
import EvmAsm.Rv64.SAsm.StmtSound
import EvmAsm.Codegen.Program... | @@ -63,6 +63,31 @@
#guard !memoryExpansionGasBody.offsetsOk
#guard memoryExpansionGasBody.flatten 0 = memoryExpansionGas_prog
+private theorem memoryExpansionGas_sp_post (oldBytes newBytes : Word) :
+ ∀ rf ws A,
+ Stmt.sp Region.empty RwRegion.empty memoryExpansionGasBody
+ (memoryExpansionGasPre o... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_68848e982465_0 | ac83ad4b4435540c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3V4StackPre.lean | N3V4StackPre | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "evm_mod_n3_preloop_loop_stack_pre_spec_v4_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 41,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hSetup := evm_mod_n3_to_loopSetup_stack_pre_spec_v4_noNop\n sp base a b v5 v6 v7 v... | [
{
"name": "evm_mod_n3_to_loopSetup_stack_pre_spec_v4_noNop",
"text": "/-- EvmWord-level wrapper around the n=3 MOD v4/no-NOP path from dispatcher\n entry to loop setup, preserving the callable `x1` and v4 scratch frame. -/\ntheorem evm_mod_n3_to_loopSetup_stack_pre_spec_v4_noNop (sp base : Word)\n (a ... | [
{
"name": "evm_mod_n3_preloop_loop_stack_pre_spec_v4_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 153,
"n_chars": 8391,
"n_subproofs": 3,
"n_tactics": 42,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"autom... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N3V4StackPre
Legacy stack-level wrappers for n=3 DIV v4 preloop+loop paths with raw carry.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
import EvmAsm.Evm64.DivMod.Spec.CallablePost
import EvmAsm.Evm64.DivMod.Spec.N3QuotientWord
import EvmAsm.Evm64.DivMod.Spec.N3QuotientStackBridge
imp... | /-
EvmAsm.Evm64.DivMod.Spec.N3V4StackPre
Legacy stack-level wrappers for n=3 DIV v4 preloop+loop paths with raw carry.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
import EvmAsm.Evm64.DivMod.Spec.CallablePost
import EvmAsm.Evm64.DivMod.Spec.N3QuotientWord
import EvmAsm.Evm64.DivMod.Spec.N3QuotientStackBridge
imp... | @@ -19,6 +19,66 @@
open EvmAsm.Rv64.AddrNorm (word_add_zero)
/-- EvmWord-level wrapper around the n=3 MOD v4/no-NOP path from dispatcher
+ entry to loop setup, preserving the callable `x1` and v4 scratch frame. -/
+theorem evm_mod_n3_to_loopSetup_stack_pre_spec_v4_noNop (sp base : Word)
+ (a b : EvmWord)
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_68848e982465_1 | 696be8c44bb4409c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3V4StackPre.lean | N3V4StackPre | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "evm_mod_n3_stack_pre_to_unified_post_v4_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 38,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hA := evm_mod_n3_preloop_loop_stack_pre_spec_v4_noNop\n sp base a b v5 v6 v7 v10 v11... | [
{
"name": "evm_mod_n3_preloop_loop_stack_pre_spec_v4_noNop",
"text": "/-- EvmWord-level wrapper around the n=3 MOD v4/no-NOP path from dispatcher\n entry through the unified loop, preserving the callable `x1` and v4\n scratch frame. -/\ntheorem evm_mod_n3_preloop_loop_stack_pre_spec_v4_noNop (sp base ... | [
{
"name": "evm_mod_n3_stack_pre_to_unified_post_v4_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 129,
"n_chars": 6869,
"n_subproofs": 4,
"n_tactics": 39,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 8,
"automat... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.N3V4StackPre
Legacy stack-level wrappers for n=3 DIV v4 preloop+loop paths with raw carry.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
import EvmAsm.Evm64.DivMod.Spec.CallablePost
import EvmAsm.Evm64.DivMod.Spec.N3QuotientWord
import EvmAsm.Evm64.DivMod.Spec.N3QuotientStackBridge
imp... | /-
EvmAsm.Evm64.DivMod.Spec.N3V4StackPre
Legacy stack-level wrappers for n=3 DIV v4 preloop+loop paths with raw carry.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
import EvmAsm.Evm64.DivMod.Spec.CallablePost
import EvmAsm.Evm64.DivMod.Spec.N3QuotientWord
import EvmAsm.Evm64.DivMod.Spec.N3QuotientStackBridge
imp... | @@ -78,6 +78,158 @@
(by pcFree)
hraw)
+/-- EvmWord-level wrapper around the n=3 MOD v4/no-NOP path from dispatcher
+ entry through the unified loop, preserving the callable `x1` and v4
+ scratch frame. -/
+theorem evm_mod_n3_preloop_loop_stack_pre_spec_v4_noNop (sp base : Word)
+ (a b : EvmWord... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_68848e982465_2 | 7d1f1a893b7c795a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3V4StackPre.lean | N3V4StackPre | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "evm_div_n3_stack_pre_to_unified_post_v4_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 38,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hA := evm_div_n3_preloop_loop_stack_pre_spec_v4_noNop\n sp base a b v5 v6 v7 v10 v11... | [
{
"name": "evm_div_n3_preloop_loop_stack_pre_spec_v4_noNop",
"text": "/-- Legacy EvmWord-level wrapper around the n=3 exact-x1/scratch v4\n preloop+loop path over the no-NOP v4 body. It still exposes raw\n `Carry2NzAll`; prefer selected-carry wrappers for new v4 work. -/\ntheorem evm_div_n3_preloop_lo... | [
{
"name": "evm_div_n3_stack_pre_to_unified_post_v4_noNop",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 129,
"n_chars": 6852,
"n_subproofs": 4,
"n_tactics": 39,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 8,
"automat... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N3V4StackPre
Legacy stack-level wrappers for n=3 DIV v4 preloop+loop paths with raw carry.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
import EvmAsm.Evm64.DivMod.Spec.CallablePost
import EvmAsm.Evm64.DivMod.Spec.N3QuotientWord
import EvmAsm.Evm64.DivMod.Spec.N3QuotientStackBridge
imp... | /-
EvmAsm.Evm64.DivMod.Spec.N3V4StackPre
Legacy stack-level wrappers for n=3 DIV v4 preloop+loop paths with raw carry.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
import EvmAsm.Evm64.DivMod.Spec.CallablePost
import EvmAsm.Evm64.DivMod.Spec.N3QuotientWord
import EvmAsm.Evm64.DivMod.Spec.N3QuotientStackBridge
imp... | @@ -18,6 +18,139 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
+/-- Legacy EvmWord-level wrapper around the n=3 exact-x1/scratch v4
+ preloop+loop path over the no-NOP v4 body. It still exposes raw
+ `Carry2NzAll`; prefer selected-carry wrappers for new v4 work. -/
+theorem evm_div_n3_preloop_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_68848e982465_3 | 94b759e5df1d294a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3V4StackPre.lean | N3V4StackPre | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "evm_div_n3_stack_pre_to_unified_post_v4",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_divCode_noNop_v4_to_divCode_v4\n (evm_div_n3_stack_pre_to_unified_post_v4_... | [
{
"name": "evm_div_n3_stack_pre_to_unified_post_v4_noNop",
"text": "/-- Legacy raw-carry path through denormalization to the v4 final no-`x1`\n post, preserving the exact caller `x1`. -/\ntheorem evm_div_n3_stack_pre_to_unified_post_v4_noNop (sp base : Word)\n (a b : EvmWord)\n (v5 v6 v7 v10 v11Old... | [
{
"name": "evm_div_n3_stack_pre_to_unified_post_v4",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 97,
"n_chars": 5052,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.N3V4StackPre
Legacy stack-level wrappers for n=3 DIV v4 preloop+loop paths with raw carry.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
import EvmAsm.Evm64.DivMod.Spec.CallablePost
import EvmAsm.Evm64.DivMod.Spec.N3QuotientWord
import EvmAsm.Evm64.DivMod.Spec.N3QuotientStackBridge
imp... | /-
EvmAsm.Evm64.DivMod.Spec.N3V4StackPre
Legacy stack-level wrappers for n=3 DIV v4 preloop+loop paths with raw carry.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
import EvmAsm.Evm64.DivMod.Spec.CallablePost
import EvmAsm.Evm64.DivMod.Spec.N3QuotientWord
import EvmAsm.Evm64.DivMod.Spec.N3QuotientStackBridge
imp... | @@ -151,6 +151,134 @@
(fun _ hq => hq)
hrawNoNop
+/-- Legacy raw-carry path through denormalization to the v4 final no-`x1`
+ post, preserving the exact caller `x1`. -/
+theorem evm_div_n3_stack_pre_to_unified_post_v4_noNop (sp base : Word)
+ (a b : EvmWord)
+ (v5 v6 v7 v10 v11Old : Word)
+ (q0 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_68848e982465_4 | c37170e00a4d2dbe | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3V4StackPre.lean | N3V4StackPre | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "fullDivN3UnifiedPostNoX1V4_frame_to_divStackDispatchPostCallableExactFrame_scratch",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h hp\n rw [divStackDispatchPostCallableExactFram... | [
{
"name": "fullDivN3UnifiedPostNoX1V4_frame_to_divConcretePostNoX1ExactRegsFrame_scratch",
"text": "/-- Convert the n=3 v4 final post plus exact caller `x1` to the\n exact-register concrete DIV callable surface, preserving the v4 trial-call\n scratch cell that is not part of the public callable post. ... | [
{
"name": "fullDivN3UnifiedPostNoX1V4_frame_to_divStackDispatchPostCallableExactFrame_scratch",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 36,
"n_chars": 1668,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N3V4StackPre
Legacy stack-level wrappers for n=3 DIV v4 preloop+loop paths with raw carry.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
import EvmAsm.Evm64.DivMod.Spec.CallablePost
import EvmAsm.Evm64.DivMod.Spec.N3QuotientWord
import EvmAsm.Evm64.DivMod.Spec.N3QuotientStackBridge
imp... | /-
EvmAsm.Evm64.DivMod.Spec.N3V4StackPre
Legacy stack-level wrappers for n=3 DIV v4 preloop+loop paths with raw carry.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
import EvmAsm.Evm64.DivMod.Spec.CallablePost
import EvmAsm.Evm64.DivMod.Spec.N3QuotientWord
import EvmAsm.Evm64.DivMod.Spec.N3QuotientStackBridge
imp... | @@ -18,6 +18,126 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
+/-- Convert the n=3 v4 final post plus exact caller `x1` to the
+ exact-register concrete DIV callable surface, preserving the v4 trial-call
+ scratch cell that is not part of the public callable post. -/
+theorem fullDivN3Unified... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_68848e982465_5 | 9101d54e4521121a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3V4StackPre.lean | N3V4StackPre | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 2 | [
{
"theorem_name": "fullDivN3UnifiedPostNoX1V4_frame_to_divStackDispatchPostCallableExactFrame_scratch_word",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨hdiv0, hdiv1, hdiv2, hdiv3⟩ :=\n fullDi... | [
{
"name": "fullDivN3UnifiedPostNoX1V4_frame_to_divStackDispatchPostCallableExactFrame_scratch",
"text": "/-- Named callable-frame version of\n `fullDivN3UnifiedPostNoX1V4_frame_to_divConcretePostNoX1ExactRegsFrame_scratch`. -/\ntheorem fullDivN3UnifiedPostNoX1V4_frame_to_divStackDispatchPostCallableExact... | [
{
"name": "fullDivN3UnifiedPostNoX1V4_frame_to_divStackDispatchPostCallableExactFrame_scratch_word",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 37,
"n_chars": 1796,
"n_subproofs": 1,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.N3V4StackPre
Legacy stack-level wrappers for n=3 DIV v4 preloop+loop paths with raw carry.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
import EvmAsm.Evm64.DivMod.Spec.CallablePost
import EvmAsm.Evm64.DivMod.Spec.N3QuotientWord
import EvmAsm.Evm64.DivMod.Spec.N3QuotientStackBridge
imp... | /-
EvmAsm.Evm64.DivMod.Spec.N3V4StackPre
Legacy stack-level wrappers for n=3 DIV v4 preloop+loop paths with raw carry.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
import EvmAsm.Evm64.DivMod.Spec.CallablePost
import EvmAsm.Evm64.DivMod.Spec.N3QuotientWord
import EvmAsm.Evm64.DivMod.Spec.N3QuotientStackBridge
imp... | @@ -138,6 +138,41 @@
rw [word_add_zero] at hq
xperm_hyp hq
+/-- Named callable-frame version of
+ `fullDivN3UnifiedPostNoX1V4_frame_to_divConcretePostNoX1ExactRegsFrame_scratch`. -/
+theorem fullDivN3UnifiedPostNoX1V4_frame_to_divStackDispatchPostCallableExactFrame_scratch
+ (bltu_1 bltu_0 : Bool)
+ (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_68848e982465_6 | ccda4b740f96f879 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3V4StackPre.lean | N3V4StackPre | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 2 | [
{
"theorem_name": "fullDivN3UnifiedPostNoX1V4_frame_to_divStackDispatchPostCallableExactFrame_scratch_word",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨hdiv0, hdiv1, hdiv2, hdiv3⟩ :=\n fullDi... | [
{
"name": "fullDivN3UnifiedPostNoX1V4_frame_to_divStackDispatchPostCallableExactFrame_scratch",
"text": "/-- Named callable-frame version of\n `fullDivN3UnifiedPostNoX1V4_frame_to_divConcretePostNoX1ExactRegsFrame_scratch`. -/\ntheorem fullDivN3UnifiedPostNoX1V4_frame_to_divStackDispatchPostCallableExact... | [
{
"name": "evm_div_n3_stack_pre_to_callable_post_v4_scratch_noNop",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 115,
"n_chars": 5868,
"n_subproofs": 0,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 1,
... | 4 | /-
EvmAsm.Evm64.DivMod.Spec.N3V4StackPre
Legacy stack-level wrappers for n=3 DIV v4 preloop+loop paths with raw carry.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
import EvmAsm.Evm64.DivMod.Spec.CallablePost
import EvmAsm.Evm64.DivMod.Spec.N3QuotientWord
import EvmAsm.Evm64.DivMod.Spec.N3QuotientStackBridge
imp... | /-
EvmAsm.Evm64.DivMod.Spec.N3V4StackPre
Legacy stack-level wrappers for n=3 DIV v4 preloop+loop paths with raw carry.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
import EvmAsm.Evm64.DivMod.Spec.CallablePost
import EvmAsm.Evm64.DivMod.Spec.N3QuotientWord
import EvmAsm.Evm64.DivMod.Spec.N3QuotientStackBridge
imp... | @@ -399,6 +399,41 @@
rw [word_add_zero] at hq
xperm_hyp hq
+/-- Named callable-frame version of
+ `fullDivN3UnifiedPostNoX1V4_frame_to_divConcretePostNoX1ExactRegsFrame_scratch`. -/
+theorem fullDivN3UnifiedPostNoX1V4_frame_to_divStackDispatchPostCallableExactFrame_scratch
+ (bltu_1 bltu_0 : Bool)
+ (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_68848e982465_7 | 34d36771e16179d7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3V4StackPre.lean | N3V4StackPre | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 2 | [
{
"theorem_name": "fullDivN3UnifiedPostNoX1V4_frame_to_divStackDispatchPostCallableExactFrame_scratch_word",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨hdiv0, hdiv1, hdiv2, hdiv3⟩ :=\n fullDi... | [
{
"name": "fullDivN3UnifiedPostNoX1V4_frame_to_divStackDispatchPostCallableExactFrame_scratch",
"text": "/-- Named callable-frame version of\n `fullDivN3UnifiedPostNoX1V4_frame_to_divConcretePostNoX1ExactRegsFrame_scratch`. -/\ntheorem fullDivN3UnifiedPostNoX1V4_frame_to_divStackDispatchPostCallableExact... | [
{
"name": "evm_div_n3_stack_pre_to_callable_post_v4_scratch_word",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 111,
"n_chars": 5732,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
... | 5 | /-
EvmAsm.Evm64.DivMod.Spec.N3V4StackPre
Legacy stack-level wrappers for n=3 DIV v4 preloop+loop paths with raw carry.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
import EvmAsm.Evm64.DivMod.Spec.CallablePost
import EvmAsm.Evm64.DivMod.Spec.N3QuotientWord
import EvmAsm.Evm64.DivMod.Spec.N3QuotientStackBridge
imp... | /-
EvmAsm.Evm64.DivMod.Spec.N3V4StackPre
Legacy stack-level wrappers for n=3 DIV v4 preloop+loop paths with raw carry.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
import EvmAsm.Evm64.DivMod.Spec.CallablePost
import EvmAsm.Evm64.DivMod.Spec.N3QuotientWord
import EvmAsm.Evm64.DivMod.Spec.N3QuotientStackBridge
imp... | @@ -399,6 +399,41 @@
rw [word_add_zero] at hq
xperm_hyp hq
+/-- Named callable-frame version of
+ `fullDivN3UnifiedPostNoX1V4_frame_to_divConcretePostNoX1ExactRegsFrame_scratch`. -/
+theorem fullDivN3UnifiedPostNoX1V4_frame_to_divStackDispatchPostCallableExactFrame_scratch
+ (bltu_1 bltu_0 : Bool)
+ (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_68848e982465_8 | 43fbbb22b1ed52ae | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3V4StackPre.lean | N3V4StackPre | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 2 | [
{
"theorem_name": "fullDivN3UnifiedPostNoX1V4_frame_to_divStackDispatchPostCallableExactFrame_scratch_word",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨hdiv0, hdiv1, hdiv2, hdiv3⟩ :=\n fullDi... | [
{
"name": "fullDivN3UnifiedPostNoX1V4_frame_to_divStackDispatchPostCallableExactFrame_scratch",
"text": "/-- Named callable-frame version of\n `fullDivN3UnifiedPostNoX1V4_frame_to_divConcretePostNoX1ExactRegsFrame_scratch`. -/\ntheorem fullDivN3UnifiedPostNoX1V4_frame_to_divStackDispatchPostCallableExact... | [
{
"name": "evm_div_n3_stack_pre_to_callable_post_v4_scratch_of_mulsub_overestimate",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 50,
"n_chars": 2405,
"n_subproofs": 5,
"n_tactics": 20,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_str... | 6 | /-
EvmAsm.Evm64.DivMod.Spec.N3V4StackPre
Legacy stack-level wrappers for n=3 DIV v4 preloop+loop paths with raw carry.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
import EvmAsm.Evm64.DivMod.Spec.CallablePost
import EvmAsm.Evm64.DivMod.Spec.N3QuotientWord
import EvmAsm.Evm64.DivMod.Spec.N3QuotientStackBridge
imp... | /-
EvmAsm.Evm64.DivMod.Spec.N3V4StackPre
Legacy stack-level wrappers for n=3 DIV v4 preloop+loop paths with raw carry.
-/
import EvmAsm.Evm64.DivMod.Spec.Dispatcher
import EvmAsm.Evm64.DivMod.Spec.CallablePost
import EvmAsm.Evm64.DivMod.Spec.N3QuotientWord
import EvmAsm.Evm64.DivMod.Spec.N3QuotientStackBridge
imp... | @@ -399,6 +399,41 @@
rw [word_add_zero] at hq
xperm_hyp hq
+/-- Named callable-frame version of
+ `fullDivN3UnifiedPostNoX1V4_frame_to_divConcretePostNoX1ExactRegsFrame_scratch`. -/
+theorem fullDivN3UnifiedPostNoX1V4_frame_to_divStackDispatchPostCallableExactFrame_scratch
+ (bltu_1 bltu_0 : Bool)
+ (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_f3b06e1facab_0 | 44bf5d40b100766f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase2LongIter.lean | Phase2LongIter | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "rlp_phase2_long_iter_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 170,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [rlp_phase2_long_iter_post_unfold]\n rw [iter_code_split]\n -- Helpers: `signExtend12 1 = 1`... | [
{
"name": "rlp_phase2_long_iter_post_unfold",
"text": "theorem rlp_phase2_long_iter_post_unfold\n {len ptr cnt byteZext wordVal dwordAddr : Word} :\n rlp_phase2_long_iter_post len ptr cnt byteZext wordVal dwordAddr =\n ((.x11 ↦ᵣ ((len <<< 8) + byteZext)) **\n (.x13 ↦ᵣ (ptr + 1)) **\n (.x14 ... | [
{
"name": "rlp_phase2_long_iter_spec_within",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 186,
"n_chars": 9553,
"n_subproofs": 23,
"n_tactics": 154,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 16,
"n_structural": 2,
"automation_only":... | 3 | /-
EvmAsm.Rv64.RLP.Phase2LongIter
EL.3 Phase 2 (long form) — one full loop iteration body (no back-branch).
Extends the load-and-accumulate step with pointer and counter advance,
giving the 5-instruction body executed once per big-endian
length-of-length byte:
LBU x12, x13, 0 ; byte = mem[x13... | /-
EvmAsm.Rv64.RLP.Phase2LongIter
EL.3 Phase 2 (long form) — one full loop iteration body (no back-branch).
Extends the load-and-accumulate step with pointer and counter advance,
giving the 5-instruction body executed once per big-endian
length-of-length byte:
LBU x12, x13, 0 ; byte = mem[x13... | @@ -61,6 +61,19 @@
(.x11 ↦ᵣ length') ** (.x13 ↦ᵣ ptr') ** (.x14 ↦ᵣ cnt') **
(.x12 ↦ᵣ byteZext) ** (dwordAddr ↦ₘ wordVal)
+theorem rlp_phase2_long_iter_post_unfold
+ {len ptr cnt byteZext wordVal dwordAddr : Word} :
+ rlp_phase2_long_iter_post len ptr cnt byteZext wordVal dwordAddr =
+ ((.x11 ↦ᵣ ((len... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4ba81c03c9f4_0 | aea7547e8dca1df2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2V5NormScaled.lean | N2V5NormScaled | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 3 | [
{
"theorem_name": "fullDivN2R2V5_collapse_of_shape",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hv2 := fullDivN2NormV_v2_zero_of_shape_shift_nz b0 b1 b2 b3 hb2z hshift_nz\n have hv3 := fullDivN2No... | [
{
"name": "iterN2V5_collapse",
"text": "/-- Unified per-digit remainder collapse (both branches). -/\ntheorem iterN2V5_collapse (bltu : Bool) (v0 v1 u0 u1 u2 : Word)\n (hbnz : v0 ||| v1 ||| 0 ||| 0 ≠ 0)\n (hv1 : v1.toNat ≥ 2^63)\n (hvalid : val256 u0 u1 u2 0 < 2^64 * val256 v0 v1 0 0)\n (hcall :... | [
{
"name": "fullDivN2R2V5_collapse_of_shape",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 24,
"n_chars": 1867,
"n_subproofs": 8,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 2,
"automation_only": fals... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N2V5NormScaled
The n=2 val256-scaling normalization bridges — the divisor and dividend, after
the CLZ-of-`b1` left shift, have value equal to the original scaled by
`2^shift` (with the dividend carrying an overflow limb).
These are the n=2 analogs of `fullDivN1NormU_val256_eq_sca... | /-
EvmAsm.Evm64.DivMod.Spec.N2V5NormScaled
The n=2 val256-scaling normalization bridges — the divisor and dividend, after
the CLZ-of-`b1` left shift, have value equal to the original scaled by
`2^shift` (with the dividend carrying an overflow limb).
These are the n=2 analogs of `fullDivN1NormU_val256_eq_sca... | @@ -27,6 +27,24 @@
open EvmWord EvmAsm.Rv64
+/-- Unified per-digit remainder collapse (both branches). -/
+theorem iterN2V5_collapse (bltu : Bool) (v0 v1 u0 u1 u2 : Word)
+ (hbnz : v0 ||| v1 ||| 0 ||| 0 ≠ 0)
+ (hv1 : v1.toNat ≥ 2^63)
+ (hvalid : val256 u0 u1 u2 0 < 2^64 * val256 v0 v1 0 0)
+ (hcall : 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_4ba81c03c9f4_1 | 4f7d7dfb999e09ea | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2V5NormScaled.lean | N2V5NormScaled | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 3 | [
{
"theorem_name": "fullDivN2R2V5_collapse_of_shape",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hv2 := fullDivN2NormV_v2_zero_of_shape_shift_nz b0 b1 b2 b3 hb2z hshift_nz\n have hv3 := fullDivN2No... | [
{
"name": "iterN2V5_collapse",
"text": "/-- Unified per-digit remainder collapse (both branches). -/\ntheorem iterN2V5_collapse (bltu : Bool) (v0 v1 u0 u1 u2 : Word)\n (hbnz : v0 ||| v1 ||| 0 ||| 0 ≠ 0)\n (hv1 : v1.toNat ≥ 2^63)\n (hvalid : val256 u0 u1 u2 0 < 2^64 * val256 v0 v1 0 0)\n (hcall :... | [
{
"name": "fullDivN2R1V5_collapse_of_shape",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 25,
"n_chars": 2119,
"n_subproofs": 8,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 2,
"automation_only": fals... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N2V5NormScaled
The n=2 val256-scaling normalization bridges — the divisor and dividend, after
the CLZ-of-`b1` left shift, have value equal to the original scaled by
`2^shift` (with the dividend carrying an overflow limb).
These are the n=2 analogs of `fullDivN1NormU_val256_eq_sca... | /-
EvmAsm.Evm64.DivMod.Spec.N2V5NormScaled
The n=2 val256-scaling normalization bridges — the divisor and dividend, after
the CLZ-of-`b1` left shift, have value equal to the original scaled by
`2^shift` (with the dividend carrying an overflow limb).
These are the n=2 analogs of `fullDivN1NormU_val256_eq_sca... | @@ -27,6 +27,24 @@
open EvmWord EvmAsm.Rv64
+/-- Unified per-digit remainder collapse (both branches). -/
+theorem iterN2V5_collapse (bltu : Bool) (v0 v1 u0 u1 u2 : Word)
+ (hbnz : v0 ||| v1 ||| 0 ||| 0 ≠ 0)
+ (hv1 : v1.toNat ≥ 2^63)
+ (hvalid : val256 u0 u1 u2 0 < 2^64 * val256 v0 v1 0 0)
+ (hcall : 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_4ba81c03c9f4_2 | 665e6579dd03fb33 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2V5NormScaled.lean | N2V5NormScaled | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 3 | [
{
"theorem_name": "fullDivN2R2V5_collapse_of_shape",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hv2 := fullDivN2NormV_v2_zero_of_shape_shift_nz b0 b1 b2 b3 hb2z hshift_nz\n have hv3 := fullDivN2No... | [
{
"name": "iterN2V5_collapse",
"text": "/-- Unified per-digit remainder collapse (both branches). -/\ntheorem iterN2V5_collapse (bltu : Bool) (v0 v1 u0 u1 u2 : Word)\n (hbnz : v0 ||| v1 ||| 0 ||| 0 ≠ 0)\n (hv1 : v1.toNat ≥ 2^63)\n (hvalid : val256 u0 u1 u2 0 < 2^64 * val256 v0 v1 0 0)\n (hcall :... | [
{
"name": "fullDivN2R0V5_collapse_of_shape",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 25,
"n_chars": 2199,
"n_subproofs": 8,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 2,
"automation_only": fals... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N2V5NormScaled
The n=2 val256-scaling normalization bridges — the divisor and dividend, after
the CLZ-of-`b1` left shift, have value equal to the original scaled by
`2^shift` (with the dividend carrying an overflow limb).
These are the n=2 analogs of `fullDivN1NormU_val256_eq_sca... | /-
EvmAsm.Evm64.DivMod.Spec.N2V5NormScaled
The n=2 val256-scaling normalization bridges — the divisor and dividend, after
the CLZ-of-`b1` left shift, have value equal to the original scaled by
`2^shift` (with the dividend carrying an overflow limb).
These are the n=2 analogs of `fullDivN1NormU_val256_eq_sca... | @@ -27,6 +27,24 @@
open EvmWord EvmAsm.Rv64
+/-- Unified per-digit remainder collapse (both branches). -/
+theorem iterN2V5_collapse (bltu : Bool) (v0 v1 u0 u1 u2 : Word)
+ (hbnz : v0 ||| v1 ||| 0 ||| 0 ≠ 0)
+ (hv1 : v1.toNat ≥ 2^63)
+ (hvalid : val256 u0 u1 u2 0 < 2^64 * val256 v0 v1 0 0)
+ (hcall : 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_4ba81c03c9f4_3 | fdfcae1be1948e34 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2V5NormScaled.lean | N2V5NormScaled | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 3 | [
{
"theorem_name": "fullDivN2_first_window_valid",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h0 : (0:Word).toNat = 0 := rfl\n have hscaleU := fullDivN2NormU_val256_eq_scaled a0 a1 a2 a3 b1 hshift_... | [
{
"name": "fullDivN2NormU_val256_eq_scaled",
"text": "/-- **n=2 normalized dividend value (with overflow) = original scaled.** The\n CLZ-of-`b1` normalization of the dividend satisfies\n `val256 normU + overflow·2^256 = val256 a · 2^shift`. n=2 analog of\n `fullDivN1NormU_val256_eq_scaled`. -/\nth... | [
{
"name": "fullDivN2_first_window_valid",
"fan_in": 2,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 36,
"n_chars": 2167,
"n_subproofs": 10,
"n_tactics": 31,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 5,
"n_structural": 2,
"automation_only": false,... | 4 | /-
EvmAsm.Evm64.DivMod.Spec.N2V5NormScaled
The n=2 val256-scaling normalization bridges — the divisor and dividend, after
the CLZ-of-`b1` left shift, have value equal to the original scaled by
`2^shift` (with the dividend carrying an overflow limb).
These are the n=2 analogs of `fullDivN1NormU_val256_eq_sca... | /-
EvmAsm.Evm64.DivMod.Spec.N2V5NormScaled
The n=2 val256-scaling normalization bridges — the divisor and dividend, after
the CLZ-of-`b1` left shift, have value equal to the original scaled by
`2^shift` (with the dividend carrying an overflow limb).
These are the n=2 analogs of `fullDivN1NormU_val256_eq_sca... | @@ -27,6 +27,31 @@
open EvmWord EvmAsm.Rv64
+/-- **n=2 normalized dividend value (with overflow) = original scaled.** The
+ CLZ-of-`b1` normalization of the dividend satisfies
+ `val256 normU + overflow·2^256 = val256 a · 2^shift`. n=2 analog of
+ `fullDivN1NormU_val256_eq_scaled`. -/
+theorem fullDivN2N... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4ba81c03c9f4_4 | 8c325b95b018815d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2V5NormScaled.lean | N2V5NormScaled | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "fullDivN2_acc_quot_eq_div_of_shape",
"depth": 1,
"n_commands": 0,
"n_lines": 39,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h0 : (0:Word).toNat = 0 := rfl\n have hfwv := fullDivN2_first_window_valid a0 a1 a2 a3 b0 b1 b2 b... | [
{
"name": "fullDivN2R2V5_step_of_shape",
"text": "/-- **First-digit (R2) step over the normalized window.** Rewrites\n `fullDivN2R2V5` to expose `iterN2V5` over the 2-limb `normV` (using the\n shift≠0 shape lemmas) and applies the unified per-digit step\n `iterN2V5_step`. Gives the clean 2-limb Eu... | [
{
"name": "fullDivN2_acc_quot_eq_div_of_shape",
"fan_in": 0,
"n_deps_direct": 9,
"n_deps_transitive": 12,
"n_lines": 62,
"n_chars": 5528,
"n_subproofs": 20,
"n_tactics": 47,
"cyclomatic": 1,
"n_automation": 10,
"n_rewrites": 7,
"n_structural": 1,
"automation_only"... | 12 | /-
EvmAsm.Evm64.DivMod.Spec.N2V5NormScaled
The n=2 val256-scaling normalization bridges — the divisor and dividend, after
the CLZ-of-`b1` left shift, have value equal to the original scaled by
`2^shift` (with the dividend carrying an overflow limb).
These are the n=2 analogs of `fullDivN1NormU_val256_eq_sca... | /-
EvmAsm.Evm64.DivMod.Spec.N2V5NormScaled
The n=2 val256-scaling normalization bridges — the divisor and dividend, after
the CLZ-of-`b1` left shift, have value equal to the original scaled by
`2^shift` (with the dividend carrying an overflow limb).
These are the n=2 analogs of `fullDivN1NormU_val256_eq_sca... | @@ -78,6 +78,48 @@
rw [hsmod, antiShift_toNat_mod_eq h_shift_pos (clzResult_fst_toNat_le b1)]
exact EvmWord.val256_normalize h_shift_pos (by omega) b0 b1 0 0 (by simp)
+/-- **First-digit (R2) step over the normalized window.** Rewrites
+ `fullDivN2R2V5` to expose `iterN2V5` over the 2-limb `normV` (using the... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "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.