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_4ff3d0853523_0 | bf246160e6d9ea1d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2BltBranchShapeOnly.lean | N2BltBranchShapeOnly | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "loopBodyN2CallAddbackCarry2NzV4_at_canonical_bltu2_true_of_shape",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbnz_limbs := fullDivN2NormV_or_ne_zero_of_b1_ne_zero\n (b.getLimb... | [
{
"name": "fullDivN2NormV_or_ne_zero_of_b1_ne_zero",
"text": "/-- From N2 shape (`b1 ≠ 0`), the normalised v has a nonzero limb (because\n its second limb has MSB set, hence is positive). -/\nprivate theorem fullDivN2NormV_or_ne_zero_of_b1_ne_zero\n (b0 b1 b2 b3 : Word) (hb1nz : b1 ≠ 0) :\n (fullDi... | [
{
"name": "loopBodyN2CallAddbackCarry2NzV4_at_canonical_bltu2_true_of_shape",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 75,
"n_chars": 3619,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural"... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N2BltBranchShapeOnly
Shape-only closure form for the N2 j=2 BLT-branch predicate, obtained
by composing the BLT predicate bridge in `DivBltBridgeSpecializations`
with an inline derivation of the divisor-nonzero fact from N2 shape
(using `fullDivN2NormV_msb_of_b1_ne_zero` from `Div... | /-
EvmAsm.Evm64.DivMod.Spec.N2BltBranchShapeOnly
Shape-only closure form for the N2 j=2 BLT-branch predicate, obtained
by composing the BLT predicate bridge in `DivBltBridgeSpecializations`
with an inline derivation of the divisor-nonzero fact from N2 shape
(using `fullDivN2NormV_msb_of_b1_ne_zero` from `Div... | @@ -18,6 +18,29 @@
open EvmAsm.Rv64
+/-- From N2 shape (`b1 ≠ 0`), the normalised v has a nonzero limb (because
+ its second limb has MSB set, hence is positive). -/
+private theorem fullDivN2NormV_or_ne_zero_of_b1_ne_zero
+ (b0 b1 b2 b3 : Word) (hb1nz : b1 ≠ 0) :
+ (fullDivN2NormV b0 b1 b2 b3).1 |||
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4ff3d0853523_1 | 87a585bfa2dda228 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2BltBranchShapeOnly.lean | N2BltBranchShapeOnly | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "loopBodyN2CallAddbackCarry2NzV4_at_canonical_bltu2_true_of_shape",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbnz_limbs := fullDivN2NormV_or_ne_zero_of_b1_ne_zero\n (b.getLimb... | [
{
"name": "fullDivN2NormV_or_ne_zero_of_b1_ne_zero",
"text": "/-- From N2 shape (`b1 ≠ 0`), the normalised v has a nonzero limb (because\n its second limb has MSB set, hence is positive). -/\nprivate theorem fullDivN2NormV_or_ne_zero_of_b1_ne_zero\n (b0 b1 b2 b3 : Word) (hb1nz : b1 ≠ 0) :\n (fullDi... | [
{
"name": "loopBodyN2CallAddbackCarry2NzV4_at_canonical_bltu1_true_of_shape",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 93,
"n_chars": 4813,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural"... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N2BltBranchShapeOnly
Shape-only closure form for the N2 j=2 BLT-branch predicate, obtained
by composing the BLT predicate bridge in `DivBltBridgeSpecializations`
with an inline derivation of the divisor-nonzero fact from N2 shape
(using `fullDivN2NormV_msb_of_b1_ne_zero` from `Div... | /-
EvmAsm.Evm64.DivMod.Spec.N2BltBranchShapeOnly
Shape-only closure form for the N2 j=2 BLT-branch predicate, obtained
by composing the BLT predicate bridge in `DivBltBridgeSpecializations`
with an inline derivation of the divisor-nonzero fact from N2 shape
(using `fullDivN2NormV_msb_of_b1_ne_zero` from `Div... | @@ -18,6 +18,29 @@
open EvmAsm.Rv64
+/-- From N2 shape (`b1 ≠ 0`), the normalised v has a nonzero limb (because
+ its second limb has MSB set, hence is positive). -/
+private theorem fullDivN2NormV_or_ne_zero_of_b1_ne_zero
+ (b0 b1 b2 b3 : Word) (hb1nz : b1 ≠ 0) :
+ (fullDivN2NormV b0 b1 b2 b3).1 |||
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4ff3d0853523_2 | 807eeb0ac77ea527 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2BltBranchShapeOnly.lean | N2BltBranchShapeOnly | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "loopBodyN2CallAddbackCarry2NzV4_at_canonical_bltu2_true_of_shape",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbnz_limbs := fullDivN2NormV_or_ne_zero_of_b1_ne_zero\n (b.getLimb... | [
{
"name": "fullDivN2NormV_or_ne_zero_of_b1_ne_zero",
"text": "/-- From N2 shape (`b1 ≠ 0`), the normalised v has a nonzero limb (because\n its second limb has MSB set, hence is positive). -/\nprivate theorem fullDivN2NormV_or_ne_zero_of_b1_ne_zero\n (b0 b1 b2 b3 : Word) (hb1nz : b1 ≠ 0) :\n (fullDi... | [
{
"name": "loopBodyN2CallAddbackCarry2NzV4_at_canonical_bltu0_true_of_shape",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 93,
"n_chars": 4927,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural"... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N2BltBranchShapeOnly
Shape-only closure form for the N2 j=2 BLT-branch predicate, obtained
by composing the BLT predicate bridge in `DivBltBridgeSpecializations`
with an inline derivation of the divisor-nonzero fact from N2 shape
(using `fullDivN2NormV_msb_of_b1_ne_zero` from `Div... | /-
EvmAsm.Evm64.DivMod.Spec.N2BltBranchShapeOnly
Shape-only closure form for the N2 j=2 BLT-branch predicate, obtained
by composing the BLT predicate bridge in `DivBltBridgeSpecializations`
with an inline derivation of the divisor-nonzero fact from N2 shape
(using `fullDivN2NormV_msb_of_b1_ne_zero` from `Div... | @@ -18,6 +18,29 @@
open EvmAsm.Rv64
+/-- From N2 shape (`b1 ≠ 0`), the normalised v has a nonzero limb (because
+ its second limb has MSB set, hence is positive). -/
+private theorem fullDivN2NormV_or_ne_zero_of_b1_ne_zero
+ (b0 b1 b2 b3 : Word) (hb1nz : b1 ≠ 0) :
+ (fullDivN2NormV b0 b1 b2 b3).1 |||
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_d288209d13fe_0 | a29ea56744d13d64 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Terminating/ReturnHaltResolved.lean | ReturnHaltResolved | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_return_stack_spec_resolved",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n evm_return_stack_spec_within\n (hiSCM := laHi (hbase + 8) scmAddr) (loSCM := laLo (hbase + 8) scmAddr)\n ... | [
{
"name": "evm_return_halt_spec_resolved",
"text": "/-- **The RETURN/REVERT halt core with the `la`s resolved**: immediates\n computed by `laHi`/`laLo`; the former `hla2`/`hla1` are `la_resolve`\n facts. Only displacement representability remains per `la`. -/\ntheorem evm_return_halt_spec_resolved (h... | [
{
"name": "evm_return_stack_spec_resolved",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 76,
"n_chars": 4708,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false... | 1 | /-
EvmAsm.Evm64.Terminating.ReturnHaltResolved
**RETURN's `la` reconstruction hypotheses, retired** (bead evm-asm-85699,
acceptance (b)).
`evm_return_halt_spec_within` and `evm_return_stack_spec_within` carry
the linker `la`s (`evm_halt_flag`, `.Ldispatch_resume`,
`system_call_mode`, `evm_memory` ×2) as A... | /-
EvmAsm.Evm64.Terminating.ReturnHaltResolved
**RETURN's `la` reconstruction hypotheses, retired** (bead evm-asm-85699,
acceptance (b)).
`evm_return_halt_spec_within` and `evm_return_stack_spec_within` carry
the linker `la`s (`evm_halt_flag`, `.Ldispatch_resume`,
`system_call_mode`, `evm_memory` ×2) as A... | @@ -32,6 +32,26 @@
open EvmAsm.Rv64
+/-- **The RETURN/REVERT halt core with the `la`s resolved**: immediates
+ computed by `laHi`/`laLo`; the former `hla2`/`hla1` are `la_resolve`
+ facts. Only displacement representability remains per `la`. -/
+theorem evm_return_halt_spec_resolved (hbase flag resume v5 v6... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ad1e7c332860_0 | d716db30d6aa5444 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase2LongLoopBody.lean | Phase2LongLoopBody | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "rlp_phase2_long_loop_body_post_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hp hpost\n simp only [rlp_phase2_long_loop_body_post_unfold] at hpost\n open EvmAsm.Rv64.Tactic... | [
{
"name": "rlp_phase2_long_loop_body_post_unfold",
"text": "theorem rlp_phase2_long_loop_body_post_unfold\n (len ptr cnt byteZext wordVal dwordAddr : Word) (P : Prop) :\n rlp_phase2_long_loop_body_post len ptr cnt byteZext wordVal dwordAddr P =\n ((.x11 ↦ᵣ ((len <<< 8) + byteZext)) **\n (.x13 ↦... | [
{
"name": "rlp_phase2_long_loop_body_post_pure",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 842,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": fa... | 1 | /-
EvmAsm.Rv64.RLP.Phase2LongLoopBody
EL.3 Phase 2 (long form) — full loop body with back-branch.
Extends the 5-instruction iteration body with a `BNE x14, x0, back`
tail:
LBU x12, x13, 0 ; byte = mem[x13]
SLLI x11, x11, 8 ; length <<= 8
ADD x11, x11, x12 ; length += by... | /-
EvmAsm.Rv64.RLP.Phase2LongLoopBody
EL.3 Phase 2 (long form) — full loop body with back-branch.
Extends the 5-instruction iteration body with a `BNE x14, x0, back`
tail:
LBU x12, x13, 0 ; byte = mem[x13]
SLLI x11, x11, 8 ; length <<= 8
ADD x11, x11, x12 ; length += by... | @@ -65,6 +65,25 @@
(.x12 ↦ᵣ byteZext) ** (.x0 ↦ᵣ (0 : Word)) **
(dwordAddr ↦ₘ wordVal) ** ⌜P⌝
+theorem rlp_phase2_long_loop_body_post_unfold
+ (len ptr cnt byteZext wordVal dwordAddr : Word) (P : Prop) :
+ rlp_phase2_long_loop_body_post len ptr cnt byteZext wordVal dwordAddr P =
+ ((.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_ad1e7c332860_1 | 6bc5a05cd8bbb564 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase2LongLoopBody.lean | Phase2LongLoopBody | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "rlp_phase2_long_loop_body_post_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hp hpost\n simp only [rlp_phase2_long_loop_body_post_unfold] at hpost\n open EvmAsm.Rv64.Tactic... | [
{
"name": "rlp_phase2_long_loop_body_post_unfold",
"text": "theorem rlp_phase2_long_loop_body_post_unfold\n (len ptr cnt byteZext wordVal dwordAddr : Word) (P : Prop) :\n rlp_phase2_long_loop_body_post len ptr cnt byteZext wordVal dwordAddr P =\n ((.x11 ↦ᵣ ((len <<< 8) + byteZext)) **\n (.x13 ↦... | [
{
"name": "rlp_phase2_long_loop_body_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 130,
"n_chars": 6372,
"n_subproofs": 12,
"n_tactics": 94,
"cyclomatic": 2,
"n_automation": 13,
"n_rewrites": 3,
"n_structural": 8,
"automation_on... | 1 | /-
EvmAsm.Rv64.RLP.Phase2LongLoopBody
EL.3 Phase 2 (long form) — full loop body with back-branch.
Extends the 5-instruction iteration body with a `BNE x14, x0, back`
tail:
LBU x12, x13, 0 ; byte = mem[x13]
SLLI x11, x11, 8 ; length <<= 8
ADD x11, x11, x12 ; length += by... | /-
EvmAsm.Rv64.RLP.Phase2LongLoopBody
EL.3 Phase 2 (long form) — full loop body with back-branch.
Extends the 5-instruction iteration body with a `BNE x14, x0, back`
tail:
LBU x12, x13, 0 ; byte = mem[x13]
SLLI x11, x11, 8 ; length <<= 8
ADD x11, x11, x12 ; length += by... | @@ -65,6 +65,25 @@
(.x12 ↦ᵣ byteZext) ** (.x0 ↦ᵣ (0 : Word)) **
(dwordAddr ↦ₘ wordVal) ** ⌜P⌝
+theorem rlp_phase2_long_loop_body_post_unfold
+ (len ptr cnt byteZext wordVal dwordAddr : Word) (P : Prop) :
+ rlp_phase2_long_loop_body_post len ptr cnt byteZext wordVal dwordAddr P =
+ ((.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_df96e88a9b61_0 | eb10e3f258d19a8b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Proofs/HandlerHandles.lean | HandlerHandles | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "evmAddHandle_sound",
"depth": 1,
"n_commands": 0,
"n_lines": 131,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro rf₀ ws₀ A₀ hlen hApc hpre ret halign\n rw [sepConj_comm' ((.x1 : Reg) ↦ᵣ ret)\n (asrtM Region.empty ⟨sp, 64⟩... | [
{
"name": "wsDword_lo",
"text": "/-- A window read of a low dword (offset `< 32`) of the popped exit window\n equals the same read of the entry window (the top word is untouched). -/\ntheorem wsDword_lo (ws suf : List (BitVec 8)) (k : Nat)\n (hk : k + 8 ≤ 32) (hws : 32 ≤ ws.length) :\n wsDword (ws.... | [
{
"name": "evmAddHandle_sound",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 144,
"n_chars": 7699,
"n_subproofs": 25,
"n_tactics": 138,
"cyclomatic": 2,
"n_automation": 36,
"n_rewrites": 27,
"n_structural": 19,
"automation_only": false,
... | 5 | /-
EvmAsm.Codegen.Proofs.HandlerHandles
Bead evm-asm-4ch8f.10.1 — package the verified clean-ret handler specs
(`Codegen/Proofs/HandlerSpecs.lean`) as snapshot-parameterized dispatch
handles (`FnHandleS`, `docs/4ch8f-interp-strategy.md` §3), consumed by the
interpreter dispatch loop (`.callRegS`, bead `.49`)... | /-
EvmAsm.Codegen.Proofs.HandlerHandles
Bead evm-asm-4ch8f.10.1 — package the verified clean-ret handler specs
(`Codegen/Proofs/HandlerSpecs.lean`) as snapshot-parameterized dispatch
handles (`FnHandleS`, `docs/4ch8f-interp-strategy.md` §3), consumed by the
interpreter dispatch loop (`.callRegS`, bead `.49`)... | @@ -95,6 +95,17 @@
show sp + 48 + 8 = sp + 56 from by bv_omega]
simp only [wsDword, Nat.reduceAdd, List.drop_zero]
+/-- A window read of a low dword (offset `< 32`) of the popped exit window
+ equals the same read of the entry window (the top word is untouched). -/
+theorem wsDword_lo (ws suf : List (BitVe... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_d0e680305b79_0 | 99dce1156bb47691 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254CurveZeroSAsm.lean | Bn254CurveZeroSAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "bncZero64Fn_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 62,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbase : (bncZero64Fn dst orig).rw.base = dst := rfl\n vcgen\n case region => exact ⟨Region.empty_wf, hwf⟩\n case ... | [
{
"name": "zeroStepRf_get_x10",
"text": "theorem zeroStepRf_get_x10 (rf : RegFile) :\n (zeroStepRf rf).get .x10 = rf.get .x10 + signExtend12 (1 : BitVec 12) := by\n unfold zeroStepRf\n simp only [RegFile.get_set_self, RegFile.get_set_ne, ne_eq, reduceCtorEq, not_false_eq_true]\n\n",
"fan_in": 1,
... | [
{
"name": "bncZero64Fn_spec",
"fan_in": 0,
"n_deps_direct": 6,
"n_deps_transitive": 6,
"n_lines": 66,
"n_chars": 2719,
"n_subproofs": 8,
"n_tactics": 64,
"cyclomatic": 11,
"n_automation": 30,
"n_rewrites": 15,
"n_structural": 17,
"automation_only": false,
"max... | 6 | /-
EvmAsm.Codegen.Programs.Bn254CurveZeroSAsm
Verified SAsm port of `bnc_zero64`: zero a 64-byte BN254 affine point
buffer using the emitted alignment-free byte loop.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.Tactic
import EvmAsm.Codegen.Programs.Bn254Curve
namespace EvmAsm.Codegen
open Ev... | /-
EvmAsm.Codegen.Programs.Bn254CurveZeroSAsm
Verified SAsm port of `bnc_zero64`: zero a 64-byte BN254 affine point
buffer using the emitted alignment-free byte loop.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.Tactic
import EvmAsm.Codegen.Programs.Bn254Curve
namespace EvmAsm.Codegen
open Ev... | @@ -51,6 +51,11 @@
let r1 := rf.set .x10 (rf.get .x10 + signExtend12 (1 : BitVec 12))
r1.set .x5 (r1.get .x5 + signExtend12 (-1 : BitVec 12))
+theorem zeroStepRf_get_x10 (rf : RegFile) :
+ (zeroStepRf rf).get .x10 = rf.get .x10 + signExtend12 (1 : BitVec 12) := by
+ unfold zeroStepRf
+ simp only [RegFile.g... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e152da1b56a6_0 | ccf0dd5bc41153a6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/NormAV5.lean | NormAV5 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "divK_normA_full_spec_within_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 115,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [divKNormAFullPreNoNop_unfold, normAFullPost_unfold]\n let u4 := a3 >>> (antiShift.toNat % 64)\n... | [
{
"name": "divK_normA_code_sub_divCode_noNop_v5",
"text": "/-- The normA block instructions are subsumed by `divCode_noNop_v5`. -/\nprivate theorem divK_normA_code_sub_divCode_noNop_v5 {base : Word} :\n ∀ a i, (CodeReq.ofProg (base + normAOff) (divK_normA 40)) a = some i →\n (divCode_noNop_v5 base) ... | [
{
"name": "divK_normA_full_spec_within_v5_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 123,
"n_chars": 7378,
"n_subproofs": 25,
"n_tactics": 118,
"cyclomatic": 1,
"n_automation": 22,
"n_rewrites": 16,
"n_structural": 6,
"automation_o... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.NormAV5
v5 normalize-A brick (21 steps, normAOff → loopSetupOff) over `divCode_noNop_v5`.
Mirror of `divK_normA_full_spec_within_v4_noNop` (NormA.lean): the normA
instructions don't touch div128, so the same version-agnostic instruction bodies
are extended to the v5 code via th... | /-
EvmAsm.Evm64.DivMod.Compose.NormAV5
v5 normalize-A brick (21 steps, normAOff → loopSetupOff) over `divCode_noNop_v5`.
Mirror of `divK_normA_full_spec_within_v4_noNop` (NormA.lean): the normA
instructions don't touch div128, so the same version-agnostic instruction bodies
are extended to the v5 code via th... | @@ -16,13 +16,134 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (se12_0 se12_8 se12_16 se12_24)
+/-- The normA block instructions are subsumed by `divCode_noNop_v5`. -/
+private theorem divK_normA_code_sub_divCode_noNop_v5 {base : Word} :
+ ∀ a i, (CodeReq.ofProg (base + normAOff) (divK_normA 40)) a = so... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_635fec3c8959_0 | a81f6be7f127dbba | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/LoadArgs.lean | LoadArgs | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "loadedWordFromArgs_loadArgs_of_ge_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact loadedWordFromArgs_of_ge_length h",
"n_chars": 45,
"n_subproofs": 0,
"n_tactics"... | [
{
"name": "loadedWordFromArgs_of_ge_length",
"text": "theorem loadedWordFromArgs_of_ge_length\n {data : List (BitVec 8)} {args : Args}\n (h : data.length ≤ offsetNat args) :\n loadedWordFromArgs data args = 0 := by\n exact Calldata.callDataLoadWord_of_ge_length h\n\n",
"fan_in": 1,
"n_line... | [
{
"name": "loadedWordFromArgs_loadArgs_of_ge_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 237,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only"... | 1 | /-
EvmAsm.Evm64.Calldata.LoadArgs
Pure stack-argument record for CALLDATALOAD (GH #104).
-/
import EvmAsm.Evm64.Calldata.Basic
namespace EvmAsm.Evm64
namespace CallDataLoadArgs
/-- CALLDATALOAD stack arguments: the calldata byte offset to load from. -/
structure Args where
offset : EvmWord
deriving Repr
/-... | /-
EvmAsm.Evm64.Calldata.LoadArgs
Pure stack-argument record for CALLDATALOAD (GH #104).
-/
import EvmAsm.Evm64.Calldata.Basic
namespace EvmAsm.Evm64
namespace CallDataLoadArgs
/-- CALLDATALOAD stack arguments: the calldata byte offset to load from. -/
structure Args where
offset : EvmWord
deriving Repr
/-... | @@ -44,10 +44,17 @@
loadedWordFromArgs [] (loadArgs offset) = 0 := by
simp [loadedWordFromArgs, loadArgs, offsetNat, Calldata.callDataLoadWord_nil]
+theorem loadedWordFromArgs_of_ge_length
+ {data : List (BitVec 8)} {args : Args}
+ (h : data.length ≤ offsetNat args) :
+ loadedWordFromArgs data args =... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e47721123ae3_0 | e77fd5387c369699 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/GasRoutinesSAsm.lean | GasRoutinesSAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 3 | [
{
"theorem_name": "copyWordGasFn_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n vcgen\n case copyWordGas.post =>\n rintro rf' ws' A' ⟨rf₀, ws₀, hws₀, hpre, rfl, rfl⟩\n obtain ⟨hx10, hA⟩ := hpr... | [
{
"name": "se12_31",
"text": "private theorem se12_31 : signExtend12 (31 : BitVec 12) = (31 : Word) := by decide\n\n",
"fan_in": 3,
"n_lines": 3,
"n_chars": 84,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"... | [
{
"name": "copyWordGasFn_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 932,
"n_subproofs": 2,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
"max_ne... | 1 | /-
EvmAsm.Codegen.Programs.GasRoutinesSAsm
Verified SAsm ports of the straight-line dynamic-gas leaves (bead
evm-asm-4ch8f): pure `a0 → a0` register arithmetic, no memory, no
loops, no calls. Each routine pins `x10_out` to the exact closed form
the 4–7 body instructions compute (a genuine functional spec, n... | /-
EvmAsm.Codegen.Programs.GasRoutinesSAsm
Verified SAsm ports of the straight-line dynamic-gas leaves (bead
evm-asm-4ch8f): pure `a0 → a0` register arithmetic, no memory, no
loops, no calls. Each routine pins `x10_out` to the exact closed form
the 4–7 body instructions compute (a genuine functional spec, n... | @@ -41,11 +41,23 @@
.LI .x6 (3 : Word),
.MUL .x10 .x5 .x6 ]
+private theorem se12_31 : signExtend12 (31 : BitVec 12) = (31 : Word) := by decide
+
/-- Specification: at every entry state with `a0 = len` and an empty
ambient assertion, the body leaves `a0 = 3 * ((len + 31) >>> 5)` and
the ambie... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e47721123ae3_1 | 23c26a139d6f1dc2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/GasRoutinesSAsm.lean | GasRoutinesSAsm | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 3 | [
{
"theorem_name": "copyWordGasFn_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n vcgen\n case copyWordGas.post =>\n rintro rf' ws' A' ⟨rf₀, ws₀, hws₀, hpre, rfl, rfl⟩\n obtain ⟨hx10, hA⟩ := hpr... | [
{
"name": "se12_31",
"text": "private theorem se12_31 : signExtend12 (31 : BitVec 12) = (31 : Word) := by decide\n\n",
"fan_in": 3,
"n_lines": 3,
"n_chars": 84,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"... | [
{
"name": "keccak256WordGasFn_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 17,
"n_chars": 756,
"n_subproofs": 2,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
"m... | 2 | /-
EvmAsm.Codegen.Programs.GasRoutinesSAsm
Verified SAsm ports of the straight-line dynamic-gas leaves (bead
evm-asm-4ch8f): pure `a0 → a0` register arithmetic, no memory, no
loops, no calls. Each routine pins `x10_out` to the exact closed form
the 4–7 body instructions compute (a genuine functional spec, n... | /-
EvmAsm.Codegen.Programs.GasRoutinesSAsm
Verified SAsm ports of the straight-line dynamic-gas leaves (bead
evm-asm-4ch8f): pure `a0 → a0` register arithmetic, no memory, no
loops, no calls. Each routine pins `x10_out` to the exact closed form
the 4–7 body instructions compute (a genuine functional spec, n... | @@ -41,6 +41,8 @@
.LI .x6 (3 : Word),
.MUL .x10 .x5 .x6 ]
+private theorem se12_31 : signExtend12 (31 : BitVec 12) = (31 : Word) := by decide
+
/-- Verified port of `keccak256_word_gas`:
`a0 := ((len + 31) >>> 5) * 6 + 30`. -/
def keccak256WordGasFn (len : Word) : Fn where
@@ -63,7 +65,17 @@
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e47721123ae3_2 | f12738d62cd11ad4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/GasRoutinesSAsm.lean | GasRoutinesSAsm | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 3 | [
{
"theorem_name": "copyWordGasFn_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n vcgen\n case copyWordGas.post =>\n rintro rf' ws' A' ⟨rf₀, ws₀, hws₀, hpre, rfl, rfl⟩\n obtain ⟨hx10, hA⟩ := hpr... | [
{
"name": "se12_31",
"text": "private theorem se12_31 : signExtend12 (31 : BitVec 12) = (31 : Word) := by decide\n\n",
"fan_in": 3,
"n_lines": 3,
"n_chars": 84,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"... | [
{
"name": "initCodeCostFn_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 50,
"n_chars": 2668,
"n_subproofs": 10,
"n_tactics": 44,
"cyclomatic": 3,
"n_automation": 16,
"n_rewrites": 4,
"n_structural": 9,
"automation_only": false,
"ma... | 2 | /-
EvmAsm.Codegen.Programs.GasRoutinesSAsm
Verified SAsm ports of the straight-line dynamic-gas leaves (bead
evm-asm-4ch8f): pure `a0 → a0` register arithmetic, no memory, no
loops, no calls. Each routine pins `x10_out` to the exact closed form
the 4–7 body instructions compute (a genuine functional spec, n... | /-
EvmAsm.Codegen.Programs.GasRoutinesSAsm
Verified SAsm ports of the straight-line dynamic-gas leaves (bead
evm-asm-4ch8f): pure `a0 → a0` register arithmetic, no memory, no
loops, no calls. Each routine pins `x10_out` to the exact closed form
the 4–7 body instructions compute (a genuine functional spec, n... | @@ -41,6 +41,8 @@
.LI .x6 (3 : Word),
.MUL .x10 .x5 .x6 ]
+private theorem se12_31 : signExtend12 (31 : BitVec 12) = (31 : Word) := by decide
+
/-- Verified port of `keccak256_word_gas`:
`a0 := ((len + 31) >>> 5) * 6 + 30`. -/
def keccak256WordGasFn (len : Word) : Fn where
@@ -132,9 +134,22 @@
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0edcddd25471_0 | 9b2e249e46f0901f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2.lean | FullPathN2 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "evm_div_n2_to_normB_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 41,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let shift := (clzResult b1).1\n let antiShift := signExtend12 (0 : BitVec 12) - shift\n have hABCL... | [
{
"name": "evm_div_phaseAB_n2_clz_spec_within_noNop",
"text": "/-- No-NOP variant of `evm_div_phaseAB_n2_clz_spec_within`. -/\ntheorem evm_div_phaseAB_n2_clz_spec_within_noNop (sp base : Word)\n (b0 b1 b2 b3 v5 v6 v7 v10 : Word)\n (q0 q1 q2 q3 u5 u6 u7 nMem : Word)\n (hbnz : b0 ||| b1 ||| b2 ||| b3... | [
{
"name": "evm_div_n2_to_normB_spec_within_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 61,
"n_chars": 3580,
"n_subproofs": 8,
"n_tactics": 42,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automation_only"... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2
Full path compositions for b[3]=b[2]=0, b[1]≠0 (n=2) case.
Mirrors FullPath.lean but with Phase B n=2 and CLZ on b1.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
import EvmAsm.Evm64.DivMod.Compose.CLZ
import EvmAsm.Evm64.... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2
Full path compositions for b[3]=b[2]=0, b[1]≠0 (n=2) case.
Mirrors FullPath.lean but with Phase B n=2 and CLZ on b1.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
import EvmAsm.Evm64.DivMod.Compose.CLZ
import EvmAsm.Evm64.... | @@ -21,6 +21,62 @@
-- Phase A(ntaken) + Phase B(n=2) + CLZ: base → base+212
-- ============================================================================
+/-- No-NOP variant of `evm_div_phaseAB_n2_clz_spec_within`. -/
+theorem evm_div_phaseAB_n2_clz_spec_within_noNop (sp base : Word)
+ (b0 b1 b2 b3 v5 v6 v7 v1... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0edcddd25471_1 | fcd470ee0bfc1c95 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2.lean | FullPathN2 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "evm_div_n2_to_normB_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 41,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let shift := (clzResult b1).1\n let antiShift := signExtend12 (0 : BitVec 12) - shift\n have hABCL... | [
{
"name": "evm_div_phaseAB_n2_clz_spec_within_noNop",
"text": "/-- No-NOP variant of `evm_div_phaseAB_n2_clz_spec_within`. -/\ntheorem evm_div_phaseAB_n2_clz_spec_within_noNop (sp base : Word)\n (b0 b1 b2 b3 v5 v6 v7 v10 : Word)\n (q0 q1 q2 q3 u5 u6 u7 nMem : Word)\n (hbnz : b0 ||| b1 ||| b2 ||| b3... | [
{
"name": "evm_div_n2_to_loopSetup_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 91,
"n_chars": 5534,
"n_subproofs": 8,
"n_tactics": 69,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 1,
"automation_o... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2
Full path compositions for b[3]=b[2]=0, b[1]≠0 (n=2) case.
Mirrors FullPath.lean but with Phase B n=2 and CLZ on b1.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
import EvmAsm.Evm64.DivMod.Compose.CLZ
import EvmAsm.Evm64.... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2
Full path compositions for b[3]=b[2]=0, b[1]≠0 (n=2) case.
Mirrors FullPath.lean but with Phase B n=2 and CLZ on b1.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
import EvmAsm.Evm64.DivMod.Compose.CLZ
import EvmAsm.Evm64.... | @@ -21,6 +21,62 @@
-- Phase A(ntaken) + Phase B(n=2) + CLZ: base → base+212
-- ============================================================================
+/-- No-NOP variant of `evm_div_phaseAB_n2_clz_spec_within`. -/
+theorem evm_div_phaseAB_n2_clz_spec_within_noNop (sp base : Word)
+ (b0 b1 b2 b3 v5 v6 v7 v1... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0edcddd25471_2 | e63970a7fa07eabe | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2.lean | FullPathN2 | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "evm_div_n2_to_loopSetup_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 112,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let shift := (clzResult b1).1\n let antiShift := signExtend12 (0 : BitVec 12) - shift\n let b3' := ... | [
{
"name": "evm_div_phaseAB_n2_clz_spec_within",
"text": "/-- DIV PhaseAB(n=2) + CLZ: b≠0, b[3]=b[2]=0, b[1]≠0.\n base → base+212. CLZ on b1, x6 = shift = clzResult(b1).1. -/\ntheorem evm_div_phaseAB_n2_clz_spec_within (sp base : Word)\n (b0 b1 b2 b3 v5 v6 v7 v10 : Word)\n (q0 q1 q2 q3 u5 u6 u7 nMem... | [
{
"name": "evm_div_n2_to_loopSetup_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 135,
"n_chars": 8221,
"n_subproofs": 14,
"n_tactics": 107,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 1,
"automation_only... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2
Full path compositions for b[3]=b[2]=0, b[1]≠0 (n=2) case.
Mirrors FullPath.lean but with Phase B n=2 and CLZ on b1.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
import EvmAsm.Evm64.DivMod.Compose.CLZ
import EvmAsm.Evm64.... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2
Full path compositions for b[3]=b[2]=0, b[1]≠0 (n=2) case.
Mirrors FullPath.lean but with Phase B n=2 and CLZ on b1.
-/
import EvmAsm.Evm64.DivMod.Compose.PhaseAB
import EvmAsm.Evm64.DivMod.Compose.PhaseABNoNop
import EvmAsm.Evm64.DivMod.Compose.CLZ
import EvmAsm.Evm64.... | @@ -21,6 +21,66 @@
-- Phase A(ntaken) + Phase B(n=2) + CLZ: base → base+212
-- ============================================================================
+/-- DIV PhaseAB(n=2) + CLZ: b≠0, b[3]=b[2]=0, b[1]≠0.
+ base → base+212. CLZ on b1, x6 = shift = clzResult(b1).1. -/
+theorem evm_div_phaseAB_n2_clz_spec_wi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2857efda93cf_0 | 5d0f8d4549452a79 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/ByteOps.lean | ByteOps | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "extractByte_replaceByte_same",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n fin_cases pos <;> first\n | exact erbs_0 w b | exact erbs_1 w b | exact erbs_2 w b | exact erbs_3 w b\n ... | [
{
"name": "erbs_5",
"text": "private theorem erbs_5 (w : Word) (b : BitVec 8) :\n extractByte (replaceByte w 5 b) 5 = b := by\n simp only [extractByte, replaceByte]; byte_algebra\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 152,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
... | [
{
"name": "extractByte_replaceByte_same",
"fan_in": 0,
"n_deps_direct": 8,
"n_deps_transitive": 8,
"n_lines": 9,
"n_chars": 393,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 8,
"automation_only": false,
... | 8 | /-
EvmAsm.Rv64.ByteOps
Byte-level infrastructure: extractByte/replaceByte algebra and
generic CPS specs for LBU (load byte unsigned) and SB (store byte).
-/
-- `CPSSpec` transitively imports `Basic`, `SepLogic`, and `Execution`.
import EvmAsm.Rv64.CPSSpec
import Mathlib.Tactic.IntervalCases
import Mathlib.Tactic... | /-
EvmAsm.Rv64.ByteOps
Byte-level infrastructure: extractByte/replaceByte algebra and
generic CPS specs for LBU (load byte unsigned) and SB (store byte).
-/
-- `CPSSpec` transitively imports `Basic`, `SepLogic`, and `Execution`.
import EvmAsm.Rv64.CPSSpec
import Mathlib.Tactic.IntervalCases
import Mathlib.Tactic... | @@ -33,6 +33,9 @@
private theorem erbs_4 (w : Word) (b : BitVec 8) :
extractByte (replaceByte w 4 b) 4 = b := by
simp only [extractByte, replaceByte]; byte_algebra
+private theorem erbs_5 (w : Word) (b : BitVec 8) :
+ extractByte (replaceByte w 5 b) 5 = b := by
+ simp only [extractByte, replaceByte]; byte_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2857efda93cf_1 | fa61302e84935335 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/ByteOps.lean | ByteOps | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "generic_lbu_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 28,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro R hR s hcr hPR hpc; subst hpc\n have hfetch : s.code s.pc = some (.LBU rd rs1 offset) :=\n CodeReq.singl... | [
{
"name": "getByte_eq",
"text": "theorem getByte_eq {s : MachineState} {addr : Word} :\n s.getByte addr = extractByte (s.getMem (alignToDword addr)) (byteOffset addr) := rfl\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 144,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_... | [
{
"name": "generic_lbu_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 46,
"n_chars": 2306,
"n_subproofs": 10,
"n_tactics": 31,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 3,
"automation_only": false,
... | 1 | /-
EvmAsm.Rv64.ByteOps
Byte-level infrastructure: extractByte/replaceByte algebra and
generic CPS specs for LBU (load byte unsigned) and SB (store byte).
-/
-- `CPSSpec` transitively imports `Basic`, `SepLogic`, and `Execution`.
import EvmAsm.Rv64.CPSSpec
import Mathlib.Tactic.IntervalCases
import Mathlib.Tactic... | /-
EvmAsm.Rv64.ByteOps
Byte-level infrastructure: extractByte/replaceByte algebra and
generic CPS specs for LBU (load byte unsigned) and SB (store byte).
-/
-- `CPSSpec` transitively imports `Basic`, `SepLogic`, and `Execution`.
import EvmAsm.Rv64.CPSSpec
import Mathlib.Tactic.IntervalCases
import Mathlib.Tactic... | @@ -18,6 +18,9 @@
`(tactic| (ext i (hi : i < 8); simp [BitVec.truncate, BitVec.zeroExtend];
try { interval_cases i <;> simp_all }))
+theorem getByte_eq {s : MachineState} {addr : Word} :
+ s.getByte addr = extractByte (s.getMem (alignToDword addr)) (byteOffset addr) := rfl
+
theorem generic_lbu_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_2857efda93cf_2 | 1352c9b70bc9e5fd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/ByteOps.lean | ByteOps | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "generic_lbu_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 28,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro R hR s hcr hPR hpc; subst hpc\n have hfetch : s.code s.pc = some (.LBU rd rs1 offset) :=\n CodeReq.singl... | [
{
"name": "getByte_eq",
"text": "theorem getByte_eq {s : MachineState} {addr : Word} :\n s.getByte addr = extractByte (s.getMem (alignToDword addr)) (byteOffset addr) := rfl\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 144,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_... | [
{
"name": "generic_lb_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 45,
"n_chars": 2188,
"n_subproofs": 10,
"n_tactics": 31,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 3,
"automation_only": false,
"... | 1 | /-
EvmAsm.Rv64.ByteOps
Byte-level infrastructure: extractByte/replaceByte algebra and
generic CPS specs for LBU (load byte unsigned) and SB (store byte).
-/
-- `CPSSpec` transitively imports `Basic`, `SepLogic`, and `Execution`.
import EvmAsm.Rv64.CPSSpec
import Mathlib.Tactic.IntervalCases
import Mathlib.Tactic... | /-
EvmAsm.Rv64.ByteOps
Byte-level infrastructure: extractByte/replaceByte algebra and
generic CPS specs for LBU (load byte unsigned) and SB (store byte).
-/
-- `CPSSpec` transitively imports `Basic`, `SepLogic`, and `Execution`.
import EvmAsm.Rv64.CPSSpec
import Mathlib.Tactic.IntervalCases
import Mathlib.Tactic... | @@ -18,6 +18,9 @@
`(tactic| (ext i (hi : i < 8); simp [BitVec.truncate, BitVec.zeroExtend];
try { interval_cases i <;> simp_all }))
+theorem getByte_eq {s : MachineState} {addr : Word} :
+ s.getByte addr = extractByte (s.getMem (alignToDword addr)) (byteOffset addr) := rfl
+
theorem generic_lb_sp... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2857efda93cf_3 | 9527333abb52185f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/ByteOps.lean | ByteOps | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "generic_sb_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro R hR s hcr hPR hpc; subst hpc\n have hfetch : s.code s.pc = some (.SB rs1 rs2 offset) :=\n CodeReq.single... | [
{
"name": "setByte_eq",
"text": "theorem setByte_eq {s : MachineState} {addr : Word} {b : BitVec 8} :\n s.setByte addr b = s.setMem (alignToDword addr)\n (replaceByte (s.getMem (alignToDword addr)) (byteOffset addr) b) := rfl\n\n/-! ## LBU generic spec\n\nLBU reads a byte from memory at an arbitrary... | [
{
"name": "generic_sb_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 48,
"n_chars": 2612,
"n_subproofs": 11,
"n_tactics": 33,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 3,
"automation_only": false,
"... | 1 | /-
EvmAsm.Rv64.ByteOps
Byte-level infrastructure: extractByte/replaceByte algebra and
generic CPS specs for LBU (load byte unsigned) and SB (store byte).
-/
-- `CPSSpec` transitively imports `Basic`, `SepLogic`, and `Execution`.
import EvmAsm.Rv64.CPSSpec
import Mathlib.Tactic.IntervalCases
import Mathlib.Tactic... | /-
EvmAsm.Rv64.ByteOps
Byte-level infrastructure: extractByte/replaceByte algebra and
generic CPS specs for LBU (load byte unsigned) and SB (store byte).
-/
-- `CPSSpec` transitively imports `Basic`, `SepLogic`, and `Execution`.
import EvmAsm.Rv64.CPSSpec
import Mathlib.Tactic.IntervalCases
import Mathlib.Tactic... | @@ -18,6 +18,15 @@
`(tactic| (ext i (hi : i < 8); simp [BitVec.truncate, BitVec.zeroExtend];
try { interval_cases i <;> simp_all }))
+theorem setByte_eq {s : MachineState} {addr : Word} {b : BitVec 8} :
+ s.setByte addr b = s.setMem (alignToDword addr)
+ (replaceByte (s.getMem (alignToDword 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_2857efda93cf_4 | 47711dac8bdd1ba6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/ByteOps.lean | ByteOps | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "extractByte_packDword",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n show (packDword f >>> (i.val * 8)).truncate 8 = f i\n unfold packDword\n have := epd_core (f 0) (f 1) (f 2) (f 3) (... | [
{
"name": "epd_core",
"text": "private theorem epd_core (b0 b1 b2 b3 b4 b5 b6 b7 : BitVec 8) (k : Fin 8) :\n let w := b0.zeroExtend 64 |||\n (b1.zeroExtend 64 <<< 8) |||\n (b2.zeroExtend 64 <<< 16) |||\n (b3.zeroExtend 64 <<< 24) |||\n (b4.zeroExtend 64 <<< 32) |||\n (b5.zer... | [
{
"name": "extractByte_packDword",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 328,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_... | 1 | /-
EvmAsm.Rv64.ByteOps
Byte-level infrastructure: extractByte/replaceByte algebra and
generic CPS specs for LBU (load byte unsigned) and SB (store byte).
-/
-- `CPSSpec` transitively imports `Basic`, `SepLogic`, and `Execution`.
import EvmAsm.Rv64.CPSSpec
import Mathlib.Tactic.IntervalCases
import Mathlib.Tactic... | /-
EvmAsm.Rv64.ByteOps
Byte-level infrastructure: extractByte/replaceByte algebra and
generic CPS specs for LBU (load byte unsigned) and SB (store byte).
-/
-- `CPSSpec` transitively imports `Basic`, `SepLogic`, and `Execution`.
import EvmAsm.Rv64.CPSSpec
import Mathlib.Tactic.IntervalCases
import Mathlib.Tactic... | @@ -39,8 +39,32 @@
def packBytes (bytes : List (BitVec 8)) : Word :=
packDword (fun i => getByteAt bytes i.val)
+private theorem epd_core (b0 b1 b2 b3 b4 b5 b6 b7 : BitVec 8) (k : Fin 8) :
+ let w := b0.zeroExtend 64 |||
+ (b1.zeroExtend 64 <<< 8) |||
+ (b2.zeroExtend 64 <<< 16) |||
+ (b3.zer... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2857efda93cf_5 | 1ff7cc0c1b8bdfad | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/ByteOps.lean | ByteOps | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "extractByte_packBytes",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n conv_lhs => rw [show k = (⟨k, hk⟩ : Fin 8).val from rfl]\n rw [packBytes, extractByte_packDword]\n simp [getByteAt,... | [
{
"name": "extractByte_packDword",
"text": "theorem extractByte_packDword {f : Fin 8 → BitVec 8} {i : Fin 8} :\n extractByte (packDword f) i.val = f i := by\n show (packDword f >>> (i.val * 8)).truncate 8 = f i\n unfold packDword\n have := epd_core (f 0) (f 1) (f 2) (f 3) (f 4) (f 5) (f 6) (f 7) i\n ... | [
{
"name": "extractByte_packBytes",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 293,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
"max_n... | 2 | /-
EvmAsm.Rv64.ByteOps
Byte-level infrastructure: extractByte/replaceByte algebra and
generic CPS specs for LBU (load byte unsigned) and SB (store byte).
-/
-- `CPSSpec` transitively imports `Basic`, `SepLogic`, and `Execution`.
import EvmAsm.Rv64.CPSSpec
import Mathlib.Tactic.IntervalCases
import Mathlib.Tactic... | /-
EvmAsm.Rv64.ByteOps
Byte-level infrastructure: extractByte/replaceByte algebra and
generic CPS specs for LBU (load byte unsigned) and SB (store byte).
-/
-- `CPSSpec` transitively imports `Basic`, `SepLogic`, and `Execution`.
import EvmAsm.Rv64.CPSSpec
import Mathlib.Tactic.IntervalCases
import Mathlib.Tactic... | @@ -57,9 +57,21 @@
interval_cases i <;>
simp
+theorem extractByte_packDword {f : Fin 8 → BitVec 8} {i : Fin 8} :
+ extractByte (packDword f) i.val = f i := by
+ show (packDword f >>> (i.val * 8)).truncate 8 = f i
+ unfold packDword
+ have := epd_core (f 0) (f 1) (f 2) (f 3) (f 4) (f 5) (f 6) (f 7) i
+ si... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7a10148df561_0 | 8fc70206d034f59b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/Sym.lean | Sym | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "ite_inRw_nil",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n if_neg (not_inRw_nil hn)",
"n_chars": 27,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": ... | [
{
"name": "not_inRw_nil",
"text": "/-- With no writable bytes, nothing routes to the writable region. -/\ntheorem not_inRw_nil {rwBase a : Word} {n : Nat} (hn : 0 < n) :\n ¬ inRw rwBase [] a n := by\n unfold inRw\n simp only [List.length_nil, Nat.le_zero]\n omega\n\n",
"fan_in": 2,
"n_lines": ... | [
{
"name": "ite_inRw_nil",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 332,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": ... | 1 | /-
EvmAsm.Rv64.SAsm.Sym
The pure block engine for SAsm: forward symbolic execution of straight-line
instruction blocks over the exposed register file.
`aluSem` classifies each supported instruction as a destination register, a
source list, and a result function of the register valuation, mirroring
`execIn... | /-
EvmAsm.Rv64.SAsm.Sym
The pure block engine for SAsm: forward symbolic execution of straight-line
instruction blocks over the exposed register file.
`aluSem` classifies each supported instruction as a destination register, a
source list, and a result function of the register valuation, mirroring
`execIn... | @@ -298,11 +298,19 @@
cases i <;> simp only [loadSem, reduceCtorEq] at h <;>
(injection h with h; subst h; simp)
+/-- With no writable bytes, nothing routes to the writable region. -/
+theorem not_inRw_nil {rwBase a : Word} {n : Nat} (hn : 0 < n) :
+ ¬ inRw rwBase [] a n := by
+ unfold inRw
+ simp only [... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7a10148df561_1 | 376d3dbd02d5abf1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/Sym.lean | Sym | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "execBlock_ws_length",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction instrs generalizing rf ws with\n | nil => rfl\n | cons i is ih =>\n show (execBlock ro rwBase _ _ is).... | [
{
"name": "execInstrRF_ws_length",
"text": "/-- One instruction preserves the writable region's size. -/\n@[simp] theorem execInstrRF_ws_length (ro : Region) (rwBase : Word)\n (rf : RegFile) (ws : List (BitVec 8)) (i : Instr) :\n (execInstrRF ro rwBase rf ws i).2.length = ws.length := by\n unfold exe... | [
{
"name": "execBlock_ws_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 420,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_ne... | 1 | /-
EvmAsm.Rv64.SAsm.Sym
The pure block engine for SAsm: forward symbolic execution of straight-line
instruction blocks over the exposed register file.
`aluSem` classifies each supported instruction as a destination register, a
source list, and a result function of the register valuation, mirroring
`execIn... | /-
EvmAsm.Rv64.SAsm.Sym
The pure block engine for SAsm: forward symbolic execution of straight-line
instruction blocks over the exposed register file.
`aluSem` classifies each supported instruction as a destination register, a
source list, and a result function of the register valuation, mirroring
`execIn... | @@ -341,13 +341,28 @@
= [] from setBytes_nil_left ..]
| none => rfl
+/-- One instruction preserves the writable region's size. -/
+@[simp] theorem execInstrRF_ws_length (ro : Region) (rwBase : Word)
+ (rf : RegFile) (ws : List (BitVec 8)) (i : Instr) :
+ (execInstrRF ro rwBase rf w... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7a10148df561_2 | 13b3e64a8de28b8f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/Sym.lean | Sym | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "execInstrRF_ld_get_ne",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n execInstrRF_get_ne ro rwBase rf ws _ r (fun op hop => nomatch hop)\n (fun l hl => by injection hl with hl; subst hl; ... | [
{
"name": "execInstrRF_get_ne",
"text": "/-- One engine step leaves every register other than the classified\n destination unchanged — including for loads, where the result is a\n routing `if` (both branches set the same `rd`, so the read commutes\n past the `if` without deciding it). -/\ntheorem e... | [
{
"name": "execInstrRF_ld_get_ne",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 506,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_... | 1 | /-
EvmAsm.Rv64.SAsm.Sym
The pure block engine for SAsm: forward symbolic execution of straight-line
instruction blocks over the exposed register file.
`aluSem` classifies each supported instruction as a destination register, a
source list, and a result function of the register valuation, mirroring
`execIn... | /-
EvmAsm.Rv64.SAsm.Sym
The pure block engine for SAsm: forward symbolic execution of straight-line
instruction blocks over the exposed register file.
`aluSem` classifies each supported instruction as a destination register, a
source list, and a result function of the register valuation, mirroring
`execIn... | @@ -386,12 +386,36 @@
-- Recipe: docs/sasm-howto.md ("Multi-dword focus blocks").
-- ============================================================================
+/-- One engine step leaves every register other than the classified
+ destination unchanged — including for loads, where the result is a
+ routing ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3182f8a75d9a_0 | bea075a3fbcabfc9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV2/CompensationCases.lean | CompensationCases | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 2 | [
{
"theorem_name": "qHat_plus_one_gt_u_via_tight_phases",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_ge : u / V ≤ q1' * 2^32 + q0' := by\n rw [h_qHat_decomp]\n exact halfword_combine_ge_of_ti... | [
{
"name": "nat_succ_mul_gt_of_div_le",
"text": "/-- **A2.S1.alg** (pure algebra): if `q1' * 2^32 + q0' ≥ u / vTop`, then\n `(q1'*2^32 + q0' + 1) * vTop > u`. Wraps `Nat.div` semantics.\n\n Used downstream to convert the \"tight qHat\" statement (qHat ≥ q_true)\n into the \"gap\" statement (qHat + 1... | [
{
"name": "qHat_plus_one_gt_u_via_tight_phases",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 22,
"n_chars": 1026,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": f... | 2 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.CompensationCases
§A of the call-skip lower bound — the core Knuth-B compensation case
decomposition. Shows that the algorithm's combined quotient
`(qHat = algorithmQ1Prime * 2^32 + algorithmQ0Prime)` satisfies
`(qHat + 1) * b3' > u`, hence `u / b3' ≤ qHat` (... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.CompensationCases
§A of the call-skip lower bound — the core Knuth-B compensation case
decomposition. Shows that the algorithm's combined quotient
`(qHat = algorithmQ1Prime * 2^32 + algorithmQ0Prime)` satisfies
`(qHat + 1) * b3' > u`, hence `u / b3' ≤ qHat` (... | @@ -73,6 +73,22 @@
-- A2's proof is decomposed into sub-lemmas (A2.S1–A2.S4 below).
-- =============================================================================
+/-- **A2.S1.alg** (pure algebra): if `q1' * 2^32 + q0' ≥ u / vTop`, then
+ `(q1'*2^32 + q0' + 1) * vTop > u`. Wraps `Nat.div` semantics.
+
+ Use... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3182f8a75d9a_1 | f6fc5244dd5f47e4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV2/CompensationCases.lean | CompensationCases | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 2 | [
{
"theorem_name": "qHat_plus_one_gt_u_via_tight_phases",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_ge : u / V ≤ q1' * 2^32 + q0' := by\n rw [h_qHat_decomp]\n exact halfword_combine_ge_of_ti... | [
{
"name": "nat_succ_mul_gt_of_div_le",
"text": "/-- **A2.S1.alg** (pure algebra): if `q1' * 2^32 + q0' ≥ u / vTop`, then\n `(q1'*2^32 + q0' + 1) * vTop > u`. Wraps `Nat.div` semantics.\n\n Used downstream to convert the \"tight qHat\" statement (qHat ≥ q_true)\n into the \"gap\" statement (qHat + 1... | [
{
"name": "div128Quot_qHat_plus_one_times_b3_gt_u_normal",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 136,
"n_chars": 6699,
"n_subproofs": 25,
"n_tactics": 95,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 11,
"n_structural": 10,
"auto... | 4 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.CompensationCases
§A of the call-skip lower bound — the core Knuth-B compensation case
decomposition. Shows that the algorithm's combined quotient
`(qHat = algorithmQ1Prime * 2^32 + algorithmQ0Prime)` satisfies
`(qHat + 1) * b3' > u`, hence `u / b3' ≤ qHat` (... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.CompensationCases
§A of the call-skip lower bound — the core Knuth-B compensation case
decomposition. Shows that the algorithm's combined quotient
`(qHat = algorithmQ1Prime * 2^32 + algorithmQ0Prime)` satisfies
`(qHat + 1) * b3' > u`, hence `u / b3' ≤ qHat` (... | @@ -73,6 +73,22 @@
-- A2's proof is decomposed into sub-lemmas (A2.S1–A2.S4 below).
-- =============================================================================
+/-- **A2.S1.alg** (pure algebra): if `q1' * 2^32 + q0' ≥ u / vTop`, then
+ `(q1'*2^32 + q0' + 1) * vTop > u`. Wraps `Nat.div` semantics.
+
+ Use... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3182f8a75d9a_2 | 998f54b309356a66 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV2/CompensationCases.lean | CompensationCases | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "div128Quot_qHat_plus_one_times_b3_gt_u_of_q1_prime_overshoot",
"depth": 1,
"n_commands": 0,
"n_lines": 113,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Standard preconditions.\n have hb3'_pos : 0 < b3'.toNat := by have : b3'... | [
{
"name": "div128Quot_or_shift_ge",
"text": "/-- **OR-shift lower bound** (Word-level): for `a < 2^32`,\n `((a <<< 32) ||| b).toNat ≥ a.toNat * 2^32`.\n\n Proof: `(a <<< 32).toNat = a * 2^32` (since a < 2^32 ⟹ a*2^32 < 2^64),\n and `(x ||| y).toNat ≥ x.toNat` (OR can only add bits). -/\ntheorem div... | [
{
"name": "div128Quot_qHat_plus_one_times_b3_gt_u_of_q1_prime_overshoot",
"fan_in": 4,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 129,
"n_chars": 7095,
"n_subproofs": 35,
"n_tactics": 104,
"cyclomatic": 1,
"n_automation": 14,
"n_rewrites": 14,
"n_structura... | 2 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.CompensationCases
§A of the call-skip lower bound — the core Knuth-B compensation case
decomposition. Shows that the algorithm's combined quotient
`(qHat = algorithmQ1Prime * 2^32 + algorithmQ0Prime)` satisfies
`(qHat + 1) * b3' > u`, hence `u / b3' ≤ qHat` (... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.CompensationCases
§A of the call-skip lower bound — the core Knuth-B compensation case
decomposition. Shows that the algorithm's combined quotient
`(qHat = algorithmQ1Prime * 2^32 + algorithmQ0Prime)` satisfies
`(qHat + 1) * b3' > u`, hence `u / b3' ≤ qHat` (... | @@ -73,6 +73,26 @@
-- A2's proof is decomposed into sub-lemmas (A2.S1–A2.S4 below).
-- =============================================================================
+/-- **OR-shift lower bound** (Word-level): for `a < 2^32`,
+ `((a <<< 32) ||| b).toNat ≥ a.toNat * 2^32`.
+
+ Proof: `(a <<< 32).toNat = a * 2^3... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3182f8a75d9a_3 | 35085179d87ed03b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV2/CompensationCases.lean | CompensationCases | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "algorithmQ0Prime_ge_q_true_0_of_un21_ge_pow63",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let _ := h_un21_ge_pow63\n rw [algorithmQ0Prime_unfold]\n exact div128Quot_q0_prime_ge_q_tr... | [
{
"name": "div128Quot_q0_prime_ge_q_true_0_un21_level",
"text": "/-- **Un21-level Phase 2 tightness — UNCONDITIONAL on un21 magnitude.**\n\n Parallel to `div128Quot_q0_prime_ge_q_true_0_of_un21_lt_pow63` in\n `Div128KnuthLower.lean`, but DOES NOT require `un21 < 2^63`. Uses\n `_small_rhatc` in the ... | [
{
"name": "algorithmQ0Prime_ge_q_true_0_of_un21_ge_pow63",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 30,
"n_chars": 1435,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automatio... | 1 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.CompensationCases
§A of the call-skip lower bound — the core Knuth-B compensation case
decomposition. Shows that the algorithm's combined quotient
`(qHat = algorithmQ1Prime * 2^32 + algorithmQ0Prime)` satisfies
`(qHat + 1) * b3' > u`, hence `u / b3' ≤ qHat` (... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.CompensationCases
§A of the call-skip lower bound — the core Knuth-B compensation case
decomposition. Shows that the algorithm's combined quotient
`(qHat = algorithmQ1Prime * 2^32 + algorithmQ0Prime)` satisfies
`(qHat + 1) * b3' > u`, hence `u / b3' ≤ qHat` (... | @@ -73,6 +73,64 @@
-- A2's proof is decomposed into sub-lemmas (A2.S1–A2.S4 below).
-- =============================================================================
+/-- **Un21-level Phase 2 tightness — UNCONDITIONAL on un21 magnitude.**
+
+ Parallel to `div128Quot_q0_prime_ge_q_true_0_of_un21_lt_pow63` 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_3182f8a75d9a_4 | 3c97393ea9662ad5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV2/CompensationCases.lean | CompensationCases | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "algorithmQ0Prime_ge_q_true_0_of_un21_ge_pow63",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let _ := h_un21_ge_pow63\n rw [algorithmQ0Prime_unfold]\n exact div128Quot_q0_prime_ge_q_tr... | [
{
"name": "div128Quot_q0_prime_ge_q_true_0_un21_level",
"text": "/-- **Un21-level Phase 2 tightness — UNCONDITIONAL on un21 magnitude.**\n\n Parallel to `div128Quot_q0_prime_ge_q_true_0_of_un21_lt_pow63` in\n `Div128KnuthLower.lean`, but DOES NOT require `un21 < 2^63`. Uses\n `_small_rhatc` in the ... | [
{
"name": "algorithmQ0Prime_ge_q_true_0_of_q1_prime_eq_q_true_1_narrow_wide_ge_pow63",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 46,
"n_chars": 2500,
"n_subproofs": 12,
"n_tactics": 33,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 6,
"n_... | 2 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.CompensationCases
§A of the call-skip lower bound — the core Knuth-B compensation case
decomposition. Shows that the algorithm's combined quotient
`(qHat = algorithmQ1Prime * 2^32 + algorithmQ0Prime)` satisfies
`(qHat + 1) * b3' > u`, hence `u / b3' ≤ qHat` (... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.CompensationCases
§A of the call-skip lower bound — the core Knuth-B compensation case
decomposition. Shows that the algorithm's combined quotient
`(qHat = algorithmQ1Prime * 2^32 + algorithmQ0Prime)` satisfies
`(qHat + 1) * b3' > u`, hence `u / b3' ≤ qHat` (... | @@ -73,6 +73,64 @@
-- A2's proof is decomposed into sub-lemmas (A2.S1–A2.S4 below).
-- =============================================================================
+/-- **Un21-level Phase 2 tightness — UNCONDITIONAL on un21 magnitude.**
+
+ Parallel to `div128Quot_q0_prime_ge_q_true_0_of_un21_lt_pow63` 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_3182f8a75d9a_5 | 61ac8ac4127d7b3c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV2/CompensationCases.lean | CompensationCases | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "algorithmQ0Prime_ge_q_true_0_of_q1_prime_eq_q_true_1_narrow_wide",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let _ := h_un21_ge_dHi\n by_cases h : (algorithmUn21 u4 u3 b3').toNat < 2... | [
{
"name": "algorithmQ0Prime_ge_q_true_0_of_q1_prime_eq_q_true_1_narrow_wide_lt_pow63",
"text": "/-- **Phase 2 tightness, narrow-u4 + wide-un21 + un21 < 2^63 sub-case** —\n closed via `_of_un21_lt_pow63` + un21 = r1_math (narrow-u4 variant). -/\ntheorem algorithmQ0Prime_ge_q_true_0_of_q1_prime_eq_q_true_1... | [
{
"name": "algorithmQ0Prime_ge_q_true_0_of_q1_prime_eq_q_true_1_narrow_wide",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 23,
"n_chars": 1207,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural"... | 4 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.CompensationCases
§A of the call-skip lower bound — the core Knuth-B compensation case
decomposition. Shows that the algorithm's combined quotient
`(qHat = algorithmQ1Prime * 2^32 + algorithmQ0Prime)` satisfies
`(qHat + 1) * b3' > u`, hence `u / b3' ≤ qHat` (... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.CompensationCases
§A of the call-skip lower bound — the core Knuth-B compensation case
decomposition. Shows that the algorithm's combined quotient
`(qHat = algorithmQ1Prime * 2^32 + algorithmQ0Prime)` satisfies
`(qHat + 1) * b3' > u`, hence `u / b3' ≤ qHat` (... | @@ -73,6 +73,52 @@
-- A2's proof is decomposed into sub-lemmas (A2.S1–A2.S4 below).
-- =============================================================================
+/-- **Phase 2 tightness, narrow-u4 + wide-un21 + un21 < 2^63 sub-case** —
+ closed via `_of_un21_lt_pow63` + un21 = r1_math (narrow-u4 variant). -/... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3182f8a75d9a_6 | ce10ebb557fab89b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV2/CompensationCases.lean | CompensationCases | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "algorithmQ0Prime_ge_q_true_0_of_q1_prime_eq_q_true_1_narrow_wide",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let _ := h_un21_ge_dHi\n by_cases h : (algorithmUn21 u4 u3 b3').toNat < 2... | [
{
"name": "algorithmQ0Prime_ge_q_true_0_of_q1_prime_eq_q_true_1_narrow_wide_lt_pow63",
"text": "/-- **Phase 2 tightness, narrow-u4 + wide-un21 + un21 < 2^63 sub-case** —\n closed via `_of_un21_lt_pow63` + un21 = r1_math (narrow-u4 variant). -/\ntheorem algorithmQ0Prime_ge_q_true_0_of_q1_prime_eq_q_true_1... | [
{
"name": "algorithmQ0Prime_ge_q_true_0_of_q1_prime_eq_q_true_1",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 54,
"n_chars": 2802,
"n_subproofs": 4,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 2,
"a... | 6 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.CompensationCases
§A of the call-skip lower bound — the core Knuth-B compensation case
decomposition. Shows that the algorithm's combined quotient
`(qHat = algorithmQ1Prime * 2^32 + algorithmQ0Prime)` satisfies
`(qHat + 1) * b3' > u`, hence `u / b3' ≤ qHat` (... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.CompensationCases
§A of the call-skip lower bound — the core Knuth-B compensation case
decomposition. Shows that the algorithm's combined quotient
`(qHat = algorithmQ1Prime * 2^32 + algorithmQ0Prime)` satisfies
`(qHat + 1) * b3' > u`, hence `u / b3' ≤ qHat` (... | @@ -133,6 +133,52 @@
rw [h_un21_eq] at h_ph2
exact h_ph2
+/-- **Phase 2 tightness, narrow-u4 + wide-un21 + un21 < 2^63 sub-case** —
+ closed via `_of_un21_lt_pow63` + un21 = r1_math (narrow-u4 variant). -/
+theorem algorithmQ0Prime_ge_q_true_0_of_q1_prime_eq_q_true_1_narrow_wide_lt_pow63
+ (u4 u3 b3' : Wo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3182f8a75d9a_8 | 6967d9dec21a018d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV2/CompensationCases.lean | CompensationCases | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "algorithmUn21_lt_vTop_of_q1_prime_not_overshoot",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hu4 : u4.toNat < (b3' >>> (32 : BitVec 6).toNat).toNat * 2^32\n · exact algorithm... | [
{
"name": "algorithmUn21_lt_vTop_of_q1_prime_not_overshoot_hu4_lt",
"text": "/-- **A2.S2 un21 < vTop under no-overshoot, narrow-u4 case** — closed via\n the existing contrapositive bridge `algorithmQ1Prime_eq_q_true_1_plus_one_of_un21_ge_vTop`. -/\ntheorem algorithmUn21_lt_vTop_of_q1_prime_not_overshoot_... | [
{
"name": "algorithmUn21_lt_vTop_of_q1_prime_not_overshoot",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 24,
"n_chars": 1101,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automat... | 2 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.CompensationCases
§A of the call-skip lower bound — the core Knuth-B compensation case
decomposition. Shows that the algorithm's combined quotient
`(qHat = algorithmQ1Prime * 2^32 + algorithmQ0Prime)` satisfies
`(qHat + 1) * b3' > u`, hence `u / b3' ≤ qHat` (... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.CompensationCases
§A of the call-skip lower bound — the core Knuth-B compensation case
decomposition. Shows that the algorithm's combined quotient
`(qHat = algorithmQ1Prime * 2^32 + algorithmQ0Prime)` satisfies
`(qHat + 1) * b3' > u`, hence `u / b3' ≤ qHat` (... | @@ -73,6 +73,22 @@
-- A2's proof is decomposed into sub-lemmas (A2.S1–A2.S4 below).
-- =============================================================================
+/-- **A2.S2 un21 < vTop under no-overshoot, narrow-u4 case** — closed via
+ the existing contrapositive bridge `algorithmQ1Prime_eq_q_true_1_plus_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_3182f8a75d9a_9 | 624e3132d245c34f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV2/CompensationCases.lean | CompensationCases | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 1 | [
{
"theorem_name": "algorithmUn21_lt_vTop_of_q1_prime_not_overshoot",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hu4 : u4.toNat < (b3' >>> (32 : BitVec 6).toNat).toNat * 2^32\n · exact algorithm... | [
{
"name": "algorithmUn21_lt_vTop_of_q1_prime_not_overshoot_hu4_lt",
"text": "/-- **A2.S2 un21 < vTop under no-overshoot, narrow-u4 case** — closed via\n the existing contrapositive bridge `algorithmQ1Prime_eq_q_true_1_plus_one_of_un21_ge_vTop`. -/\ntheorem algorithmUn21_lt_vTop_of_q1_prime_not_overshoot_... | [
{
"name": "algorithmQ0Prime_lt_pow32_of_q1_prime_not_overshoot",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 44,
"n_chars": 2208,
"n_subproofs": 8,
"n_tactics": 27,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 5,
"n_structural": 3,
"au... | 3 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.CompensationCases
§A of the call-skip lower bound — the core Knuth-B compensation case
decomposition. Shows that the algorithm's combined quotient
`(qHat = algorithmQ1Prime * 2^32 + algorithmQ0Prime)` satisfies
`(qHat + 1) * b3' > u`, hence `u / b3' ≤ qHat` (... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.CompensationCases
§A of the call-skip lower bound — the core Knuth-B compensation case
decomposition. Shows that the algorithm's combined quotient
`(qHat = algorithmQ1Prime * 2^32 + algorithmQ0Prime)` satisfies
`(qHat + 1) * b3' > u`, hence `u / b3' ≤ qHat` (... | @@ -73,6 +73,22 @@
-- A2's proof is decomposed into sub-lemmas (A2.S1–A2.S4 below).
-- =============================================================================
+/-- **A2.S2 un21 < vTop under no-overshoot, narrow-u4 case** — closed via
+ the existing contrapositive bridge `algorithmQ1Prime_eq_q_true_1_plus_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_3182f8a75d9a_16 | 64bc48496b11bb40 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV2/CompensationCases.lean | CompensationCases | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 30 | 3 | [
{
"theorem_name": "div128Quot_qHat_plus_one_times_b3_gt_u_normal",
"depth": 1,
"n_commands": 0,
"n_lines": 110,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Standard precondition derivations.\n have hb3'_pos : 0 < b3'.toNat := by omega\n have ... | [
{
"name": "two_step_div_identity",
"text": "/-- **A2.S1.div_id** (pure Nat): two-step schoolbook division identity.\n `(A*2^64 + a1*2^32 + a0) / V = ((A*2^32+a1)/V)*2^32 + ((rem*2^32+a0)/V)`\n where `rem = (A*2^32+a1) % V`. This is the halfword-pair decomposition of\n the 128-bit division, showing ... | [
{
"name": "div128Quot_qHat_plus_one_times_b3_gt_u_wide_un21_wide",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 17,
"n_chars": 814,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"au... | 3 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.CompensationCases
§A of the call-skip lower bound — the core Knuth-B compensation case
decomposition. Shows that the algorithm's combined quotient
`(qHat = algorithmQ1Prime * 2^32 + algorithmQ0Prime)` satisfies
`(qHat + 1) * b3' > u`, hence `u / b3' ≤ qHat` (... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV2.CompensationCases
§A of the call-skip lower bound — the core Knuth-B compensation case
decomposition. Shows that the algorithm's combined quotient
`(qHat = algorithmQ1Prime * 2^32 + algorithmQ0Prime)` satisfies
`(qHat + 1) * b3' > u`, hence `u / b3' ≤ qHat` (... | @@ -93,6 +93,32 @@
rw [h_shl]
exact Nat.left_le_or
+/-- **A2.S1.div_id** (pure Nat): two-step schoolbook division identity.
+ `(A*2^64 + a1*2^32 + a0) / V = ((A*2^32+a1)/V)*2^32 + ((rem*2^32+a0)/V)`
+ where `rem = (A*2^32+a1) % V`. This is the halfword-pair decomposition of
+ the 128-bit division, show... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9c3dc4d74f56_0 | 4f54704d89f0864c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Layout.lean | Layout | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "ExpScratchpadLayout.valid_of_eq_canonical",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n subst h_eq\n exact canonicalExpScratchpadLayout_valid",
"n_chars": 59,
"n_subproofs": 0,... | [
{
"name": "canonicalExpScratchpadLayout_valid",
"text": "/-- The canonical EXP scratchpad layout is `Valid`. Trivially discharged\n because the layout struct is empty. -/\ntheorem canonicalExpScratchpadLayout_valid :\n canonicalExpScratchpadLayout.Valid := {}\n\n",
"fan_in": 1,
"n_lines": 6,
... | [
{
"name": "ExpScratchpadLayout.valid_of_eq_canonical",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 282,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only... | 1 | /-
EvmAsm.Evm64.Exp.Layout
Empty-layout placeholder for the EXP routine's scratchpad-layout
abstraction (GH #334 / parent `evm-asm-4mka`, slice `evm-asm-i6oz6`).
Per `AGENTS.md` ("Scratchpad Layout (#334)") and `EvmAsm/Evm64/OPCODE_TEMPLATE.md`,
any new opcode subtree that will carry internal `sp`-relative ... | /-
EvmAsm.Evm64.Exp.Layout
Empty-layout placeholder for the EXP routine's scratchpad-layout
abstraction (GH #334 / parent `evm-asm-4mka`, slice `evm-asm-i6oz6`).
Per `AGENTS.md` ("Scratchpad Layout (#334)") and `EvmAsm/Evm64/OPCODE_TEMPLATE.md`,
any new opcode subtree that will carry internal `sp`-relative ... | @@ -77,11 +77,18 @@
today's hardcoded `sp + 0 .. sp + 24` accumulator cells. -/
def canonicalExpScratchpadLayout : ExpScratchpadLayout := {}
+/-- The canonical EXP scratchpad layout is `Valid`. Trivially discharged
+ because the layout struct is empty. -/
+theorem canonicalExpScratchpadLayout_valid :
+ ca... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9c3dc4d74f56_1 | 442d6facf060599d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Layout.lean | Layout | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "canonicalExpScratchpadLayout_valid_iff_true",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n ExpScratchpadLayout.valid_iff_true canonicalExpScratchpadLayout",
"n_chars": 66,
"n_subpro... | [
{
"name": "ExpScratchpadLayout.valid_iff_true",
"text": "/-- The current empty EXP scratchpad layout validity predicate is trivial. -/\ntheorem ExpScratchpadLayout.valid_iff_true\n (L : ExpScratchpadLayout) :\n L.Valid ↔ True := by\n constructor\n · intro _h\n trivial\n · intro _h\n exact L.v... | [
{
"name": "canonicalExpScratchpadLayout_valid_iff_true",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 246,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_on... | 1 | /-
EvmAsm.Evm64.Exp.Layout
Empty-layout placeholder for the EXP routine's scratchpad-layout
abstraction (GH #334 / parent `evm-asm-4mka`, slice `evm-asm-i6oz6`).
Per `AGENTS.md` ("Scratchpad Layout (#334)") and `EvmAsm/Evm64/OPCODE_TEMPLATE.md`,
any new opcode subtree that will carry internal `sp`-relative ... | /-
EvmAsm.Evm64.Exp.Layout
Empty-layout placeholder for the EXP routine's scratchpad-layout
abstraction (GH #334 / parent `evm-asm-4mka`, slice `evm-asm-i6oz6`).
Per `AGENTS.md` ("Scratchpad Layout (#334)") and `EvmAsm/Evm64/OPCODE_TEMPLATE.md`,
any new opcode subtree that will carry internal `sp`-relative ... | @@ -78,6 +78,16 @@
(L : ExpScratchpadLayout) :
L.Valid := {}
+/-- The current empty EXP scratchpad layout validity predicate is trivial. -/
+theorem ExpScratchpadLayout.valid_iff_true
+ (L : ExpScratchpadLayout) :
+ L.Valid ↔ True := by
+ constructor
+ · intro _h
+ trivial
+ · intro _h
+ exac... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_70d05eb33829_0 | 5847534c16ade7c5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bls12G2EqNSAsm.lean | Bls12G2EqNSAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "firstDiff_ne",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [firstDiff_succ, firstDiff_all_eq _ _ _ hprev, if_neg (Nat.lt_irrefl _), if_pos hne]",
"n_chars": 93,
"n_subproofs"... | [
{
"name": "firstDiff_all_eq",
"text": "theorem firstDiff_all_eq (bs1 bs2 : List (BitVec 8)) (n : Nat)\n (h : ∀ j, j < n → bs1.getD j 0 = bs2.getD j 0) :\n firstDiff bs1 bs2 n = n := by\n induction n with\n | zero => rfl\n | succ n ih =>\n rw [firstDiff_succ, ih (fun j hj => h j (by omega)), if_n... | [
{
"name": "firstDiff_ne",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 293,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting": ... | 1 | /-
EvmAsm.Codegen.Programs.Bls12G2EqNSAsm
Verified SAsm drop-in for `blsg2_eq_n`: a single-exit `whileBreak`
replacement for the two-exit emitted byte comparison.
-/
import EvmAsm.Rv64.Program
import EvmAsm.Codegen.Emit
import EvmAsm.Codegen.GuestAddrs
import EvmAsm.Rv64.SAsm.Tactic
import EvmAsm.Rv64.SAsm.Whil... | /-
EvmAsm.Codegen.Programs.Bls12G2EqNSAsm
Verified SAsm drop-in for `blsg2_eq_n`: a single-exit `whileBreak`
replacement for the two-exit emitted byte comparison.
-/
import EvmAsm.Rv64.Program
import EvmAsm.Codegen.Emit
import EvmAsm.Codegen.GuestAddrs
import EvmAsm.Rv64.SAsm.Tactic
import EvmAsm.Rv64.SAsm.Whil... | @@ -79,10 +79,22 @@
· rw [if_pos h]; exact Nat.le_succ_of_le (firstDiff_le bs1 bs2 n)
· rw [if_neg h]; split <;> omega
+theorem firstDiff_all_eq (bs1 bs2 : List (BitVec 8)) (n : Nat)
+ (h : ∀ j, j < n → bs1.getD j 0 = bs2.getD j 0) :
+ firstDiff bs1 bs2 n = n := by
+ induction n with
+ | zero => rfl... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_70d05eb33829_1 | e1e28fee426d9c69 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bls12G2EqNSAsm.lean | Bls12G2EqNSAsm | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "firstDiff_ne_of_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n with\n | zero => omega\n | succ n ih =>\n by_cases hlt : i < n\n · have hih := ih hlt\n rw [fi... | [
{
"name": "firstDiff_ne",
"text": "theorem firstDiff_ne (bs1 bs2 : List (BitVec 8)) (i : Nat)\n (hprev : ∀ j, j < i → bs1.getD j 0 = bs2.getD j 0)\n (hne : bs1.getD i 0 ≠ bs2.getD i 0) :\n firstDiff bs1 bs2 (i + 1) = i := by\n rw [firstDiff_succ, firstDiff_all_eq _ _ _ hprev, if_neg (Nat.lt_irrefl... | [
{
"name": "firstDiff_ne_of_lt",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 16,
"n_chars": 465,
"n_subproofs": 2,
"n_tactics": 10,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"max_ne... | 2 | /-
EvmAsm.Codegen.Programs.Bls12G2EqNSAsm
Verified SAsm drop-in for `blsg2_eq_n`: a single-exit `whileBreak`
replacement for the two-exit emitted byte comparison.
-/
import EvmAsm.Rv64.Program
import EvmAsm.Codegen.Emit
import EvmAsm.Codegen.GuestAddrs
import EvmAsm.Rv64.SAsm.Tactic
import EvmAsm.Rv64.SAsm.Whil... | /-
EvmAsm.Codegen.Programs.Bls12G2EqNSAsm
Verified SAsm drop-in for `blsg2_eq_n`: a single-exit `whileBreak`
replacement for the two-exit emitted byte comparison.
-/
import EvmAsm.Rv64.Program
import EvmAsm.Codegen.Emit
import EvmAsm.Codegen.GuestAddrs
import EvmAsm.Rv64.SAsm.Tactic
import EvmAsm.Rv64.SAsm.Whil... | @@ -90,6 +90,12 @@
· exact absurd hne (fun h2 => h2 (h n (by omega)))
· rw [if_neg hne]
+theorem firstDiff_ne (bs1 bs2 : List (BitVec 8)) (i : Nat)
+ (hprev : ∀ j, j < i → bs1.getD j 0 = bs2.getD j 0)
+ (hne : bs1.getD i 0 ≠ bs2.getD i 0) :
+ firstDiff bs1 bs2 (i + 1) = i := by
+ rw [firstDiff_suc... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_70d05eb33829_2 | 353f634b06877a14 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bls12G2EqNSAsm.lean | Bls12G2EqNSAsm | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "blsg2EqNFn_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 353,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hse0 : signExtend12 (0 : BitVec 12) = (0 : Word) := by decide\n have hse1 : signExtend12 (1 : BitVec 12) = (1 : Wor... | [
{
"name": "firstDiff_ne_of_lt",
"text": "theorem firstDiff_ne_of_lt (bs1 bs2 : List (BitVec 8)) (i n : Nat)\n (hi : i < n)\n (hprev : ∀ j, j < i → bs1.getD j 0 = bs2.getD j 0)\n (hne : bs1.getD i 0 ≠ bs2.getD i 0) :\n firstDiff bs1 bs2 n = i := by\n induction n with\n | zero => omega\n | succ... | [
{
"name": "blsg2EqNFn_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 370,
"n_chars": 17482,
"n_subproofs": 89,
"n_tactics": 356,
"cyclomatic": 12,
"n_automation": 123,
"n_rewrites": 96,
"n_structural": 88,
"automation_only": false,
... | 3 | /-
EvmAsm.Codegen.Programs.Bls12G2EqNSAsm
Verified SAsm drop-in for `blsg2_eq_n`: a single-exit `whileBreak`
replacement for the two-exit emitted byte comparison.
-/
import EvmAsm.Rv64.Program
import EvmAsm.Codegen.Emit
import EvmAsm.Codegen.GuestAddrs
import EvmAsm.Rv64.SAsm.Tactic
import EvmAsm.Rv64.SAsm.Whil... | /-
EvmAsm.Codegen.Programs.Bls12G2EqNSAsm
Verified SAsm drop-in for `blsg2_eq_n`: a single-exit `whileBreak`
replacement for the two-exit emitted byte comparison.
-/
import EvmAsm.Rv64.Program
import EvmAsm.Codegen.Emit
import EvmAsm.Codegen.GuestAddrs
import EvmAsm.Rv64.SAsm.Tactic
import EvmAsm.Rv64.SAsm.Whil... | @@ -96,6 +96,21 @@
firstDiff bs1 bs2 (i + 1) = i := by
rw [firstDiff_succ, firstDiff_all_eq _ _ _ hprev, if_neg (Nat.lt_irrefl _), if_pos hne]
+theorem firstDiff_ne_of_lt (bs1 bs2 : List (BitVec 8)) (i n : Nat)
+ (hi : i < n)
+ (hprev : ∀ j, j < i → bs1.getD j 0 = bs2.getD j 0)
+ (hne : bs1.getD i 0 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5e23e043196e_0 | a99f023e47100e92 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/LoopSetupV5Mod.lean | LoopSetupV5Mod | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "blt_loopSetup_sub_modCode_noNop_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro a i h\n have hlookup := CodeReq.ofProg_lookup (base + loopSetupOff) (divK_loopSetup 464) 3\n (... | [
{
"name": "divK_loopSetup_code_sub_modCode_noNop_v5",
"text": "/-- The loop-setup block instructions are subsumed by `modCode_noNop_v5`. -/\nprivate theorem divK_loopSetup_code_sub_modCode_noNop_v5 {base : Word} :\n ∀ a i, (divK_loopSetup_code 464 (base + loopSetupOff)) a = some i →\n (modCode_noNop... | [
{
"name": "blt_loopSetup_sub_modCode_noNop_v5",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 597,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": fal... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.LoopSetupV5Mod
v5 loop-setup brick: the BLT-not-taken fall-through into the loop body, over
`modCode_noNop_v5`. Mirror of `divK_loopSetup_ntaken_spec_within_v4_noNop`
(NormA.lean) — the loop-setup instructions do not touch div128, so the same
version-agnostic instruction bodie... | /-
EvmAsm.Evm64.DivMod.Compose.LoopSetupV5Mod
v5 loop-setup brick: the BLT-not-taken fall-through into the loop body, over
`modCode_noNop_v5`. Mirror of `divK_loopSetup_ntaken_spec_within_v4_noNop`
(NormA.lean) — the loop-setup instructions do not touch div128, so the same
version-agnostic instruction bodie... | @@ -16,10 +16,23 @@
open EvmAsm.Rv64
+/-- The loop-setup block instructions are subsumed by `modCode_noNop_v5`. -/
+private theorem divK_loopSetup_code_sub_modCode_noNop_v5 {base : Word} :
+ ∀ a i, (divK_loopSetup_code 464 (base + loopSetupOff)) a = some i →
+ (modCode_noNop_v5 base) a = some i := by
+ 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_5e23e043196e_1 | 449077be964aa9a1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/LoopSetupV5Mod.lean | LoopSetupV5Mod | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "blt_loopSetup_sub_modCode_noNop_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro a i h\n have hlookup := CodeReq.ofProg_lookup (base + loopSetupOff) (divK_loopSetup 464) 3\n (... | [
{
"name": "divK_loopSetup_code_sub_modCode_noNop_v5",
"text": "/-- The loop-setup block instructions are subsumed by `modCode_noNop_v5`. -/\nprivate theorem divK_loopSetup_code_sub_modCode_noNop_v5 {base : Word} :\n ∀ a i, (divK_loopSetup_code 464 (base + loopSetupOff)) a = some i →\n (modCode_noNop... | [
{
"name": "divK_loopSetup_ntaken_spec_within_v5_noNop_mod",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 31,
"n_chars": 1752,
"n_subproofs": 8,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 4,
"automat... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.LoopSetupV5Mod
v5 loop-setup brick: the BLT-not-taken fall-through into the loop body, over
`modCode_noNop_v5`. Mirror of `divK_loopSetup_ntaken_spec_within_v4_noNop`
(NormA.lean) — the loop-setup instructions do not touch div128, so the same
version-agnostic instruction bodie... | /-
EvmAsm.Evm64.DivMod.Compose.LoopSetupV5Mod
v5 loop-setup brick: the BLT-not-taken fall-through into the loop body, over
`modCode_noNop_v5`. Mirror of `divK_loopSetup_ntaken_spec_within_v4_noNop`
(NormA.lean) — the loop-setup instructions do not touch div128, so the same
version-agnostic instruction bodie... | @@ -16,10 +16,23 @@
open EvmAsm.Rv64
+/-- The loop-setup block instructions are subsumed by `modCode_noNop_v5`. -/
+private theorem divK_loopSetup_code_sub_modCode_noNop_v5 {base : Word} :
+ ∀ a i, (divK_loopSetup_code 464 (base + loopSetupOff)) a = some i →
+ (modCode_noNop_v5 base) a = some i := by
+ 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_58a96d76cee4_0 | 4bbf8031b72c3516 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2CanonicalPointedEvidence.lean | N2CanonicalPointedEvidence | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "N2CanonicalPointedEvidence_iff_callableEvidence",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n ⟨N2CanonicalPointedEvidence.toCallableEvidence,\n N2CanonicalPointedEvidence.ofCallableEvide... | [
{
"name": "N2CanonicalPointedEvidence.toCallableEvidence",
"text": "/-- Canonical pointed evidence implies `N2CallableSelectedShapeEvidence`. -/\ntheorem N2CanonicalPointedEvidence.toCallableEvidence {a b : EvmWord}\n (h : N2CanonicalPointedEvidence a b) :\n N2CallableSelectedShapeEvidence a b :=\n N... | [
{
"name": "N2CanonicalPointedEvidence_iff_callableEvidence",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 357,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automatio... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.N2CanonicalPointedEvidence
Single named abbreviation for the canonical pointed evidence used by the
N2 v4 selected callable route. Bundles the `selectedCarry` and
`mulsub ∧ overestimate` predicates at `n2V4CanonicalBltu{2,1,0}`.
Pairs with `N2CallableSelectedShapeEvidence` via `.... | /-
EvmAsm.Evm64.DivMod.Spec.N2CanonicalPointedEvidence
Single named abbreviation for the canonical pointed evidence used by the
N2 v4 selected callable route. Bundles the `selectedCarry` and
`mulsub ∧ overestimate` predicates at `n2V4CanonicalBltu{2,1,0}`.
Pairs with `N2CallableSelectedShapeEvidence` via `.... | @@ -31,6 +31,12 @@
(a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2) (a.getLimbN 3)
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3))
+/-- Canonical pointed evidence implies `N2CallableSelectedShapeEvidence`. -/
+theorem N2CanonicalPointedEvidence.toCallableEvidence {a b : EvmWord}
+ (h : N2Can... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5437447f23b2_0 | e14b841b869ea0a1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/MExtProofs.lean | MExtProofs | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 3 | [
{
"theorem_name": "unsigned_div_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [(Int.ofNat_tdiv a.toNat b.toNat).symm, to_bits_truncate_natCast]\n apply BitVec.eq_of_toNat_eq; simp [BitVec.toNat_... | [
{
"name": "to_bits_truncate_natCast",
"text": "/-- to_bits_truncate on a non-negative integer = BitVec.ofNat. -/\ntheorem to_bits_truncate_natCast {n : Nat} :\n to_bits_truncate (l := 64) (↑n : Int) = BitVec.ofNat 64 n := by\n simp [to_bits_truncate, get_slice_int]; apply BitVec.eq_of_toNat_eq; simp\n\n... | [
{
"name": "unsigned_div_equiv",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 394,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nest... | 1 | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | @@ -18,9 +18,17 @@
-- Proved helper lemmas for division/remainder
-- ============================================================================
+/-- to_bits_truncate on a non-negative integer = BitVec.ofNat. -/
+theorem to_bits_truncate_natCast {n : Nat} :
+ to_bits_truncate (l := 64) (↑n : Int) = BitVec.ofNat... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5437447f23b2_1 | 82ad12481b5d4975 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/MExtProofs.lean | MExtProofs | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 3 | [
{
"theorem_name": "unsigned_div_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [(Int.ofNat_tdiv a.toNat b.toNat).symm, to_bits_truncate_natCast]\n apply BitVec.eq_of_toNat_eq; simp [BitVec.toNat_... | [
{
"name": "to_bits_truncate_natCast",
"text": "/-- to_bits_truncate on a non-negative integer = BitVec.ofNat. -/\ntheorem to_bits_truncate_natCast {n : Nat} :\n to_bits_truncate (l := 64) (↑n : Int) = BitVec.ofNat 64 n := by\n simp [to_bits_truncate, get_slice_int]; apply BitVec.eq_of_toNat_eq; simp\n\n... | [
{
"name": "unsigned_rem_equiv",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 722,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"max_nes... | 1 | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | @@ -18,9 +18,19 @@
-- Proved helper lemmas for division/remainder
-- ============================================================================
+/-- to_bits_truncate on a non-negative integer = BitVec.ofNat. -/
+theorem to_bits_truncate_natCast {n : Nat} :
+ to_bits_truncate (l := 64) (↑n : Int) = BitVec.ofNat... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5437447f23b2_2 | 732447d8f3e9940d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/MExtProofs.lean | MExtProofs | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "signed_div_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [to_bits_truncate_eq_ofInt,\n show a.sdiv b = BitVec.ofInt 64 (a.sdiv b).toInt from BitVec.ofInt_toInt.symm,\n Bi... | [
{
"name": "to_bits_truncate_eq_ofInt",
"text": "/-- to_bits_truncate is equivalent to BitVec.ofInt. -/\ntheorem to_bits_truncate_eq_ofInt {x : Int} :\n to_bits_truncate (l := 64) x = BitVec.ofInt 64 x := by\n simp [to_bits_truncate, get_slice_int]\n apply BitVec.eq_of_toNat_eq; simp [BitVec.toNat_ofInt... | [
{
"name": "signed_div_equiv",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 388,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 1 | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | @@ -18,9 +18,19 @@
-- Proved helper lemmas for division/remainder
-- ============================================================================
+/-- to_bits_truncate is equivalent to BitVec.ofInt. -/
+theorem to_bits_truncate_eq_ofInt {x : Int} :
+ to_bits_truncate (l := 64) x = BitVec.ofInt 64 x := by
+ simp... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5437447f23b2_3 | fcd09429b98ad118 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/MExtProofs.lean | MExtProofs | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "signed_div_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [to_bits_truncate_eq_ofInt,\n show a.sdiv b = BitVec.ofInt 64 (a.sdiv b).toInt from BitVec.ofInt_toInt.symm,\n Bi... | [
{
"name": "to_bits_truncate_eq_ofInt",
"text": "/-- to_bits_truncate is equivalent to BitVec.ofInt. -/\ntheorem to_bits_truncate_eq_ofInt {x : Int} :\n to_bits_truncate (l := 64) x = BitVec.ofInt 64 x := by\n simp [to_bits_truncate, get_slice_int]\n apply BitVec.eq_of_toNat_eq; simp [BitVec.toNat_ofInt... | [
{
"name": "signed_rem_equiv",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 374,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 1 | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | @@ -18,9 +18,19 @@
-- Proved helper lemmas for division/remainder
-- ============================================================================
+/-- to_bits_truncate is equivalent to BitVec.ofInt. -/
+theorem to_bits_truncate_eq_ofInt {x : Int} :
+ to_bits_truncate (l := 64) x = BitVec.ofInt 64 x := by
+ simp... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5437447f23b2_4 | 30cbe24e73fbd08e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/MExtProofs.lean | MExtProofs | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "signed_div_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [to_bits_truncate_eq_ofInt,\n show a.sdiv b = BitVec.ofInt 64 (a.sdiv b).toInt from BitVec.ofInt_toInt.symm,\n Bi... | [
{
"name": "to_bits_truncate_eq_ofInt",
"text": "/-- to_bits_truncate is equivalent to BitVec.ofInt. -/\ntheorem to_bits_truncate_eq_ofInt {x : Int} :\n to_bits_truncate (l := 64) x = BitVec.ofInt 64 x := by\n simp [to_bits_truncate, get_slice_int]\n apply BitVec.eq_of_toNat_eq; simp [BitVec.toNat_ofInt... | [
{
"name": "to_bits_truncate_toInt",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 232,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_... | 1 | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | @@ -18,9 +18,16 @@
-- Proved helper lemmas for division/remainder
-- ============================================================================
+/-- to_bits_truncate is equivalent to BitVec.ofInt. -/
+theorem to_bits_truncate_eq_ofInt {x : Int} :
+ to_bits_truncate (l := 64) x = BitVec.ofInt 64 x := by
+ simp... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5437447f23b2_5 | 89de481bc89bacec | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/MExtProofs.lean | MExtProofs | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 3 | [
{
"theorem_name": "unsigned_div_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [(Int.ofNat_tdiv a.toNat b.toNat).symm, to_bits_truncate_natCast]\n apply BitVec.eq_of_toNat_eq; simp [BitVec.toNat_... | [
{
"name": "to_bits_truncate_natCast",
"text": "/-- to_bits_truncate on a non-negative integer = BitVec.ofNat. -/\ntheorem to_bits_truncate_natCast {n : Nat} :\n to_bits_truncate (l := 64) (↑n : Int) = BitVec.ofNat 64 n := by\n simp [to_bits_truncate, get_slice_int]; apply BitVec.eq_of_toNat_eq; simp\n\n... | [
{
"name": "divu_full_equiv",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 13,
"n_chars": 560,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 4 | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | @@ -18,6 +18,11 @@
-- Proved helper lemmas for division/remainder
-- ============================================================================
+/-- to_bits_truncate on a non-negative integer = BitVec.ofNat. -/
+theorem to_bits_truncate_natCast {n : Nat} :
+ to_bits_truncate (l := 64) (↑n : Int) = BitVec.ofNat... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5437447f23b2_6 | 319211629209065a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/MExtProofs.lean | MExtProofs | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 3 | [
{
"theorem_name": "unsigned_div_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [(Int.ofNat_tdiv a.toNat b.toNat).symm, to_bits_truncate_natCast]\n apply BitVec.eq_of_toNat_eq; simp [BitVec.toNat_... | [
{
"name": "to_bits_truncate_natCast",
"text": "/-- to_bits_truncate on a non-negative integer = BitVec.ofNat. -/\ntheorem to_bits_truncate_natCast {n : Nat} :\n to_bits_truncate (l := 64) (↑n : Int) = BitVec.ofNat 64 n := by\n simp [to_bits_truncate, get_slice_int]; apply BitVec.eq_of_toNat_eq; simp\n\n... | [
{
"name": "remu_full_equiv",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 576,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 3 | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | @@ -18,6 +18,11 @@
-- Proved helper lemmas for division/remainder
-- ============================================================================
+/-- to_bits_truncate on a non-negative integer = BitVec.ofNat. -/
+theorem to_bits_truncate_natCast {n : Nat} :
+ to_bits_truncate (l := 64) (↑n : Int) = BitVec.ofNat... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5437447f23b2_7 | 804c8796beeec77b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/MExtProofs.lean | MExtProofs | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "signed_div_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [to_bits_truncate_eq_ofInt,\n show a.sdiv b = BitVec.ofInt 64 (a.sdiv b).toInt from BitVec.ofInt_toInt.symm,\n Bi... | [
{
"name": "to_bits_truncate_eq_ofInt",
"text": "/-- to_bits_truncate is equivalent to BitVec.ofInt. -/\ntheorem to_bits_truncate_eq_ofInt {x : Int} :\n to_bits_truncate (l := 64) x = BitVec.ofInt 64 x := by\n simp [to_bits_truncate, get_slice_int]\n apply BitVec.eq_of_toNat_eq; simp [BitVec.toNat_ofInt... | [
{
"name": "rem_full_equiv",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 13,
"n_chars": 468,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
"max_nesting... | 4 | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | @@ -18,13 +18,24 @@
-- Proved helper lemmas for division/remainder
-- ============================================================================
+/-- to_bits_truncate is equivalent to BitVec.ofInt. -/
+theorem to_bits_truncate_eq_ofInt {x : Int} :
+ to_bits_truncate (l := 64) x = BitVec.ofInt 64 x := by
+ sim... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5437447f23b2_8 | fdfb30c4416dbb73 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/MExtProofs.lean | MExtProofs | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "signed_div_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [to_bits_truncate_eq_ofInt,\n show a.sdiv b = BitVec.ofInt 64 (a.sdiv b).toInt from BitVec.ofInt_toInt.symm,\n Bi... | [
{
"name": "to_bits_truncate_eq_ofInt",
"text": "/-- to_bits_truncate is equivalent to BitVec.ofInt. -/\ntheorem to_bits_truncate_eq_ofInt {x : Int} :\n to_bits_truncate (l := 64) x = BitVec.ofInt 64 x := by\n simp [to_bits_truncate, get_slice_int]\n apply BitVec.eq_of_toNat_eq; simp [BitVec.toNat_ofInt... | [
{
"name": "to_bits_truncate_neg_pow63",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 320,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"... | 1 | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | @@ -18,10 +18,18 @@
-- Proved helper lemmas for division/remainder
-- ============================================================================
+/-- to_bits_truncate is equivalent to BitVec.ofInt. -/
+theorem to_bits_truncate_eq_ofInt {x : Int} :
+ to_bits_truncate (l := 64) x = BitVec.ofInt 64 x := by
+ sim... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5437447f23b2_9 | 0910ec683b69e4cb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/MExtProofs.lean | MExtProofs | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "signed_div_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [to_bits_truncate_eq_ofInt,\n show a.sdiv b = BitVec.ofInt 64 (a.sdiv b).toInt from BitVec.ofInt_toInt.symm,\n Bi... | [
{
"name": "to_bits_truncate_eq_ofInt",
"text": "/-- to_bits_truncate is equivalent to BitVec.ofInt. -/\ntheorem to_bits_truncate_eq_ofInt {x : Int} :\n to_bits_truncate (l := 64) x = BitVec.ofInt 64 x := by\n simp [to_bits_truncate, get_slice_int]\n apply BitVec.eq_of_toNat_eq; simp [BitVec.toNat_ofInt... | [
{
"name": "overflow_guard_div",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 868,
"n_subproofs": 4,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_ne... | 2 | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | @@ -18,10 +18,18 @@
-- Proved helper lemmas for division/remainder
-- ============================================================================
+/-- to_bits_truncate is equivalent to BitVec.ofInt. -/
+theorem to_bits_truncate_eq_ofInt {x : Int} :
+ to_bits_truncate (l := 64) x = BitVec.ofInt 64 x := by
+ sim... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5437447f23b2_10 | 759e532ed4a700e1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/MExtProofs.lean | MExtProofs | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 2 | [
{
"theorem_name": "divu_full_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold rv64_divu BitVec.toNatInt; rw [int_ofNat_beq_zero]\n by_cases hb : b = 0#64\n · subst hb; simp [to_bits_truncate_n... | [
{
"name": "to_bits_truncate_neg1",
"text": "/-- to_bits_truncate (-1) = allOnes 64. -/\ntheorem to_bits_truncate_neg1 :\n to_bits_truncate (l := 64) (-1 : Int) = BitVec.allOnes 64 := by\n simp [to_bits_truncate, get_slice_int, BitVec.allOnes]\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 201,
... | [
{
"name": "div_full_equiv_applied",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 6,
"n_lines": 26,
"n_chars": 1350,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
"ma... | 6 | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | @@ -18,6 +18,11 @@
-- Proved helper lemmas for division/remainder
-- ============================================================================
+/-- to_bits_truncate (-1) = allOnes 64. -/
+theorem to_bits_truncate_neg1 :
+ to_bits_truncate (l := 64) (-1 : Int) = BitVec.allOnes 64 := by
+ simp [to_bits_truncat... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5437447f23b2_11 | 4584aa1e79b98cfe | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/MExtProofs.lean | MExtProofs | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 2 | [
{
"theorem_name": "to_bits_truncate_signed_mul",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [to_bits_truncate_eq_ofInt_128]; apply BitVec.eq_of_toInt_eq\n simp only [BitVec.toInt_ofInt, BitVec.toInt_... | [
{
"name": "to_bits_truncate_eq_ofInt_128",
"text": "private theorem to_bits_truncate_eq_ofInt_128 (x : Int) :\n to_bits_truncate (l := 128) x = BitVec.ofInt 128 x := by\n simp [to_bits_truncate, get_slice_int]\n apply BitVec.eq_of_toNat_eq; simp [BitVec.toNat_ofInt]; omega\n\n",
"fan_in": 2,
"n... | [
{
"name": "to_bits_truncate_signed_mul",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 442,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
... | 2 | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | @@ -18,12 +18,20 @@
-- Proved helper lemmas for division/remainder
-- ============================================================================
+private theorem to_bits_truncate_eq_ofInt_128 (x : Int) :
+ to_bits_truncate (l := 128) x = BitVec.ofInt 128 x := by
+ simp [to_bits_truncate, get_slice_int]
+ app... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5437447f23b2_12 | 958bcbc79d2e89cc | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/MExtProofs.lean | MExtProofs | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 2 | [
{
"theorem_name": "to_bits_truncate_signed_mul",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [to_bits_truncate_eq_ofInt_128]; apply BitVec.eq_of_toInt_eq\n simp only [BitVec.toInt_ofInt, BitVec.toInt_... | [
{
"name": "to_bits_truncate_eq_ofInt_128",
"text": "private theorem to_bits_truncate_eq_ofInt_128 (x : Int) :\n to_bits_truncate (l := 128) x = BitVec.ofInt 128 x := by\n simp [to_bits_truncate, get_slice_int]\n apply BitVec.eq_of_toNat_eq; simp [BitVec.toNat_ofInt]; omega\n\n",
"fan_in": 2,
"n... | [
{
"name": "to_bits_truncate_mixed_mul",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 494,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"... | 3 | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | @@ -18,6 +18,11 @@
-- Proved helper lemmas for division/remainder
-- ============================================================================
+private theorem to_bits_truncate_eq_ofInt_128 (x : Int) :
+ to_bits_truncate (l := 128) x = BitVec.ofInt 128 x := by
+ simp [to_bits_truncate, get_slice_int]
+ appl... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5437447f23b2_13 | 799f6f167bfbae2a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/MExtProofs.lean | MExtProofs | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 2 | [
{
"theorem_name": "to_bits_truncate_signed_mul",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [to_bits_truncate_eq_ofInt_128]; apply BitVec.eq_of_toInt_eq\n simp only [BitVec.toInt_ofInt, BitVec.toInt_... | [
{
"name": "to_bits_truncate_eq_ofInt_128",
"text": "private theorem to_bits_truncate_eq_ofInt_128 (x : Int) :\n to_bits_truncate (l := 128) x = BitVec.ofInt 128 x := by\n simp [to_bits_truncate, get_slice_int]\n apply BitVec.eq_of_toNat_eq; simp [BitVec.toNat_ofInt]; omega\n\n",
"fan_in": 2,
"n... | [
{
"name": "mulh_high_equiv",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 11,
"n_chars": 467,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 3 | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | @@ -18,12 +18,20 @@
-- Proved helper lemmas for division/remainder
-- ============================================================================
+private theorem to_bits_truncate_eq_ofInt_128 (x : Int) :
+ to_bits_truncate (l := 128) x = BitVec.ofInt 128 x := by
+ simp [to_bits_truncate, get_slice_int]
+ app... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5437447f23b2_14 | 135e222b647f7fb7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/MExtProofs.lean | MExtProofs | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 2 | [
{
"theorem_name": "to_bits_truncate_signed_mul",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [to_bits_truncate_eq_ofInt_128]; apply BitVec.eq_of_toInt_eq\n simp only [BitVec.toInt_ofInt, BitVec.toInt_... | [
{
"name": "to_bits_truncate_eq_ofInt_128",
"text": "private theorem to_bits_truncate_eq_ofInt_128 (x : Int) :\n to_bits_truncate (l := 128) x = BitVec.ofInt 128 x := by\n simp [to_bits_truncate, get_slice_int]\n apply BitVec.eq_of_toNat_eq; simp [BitVec.toNat_ofInt]; omega\n\n",
"fan_in": 2,
"n... | [
{
"name": "mulhsu_high_equiv",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 15,
"n_chars": 691,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
"max_nest... | 4 | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | @@ -18,6 +18,11 @@
-- Proved helper lemmas for division/remainder
-- ============================================================================
+private theorem to_bits_truncate_eq_ofInt_128 (x : Int) :
+ to_bits_truncate (l := 128) x = BitVec.ofInt 128 x := by
+ simp [to_bits_truncate, get_slice_int]
+ appl... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5437447f23b2_15 | 7ef2ad72c978f322 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/MExtProofs.lean | MExtProofs | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 2 | [
{
"theorem_name": "to_bits_truncate_signed_mul",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [to_bits_truncate_eq_ofInt_128]; apply BitVec.eq_of_toInt_eq\n simp only [BitVec.toInt_ofInt, BitVec.toInt_... | [
{
"name": "to_bits_truncate_eq_ofInt_128",
"text": "private theorem to_bits_truncate_eq_ofInt_128 (x : Int) :\n to_bits_truncate (l := 128) x = BitVec.ofInt 128 x := by\n simp [to_bits_truncate, get_slice_int]\n apply BitVec.eq_of_toNat_eq; simp [BitVec.toNat_ofInt]; omega\n\n",
"fan_in": 2,
"n... | [
{
"name": "mulh_sail_equiv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 24,
"n_chars": 1189,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nest... | 4 | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | @@ -18,12 +18,20 @@
-- Proved helper lemmas for division/remainder
-- ============================================================================
+private theorem to_bits_truncate_eq_ofInt_128 (x : Int) :
+ to_bits_truncate (l := 128) x = BitVec.ofInt 128 x := by
+ simp [to_bits_truncate, get_slice_int]
+ app... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5437447f23b2_16 | f92ec7aab5c32c4e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/MExtProofs.lean | MExtProofs | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 2 | [
{
"theorem_name": "to_bits_truncate_signed_mul",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [to_bits_truncate_eq_ofInt_128]; apply BitVec.eq_of_toInt_eq\n simp only [BitVec.toInt_ofInt, BitVec.toInt_... | [
{
"name": "to_bits_truncate_eq_ofInt_128",
"text": "private theorem to_bits_truncate_eq_ofInt_128 (x : Int) :\n to_bits_truncate (l := 128) x = BitVec.ofInt 128 x := by\n simp [to_bits_truncate, get_slice_int]\n apply BitVec.eq_of_toNat_eq; simp [BitVec.toNat_ofInt]; omega\n\n",
"fan_in": 2,
"n... | [
{
"name": "mulhsu_sail_equiv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 24,
"n_chars": 1201,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_ne... | 5 | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | @@ -18,6 +18,11 @@
-- Proved helper lemmas for division/remainder
-- ============================================================================
+private theorem to_bits_truncate_eq_ofInt_128 (x : Int) :
+ to_bits_truncate (l := 128) x = BitVec.ofInt 128 x := by
+ simp [to_bits_truncate, get_slice_int]
+ appl... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5437447f23b2_17 | 327ec35bb6ae39a0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/MExtProofs.lean | MExtProofs | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 1 | [
{
"theorem_name": "mulhu_sail_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold execute_MUL\n simp only [runSail_bind, runSail_rX_bits_of_stateRel hrel, runSail_pure,\n show ∀ x y : Word, mu... | [
{
"name": "mulhu_high_equiv",
"text": "/-- MULHU value: SAIL's mult_to_bits_half Unsigned Unsigned High = rv64_mulhu. -/\ntheorem mulhu_high_equiv (a b : BitVec 64) :\n mult_to_bits_half (l := 64) Signedness.Unsigned Signedness.Unsigned a b VectorHalf.High\n = rv64_mulhu a b := by\n rw [mult_to_bits_... | [
{
"name": "mulhu_sail_equiv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 24,
"n_chars": 1201,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nes... | 1 | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | @@ -18,6 +18,17 @@
-- Proved helper lemmas for division/remainder
-- ============================================================================
+/-- MULHU value: SAIL's mult_to_bits_half Unsigned Unsigned High = rv64_mulhu. -/
+theorem mulhu_high_equiv (a b : BitVec 64) :
+ mult_to_bits_half (l := 64) Signedne... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5437447f23b2_18 | 744862817f2f6730 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/MExtProofs.lean | MExtProofs | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 2 | [
{
"theorem_name": "divu_full_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold rv64_divu BitVec.toNatInt; rw [int_ofNat_beq_zero]\n by_cases hb : b = 0#64\n · subst hb; simp [to_bits_truncate_n... | [
{
"name": "to_bits_truncate_neg1",
"text": "/-- to_bits_truncate (-1) = allOnes 64. -/\ntheorem to_bits_truncate_neg1 :\n to_bits_truncate (l := 64) (-1 : Int) = BitVec.allOnes 64 := by\n simp [to_bits_truncate, get_slice_int, BitVec.allOnes]\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 201,
... | [
{
"name": "div_sail_equiv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 22,
"n_chars": 1050,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 7 | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | @@ -18,6 +18,11 @@
-- Proved helper lemmas for division/remainder
-- ============================================================================
+/-- to_bits_truncate (-1) = allOnes 64. -/
+theorem to_bits_truncate_neg1 :
+ to_bits_truncate (l := 64) (-1 : Int) = BitVec.allOnes 64 := by
+ simp [to_bits_truncat... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5437447f23b2_19 | 70e2df9ae058d5bb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/MExtProofs.lean | MExtProofs | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 3 | [
{
"theorem_name": "unsigned_div_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [(Int.ofNat_tdiv a.toNat b.toNat).symm, to_bits_truncate_natCast]\n apply BitVec.eq_of_toNat_eq; simp [BitVec.toNat_... | [
{
"name": "to_bits_truncate_natCast",
"text": "/-- to_bits_truncate on a non-negative integer = BitVec.ofNat. -/\ntheorem to_bits_truncate_natCast {n : Nat} :\n to_bits_truncate (l := 64) (↑n : Int) = BitVec.ofNat 64 n := by\n simp [to_bits_truncate, get_slice_int]; apply BitVec.eq_of_toNat_eq; simp\n\n... | [
{
"name": "divu_sail_equiv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 22,
"n_chars": 1074,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"max_nest... | 5 | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | @@ -18,6 +18,11 @@
-- Proved helper lemmas for division/remainder
-- ============================================================================
+/-- to_bits_truncate on a non-negative integer = BitVec.ofNat. -/
+theorem to_bits_truncate_natCast {n : Nat} :
+ to_bits_truncate (l := 64) (↑n : Int) = BitVec.ofNat... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5437447f23b2_20 | e97f6e79a9b1b6dc | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/MExtProofs.lean | MExtProofs | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 4 | [
{
"theorem_name": "signed_div_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [to_bits_truncate_eq_ofInt,\n show a.sdiv b = BitVec.ofInt 64 (a.sdiv b).toInt from BitVec.ofInt_toInt.symm,\n Bi... | [
{
"name": "to_bits_truncate_eq_ofInt",
"text": "/-- to_bits_truncate is equivalent to BitVec.ofInt. -/\ntheorem to_bits_truncate_eq_ofInt {x : Int} :\n to_bits_truncate (l := 64) x = BitVec.ofInt 64 x := by\n simp [to_bits_truncate, get_slice_int]\n apply BitVec.eq_of_toNat_eq; simp [BitVec.toNat_ofInt... | [
{
"name": "rem_sail_equiv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 21,
"n_chars": 988,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 5 | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | @@ -18,13 +18,24 @@
-- Proved helper lemmas for division/remainder
-- ============================================================================
+/-- to_bits_truncate is equivalent to BitVec.ofInt. -/
+theorem to_bits_truncate_eq_ofInt {x : Int} :
+ to_bits_truncate (l := 64) x = BitVec.ofInt 64 x := by
+ sim... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5437447f23b2_21 | c0678da33be05b78 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SailEquiv/MExtProofs.lean | MExtProofs | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 24 | 3 | [
{
"theorem_name": "unsigned_div_equiv",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [(Int.ofNat_tdiv a.toNat b.toNat).symm, to_bits_truncate_natCast]\n apply BitVec.eq_of_toNat_eq; simp [BitVec.toNat_... | [
{
"name": "to_bits_truncate_natCast",
"text": "/-- to_bits_truncate on a non-negative integer = BitVec.ofNat. -/\ntheorem to_bits_truncate_natCast {n : Nat} :\n to_bits_truncate (l := 64) (↑n : Int) = BitVec.ofNat 64 n := by\n simp [to_bits_truncate, get_slice_int]; apply BitVec.eq_of_toNat_eq; simp\n\n... | [
{
"name": "remu_sail_equiv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 20,
"n_chars": 965,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 4 | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | /-
EvmAsm.Rv64.SailEquiv.MExtProofs
Per-instruction equivalence theorems for M-extension instructions:
MULH, MULHSU, MULHU, DIV, DIVU, REM, REMU.
MUL (low 64 bits) is already proved in ALUProofs.lean.
-/
import EvmAsm.Rv64.SailEquiv.ALUProofs
open Out.Functions
open Sail
namespace EvmAsm.Rv64.SailEquiv
--... | @@ -18,6 +18,11 @@
-- Proved helper lemmas for division/remainder
-- ============================================================================
+/-- to_bits_truncate on a non-negative integer = BitVec.ofNat. -/
+theorem to_bits_truncate_natCast {n : Nat} :
+ to_bits_truncate (l := 64) (↑n : Int) = BitVec.ofNat... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0af704b86a97_0 | d5f06db228efdffa | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/LogArgsStackDecode.lean | LogArgsStackDecode | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "decodeLogStack?_eq_some_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases kind\n · exact decodeLogStack?_log0_eq_some_iff stack decoded\n · exact decodeLogStack?_log1_eq_some_if... | [
{
"name": "decodeLogStack?_log1_eq_some_iff",
"text": "theorem decodeLogStack?_log1_eq_some_iff\n (stack : List EvmWord) (decoded : Args) :\n decodeLogStack? .log1 stack = some decoded ↔\n ∃ offset size topic0 rest,\n stack = offset :: size :: topic0 :: rest ∧\n decoded = mkArgs off... | [
{
"name": "decodeLogStack?_eq_some_iff",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 32,
"n_chars": 1420,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 6,
"automation_only": false,
... | 5 | /-
EvmAsm.Evm64.LogArgsStackDecode
Pure top-of-stack decoders for LOG0 through LOG4 arguments (GH #112).
-/
import EvmAsm.Evm64.LogArgs
namespace EvmAsm.Evm64
namespace LogArgsStackDecode
open LogArgs
def mkArgs (offset size : EvmWord) (topics : List EvmWord) : Args :=
{ data := { offset := offset, size := ... | /-
EvmAsm.Evm64.LogArgsStackDecode
Pure top-of-stack decoders for LOG0 through LOG4 arguments (GH #112).
-/
import EvmAsm.Evm64.LogArgs
namespace EvmAsm.Evm64
namespace LogArgsStackDecode
open LogArgs
def mkArgs (offset size : EvmWord) (topics : List EvmWord) : Args :=
{ data := { offset := offset, size := ... | @@ -60,6 +60,21 @@
· rintro ⟨offset, size, rest, rfl, rfl⟩
rfl
+theorem decodeLogStack?_log1_eq_some_iff
+ (stack : List EvmWord) (decoded : Args) :
+ decodeLogStack? .log1 stack = some decoded ↔
+ ∃ offset size topic0 rest,
+ stack = offset :: size :: topic0 :: rest ∧
+ decoded = mkA... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0af704b86a97_1 | a0dc3fab3d6f9282 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/LogArgsStackDecode.lean | LogArgsStackDecode | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "decodeLogStack?_eq_none_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases kind with\n | log0 => exact decodeLogStack?_log0_eq_none_iff stack\n | log1 => exact decodeLogStack?_lo... | [
{
"name": "decodeLogStack?_log1_eq_none_iff",
"text": "theorem decodeLogStack?_log1_eq_none_iff\n (stack : List EvmWord) :\n decodeLogStack? .log1 stack = none ↔\n stack.length < stackArgumentCount .log1 := by\n constructor\n · intro h_decode\n rcases stack with _ | ⟨_, _ | ⟨_, _ | ⟨_, _⟩⟩⟩\... | [
{
"name": "decodeLogStack?_eq_none_iff",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 12,
"n_chars": 476,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 6,
"automation_only": false,
... | 5 | /-
EvmAsm.Evm64.LogArgsStackDecode
Pure top-of-stack decoders for LOG0 through LOG4 arguments (GH #112).
-/
import EvmAsm.Evm64.LogArgs
namespace EvmAsm.Evm64
namespace LogArgsStackDecode
open LogArgs
def mkArgs (offset size : EvmWord) (topics : List EvmWord) : Args :=
{ data := { offset := offset, size := ... | /-
EvmAsm.Evm64.LogArgsStackDecode
Pure top-of-stack decoders for LOG0 through LOG4 arguments (GH #112).
-/
import EvmAsm.Evm64.LogArgs
namespace EvmAsm.Evm64
namespace LogArgsStackDecode
open LogArgs
def mkArgs (offset size : EvmWord) (topics : List EvmWord) : Args :=
{ data := { offset := offset, size := ... | @@ -62,6 +62,25 @@
simp [stackArgumentCount, topicCount] at h_len
omega
+theorem decodeLogStack?_log1_eq_none_iff
+ (stack : List EvmWord) :
+ decodeLogStack? .log1 stack = none ↔
+ stack.length < stackArgumentCount .log1 := by
+ constructor
+ · intro h_decode
+ rcases stack ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f0fddec143e5_0 | 8ece4620b92c03ca | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/ModFullPathN4.lean | ModFullPathN4 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "mod_denorm_preamble_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 37,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hld := ld_spec_gen_within .x6 .x12 sp v6 shift (3992 : BitVec 12) (base + denormOff) (by nofun)\n ha... | [
{
"name": "divK_denorm_code_sub_modCode_n4",
"text": "/-- Denorm code (block 9) is subsumed by `modCode`. Local copy for the bounded\n preamble variant in this file. -/\nprivate theorem divK_denorm_code_sub_modCode_n4 (base : Word) :\n ∀ a i, (CodeReq.ofProg (base + denormOff) divK_denorm) a = some i ... | [
{
"name": "mod_denorm_preamble_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 49,
"n_chars": 2680,
"n_subproofs": 10,
"n_tactics": 37,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 7,
"automation_only": fal... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.ModFullPathN4
MOD full n=4 path composition: pre-loop → loop body (j=0) → post-loop.
Mirror of `FullPathN4.lean` for DIV, against `modCode`.
For n=4, the loop runs exactly 1 iteration (j=0 only).
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN4Beq
import EvmAsm.Evm64.DivMod.Com... | /-
EvmAsm.Evm64.DivMod.Compose.ModFullPathN4
MOD full n=4 path composition: pre-loop → loop body (j=0) → post-loop.
Mirror of `FullPathN4.lean` for DIV, against `modCode`.
For n=4, the loop runs exactly 1 iteration (j=0 only).
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN4Beq
import EvmAsm.Evm64.DivMod.Com... | @@ -21,6 +21,15 @@
-- Local bounded MOD post-loop components
-- ============================================================================
+/-- Denorm code (block 9) is subsumed by `modCode`. Local copy for the bounded
+ preamble variant in this file. -/
+private theorem divK_denorm_code_sub_modCode_n4 (base :... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f0fddec143e5_1 | b07e5021049b983f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/ModFullPathN4.lean | ModFullPathN4 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "evm_mod_preamble_denorm_epilogue_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hPre := mod_denorm_preamble_spec_within sp shift v5 v6 v7 v2 v10 base hshift_nz\n have ... | [
{
"name": "mod_denorm_preamble_spec_within",
"text": "/-- Bounded denorm preamble for shift≠0 with `modCode`: LD shift from memory\n followed by a not-taken BEQ. -/\ntheorem mod_denorm_preamble_spec_within (sp shift v5 v6 v7 v2 v10 : Word) (base : Word)\n (hshift_nz : shift ≠ 0) :\n cpsTripleWithin... | [
{
"name": "evm_mod_preamble_denorm_epilogue_spec_within",
"fan_in": 3,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 40,
"n_chars": 2090,
"n_subproofs": 5,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automatio... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.ModFullPathN4
MOD full n=4 path composition: pre-loop → loop body (j=0) → post-loop.
Mirror of `FullPathN4.lean` for DIV, against `modCode`.
For n=4, the loop runs exactly 1 iteration (j=0 only).
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN4Beq
import EvmAsm.Evm64.DivMod.Com... | /-
EvmAsm.Evm64.DivMod.Compose.ModFullPathN4
MOD full n=4 path composition: pre-loop → loop body (j=0) → post-loop.
Mirror of `FullPathN4.lean` for DIV, against `modCode`.
For n=4, the loop runs exactly 1 iteration (j=0 only).
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN4Beq
import EvmAsm.Evm64.DivMod.Com... | @@ -30,6 +30,54 @@
skipBlock; skipBlock; skipBlock; skipBlock
exact CodeReq.union_mono_left
+/-- Bounded denorm preamble for shift≠0 with `modCode`: LD shift from memory
+ followed by a not-taken BEQ. -/
+theorem mod_denorm_preamble_spec_within (sp shift v5 v6 v7 v2 v10 : Word) (base : Word)
+ (hshift_nz ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f0fddec143e5_2 | 43e1263df8cc9644 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/ModFullPathN4.lean | ModFullPathN4 | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "evm_mod_n4_full_max_skip_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 50,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let shift := (clzResult b3).1\n let antiShift := signExtend12 (0 : BitVec 12) - shift\n let b3' := ... | [
{
"name": "evm_mod_preamble_denorm_epilogue_spec_within",
"text": "/-- Bounded post-loop chain for MOD with preamble: loads shift, denormalizes\n u[], then outputs u'[] (remainder). -/\ntheorem evm_mod_preamble_denorm_epilogue_spec_within (sp base : Word)\n (u0 u1 u2 u3 shift v2 v5 v6 v7 v10 : Word)\n... | [
{
"name": "evm_mod_n4_full_max_skip_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 86,
"n_chars": 4726,
"n_subproofs": 4,
"n_tactics": 48,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
"automation_only":... | 5 | /-
EvmAsm.Evm64.DivMod.Compose.ModFullPathN4
MOD full n=4 path composition: pre-loop → loop body (j=0) → post-loop.
Mirror of `FullPathN4.lean` for DIV, against `modCode`.
For n=4, the loop runs exactly 1 iteration (j=0 only).
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN4Beq
import EvmAsm.Evm64.DivMod.Com... | /-
EvmAsm.Evm64.DivMod.Compose.ModFullPathN4
MOD full n=4 path composition: pre-loop → loop body (j=0) → post-loop.
Mirror of `FullPathN4.lean` for DIV, against `modCode`.
For n=4, the loop runs exactly 1 iteration (j=0 only).
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN4Beq
import EvmAsm.Evm64.DivMod.Com... | @@ -115,6 +115,45 @@
(fun h hq => by delta denormModPost; xperm_hyp hq)
hFull
+/-- Bounded post-loop chain for MOD with preamble: loads shift, denormalizes
+ u[], then outputs u'[] (remainder). -/
+theorem evm_mod_preamble_denorm_epilogue_spec_within (sp base : Word)
+ (u0 u1 u2 u3 shift v2 v5 v6 v7 v... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f0fddec143e5_3 | c2ff74b0489dd1f5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/ModFullPathN4.lean | ModFullPathN4 | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "evm_mod_n4_full_max_skip_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 50,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let shift := (clzResult b3).1\n let antiShift := signExtend12 (0 : BitVec 12) - shift\n let b3' := ... | [
{
"name": "evm_mod_preamble_denorm_epilogue_spec_within",
"text": "/-- Bounded post-loop chain for MOD with preamble: loads shift, denormalizes\n u[], then outputs u'[] (remainder). -/\ntheorem evm_mod_preamble_denorm_epilogue_spec_within (sp base : Word)\n (u0 u1 u2 u3 shift v2 v5 v6 v7 v10 : Word)\n... | [
{
"name": "evm_mod_n4_full_call_skip_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 100,
"n_chars": 5529,
"n_subproofs": 4,
"n_tactics": 56,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
"automation_only... | 5 | /-
EvmAsm.Evm64.DivMod.Compose.ModFullPathN4
MOD full n=4 path composition: pre-loop → loop body (j=0) → post-loop.
Mirror of `FullPathN4.lean` for DIV, against `modCode`.
For n=4, the loop runs exactly 1 iteration (j=0 only).
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN4Beq
import EvmAsm.Evm64.DivMod.Com... | /-
EvmAsm.Evm64.DivMod.Compose.ModFullPathN4
MOD full n=4 path composition: pre-loop → loop body (j=0) → post-loop.
Mirror of `FullPathN4.lean` for DIV, against `modCode`.
For n=4, the loop runs exactly 1 iteration (j=0 only).
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN4Beq
import EvmAsm.Evm64.DivMod.Com... | @@ -115,6 +115,45 @@
(fun h hq => by delta denormModPost; xperm_hyp hq)
hFull
+/-- Bounded post-loop chain for MOD with preamble: loads shift, denormalizes
+ u[], then outputs u'[] (remainder). -/
+theorem evm_mod_preamble_denorm_epilogue_spec_within (sp base : Word)
+ (u0 u1 u2 u3 shift v2 v5 v6 v7 v... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f0fddec143e5_4 | e3fdb909727bcf00 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/ModFullPathN4.lean | ModFullPathN4 | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "evm_mod_n4_full_max_skip_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 50,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let shift := (clzResult b3).1\n let antiShift := signExtend12 (0 : BitVec 12) - shift\n let b3' := ... | [
{
"name": "evm_mod_preamble_denorm_epilogue_spec_within",
"text": "/-- Bounded post-loop chain for MOD with preamble: loads shift, denormalizes\n u[], then outputs u'[] (remainder). -/\ntheorem evm_mod_preamble_denorm_epilogue_spec_within (sp base : Word)\n (u0 u1 u2 u3 shift v2 v5 v6 v7 v10 : Word)\n... | [
{
"name": "evm_mod_n4_full_call_addback_beq_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 101,
"n_chars": 6107,
"n_subproofs": 4,
"n_tactics": 68,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
"automati... | 5 | /-
EvmAsm.Evm64.DivMod.Compose.ModFullPathN4
MOD full n=4 path composition: pre-loop → loop body (j=0) → post-loop.
Mirror of `FullPathN4.lean` for DIV, against `modCode`.
For n=4, the loop runs exactly 1 iteration (j=0 only).
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN4Beq
import EvmAsm.Evm64.DivMod.Com... | /-
EvmAsm.Evm64.DivMod.Compose.ModFullPathN4
MOD full n=4 path composition: pre-loop → loop body (j=0) → post-loop.
Mirror of `FullPathN4.lean` for DIV, against `modCode`.
For n=4, the loop runs exactly 1 iteration (j=0 only).
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN4Beq
import EvmAsm.Evm64.DivMod.Com... | @@ -115,6 +115,45 @@
(fun h hq => by delta denormModPost; xperm_hyp hq)
hFull
+/-- Bounded post-loop chain for MOD with preamble: loads shift, denormalizes
+ u[], then outputs u'[] (remainder). -/
+theorem evm_mod_preamble_denorm_epilogue_spec_within (sp base : Word)
+ (u0 u1 u2 u3 shift v2 v5 v6 v7 v... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a457bb8cc6fd_0 | 27ca5fcf249e46ff | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Pop/Spec.lean | Spec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_pop_stack_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_frameR\n (evmWordIs sp a ** evmStackIs (sp + 32) rest)\n (pcFree_sepConj pcFree_evmWordIs pcFr... | [
{
"name": "evm_pop_spec_within",
"text": "/-- POP: advances stack pointer by 32 bytes (discards top 256-bit element).\n 1 instruction = 4 bytes. -/\ntheorem evm_pop_spec_within (sp base : Word) :\n cpsTripleWithin 1 base (base + 4) (evm_pop_code base)\n (.x12 ↦ᵣ sp)\n (.x12 ↦ᵣ (sp + 32)) := ... | [
{
"name": "evm_pop_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 532,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"... | 1 | /-
EvmAsm.Evm64.Pop.Spec
256-bit EVM POP specs.
-/
import EvmAsm.Evm64.Pop.Program
import EvmAsm.Evm64.Stack
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- POP stack spec: discards top element, rest untouched. -/
theorem... | /-
EvmAsm.Evm64.Pop.Spec
256-bit EVM POP specs.
-/
import EvmAsm.Evm64.Pop.Program
import EvmAsm.Evm64.Stack
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- POP: advances stack pointer by 32 bytes (discards top 256-bit el... | @@ -15,12 +15,26 @@
open EvmAsm.Rv64
+/-- POP: advances stack pointer by 32 bytes (discards top 256-bit element).
+ 1 instruction = 4 bytes. -/
+theorem evm_pop_spec_within (sp base : Word) :
+ cpsTripleWithin 1 base (base + 4) (evm_pop_code base)
+ (.x12 ↦ᵣ sp)
+ (.x12 ↦ᵣ (sp + 32)) := by
+ have ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0d85f6e4ae01_0 | d6354b88cf99f4f9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LimbSpec/PhaseC2.lean | PhaseC2 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "divK_phaseC2_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 41,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro cr post\n have hbody := divK_phaseC2_body_spec_within sp shift v2 shiftMem shift0_off base\n have hbeq_ra... | [
{
"name": "divK_phaseC2_body_spec_within",
"text": "/-- Phase C2 body: SD shift to scratch, ADDI x2 = 0, SUB x2 = -shift.\n Preserves x6 and x0 for the subsequent BEQ.\n The postcondition uses `signExtend12 (0 : BitVec 12) - shift` (= 0 - shift)\n to match the syntactic form produced by addi_x0_spe... | [
{
"name": "divK_phaseC2_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 61,
"n_chars": 2700,
"n_subproofs": 7,
"n_tactics": 44,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 6,
"n_structural": 3,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.LimbSpec.PhaseC2
CPS specs for the Knuth Algorithm D "phase C2" — the 3-instruction
setup that stores `shift` to scratch, zeros `x2`, then computes
`x2 = -shift` (the "anti-shift") — followed by a BEQ that jumps past
the normalize/denormalize dance when `shift = 0`:
* `divK_phaseC2... | /-
EvmAsm.Evm64.DivMod.LimbSpec.PhaseC2
CPS specs for the Knuth Algorithm D "phase C2" — the 3-instruction
setup that stores `shift` to scratch, zeros `x2`, then computes
`x2 = -shift` (the "anti-shift") — followed by a BEQ that jumps past
the normalize/denormalize dance when `shift = 0`:
* `divK_phaseC2... | @@ -30,6 +30,27 @@
abbrev divK_phaseC2_code (shift0_off : BitVec 13) (base : Word) : CodeReq :=
CodeReq.ofProg base (divK_phaseC2 shift0_off)
+/-- Phase C2 body: SD shift to scratch, ADDI x2 = 0, SUB x2 = -shift.
+ Preserves x6 and x0 for the subsequent BEQ.
+ The postcondition uses `signExtend12 (0 : BitVe... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_be809792ad52_0 | 8b7ad4aecfa7b4cc | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/ModFullPathN3LoopUnified.lean | ModFullPathN3LoopUnified | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "evm_mod_n3_loop_unified_inst",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n divK_loop_n3_unified_modCode bltu_1 bltu_0\n sp jMem (3 : Word) shift u0 v10Old v11Old antiShift\n b0' b1' ... | [
{
"name": "divK_loop_n3_unified_modCode",
"text": "theorem divK_loop_n3_unified_modCode (bltu_1 bltu_0 : Bool)\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop u0Orig\n q3Old q2Old : Word)\n (retMem dMem dloMem scratch_un0 : Word)\n (base : Word)\n (halign ... | [
{
"name": "evm_mod_n3_loop_unified_inst",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 24,
"n_chars": 1197,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.ModFullPathN3LoopUnified
MOD n=3 full-path composition using the shared N3 unified loop post bundle.
These wrappers still thread the legacy universal Carry2NzAll package and
should be treated as compatibility surfaces only. New v4 stack/callable work
should use selected/reachab... | /-
EvmAsm.Evm64.DivMod.Compose.ModFullPathN3LoopUnified
MOD n=3 full-path composition using the shared N3 unified loop post bundle.
These wrappers still thread the legacy universal Carry2NzAll package and
should be treated as compatibility surfaces only. New v4 stack/callable work
should use selected/reachab... | @@ -18,6 +18,30 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
+theorem divK_loop_n3_unified_modCode (bltu_1 bltu_0 : Bool)
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop u0Orig
+ q3Old q2Old : Word)
+ (retMem dMem dloMem scratch_un0 : ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_be809792ad52_1 | 3edd57cf282f3ff2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/ModFullPathN3LoopUnified.lean | ModFullPathN3LoopUnified | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "evm_mod_n3_loop_unified_inst",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n divK_loop_n3_unified_modCode bltu_1 bltu_0\n sp jMem (3 : Word) shift u0 v10Old v11Old antiShift\n b0' b1' ... | [
{
"name": "divK_loop_n3_unified_modCode",
"text": "theorem divK_loop_n3_unified_modCode (bltu_1 bltu_0 : Bool)\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop u0Orig\n q3Old q2Old : Word)\n (retMem dMem dloMem scratch_un0 : Word)\n (base : Word)\n (halign ... | [
{
"name": "evm_mod_n3_preloop_loop_unified_spec",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 90,
"n_chars": 5437,
"n_subproofs": 5,
"n_tactics": 52,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 1,
"automation_only":... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.ModFullPathN3LoopUnified
MOD n=3 full-path composition using the shared N3 unified loop post bundle.
These wrappers still thread the legacy universal Carry2NzAll package and
should be treated as compatibility surfaces only. New v4 stack/callable work
should use selected/reachab... | /-
EvmAsm.Evm64.DivMod.Compose.ModFullPathN3LoopUnified
MOD n=3 full-path composition using the shared N3 unified loop post bundle.
These wrappers still thread the legacy universal Carry2NzAll package and
should be treated as compatibility surfaces only. New v4 stack/callable work
should use selected/reachab... | @@ -18,6 +18,30 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
+theorem divK_loop_n3_unified_modCode (bltu_1 bltu_0 : Bool)
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop u0Orig
+ q3Old q2Old : Word)
+ (retMem dMem dloMem scratch_un0 : ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_be809792ad52_2 | 06d4536a1567533c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/ModFullPathN3LoopUnified.lean | ModFullPathN3LoopUnified | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "evm_mod_n3_preloop_loop_unified_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 51,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hPre := evm_mod_n3_to_loopSetup_spec_within sp base\n a0 a1 a2 a3 b0 b1 b2 b3 v5 v6 v7 v10\n ... | [
{
"name": "evm_mod_n3_loop_unified_inst",
"text": "private theorem evm_mod_n3_loop_unified_inst\n (bltu_1 bltu_0 : Bool) (sp base : Word)\n (shift antiShift b0' b1' b2' b3' u0 u1 u2 u3 u4 : Word)\n (v10Old v11Old jMem : Word)\n (retMem dMem dloMem scratch_un0 : Word)\n (halign : ((base + div1... | [
{
"name": "evm_mod_n3_full_unified_spec",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 72,
"n_chars": 4318,
"n_subproofs": 5,
"n_tactics": 35,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 8,
"automation_only": false,
... | 5 | /-
EvmAsm.Evm64.DivMod.Compose.ModFullPathN3LoopUnified
MOD n=3 full-path composition using the shared N3 unified loop post bundle.
These wrappers still thread the legacy universal Carry2NzAll package and
should be treated as compatibility surfaces only. New v4 stack/callable work
should use selected/reachab... | /-
EvmAsm.Evm64.DivMod.Compose.ModFullPathN3LoopUnified
MOD n=3 full-path composition using the shared N3 unified loop post bundle.
These wrappers still thread the legacy universal Carry2NzAll package and
should be treated as compatibility surfaces only. New v4 stack/callable work
should use selected/reachab... | @@ -42,6 +42,29 @@
retMem dMem dloMem scratch_un0 base halign
hbltu_1 hbltu_0 hcarry2)
+private theorem evm_mod_n3_loop_unified_inst
+ (bltu_1 bltu_0 : Bool) (sp base : Word)
+ (shift antiShift b0' b1' b2' b3' u0 u1 u2 u3 u4 : Word)
+ (v10Old v11Old jMem : Word)
+ (retMem dMem dloMem scratch... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7b9443329688_0 | c2c3179dc86b78db | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN3V5FrameShift0.lean | FullPathN3V5FrameShift0 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "fullDivN3FrameShift0V5_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [fullDivN3FrameShift0V5_unfold]\n cases bltu_1 <;> cases bltu_0 <;>\n simp only [Bool.false_eq_true, i... | [
{
"name": "fullDivN3FrameShift0V5_unfold",
"text": "theorem fullDivN3FrameShift0V5_unfold {bltu_1 bltu_0 : Bool}\n {sp base a0 a1 a2 a3 b0 b1 b2 retMem dMem dloMem scratchUn0 scratchMem raVal : Word} :\n fullDivN3FrameShift0V5 bltu_1 bltu_0 sp base a0 a1 a2 a3 b0 b1 b2\n retMem dMem dloMem scratc... | [
{
"name": "fullDivN3FrameShift0V5_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 429,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 6,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5FrameShift0
The shift=0 loop-state frame for the v5 n=3 shift=0 epilogue composition: the
cells/registers the shift=0 DIV epilogue does NOT touch, carried around it.
Shift=0 counterpart of `fullDivN3FrameNoX1V5` (FullPathN3V5NoNopDenormDefs), with
the two digit iter... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5FrameShift0
The shift=0 loop-state frame for the v5 n=3 shift=0 epilogue composition: the
cells/registers the shift=0 DIV epilogue does NOT touch, carried around it.
Shift=0 counterpart of `fullDivN3FrameNoX1V5` (FullPathN3V5NoNopDenormDefs), with
the two digit iter... | @@ -65,10 +65,40 @@
(sp + signExtend12 3936 ↦ₘ scratchMemF) **
(.x1 ↦ᵣ raVal)
+theorem fullDivN3FrameShift0V5_unfold {bltu_1 bltu_0 : Bool}
+ {sp base a0 a1 a2 a3 b0 b1 b2 retMem dMem dloMem scratchUn0 scratchMem raVal : Word} :
+ fullDivN3FrameShift0V5 bltu_1 bltu_0 sp base a0 a1 a2 a3 b0 b1 b2
+ re... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b01319516a36_0 | 2c2f57d076828a4f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Transient/LoadProgram.lean | LoadProgram | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_tload_loop_length",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [evm_tload_loop, Program.length_append,\n evm_tload_cmp_length, evm_tload_copy_length, evm_tload_tail_len... | [
{
"name": "evm_tload_copy_length",
"text": "theorem evm_tload_copy_length : evm_tload_copy.length = 9 := by\n simp [evm_tload_copy, LD, SD, JAL, single, seq, Program.length_append]\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 138,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
... | [
{
"name": "evm_tload_loop_length",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 6,
"n_chars": 217,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_ne... | 3 | /-
EvmAsm.Evm64.Transient.LoadProgram
RISC-V program implementing the reverse-scan core of the EVM `TLOAD` opcode
(0x5c, EIP-1153 transient storage).
TLOAD scans the transient-storage exec-log (`EvmAsm/Evm64/StorageAssertions.lean`)
from the END (most-recent entry first) for an entry matching the executing
... | /-
EvmAsm.Evm64.Transient.LoadProgram
RISC-V program implementing the reverse-scan core of the EVM `TLOAD` opcode
(0x5c, EIP-1153 transient storage).
TLOAD scans the transient-storage exec-log (`EvmAsm/Evm64/StorageAssertions.lean`)
from the END (most-recent entry first) for an entry matching the executing
... | @@ -163,11 +163,16 @@
(evm_tload_cmp envReg).length = 25 := by
simp [evm_tload_cmp, ADDI, LD, BNE, single, seq, Program.length_append]
+theorem evm_tload_copy_length : evm_tload_copy.length = 9 := by
+ simp [evm_tload_copy, LD, SD, JAL, single, seq, Program.length_append]
+
theorem evm_tload_tail_length : e... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b01319516a36_1 | f1afc358ca4b4af4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Transient/LoadProgram.lean | LoadProgram | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_tload_length",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [evm_tload, Program.length_append,\n evm_tload_head_length, evm_tload_loop_length]",
"n_chars": 99,
"n... | [
{
"name": "evm_tload_loop_length",
"text": "theorem evm_tload_loop_length (envReg : Reg) :\n (evm_tload_loop envReg).length = 40 := by\n simp [evm_tload_loop, Program.length_append,\n evm_tload_cmp_length, evm_tload_copy_length, evm_tload_tail_length]\n\n",
"fan_in": 1,
"n_lines": 6,
... | [
{
"name": "evm_tload_length",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 7,
"n_chars": 246,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting... | 5 | /-
EvmAsm.Evm64.Transient.LoadProgram
RISC-V program implementing the reverse-scan core of the EVM `TLOAD` opcode
(0x5c, EIP-1153 transient storage).
TLOAD scans the transient-storage exec-log (`EvmAsm/Evm64/StorageAssertions.lean`)
from the END (most-recent entry first) for an entry matching the executing
... | /-
EvmAsm.Evm64.Transient.LoadProgram
RISC-V program implementing the reverse-scan core of the EVM `TLOAD` opcode
(0x5c, EIP-1153 transient storage).
TLOAD scans the transient-storage exec-log (`EvmAsm/Evm64/StorageAssertions.lean`)
from the END (most-recent entry first) for an entry matching the executing
... | @@ -169,6 +169,11 @@
theorem evm_tload_tail_length : evm_tload_tail.length = 6 := by
simp [evm_tload_tail, ADDI, BNE, SD, single, seq, Program.length_append]
+theorem evm_tload_loop_length (envReg : Reg) :
+ (evm_tload_loop envReg).length = 40 := by
+ simp [evm_tload_loop, Program.length_append,
+ evm_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b01319516a36_2 | ce88df03539e21e1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Transient/LoadProgram.lean | LoadProgram | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_tload_length",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [evm_tload, Program.length_append,\n evm_tload_head_length, evm_tload_loop_length]",
"n_chars": 99,
"n... | [
{
"name": "evm_tload_loop_length",
"text": "theorem evm_tload_loop_length (envReg : Reg) :\n (evm_tload_loop envReg).length = 40 := by\n simp [evm_tload_loop, Program.length_append,\n evm_tload_cmp_length, evm_tload_copy_length, evm_tload_tail_length]\n\n",
"fan_in": 1,
"n_lines": 6,
... | [
{
"name": "evm_tload_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 5,
"n_chars": 118,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_n... | 6 | /-
EvmAsm.Evm64.Transient.LoadProgram
RISC-V program implementing the reverse-scan core of the EVM `TLOAD` opcode
(0x5c, EIP-1153 transient storage).
TLOAD scans the transient-storage exec-log (`EvmAsm/Evm64/StorageAssertions.lean`)
from the END (most-recent entry first) for an entry matching the executing
... | /-
EvmAsm.Evm64.Transient.LoadProgram
RISC-V program implementing the reverse-scan core of the EVM `TLOAD` opcode
(0x5c, EIP-1153 transient storage).
TLOAD scans the transient-storage exec-log (`EvmAsm/Evm64/StorageAssertions.lean`)
from the END (most-recent entry first) for an entry matching the executing
... | @@ -169,6 +169,11 @@
theorem evm_tload_tail_length : evm_tload_tail.length = 6 := by
simp [evm_tload_tail, ADDI, BNE, SD, single, seq, Program.length_append]
+theorem evm_tload_loop_length (envReg : Reg) :
+ (evm_tload_loop envReg).length = 40 := by
+ simp [evm_tload_loop, Program.length_append,
+ evm_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1010d91b6142_0 | a37c1df802d2447f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WalkInitWP.lean | WalkInitWP | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "walkInitZeroNonzeroBranch_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hmono : ∀ a i,\n CodeReq.singleton base (.BEQ .x11 .x0 (156 : BitVec 13)) a = some i →\n rlp_... | [
{
"name": "walkInitZeroNonzeroBranch_singleton_spec",
"text": "/-- Coarse zero/nonzero split for the first instruction of `rlp_walk_init`, as a\n standalone singleton-code branch. -/\ntheorem walkInitZeroNonzeroBranch_singleton_spec (base listLen : Word) :\n cpsBranchWithin 1 base (CodeReq.singleton b... | [
{
"name": "walkInitZeroNonzeroBranch_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 845,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,... | 1 | /-
EvmAsm.Rv64.RLP.WalkInitWP
WP-facing control summaries for `rlp_walk_init`. The detailed leaf spec has
nine outcomes; fixed-schema decoders often first need only the coarse split
on the head `BEQ`: empty input versus nonempty input.
-/
import EvmAsm.Rv64.WP
import EvmAsm.Rv64.RLP.WalkInit
namespace EvmAs... | /-
EvmAsm.Rv64.RLP.WalkInitWP
WP-facing control summaries for `rlp_walk_init`. The detailed leaf spec has
nine outcomes; fixed-schema decoders often first need only the coarse split
on the head `BEQ`: empty input versus nonempty input.
-/
import EvmAsm.Rv64.WP
import EvmAsm.Rv64.RLP.WalkInit
namespace EvmAs... | @@ -26,13 +26,33 @@
def walkInitNonzeroPost (listLen : Word) : Assertion :=
((.x11 ↦ᵣ listLen) ** (.x0 ↦ᵣ (0 : Word)) ** ⌜listLen ≠ (0 : Word)⌝)
+/-- Coarse zero/nonzero split for the first instruction of `rlp_walk_init`, as a
+ standalone singleton-code branch. -/
+theorem walkInitZeroNonzeroBranch_singleton_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_24df5a9a151b_0 | 07bba5161572d534 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3CallableSelectedShapeEvidenceCanonical.lean | N3CallableSelectedShapeEvidenceCanonical | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "N3CallableSelectedShapeEvidence.of_canonical",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n N3CallableSelectedShapeEvidence.of_parts\n (n3CallableSelectedShapeEvidence_selectedCarry_of_c... | [
{
"name": "n3CallableSelectedShapeEvidence_selectedCarry_of_canonical",
"text": "/-- Universal `selectedCarry` callback from a pointed proof at the canonical\n bltu pair. Any pair satisfying both trial-witness predicates equals the\n canonical pair, so the pointed proof suffices. -/\ntheorem n3Callabl... | [
{
"name": "N3CallableSelectedShapeEvidence.of_canonical",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 21,
"n_chars": 1099,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.N3CallableSelectedShapeEvidenceCanonical
Single-instance form for the universal callbacks inside
`N3CallableSelectedShapeEvidence`. `isTrialN3V4_j{1,0}` are by definition
`bltu_X = …`, so they uniquely determine the bltu pair from `(a, b)`.
This file names that canonical pair and ... | /-
EvmAsm.Evm64.DivMod.Spec.N3CallableSelectedShapeEvidenceCanonical
Single-instance form for the universal callbacks inside
`N3CallableSelectedShapeEvidence`. `isTrialN3V4_j{1,0}` are by definition
`bltu_X = …`, so they uniquely determine the bltu pair from `(a, b)`.
This file names that canonical pair and ... | @@ -80,6 +80,32 @@
(fullDivN3NormV (b.getLimbN 0) (b.getLimbN 1)
(b.getLimbN 2) (b.getLimbN 3)).2.2.1
+/-- Universal `selectedCarry` callback from a pointed proof at the canonical
+ bltu pair. Any pair satisfying both trial-witness predicates equals the
+ canonical pair, so the pointed proof suf... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1d372fc520c1_0 | 35aab82ac22b74a3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N4V5CallSkipUpperBound.lean | N4V5CallSkipUpperBound | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "divKTrialCallV5QHat_call_skip_mul_val256_b_le_val256_a",
"depth": 1,
"n_commands": 0,
"n_lines": 35,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro shift antiShift b3' u4 u3\n set b2' := (b2 <<< shift) ||| (b1 >>> antiShift)... | [
{
"name": "c3_le_u4_of_skip_borrow_call_v5",
"text": "/-- v5 analogue of `c3_le_u4_of_skip_borrow_call_v4`: the v5 skip-borrow check\n forces the outer mulsub carry `c3 ≤ u4`. -/\ntheorem c3_le_u4_of_skip_borrow_call_v5\n {a0 a1 a2 a3 b0 b1 b2 b3 : Word}\n (h : isSkipBorrowN4CallV5 a0 a1 a2 a3 b0 b... | [
{
"name": "divKTrialCallV5QHat_call_skip_mul_val256_b_le_val256_a",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 47,
"n_chars": 2404,
"n_subproofs": 12,
"n_tactics": 35,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 2,
"n_structural": 4,
... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N4V5CallSkipUpperBound
The native v5 call-skip UPPER bound: under the v5 skip-borrow runtime check
(`isSkipBorrowN4CallV5`, i.e. the v5 trial's outer mulsub does not borrow) and
shift normalization, the v5 trial quotient `divKTrialCallV5QHat` does not
overflow against the true div... | /-
EvmAsm.Evm64.DivMod.Spec.N4V5CallSkipUpperBound
The native v5 call-skip UPPER bound: under the v5 skip-borrow runtime check
(`isSkipBorrowN4CallV5`, i.e. the v5 trial's outer mulsub does not borrow) and
shift normalization, the v5 trial quotient `divKTrialCallV5QHat` does not
overflow against the true div... | @@ -28,6 +28,35 @@
open EvmAsm.Rv64
open EvmWord (val256 val256_bound ult_iff)
+/-- v5 analogue of `c3_le_u4_of_skip_borrow_call_v4`: the v5 skip-borrow check
+ forces the outer mulsub carry `c3 ≤ u4`. -/
+theorem c3_le_u4_of_skip_borrow_call_v5
+ {a0 a1 a2 a3 b0 b1 b2 b3 : Word}
+ (h : isSkipBorrowN4CallV... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6e5c51efc5d1_0 | 9d6fbc4b6f3a1b11 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCount.lean | SavedBitFixedIterCount | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "expTwoMulIterCountNew_toNat_of_eq_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [expTwoMulIterCountNew]\n rw [BitVec.toNat_add, signExtend12_neg1_toNat, hCount]\n have ... | [
{
"name": "signExtend12_neg1_toNat",
"text": "private theorem signExtend12_neg1_toNat :\n (signExtend12 (-1 : BitVec 12)).toNat = 2^64 - 1 := by\n decide\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 111,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
... | [
{
"name": "expTwoMulIterCountNew_toNat_of_eq_succ",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 355,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
"automation_only":... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
Loop-counter invariant for the fixed x19 two-MUL saved-bit EXP induction.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Expected remaining fixed-loop iterations at the start of semantic
... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
Loop-counter invariant for the fixed x19 two-MUL saved-bit EXP induction.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Expected remaining fixed-loop iterations at the start of semantic
... | @@ -19,10 +19,20 @@
def expTwoMulFixedIterCountInvariant (k : Nat) (iterCount : Word) : Prop :=
iterCount.toNat = expTwoMulFixedRemainingIterations k
+private theorem signExtend12_neg1_toNat :
+ (signExtend12 (-1 : BitVec 12)).toNat = 2^64 - 1 := by
+ decide
+
theorem expTwoMulIterCountNew_toNat_of_eq_succ
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6e5c51efc5d1_1 | b7001b9d555b6e2e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCount.lean | SavedBitFixedIterCount | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "expTwoMulIterCountNew_ne_zero_of_toNat_succ_pos",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h_zero\n have h_toNat : (expTwoMulIterCountNew iterCount).toNat = 0 := by\n simp ... | [
{
"name": "expTwoMulIterCountNew_toNat_of_eq_succ",
"text": "theorem expTwoMulIterCountNew_toNat_of_eq_succ\n {iterCount : Word} {n : Nat}\n (hCount : iterCount.toNat = n + 1) :\n (expTwoMulIterCountNew iterCount).toNat = n := by\n simp only [expTwoMulIterCountNew]\n rw [BitVec.toNat_add, signExt... | [
{
"name": "expTwoMulIterCountNew_ne_zero_of_toNat_succ_pos",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 367,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automati... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
Loop-counter invariant for the fixed x19 two-MUL saved-bit EXP induction.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Expected remaining fixed-loop iterations at the start of semantic
... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
Loop-counter invariant for the fixed x19 two-MUL saved-bit EXP induction.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Expected remaining fixed-loop iterations at the start of semantic
... | @@ -23,10 +23,26 @@
(signExtend12 (-1 : BitVec 12)).toNat = 2^64 - 1 := by
decide
+theorem expTwoMulIterCountNew_toNat_of_eq_succ
+ {iterCount : Word} {n : Nat}
+ (hCount : iterCount.toNat = n + 1) :
+ (expTwoMulIterCountNew iterCount).toNat = n := by
+ simp only [expTwoMulIterCountNew]
+ rw [BitVe... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6e5c51efc5d1_2 | cf4314f785165cca | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCount.lean | SavedBitFixedIterCount | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "expTwoMulIterCountNew_ne_zero_of_toNat_succ_pos",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h_zero\n have h_toNat : (expTwoMulIterCountNew iterCount).toNat = 0 := by\n simp ... | [
{
"name": "expTwoMulIterCountNew_toNat_of_eq_succ",
"text": "theorem expTwoMulIterCountNew_toNat_of_eq_succ\n {iterCount : Word} {n : Nat}\n (hCount : iterCount.toNat = n + 1) :\n (expTwoMulIterCountNew iterCount).toNat = n := by\n simp only [expTwoMulIterCountNew]\n rw [BitVec.toNat_add, signExt... | [
{
"name": "expTwoMulIterCountNew_eq_zero_of_toNat_one",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 281,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automation_onl... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
Loop-counter invariant for the fixed x19 two-MUL saved-bit EXP induction.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Expected remaining fixed-loop iterations at the start of semantic
... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
Loop-counter invariant for the fixed x19 two-MUL saved-bit EXP induction.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Expected remaining fixed-loop iterations at the start of semantic
... | @@ -23,9 +23,23 @@
(signExtend12 (-1 : BitVec 12)).toNat = 2^64 - 1 := by
decide
+theorem expTwoMulIterCountNew_toNat_of_eq_succ
+ {iterCount : Word} {n : Nat}
+ (hCount : iterCount.toNat = n + 1) :
+ (expTwoMulIterCountNew iterCount).toNat = n := by
+ simp only [expTwoMulIterCountNew]
+ rw [BitVec... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6e5c51efc5d1_3 | 71ba61bd75be071e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCount.lean | SavedBitFixedIterCount | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "expTwoMulIterCountNew_ne_zero_of_toNat_succ_pos",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h_zero\n have h_toNat : (expTwoMulIterCountNew iterCount).toNat = 0 := by\n simp ... | [
{
"name": "expTwoMulIterCountNew_toNat_of_eq_succ",
"text": "theorem expTwoMulIterCountNew_toNat_of_eq_succ\n {iterCount : Word} {n : Nat}\n (hCount : iterCount.toNat = n + 1) :\n (expTwoMulIterCountNew iterCount).toNat = n := by\n simp only [expTwoMulIterCountNew]\n rw [BitVec.toNat_add, signExt... | [
{
"name": "expTwoMulFixedIterCountInvariant_succ",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 14,
"n_chars": 512,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": ... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
Loop-counter invariant for the fixed x19 two-MUL saved-bit EXP induction.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Expected remaining fixed-loop iterations at the start of semantic
... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
Loop-counter invariant for the fixed x19 two-MUL saved-bit EXP induction.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Expected remaining fixed-loop iterations at the start of semantic
... | @@ -30,12 +30,29 @@
(signExtend12 (-1 : BitVec 12)).toNat = 2^64 - 1 := by
decide
+theorem expTwoMulIterCountNew_toNat_of_eq_succ
+ {iterCount : Word} {n : Nat}
+ (hCount : iterCount.toNat = n + 1) :
+ (expTwoMulIterCountNew iterCount).toNat = n := by
+ simp only [expTwoMulIterCountNew]
+ rw [BitVe... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6e5c51efc5d1_4 | 58d8e16c29918bc2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCount.lean | SavedBitFixedIterCount | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "expTwoMulFixedIterCountInvariant_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h_zero\n unfold expTwoMulFixedIterCountInvariant at hCount\n have h_toNat : iterCount.toNa... | [
{
"name": "expTwoMulFixedRemainingIterations_pos",
"text": "theorem expTwoMulFixedRemainingIterations_pos\n {k : Nat} (hk : k < 256) :\n 0 < expTwoMulFixedRemainingIterations k := by\n unfold expTwoMulFixedRemainingIterations\n omega\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 179,
"... | [
{
"name": "expTwoMulFixedIterCountInvariant_ne_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 408,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
"automation_only... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
Loop-counter invariant for the fixed x19 two-MUL saved-bit EXP induction.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Expected remaining fixed-loop iterations at the start of semantic
... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
Loop-counter invariant for the fixed x19 two-MUL saved-bit EXP induction.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Expected remaining fixed-loop iterations at the start of semantic
... | @@ -19,11 +19,24 @@
def expTwoMulFixedIterCountInvariant (k : Nat) (iterCount : Word) : Prop :=
iterCount.toNat = expTwoMulFixedRemainingIterations k
+theorem expTwoMulFixedRemainingIterations_pos
+ {k : Nat} (hk : k < 256) :
+ 0 < expTwoMulFixedRemainingIterations k := by
+ unfold expTwoMulFixedRemainingI... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6e5c51efc5d1_5 | 43482ecd061e0ac1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCount.lean | SavedBitFixedIterCount | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "expTwoMulIterCountNew_ne_zero_of_toNat_succ_pos",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h_zero\n have h_toNat : (expTwoMulIterCountNew iterCount).toNat = 0 := by\n simp ... | [
{
"name": "expTwoMulIterCountNew_toNat_of_eq_succ",
"text": "theorem expTwoMulIterCountNew_toNat_of_eq_succ\n {iterCount : Word} {n : Nat}\n (hCount : iterCount.toNat = n + 1) :\n (expTwoMulIterCountNew iterCount).toNat = n := by\n simp only [expTwoMulIterCountNew]\n rw [BitVec.toNat_add, signExt... | [
{
"name": "expTwoMulFixedIterCountInvariant_succ_ne_zero",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 15,
"n_chars": 585,
"n_subproofs": 2,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation... | 5 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
Loop-counter invariant for the fixed x19 two-MUL saved-bit EXP induction.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Expected remaining fixed-loop iterations at the start of semantic
... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
Loop-counter invariant for the fixed x19 two-MUL saved-bit EXP induction.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Expected remaining fixed-loop iterations at the start of semantic
... | @@ -36,10 +36,26 @@
(signExtend12 (-1 : BitVec 12)).toNat = 2^64 - 1 := by
decide
+theorem expTwoMulIterCountNew_toNat_of_eq_succ
+ {iterCount : Word} {n : Nat}
+ (hCount : iterCount.toNat = n + 1) :
+ (expTwoMulIterCountNew iterCount).toNat = n := by
+ simp only [expTwoMulIterCountNew]
+ rw [BitVe... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6e5c51efc5d1_6 | af08a3a5ab5d04ca | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCount.lean | SavedBitFixedIterCount | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "expTwoMulIterCountNew_ne_zero_of_toNat_succ_pos",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h_zero\n have h_toNat : (expTwoMulIterCountNew iterCount).toNat = 0 := by\n simp ... | [
{
"name": "expTwoMulIterCountNew_toNat_of_eq_succ",
"text": "theorem expTwoMulIterCountNew_toNat_of_eq_succ\n {iterCount : Word} {n : Nat}\n (hCount : iterCount.toNat = n + 1) :\n (expTwoMulIterCountNew iterCount).toNat = n := by\n simp only [expTwoMulIterCountNew]\n rw [BitVec.toNat_add, signExt... | [
{
"name": "expTwoMulFixedIterCountInvariant_succ_ne_zero_of_lt_255",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 8,
"n_chars": 299,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"a... | 6 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
Loop-counter invariant for the fixed x19 two-MUL saved-bit EXP induction.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Expected remaining fixed-loop iterations at the start of semantic
... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
Loop-counter invariant for the fixed x19 two-MUL saved-bit EXP induction.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Expected remaining fixed-loop iterations at the start of semantic
... | @@ -36,10 +36,26 @@
(signExtend12 (-1 : BitVec 12)).toNat = 2^64 - 1 := by
decide
+theorem expTwoMulIterCountNew_toNat_of_eq_succ
+ {iterCount : Word} {n : Nat}
+ (hCount : iterCount.toNat = n + 1) :
+ (expTwoMulIterCountNew iterCount).toNat = n := by
+ simp only [expTwoMulIterCountNew]
+ rw [BitVe... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6e5c51efc5d1_7 | a04e42d4e3ce2298 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCount.lean | SavedBitFixedIterCount | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 3 | [
{
"theorem_name": "expTwoMulIterCountNew_ne_zero_of_toNat_succ_pos",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h_zero\n have h_toNat : (expTwoMulIterCountNew iterCount).toNat = 0 := by\n simp ... | [
{
"name": "expTwoMulIterCountNew_toNat_of_eq_succ",
"text": "theorem expTwoMulIterCountNew_toNat_of_eq_succ\n {iterCount : Word} {n : Nat}\n (hCount : iterCount.toNat = n + 1) :\n (expTwoMulIterCountNew iterCount).toNat = n := by\n simp only [expTwoMulIterCountNew]\n rw [BitVec.toNat_add, signExt... | [
{
"name": "expTwoMulFixedIterCountInvariant_succ_eq_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 10,
"n_chars": 397,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
Loop-counter invariant for the fixed x19 two-MUL saved-bit EXP induction.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Expected remaining fixed-loop iterations at the start of semantic
... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
Loop-counter invariant for the fixed x19 two-MUL saved-bit EXP induction.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Expected remaining fixed-loop iterations at the start of semantic
... | @@ -23,9 +23,23 @@
(signExtend12 (-1 : BitVec 12)).toNat = 2^64 - 1 := by
decide
+theorem expTwoMulIterCountNew_toNat_of_eq_succ
+ {iterCount : Word} {n : Nat}
+ (hCount : iterCount.toNat = n + 1) :
+ (expTwoMulIterCountNew iterCount).toNat = n := by
+ simp only [expTwoMulIterCountNew]
+ rw [BitVec... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6e5c51efc5d1_8 | 5b34ecd238ed8366 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCount.lean | SavedBitFixedIterCount | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "expTwoMulFixedIterCountAssertion_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterCountAssertion_unfold]\n pcFree",
"n_chars": 59,
"n_subproofs": 0,
... | [
{
"name": "expTwoMulFixedIterCountAssertion_unfold",
"text": "theorem expTwoMulFixedIterCountAssertion_unfold\n {k : Nat} {iterCount : Word} :\n expTwoMulFixedIterCountAssertion k iterCount =\n ⌜expTwoMulFixedIterCountInvariant k iterCount⌝ := by\n delta expTwoMulFixedIterCountAssertion\n rfl\n... | [
{
"name": "expTwoMulFixedIterCountAssertion_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 204,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only":... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
Loop-counter invariant for the fixed x19 two-MUL saved-bit EXP induction.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Expected remaining fixed-loop iterations at the start of semantic
... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
Loop-counter invariant for the fixed x19 two-MUL saved-bit EXP induction.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariant
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Expected remaining fixed-loop iterations at the start of semantic
... | @@ -24,9 +24,18 @@
(k : Nat) (iterCount : Word) : Assertion :=
⌜expTwoMulFixedIterCountInvariant k iterCount⌝
+theorem expTwoMulFixedIterCountAssertion_unfold
+ {k : Nat} {iterCount : Word} :
+ expTwoMulFixedIterCountAssertion k iterCount =
+ ⌜expTwoMulFixedIterCountInvariant k iterCount⌝ := 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_2106df0b8c05_0 | e45b226f94450584 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/U256MinSAsm.lean | U256MinSAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 2 | [
{
"theorem_name": "beBytesToNat_append",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold beBytesToNat\n rw [List.foldl_append]\n exact beBytesToNat_foldl ys _",
"n_chars": 82,
"n_subproofs": ... | [
{
"name": "beBytesToNat_foldl",
"text": "private theorem beBytesToNat_foldl (bs : List (BitVec 8)) (acc : Nat) :\n bs.foldl (fun a b => a * 256 + b.toNat) acc\n = acc * 256 ^ bs.length + beBytesToNat bs := by\n induction bs generalizing acc with\n | nil => simp [beBytesToNat]\n | cons b rest ih =... | [
{
"name": "beBytesToNat_append",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 238,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nes... | 1 | /-
EvmAsm.Codegen.Programs.U256MinSAsm
`u256_min` (and `u256_max`) via the **dynamic selected-read / copy-tail
combinator** (`EvmAsm/Rv64/SAsm/SelectedRead.lean`, bead evm-asm-otbab) —
the acceptance consumers.
The routine byte-walks the two 32-byte big-endian operands, breaks to a
selector on the first d... | /-
EvmAsm.Codegen.Programs.U256MinSAsm
`u256_min` (and `u256_max`) via the **dynamic selected-read / copy-tail
combinator** (`EvmAsm/Rv64/SAsm/SelectedRead.lean`, bead evm-asm-otbab) —
the acceptance consumers.
The routine byte-walks the two 32-byte big-endian operands, breaks to a
selector on the first d... | @@ -52,9 +52,28 @@
-- The shared copy tail of the emitted program IS the combinator's
-- generator (kernel-checked byte tie).
+private theorem beBytesToNat_foldl (bs : List (BitVec 8)) (acc : Nat) :
+ bs.foldl (fun a b => a * 256 + b.toNat) acc
+ = acc * 256 ^ bs.length + beBytesToNat bs := by
+ induction ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2106df0b8c05_1 | 82d86f8f8a70b568 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/U256MinSAsm.lean | U256MinSAsm | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "beBytesToNat_lt_of_prefix_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 63,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hib : i < bs.length := by omega\n have hsplitA : as = as.take i ++ as.getD i 0 :: as.drop (i + 1) := by... | [
{
"name": "beBytesToNat_append",
"text": "private theorem beBytesToNat_append (xs ys : List (BitVec 8)) :\n beBytesToNat (xs ++ ys)\n = beBytesToNat xs * 256 ^ ys.length + beBytesToNat ys := by\n unfold beBytesToNat\n rw [List.foldl_append]\n exact beBytesToNat_foldl ys _\n\n",
"fan_in": 1,
... | [
{
"name": "beBytesToNat_lt_of_prefix_lt",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 72,
"n_chars": 3382,
"n_subproofs": 18,
"n_tactics": 66,
"cyclomatic": 1,
"n_automation": 15,
"n_rewrites": 20,
"n_structural": 4,
"automation_only": fals... | 3 | /-
EvmAsm.Codegen.Programs.U256MinSAsm
`u256_min` (and `u256_max`) via the **dynamic selected-read / copy-tail
combinator** (`EvmAsm/Rv64/SAsm/SelectedRead.lean`, bead evm-asm-otbab) —
the acceptance consumers.
The routine byte-walks the two 32-byte big-endian operands, breaks to a
selector on the first d... | /-
EvmAsm.Codegen.Programs.U256MinSAsm
`u256_min` (and `u256_max`) via the **dynamic selected-read / copy-tail
combinator** (`EvmAsm/Rv64/SAsm/SelectedRead.lean`, bead evm-asm-otbab) —
the acceptance consumers.
The routine byte-walks the two 32-byte big-endian operands, breaks to a
selector on the first d... | @@ -68,6 +68,13 @@
rw [Nat.add_mul, Nat.mul_comm (256 ^ rest.length) 256, ← Nat.mul_assoc]
omega
+private theorem beBytesToNat_append (xs ys : List (BitVec 8)) :
+ beBytesToNat (xs ++ ys)
+ = beBytesToNat xs * 256 ^ ys.length + beBytesToNat ys := by
+ unfold beBytesToNat
+ rw [List.foldl_appen... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2106df0b8c05_2 | 5fd5d77b2e32edb1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/U256MinSAsm.lean | U256MinSAsm | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "scanLoop_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 489,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction M generalizing i with\n | zero =>\n -- i = 32: header BEQ taken, all bytes equal → pick a.\n have hi32... | [
{
"name": "bytes_eq_of_prefix_all",
"text": "/-- All bytes equal (equal lengths) means equal lists. (Public: also\n consumed by `U256LtBeSAsm`.) -/\ntheorem bytes_eq_of_prefix_all (as bs : List (BitVec 8))\n (hlen : as.length = bs.length)\n (hpref : ∀ j, j < as.length → as.getD j 0 = bs.getD j 0) ... | [
{
"name": "scanLoop_spec",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 7,
"n_lines": 513,
"n_chars": 28795,
"n_subproofs": 61,
"n_tactics": 490,
"cyclomatic": 2,
"n_automation": 62,
"n_rewrites": 59,
"n_structural": 22,
"automation_only": false,
"max... | 7 | /-
EvmAsm.Codegen.Programs.U256MinSAsm
`u256_min` (and `u256_max`) via the **dynamic selected-read / copy-tail
combinator** (`EvmAsm/Rv64/SAsm/SelectedRead.lean`, bead evm-asm-otbab) —
the acceptance consumers.
The routine byte-walks the two 32-byte big-endian operands, breaks to a
selector on the first d... | /-
EvmAsm.Codegen.Programs.U256MinSAsm
`u256_min` (and `u256_max`) via the **dynamic selected-read / copy-tail
combinator** (`EvmAsm/Rv64/SAsm/SelectedRead.lean`, bead evm-asm-otbab) —
the acceptance consumers.
The routine byte-walks the two 32-byte big-endian operands, breaks to a
selector on the first d... | @@ -153,6 +153,22 @@
= (bs.getD i 0 :: bs.drop (i + 1)).length := hlenTail
exact Nat.add_lt_add_left hstep _
+/-- All bytes equal (equal lengths) means equal lists. (Public: also
+ consumed by `U256LtBeSAsm`.) -/
+theorem bytes_eq_of_prefix_all (as bs : List (BitVec 8))
+ (hlen : as.length = bs.lengt... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2106df0b8c05_3 | 06652998eb5f3d06 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/U256MinSAsm.lean | U256MinSAsm | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "scanLoop_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 489,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction M generalizing i with\n | zero =>\n -- i = 32: header BEQ taken, all bytes equal → pick a.\n have hi32... | [
{
"name": "pickA_spec",
"text": "/-- Shared pick-`a` exit segment (`mv x5, a0 ; j .copy`), entered with the\n selector KNOWN true. -/\nprivate theorem pickA_spec (w : Word) (hcond : minSel as bs) :\n cpsTripleWithin 2 ((GuestAddrs.u256_min + 44) : Word) ((GuestAddrs.u256_min + 56) : Word)\n (Code... | [
{
"name": "u256Min_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 144,
"n_chars": 8072,
"n_subproofs": 20,
"n_tactics": 116,
"cyclomatic": 1,
"n_automation": 32,
"n_rewrites": 19,
"n_structural": 5,
"automation_only": false,
"max_ne... | 8 | /-
EvmAsm.Codegen.Programs.U256MinSAsm
`u256_min` (and `u256_max`) via the **dynamic selected-read / copy-tail
combinator** (`EvmAsm/Rv64/SAsm/SelectedRead.lean`, bead evm-asm-otbab) —
the acceptance consumers.
The routine byte-walks the two 32-byte big-endian operands, breaks to a
selector on the first d... | /-
EvmAsm.Codegen.Programs.U256MinSAsm
`u256_min` (and `u256_max`) via the **dynamic selected-read / copy-tail
combinator** (`EvmAsm/Rv64/SAsm/SelectedRead.lean`, bead evm-asm-otbab) —
the acceptance consumers.
The routine byte-walks the two 32-byte big-endian operands, breaks to a
selector on the first d... | @@ -178,6 +178,54 @@
private instance : Decidable (minSel as bs) := Nat.decLe _ _
+/-- Shared pick-`a` exit segment (`mv x5, a0 ; j .copy`), entered with the
+ selector KNOWN true. -/
+private theorem pickA_spec (w : Word) (hcond : minSel as bs) :
+ cpsTripleWithin 2 ((GuestAddrs.u256_min + 44) : Word) ((Gue... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a5ab8b26805d_0 | 6a5ec017d3d19407 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254FieldMulModPSAsm.lean | Bn254FieldMulModPSAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "bnfMulModP_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 568,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- ---- the single-exit body triple, in `abiFrame_spec` shape ----\n have hbody : cpsTripleWithin\n (17 + ((bnfBeTo... | [
{
"name": "pcFree_exists3",
"text": "/-- `pcFree` for a triply-existential post. -/\nprivate theorem pcFree_exists3 {α β γ : Sort _} {F : α → β → γ → Assertion}\n (h : ∀ a b c, (F a b c).pcFree) :\n Assertion.pcFree (fun hp => ∃ a b c, F a b c hp) := by\n rintro hp ⟨a, b, c, hF⟩\n exact h a b c hp h... | [
{
"name": "bnfMulModP_spec",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 619,
"n_chars": 33621,
"n_subproofs": 61,
"n_tactics": 560,
"cyclomatic": 3,
"n_automation": 89,
"n_rewrites": 65,
"n_structural": 45,
"automation_only": false,
"m... | 5 | /-
EvmAsm.Codegen.Programs.Bn254FieldMulModPSAsm
`bnf_mul_mod_p` via the **multi-RW-subwindow callee adapter**
(`EvmAsm/Rv64/SAsm/RwSubwindow.lean`, bead evm-asm-4ch8f.38.5) — the
acceptance consumer for the converter+arithMod crypto caller layer.
The routine is an sp-frame (`ra`/`s0`/`s1`) around a SEQUENC... | /-
EvmAsm.Codegen.Programs.Bn254FieldMulModPSAsm
`bnf_mul_mod_p` via the **multi-RW-subwindow callee adapter**
(`EvmAsm/Rv64/SAsm/RwSubwindow.lean`, bead evm-asm-4ch8f.38.5) — the
acceptance consumer for the converter+arithMod crypto caller layer.
The routine is an sp-frame (`ra`/`s0`/`s1`) around a SEQUENC... | @@ -113,6 +113,13 @@
obtain ⟨a, b, c, h1, h2, hd, hu, hG, hF⟩ := hin
exact ⟨h1, h2, hd, hu, hG, ⟨a, b, c, hF⟩⟩
+/-- `pcFree` for a triply-existential post. -/
+private theorem pcFree_exists3 {α β γ : Sort _} {F : α → β → γ → Assertion}
+ (h : ∀ a b c, (F a b c).pcFree) :
+ Assertion.pcFree (fun hp => ∃ 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_c252c1f4eb34_0 | 8a312a3f4b8a8202 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitTwoMulCondCanonical.lean | SavedBitTwoMulCondCanonical | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "exp_cond_mul_call_then_loop_back_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n exp_cond_mul_call_then_loop_back_evm_exp_msb... | [
{
"name": "exp_cond_mul_call_then_loop_back_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_spec_within",
"text": "/-- Canonical-code view of the taken conditional-multiply block followed by\n the loop-back counter update. The loop branch returns to `base + 28`. -/\ntheorem exp_cond_mul_call_then_loop_b... | [
{
"name": "exp_cond_mul_call_then_loop_back_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 47,
"n_chars": 2709,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulCondCanonical
Canonical-code views of the saved-bit two-MUL conditional-multiply path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulCond
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Appended-MUL canonical-code view of the taken conditional-multiply block... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulCondCanonical
Canonical-code views of the saved-bit two-MUL conditional-multiply path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulCond
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Canonical-code view of the taken conditional-multiply block followed by
... | @@ -10,6 +10,63 @@
open EvmAsm.Rv64
+/-- Canonical-code view of the taken conditional-multiply block followed by
+ the loop-back counter update. The loop branch returns to `base + 28`. -/
+theorem exp_cond_mul_call_then_loop_back_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_spec_within
+ (iterCount sp ev... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c252c1f4eb34_1 | 0667d4169d749226 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitTwoMulCondCanonical.lean | SavedBitTwoMulCondCanonical | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "exp_cond_mul_call_then_loop_back_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_folded_owned_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n exp_cond_mul_call_then_loop_bac... | [
{
"name": "exp_cond_mul_call_then_loop_back_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_folded_owned_spec_within",
"text": "/-- Canonical-code view of the folded-word conditional-multiply path followed\n by loop-back to the saved-bit iteration entry. -/\ntheorem exp_cond_mul_call_then_loop_back_evm_... | [
{
"name": "exp_cond_mul_call_then_loop_back_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_folded_owned_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 27,
"n_chars": 1450,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automatio... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulCondCanonical
Canonical-code views of the saved-bit two-MUL conditional-multiply path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulCond
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Appended-MUL canonical-code view of the folded-word conditional-multiply... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulCondCanonical
Canonical-code views of the saved-bit two-MUL conditional-multiply path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulCond
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Canonical-code view of the folded-word conditional-multiply path followe... | @@ -10,6 +10,43 @@
open EvmAsm.Rv64
+/-- Canonical-code view of the folded-word conditional-multiply path followed
+ by loop-back to the saved-bit iteration entry. -/
+theorem exp_cond_mul_call_then_loop_back_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_folded_owned_spec_within
+ (iterCount sp evmSp vOld... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "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.