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_93741b7b293d_3 | 3aaaafe9f0e3fbf1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomCompose.lean | SavedBitFixedHeadroomCompose | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "exp_headroom_loop_lifted_folded_framed",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_frameR F hF\n (exp_headroom_loop_lifted_folded sp evmSp base baseWord exponentWord d... | [
{
"name": "exp_headroom_loop_lifted_folded",
"text": "/-- Folded-post wrapper for `exp_headroom_loop_lifted`. -/\ntheorem exp_headroom_loop_lifted_folded\n (sp evmSp base : Word) (baseWord exponentWord dWord eWord : EvmWord)\n (rest : List EvmWord) (lookahead vOld v18 : Word)\n (hbase : (base + 72 ... | [
{
"name": "exp_headroom_loop_lifted_folded_canonical_appended",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 14,
"n_chars": 753,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"autom... | 3 | /-
Composition scaffolding for the HEADROOM (architecture B) EXP program
(`evm_exp_msb_saved_bit_two_mul_fixed_headroom`, bug `evm-asm-fjivz`).
Architecture B runs the squaring loop entirely in the headroom slack: the
prologue COPIES the operands down into the headroom frame, the loop squares
there (its MUL ... | /-
Composition scaffolding for the HEADROOM (architecture B) EXP program
(`evm_exp_msb_saved_bit_two_mul_fixed_headroom`, bug `evm-asm-fjivz`).
Architecture B runs the squaring loop entirely in the headroom slack: the
prologue COPIES the operands down into the headroom frame, the loop squares
there (its MUL ... | @@ -161,6 +161,25 @@
rw [expIterBodyFullMsbSavedBitTwoMulFixedCanonicalAppendedMulCode_eq] at hq
exact exp_headroom_loop_code_mono base a i hq
+/-- Folded-post wrapper for `exp_headroom_loop_lifted`. -/
+theorem exp_headroom_loop_lifted_folded
+ (sp evmSp base : Word) (baseWord exponentWord dWord eWord : 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_93741b7b293d_4 | 4757f53d14851b7a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomCompose.lean | SavedBitFixedHeadroomCompose | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "exp_headroom_loop_lifted_folded_framed",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_frameR F hF\n (exp_headroom_loop_lifted_folded sp evmSp base baseWord exponentWord d... | [
{
"name": "exp_headroom_loop_lifted_folded",
"text": "/-- Folded-post wrapper for `exp_headroom_loop_lifted`. -/\ntheorem exp_headroom_loop_lifted_folded\n (sp evmSp base : Word) (baseWord exponentWord dWord eWord : EvmWord)\n (rest : List EvmWord) (lookahead vOld v18 : Word)\n (hbase : (base + 72 ... | [
{
"name": "exp_headroom_loop_lifted_folded_canonical_appended_framed",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 16,
"n_chars": 852,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 4 | /-
Composition scaffolding for the HEADROOM (architecture B) EXP program
(`evm_exp_msb_saved_bit_two_mul_fixed_headroom`, bug `evm-asm-fjivz`).
Architecture B runs the squaring loop entirely in the headroom slack: the
prologue COPIES the operands down into the headroom frame, the loop squares
there (its MUL ... | /-
Composition scaffolding for the HEADROOM (architecture B) EXP program
(`evm_exp_msb_saved_bit_two_mul_fixed_headroom`, bug `evm-asm-fjivz`).
Architecture B runs the squaring loop entirely in the headroom slack: the
prologue COPIES the operands down into the headroom frame, the loop squares
there (its MUL ... | @@ -161,6 +161,25 @@
rw [expIterBodyFullMsbSavedBitTwoMulFixedCanonicalAppendedMulCode_eq] at hq
exact exp_headroom_loop_code_mono base a i hq
+/-- Folded-post wrapper for `exp_headroom_loop_lifted`. -/
+theorem exp_headroom_loop_lifted_folded
+ (sp evmSp base : Word) (baseWord exponentWord dWord eWord : 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_93741b7b293d_5 | cdfff77384d28a7d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomCompose.lean | SavedBitFixedHeadroomCompose | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "exp_headroom_entry_prefix_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 109,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- operand_copy (base+0 → base+64)\n have h_oc := exp_headroom_operand_copy_lifted evmSp v6 b0 b1 ... | [
{
"name": "exp_headroom_operand_copy_lifted",
"text": "/-- Operand-copy block (instr idx 0, byte +0..64) lifted onto the headroom program. -/\ntheorem exp_headroom_operand_copy_lifted\n (evmSp v6 b0 b1 b2 b3 e0 e1 e2 e3 h0 h1 h2 h3 h4 h5 h6 h7 base : Word)\n (squaringMulOff condMulOff : BitVec 21) (sk... | [
{
"name": "exp_headroom_entry_prefix_spec_within",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 174,
"n_chars": 10519,
"n_subproofs": 11,
"n_tactics": 100,
"cyclomatic": 5,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 13,
"automation_... | 4 | /-
Composition scaffolding for the HEADROOM (architecture B) EXP program
(`evm_exp_msb_saved_bit_two_mul_fixed_headroom`, bug `evm-asm-fjivz`).
Architecture B runs the squaring loop entirely in the headroom slack: the
prologue COPIES the operands down into the headroom frame, the loop squares
there (its MUL ... | /-
Composition scaffolding for the HEADROOM (architecture B) EXP program
(`evm_exp_msb_saved_bit_two_mul_fixed_headroom`, bug `evm-asm-fjivz`).
Architecture B runs the squaring loop entirely in the headroom slack: the
prologue COPIES the operands down into the headroom frame, the loop squares
there (its MUL ... | @@ -101,6 +101,61 @@
(by rw [evm_exp_msb_saved_bit_two_mul_fixed_headroom_length]; decide)
a i ha
+/-- Operand-copy block (instr idx 0, byte +0..64) lifted onto the headroom program. -/
+theorem exp_headroom_operand_copy_lifted
+ (evmSp v6 b0 b1 b2 b3 e0 e1 e2 e3 h0 h1 h2 h3 h4 h5 h6 h7 base : Word)
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_93741b7b293d_6 | 30efc486ad871547 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomCompose.lean | SavedBitFixedHeadroomCompose | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "expHeadroomLoopEntryPost_to_firstIterPreWithResidual",
"depth": 1,
"n_commands": 0,
"n_lines": 55,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨psPost, psFrame, h_disjoint, h_union, hPost, hFrame⟩ := h\n have hPostOwn :=... | [
{
"name": "expHeadroomLoopEntryPost_to_ownX6",
"text": "/-- Weaken the concrete `x6` cell in the folded headroom entry post to scratch\n ownership, matching the loop body's first-iteration precondition shape. -/\ntheorem expHeadroomLoopEntryPost_to_ownX6\n {sp evmSp b0 b1 b2 b3 e0 e1 e2 e3 : Word} {ps... | [
{
"name": "expHeadroomLoopEntryPost_to_firstIterPreWithResidual",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 68,
"n_chars": 4401,
"n_subproofs": 3,
"n_tactics": 55,
"cyclomatic": 1,
"n_automation": 21,
"n_rewrites": 30,
"n_structural": 2,
... | 1 | /-
Composition scaffolding for the HEADROOM (architecture B) EXP program
(`evm_exp_msb_saved_bit_two_mul_fixed_headroom`, bug `evm-asm-fjivz`).
Architecture B runs the squaring loop entirely in the headroom slack: the
prologue COPIES the operands down into the headroom frame, the loop squares
there (its MUL ... | /-
Composition scaffolding for the HEADROOM (architecture B) EXP program
(`evm_exp_msb_saved_bit_two_mul_fixed_headroom`, bug `evm-asm-fjivz`).
Architecture B runs the squaring loop entirely in the headroom slack: the
prologue COPIES the operands down into the headroom frame, the loop squares
there (its MUL ... | @@ -158,6 +158,49 @@
(expHeadroomLoopEntryPostOwnX6 sp evmSp b0 b1 b2 b3 e0 e1 e2 e3) :=
⟨expHeadroomLoopEntryPostOwnX6_pcFree⟩
+/-- Weaken the concrete `x6` cell in the folded headroom entry post to scratch
+ ownership, matching the loop body's first-iteration precondition shape. -/
+theorem expHeadroom... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_93741b7b293d_7 | 48de45b2f9196d53 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomCompose.lean | SavedBitFixedHeadroomCompose | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "exp_headroom_entry_prefix_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 109,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- operand_copy (base+0 → base+64)\n have h_oc := exp_headroom_operand_copy_lifted evmSp v6 b0 b1 ... | [
{
"name": "exp_headroom_operand_copy_lifted",
"text": "/-- Operand-copy block (instr idx 0, byte +0..64) lifted onto the headroom program. -/\ntheorem exp_headroom_operand_copy_lifted\n (evmSp v6 b0 b1 b2 b3 e0 e1 e2 e3 h0 h1 h2 h3 h4 h5 h6 h7 base : Word)\n (squaringMulOff condMulOff : BitVec 21) (sk... | [
{
"name": "exp_headroom_entry_to_loopadvance_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 105,
"n_chars": 6475,
"n_subproofs": 3,
"n_tactics": 40,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 4,
"automat... | 6 | /-
Composition scaffolding for the HEADROOM (architecture B) EXP program
(`evm_exp_msb_saved_bit_two_mul_fixed_headroom`, bug `evm-asm-fjivz`).
Architecture B runs the squaring loop entirely in the headroom slack: the
prologue COPIES the operands down into the headroom frame, the loop squares
there (its MUL ... | /-
Composition scaffolding for the HEADROOM (architecture B) EXP program
(`evm_exp_msb_saved_bit_two_mul_fixed_headroom`, bug `evm-asm-fjivz`).
Architecture B runs the squaring loop entirely in the headroom slack: the
prologue COPIES the operands down into the headroom frame, the loop squares
there (its MUL ... | @@ -124,6 +124,61 @@
(by rw [evm_exp_msb_saved_bit_two_mul_fixed_headroom_length]; decide)
a i ha
+/-- Operand-copy block (instr idx 0, byte +0..64) lifted onto the headroom program. -/
+theorem exp_headroom_operand_copy_lifted
+ (evmSp v6 b0 b1 b2 b3 e0 e1 e2 e3 h0 h1 h2 h3 h4 h5 h6 h7 base : Word)
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_93741b7b293d_8 | 7cbec2de5cf1ad3e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomCompose.lean | SavedBitFixedHeadroomCompose | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "exp_headroom_entry_prefix_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 109,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- operand_copy (base+0 → base+64)\n have h_oc := exp_headroom_operand_copy_lifted evmSp v6 b0 b1 ... | [
{
"name": "exp_headroom_prologue_lifted",
"text": "/-- Prologue block (instr idx 18, byte +72..112) lifted onto the headroom program.\n Runs at the headroom coordinate `x12 = evmSp` (= `evmSp_live - 128` in use). -/\ntheorem exp_headroom_prologue_lifted\n (sp evmSp cOld tOld c6Old c16Old c19Old m0 m1 ... | [
{
"name": "exp_headroom_entry_to_loopadvance_canonical_appended_spec_within",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 71,
"n_chars": 4147,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural... | 7 | /-
Composition scaffolding for the HEADROOM (architecture B) EXP program
(`evm_exp_msb_saved_bit_two_mul_fixed_headroom`, bug `evm-asm-fjivz`).
Architecture B runs the squaring loop entirely in the headroom slack: the
prologue COPIES the operands down into the headroom frame, the loop squares
there (its MUL ... | /-
Composition scaffolding for the HEADROOM (architecture B) EXP program
(`evm_exp_msb_saved_bit_two_mul_fixed_headroom`, bug `evm-asm-fjivz`).
Architecture B runs the squaring loop entirely in the headroom slack: the
prologue COPIES the operands down into the headroom frame, the loop squares
there (its MUL ... | @@ -179,6 +179,50 @@
(by rw [evm_exp_msb_saved_bit_two_mul_fixed_headroom_length]; decide)
a i ha
+/-- Prologue block (instr idx 18, byte +72..112) lifted onto the headroom program.
+ Runs at the headroom coordinate `x12 = evmSp` (= `evmSp_live - 128` in use). -/
+theorem exp_headroom_prologue_lifted
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_93741b7b293d_9 | 886a5599c2368844 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomCompose.lean | SavedBitFixedHeadroomCompose | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "exp_headroom_entry_to_loopadvance_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 40,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_ep := exp_headroom_entry_prefix_spec_within sp evmSp cOld tOld c6Old c16Old\n c19O... | [
{
"name": "exp_headroom_entry_prefix_spec_within",
"text": "/-- Entry prefix `operand_copy ;; advance1(-64) ;; advance2(-64) ;; prologue`\n (base+0 → base+112): copies the live operands into the headroom frame, walks\n `x12` down to `evmSp-128`, then runs the prologue at that headroom coordinate.\n ... | [
{
"name": "exp_headroom_entry_to_loopadvance_canonical_appended_folded",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 35,
"n_chars": 2062,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
... | 8 | /-
Composition scaffolding for the HEADROOM (architecture B) EXP program
(`evm_exp_msb_saved_bit_two_mul_fixed_headroom`, bug `evm-asm-fjivz`).
Architecture B runs the squaring loop entirely in the headroom slack: the
prologue COPIES the operands down into the headroom frame, the loop squares
there (its MUL ... | /-
Composition scaffolding for the HEADROOM (architecture B) EXP program
(`evm_exp_msb_saved_bit_two_mul_fixed_headroom`, bug `evm-asm-fjivz`).
Architecture B runs the squaring loop entirely in the headroom slack: the
prologue COPIES the operands down into the headroom frame, the loop squares
there (its MUL ... | @@ -223,6 +223,179 @@
(by rw [evm_exp_msb_saved_bit_two_mul_fixed_headroom_length]; decide)
a i ha
+/-- Entry prefix `operand_copy ;; advance1(-64) ;; advance2(-64) ;; prologue`
+ (base+0 → base+112): copies the live operands into the headroom frame, walks
+ `x12` down to `evmSp-128`, then runs the pr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_93741b7b293d_10 | 43045d317a9809d4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomCompose.lean | SavedBitFixedHeadroomCompose | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "exp_headroom_entry_to_loopadvance_canonical_appended_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := exp_headroom_entry_to_loopadvance_spec_within\n sp evmSp cOl... | [
{
"name": "exp_headroom_entry_to_loopadvance_spec_within",
"text": "/-- `entry_prefix ;; loop_advance(+64)` (base+0 → base+116): the entry prefix walks\n `x12` down to `evmSp-128` and inits the accumulator; the loop-advance then bumps\n `x12` to `(evmSp-64-64)+64 = evmSp_iter`, exactly the IterPre coo... | [
{
"name": "exp_headroom_entry_to_loopadvance_canonical_appended_folded_framed",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 9,
"n_lines": 37,
"n_chars": 2186,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structura... | 9 | /-
Composition scaffolding for the HEADROOM (architecture B) EXP program
(`evm_exp_msb_saved_bit_two_mul_fixed_headroom`, bug `evm-asm-fjivz`).
Architecture B runs the squaring loop entirely in the headroom slack: the
prologue COPIES the operands down into the headroom frame, the loop squares
there (its MUL ... | /-
Composition scaffolding for the HEADROOM (architecture B) EXP program
(`evm_exp_msb_saved_bit_two_mul_fixed_headroom`, bug `evm-asm-fjivz`).
Architecture B runs the squaring loop entirely in the headroom slack: the
prologue COPIES the operands down into the headroom frame, the loop squares
there (its MUL ... | @@ -522,6 +522,110 @@
(expHeadroomLoopEntryBridgeFrame evmSp v18 vOld dWord eWord rest) :=
⟨expHeadroomLoopEntryBridgeFrame_pcFree⟩
+/-- `entry_prefix ;; loop_advance(+64)` (base+0 → base+116): the entry prefix walks
+ `x12` down to `evmSp-128` and inits the accumulator; the loop-advance then bumps
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_93741b7b293d_11 | 2ce15c06c833d9fa | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedHeadroomCompose.lean | SavedBitFixedHeadroomCompose | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "exp_headroom_entry_to_loopadvance_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 40,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_ep := exp_headroom_entry_prefix_spec_within sp evmSp cOld tOld c6Old c16Old\n c19O... | [
{
"name": "exp_headroom_entry_prefix_spec_within",
"text": "/-- Entry prefix `operand_copy ;; advance1(-64) ;; advance2(-64) ;; prologue`\n (base+0 → base+112): copies the live operands into the headroom frame, walks\n `x12` down to `evmSp-128`, then runs the prologue at that headroom coordinate.\n ... | [
{
"name": "exp_headroom_entry_to_loopadvance_canonical_appended_framed",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 70,
"n_chars": 4088,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 8 | /-
Composition scaffolding for the HEADROOM (architecture B) EXP program
(`evm_exp_msb_saved_bit_two_mul_fixed_headroom`, bug `evm-asm-fjivz`).
Architecture B runs the squaring loop entirely in the headroom slack: the
prologue COPIES the operands down into the headroom frame, the loop squares
there (its MUL ... | /-
Composition scaffolding for the HEADROOM (architecture B) EXP program
(`evm_exp_msb_saved_bit_two_mul_fixed_headroom`, bug `evm-asm-fjivz`).
Architecture B runs the squaring loop entirely in the headroom slack: the
prologue COPIES the operands down into the headroom frame, the loop squares
there (its MUL ... | @@ -223,6 +223,179 @@
(by rw [evm_exp_msb_saved_bit_two_mul_fixed_headroom_length]; decide)
a i ha
+/-- Entry prefix `operand_copy ;; advance1(-64) ;; advance2(-64) ;; prologue`
+ (base+0 → base+112): copies the live operands into the headroom frame, walks
+ `x12` down to `evmSp-128`, then runs the pr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_01f3f9884fac_0 | 64e9fab3bb0c997e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/CondMulCall.lean | CondMulCall | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "exp_cond_mul_call_block_code_marshal_pair_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro a i h\n exact CodeReq.union_sub\n (exp_cond_mul_call_block_code_marshal_factor1_sub... | [
{
"name": "exp_cond_mul_call_block_code_marshal_factor1_sub",
"text": "theorem exp_cond_mul_call_block_code_marshal_factor1_sub\n (base : Word) (mulOff : BitVec 21) :\n ∀ a i, (CodeReq.ofProg base exp_loop_marshal_factor1) a = some i →\n (exp_cond_mul_call_block_code base mulOff) a = some i := by... | [
{
"name": "exp_cond_mul_call_block_code_marshal_pair_sub",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 539,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation... | 2 | /-
EvmAsm.Evm64.Exp.CondMulCall
CodeReq decomposition for the conditional-multiply taken-branch call block.
This mirrors `Exp/SquaringCall.lean`, but the second marshal block sources
the fixed base `a` into MUL factor2 instead of copying the running result.
Refs: GH #92, beads `evm-asm-b4asy`.
-/
import Ev... | /-
EvmAsm.Evm64.Exp.CondMulCall
CodeReq decomposition for the conditional-multiply taken-branch call block.
This mirrors `Exp/SquaringCall.lean`, but the second marshal block sources
the fixed base `a` into MUL factor2 instead of copying the running result.
Refs: GH #92, beads `evm-asm-b4asy`.
-/
import Ev... | @@ -32,6 +32,14 @@
CodeReq.ofProg (base + 68) exp_loop_un_marshal_and_restore
]
+theorem exp_cond_mul_call_block_code_marshal_factor1_sub
+ (base : Word) (mulOff : BitVec 21) :
+ ∀ a i, (CodeReq.ofProg base exp_loop_marshal_factor1) a = some i →
+ (exp_cond_mul_call_block_code base mulOff) ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_01f3f9884fac_1 | 885bf65f4413d44f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/CondMulCall.lean | CondMulCall | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "exp_cond_mul_call_with_skip_block_code_eq_ofProg",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold exp_cond_mul_call_with_skip_block_code\n unfold exp_cond_mul_call_with_skip_block... | [
{
"name": "exp_cond_mul_call_block_code_eq_ofProg",
"text": "theorem exp_cond_mul_call_block_code_eq_ofProg (base : Word) (mulOff : BitVec 21) :\n exp_cond_mul_call_block_code base mulOff =\n CodeReq.ofProg base (exp_cond_mul_call_block mulOff) := by\n unfold exp_cond_mul_call_block_code exp_cond_m... | [
{
"name": "exp_cond_mul_call_with_skip_block_code_eq_ofProg",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 837,
"n_subproofs": 0,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 9,
"n_structural": 0,
"automa... | 1 | /-
EvmAsm.Evm64.Exp.CondMulCall
CodeReq decomposition for the conditional-multiply taken-branch call block.
This mirrors `Exp/SquaringCall.lean`, but the second marshal block sources
the fixed base `a` into MUL factor2 instead of copying the running result.
Refs: GH #92, beads `evm-asm-b4asy`.
-/
import Ev... | /-
EvmAsm.Evm64.Exp.CondMulCall
CodeReq decomposition for the conditional-multiply taken-branch call block.
This mirrors `Exp/SquaringCall.lean`, but the second marshal block sources
the fixed base `a` into MUL factor2 instead of copying the running result.
Refs: GH #92, beads `evm-asm-b4asy`.
-/
import Ev... | @@ -32,6 +32,30 @@
CodeReq.ofProg (base + 68) exp_loop_un_marshal_and_restore
]
+theorem exp_cond_mul_call_block_code_eq_ofProg (base : Word) (mulOff : BitVec 21) :
+ exp_cond_mul_call_block_code base mulOff =
+ CodeReq.ofProg base (exp_cond_mul_call_block mulOff) := by
+ unfold exp_cond_mul_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_01f3f9884fac_2 | 6cd396aa5bd86bf2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/CondMulCall.lean | CondMulCall | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "exp_cond_mul_call_with_skip_block_code_eq_ofProg",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold exp_cond_mul_call_with_skip_block_code\n unfold exp_cond_mul_call_with_skip_block... | [
{
"name": "exp_cond_mul_call_block_code_eq_ofProg",
"text": "theorem exp_cond_mul_call_block_code_eq_ofProg (base : Word) (mulOff : BitVec 21) :\n exp_cond_mul_call_block_code base mulOff =\n CodeReq.ofProg base (exp_cond_mul_call_block mulOff) := by\n unfold exp_cond_mul_call_block_code exp_cond_m... | [
{
"name": "exp_cond_mul_call_with_skip_block_code_call_sub",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 24,
"n_chars": 913,
"n_subproofs": 0,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 1,
"automat... | 2 | /-
EvmAsm.Evm64.Exp.CondMulCall
CodeReq decomposition for the conditional-multiply taken-branch call block.
This mirrors `Exp/SquaringCall.lean`, but the second marshal block sources
the fixed base `a` into MUL factor2 instead of copying the running result.
Refs: GH #92, beads `evm-asm-b4asy`.
-/
import Ev... | /-
EvmAsm.Evm64.Exp.CondMulCall
CodeReq decomposition for the conditional-multiply taken-branch call block.
This mirrors `Exp/SquaringCall.lean`, but the second marshal block sources
the fixed base `a` into MUL factor2 instead of copying the running result.
Refs: GH #92, beads `evm-asm-b4asy`.
-/
import Ev... | @@ -32,6 +32,30 @@
CodeReq.ofProg (base + 68) exp_loop_un_marshal_and_restore
]
+theorem exp_cond_mul_call_block_code_eq_ofProg (base : Word) (mulOff : BitVec 21) :
+ exp_cond_mul_call_block_code base mulOff =
+ CodeReq.ofProg base (exp_cond_mul_call_block mulOff) := by
+ unfold exp_cond_mul_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_01f3f9884fac_3 | e62099448adea70e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/CondMulCall.lean | CondMulCall | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "exp_cond_mul_call_with_skip_block_code_eq_ofProg",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold exp_cond_mul_call_with_skip_block_code\n unfold exp_cond_mul_call_with_skip_block... | [
{
"name": "exp_cond_mul_call_block_code_eq_ofProg",
"text": "theorem exp_cond_mul_call_block_code_eq_ofProg (base : Word) (mulOff : BitVec 21) :\n exp_cond_mul_call_block_code base mulOff =\n CodeReq.ofProg base (exp_cond_mul_call_block mulOff) := by\n unfold exp_cond_mul_call_block_code exp_cond_m... | [
{
"name": "exp_cond_mul_call_with_saved_bit_skip_block_code_eq_ofProg",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 895,
"n_subproofs": 0,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 9,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.Exp.CondMulCall
CodeReq decomposition for the conditional-multiply taken-branch call block.
This mirrors `Exp/SquaringCall.lean`, but the second marshal block sources
the fixed base `a` into MUL factor2 instead of copying the running result.
Refs: GH #92, beads `evm-asm-b4asy`.
-/
import Ev... | /-
EvmAsm.Evm64.Exp.CondMulCall
CodeReq decomposition for the conditional-multiply taken-branch call block.
This mirrors `Exp/SquaringCall.lean`, but the second marshal block sources
the fixed base `a` into MUL factor2 instead of copying the running result.
Refs: GH #92, beads `evm-asm-b4asy`.
-/
import Ev... | @@ -32,6 +32,30 @@
CodeReq.ofProg (base + 68) exp_loop_un_marshal_and_restore
]
+theorem exp_cond_mul_call_block_code_eq_ofProg (base : Word) (mulOff : BitVec 21) :
+ exp_cond_mul_call_block_code base mulOff =
+ CodeReq.ofProg base (exp_cond_mul_call_block mulOff) := by
+ unfold exp_cond_mul_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_01f3f9884fac_4 | 6c957593a7fa2493 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/CondMulCall.lean | CondMulCall | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "exp_cond_mul_call_with_skip_block_code_eq_ofProg",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold exp_cond_mul_call_with_skip_block_code\n unfold exp_cond_mul_call_with_skip_block... | [
{
"name": "exp_cond_mul_call_block_code_eq_ofProg",
"text": "theorem exp_cond_mul_call_block_code_eq_ofProg (base : Word) (mulOff : BitVec 21) :\n exp_cond_mul_call_block_code base mulOff =\n CodeReq.ofProg base (exp_cond_mul_call_block mulOff) := by\n unfold exp_cond_mul_call_block_code exp_cond_m... | [
{
"name": "exp_cond_mul_call_with_saved_bit_skip_block_code_call_sub",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 25,
"n_chars": 991,
"n_subproofs": 0,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 1,
... | 2 | /-
EvmAsm.Evm64.Exp.CondMulCall
CodeReq decomposition for the conditional-multiply taken-branch call block.
This mirrors `Exp/SquaringCall.lean`, but the second marshal block sources
the fixed base `a` into MUL factor2 instead of copying the running result.
Refs: GH #92, beads `evm-asm-b4asy`.
-/
import Ev... | /-
EvmAsm.Evm64.Exp.CondMulCall
CodeReq decomposition for the conditional-multiply taken-branch call block.
This mirrors `Exp/SquaringCall.lean`, but the second marshal block sources
the fixed base `a` into MUL factor2 instead of copying the running result.
Refs: GH #92, beads `evm-asm-b4asy`.
-/
import Ev... | @@ -32,6 +32,30 @@
CodeReq.ofProg (base + 68) exp_loop_un_marshal_and_restore
]
+theorem exp_cond_mul_call_block_code_eq_ofProg (base : Word) (mulOff : BitVec 21) :
+ exp_cond_mul_call_block_code base mulOff =
+ CodeReq.ofProg base (exp_cond_mul_call_block mulOff) := by
+ unfold exp_cond_mul_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_27e22a3a2eef_0 | 5b9dac654e81ee25 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Compose/CarryLdChain.lean | CarryLdChain | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "ld_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 153,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- abbreviations for the overflow bit (evm_add's x5), the sum limbs, and the mask\n set carry : Word := if m.toNat + rMod... | [
{
"name": "ld_pass2_fromLimbs_sub",
"text": "/-- Pure fold: pass2's four borrow-chain output limbs (`r0..r3`, with\n `mm_i = n_i &&& maskIn`) reassemble into the word difference\n `fromLimbs ![s0,s1,s2,s3] − (fromLimbs ![n0,n1,n2,n3] &&& fromLimbs (fun _ => maskIn))`.\n Direct application of `sub_b... | [
{
"name": "ld_spec_within",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 184,
"n_chars": 10867,
"n_subproofs": 18,
"n_tactics": 142,
"cyclomatic": 2,
"n_automation": 27,
"n_rewrites": 30,
"n_structural": 8,
"automation_only": false,
"max... | 5 | /-
EvmAsm.Evm64.AddMod.Compose.CarryLdChain
Phase-3 M3d for total ADDMOD (issue #9704): the final Ld chain assembly.
Chains the four Ld links (mod_add_stage ;; evm_add ;; pass1take_clean ;;
pass2_owned, byte 460 → 832) over the common region `C`, folds the branch-free
conditional subtract's per-limb output ... | /-
EvmAsm.Evm64.AddMod.Compose.CarryLdChain
Phase-3 M3d for total ADDMOD (issue #9704): the final Ld chain assembly.
Chains the four Ld links (mod_add_stage ;; evm_add ;; pass1take_clean ;;
pass2_owned, byte 460 → 832) over the common region `C`, folds the branch-free
conditional subtract's per-limb output ... | @@ -25,6 +25,63 @@
open EvmAsm.Rv64.Tactics
open EvmAsm.Evm64
+/-- Pure fold: pass2's four borrow-chain output limbs (`r0..r3`, with
+ `mm_i = n_i &&& maskIn`) reassemble into the word difference
+ `fromLimbs ![s0,s1,s2,s3] − (fromLimbs ![n0,n1,n2,n3] &&& fromLimbs (fun _ => maskIn))`.
+ Direct application... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_27e22a3a2eef_1 | 364dd695cd44376f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Compose/CarryLdChain.lean | CarryLdChain | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "ld_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 153,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- abbreviations for the overflow bit (evm_add's x5), the sum limbs, and the mask\n set carry : Word := if m.toNat + rMod... | [
{
"name": "mask_fromLimbs_const_eq",
"text": "/-- `N &&& fromLimbs (const maskIn) = N &&& condSubMask take` when `maskIn` is the\n 64-bit select word `if take then -1 else 0` (i.e. `fromLimbs (const maskIn)`\n is the 256-bit `condSubMask take`). -/\ntheorem mask_fromLimbs_const_eq (take : Bool) :\n ... | [
{
"name": "evm_addmod_carry_branch_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 131,
"n_chars": 8000,
"n_subproofs": 8,
"n_tactics": 71,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 8,
"n_structural": 11,
"automation... | 6 | /-
EvmAsm.Evm64.AddMod.Compose.CarryLdChain
Phase-3 M3d for total ADDMOD (issue #9704): the final Ld chain assembly.
Chains the four Ld links (mod_add_stage ;; evm_add ;; pass1take_clean ;;
pass2_owned, byte 460 → 832) over the common region `C`, folds the branch-free
conditional subtract's per-limb output ... | /-
EvmAsm.Evm64.AddMod.Compose.CarryLdChain
Phase-3 M3d for total ADDMOD (issue #9704): the final Ld chain assembly.
Chains the four Ld links (mod_add_stage ;; evm_add ;; pass1take_clean ;;
pass2_owned, byte 460 → 832) over the common region `C`, folds the branch-free
conditional subtract's per-limb output ... | @@ -82,6 +82,16 @@
= EvmWord.fromLimbs (a - b).getLimb := by rw [hfun]
_ = a - b := EvmWord.fromLimbs_getLimb (a - b)
+/-- `N &&& fromLimbs (const maskIn) = N &&& condSubMask take` when `maskIn` is the
+ 64-bit select word `if take then -1 else 0` (i.e. `fromLimbs (const maskIn)`
+ is the 256-bit `c... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_871b4721aa04_0 | ecb94e61f04190f3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/JumpTable.lean | JumpTable | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "dispatchTableIs.aux_getMem",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction count generalizing start k with\n | zero => omega\n | succ n ih =>\n have hstart : start < 256 :... | [
{
"name": "dispatchTableIs.aux_succ",
"text": "/-- Helper: unfold one step of the auxiliary builder when `start < 256`. -/\ntheorem dispatchTableIs.aux_succ (base : Word)\n (handlers : Fin 256 → Word) {start : Nat} (h : start < 256) (n : Nat) :\n dispatchTableIs.aux base handlers start (n + 1)\n ... | [
{
"name": "dispatchTableIs.aux_getMem",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 37,
"n_chars": 1607,
"n_subproofs": 9,
"n_tactics": 24,
"cyclomatic": 3,
"n_automation": 8,
"n_rewrites": 3,
"n_structural": 4,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.JumpTable
Slice 1 of GH #106 (opcode dispatch via jump table).
Defines the `dispatchTableIs` separation-logic assertion describing a
256-entry handler-address table laid out at consecutive doubleword
cells in RV64 memory:
base + 0 ↦ₘ handlers[0]
base + 8 ↦ₘ handlers[1]
... | /-
EvmAsm.Evm64.JumpTable
Slice 1 of GH #106 (opcode dispatch via jump table).
Defines the `dispatchTableIs` separation-logic assertion describing a
256-entry handler-address table laid out at consecutive doubleword
cells in RV64 memory:
base + 0 ↦ₘ handlers[0]
base + 8 ↦ₘ handlers[1]
... | @@ -69,6 +69,14 @@
(handlers : Fin 256 → Word) (start : Nat) :
dispatchTableIs.aux base handlers start 0 = empAssertion := rfl
+/-- Helper: unfold one step of the auxiliary builder when `start < 256`. -/
+theorem dispatchTableIs.aux_succ (base : Word)
+ (handlers : Fin 256 → Word) {start : Nat} (h : star... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_871b4721aa04_1 | 0f438a86e8019a96 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/JumpTable.lean | JumpTable | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "dispatchTableIs_getMem",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hk : opcode.val < 256 := opcode.isLt\n have h := dispatchTableIs.aux_getMem\n (base := base) (handlers := h... | [
{
"name": "dispatchTableIs.aux_getMem",
"text": "/-- The auxiliary layout assertion forces the dword at\n `base + 8·(start + k)` to read back the corresponding handler entry,\n for any `k < count` with `start + count ≤ 256`. -/\ntheorem dispatchTableIs.aux_getMem\n {base : Word} {handlers : Fin 256... | [
{
"name": "dispatchTableIs_getMem",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 33,
"n_chars": 1506,
"n_subproofs": 3,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"ma... | 2 | /-
EvmAsm.Evm64.JumpTable
Slice 1 of GH #106 (opcode dispatch via jump table).
Defines the `dispatchTableIs` separation-logic assertion describing a
256-entry handler-address table laid out at consecutive doubleword
cells in RV64 memory:
base + 0 ↦ₘ handlers[0]
base + 8 ↦ₘ handlers[1]
... | /-
EvmAsm.Evm64.JumpTable
Slice 1 of GH #106 (opcode dispatch via jump table).
Defines the `dispatchTableIs` separation-logic assertion describing a
256-entry handler-address table laid out at consecutive doubleword
cells in RV64 memory:
base + 0 ↦ₘ handlers[0]
base + 8 ↦ₘ handlers[1]
... | @@ -77,6 +77,42 @@
** dispatchTableIs.aux base handlers (start + 1) n) := by
simp only [dispatchTableIs.aux, dif_pos h]
+/-- The auxiliary layout assertion forces the dword at
+ `base + 8·(start + k)` to read back the corresponding handler entry,
+ for any `k < count` with `start + count ≤ 256`. -/
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_871b4721aa04_2 | b1236effcd49bb14 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/JumpTable.lean | JumpTable | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "jumpTableOfOpcodes_decode_none_getMem",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatchTableIs_getMem hP opcodeByte]\n exact jumpTableOfOpcodes_decode_none invalidHandler hand... | [
{
"name": "dispatchTableIs_getMem",
"text": "/-- **Projection lemma.** If the 256-entry jump-table layout holds at\n `base`, then for every opcode byte `opcode : Fin 256` the dword cell\n at `base + 8·opcode` reads back the corresponding handler address\n `handlers opcode`. -/\ntheorem dispatchTabl... | [
{
"name": "jumpTableOfOpcodes_decode_none_getMem",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 16,
"n_chars": 798,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": ... | 3 | /-
EvmAsm.Evm64.JumpTable
Slice 1 of GH #106 (opcode dispatch via jump table).
Defines the `dispatchTableIs` separation-logic assertion describing a
256-entry handler-address table laid out at consecutive doubleword
cells in RV64 memory:
base + 0 ↦ₘ handlers[0]
base + 8 ↦ₘ handlers[1]
... | /-
EvmAsm.Evm64.JumpTable
Slice 1 of GH #106 (opcode dispatch via jump table).
Defines the `dispatchTableIs` separation-logic assertion describing a
256-entry handler-address table laid out at consecutive doubleword
cells in RV64 memory:
base + 0 ↦ₘ handlers[0]
base + 8 ↦ₘ handlers[1]
... | @@ -113,6 +113,37 @@
rw [hfin, show (8 * (start + (k' + 1))) = (8 * ((start + 1) + k')) by omega]
exact hrec
+/-- **Projection lemma.** If the 256-entry jump-table layout holds at
+ `base`, then for every opcode byte `opcode : Fin 256` the dword cell
+ at `base + 8·opcode` reads back the correspon... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_871b4721aa04_3 | dfb062b869de14ed | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/JumpTable.lean | JumpTable | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "jumpTableOfOpcodes_decode_none_getMem",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatchTableIs_getMem hP opcodeByte]\n exact jumpTableOfOpcodes_decode_none invalidHandler hand... | [
{
"name": "dispatchTableIs_getMem",
"text": "/-- **Projection lemma.** If the 256-entry jump-table layout holds at\n `base`, then for every opcode byte `opcode : Fin 256` the dword cell\n at `base + 8·opcode` reads back the corresponding handler address\n `handlers opcode`. -/\ntheorem dispatchTabl... | [
{
"name": "jumpTableOfOpcodes_decode_some_getMem",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 29,
"n_chars": 1351,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only":... | 3 | /-
EvmAsm.Evm64.JumpTable
Slice 1 of GH #106 (opcode dispatch via jump table).
Defines the `dispatchTableIs` separation-logic assertion describing a
256-entry handler-address table laid out at consecutive doubleword
cells in RV64 memory:
base + 0 ↦ₘ handlers[0]
base + 8 ↦ₘ handlers[1]
... | /-
EvmAsm.Evm64.JumpTable
Slice 1 of GH #106 (opcode dispatch via jump table).
Defines the `dispatchTableIs` separation-logic assertion describing a
256-entry handler-address table laid out at consecutive doubleword
cells in RV64 memory:
base + 0 ↦ₘ handlers[0]
base + 8 ↦ₘ handlers[1]
... | @@ -113,6 +113,37 @@
rw [hfin, show (8 * (start + (k' + 1))) = (8 * ((start + 1) + k')) by omega]
exact hrec
+/-- **Projection lemma.** If the 256-entry jump-table layout holds at
+ `base`, then for every opcode byte `opcode : Fin 256` the dword cell
+ at `base + 8·opcode` reads back the correspon... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_871b4721aa04_4 | 8391dfe16ec8f292 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/JumpTable.lean | JumpTable | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "dispatchTableIs_split",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hk : opcode.val < 256 := opcode.isLt\n have h : (0 : Nat) + opcode.val + 1 + (255 - opcode.val) ≤ 256 := by om... | [
{
"name": "aux_split",
"text": "/-- Split a generic `aux` chain at one interior position.\n\nIf `start + a + 1 + b ≤ 256`, then the `(a + 1 + b)`-cell auxiliary\nchain decomposes into:\n\n* the prefix of the first `a` cells (`aux base handlers start a`),\n* the singled-out entry at index `start + a`,\n* the... | [
{
"name": "dispatchTableIs_split",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 25,
"n_chars": 1117,
"n_subproofs": 5,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 6,
"n_structural": 1,
"automation_only": false,
"ma... | 1 | /-
EvmAsm.Evm64.JumpTable
Slice 1 of GH #106 (opcode dispatch via jump table).
Defines the `dispatchTableIs` separation-logic assertion describing a
256-entry handler-address table laid out at consecutive doubleword
cells in RV64 memory:
base + 0 ↦ₘ handlers[0]
base + 8 ↦ₘ handlers[1]
... | /-
EvmAsm.Evm64.JumpTable
Slice 1 of GH #106 (opcode dispatch via jump table).
Defines the `dispatchTableIs` separation-logic assertion describing a
256-entry handler-address table laid out at consecutive doubleword
cells in RV64 memory:
base + 0 ↦ₘ handlers[0]
base + 8 ↦ₘ handlers[1]
... | @@ -158,6 +158,46 @@
namespace dispatchTableIs
+/-- Split a generic `aux` chain at one interior position.
+
+If `start + a + 1 + b ≤ 256`, then the `(a + 1 + b)`-cell auxiliary
+chain decomposes into:
+
+* the prefix of the first `a` cells (`aux base handlers start a`),
+* the singled-out entry at index `start + 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_191e66fc3e8a_0 | 31849438232f821c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/CopyLoopSpec.lean | CopyLoopSpec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "evm_calldatacopy_body_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 245,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n set copied := callDataCopyBytes data dataOff size with hcopied_def\n have hcopied_len : copied.length ... | [
{
"name": "copyDestContent_set",
"text": "/-- Writing `copied[i]` at the destination-relative index `destOff + i`\n advances the window from the `i`-prefix to the `(i+1)`-prefix. -/\ntheorem copyDestContent_set (memBytes copied : List (BitVec 8))\n (destOff i : Nat) (v : BitVec 8)\n (h_i : i < copi... | [
{
"name": "evm_calldatacopy_body_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 285,
"n_chars": 18876,
"n_subproofs": 64,
"n_tactics": 262,
"cyclomatic": 1,
"n_automation": 62,
"n_rewrites": 65,
"n_structural": 10,
"automation_on... | 2 | /-
EvmAsm.Evm64.Calldata.CopyLoopSpec
The verified CALLDATACOPY copy loop (bead `evm-asm-54bh8` follow-up):
the ≤`size`-byte copy-with-zero-fill loop of `evm_calldatacopy`
(`Calldata/CopyProgram.lean`, indices [9..18]) that writes
`callDataCopyBytes data dataOffset size` into the EVM-memory destination
win... | /-
EvmAsm.Evm64.Calldata.CopyLoopSpec
The verified CALLDATACOPY copy loop (bead `evm-asm-54bh8` follow-up):
the ≤`size`-byte copy-with-zero-fill loop of `evm_calldatacopy`
(`Calldata/CopyProgram.lean`, indices [9..18]) that writes
`callDataCopyBytes data dataOffset size` into the EVM-memory destination
win... | @@ -64,6 +64,23 @@
List.length_take, List.length_drop]
omega
+/-- Writing `copied[i]` at the destination-relative index `destOff + i`
+ advances the window from the `i`-prefix to the `(i+1)`-prefix. -/
+theorem copyDestContent_set (memBytes copied : List (BitVec 8))
+ (destOff i : Nat) (v : BitVec 8)
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_191e66fc3e8a_1 | 72bae2626d621099 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/CopyLoopSpec.lean | CopyLoopSpec | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "evm_calldatacopy_loop_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 96,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n set copied := callDataCopyBytes data dataOff size with hcopied_def\n have hmono9 : ∀ a i, CodeReq.singl... | [
{
"name": "cc_word_succ_dec",
"text": "/-- `(n+1) - 1 = n` as words (loop counter decrement). -/\nprivate theorem cc_word_succ_dec (n : Nat) :\n BitVec.ofNat 64 (n + 1) + signExtend12 (-1 : BitVec 12) = BitVec.ofNat 64 n := by\n apply BitVec.eq_of_toNat_eq\n have hs : (signExtend12 (-1 : BitVec 12) : W... | [
{
"name": "evm_calldatacopy_loop_spec_within",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 134,
"n_chars": 8175,
"n_subproofs": 27,
"n_tactics": 106,
"cyclomatic": 2,
"n_automation": 23,
"n_rewrites": 17,
"n_structural": 7,
"automation_only... | 5 | /-
EvmAsm.Evm64.Calldata.CopyLoopSpec
The verified CALLDATACOPY copy loop (bead `evm-asm-54bh8` follow-up):
the ≤`size`-byte copy-with-zero-fill loop of `evm_calldatacopy`
(`Calldata/CopyProgram.lean`, indices [9..18]) that writes
`callDataCopyBytes data dataOffset size` into the EVM-memory destination
win... | /-
EvmAsm.Evm64.Calldata.CopyLoopSpec
The verified CALLDATACOPY copy loop (bead `evm-asm-54bh8` follow-up):
the ≤`size`-byte copy-with-zero-fill loop of `evm_calldatacopy`
(`Calldata/CopyProgram.lean`, indices [9..18]) that writes
`callDataCopyBytes data dataOffset size` into the EVM-memory destination
win... | @@ -365,6 +365,14 @@
exact cpsTripleWithin_weaken (fun _ hp => by xperm_chunked hp)
(fun _ hp => by xperm_chunked hp) hbody
+/-- `(n+1) - 1 = n` as words (loop counter decrement). -/
+private theorem cc_word_succ_dec (n : Nat) :
+ BitVec.ofNat 64 (n + 1) + signExtend12 (-1 : BitVec 12) = BitVec.ofNat 64 n ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_191e66fc3e8a_2 | ce7fe29031a00364 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/CopyLoopSpec.lean | CopyLoopSpec | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "evm_calldatacopy_stack_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 74,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n set dataOff := (dataOffset.getLimbN 0).toNat with hdataOff\n set destByteOff := (destOffset.getLimbN 0... | [
{
"name": "evm_calldatacopy_loop_spec_within",
"text": "/-- The CALLDATACOPY copy-loop closure (`base+36 → base+76`, indices [9..18])\n by induction on the byte countdown `n = size - i`. -/\ntheorem evm_calldatacopy_loop_spec_within\n (base memBase srcBase : Word)\n (cdByteOff dataOff len destByteO... | [
{
"name": "evm_calldatacopy_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 8,
"n_lines": 128,
"n_chars": 7691,
"n_subproofs": 13,
"n_tactics": 78,
"cyclomatic": 1,
"n_automation": 13,
"n_rewrites": 10,
"n_structural": 4,
"automation_only... | 8 | /-
EvmAsm.Evm64.Calldata.CopyLoopSpec
The verified CALLDATACOPY copy loop (bead `evm-asm-54bh8` follow-up):
the ≤`size`-byte copy-with-zero-fill loop of `evm_calldatacopy`
(`Calldata/CopyProgram.lean`, indices [9..18]) that writes
`callDataCopyBytes data dataOffset size` into the EVM-memory destination
win... | /-
EvmAsm.Evm64.Calldata.CopyLoopSpec
The verified CALLDATACOPY copy loop (bead `evm-asm-54bh8` follow-up):
the ≤`size`-byte copy-with-zero-fill loop of `evm_calldatacopy`
(`Calldata/CopyProgram.lean`, indices [9..18]) that writes
`callDataCopyBytes data dataOffset size` into the EVM-memory destination
win... | @@ -388,6 +388,139 @@
rw [BitVec.toNat_ofNat]; omega
intro hc; rw [hc] at ht; simp at ht
+/-- The CALLDATACOPY copy-loop closure (`base+36 → base+76`, indices [9..18])
+ by induction on the byte countdown `n = size - i`. -/
+theorem evm_calldatacopy_loop_spec_within
+ (base memBase srcBase : Word)
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cbfca80dfa4b_0 | d5d1aba01d1c2b22 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN1/UnifiedCallV5.lean | UnifiedCallV5 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "divK_loop_n1_call_unified_v5_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 50,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold loopN1UnifiedPreV5 loopN1PreWithScratch loopN1Pre\n let r3 := iterN1Call_v5 v0 v1 v... | [
{
"name": "iterN1Call_v5_unfoldU",
"text": "/-- Unfold `iterN1Call_v5` to its `iterWithDoubleAddback (div128Quot_v5 …)` body.\n Public: the loop-post → denorm-epilogue bridge uses this to fold the j=0\n iteration (which the loop post expresses via `iterWithDoubleAddback`) back to\n `iterN1Call_v5` ... | [
{
"name": "divK_loop_n1_call_unified_v5_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 90,
"n_chars": 5167,
"n_subproofs": 6,
"n_tactics": 50,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 7,
"n_structural": 1,
"automat... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN1.UnifiedCallV5
v5 n=1 full-loop (j=3,2,1,0) ALL-CALL composition: chain the j=3 call body onto
the all-call three-iteration composition (#7277). Capstone of the v5 n=1 loop
composition. Same pattern as `Iter210CallV5`, one digit deeper; the nested
per-digit iteration states... | /-
EvmAsm.Evm64.DivMod.LoopIterN1.UnifiedCallV5
v5 n=1 full-loop (j=3,2,1,0) ALL-CALL composition: chain the j=3 call body onto
the all-call three-iteration composition (#7277). Capstone of the v5 n=1 loop
composition. Same pattern as `Iter210CallV5`, one digit deeper; the nested
per-digit iteration states... | @@ -15,6 +15,16 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (jpred_3 slt_jpos_3)
+/-- Unfold `iterN1Call_v5` to its `iterWithDoubleAddback (div128Quot_v5 …)` body.
+ Public: the loop-post → denorm-epilogue bridge uses this to fold the j=0
+ iteration (which the loop post expresses via `iterWithDoubl... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aa57ef0b993d_0 | 5a285d7eb92ab5fb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2V5NoNopPreloopMod.lean | FullPathN2V5NoNopPreloopMod | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "evm_mod_phaseAB_n2_clz_spec_within_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hA := evm_mod_phaseA_ntaken_spec_within_v5_noNop sp base b0 b1 b2 b3 v5 v10 hbnz\n have ... | [
{
"name": "evm_mod_phaseB_n2_spec_within_v5_noNop",
"text": "/-- v5 phase-B (n=2 detection: b3=b2=0, b1≠0), over `modCode_noNop_v5`.\n Mirror of `evm_mod_phaseB_n2_spec_within_v4_noNop` with v5 code subsumption. -/\ntheorem evm_mod_phaseB_n2_spec_within_v5_noNop (sp base : Word)\n (b1 b2 b3 : Word) (v... | [
{
"name": "evm_mod_phaseAB_n2_clz_spec_within_v5_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 57,
"n_chars": 3511,
"n_subproofs": 8,
"n_tactics": 33,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V5NoNopPreloopMod
Preloop setup wrappers for the n=2 v5/no-NOP full DIV path. Mirror of
FullPathN2V4NoNopPreloop, lifted to `modCode_noNop_v5` (the preloop runs the
shared clz/normalize/copyAU instructions, not the differing div128 subroutine).
Reuses the generic v5 ... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V5NoNopPreloopMod
Preloop setup wrappers for the n=2 v5/no-NOP full DIV path. Mirror of
FullPathN2V4NoNopPreloop, lifted to `modCode_noNop_v5` (the preloop runs the
shared clz/normalize/copyAU instructions, not the differing div128 subroutine).
Reuses the generic v5 ... | @@ -26,6 +26,169 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
+/-- v5 phase-B (n=2 detection: b3=b2=0, b1≠0), over `modCode_noNop_v5`.
+ Mirror of `evm_mod_phaseB_n2_spec_within_v4_noNop` with v5 code subsumption. -/
+theorem evm_mod_phaseB_n2_spec_within_v5_noNop (sp base : 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_aa57ef0b993d_1 | 31e948ff56accb1a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2V5NoNopPreloopMod.lean | FullPathN2V5NoNopPreloopMod | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "evm_mod_phaseAB_n2_clz_spec_within_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hA := evm_mod_phaseA_ntaken_spec_within_v5_noNop sp base b0 b1 b2 b3 v5 v10 hbnz\n have ... | [
{
"name": "evm_mod_phaseB_n2_spec_within_v5_noNop",
"text": "/-- v5 phase-B (n=2 detection: b3=b2=0, b1≠0), over `modCode_noNop_v5`.\n Mirror of `evm_mod_phaseB_n2_spec_within_v4_noNop` with v5 code subsumption. -/\ntheorem evm_mod_phaseB_n2_spec_within_v5_noNop (sp base : Word)\n (b1 b2 b3 : Word) (v... | [
{
"name": "evm_mod_n2_to_normB_spec_within_v5_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 60,
"n_chars": 3476,
"n_subproofs": 8,
"n_tactics": 42,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automation_on... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V5NoNopPreloopMod
Preloop setup wrappers for the n=2 v5/no-NOP full DIV path. Mirror of
FullPathN2V4NoNopPreloop, lifted to `modCode_noNop_v5` (the preloop runs the
shared clz/normalize/copyAU instructions, not the differing div128 subroutine).
Reuses the generic v5 ... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V5NoNopPreloopMod
Preloop setup wrappers for the n=2 v5/no-NOP full DIV path. Mirror of
FullPathN2V4NoNopPreloop, lifted to `modCode_noNop_v5` (the preloop runs the
shared clz/normalize/copyAU instructions, not the differing div128 subroutine).
Reuses the generic v5 ... | @@ -26,6 +26,169 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
+/-- v5 phase-B (n=2 detection: b3=b2=0, b1≠0), over `modCode_noNop_v5`.
+ Mirror of `evm_mod_phaseB_n2_spec_within_v4_noNop` with v5 code subsumption. -/
+theorem evm_mod_phaseB_n2_spec_within_v5_noNop (sp base : 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_aa57ef0b993d_2 | d6f5eb33daf6c7a8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2V5NoNopPreloopMod.lean | FullPathN2V5NoNopPreloopMod | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "evm_mod_phaseAB_n2_clz_spec_within_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hA := evm_mod_phaseA_ntaken_spec_within_v5_noNop sp base b0 b1 b2 b3 v5 v10 hbnz\n have ... | [
{
"name": "evm_mod_phaseB_n2_spec_within_v5_noNop",
"text": "/-- v5 phase-B (n=2 detection: b3=b2=0, b1≠0), over `modCode_noNop_v5`.\n Mirror of `evm_mod_phaseB_n2_spec_within_v4_noNop` with v5 code subsumption. -/\ntheorem evm_mod_phaseB_n2_spec_within_v5_noNop (sp base : Word)\n (b1 b2 b3 : Word) (v... | [
{
"name": "evm_mod_n2_to_loopSetup_spec_within_v5_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 91,
"n_chars": 5564,
"n_subproofs": 8,
"n_tactics": 68,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 1,
"automatio... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V5NoNopPreloopMod
Preloop setup wrappers for the n=2 v5/no-NOP full DIV path. Mirror of
FullPathN2V4NoNopPreloop, lifted to `modCode_noNop_v5` (the preloop runs the
shared clz/normalize/copyAU instructions, not the differing div128 subroutine).
Reuses the generic v5 ... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V5NoNopPreloopMod
Preloop setup wrappers for the n=2 v5/no-NOP full DIV path. Mirror of
FullPathN2V4NoNopPreloop, lifted to `modCode_noNop_v5` (the preloop runs the
shared clz/normalize/copyAU instructions, not the differing div128 subroutine).
Reuses the generic v5 ... | @@ -26,6 +26,169 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
+/-- v5 phase-B (n=2 detection: b3=b2=0, b1≠0), over `modCode_noNop_v5`.
+ Mirror of `evm_mod_phaseB_n2_spec_within_v4_noNop` with v5 code subsumption. -/
+theorem evm_mod_phaseB_n2_spec_within_v5_noNop (sp base : 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_aa57ef0b993d_3 | a4c048038beb0f3b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2V5NoNopPreloopMod.lean | FullPathN2V5NoNopPreloopMod | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "evm_mod_phaseAB_n2_clz_spec_within_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hA := evm_mod_phaseA_ntaken_spec_within_v5_noNop sp base b0 b1 b2 b3 v5 v10 hbnz\n have ... | [
{
"name": "evm_mod_phaseB_n2_spec_within_v5_noNop",
"text": "/-- v5 phase-B (n=2 detection: b3=b2=0, b1≠0), over `modCode_noNop_v5`.\n Mirror of `evm_mod_phaseB_n2_spec_within_v4_noNop` with v5 code subsumption. -/\ntheorem evm_mod_phaseB_n2_spec_within_v5_noNop (sp base : Word)\n (b1 b2 b3 : Word) (v... | [
{
"name": "evm_mod_n2_to_loopSetup_spec_within_v5_noNop_exact_x1_scratch_frame",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 62,
"n_chars": 3426,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structu... | 4 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V5NoNopPreloopMod
Preloop setup wrappers for the n=2 v5/no-NOP full DIV path. Mirror of
FullPathN2V4NoNopPreloop, lifted to `modCode_noNop_v5` (the preloop runs the
shared clz/normalize/copyAU instructions, not the differing div128 subroutine).
Reuses the generic v5 ... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V5NoNopPreloopMod
Preloop setup wrappers for the n=2 v5/no-NOP full DIV path. Mirror of
FullPathN2V4NoNopPreloop, lifted to `modCode_noNop_v5` (the preloop runs the
shared clz/normalize/copyAU instructions, not the differing div128 subroutine).
Reuses the generic v5 ... | @@ -26,6 +26,169 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
+/-- v5 phase-B (n=2 detection: b3=b2=0, b1≠0), over `modCode_noNop_v5`.
+ Mirror of `evm_mod_phaseB_n2_spec_within_v4_noNop` with v5 code subsumption. -/
+theorem evm_mod_phaseB_n2_spec_within_v5_noNop (sp base : 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_714c93965615_0 | 43ae8571d9d7603f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/UnifiedListLoopBody.lean | UnifiedListLoopBody | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "unified_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 [unified_body_post_unfold] at hpost\n open EvmAsm.Rv64.Tactics in extract_pure hpost\n ... | [
{
"name": "unified_body_post_unfold",
"text": "theorem unified_body_post_unfold (regionBase : Word) (bs : List (BitVec 8)) (pfx : Byte)\n (v10New v11New v12New nextPtr v14New cnt' : Word) (P : Prop) :\n unified_body_post regionBase bs pfx v10New v11New v12New nextPtr v14New cnt' P =\n ((.x5 ↦ᵣ pfx.... | [
{
"name": "unified_body_post_pure",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 620,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max... | 1 | /-
EvmAsm.Rv64.RLP.UnifiedListLoopBody
EL.3 — one iteration (BODY) of the UNIFIED RV64 RLP list-decode loop: decodes
ANY item (all 5 classes) via the region all-class decoder, then advances. The
long-capable analog of `fll_body_spec_within` (`FlatListLoopBody.lean`).
loop_top (lbase): LBU x5, x13, 0 ... | /-
EvmAsm.Rv64.RLP.UnifiedListLoopBody
EL.3 — one iteration (BODY) of the UNIFIED RV64 RLP list-decode loop: decodes
ANY item (all 5 classes) via the region all-class decoder, then advances. The
long-capable analog of `fll_body_spec_within` (`FlatListLoopBody.lean`).
loop_top (lbase): LBU x5, x13, 0 ... | @@ -46,9 +46,21 @@
(.x11 ↦ᵣ v11New) ** (.x12 ↦ᵣ v12New) ** (.x13 ↦ᵣ nextPtr) ** (.x14 ↦ᵣ v14New) **
(.x15 ↦ᵣ cnt') ** bytesRegion regionBase bs ** ⌜P⌝
+theorem unified_body_post_unfold (regionBase : Word) (bs : List (BitVec 8)) (pfx : Byte)
+ (v10New v11New v12New nextPtr v14New cnt' : Word) (P : Prop) :... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_714c93965615_1 | f556e3f45485c4f2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/UnifiedListLoopBody.lean | UnifiedListLoopBody | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "unified_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 [unified_body_post_unfold] at hpost\n open EvmAsm.Rv64.Tactics in extract_pure hpost\n ... | [
{
"name": "unified_body_post_unfold",
"text": "theorem unified_body_post_unfold (regionBase : Word) (bs : List (BitVec 8)) (pfx : Byte)\n (v10New v11New v12New nextPtr v14New cnt' : Word) (P : Prop) :\n unified_body_post regionBase bs pfx v10New v11New v12New nextPtr v14New cnt' P =\n ((.x5 ↦ᵣ pfx.... | [
{
"name": "unified_body_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 186,
"n_chars": 12067,
"n_subproofs": 18,
"n_tactics": 132,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 5,
"n_structural": 3,
"automation_only": false,
... | 1 | /-
EvmAsm.Rv64.RLP.UnifiedListLoopBody
EL.3 — one iteration (BODY) of the UNIFIED RV64 RLP list-decode loop: decodes
ANY item (all 5 classes) via the region all-class decoder, then advances. The
long-capable analog of `fll_body_spec_within` (`FlatListLoopBody.lean`).
loop_top (lbase): LBU x5, x13, 0 ... | /-
EvmAsm.Rv64.RLP.UnifiedListLoopBody
EL.3 — one iteration (BODY) of the UNIFIED RV64 RLP list-decode loop: decodes
ANY item (all 5 classes) via the region all-class decoder, then advances. The
long-capable analog of `fll_body_spec_within` (`FlatListLoopBody.lean`).
loop_top (lbase): LBU x5, x13, 0 ... | @@ -46,6 +46,14 @@
(.x11 ↦ᵣ v11New) ** (.x12 ↦ᵣ v12New) ** (.x13 ↦ᵣ nextPtr) ** (.x14 ↦ᵣ v14New) **
(.x15 ↦ᵣ cnt') ** bytesRegion regionBase bs ** ⌜P⌝
+theorem unified_body_post_unfold (regionBase : Word) (bs : List (BitVec 8)) (pfx : Byte)
+ (v10New v11New v12New nextPtr v14New cnt' : Word) (P : Prop) :... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_db0b48389430_0 | 65c1bc32114d7bd4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldConvSAsm.lean | Secp256k1FieldConvSAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "beBytesToNat_append",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold beBytesToNat\n rw [List.foldl_append, foldl_be' b]",
"n_chars": 63,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "foldl_be'",
"text": "/-- Generalized-accumulator unfolding of the `beBytesToNat` foldl (local\n copy of the private `PowLadder.foldl_be`). -/\nprivate theorem foldl_be' (bs : List (BitVec 8)) (acc : Nat) :\n List.foldl (fun a (b : BitVec 8) => a * 256 + b.toNat) acc bs\n = acc * 256 ^ ... | [
{
"name": "beBytesToNat_append",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 309,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_nes... | 1 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldConvSAsm
Verified SAsm port of the secp256k1 BE→LE field-element converter
(bead evm-asm-4ch8f.38.2 wave-2, unblocked by the merged `doWhileS`
combinator, `.69`/#9822):
- `secfBeToLe` (`secfBeToLe_prog`, Secp256k1Field.lean:168): convert the
32-byte BIG-ENDIAN bu... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldConvSAsm
Verified SAsm port of the secp256k1 BE→LE field-element converter
(bead evm-asm-4ch8f.38.2 wave-2, unblocked by the merged `doWhileS`
combinator, `.69`/#9822):
- `secfBeToLe` (`secfBeToLe_prog`, Secp256k1Field.lean:168): convert the
32-byte BIG-ENDIAN bu... | @@ -151,10 +151,28 @@
A = empAssertion
body := secfBeToLeBody src dst inBytes
+/-- Generalized-accumulator unfolding of the `beBytesToNat` foldl (local
+ copy of the private `PowLadder.foldl_be`). -/
+private theorem foldl_be' (bs : List (BitVec 8)) (acc : Nat) :
+ List.foldl (fun a (b : BitVec 8) => 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_db0b48389430_1 | 69529ca51298ab7c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldConvSAsm.lean | Secp256k1FieldConvSAsm | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "beBytesToNat_append",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold beBytesToNat\n rw [List.foldl_append, foldl_be' b]",
"n_chars": 63,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "foldl_be'",
"text": "/-- Generalized-accumulator unfolding of the `beBytesToNat` foldl (local\n copy of the private `PowLadder.foldl_be`). -/\nprivate theorem foldl_be' (bs : List (BitVec 8)) (acc : Nat) :\n List.foldl (fun a (b : BitVec 8) => a * 256 + b.toNat) acc bs\n = acc * 256 ^ ... | [
{
"name": "beBytesToNat_take_succ",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 437,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max... | 2 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldConvSAsm
Verified SAsm port of the secp256k1 BE→LE field-element converter
(bead evm-asm-4ch8f.38.2 wave-2, unblocked by the merged `doWhileS`
combinator, `.69`/#9822):
- `secfBeToLe` (`secfBeToLe_prog`, Secp256k1Field.lean:168): convert the
32-byte BIG-ENDIAN bu... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldConvSAsm
Verified SAsm port of the secp256k1 BE→LE field-element converter
(bead evm-asm-4ch8f.38.2 wave-2, unblocked by the merged `doWhileS`
combinator, `.69`/#9822):
- `secfBeToLe` (`secfBeToLe_prog`, Secp256k1Field.lean:168): convert the
32-byte BIG-ENDIAN bu... | @@ -151,10 +151,28 @@
A = empAssertion
body := secfBeToLeBody src dst inBytes
+/-- Generalized-accumulator unfolding of the `beBytesToNat` foldl (local
+ copy of the private `PowLadder.foldl_be`). -/
+private theorem foldl_be' (bs : List (BitVec 8)) (acc : Nat) :
+ List.foldl (fun a (b : BitVec 8) => 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_db0b48389430_2 | d3224ed50fe13a67 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldConvSAsm.lean | Secp256k1FieldConvSAsm | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "shiftOr_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hb : b.toNat < 256 := b.isLt\n have hze : (b.zeroExtend 64).toNat = b.toNat := by have := b.isLt; simp; omega\n apply Bi... | [
{
"name": "mul_pow_lor",
"text": "/-- A shifted value or-ed with a small byte is their sum (disjoint bits). -/\nprivate theorem mul_pow_lor (v : Nat) (b : Nat) (hb : b < 2 ^ 8) :\n v * 2 ^ 8 ||| b = v * 2 ^ 8 + b := by\n have key : v * 2 ^ 8 ||| b = 2 ^ 8 * v + b := by\n apply Nat.eq_of_testBit_eq\n ... | [
{
"name": "shiftOr_eq",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 756,
"n_subproofs": 3,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": ... | 1 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldConvSAsm
Verified SAsm port of the secp256k1 BE→LE field-element converter
(bead evm-asm-4ch8f.38.2 wave-2, unblocked by the merged `doWhileS`
combinator, `.69`/#9822):
- `secfBeToLe` (`secfBeToLe_prog`, Secp256k1Field.lean:168): convert the
32-byte BIG-ENDIAN bu... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldConvSAsm
Verified SAsm port of the secp256k1 BE→LE field-element converter
(bead evm-asm-4ch8f.38.2 wave-2, unblocked by the merged `doWhileS`
combinator, `.69`/#9822):
- `secfBeToLe` (`secfBeToLe_prog`, Secp256k1Field.lean:168): convert the
32-byte BIG-ENDIAN bu... | @@ -151,11 +151,34 @@
A = empAssertion
body := secfBeToLeBody src dst inBytes
+/-- A shifted value or-ed with a small byte is their sum (disjoint bits). -/
+private theorem mul_pow_lor (v : Nat) (b : Nat) (hb : b < 2 ^ 8) :
+ v * 2 ^ 8 ||| b = v * 2 ^ 8 + b := by
+ have key : v * 2 ^ 8 ||| b = 2 ^ 8 * 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_db0b48389430_3 | c8e7cd67d032475a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldConvSAsm.lean | Secp256k1FieldConvSAsm | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 2 | [
{
"theorem_name": "beBytesToNat_take_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [List.take_add_one, List.getElem?_eq_getElem hn, Option.toList_some,\n beBytesToNat_append]\n simp [beBytesTo... | [
{
"name": "beBytesToNat_append",
"text": "/-- Big-endian value of a concatenation: the high part is shifted by the low\n part's byte width. -/\nprivate theorem beBytesToNat_append (a b : List (BitVec 8)) :\n beBytesToNat (a ++ b) = beBytesToNat a * 256 ^ b.length + beBytesToNat b := by\n unfold beByt... | [
{
"name": "leLimbs_chunks_eq_beBytesToNat",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 53,
"n_chars": 2851,
"n_subproofs": 13,
"n_tactics": 39,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 16,
"n_structural": 0,
"automation_only": fal... | 3 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldConvSAsm
Verified SAsm port of the secp256k1 BE→LE field-element converter
(bead evm-asm-4ch8f.38.2 wave-2, unblocked by the merged `doWhileS`
combinator, `.69`/#9822):
- `secfBeToLe` (`secfBeToLe_prog`, Secp256k1Field.lean:168): convert the
32-byte BIG-ENDIAN bu... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldConvSAsm
Verified SAsm port of the secp256k1 BE→LE field-element converter
(bead evm-asm-4ch8f.38.2 wave-2, unblocked by the merged `doWhileS`
combinator, `.69`/#9822):
- `secfBeToLe` (`secfBeToLe_prog`, Secp256k1Field.lean:168): convert the
32-byte BIG-ENDIAN bu... | @@ -167,6 +167,13 @@
simp only [Nat.zero_mul, Nat.zero_add, Nat.add_mul]
omega
+/-- Big-endian value of a concatenation: the high part is shifted by the low
+ part's byte width. -/
+private theorem beBytesToNat_append (a b : List (BitVec 8)) :
+ beBytesToNat (a ++ b) = beBytesToNat a * 256 ^ b.length ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_db0b48389430_4 | 95843a062dd4146d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldConvSAsm.lean | Secp256k1FieldConvSAsm | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "inner_body_exec",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have haddr : (rf.set .x28 (rf.get .x28 <<< (8 : BitVec 6).toNat)).get .x6\n + signExtend12 (0 : BitVec 12) = src + Bi... | [
{
"name": "byteAt_src",
"text": "/-- The read-only region byte at `src + o`. -/\nprivate theorem byteAt_src (src : Word) (inBytes : List (BitVec 8)) (o : Nat)\n (ho : o < 2 ^ 64) :\n (Region.mk src inBytes).byteAt (src + BitVec.ofNat 64 o) = inBytes.getD o 0 := by\n show inBytes.getD ((src + BitVec.o... | [
{
"name": "inner_body_exec",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 38,
"n_chars": 2368,
"n_subproofs": 2,
"n_tactics": 23,
"cyclomatic": 2,
"n_automation": 9,
"n_rewrites": 9,
"n_structural": 2,
"automation_only": false,
"max_nest... | 3 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldConvSAsm
Verified SAsm port of the secp256k1 BE→LE field-element converter
(bead evm-asm-4ch8f.38.2 wave-2, unblocked by the merged `doWhileS`
combinator, `.69`/#9822):
- `secfBeToLe` (`secfBeToLe_prog`, Secp256k1Field.lean:168): convert the
32-byte BIG-ENDIAN bu... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldConvSAsm
Verified SAsm port of the secp256k1 BE→LE field-element converter
(bead evm-asm-4ch8f.38.2 wave-2, unblocked by the merged `doWhileS`
combinator, `.69`/#9822):
- `secfBeToLe` (`secfBeToLe_prog`, Secp256k1Field.lean:168): convert the
32-byte BIG-ENDIAN bu... | @@ -174,6 +174,14 @@
= (rf.set rd ((reg.byteAt (rf.get rs1 + signExtend12 ofs)).zeroExtend 64), ws) := by
unfold execInstrRF; dsimp only [aluSem, loadSem]; rw [if_neg h]
+/-- The read-only region byte at `src + o`. -/
+private theorem byteAt_src (src : Word) (inBytes : List (BitVec 8)) (o : Nat)
+ (ho : ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_db0b48389430_5 | 32873a5712f0dfe5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldConvSAsm.lean | Secp256k1FieldConvSAsm | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 2 | [
{
"theorem_name": "snap_facts",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨rfp, wsp, hwsp, hreach, rfl, rfl⟩ := hsp\n -- pre-setup facts: x5 = ofNat k (k<4), x10 = src, x11 = dst, ws length 32,... | [
{
"name": "setup_exec",
"text": "private theorem setup_exec (reg : Region) (rwb src : Word) (rfp : RegFile)\n (wsp : List (BitVec 8)) (k : Nat) (hk : k < 4)\n (hx5 : rfp.get .x5 = BitVec.ofNat 64 k) (hx10 : rfp.get .x10 = src) :\n (execBlock reg rwb rfp wsp setupInstrs).1.get .x5 = BitVec.ofNat 64 ... | [
{
"name": "snap_facts",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 41,
"n_chars": 2613,
"n_subproofs": 6,
"n_tactics": 21,
"cyclomatic": 2,
"n_automation": 11,
"n_rewrites": 0,
"n_structural": 11,
"automation_only": false,
"max_nesting... | 1 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldConvSAsm
Verified SAsm port of the secp256k1 BE→LE field-element converter
(bead evm-asm-4ch8f.38.2 wave-2, unblocked by the merged `doWhileS`
combinator, `.69`/#9822):
- `secfBeToLe` (`secfBeToLe_prog`, Secp256k1Field.lean:168): convert the
32-byte BIG-ENDIAN bu... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldConvSAsm
Verified SAsm port of the secp256k1 BE→LE field-element converter
(bead evm-asm-4ch8f.38.2 wave-2, unblocked by the merged `doWhileS`
combinator, `.69`/#9822):
- `secfBeToLe` (`secfBeToLe_prog`, Secp256k1Field.lean:168): convert the
32-byte BIG-ENDIAN bu... | @@ -158,6 +158,22 @@
[.LI .x6 (24 : Word), .SLLI .x7 .x5 (3 : BitVec 6), .SUB .x6 .x6 .x7,
.ADD .x6 .x10 .x6, .LI .x28 (0 : Word), .LI .x29 (8 : Word)]
+private theorem setup_exec (reg : Region) (rwb src : Word) (rfp : RegFile)
+ (wsp : List (BitVec 8)) (k : Nat) (hk : k < 4)
+ (hx5 : rfp.get .x5 = 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_db0b48389430_6 | 45b8ec724170267d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldConvSAsm.lean | Secp256k1FieldConvSAsm | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 2 | [
{
"theorem_name": "inner_body_exec",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have haddr : (rf.set .x28 (rf.get .x28 <<< (8 : BitVec 6).toNat)).get .x6\n + signExtend12 (0 : BitVec 12) = src + Bi... | [
{
"name": "src_miss",
"text": "/-- A source-region byte at offset `o < 32` misses the disjoint 32-byte\n writable window. -/\nprivate theorem src_miss (src dst : Word) (ws : List (BitVec 8)) (o : Nat)\n (ho : o < 32) (hws : ws.length = 32) (hfr : frameOk src dst) :\n ¬ inRw dst ws (src + BitVec.ofN... | [
{
"name": "inner_blockVCs",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 31,
"n_chars": 1733,
"n_subproofs": 3,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 13,
"n_rewrites": 8,
"n_structural": 2,
"automation_only": false,
"max_nest... | 1 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldConvSAsm
Verified SAsm port of the secp256k1 BE→LE field-element converter
(bead evm-asm-4ch8f.38.2 wave-2, unblocked by the merged `doWhileS`
combinator, `.69`/#9822):
- `secfBeToLe` (`secfBeToLe_prog`, Secp256k1Field.lean:168): convert the
32-byte BIG-ENDIAN bu... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldConvSAsm
Verified SAsm port of the secp256k1 BE→LE field-element converter
(bead evm-asm-4ch8f.38.2 wave-2, unblocked by the merged `doWhileS`
combinator, `.69`/#9822):
- `secfBeToLe` (`secfBeToLe_prog`, Secp256k1Field.lean:168): convert the
32-byte BIG-ENDIAN bu... | @@ -166,6 +166,16 @@
[.SLLI .x7 .x5 (3 : BitVec 6), .ADD .x7 .x11 .x7, .SD .x7 .x28 (0 : BitVec 12),
.ADDI .x5 .x5 (1 : BitVec 12), .LI .x6 (4 : Word)]
+/-- A source-region byte at offset `o < 32` misses the disjoint 32-byte
+ writable window. -/
+private theorem src_miss (src dst : Word) (ws : List (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_db0b48389430_7 | b02e1795eb9cb615 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldConvSAsm.lean | Secp256k1FieldConvSAsm | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 2 | [
{
"theorem_name": "inner_step_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨hp29, hp28, hp6, hp5, hp10, hp11, hpws, hpfr, hpA⟩ := hInv\n rw [hkeq] at hp28\n have hpx6 : rf.get .x6 = src ... | [
{
"name": "beBytesToNat_take_succ",
"text": "/-- One more big-endian byte extends the running value by a base-256 digit. -/\nprivate theorem beBytesToNat_take_succ (l : List (BitVec 8)) (n : Nat)\n (hn : n < l.length) :\n beBytesToNat (l.take (n + 1))\n = beBytesToNat (l.take n) * 256 + (l.getD n... | [
{
"name": "inner_step_engine",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 11,
"n_lines": 47,
"n_chars": 2474,
"n_subproofs": 8,
"n_tactics": 32,
"cyclomatic": 1,
"n_automation": 9,
"n_rewrites": 15,
"n_structural": 4,
"automation_only": false,
"max_... | 11 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldConvSAsm
Verified SAsm port of the secp256k1 BE→LE field-element converter
(bead evm-asm-4ch8f.38.2 wave-2, unblocked by the merged `doWhileS`
combinator, `.69`/#9822):
- `secfBeToLe` (`secfBeToLe_prog`, Secp256k1Field.lean:168): convert the
32-byte BIG-ENDIAN bu... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldConvSAsm
Verified SAsm port of the secp256k1 BE→LE field-element converter
(bead evm-asm-4ch8f.38.2 wave-2, unblocked by the merged `doWhileS`
combinator, `.69`/#9822):
- `secfBeToLe` (`secfBeToLe_prog`, Secp256k1Field.lean:168): convert the
32-byte BIG-ENDIAN bu... | @@ -174,6 +174,15 @@
unfold beBytesToNat
rw [List.foldl_append, foldl_be' b]
+/-- One more big-endian byte extends the running value by a base-256 digit. -/
+private theorem beBytesToNat_take_succ (l : List (BitVec 8)) (n : Nat)
+ (hn : n < l.length) :
+ beBytesToNat (l.take (n + 1))
+ = beBytesToNat... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_db0b48389430_8 | 64870afa9819268c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldConvSAsm.lean | Secp256k1FieldConvSAsm | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 1 | [
{
"theorem_name": "outer_step_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨_, hp28, _, hp5, hp10, hp11, hpws, hfr, hpA⟩ := hInv\n have hkeq : (rf₀.get .x5).toNat = k := by rw [hs5, BitVe... | [
{
"name": "storeLimb_exec",
"text": "/-- The store-limb tail block: write the assembled limb `x28` to `dst + 8k`,\n bump the counter to `k+1`, reload `x6 := 4`. -/\nprivate theorem storeLimb_exec (reg : Region) (dst : Word) (rf : RegFile)\n (ws : List (BitVec 8)) (k : Nat) (hk : k < 4)\n (hx5 : rf.... | [
{
"name": "outer_step_engine",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 34,
"n_chars": 1818,
"n_subproofs": 6,
"n_tactics": 24,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 10,
"n_structural": 8,
"automation_only": false,
"max_n... | 2 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldConvSAsm
Verified SAsm port of the secp256k1 BE→LE field-element converter
(bead evm-asm-4ch8f.38.2 wave-2, unblocked by the merged `doWhileS`
combinator, `.69`/#9822):
- `secfBeToLe` (`secfBeToLe_prog`, Secp256k1Field.lean:168): convert the
32-byte BIG-ENDIAN bu... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldConvSAsm
Verified SAsm port of the secp256k1 BE→LE field-element converter
(bead evm-asm-4ch8f.38.2 wave-2, unblocked by the merged `doWhileS`
combinator, `.69`/#9822):
- `secfBeToLe` (`secfBeToLe_prog`, Secp256k1Field.lean:168): convert the
32-byte BIG-ENDIAN bu... | @@ -166,6 +166,39 @@
[.SLLI .x7 .x5 (3 : BitVec 6), .ADD .x7 .x11 .x7, .SD .x7 .x28 (0 : BitVec 12),
.ADDI .x5 .x5 (1 : BitVec 12), .LI .x6 (4 : Word)]
+/-- The store-limb tail block: write the assembled limb `x28` to `dst + 8k`,
+ bump the counter to `k+1`, reload `x6 := 4`. -/
+private theorem storeLimb_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_db0b48389430_9 | f0ad167b72e9d926 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldConvSAsm.lean | Secp256k1FieldConvSAsm | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 21 | 2 | [
{
"theorem_name": "inner_step_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨hp29, hp28, hp6, hp5, hp10, hp11, hpws, hpfr, hpA⟩ := hInv\n rw [hkeq] at hp28\n have hpx6 : rf.get .x6 = src ... | [
{
"name": "shiftOr_eq",
"text": "/-- Shift-then-or a byte in: exactly a base-256 append when the accumulator\n fits in the low 56 bits. -/\nprivate theorem shiftOr_eq (v : Nat) (b : BitVec 8) (hv : v < 2 ^ 56) :\n (BitVec.ofNat 64 v <<< (8 : Nat)) ||| (b.zeroExtend 64)\n = BitVec.ofNat 64 (v * 25... | [
{
"name": "secfBeToLeFn_spec",
"fan_in": 0,
"n_deps_direct": 12,
"n_deps_transitive": 21,
"n_lines": 140,
"n_chars": 6989,
"n_subproofs": 36,
"n_tactics": 142,
"cyclomatic": 11,
"n_automation": 54,
"n_rewrites": 43,
"n_structural": 43,
"automation_only": false,
... | 21 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldConvSAsm
Verified SAsm port of the secp256k1 BE→LE field-element converter
(bead evm-asm-4ch8f.38.2 wave-2, unblocked by the merged `doWhileS`
combinator, `.69`/#9822):
- `secfBeToLe` (`secfBeToLe_prog`, Secp256k1Field.lean:168): convert the
32-byte BIG-ENDIAN bu... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldConvSAsm
Verified SAsm port of the secp256k1 BE→LE field-element converter
(bead evm-asm-4ch8f.38.2 wave-2, unblocked by the merged `doWhileS`
combinator, `.69`/#9822):
- `secfBeToLe` (`secfBeToLe_prog`, Secp256k1Field.lean:168): convert the
32-byte BIG-ENDIAN bu... | @@ -205,6 +205,21 @@
simp [Nat.not_lt.mpr hj, hj]
rw [key]; ring
+/-- Shift-then-or a byte in: exactly a base-256 append when the accumulator
+ fits in the low 56 bits. -/
+private theorem shiftOr_eq (v : Nat) (b : BitVec 8) (hv : v < 2 ^ 56) :
+ (BitVec.ofNat 64 v <<< (8 : Nat)) ||| (b.zeroExtend 64)... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5890470e9045_0 | e040d6a36e436183 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/EvmExpCode.lean | EvmExpCode | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "evmExpCode_pointer_advance_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evmExpCode_eq_ofProg]\n exact CodeReq.ofProg_mono_sub base (base + 24)\n (EvmAsm.Evm64.evm_exp mulO... | [
{
"name": "evmExpCode_eq_ofProg",
"text": "theorem evmExpCode_eq_ofProg (base : Word)\n (mulOff : BitVec 21) (skipOff backOff : BitVec 13) :\n evmExpCode base mulOff skipOff backOff =\n CodeReq.ofProg base (EvmAsm.Evm64.evm_exp mulOff skipOff backOff) := by\n unfold evmExpCode\n unfold EvmAsm.E... | [
{
"name": "evmExpCode_pointer_advance_sub",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 759,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,... | 1 | /-
EvmAsm.Evm64.Exp.Compose.EvmExpCode
Top-level `CodeReq` decomposition for the EXP opcode program:
`evmExpCode` (`unionAll` of prologue, pointer-advance, iter-body-full,
pointer-restore, epilogue) plus its `_eq_ofProg` equality with
`CodeReq.ofProg ... (evm_exp ...)` and the four `evmExpCode_*_sub`
block... | /-
EvmAsm.Evm64.Exp.Compose.EvmExpCode
Top-level `CodeReq` decomposition for the EXP opcode program:
`evmExpCode` (`unionAll` of prologue, pointer-advance, iter-body-full,
pointer-restore, epilogue) plus its `_eq_ofProg` equality with
`CodeReq.ofProg ... (evm_exp ...)` and the four `evmExpCode_*_sub`
block... | @@ -29,11 +29,67 @@
CodeReq.ofProg (base + 264) EvmAsm.Evm64.exp_epilogue
]
+theorem evmExpCode_eq_ofProg (base : Word)
+ (mulOff : BitVec 21) (skipOff backOff : BitVec 13) :
+ evmExpCode base mulOff skipOff backOff =
+ CodeReq.ofProg base (EvmAsm.Evm64.evm_exp mulOff skipOff backOff) := by
+ unfo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5890470e9045_1 | baaa86d41397cb68 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/EvmExpCode.lean | EvmExpCode | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "evmExpCode_pointer_advance_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evmExpCode_eq_ofProg]\n exact CodeReq.ofProg_mono_sub base (base + 24)\n (EvmAsm.Evm64.evm_exp mulO... | [
{
"name": "evmExpCode_eq_ofProg",
"text": "theorem evmExpCode_eq_ofProg (base : Word)\n (mulOff : BitVec 21) (skipOff backOff : BitVec 13) :\n evmExpCode base mulOff skipOff backOff =\n CodeReq.ofProg base (EvmAsm.Evm64.evm_exp mulOff skipOff backOff) := by\n unfold evmExpCode\n unfold EvmAsm.E... | [
{
"name": "evmExpCode_iter_body_sub",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 775,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"... | 1 | /-
EvmAsm.Evm64.Exp.Compose.EvmExpCode
Top-level `CodeReq` decomposition for the EXP opcode program:
`evmExpCode` (`unionAll` of prologue, pointer-advance, iter-body-full,
pointer-restore, epilogue) plus its `_eq_ofProg` equality with
`CodeReq.ofProg ... (evm_exp ...)` and the four `evmExpCode_*_sub`
block... | /-
EvmAsm.Evm64.Exp.Compose.EvmExpCode
Top-level `CodeReq` decomposition for the EXP opcode program:
`evmExpCode` (`unionAll` of prologue, pointer-advance, iter-body-full,
pointer-restore, epilogue) plus its `_eq_ofProg` equality with
`CodeReq.ofProg ... (evm_exp ...)` and the four `evmExpCode_*_sub`
block... | @@ -29,10 +29,66 @@
CodeReq.ofProg (base + 264) EvmAsm.Evm64.exp_epilogue
]
+theorem evmExpCode_eq_ofProg (base : Word)
+ (mulOff : BitVec 21) (skipOff backOff : BitVec 13) :
+ evmExpCode base mulOff skipOff backOff =
+ CodeReq.ofProg base (EvmAsm.Evm64.evm_exp mulOff skipOff backOff) := by
+ unfo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5890470e9045_2 | 4bc9098dd550ac8f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/EvmExpCode.lean | EvmExpCode | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "evmExpCode_pointer_advance_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evmExpCode_eq_ofProg]\n exact CodeReq.ofProg_mono_sub base (base + 24)\n (EvmAsm.Evm64.evm_exp mulO... | [
{
"name": "evmExpCode_eq_ofProg",
"text": "theorem evmExpCode_eq_ofProg (base : Word)\n (mulOff : BitVec 21) (skipOff backOff : BitVec 13) :\n evmExpCode base mulOff skipOff backOff =\n CodeReq.ofProg base (EvmAsm.Evm64.evm_exp mulOff skipOff backOff) := by\n unfold evmExpCode\n unfold EvmAsm.E... | [
{
"name": "evmExpCode_pointer_restore_sub",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 762,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,... | 1 | /-
EvmAsm.Evm64.Exp.Compose.EvmExpCode
Top-level `CodeReq` decomposition for the EXP opcode program:
`evmExpCode` (`unionAll` of prologue, pointer-advance, iter-body-full,
pointer-restore, epilogue) plus its `_eq_ofProg` equality with
`CodeReq.ofProg ... (evm_exp ...)` and the four `evmExpCode_*_sub`
block... | /-
EvmAsm.Evm64.Exp.Compose.EvmExpCode
Top-level `CodeReq` decomposition for the EXP opcode program:
`evmExpCode` (`unionAll` of prologue, pointer-advance, iter-body-full,
pointer-restore, epilogue) plus its `_eq_ofProg` equality with
`CodeReq.ofProg ... (evm_exp ...)` and the four `evmExpCode_*_sub`
block... | @@ -29,11 +29,67 @@
CodeReq.ofProg (base + 264) EvmAsm.Evm64.exp_epilogue
]
+theorem evmExpCode_eq_ofProg (base : Word)
+ (mulOff : BitVec 21) (skipOff backOff : BitVec 13) :
+ evmExpCode base mulOff skipOff backOff =
+ CodeReq.ofProg base (EvmAsm.Evm64.evm_exp mulOff skipOff backOff) := by
+ unfo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_add69e0ae428_0 | d7c673f73d751b2a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase1CascadePrefixE3.lean | Phase1CascadePrefixE3 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "rlp_phase1_cascade_prefix_e3_spec'_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n rlp_phase1_cascade_prefix_e3_spec_within v5 v10 off1 off2 off3 base e3_target\n htarget hv5_lo hv... | [
{
"name": "rlp_phase1_cascade_prefix_e3_spec_within",
"text": "/-- `cpsTripleWithin base e3_target` for the Phase 1 cascade prefix on the\n e3 (long-string) path: cascade steps 1, 2 fall through, step 3\n takes its branch.\n\n `kVal3 = (0 : Word) + signExtend12 0xC0` is the residue left in\n `x1... | [
{
"name": "rlp_phase1_cascade_prefix_e3_spec'_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 1151,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_on... | 1 | /-
EvmAsm.Rv64.RLP.Phase1CascadePrefixE3
EL.3 Phase 1 cascade prefix for the e3 (long-string) path.
Composes:
* `rlp_phase1_step_ntaken_spec` at `(base, k = 0x80)` — first
cascade step assumed *not* taken (caller has `¬ ult v5 0x80`).
* `rlp_phase1_step_ntaken_spec` at `(base + 8, k = 0xB8)` —
... | /-
EvmAsm.Rv64.RLP.Phase1CascadePrefixE3
EL.3 Phase 1 cascade prefix for the e3 (long-string) path.
Composes:
* `rlp_phase1_step_ntaken_spec` at `(base, k = 0x80)` — first
cascade step assumed *not* taken (caller has `¬ ult v5 0x80`).
* `rlp_phase1_step_ntaken_spec` at `(base + 8, k = 0xB8)` —
... | @@ -32,6 +32,52 @@
-- Spec
-- ============================================================================
+/-- `cpsTripleWithin base e3_target` for the Phase 1 cascade prefix on the
+ e3 (long-string) path: cascade steps 1, 2 fall through, step 3
+ takes its branch.
+
+ `kVal3 = (0 : Word) + signExtend12 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_95d87a7405d5_0 | 90e623fcf41ed09a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V5LaneShift0Mod.lean | FullPathN1V5LaneShift0Mod | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_mod_n1_lane_shift0_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hmodWord := fullModN1RemainderWordShift0V5_eq_mod_lane_of_shape\n ha0 ha1 ha2 ha3 hb0 hb1 hb2 hb3 hbnz h... | [
{
"name": "fullModN1Shift0V5_hmods_of_word_eq",
"text": "/-- Project the shift=0 MOD remainder-word equality into the four per-limb\n `getLimbN` facts (the values in the output cells sp+32/40/48/56). -/\ntheorem fullModN1Shift0V5_hmods_of_word_eq\n (a b : EvmWord) (a0 a1 a2 a3 b0 : Word)\n (hword :... | [
{
"name": "evm_mod_n1_lane_shift0_v5",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 40,
"n_chars": 2415,
"n_subproofs": 4,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 6,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5LaneShift0Mod
The v5 n=1 MOD lane, shift=0 case + the full `evm_mod_n1_lane_v5` combiner.
MOD mirror of `FullPathN1V5LaneShift0` (DIV). Composes the op-agnostic pre lift
(`n1_dispatchPre_to_pathEntry_v5`), the full shift=0 MOD code path
(`evm_mod_n1_full_shift0_spe... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5LaneShift0Mod
The v5 n=1 MOD lane, shift=0 case + the full `evm_mod_n1_lane_v5` combiner.
MOD mirror of `FullPathN1V5LaneShift0` (DIV). Composes the op-agnostic pre lift
(`n1_dispatchPre_to_pathEntry_v5`), the full shift=0 MOD code path
(`evm_mod_n1_full_shift0_spe... | @@ -19,6 +19,21 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
+/-- Project the shift=0 MOD remainder-word equality into the four per-limb
+ `getLimbN` facts (the values in the output cells sp+32/40/48/56). -/
+theorem fullModN1Shift0V5_hmods_of_word_eq
+ (a b : EvmWord) (a0 a1 a2 a3 b0 : Word)... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_95d87a7405d5_1 | dc13b4693d09c02b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V5LaneShift0Mod.lean | FullPathN1V5LaneShift0Mod | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_mod_n1_lane_shift0_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hmodWord := fullModN1RemainderWordShift0V5_eq_mod_lane_of_shape\n ha0 ha1 ha2 ha3 hb0 hb1 hb2 hb3 hbnz h... | [
{
"name": "fullModN1Shift0V5_hmods_of_word_eq",
"text": "/-- Project the shift=0 MOD remainder-word equality into the four per-limb\n `getLimbN` facts (the values in the output cells sp+32/40/48/56). -/\ntheorem fullModN1Shift0V5_hmods_of_word_eq\n (a b : EvmWord) (a0 a1 a2 a3 b0 : Word)\n (hword :... | [
{
"name": "evm_mod_n1_lane_v5",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 33,
"n_chars": 1944,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_n... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5LaneShift0Mod
The v5 n=1 MOD lane, shift=0 case + the full `evm_mod_n1_lane_v5` combiner.
MOD mirror of `FullPathN1V5LaneShift0` (DIV). Composes the op-agnostic pre lift
(`n1_dispatchPre_to_pathEntry_v5`), the full shift=0 MOD code path
(`evm_mod_n1_full_shift0_spe... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5LaneShift0Mod
The v5 n=1 MOD lane, shift=0 case + the full `evm_mod_n1_lane_v5` combiner.
MOD mirror of `FullPathN1V5LaneShift0` (DIV). Composes the op-agnostic pre lift
(`n1_dispatchPre_to_pathEntry_v5`), the full shift=0 MOD code path
(`evm_mod_n1_full_shift0_spe... | @@ -19,6 +19,21 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
+/-- Project the shift=0 MOD remainder-word equality into the four per-limb
+ `getLimbN` facts (the values in the output cells sp+32/40/48/56). -/
+theorem fullModN1Shift0V5_hmods_of_word_eq
+ (a b : EvmWord) (a0 a1 a2 a3 b0 : Word)... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0602f35f9278_0 | fc093f33b542897c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN4Loop.lean | FullPathN4Loop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "loopExitPostN4_j0_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [loopExitPost_unfold]\n rw [u_base_off0_j0, u_base_off4088_j0, u_base_off4080_j0,\n u_base_off4072_j0,... | [
{
"name": "u_base_off4064_j0",
"text": "theorem u_base_off4064_j0 {sp : Word} :\n (sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4064 =\n sp + signExtend12 4024 := by divmod_addr\n\n",
"fan_in": 4,
"n_lines": 5,
"n_chars": 175,
"n_subproofs": 0,
"n_ta... | [
{
"name": "loopExitPostN4_j0_eq",
"fan_in": 0,
"n_deps_direct": 7,
"n_deps_transitive": 7,
"n_lines": 25,
"n_chars": 1460,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_... | 7 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4Loop
Building blocks for the n=4 full path composition:
- Loop body j=0 specs extended from sharedDivModCode to divCode
- Address normalization lemmas for j=0
-/
-- `LoopIterN4 → LoopBodyN4 → LoopBody → Compose → FullPath`.
import EvmAsm.Evm64.DivMod.LoopIterN4
open E... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4Loop
Building blocks for the n=4 full path composition:
- Loop body j=0 specs extended from sharedDivModCode to divCode
- Address normalization lemmas for j=0
-/
-- `LoopIterN4 → LoopBodyN4 → LoopBody → Compose → FullPath`.
import EvmAsm.Evm64.DivMod.LoopIterN4
open E... | @@ -40,6 +40,10 @@
(sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4072 =
sp + signExtend12 4032 := by divmod_addr
+theorem u_base_off4064_j0 {sp : Word} :
+ (sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4064 =
+ sp + signExtend12 4024 := b... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0602f35f9278_1 | 30d893cfd40325f0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN4Loop.lean | FullPathN4Loop | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 3 | [
{
"theorem_name": "divK_loop_body_n4_max_skip_j0_divCode_within",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := cpsTripleWithin_extend_code (hmono := sharedDivModCode_sub_divCode)\n (divK_loop... | [
{
"name": "loopBodyN4SkipJ0Pre_unfold",
"text": "/-- Named unfold for `loopBodyN4SkipJ0Pre`. -/\ntheorem loopBodyN4SkipJ0Pre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :\n loopBodyN4SkipJ0Pre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n ... | [
{
"name": "divK_loop_body_n4_max_skip_j0_divCode_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 28,
"n_chars": 1260,
"n_subproofs": 1,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 5,
"automatio... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4Loop
Building blocks for the n=4 full path composition:
- Loop body j=0 specs extended from sharedDivModCode to divCode
- Address normalization lemmas for j=0
-/
-- `LoopIterN4 → LoopBodyN4 → LoopBody → Compose → FullPath`.
import EvmAsm.Evm64.DivMod.LoopIterN4
open E... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4Loop
Building blocks for the n=4 full path composition:
- Loop body j=0 specs extended from sharedDivModCode to divCode
- Address normalization lemmas for j=0
-/
-- `LoopIterN4 → LoopBodyN4 → LoopBody → Compose → FullPath`.
import EvmAsm.Evm64.DivMod.LoopIterN4
open E... | @@ -42,6 +42,27 @@
((uBase + signExtend12 4064) ↦ₘ uTop) **
(qAddr ↦ₘ qOld)
+/-- Named unfold for `loopBodyN4SkipJ0Pre`. -/
+theorem loopBodyN4SkipJ0Pre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :
+ loopBodyN4SkipJ0Pre sp jOld v5Old v6Old v7Old... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0602f35f9278_2 | fa8603fbe2cb81f6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN4Loop.lean | FullPathN4Loop | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 3 | [
{
"theorem_name": "divK_loop_body_n4_max_skip_j0_divCode_within",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := cpsTripleWithin_extend_code (hmono := sharedDivModCode_sub_divCode)\n (divK_loop... | [
{
"name": "loopBodyN4SkipJ0Pre_unfold",
"text": "/-- Named unfold for `loopBodyN4SkipJ0Pre`. -/\ntheorem loopBodyN4SkipJ0Pre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :\n loopBodyN4SkipJ0Pre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n ... | [
{
"name": "divK_loop_body_n4_max_skip_j0_divCode_noNop_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 33,
"n_chars": 1575,
"n_subproofs": 2,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 6,
"aut... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4Loop
Building blocks for the n=4 full path composition:
- Loop body j=0 specs extended from sharedDivModCode to divCode
- Address normalization lemmas for j=0
-/
-- `LoopIterN4 → LoopBodyN4 → LoopBody → Compose → FullPath`.
import EvmAsm.Evm64.DivMod.LoopIterN4
open E... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4Loop
Building blocks for the n=4 full path composition:
- Loop body j=0 specs extended from sharedDivModCode to divCode
- Address normalization lemmas for j=0
-/
-- `LoopIterN4 → LoopBodyN4 → LoopBody → Compose → FullPath`.
import EvmAsm.Evm64.DivMod.LoopIterN4
open E... | @@ -42,6 +42,27 @@
((uBase + signExtend12 4064) ↦ₘ uTop) **
(qAddr ↦ₘ qOld)
+/-- Named unfold for `loopBodyN4SkipJ0Pre`. -/
+theorem loopBodyN4SkipJ0Pre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :
+ loopBodyN4SkipJ0Pre sp jOld v5Old v6Old v7Old... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0602f35f9278_3 | 81c664ef65bb3cf5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN4Loop.lean | FullPathN4Loop | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 3 | [
{
"theorem_name": "divK_loop_body_n4_max_skip_j0_divCode_within",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := cpsTripleWithin_extend_code (hmono := sharedDivModCode_sub_divCode)\n (divK_loop... | [
{
"name": "loopBodyN4SkipJ0Pre_unfold",
"text": "/-- Named unfold for `loopBodyN4SkipJ0Pre`. -/\ntheorem loopBodyN4SkipJ0Pre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :\n loopBodyN4SkipJ0Pre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n ... | [
{
"name": "divK_loop_body_n4_max_skip_j0_modCode_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 32,
"n_chars": 1460,
"n_subproofs": 1,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 5,
"automatio... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4Loop
Building blocks for the n=4 full path composition:
- Loop body j=0 specs extended from sharedDivModCode to divCode
- Address normalization lemmas for j=0
-/
-- `LoopIterN4 → LoopBodyN4 → LoopBody → Compose → FullPath`.
import EvmAsm.Evm64.DivMod.LoopIterN4
open E... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4Loop
Building blocks for the n=4 full path composition:
- Loop body j=0 specs extended from sharedDivModCode to divCode
- Address normalization lemmas for j=0
-/
-- `LoopIterN4 → LoopBodyN4 → LoopBody → Compose → FullPath`.
import EvmAsm.Evm64.DivMod.LoopIterN4
open E... | @@ -42,6 +42,27 @@
((uBase + signExtend12 4064) ↦ₘ uTop) **
(qAddr ↦ₘ qOld)
+/-- Named unfold for `loopBodyN4SkipJ0Pre`. -/
+theorem loopBodyN4SkipJ0Pre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :
+ loopBodyN4SkipJ0Pre sp jOld v5Old v6Old v7Old... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0602f35f9278_4 | 792ae9c78a3567ef | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN4Loop.lean | FullPathN4Loop | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "loopExitPostN4_j0_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [loopExitPost_unfold]\n rw [u_base_off0_j0, u_base_off4088_j0, u_base_off4080_j0,\n u_base_off4072_j0,... | [
{
"name": "q_addr_j0",
"text": "theorem q_addr_j0 {sp : Word} :\n sp + signExtend12 4088 - (0 : Word) <<< (3 : BitVec 6).toNat = sp + signExtend12 4088 := by\n divmod_addr\n\n-- ============================================================================\n-- loopExitPostN4 at j=0: address normalization ... | [
{
"name": "divK_loop_body_n4_max_skip_j0_norm_modCode_within",
"fan_in": 0,
"n_deps_direct": 8,
"n_deps_transitive": 9,
"n_lines": 34,
"n_chars": 1754,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 3,
"auto... | 9 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4Loop
Building blocks for the n=4 full path composition:
- Loop body j=0 specs extended from sharedDivModCode to divCode
- Address normalization lemmas for j=0
-/
-- `LoopIterN4 → LoopBodyN4 → LoopBody → Compose → FullPath`.
import EvmAsm.Evm64.DivMod.LoopIterN4
open E... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4Loop
Building blocks for the n=4 full path composition:
- Loop body j=0 specs extended from sharedDivModCode to divCode
- Address normalization lemmas for j=0
-/
-- `LoopIterN4 → LoopBodyN4 → LoopBody → Compose → FullPath`.
import EvmAsm.Evm64.DivMod.LoopIterN4
open E... | @@ -40,6 +40,14 @@
(sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4064 =
sp + signExtend12 4024 := by divmod_addr
+theorem q_addr_j0 {sp : Word} :
+ sp + signExtend12 4088 - (0 : Word) <<< (3 : BitVec 6).toNat = sp + signExtend12 4088 := by
+ divmod_addr
+
+-- ============... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0602f35f9278_5 | 73970e8d721b27ce | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN4Loop.lean | FullPathN4Loop | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "loopExitPostN4_j0_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [loopExitPost_unfold]\n rw [u_base_off0_j0, u_base_off4088_j0, u_base_off4080_j0,\n u_base_off4072_j0,... | [
{
"name": "q_addr_j0",
"text": "theorem q_addr_j0 {sp : Word} :\n sp + signExtend12 4088 - (0 : Word) <<< (3 : BitVec 6).toNat = sp + signExtend12 4088 := by\n divmod_addr\n\n-- ============================================================================\n-- loopExitPostN4 at j=0: address normalization ... | [
{
"name": "divK_loop_body_n4_call_skip_j0_norm_modCode_within",
"fan_in": 0,
"n_deps_direct": 8,
"n_deps_transitive": 8,
"n_lines": 35,
"n_chars": 1879,
"n_subproofs": 1,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 5,
"aut... | 8 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4Loop
Building blocks for the n=4 full path composition:
- Loop body j=0 specs extended from sharedDivModCode to divCode
- Address normalization lemmas for j=0
-/
-- `LoopIterN4 → LoopBodyN4 → LoopBody → Compose → FullPath`.
import EvmAsm.Evm64.DivMod.LoopIterN4
open E... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4Loop
Building blocks for the n=4 full path composition:
- Loop body j=0 specs extended from sharedDivModCode to divCode
- Address normalization lemmas for j=0
-/
-- `LoopIterN4 → LoopBodyN4 → LoopBody → Compose → FullPath`.
import EvmAsm.Evm64.DivMod.LoopIterN4
open E... | @@ -40,6 +40,14 @@
(sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4064 =
sp + signExtend12 4024 := by divmod_addr
+theorem q_addr_j0 {sp : Word} :
+ sp + signExtend12 4088 - (0 : Word) <<< (3 : BitVec 6).toNat = sp + signExtend12 4088 := by
+ divmod_addr
+
+-- ============... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0602f35f9278_6 | b5d6ccda80d09e08 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN4Loop.lean | FullPathN4Loop | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 4 | [
{
"theorem_name": "loopExitPostN4_j0_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [loopExitPost_unfold]\n rw [u_base_off0_j0, u_base_off4088_j0, u_base_off4080_j0,\n u_base_off4072_j0,... | [
{
"name": "q_addr_j0",
"text": "theorem q_addr_j0 {sp : Word} :\n sp + signExtend12 4088 - (0 : Word) <<< (3 : BitVec 6).toNat = sp + signExtend12 4088 := by\n divmod_addr\n\n-- ============================================================================\n-- loopExitPostN4 at j=0: address normalization ... | [
{
"name": "divK_loop_body_n4_call_addback_j0_beq_norm_modCode_within",
"fan_in": 0,
"n_deps_direct": 8,
"n_deps_transitive": 8,
"n_lines": 31,
"n_chars": 1640,
"n_subproofs": 1,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 5,
... | 8 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4Loop
Building blocks for the n=4 full path composition:
- Loop body j=0 specs extended from sharedDivModCode to divCode
- Address normalization lemmas for j=0
-/
-- `LoopIterN4 → LoopBodyN4 → LoopBody → Compose → FullPath`.
import EvmAsm.Evm64.DivMod.LoopIterN4
open E... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4Loop
Building blocks for the n=4 full path composition:
- Loop body j=0 specs extended from sharedDivModCode to divCode
- Address normalization lemmas for j=0
-/
-- `LoopIterN4 → LoopBodyN4 → LoopBody → Compose → FullPath`.
import EvmAsm.Evm64.DivMod.LoopIterN4
open E... | @@ -40,6 +40,14 @@
(sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat) + signExtend12 4064 =
sp + signExtend12 4024 := by divmod_addr
+theorem q_addr_j0 {sp : Word} :
+ sp + signExtend12 4088 - (0 : Word) <<< (3 : BitVec 6).toNat = sp + signExtend12 4088 := by
+ divmod_addr
+
+-- ============... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8ff12d2c50c1_0 | 8ad43ce30deeb307 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/ModBridgeUtop.lean | ModBridgeUtop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "val256_mod_mul_pow_lt_pow256_of_b3_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hb_bound : val256 b0 b1 b2 b3 < 2 ^ (256 - s) :=\n val256_lt_of_b3_bound b0 b1 b2 b3 hs h... | [
{
"name": "val256_lt_of_b3_bound",
"text": "/-- Under the CLZ top-limb bound `b3 < 2^(64 - s)`, the full 256-bit value\n satisfies `val256(b) < 2^(256 - s)`, which is what bounds `val256(b) * 2^s`\n within 2^256. Elementary expansion + `nlinarith`. -/\ntheorem val256_lt_of_b3_bound (b0 b1 b2 b3 : Word... | [
{
"name": "val256_mod_mul_pow_lt_pow256_of_b3_bound",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 26,
"n_chars": 1236,
"n_subproofs": 5,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 1,
"automation_on... | 1 | /-
EvmAsm.Evm64.EvmWordArith.ModBridgeUtop
The `uTop = c3_n` invariant for Knuth algorithm D at n=4 max+skip.
During algorithm D's normalization step, the top bits of the dividend
`a3 >>> (64 - s)` become an implicit 5th limb `uTop`. The mulsub on
the normalized 4-limb dividend + divisor produces `msN` with... | /-
EvmAsm.Evm64.EvmWordArith.ModBridgeUtop
The `uTop = c3_n` invariant for Knuth algorithm D at n=4 max+skip.
During algorithm D's normalization step, the top bits of the dividend
`a3 >>> (64 - s)` become an implicit 5th limb `uTop`. The mulsub on
the normalized 4-limb dividend + divisor produces `msN` with... | @@ -28,6 +28,20 @@
namespace EvmWord
+/-- Under the CLZ top-limb bound `b3 < 2^(64 - s)`, the full 256-bit value
+ satisfies `val256(b) < 2^(256 - s)`, which is what bounds `val256(b) * 2^s`
+ within 2^256. Elementary expansion + `nlinarith`. -/
+theorem val256_lt_of_b3_bound (b0 b1 b2 b3 : Word) {s : Nat} (... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8ff12d2c50c1_1 | 07ff3f0648420485 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/ModBridgeUtop.lean | ModBridgeUtop | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "u_top_eq_c3_nat_form",
"depth": 1,
"n_commands": 0,
"n_lines": 27,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Scale un-normalized Euclidean by 2^s.\n have h_Va_scaled : Va * 2 ^ s = Vms_un * 2 ^ s + Q * Vb * 2 ^ s := by\n ... | [
{
"name": "nat_top_eq_of_lt_pow256",
"text": "/-- Nat-level uniqueness: if `vPow < 2^256`, `vN < 2^256`, `c ≤ u`, and\n `vPow = vN + (u - c) * 2^256`, then `u = c` (and `vPow = vN`). -/\ntheorem nat_top_eq_of_lt_pow256 {vPow vN u c : Nat}\n (hle : c ≤ u)\n (heq : vPow = vN + (u - c) * 2 ^ 256)\n ... | [
{
"name": "u_top_eq_c3_nat_form",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 49,
"n_chars": 2230,
"n_subproofs": 8,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 4,
"n_structural": 3,
"automation_only": false,
"max... | 1 | /-
EvmAsm.Evm64.EvmWordArith.ModBridgeUtop
The `uTop = c3_n` invariant for Knuth algorithm D at n=4 max+skip.
During algorithm D's normalization step, the top bits of the dividend
`a3 >>> (64 - s)` become an implicit 5th limb `uTop`. The mulsub on
the normalized 4-limb dividend + divisor produces `msN` with... | /-
EvmAsm.Evm64.EvmWordArith.ModBridgeUtop
The `uTop = c3_n` invariant for Knuth algorithm D at n=4 max+skip.
During algorithm D's normalization step, the top bits of the dividend
`a3 >>> (64 - s)` become an implicit 5th limb `uTop`. The mulsub on
the normalized 4-limb dividend + divisor produces `msN` with... | @@ -28,6 +28,23 @@
namespace EvmWord
+/-- Nat-level uniqueness: if `vPow < 2^256`, `vN < 2^256`, `c ≤ u`, and
+ `vPow = vN + (u - c) * 2^256`, then `u = c` (and `vPow = vN`). -/
+theorem nat_top_eq_of_lt_pow256 {vPow vN u c : Nat}
+ (hle : c ≤ u)
+ (heq : vPow = vN + (u - c) * 2 ^ 256)
+ (h_vPow_lt : 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_8ff12d2c50c1_2 | e1a685653b1ae623 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/ModBridgeUtop.lean | ModBridgeUtop | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "val256_mod_mul_pow_lt_pow256_of_b3_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hb_bound : val256 b0 b1 b2 b3 < 2 ^ (256 - s) :=\n val256_lt_of_b3_bound b0 b1 b2 b3 hs h... | [
{
"name": "val256_lt_of_b3_bound",
"text": "/-- Under the CLZ top-limb bound `b3 < 2^(64 - s)`, the full 256-bit value\n satisfies `val256(b) < 2^(256 - s)`, which is what bounds `val256(b) * 2^s`\n within 2^256. Elementary expansion + `nlinarith`. -/\ntheorem val256_lt_of_b3_bound (b0 b1 b2 b3 : Word... | [
{
"name": "u_top_eq_c3_n_max_skip",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 63,
"n_chars": 2751,
"n_subproofs": 7,
"n_tactics": 25,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"m... | 3 | /-
EvmAsm.Evm64.EvmWordArith.ModBridgeUtop
The `uTop = c3_n` invariant for Knuth algorithm D at n=4 max+skip.
During algorithm D's normalization step, the top bits of the dividend
`a3 >>> (64 - s)` become an implicit 5th limb `uTop`. The mulsub on
the normalized 4-limb dividend + divisor produces `msN` with... | /-
EvmAsm.Evm64.EvmWordArith.ModBridgeUtop
The `uTop = c3_n` invariant for Knuth algorithm D at n=4 max+skip.
During algorithm D's normalization step, the top bits of the dividend
`a3 >>> (64 - s)` become an implicit 5th limb `uTop`. The mulsub on
the normalized 4-limb dividend + divisor produces `msN` with... | @@ -45,6 +45,20 @@
omega
omega
+/-- Under the CLZ top-limb bound `b3 < 2^(64 - s)`, the full 256-bit value
+ satisfies `val256(b) < 2^(256 - s)`, which is what bounds `val256(b) * 2^s`
+ within 2^256. Elementary expansion + `nlinarith`. -/
+theorem val256_lt_of_b3_bound (b0 b1 b2 b3 : Word) {s : Nat} (h... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_57d2650bf20a_0 | ce026d775c76e98a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2V4Families.lean | FullPathN2V4Families | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_div_n2_denorm_epilogue_bundled_spec_noNop_v4Final_exact_x1_frame",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hDenorm := evm_div_n2_denorm_epilogue_bundled_spec_noNop_v4Final... | [
{
"name": "evm_div_n2_denorm_epilogue_bundled_spec_noNop_v4Final",
"text": "theorem evm_div_n2_denorm_epilogue_bundled_spec_noNop_v4Final\n (bltu_2 bltu_1 bltu_0 : Bool)\n (sp base a0 a1 a2 a3 b0 b1 b2 b3 : Word)\n (hshift_nz : fullDivN2Shift b1 ≠ 0) :\n cpsTripleWithin (2 + 23 + 10) (base + den... | [
{
"name": "evm_div_n2_denorm_epilogue_bundled_spec_noNop_v4Final_exact_x1_frame",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 34,
"n_chars": 1572,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_struct... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
N2 V4 iteration family: R0V4/R1V4/R2V4/C3V4/DenormPreV4/etc.
Mirrors FullPathN3V4.lean (lines 141-275) for n=2.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4NoNopPreloop
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 ... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
N2 V4 iteration family: R0V4/R1V4/R2V4/C3V4/DenormPreV4/etc.
Mirrors FullPathN3V4.lean (lines 141-275) for n=2.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4NoNopPreloop
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 ... | @@ -196,6 +196,36 @@
-- V4 denorm epilogue
-- ============================================================================
+theorem evm_div_n2_denorm_epilogue_bundled_spec_noNop_v4Final
+ (bltu_2 bltu_1 bltu_0 : Bool)
+ (sp base a0 a1 a2 a3 b0 b1 b2 b3 : Word)
+ (hshift_nz : fullDivN2Shift b1 ≠ 0) :
+ c... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0a89085bf42a_0 | f06efe5ced53be37 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterState.lean | SavedBitFixedIterState | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 2 | [
{
"theorem_name": "expTwoMulFixedIterStateAssertion_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterStateAssertion_unfold]\n pcFree",
"n_chars": 59,
"n_subproofs": 0,
... | [
{
"name": "expTwoMulFixedIterStateAssertion_unfold",
"text": "theorem expTwoMulFixedIterStateAssertion_unfold\n {baseWord exponentWord : EvmWord} {k : Nat}\n {iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3 : Word} :\n expTwoMulFixedIterStateAssertion baseWord exponentWord k\n iterCount e... | [
{
"name": "expTwoMulFixedIterStateAssertion_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 356,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only":... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
Bundled fixed-loop iteration state for the Nat-induction EXP path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- The pure invariant carrie... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
Bundled fixed-loop iteration state for the Nat-induction EXP path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- The pure invariant carrie... | @@ -31,11 +31,23 @@
⌜expTwoMulFixedIterStateInvariant baseWord exponentWord k
iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3⌝
+theorem expTwoMulFixedIterStateAssertion_unfold
+ {baseWord exponentWord : EvmWord} {k : Nat}
+ {iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3 : Word} :
+ expTwo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0a89085bf42a_1 | ca237092938c1a61 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterState.lean | SavedBitFixedIterState | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 2 | [
{
"theorem_name": "expTwoMulFixedIterStateAssertion_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterStateAssertion_unfold]\n pcFree",
"n_chars": 59,
"n_subproofs": 0,
... | [
{
"name": "expTwoMulFixedIterStateAssertion_unfold",
"text": "theorem expTwoMulFixedIterStateAssertion_unfold\n {baseWord exponentWord : EvmWord} {k : Nat}\n {iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3 : Word} :\n expTwoMulFixedIterStateAssertion baseWord exponentWord k\n iterCount e... | [
{
"name": "expTwoMulFixedIterStateAssertion_pure",
"fan_in": 6,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 514,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": ... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
Bundled fixed-loop iteration state for the Nat-induction EXP path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- The pure invariant carrie... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
Bundled fixed-loop iteration state for the Nat-induction EXP path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- The pure invariant carrie... | @@ -31,11 +31,23 @@
⌜expTwoMulFixedIterStateInvariant baseWord exponentWord k
iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3⌝
+theorem expTwoMulFixedIterStateAssertion_unfold
+ {baseWord exponentWord : EvmWord} {k : Nat}
+ {iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3 : Word} :
+ expTwo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0a89085bf42a_2 | 6e90341e2f9078ff | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterState.lean | SavedBitFixedIterState | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 6 | [
{
"theorem_name": "expTwoMulFixedIterStateAssertion_full_result",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n expTwoMulFixedIterStateInvariant_full_result\n (expTwoMulFixedIterStateAssertion_pure h)",
... | [
{
"name": "expTwoMulFixedIterStateAssertion_pure",
"text": "theorem expTwoMulFixedIterStateAssertion_pure\n {baseWord exponentWord : EvmWord} {k : Nat}\n {iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3 : Word}\n {ps : PartialState}\n (h :\n expTwoMulFixedIterStateAssertion baseWord ex... | [
{
"name": "expTwoMulFixedIterStateAssertion_full_result",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 485,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
Bundled fixed-loop iteration state for the Nat-induction EXP path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- The pure invariant carrie... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
Bundled fixed-loop iteration state for the Nat-induction EXP path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- The pure invariant carrie... | @@ -66,6 +66,18 @@
iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3) :=
⟨expTwoMulFixedIterStateAssertion_pcFree⟩
+theorem expTwoMulFixedIterStateAssertion_pure
+ {baseWord exponentWord : EvmWord} {k : Nat}
+ {iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3 : Word}
+ {ps : PartialState}
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0a89085bf42a_3 | 1b9b5fd14d74336b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterState.lean | SavedBitFixedIterState | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 6 | [
{
"theorem_name": "expTwoMulFixedIterStateAssertion_full_result",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n expTwoMulFixedIterStateInvariant_full_result\n (expTwoMulFixedIterStateAssertion_pure h)",
... | [
{
"name": "expTwoMulFixedIterStateAssertion_pure",
"text": "theorem expTwoMulFixedIterStateAssertion_pure\n {baseWord exponentWord : EvmWord} {k : Nat}\n {iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3 : Word}\n {ps : PartialState}\n (h :\n expTwoMulFixedIterStateAssertion baseWord ex... | [
{
"name": "expTwoMulFixedIterStateAssertion_full_count_zero",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 445,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automat... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
Bundled fixed-loop iteration state for the Nat-induction EXP path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- The pure invariant carrie... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
Bundled fixed-loop iteration state for the Nat-induction EXP path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- The pure invariant carrie... | @@ -67,6 +67,18 @@
iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3) :=
⟨expTwoMulFixedIterStateAssertion_pcFree⟩
+theorem expTwoMulFixedIterStateAssertion_pure
+ {baseWord exponentWord : EvmWord} {k : Nat}
+ {iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3 : Word}
+ {ps : PartialState}
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0a89085bf42a_4 | cac00b480cb408a0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterState.lean | SavedBitFixedIterState | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 6 | [
{
"theorem_name": "expTwoMulFixedIterStateAssertion_full_result",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n expTwoMulFixedIterStateInvariant_full_result\n (expTwoMulFixedIterStateAssertion_pure h)",
... | [
{
"name": "expTwoMulFixedIterStateAssertion_pure",
"text": "theorem expTwoMulFixedIterStateAssertion_pure\n {baseWord exponentWord : EvmWord} {k : Nat}\n {iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3 : Word}\n {ps : PartialState}\n (h :\n expTwoMulFixedIterStateAssertion baseWord ex... | [
{
"name": "expTwoMulFixedIterStateAssertion_succ_count_ne_zero",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 509,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"auto... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
Bundled fixed-loop iteration state for the Nat-induction EXP path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- The pure invariant carrie... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
Bundled fixed-loop iteration state for the Nat-induction EXP path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- The pure invariant carrie... | @@ -67,6 +67,18 @@
iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3) :=
⟨expTwoMulFixedIterStateAssertion_pcFree⟩
+theorem expTwoMulFixedIterStateAssertion_pure
+ {baseWord exponentWord : EvmWord} {k : Nat}
+ {iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3 : Word}
+ {ps : PartialState}
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0a89085bf42a_5 | 8a1ed81e4efa5c9b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterState.lean | SavedBitFixedIterState | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 6 | [
{
"theorem_name": "expTwoMulFixedIterStateAssertion_full_result",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n expTwoMulFixedIterStateInvariant_full_result\n (expTwoMulFixedIterStateAssertion_pure h)",
... | [
{
"name": "expTwoMulFixedIterStateAssertion_pure",
"text": "theorem expTwoMulFixedIterStateAssertion_pure\n {baseWord exponentWord : EvmWord} {k : Nat}\n {iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3 : Word}\n {ps : PartialState}\n (h :\n expTwoMulFixedIterStateAssertion baseWord ex... | [
{
"name": "expTwoMulFixedIterStateAssertion_succ_count_eq_zero",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 473,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"auto... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
Bundled fixed-loop iteration state for the Nat-induction EXP path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- The pure invariant carrie... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
Bundled fixed-loop iteration state for the Nat-induction EXP path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- The pure invariant carrie... | @@ -66,6 +66,18 @@
iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3) :=
⟨expTwoMulFixedIterStateAssertion_pcFree⟩
+theorem expTwoMulFixedIterStateAssertion_pure
+ {baseWord exponentWord : EvmWord} {k : Nat}
+ {iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3 : Word}
+ {ps : PartialState}
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0a89085bf42a_6 | 554a0a36cf8968b4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterState.lean | SavedBitFixedIterState | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 6 | [
{
"theorem_name": "expTwoMulFixedIterStateAssertion_full_result",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n expTwoMulFixedIterStateInvariant_full_result\n (expTwoMulFixedIterStateAssertion_pure h)",
... | [
{
"name": "expTwoMulFixedIterStateAssertion_pure",
"text": "theorem expTwoMulFixedIterStateAssertion_pure\n {baseWord exponentWord : EvmWord} {k : Nat}\n {iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3 : Word}\n {ps : PartialState}\n (h :\n expTwoMulFixedIterStateAssertion baseWord ex... | [
{
"name": "expTwoMulFixedIterStateAssertion_succ_no_reload",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 28,
"n_chars": 1220,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automat... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
Bundled fixed-loop iteration state for the Nat-induction EXP path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- The pure invariant carrie... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
Bundled fixed-loop iteration state for the Nat-induction EXP path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- The pure invariant carrie... | @@ -88,6 +88,18 @@
iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3) :=
⟨expTwoMulFixedIterStateAssertion_pcFree⟩
+theorem expTwoMulFixedIterStateAssertion_pure
+ {baseWord exponentWord : EvmWord} {k : Nat}
+ {iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3 : Word}
+ {ps : PartialState}
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0a89085bf42a_7 | 416447db658f904e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterState.lean | SavedBitFixedIterState | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 6 | [
{
"theorem_name": "expTwoMulFixedIterStateAssertion_full_result",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n expTwoMulFixedIterStateInvariant_full_result\n (expTwoMulFixedIterStateAssertion_pure h)",
... | [
{
"name": "expTwoMulFixedIterStateAssertion_pure",
"text": "theorem expTwoMulFixedIterStateAssertion_pure\n {baseWord exponentWord : EvmWord} {k : Nat}\n {iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3 : Word}\n {ps : PartialState}\n (h :\n expTwoMulFixedIterStateAssertion baseWord ex... | [
{
"name": "expTwoMulFixedIterStateAssertion_succ_reload",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 30,
"n_chars": 1297,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
Bundled fixed-loop iteration state for the Nat-induction EXP path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- The pure invariant carrie... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
Bundled fixed-loop iteration state for the Nat-induction EXP path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedBoolStep
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCount
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- The pure invariant carrie... | @@ -90,6 +90,18 @@
iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3) :=
⟨expTwoMulFixedIterStateAssertion_pcFree⟩
+theorem expTwoMulFixedIterStateAssertion_pure
+ {baseWord exponentWord : EvmWord} {k : Nat}
+ {iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3 : Word}
+ {ps : PartialState}
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fb0be3bcc9a9_0 | 009bce0696438fb7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN3.lean | LoopIterN3 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 4 | [
{
"theorem_name": "divK_loop_body_n3_max_skip_j0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 77,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hborrow\n let uBase := sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat\n le... | [
{
"name": "loopBodyN3MaxSkipPre_unfold",
"text": "theorem loopBodyN3MaxSkipPre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :\n loopBodyN3MaxSkipPre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld =\n... | [
{
"name": "divK_loop_body_n3_max_skip_j0_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 88,
"n_chars": 4390,
"n_subproofs": 7,
"n_tactics": 80,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 7,
"n_structural": 2,
"automation_o... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN3
Loop body cpsTripleWithin specs for n=3 at j=0 (final iteration).
These are the j=0-specialized versions of the LoopBodyN3 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
... | /-
EvmAsm.Evm64.DivMod.LoopIterN3
Loop body cpsTripleWithin specs for n=3 at j=0 (final iteration).
These are the j=0-specialized versions of the LoopBodyN3 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
... | @@ -43,6 +43,26 @@
((uBase + signExtend12 4064) ↦ₘ uTop) **
(qAddr ↦ₘ qOld)
+theorem loopBodyN3MaxSkipPre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :
+ loopBodyN3MaxSkipPre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1 v2 v3 u0... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fb0be3bcc9a9_1 | a1a10e3927e6a313 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN3.lean | LoopIterN3 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 4 | [
{
"theorem_name": "divK_loop_body_n3_max_skip_j0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 77,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hborrow\n let uBase := sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat\n le... | [
{
"name": "loopBodyN3MaxSkipPre_unfold",
"text": "theorem loopBodyN3MaxSkipPre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :\n loopBodyN3MaxSkipPre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld =\n... | [
{
"name": "divK_loop_body_n3_max_skip_j0_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 80,
"n_chars": 4110,
"n_subproofs": 7,
"n_tactics": 80,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 7,
"n_structural": 2,
"automa... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN3
Loop body cpsTripleWithin specs for n=3 at j=0 (final iteration).
These are the j=0-specialized versions of the LoopBodyN3 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
... | /-
EvmAsm.Evm64.DivMod.LoopIterN3
Loop body cpsTripleWithin specs for n=3 at j=0 (final iteration).
These are the j=0-specialized versions of the LoopBodyN3 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
... | @@ -43,6 +43,26 @@
((uBase + signExtend12 4064) ↦ₘ uTop) **
(qAddr ↦ₘ qOld)
+theorem loopBodyN3MaxSkipPre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :
+ loopBodyN3MaxSkipPre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1 v2 v3 u0... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fb0be3bcc9a9_2 | 027f6879ed20f71b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN3.lean | LoopIterN3 | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 6 | [
{
"theorem_name": "divK_loop_body_n3_call_skip_j0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 105,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let uBase := sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat\n let qAddr := sp +... | [
{
"name": "loopBodyN3CallPre_unfold",
"text": "theorem loopBodyN3CallPre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)\n (retMem dMem dloMem scratchUn0 : Word) :\n loopBodyN3CallPre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0... | [
{
"name": "divK_loop_body_n3_call_skip_j0_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 120,
"n_chars": 6545,
"n_subproofs": 8,
"n_tactics": 114,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 9,
"n_structural": 1,
"automatio... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN3
Loop body cpsTripleWithin specs for n=3 at j=0 (final iteration).
These are the j=0-specialized versions of the LoopBodyN3 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
... | /-
EvmAsm.Evm64.DivMod.LoopIterN3
Loop body cpsTripleWithin specs for n=3 at j=0 (final iteration).
These are the j=0-specialized versions of the LoopBodyN3 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
... | @@ -66,6 +66,31 @@
(sp + signExtend12 3952 ↦ₘ dloMem) **
(sp + signExtend12 3944 ↦ₘ scratchUn0) ** regOwn .x1
+theorem loopBodyN3CallPre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)
+ (retMem dMem dloMem scratchUn0 : Word) :
+ loopBodyN3CallP... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fb0be3bcc9a9_3 | f5074d0b249ae6ee | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN3.lean | LoopIterN3 | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 6 | [
{
"theorem_name": "divK_loop_body_n3_call_skip_j0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 105,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let uBase := sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat\n let qAddr := sp +... | [
{
"name": "loopBodyN3CallPre_unfold",
"text": "theorem loopBodyN3CallPre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)\n (retMem dMem dloMem scratchUn0 : Word) :\n loopBodyN3CallPre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0... | [
{
"name": "divK_loop_body_n3_call_skip_j0_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 112,
"n_chars": 6219,
"n_subproofs": 8,
"n_tactics": 114,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 9,
"n_structural": 1,
"aut... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN3
Loop body cpsTripleWithin specs for n=3 at j=0 (final iteration).
These are the j=0-specialized versions of the LoopBodyN3 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
... | /-
EvmAsm.Evm64.DivMod.LoopIterN3
Loop body cpsTripleWithin specs for n=3 at j=0 (final iteration).
These are the j=0-specialized versions of the LoopBodyN3 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
... | @@ -66,6 +66,31 @@
(sp + signExtend12 3952 ↦ₘ dloMem) **
(sp + signExtend12 3944 ↦ₘ scratchUn0) ** regOwn .x1
+theorem loopBodyN3CallPre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)
+ (retMem dMem dloMem scratchUn0 : Word) :
+ loopBodyN3CallP... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fb0be3bcc9a9_4 | 69f24223c237de79 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN3.lean | LoopIterN3 | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 4 | [
{
"theorem_name": "divK_loop_body_n3_max_skip_j0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 77,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hborrow\n let uBase := sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat\n le... | [
{
"name": "loopBodyN3MaxSkipPre_unfold",
"text": "theorem loopBodyN3MaxSkipPre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :\n loopBodyN3MaxSkipPre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld =\n... | [
{
"name": "divK_loop_body_n3_max_skip_j1_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 90,
"n_chars": 4575,
"n_subproofs": 7,
"n_tactics": 80,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 7,
"n_structural": 2,
"automation_o... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN3
Loop body cpsTripleWithin specs for n=3 at j=0 (final iteration).
These are the j=0-specialized versions of the LoopBodyN3 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
... | /-
EvmAsm.Evm64.DivMod.LoopIterN3
Loop body cpsTripleWithin specs for n=3 at j=0 (final iteration).
These are the j=0-specialized versions of the LoopBodyN3 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
... | @@ -43,6 +43,26 @@
((uBase + signExtend12 4064) ↦ₘ uTop) **
(qAddr ↦ₘ qOld)
+theorem loopBodyN3MaxSkipPre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :
+ loopBodyN3MaxSkipPre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1 v2 v3 u0... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fb0be3bcc9a9_5 | 371ebb77b073f413 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN3.lean | LoopIterN3 | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 4 | [
{
"theorem_name": "divK_loop_body_n3_max_skip_j0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 77,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hborrow\n let uBase := sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat\n le... | [
{
"name": "loopBodyN3MaxSkipPre_unfold",
"text": "theorem loopBodyN3MaxSkipPre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :\n loopBodyN3MaxSkipPre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld =\n... | [
{
"name": "divK_loop_body_n3_max_skip_j1_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 84,
"n_chars": 4376,
"n_subproofs": 7,
"n_tactics": 80,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 7,
"n_structural": 2,
"automa... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN3
Loop body cpsTripleWithin specs for n=3 at j=0 (final iteration).
These are the j=0-specialized versions of the LoopBodyN3 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
... | /-
EvmAsm.Evm64.DivMod.LoopIterN3
Loop body cpsTripleWithin specs for n=3 at j=0 (final iteration).
These are the j=0-specialized versions of the LoopBodyN3 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
... | @@ -43,6 +43,26 @@
((uBase + signExtend12 4064) ↦ₘ uTop) **
(qAddr ↦ₘ qOld)
+theorem loopBodyN3MaxSkipPre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word) :
+ loopBodyN3MaxSkipPre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1 v2 v3 u0... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fb0be3bcc9a9_6 | beb15932f0107fb2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN3.lean | LoopIterN3 | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 6 | [
{
"theorem_name": "divK_loop_body_n3_call_skip_j0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 105,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let uBase := sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat\n let qAddr := sp +... | [
{
"name": "loopBodyN3CallPre_unfold",
"text": "theorem loopBodyN3CallPre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)\n (retMem dMem dloMem scratchUn0 : Word) :\n loopBodyN3CallPre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0... | [
{
"name": "divK_loop_body_n3_call_skip_j1_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 120,
"n_chars": 6513,
"n_subproofs": 8,
"n_tactics": 114,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 9,
"n_structural": 1,
"automatio... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN3
Loop body cpsTripleWithin specs for n=3 at j=0 (final iteration).
These are the j=0-specialized versions of the LoopBodyN3 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
... | /-
EvmAsm.Evm64.DivMod.LoopIterN3
Loop body cpsTripleWithin specs for n=3 at j=0 (final iteration).
These are the j=0-specialized versions of the LoopBodyN3 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
... | @@ -66,6 +66,31 @@
(sp + signExtend12 3952 ↦ₘ dloMem) **
(sp + signExtend12 3944 ↦ₘ scratchUn0) ** regOwn .x1
+theorem loopBodyN3CallPre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)
+ (retMem dMem dloMem scratchUn0 : Word) :
+ loopBodyN3CallP... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fb0be3bcc9a9_7 | 9fe0fc810217cf4d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN3.lean | LoopIterN3 | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 6 | [
{
"theorem_name": "divK_loop_body_n3_call_skip_j0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 105,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let uBase := sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat\n let qAddr := sp +... | [
{
"name": "loopBodyN3CallPre_unfold",
"text": "theorem loopBodyN3CallPre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)\n (retMem dMem dloMem scratchUn0 : Word) :\n loopBodyN3CallPre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0... | [
{
"name": "divK_loop_body_n3_call_skip_j1_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 112,
"n_chars": 6251,
"n_subproofs": 8,
"n_tactics": 114,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 9,
"n_structural": 1,
"aut... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN3
Loop body cpsTripleWithin specs for n=3 at j=0 (final iteration).
These are the j=0-specialized versions of the LoopBodyN3 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
... | /-
EvmAsm.Evm64.DivMod.LoopIterN3
Loop body cpsTripleWithin specs for n=3 at j=0 (final iteration).
These are the j=0-specialized versions of the LoopBodyN3 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
... | @@ -66,6 +66,31 @@
(sp + signExtend12 3952 ↦ₘ dloMem) **
(sp + signExtend12 3944 ↦ₘ scratchUn0) ** regOwn .x1
+theorem loopBodyN3CallPre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)
+ (retMem dMem dloMem scratchUn0 : Word) :
+ loopBodyN3CallP... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fb0be3bcc9a9_8 | c4ccb08c546219ad | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN3.lean | LoopIterN3 | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 6 | [
{
"theorem_name": "divK_loop_body_n3_call_skip_j0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 105,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let uBase := sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat\n let qAddr := sp +... | [
{
"name": "loopBodyN3CallPre_unfold",
"text": "theorem loopBodyN3CallPre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)\n (retMem dMem dloMem scratchUn0 : Word) :\n loopBodyN3CallPre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0... | [
{
"name": "divK_loop_body_n3_call_addback_beq_j0_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 123,
"n_chars": 6668,
"n_subproofs": 8,
"n_tactics": 97,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 10,
"n_structural": 1,
"au... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN3
Loop body cpsTripleWithin specs for n=3 at j=0 (final iteration).
These are the j=0-specialized versions of the LoopBodyN3 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
... | /-
EvmAsm.Evm64.DivMod.LoopIterN3
Loop body cpsTripleWithin specs for n=3 at j=0 (final iteration).
These are the j=0-specialized versions of the LoopBodyN3 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
... | @@ -66,6 +66,31 @@
(sp + signExtend12 3952 ↦ₘ dloMem) **
(sp + signExtend12 3944 ↦ₘ scratchUn0) ** regOwn .x1
+theorem loopBodyN3CallPre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)
+ (retMem dMem dloMem scratchUn0 : Word) :
+ loopBodyN3CallP... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fb0be3bcc9a9_9 | f01f3f30461b0ee5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN3.lean | LoopIterN3 | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 6 | [
{
"theorem_name": "divK_loop_body_n3_call_skip_j0_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 105,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let uBase := sp + signExtend12 4056 - (0 : Word) <<< (3 : BitVec 6).toNat\n let qAddr := sp +... | [
{
"name": "loopBodyN3CallPre_unfold",
"text": "theorem loopBodyN3CallPre_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)\n (retMem dMem dloMem scratchUn0 : Word) :\n loopBodyN3CallPre sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n j v0... | [
{
"name": "divK_loop_body_n3_call_addback_beq_j1_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 119,
"n_chars": 6404,
"n_subproofs": 8,
"n_tactics": 97,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 10,
"n_structural": 1,
"au... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN3
Loop body cpsTripleWithin specs for n=3 at j=0 (final iteration).
These are the j=0-specialized versions of the LoopBodyN3 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
... | /-
EvmAsm.Evm64.DivMod.LoopIterN3
Loop body cpsTripleWithin specs for n=3 at j=0 (final iteration).
These are the j=0-specialized versions of the LoopBodyN3 cpsBranchWithin specs,
using divK_store_loop_j0_spec_within to eliminate the loop-back branch and
produce clean cpsTriples from base+448 to base+904.
... | @@ -66,6 +66,31 @@
(sp + signExtend12 3952 ↦ₘ dloMem) **
(sp + signExtend12 3944 ↦ₘ scratchUn0) ** regOwn .x1
+theorem loopBodyN3CallPre_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ j v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)
+ (retMem dMem dloMem scratchUn0 : Word) :
+ loopBodyN3CallP... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fae137f57158_0 | 8699ede6c5a7a250 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/DenormEpilogueV5Mod.lean | DenormEpilogueV5Mod | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "evm_mod_denorm_epilogue_spec_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let antiShift := signExtend12 (0 : BitVec 12) - shift\n let u0' := (u0 >>> (shift.toNat % 64)) ||| ... | [
{
"name": "divK_mod_epilogue_spec_within_v5_noNop",
"text": "theorem divK_mod_epilogue_spec_within_v5_noNop (sp : Word) (base : Word)\n (u0 u1 u2 u3 v5 v6 v7 v10 m0 m8 m16 m24 : Word) :\n cpsTripleWithin 10 (base + epilogueOff) (base + nopOff) (modCode_noNop_v5 base)\n ((.x12 ↦ᵣ sp) ** (.x5 ↦ᵣ v5... | [
{
"name": "evm_mod_denorm_epilogue_spec_v5_noNop",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 37,
"n_chars": 2027,
"n_subproofs": 5,
"n_tactics": 25,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only"... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.DenormEpilogueV5Mod
v5 mirror of the MOD denorm preamble+body+mod-epilogue tail (denormOff → nopOff),
over `modCode_noNop_v5`. The denorm block (block 9) and the MOD epilogue block
(block 10, `divK_mod_epilogue`) are byte-identical across the div128 v4/v5
migration, so these a... | /-
EvmAsm.Evm64.DivMod.Compose.DenormEpilogueV5Mod
v5 mirror of the MOD denorm preamble+body+mod-epilogue tail (denormOff → nopOff),
over `modCode_noNop_v5`. The denorm block (block 9) and the MOD epilogue block
(block 10, `divK_mod_epilogue`) are byte-identical across the div128 v4/v5
migration, so these a... | @@ -131,6 +131,48 @@
-- remainder), ADDI sp+32, store to output, JAL to NOP.
-- ============================================================================
+theorem divK_mod_epilogue_spec_within_v5_noNop (sp : Word) (base : Word)
+ (u0 u1 u2 u3 v5 v6 v7 v10 m0 m8 m16 m24 : Word) :
+ cpsTripleWithin 10 (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_fae137f57158_1 | e426f231a1b87a82 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/DenormEpilogueV5Mod.lean | DenormEpilogueV5Mod | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "evm_mod_preamble_denorm_epilogue_spec_v5_noNop",
"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_v5_noNop sp shift v5 v6 v7 v2 v10 base hshift_... | [
{
"name": "evm_mod_denorm_epilogue_spec_v5_noNop",
"text": "/-- v5 MOD post-loop denorm + epilogue (shift ≠ 0), over `modCode_noNop_v5`. -/\ntheorem evm_mod_denorm_epilogue_spec_v5_noNop (sp base : Word)\n (u0 u1 u2 u3 v2 v5 v7 v10 shift : Word)\n (m0 m8 m16 m24 : Word) :\n cpsTripleWithin (23 + 10... | [
{
"name": "evm_mod_preamble_denorm_epilogue_spec_v5_noNop",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 36,
"n_chars": 1882,
"n_subproofs": 5,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automat... | 4 | /-
EvmAsm.Evm64.DivMod.Compose.DenormEpilogueV5Mod
v5 mirror of the MOD denorm preamble+body+mod-epilogue tail (denormOff → nopOff),
over `modCode_noNop_v5`. The denorm block (block 9) and the MOD epilogue block
(block 10, `divK_mod_epilogue`) are byte-identical across the div128 v4/v5
migration, so these a... | /-
EvmAsm.Evm64.DivMod.Compose.DenormEpilogueV5Mod
v5 mirror of the MOD denorm preamble+body+mod-epilogue tail (denormOff → nopOff),
over `modCode_noNop_v5`. The denorm block (block 9) and the MOD epilogue block
(block 10, `divK_mod_epilogue`) are byte-identical across the div128 v4/v5
migration, so these a... | @@ -223,6 +223,42 @@
(fun h hq => by xperm_hyp hq)
h12
+/-- v5 MOD post-loop denorm + epilogue (shift ≠ 0), over `modCode_noNop_v5`. -/
+theorem evm_mod_denorm_epilogue_spec_v5_noNop (sp base : Word)
+ (u0 u1 u2 u3 v2 v5 v7 v10 shift : Word)
+ (m0 m8 m16 m24 : Word) :
+ cpsTripleWithin (23 + 10) (b... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fae137f57158_2 | 306b947961599b42 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/DenormEpilogueV5Mod.lean | DenormEpilogueV5Mod | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "evm_mod_denorm_epilogue_spec_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let antiShift := signExtend12 (0 : BitVec 12) - shift\n let u0' := (u0 >>> (shift.toNat % 64)) ||| ... | [
{
"name": "divK_mod_epilogue_spec_within_v5_noNop",
"text": "theorem divK_mod_epilogue_spec_within_v5_noNop (sp : Word) (base : Word)\n (u0 u1 u2 u3 v5 v6 v7 v10 m0 m8 m16 m24 : Word) :\n cpsTripleWithin 10 (base + epilogueOff) (base + nopOff) (modCode_noNop_v5 base)\n ((.x12 ↦ᵣ sp) ** (.x5 ↦ᵣ v5... | [
{
"name": "evm_mod_shift0_epilogue_spec_v5_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 71,
"n_chars": 4037,
"n_subproofs": 13,
"n_tactics": 46,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 3,
"n_structural": 7,
"automation_only... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.DenormEpilogueV5Mod
v5 mirror of the MOD denorm preamble+body+mod-epilogue tail (denormOff → nopOff),
over `modCode_noNop_v5`. The denorm block (block 9) and the MOD epilogue block
(block 10, `divK_mod_epilogue`) are byte-identical across the div128 v4/v5
migration, so these a... | /-
EvmAsm.Evm64.DivMod.Compose.DenormEpilogueV5Mod
v5 mirror of the MOD denorm preamble+body+mod-epilogue tail (denormOff → nopOff),
over `modCode_noNop_v5`. The denorm block (block 9) and the MOD epilogue block
(block 10, `divK_mod_epilogue`) are byte-identical across the div128 v4/v5
migration, so these a... | @@ -24,6 +24,48 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (bv64_4mul_3)
+theorem divK_mod_epilogue_spec_within_v5_noNop (sp : Word) (base : Word)
+ (u0 u1 u2 u3 v5 v6 v7 v10 m0 m8 m16 m24 : Word) :
+ cpsTripleWithin 10 (base + epilogueOff) (base + nopOff) (modCode_noNop_v5 base)
+ ((.x12 ↦ᵣ 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_70b2e2b73694_0 | a1d9ebd028c58ade | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/TransactionCall.lean | TransactionCall | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "toCallFrame?_callee",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [toCallFrame?_some tx h_to] at h_frame\n injection h_frame with h_frame\n rw [← h_frame]\n rfl",
"n_chars": 1... | [
{
"name": "toCallFrame?_some",
"text": "theorem toCallFrame?_some\n (tx : Transaction) {callee : Address} (h_to : tx.to = some callee) :\n tx.toCallFrame? = some (CallFrame.forCall tx.sender callee tx.value tx.data tx.gasLimit false) := by\n simp [toCallFrame?, h_to]\n\n",
"fan_in": 1,
"n_lin... | [
{
"name": "toCallFrame?_callee",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 301,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_ne... | 1 | /-
EvmAsm.EL.TransactionCall
Bridge from validated transactions to message-call frames for GH #122.
-/
import EvmAsm.EL.Transaction
import EvmAsm.EL.MessageCall
namespace EvmAsm.EL
namespace Transaction
/--
Initial message-call frame for ordinary transactions. Contract-creation
transactions (`to = none`) ar... | /-
EvmAsm.EL.TransactionCall
Bridge from validated transactions to message-call frames for GH #122.
-/
import EvmAsm.EL.Transaction
import EvmAsm.EL.MessageCall
namespace EvmAsm.EL
namespace Transaction
/--
Initial message-call frame for ordinary transactions. Contract-creation
transactions (`to = none`) ar... | @@ -19,10 +19,19 @@
| none => none
| some callee => some (CallFrame.forCall tx.sender callee tx.value tx.data tx.gasLimit false)
+theorem toCallFrame?_some
+ (tx : Transaction) {callee : Address} (h_to : tx.to = some callee) :
+ tx.toCallFrame? = some (CallFrame.forCall tx.sender callee tx.value tx.data t... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fd4e68dc0ce1_0 | cd6e55bd60fb38a3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2V4NoNopMTM.lean | FullPathN2V4NoNopMTM | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "divK_loop_n2_max_call_max_from_source_exact_loopIterScratch_v4_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 149,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loopN2MaxCallMaxSourceConds_unfold] at hconds\n simp only [r2MT... | [
{
"name": "loopN2MaxCallMaxSourceFinalPostNoX1_unfold",
"text": "theorem loopN2MaxCallMaxSourceFinalPostNoX1_unfold (sp base : Word)\n (v0 v1 v2 v3 u0 u1 u2 u3 uTop u0Orig1 u0Orig0 raVal scratchMem : Word) :\n loopN2MaxCallMaxSourceFinalPostNoX1 sp base\n v0 v1 v2 v3 u0 u1 u2 u3 uTop u0Orig1 u0Or... | [
{
"name": "divK_loop_n2_max_call_max_from_source_exact_loopIterScratch_v4_noNop",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 171,
"n_chars": 8299,
"n_subproofs": 6,
"n_tactics": 145,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_stru... | 4 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V4NoNopMTM
Three-iteration max-call-max composition for the n=2 v4/no-NOP source path.
j=2 takes the max-trial branch; j=1 takes the callable trial-division (call)
path; j=0 takes the max-trial branch.
Conditions: bltu_2=false (max), bltu_1=true (call), bltu_0=false (... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V4NoNopMTM
Three-iteration max-call-max composition for the n=2 v4/no-NOP source path.
j=2 takes the max-trial branch; j=1 takes the callable trial-division (call)
path; j=0 takes the max-trial branch.
Conditions: bltu_2=false (max), bltu_1=true (call), bltu_0=false (... | @@ -69,6 +69,32 @@
((uBase2 + signExtend12 4064 ↦ₘ r2.2.2.2.2.2) **
(qAddr2 ↦ₘ r2.1))))
+theorem loopN2MaxCallMaxSourceFinalPostNoX1_unfold (sp base : Word)
+ (v0 v1 v2 v3 u0 u1 u2 u3 uTop u0Orig1 u0Orig0 raVal scratchMem : Word) :
+ loopN2MaxCallMaxSourceFinalPostNoX1 sp base
+ v0 v1 v2 v3 u0... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b8ee6bf96194_0 | 2971e3d21ad7c372 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/TerminatingArgsStackDecode.lean | TerminatingArgsStackDecode | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "decodeTerminatingStack?_eq_some_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases kind with\n | stop => exact decodeTerminatingStack?_stop_eq_some_iff stack decoded\n | return_ ... | [
{
"name": "decodeTerminatingStack?_revert_eq_some_iff",
"text": "theorem decodeTerminatingStack?_revert_eq_some_iff\n (stack : List EvmWord) (decoded : Decoded) :\n decodeTerminatingStack? .revert stack = some decoded ↔\n ∃ offset size rest,\n stack = offset :: size :: rest ∧\n de... | [
{
"name": "decodeTerminatingStack?_eq_some_iff",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 27,
"n_chars": 1149,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 6,
"automation_only": f... | 5 | /-
EvmAsm.Evm64.TerminatingArgsStackDecode
Pure top-of-stack decoders for frame-terminating opcode arguments
(GH #113).
-/
import EvmAsm.Evm64.TerminatingArgs
namespace EvmAsm.Evm64
namespace TerminatingArgsStackDecode
open TerminatingArgs
inductive Decoded where
| stop
| return_ (args : Args)
| rever... | /-
EvmAsm.Evm64.TerminatingArgsStackDecode
Pure top-of-stack decoders for frame-terminating opcode arguments
(GH #113).
-/
import EvmAsm.Evm64.TerminatingArgs
namespace EvmAsm.Evm64
namespace TerminatingArgsStackDecode
open TerminatingArgs
inductive Decoded where
| stop
| return_ (args : Args)
| rever... | @@ -105,6 +105,21 @@
· rintro ⟨offset, size, rest, rfl, rfl⟩
rfl
+theorem decodeTerminatingStack?_revert_eq_some_iff
+ (stack : List EvmWord) (decoded : Decoded) :
+ decodeTerminatingStack? .revert stack = some decoded ↔
+ ∃ offset size rest,
+ stack = offset :: size :: rest ∧
+ dec... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b8ee6bf96194_1 | d263e5a447598370 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/TerminatingArgsStackDecode.lean | TerminatingArgsStackDecode | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "decodeTerminatingStack?_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 | stop => exact decodeTerminatingStack?_stop_eq_none_iff stack\n | return_ => exact... | [
{
"name": "decodeTerminatingStack?_revert_eq_none_iff",
"text": "theorem decodeTerminatingStack?_revert_eq_none_iff (stack : List EvmWord) :\n decodeTerminatingStack? .revert stack = none ↔\n stack.length < stackArgumentCount .revert := by\n constructor\n · intro h_decode\n rcases stack with _ ... | [
{
"name": "decodeTerminatingStack?_eq_none_iff",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 11,
"n_chars": 559,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 6,
"automation_only": fa... | 5 | /-
EvmAsm.Evm64.TerminatingArgsStackDecode
Pure top-of-stack decoders for frame-terminating opcode arguments
(GH #113).
-/
import EvmAsm.Evm64.TerminatingArgs
namespace EvmAsm.Evm64
namespace TerminatingArgsStackDecode
open TerminatingArgs
inductive Decoded where
| stop
| return_ (args : Args)
| rever... | /-
EvmAsm.Evm64.TerminatingArgsStackDecode
Pure top-of-stack decoders for frame-terminating opcode arguments
(GH #113).
-/
import EvmAsm.Evm64.TerminatingArgs
namespace EvmAsm.Evm64
namespace TerminatingArgsStackDecode
open TerminatingArgs
inductive Decoded where
| stop
| return_ (args : Args)
| rever... | @@ -100,6 +100,22 @@
· simp [stackArgumentCount] at h_len
omega
+theorem decodeTerminatingStack?_revert_eq_none_iff (stack : List EvmWord) :
+ decodeTerminatingStack? .revert stack = none ↔
+ stack.length < stackArgumentCount .revert := by
+ constructor
+ · intro h_decode
+ rcases stack with ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_0 | a57e65e7b4be1951 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 8 | [
{
"theorem_name": "rippleNegWord_of_sign_one",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n set v := EvmWord.fromLimbs (fun i : Fin 4 =>\n match i with | 0 => limb0 | 1 => limb1 | 2 => limb2 | 3 => lim... | [
{
"name": "evmWord_neg_eq_not_add",
"text": "/-- Helper: `-v = ~~~v + 1` (two's complement for EvmWord). -/\nprivate theorem evmWord_neg_eq_not_add (v : EvmWord) : -v = ~~~v + 1 := by bv_omega\n\n",
"fan_in": 8,
"n_lines": 4,
"n_chars": 148,
"n_subproofs": 0,
"n_tactics": 1,
"cycloma... | [
{
"name": "rippleNegWord_of_sign_one",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 40,
"n_chars": 2237,
"n_subproofs": 13,
"n_tactics": 45,
"cyclomatic": 4,
"n_automation": 12,
"n_rewrites": 8,
"n_structural": 11,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -32,6 +32,9 @@
match i with
| 0 => sum0 | 1 => sum1 | 2 => sum2 | 3 => sum3
+/-- Helper: `-v = ~~~v + 1` (two's complement for EvmWord). -/
+private theorem evmWord_neg_eq_not_add (v : EvmWord) : -v = ~~~v + 1 := by bv_omega
+
/-- With `sign = 1` the ripple-negation computes the two's-complement negatio... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_1 | 6cd386ad1cfbfe85 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "sdivResultSign_fixZeroLimb3",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := sdivResultSign_fixZeroLimbs dividendTop divisorTop\n simpa using h.2.2.2",
"n_chars": 88,
"n... | [
{
"name": "sdivResultSign_fixZeroLimbs",
"text": "/-- Conditional negation by the SDIV result sign leaves the zero quotient\n limbs equal to zero. The carries may be used internally by the sign-fix\n block, but the four memory-result limbs remain zero. -/\ntheorem sdivResultSign_fixZeroLimbs\n (div... | [
{
"name": "sdivResultSign_fixZeroLimb3",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 825,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -57,6 +57,28 @@
((dividendTop >>> (63 : BitVec 6).toNat) ^^^
(divisorTop >>> (63 : BitVec 6).toNat))
+/-- Conditional negation by the SDIV result sign leaves the zero quotient
+ limbs equal to zero. The carries may be used internally by the sign-fix
+ block, but the four memory-result limbs remai... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_2 | 9c3bdb46e934bced | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "sdivResultSign_fixZeroWordLimb3",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [EvmWord.getLimbN_zero 0, EvmWord.getLimbN_zero 1,\n EvmWord.getLimbN_zero 2, EvmWord.getLimbN_zero 3... | [
{
"name": "sdivResultSign_fixZeroLimb3",
"text": "/-- Top output limb of result-sign-fix is zero when the unsigned quotient is\n zero. -/\ntheorem sdivResultSign_fixZeroLimb3\n (dividendTop divisorTop : Word) :\n let resultSign :=\n (dividendTop >>> (63 : BitVec 6).toNat) ^^^\n (divisor... | [
{
"name": "sdivResultSign_fixZeroWordLimb3",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 22,
"n_chars": 1085,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false... | 2 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -79,6 +79,25 @@
· simp only [bv6_63_toNat, h1, h2]
decide
+/-- Top output limb of result-sign-fix is zero when the unsigned quotient is
+ zero. -/
+theorem sdivResultSign_fixZeroLimb3
+ (dividendTop divisorTop : Word) :
+ let resultSign :=
+ (dividendTop >>> (63 : BitVec 6).toNat) ^^^
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_3 | 2caf38e23ac001f4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 4 | [
{
"theorem_name": "sdivAbsDividendWord_of_sign_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold sdivAbsDividendWord\n exact rippleNegWord_of_sign_zero _ _ _ _ _ hSign",
"n_chars": 83,
"n... | [
{
"name": "rippleNegWord_of_sign_zero",
"text": "/-- With `sign = 0` the ripple-negation is the identity: it returns the source\n word assembled from the four limbs. -/\ntheorem rippleNegWord_of_sign_zero\n (limb0 limb1 limb2 limb3 sign : Word) (hSign : sign = 0) :\n rippleNegWord limb0 limb1 limb2... | [
{
"name": "sdivAbsDividendWord_of_sign_zero",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 505,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false... | 1 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -32,6 +32,20 @@
match i with
| 0 => sum0 | 1 => sum1 | 2 => sum2 | 3 => sum3
+/-- With `sign = 0` the ripple-negation is the identity: it returns the source
+ word assembled from the four limbs. -/
+theorem rippleNegWord_of_sign_zero
+ (limb0 limb1 limb2 limb3 sign : Word) (hSign : sign = 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_4cb79c912976_4 | 4b6a1ceadd67c483 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 8 | [
{
"theorem_name": "sdivAbsDividendWord_eq_word_of_sign_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sdivAbsDividendWord_of_sign_zero _ _ _ _ hSign]\n exact sdivWord_from_getLimbN dividend",
... | [
{
"name": "sdivWord_from_getLimbN",
"text": "/-- Four concrete `getLimbN` projections assemble back to their source word. -/\ntheorem sdivWord_from_getLimbN (v : EvmWord) :\n EvmWord.fromLimbs (fun i : Fin 4 =>\n match i with\n | 0 => v.getLimbN 0 | 1 => v.getLimbN 1 | 2 => v.getLimbN 2 | 3 => ... | [
{
"name": "sdivAbsDividendWord_eq_word_of_sign_zero",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 11,
"n_chars": 541,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only... | 3 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -83,13 +83,29 @@
unfold sdivAbsDividendWord
exact rippleNegWord_of_sign_zero _ _ _ _ _ hSign
+/-- Four concrete `getLimbN` projections assemble back to their source word. -/
+theorem sdivWord_from_getLimbN (v : EvmWord) :
+ EvmWord.fromLimbs (fun i : Fin 4 =>
+ match i with
+ | 0 => v.getLimbN 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_4cb79c912976_5 | 411b09cf1bb1ac95 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 8 | [
{
"theorem_name": "sdivAbsDividendWord_eq_word_of_sign_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sdivAbsDividendWord_of_sign_zero _ _ _ _ hSign]\n exact sdivWord_from_getLimbN dividend",
... | [
{
"name": "sdivWord_from_getLimbN",
"text": "/-- Four concrete `getLimbN` projections assemble back to their source word. -/\ntheorem sdivWord_from_getLimbN (v : EvmWord) :\n EvmWord.fromLimbs (fun i : Fin 4 =>\n match i with\n | 0 => v.getLimbN 0 | 1 => v.getLimbN 1 | 2 => v.getLimbN 2 | 3 => ... | [
{
"name": "sdivAbsDividendWord_eq_neg_word_of_sign_one",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 11,
"n_chars": 526,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_o... | 3 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -99,13 +99,29 @@
((dividendTop >>> (63 : BitVec 6).toNat) ^^^
(divisorTop >>> (63 : BitVec 6).toNat))
+/-- Four concrete `getLimbN` projections assemble back to their source word. -/
+theorem sdivWord_from_getLimbN (v : EvmWord) :
+ EvmWord.fromLimbs (fun i : Fin 4 =>
+ match i with
+ | 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_4cb79c912976_6 | 3477993a6ba6b73f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 4 | [
{
"theorem_name": "sdivAbsDividendWord_of_sign_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold sdivAbsDividendWord\n exact rippleNegWord_of_sign_zero _ _ _ _ _ hSign",
"n_chars": 83,
"n... | [
{
"name": "rippleNegWord_of_sign_zero",
"text": "/-- With `sign = 0` the ripple-negation is the identity: it returns the source\n word assembled from the four limbs. -/\ntheorem rippleNegWord_of_sign_zero\n (limb0 limb1 limb2 limb3 sign : Word) (hSign : sign = 0) :\n rippleNegWord limb0 limb1 limb2... | [
{
"name": "sdivAbsDivisorWord_of_sign_zero",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 500,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,... | 1 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -32,6 +32,20 @@
match i with
| 0 => sum0 | 1 => sum1 | 2 => sum2 | 3 => sum3
+/-- With `sign = 0` the ripple-negation is the identity: it returns the source
+ word assembled from the four limbs. -/
+theorem rippleNegWord_of_sign_zero
+ (limb0 limb1 limb2 limb3 sign : Word) (hSign : sign = 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_4cb79c912976_7 | 76c7ccc3fa16894a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 3 | [
{
"theorem_name": "sdivAbsDivisorWord_eq_word_of_sign_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sdivAbsDivisorWord_of_sign_zero _ _ _ _ hSign]\n exact sdivWord_from_getLimbN divisor",
"n... | [
{
"name": "sdivAbsDivisorWord_of_sign_zero",
"text": "/-- If the divisor sign bit is zero, the divisor absolute-value word is just the\n original four-limb word. -/\ntheorem sdivAbsDivisorWord_of_sign_zero\n (limb0 limb1 limb2 top : Word)\n (hSign : top >>> (63 : BitVec 6).toNat = (0 : Word)) :\n ... | [
{
"name": "sdivAbsDivisorWord_eq_word_of_sign_zero",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 11,
"n_chars": 527,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only"... | 3 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -85,13 +85,27 @@
all_goals (first | (exact (EvmWord.getLimbN_lt v _ (by omega)).symm) | omega)
rw [heq]; exact EvmWord.fromLimbs_getLimb v
+/-- If the divisor sign bit is zero, the divisor absolute-value word is just the
+ original four-limb word. -/
+theorem sdivAbsDivisorWord_of_sign_zero
+ (limb0 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_8 | 4e909d7210847919 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 8 | [
{
"theorem_name": "sdivAbsDividendWord_eq_word_of_sign_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sdivAbsDividendWord_of_sign_zero _ _ _ _ hSign]\n exact sdivWord_from_getLimbN dividend",
... | [
{
"name": "sdivWord_from_getLimbN",
"text": "/-- Four concrete `getLimbN` projections assemble back to their source word. -/\ntheorem sdivWord_from_getLimbN (v : EvmWord) :\n EvmWord.fromLimbs (fun i : Fin 4 =>\n match i with\n | 0 => v.getLimbN 0 | 1 => v.getLimbN 1 | 2 => v.getLimbN 2 | 3 => ... | [
{
"name": "sdivAbsDivisorWord_eq_neg_word_of_sign_one",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 11,
"n_chars": 514,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_on... | 3 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -99,13 +99,29 @@
((dividendTop >>> (63 : BitVec 6).toNat) ^^^
(divisorTop >>> (63 : BitVec 6).toNat))
+/-- Four concrete `getLimbN` projections assemble back to their source word. -/
+theorem sdivWord_from_getLimbN (v : EvmWord) :
+ EvmWord.fromLimbs (fun i : Fin 4 =>
+ match i with
+ | 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_4cb79c912976_9 | da01bd512a8a209c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 4 | [
{
"theorem_name": "sdivAbsDividendWord_of_sign_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold sdivAbsDividendWord\n exact rippleNegWord_of_sign_zero _ _ _ _ _ hSign",
"n_chars": 83,
"n... | [
{
"name": "rippleNegWord_of_sign_zero",
"text": "/-- With `sign = 0` the ripple-negation is the identity: it returns the source\n word assembled from the four limbs. -/\ntheorem rippleNegWord_of_sign_zero\n (limb0 limb1 limb2 limb3 sign : Word) (hSign : sign = 0) :\n rippleNegWord limb0 limb1 limb2... | [
{
"name": "sdivResultSignFixedWord_of_result_sign_zero",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 663,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_o... | 1 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -32,6 +32,20 @@
match i with
| 0 => sum0 | 1 => sum1 | 2 => sum2 | 3 => sum3
+/-- With `sign = 0` the ripple-negation is the identity: it returns the source
+ word assembled from the four limbs. -/
+theorem rippleNegWord_of_sign_zero
+ (limb0 limb1 limb2 limb3 sign : Word) (hSign : sign = 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_4cb79c912976_10 | bb360d068ba633b3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "sdivResultSignFixedWord_eq_word_of_result_sign_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sdivResultSignFixedWord_of_result_sign_zero _ _ _ _ _ _ hSign]\n exact sdivWord_fr... | [
{
"name": "sdivResultSignFixedWord_of_result_sign_zero",
"text": "/-- If the SDIV result sign is zero, the result-sign-fix word is just the\n unsigned quotient word assembled from its four limbs. -/\ntheorem sdivResultSignFixedWord_of_result_sign_zero\n (dividendTop divisorTop limb0 limb1 limb2 limb3 ... | [
{
"name": "sdivResultSignFixedWord_eq_word_of_result_sign_zero",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 15,
"n_chars": 697,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"auto... | 3 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -85,6 +85,20 @@
all_goals (first | (exact (EvmWord.getLimbN_lt v _ (by omega)).symm) | omega)
rw [heq]; exact EvmWord.fromLimbs_getLimb v
+/-- If the SDIV result sign is zero, the result-sign-fix word is just the
+ unsigned quotient word assembled from its four limbs. -/
+theorem sdivResultSignFixedWord... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_11 | 081531dc71801e95 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 8 | [
{
"theorem_name": "sdivAbsDividendWord_eq_word_of_sign_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sdivAbsDividendWord_of_sign_zero _ _ _ _ hSign]\n exact sdivWord_from_getLimbN dividend",
... | [
{
"name": "sdivWord_from_getLimbN",
"text": "/-- Four concrete `getLimbN` projections assemble back to their source word. -/\ntheorem sdivWord_from_getLimbN (v : EvmWord) :\n EvmWord.fromLimbs (fun i : Fin 4 =>\n match i with\n | 0 => v.getLimbN 0 | 1 => v.getLimbN 1 | 2 => v.getLimbN 2 | 3 => ... | [
{
"name": "sdivResultSignFixedWord_eq_neg_word_of_result_sign_one",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 14,
"n_chars": 652,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"a... | 3 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -99,6 +99,20 @@
((dividendTop >>> (63 : BitVec 6).toNat) ^^^
(divisorTop >>> (63 : BitVec 6).toNat))
+/-- Four concrete `getLimbN` projections assemble back to their source word. -/
+theorem sdivWord_from_getLimbN (v : EvmWord) :
+ EvmWord.fromLimbs (fun i : Fin 4 =>
+ match i with
+ | 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_4cb79c912976_12 | e15a5fa608c8d7c2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 2 | [
{
"theorem_name": "sdivAbsDivisorWord_sign_split",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases ushr63_bool (divisor.getLimbN 3) with h | h\n · simp only [bv6_63_toNat, h]\n exact sdivAbsDivisor... | [
{
"name": "sdivAbsDivisorWord_eq_neg_word_of_sign_one",
"text": "/-- If the divisor sign bit is one, the SDIV absolute-value helper returns the\n two's-complement negation of the divisor word. -/\ntheorem sdivAbsDivisorWord_eq_neg_word_of_sign_one\n (divisor : EvmWord)\n (hSign : divisor.getLimbN 3... | [
{
"name": "sdivAbsDivisorWord_sign_split",
"fan_in": 3,
"n_deps_direct": 3,
"n_deps_transitive": 7,
"n_lines": 22,
"n_chars": 899,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
... | 7 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -149,6 +149,16 @@
rw [sdivAbsDivisorWord_of_sign_zero _ _ _ _ hSign]
exact sdivWord_from_getLimbN divisor
+/-- If the divisor sign bit is one, the SDIV absolute-value helper returns the
+ two's-complement negation of the divisor word. -/
+theorem sdivAbsDivisorWord_eq_neg_word_of_sign_one
+ (divisor : ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_13 | 1dfdae1da26ce43c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 3 | [
{
"theorem_name": "sdivAbsDivisorWord_eq_zero_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · intro h\n rw [sdivAbsDivisorWord_sign_split] at h\n split_ifs at h with hsign\n ·... | [
{
"name": "sdivAbsDivisorWord_sign_split",
"text": "/-- The SDIV divisor absolute-value normalization either leaves the word\n unchanged or computes its two's-complement negation, depending on the\n caller-visible sign bit. -/\ntheorem sdivAbsDivisorWord_sign_split\n (divisor : EvmWord) :\n sdiv... | [
{
"name": "sdivAbsDivisorWord_eq_zero_iff",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 9,
"n_lines": 22,
"n_chars": 794,
"n_subproofs": 1,
"n_tactics": 14,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 6,
"automation_only": false,... | 9 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -166,6 +166,27 @@
sdivAbsDivisorWord 0 0 0 0 = 0 := by
decide
+/-- The SDIV divisor absolute-value normalization either leaves the word
+ unchanged or computes its two's-complement negation, depending on the
+ caller-visible sign bit. -/
+theorem sdivAbsDivisorWord_sign_split
+ (divisor : EvmWord)... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_14 | 99c69efd5bb8c29d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 3 | [
{
"theorem_name": "sdivAbsDivisorWord_eq_zero_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · intro h\n rw [sdivAbsDivisorWord_sign_split] at h\n split_ifs at h with hsign\n ·... | [
{
"name": "sdivAbsDivisorWord_sign_split",
"text": "/-- The SDIV divisor absolute-value normalization either leaves the word\n unchanged or computes its two's-complement negation, depending on the\n caller-visible sign bit. -/\ntheorem sdivAbsDivisorWord_sign_split\n (divisor : EvmWord) :\n sdiv... | [
{
"name": "sdivAbsDivisorWord_ne_zero_of_ne_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 10,
"n_lines": 11,
"n_chars": 455,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only":... | 10 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -166,6 +166,27 @@
sdivAbsDivisorWord 0 0 0 0 = 0 := by
decide
+/-- The SDIV divisor absolute-value normalization either leaves the word
+ unchanged or computes its two's-complement negation, depending on the
+ caller-visible sign bit. -/
+theorem sdivAbsDivisorWord_sign_split
+ (divisor : EvmWord)... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_15 | 539dc52e08d24017 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 3 | [
{
"theorem_name": "sdivAbsDivisorWord_eq_zero_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · intro h\n rw [sdivAbsDivisorWord_sign_split] at h\n split_ifs at h with hsign\n ·... | [
{
"name": "sdivAbsDivisorWord_sign_split",
"text": "/-- The SDIV divisor absolute-value normalization either leaves the word\n unchanged or computes its two's-complement negation, depending on the\n caller-visible sign bit. -/\ntheorem sdivAbsDivisorWord_sign_split\n (divisor : EvmWord) :\n sdiv... | [
{
"name": "sdivAbsDivisorWord_zero_sign",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 11,
"n_chars": 405,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 8 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -159,6 +159,27 @@
unfold sdivAbsDivisorWord
rw [rippleNegWord_of_sign_one _ _ _ _ _ hSign, sdivWord_from_getLimbN]
+/-- The SDIV divisor absolute-value normalization either leaves the word
+ unchanged or computes its two's-complement negation, depending on the
+ caller-visible sign bit. -/
+theorem sdi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_16 | 8ebed30f3a86a3f5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 3 | [
{
"theorem_name": "sdivAbsDivisorWord_eq_zero_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · intro h\n rw [sdivAbsDivisorWord_sign_split] at h\n split_ifs at h with hsign\n ·... | [
{
"name": "sdivAbsDivisorWord_sign_split",
"text": "/-- The SDIV divisor absolute-value normalization either leaves the word\n unchanged or computes its two's-complement negation, depending on the\n caller-visible sign bit. -/\ntheorem sdivAbsDivisorWord_sign_split\n (divisor : EvmWord) :\n sdiv... | [
{
"name": "sdivAbsDivisorWord_one_sign",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 15,
"n_chars": 521,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 8 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -159,6 +159,27 @@
unfold sdivAbsDivisorWord
rw [rippleNegWord_of_sign_one _ _ _ _ _ hSign, sdivWord_from_getLimbN]
+/-- The SDIV divisor absolute-value normalization either leaves the word
+ unchanged or computes its two's-complement negation, depending on the
+ caller-visible sign bit. -/
+theorem sdi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "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.