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_4ba81c03c9f4_5 | 4cb7fafea98ce4a4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2V5NormScaled.lean | N2V5NormScaled | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "fullDivN2_acc_quot_eq_div_of_shape",
"depth": 1,
"n_commands": 0,
"n_lines": 39,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h0 : (0:Word).toNat = 0 := rfl\n have hfwv := fullDivN2_first_window_valid a0 a1 a2 a3 b0 b1 b2 b... | [
{
"name": "fullDivN2R2V5_step_of_shape",
"text": "/-- **First-digit (R2) step over the normalized window.** Rewrites\n `fullDivN2R2V5` to expose `iterN2V5` over the 2-limb `normV` (using the\n shift≠0 shape lemmas) and applies the unified per-digit step\n `iterN2V5_step`. Gives the clean 2-limb Eu... | [
{
"name": "fullDivN2_normalized_euclidean_of_shape",
"fan_in": 0,
"n_deps_direct": 9,
"n_deps_transitive": 12,
"n_lines": 59,
"n_chars": 5515,
"n_subproofs": 18,
"n_tactics": 41,
"cyclomatic": 1,
"n_automation": 9,
"n_rewrites": 7,
"n_structural": 2,
"automation_o... | 12 | /-
EvmAsm.Evm64.DivMod.Spec.N2V5NormScaled
The n=2 val256-scaling normalization bridges — the divisor and dividend, after
the CLZ-of-`b1` left shift, have value equal to the original scaled by
`2^shift` (with the dividend carrying an overflow limb).
These are the n=2 analogs of `fullDivN1NormU_val256_eq_sca... | /-
EvmAsm.Evm64.DivMod.Spec.N2V5NormScaled
The n=2 val256-scaling normalization bridges — the divisor and dividend, after
the CLZ-of-`b1` left shift, have value equal to the original scaled by
`2^shift` (with the dividend carrying an overflow limb).
These are the n=2 analogs of `fullDivN1NormU_val256_eq_sca... | @@ -78,6 +78,48 @@
rw [hsmod, antiShift_toNat_mod_eq h_shift_pos (clzResult_fst_toNat_le b1)]
exact EvmWord.val256_normalize h_shift_pos (by omega) b0 b1 0 0 (by simp)
+/-- **First-digit (R2) step over the normalized window.** Rewrites
+ `fullDivN2R2V5` to expose `iterN2V5` over the 2-limb `normV` (using the... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ad7816ac1ad1_0 | 52bb670288a4d760 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Shift/ShlSemantic.lean | ShlSemantic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "shl_zero_lift_within",
"depth": 1,
"n_commands": 0,
"n_lines": 42,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n subst hresult\n have hframed := cpsTripleWithin_frameR\n ((.x6 ↦ᵣ r6) ** (.x7 ↦ᵣ r7) ** (.x11 ↦ᵣ r11))\n (by p... | [
{
"name": "shl_zero_evmWord_weaken",
"text": "/-- Weaken: zero-result + frame regs → evmWordIs 0 + regOwn. -/\nprivate theorem shl_zero_evmWord_weaken (sp : Word) {s0 s1 s2 s3 : Word} (r6 r7 r11 : Word) :\n ∀ h,\n ((.x12 ↦ᵣ (sp + 32)) ** (regOwn .x5) ** (.x0 ↦ᵣ (0 : Word)) ** (regOwn .x10) **\n (s... | [
{
"name": "shl_zero_lift_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 71,
"n_chars": 4335,
"n_subproofs": 4,
"n_tactics": 42,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max... | 1 | /-
EvmAsm.Evm64.Shift.ShlSemantic
256-bit shift semantics: the main SHL theorem connecting the RISC-V
implementation to EvmWord-level shift.
Main result: `evm_shl_stack_spec` states that `evm_shl` computes
`if shift.toNat ≥ 256 then 0 else value <<< shift.toNat`.
-/
-- `Shift.ShlCompose` transitively impor... | /-
EvmAsm.Evm64.Shift.ShlSemantic
256-bit shift semantics: the main SHL theorem connecting the RISC-V
implementation to EvmWord-level shift.
Main result: `evm_shl_stack_spec` states that `evm_shl` computes
`if shift.toNat ≥ 256 then 0 else value <<< shift.toNat`.
-/
-- `Shift.ShlCompose` transitively impor... | @@ -24,6 +24,38 @@
-- `regIs_to_regOwn` lives in `Rv64/SepLogic.lean` (shared).
+/-- Weaken: zero-result + frame regs → evmWordIs 0 + regOwn. -/
+private theorem shl_zero_evmWord_weaken (sp : Word) {s0 s1 s2 s3 : Word} (r6 r7 r11 : Word) :
+ ∀ h,
+ ((.x12 ↦ᵣ (sp + 32)) ** (regOwn .x5) ** (.x0 ↦ᵣ (0 : 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_ad7816ac1ad1_1 | e781439e0a934479 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Shift/ShlSemantic.lean | ShlSemantic | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_shl_stack_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 44,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro result\n -- Case split: shift ≥ 256 or shift < 256\n by_cases hge : shift.toNat ≥ 256\n · -- shift ≥ 25... | [
{
"name": "shl_zero_lift_within",
"text": "/-- Compose one zero-path case into evmWordIs form.\n Shared proof structure for both high-limbs and s0≥256 cases. -/\nprivate theorem shl_zero_lift_within (sp base : Word)\n (shift value : EvmWord) (r5 r6 r7 r10 r11 : Word)\n {nSteps : Nat}\n (hmain : ... | [
{
"name": "evm_shl_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 58,
"n_chars": 3138,
"n_subproofs": 10,
"n_tactics": 41,
"cyclomatic": 3,
"n_automation": 17,
"n_rewrites": 5,
"n_structural": 6,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.Shift.ShlSemantic
256-bit shift semantics: the main SHL theorem connecting the RISC-V
implementation to EvmWord-level shift.
Main result: `evm_shl_stack_spec` states that `evm_shl` computes
`if shift.toNat ≥ 256 then 0 else value <<< shift.toNat`.
-/
-- `Shift.ShlCompose` transitively impor... | /-
EvmAsm.Evm64.Shift.ShlSemantic
256-bit shift semantics: the main SHL theorem connecting the RISC-V
implementation to EvmWord-level shift.
Main result: `evm_shl_stack_spec` states that `evm_shl` computes
`if shift.toNat ≥ 256 then 0 else value <<< shift.toNat`.
-/
-- `Shift.ShlCompose` transitively impor... | @@ -56,6 +56,76 @@
-- Zero-path helper: evmWordIs-level composition
-- ============================================================================
+/-- Compose one zero-path case into evmWordIs form.
+ Shared proof structure for both high-limbs and s0≥256 cases. -/
+private theorem shl_zero_lift_within (sp 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_bdb103861ef1_0 | 6879dba7290113c6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/KnuthTheoremB.lean | KnuthTheoremB | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 2 | [
{
"theorem_name": "knuth_q_r_v_nat_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 39,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n set u_hat := u_top * 2^64 + u_next with hu_hat_def\n set q_r := u_hat / v_top\n -- Basic facts\n have : 0 < v_top... | [
{
"name": "knuth_v_nat_ge_pow255_abstract",
"text": "/-- Knuth B — Nat-level version of `v_nat ≥ 2^255` under normalization.\n Abstract counterpart of `val256_ge_pow255_of_normalized`. -/\ntheorem knuth_v_nat_ge_pow255_abstract\n (v_nat v_top v_rest : Nat)\n (h_v_norm : v_top ≥ 2^63)\n (h_v_spli... | [
{
"name": "knuth_q_r_v_nat_bound",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 58,
"n_chars": 2687,
"n_subproofs": 17,
"n_tactics": 32,
"cyclomatic": 1,
"n_automation": 10,
"n_rewrites": 4,
"n_structural": 0,
"automation_only": false,
"... | 2 | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | @@ -93,6 +93,17 @@
rw [Nat.add_mul, Nat.mul_assoc, hpow]
omega
+/-- Knuth B — Nat-level version of `v_nat ≥ 2^255` under normalization.
+ Abstract counterpart of `val256_ge_pow255_of_normalized`. -/
+theorem knuth_v_nat_ge_pow255_abstract
+ (v_nat v_top v_rest : Nat)
+ (h_v_norm : v_top ≥ 2^63)
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bdb103861ef1_1 | 9f2a7e69967cfcb1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/KnuthTheoremB.lean | KnuthTheoremB | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 2 | [
{
"theorem_name": "knuth_q_r_v_nat_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 39,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n set u_hat := u_top * 2^64 + u_next with hu_hat_def\n set q_r := u_hat / v_top\n -- Basic facts\n have : 0 < v_top... | [
{
"name": "knuth_v_nat_ge_pow255_abstract",
"text": "/-- Knuth B — Nat-level version of `v_nat ≥ 2^255` under normalization.\n Abstract counterpart of `val256_ge_pow255_of_normalized`. -/\ntheorem knuth_v_nat_ge_pow255_abstract\n (v_nat v_top v_rest : Nat)\n (h_v_norm : v_top ≥ 2^63)\n (h_v_spli... | [
{
"name": "knuth_theorem_b_abstract",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 34,
"n_chars": 1468,
"n_subproofs": 4,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 4 | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | @@ -93,6 +93,17 @@
rw [Nat.add_mul, Nat.mul_assoc, hpow]
omega
+/-- Knuth B — Nat-level version of `v_nat ≥ 2^255` under normalization.
+ Abstract counterpart of `val256_ge_pow255_of_normalized`. -/
+theorem knuth_v_nat_ge_pow255_abstract
+ (v_nat v_top v_rest : Nat)
+ (h_v_norm : v_top ≥ 2^63)
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bdb103861ef1_2 | dba37501b516cee6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/KnuthTheoremB.lean | KnuthTheoremB | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 2 | [
{
"theorem_name": "knuth_q_r_v_nat_bound",
"depth": 1,
"n_commands": 0,
"n_lines": 39,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n set u_hat := u_top * 2^64 + u_next with hu_hat_def\n set q_r := u_hat / v_top\n -- Basic facts\n have : 0 < v_top... | [
{
"name": "knuth_v_nat_ge_pow255_abstract",
"text": "/-- Knuth B — Nat-level version of `v_nat ≥ 2^255` under normalization.\n Abstract counterpart of `val256_ge_pow255_of_normalized`. -/\ntheorem knuth_v_nat_ge_pow255_abstract\n (v_nat v_top v_rest : Nat)\n (h_v_norm : v_top ≥ 2^63)\n (h_v_spli... | [
{
"name": "knuth_theorem_b_val256",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 7,
"n_lines": 51,
"n_chars": 2450,
"n_subproofs": 6,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": false,
"m... | 7 | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | @@ -105,6 +105,17 @@
rw [Nat.add_mul, Nat.mul_assoc, hpow]
omega
+/-- Knuth B — Nat-level version of `v_nat ≥ 2^255` under normalization.
+ Abstract counterpart of `val256_ge_pow255_of_normalized`. -/
+theorem knuth_v_nat_ge_pow255_abstract
+ (v_nat v_top v_rest : Nat)
+ (h_v_norm : v_top ≥ 2^63)
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bdb103861ef1_3 | ffeaed2f7dc2ce87 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/KnuthTheoremB.lean | KnuthTheoremB | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 2 | [
{
"theorem_name": "b3_prime_val256_eq_scaled",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_shift_pos : 1 ≤ (clzResult b3).1.toNat := by\n rcases Nat.eq_zero_or_pos (clzResult b3).1.toNat with h... | [
{
"name": "antiShift_toNat_mod_eq",
"text": "/-- Antishift arithmetic: under `1 ≤ shift.toNat ≤ 63`, the algorithm's\n `antiShift = signExtend12 0 - shift` satisfies `antiShift.toNat % 64 =\n 64 - shift.toNat`.\n\n This reconciles the algorithm's `%64` modular form with `val256_normalize_general`'s... | [
{
"name": "b3_prime_val256_eq_scaled",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 34,
"n_chars": 1687,
"n_subproofs": 4,
"n_tactics": 13,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 5,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | @@ -80,6 +80,29 @@
open EvmAsm.Rv64 EvmWord
open EvmAsm.Rv64.AddrNorm (bv6_toNat_32)
+/-- Antishift arithmetic: under `1 ≤ shift.toNat ≤ 63`, the algorithm's
+ `antiShift = signExtend12 0 - shift` satisfies `antiShift.toNat % 64 =
+ 64 - shift.toNat`.
+
+ This reconciles the algorithm's `%64` modular form ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bdb103861ef1_4 | c08509ae663dd790 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/KnuthTheoremB.lean | KnuthTheoremB | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 2 | [
{
"theorem_name": "b3_prime_val256_eq_scaled",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_shift_pos : 1 ≤ (clzResult b3).1.toNat := by\n rcases Nat.eq_zero_or_pos (clzResult b3).1.toNat with h... | [
{
"name": "antiShift_toNat_mod_eq",
"text": "/-- Antishift arithmetic: under `1 ≤ shift.toNat ≤ 63`, the algorithm's\n `antiShift = signExtend12 0 - shift` satisfies `antiShift.toNat % 64 =\n 64 - shift.toNat`.\n\n This reconciles the algorithm's `%64` modular form with `val256_normalize_general`'s... | [
{
"name": "u_val256_eq_scaled_with_overflow",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 31,
"n_chars": 1610,
"n_subproofs": 3,
"n_tactics": 12,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 5,
"automation_only": fal... | 1 | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | @@ -80,6 +80,29 @@
open EvmAsm.Rv64 EvmWord
open EvmAsm.Rv64.AddrNorm (bv6_toNat_32)
+/-- Antishift arithmetic: under `1 ≤ shift.toNat ≤ 63`, the algorithm's
+ `antiShift = signExtend12 0 - shift` satisfies `antiShift.toNat % 64 =
+ 64 - shift.toNat`.
+
+ This reconciles the algorithm's `%64` modular form ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bdb103861ef1_5 | fdc8b98b66c85ae1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/KnuthTheoremB.lean | KnuthTheoremB | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 1 | [
{
"theorem_name": "knuth_theorem_b_abstract",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hv_nat_pos : 0 < v_nat := by\n have h1 : v_nat ≥ 2^255 :=\n knuth_v_nat_ge_pow255_abstract v_nat v_t... | [
{
"name": "knuth_q_r_v_nat_bound",
"text": "/-- Knuth B — trial-remainder bookkeeping (Nat-abstract call-trial bound).\n\n Under the call-trial hypothesis `u_top < v_top` and standard normalization\n (`v_top ≥ 2^63`, `v_rest < 2^192`, `u_next < 2^64`), the raw 2-limb trial\n quotient `q_r = (u_top ... | [
{
"name": "knuth_theorem_b_from_clz",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 13,
"n_lines": 52,
"n_chars": 2620,
"n_subproofs": 4,
"n_tactics": 25,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 13 | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | @@ -139,6 +139,63 @@
have : y % z < z := Nat.mod_lt y hz
nlinarith
+/-- Knuth B — trial-remainder bookkeeping (Nat-abstract call-trial bound).
+
+ Under the call-trial hypothesis `u_top < v_top` and standard normalization
+ (`v_top ≥ 2^63`, `v_rest < 2^192`, `u_next < 2^64`), the raw 2-limb trial
+ quo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bdb103861ef1_6 | c01a3cd251425b3e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/KnuthTheoremB.lean | KnuthTheoremB | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 1 | [
{
"theorem_name": "knuth_theorem_b_abstract",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hv_nat_pos : 0 < v_nat := by\n have h1 : v_nat ≥ 2^255 :=\n knuth_v_nat_ge_pow255_abstract v_nat v_t... | [
{
"name": "knuth_core_ineq",
"text": "/-- Knuth B core overshoot inequality (Nat-abstract):\n `x * z < y + 2 * z` plus `0 < z` implies `x ≤ y / z + 2`.\n\n This is the final combinator for the \"q_hat ≤ q_true + 2\" step. After\n accumulating `q_hat_raw * v_nat < u_nat + 2 * v_nat` (from the trial\... | [
{
"name": "knuth_theorem_b_5limb_shifted_val256",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 35,
"n_chars": 1960,
"n_subproofs": 2,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only":... | 6 | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | @@ -104,6 +104,29 @@
have h2 : (2:Nat)^63 * 2^192 = 2^255 := by rw [← pow_add]
omega
+/-- Knuth B core overshoot inequality (Nat-abstract):
+ `x * z < y + 2 * z` plus `0 < z` implies `x ≤ y / z + 2`.
+
+ This is the final combinator for the "q_hat ≤ q_true + 2" step. After
+ accumulating `q_hat_raw * 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_bdb103861ef1_7 | 24004f053206ab04 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/KnuthTheoremB.lean | KnuthTheoremB | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 4 | [
{
"theorem_name": "div128Quot_q1_lt_pow33",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hdHi_ne : dHi ≠ 0 := by\n intro heq; rw [heq] at hdHi_ge; simp at hdHi_ge\n rw [rv64_divu_toNat uHi dHi hd... | [
{
"name": "rv64_divu_toNat",
"text": "/-- RV64 unsigned divide maps to Nat div on toNat (for nonzero divisor).\n\n Entry-level bridge for reasoning about `div128Quot`, which composes two\n `rv64_divu` calls with correction steps. The zero-divisor case returns\n `BitVec.allOnes 64` and is handled se... | [
{
"name": "div128Quot_q1_lt_pow33",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 1011,
"n_subproofs": 6,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
"m... | 1 | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | @@ -80,6 +80,21 @@
open EvmAsm.Rv64 EvmWord
open EvmAsm.Rv64.AddrNorm (bv6_toNat_32)
+/-- RV64 unsigned divide maps to Nat div on toNat (for nonzero divisor).
+
+ Entry-level bridge for reasoning about `div128Quot`, which composes two
+ `rv64_divu` calls with correction steps. The zero-divisor case returns
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bdb103861ef1_8 | 08ed26054fe83b5e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/KnuthTheoremB.lean | KnuthTheoremB | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 4 | [
{
"theorem_name": "div128Quot_q1_lt_pow33",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hdHi_ne : dHi ≠ 0 := by\n intro heq; rw [heq] at hdHi_ge; simp at hdHi_ge\n rw [rv64_divu_toNat uHi dHi hd... | [
{
"name": "rv64_divu_toNat",
"text": "/-- RV64 unsigned divide maps to Nat div on toNat (for nonzero divisor).\n\n Entry-level bridge for reasoning about `div128Quot`, which composes two\n `rv64_divu` calls with correction steps. The zero-divisor case returns\n `BitVec.allOnes 64` and is handled se... | [
{
"name": "div128Quot_first_round_euclidean",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 29,
"n_chars": 1374,
"n_subproofs": 6,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": fal... | 1 | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | @@ -80,6 +80,21 @@
open EvmAsm.Rv64 EvmWord
open EvmAsm.Rv64.AddrNorm (bv6_toNat_32)
+/-- RV64 unsigned divide maps to Nat div on toNat (for nonzero divisor).
+
+ Entry-level bridge for reasoning about `div128Quot`, which composes two
+ `rv64_divu` calls with correction steps. The zero-divisor case returns
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bdb103861ef1_9 | 4fd5aa5691b5dce2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/KnuthTheoremB.lean | KnuthTheoremB | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 4 | [
{
"theorem_name": "div128Quot_q1_lt_pow33",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hdHi_ne : dHi ≠ 0 := by\n intro heq; rw [heq] at hdHi_ge; simp at hdHi_ge\n rw [rv64_divu_toNat uHi dHi hd... | [
{
"name": "rv64_divu_toNat",
"text": "/-- RV64 unsigned divide maps to Nat div on toNat (for nonzero divisor).\n\n Entry-level bridge for reasoning about `div128Quot`, which composes two\n `rv64_divu` calls with correction steps. The zero-divisor case returns\n `BitVec.allOnes 64` and is handled se... | [
{
"name": "div128Quot_first_round_correction",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 81,
"n_chars": 3506,
"n_subproofs": 20,
"n_tactics": 58,
"cyclomatic": 2,
"n_automation": 10,
"n_rewrites": 11,
"n_structural": 10,
"automation_only"... | 2 | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | @@ -80,6 +80,21 @@
open EvmAsm.Rv64 EvmWord
open EvmAsm.Rv64.AddrNorm (bv6_toNat_32)
+/-- RV64 unsigned divide maps to Nat div on toNat (for nonzero divisor).
+
+ Entry-level bridge for reasoning about `div128Quot`, which composes two
+ `rv64_divu` calls with correction steps. The zero-divisor case returns
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bdb103861ef1_10 | cc86ea831698cb5c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/KnuthTheoremB.lean | KnuthTheoremB | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 4 | [
{
"theorem_name": "div128Quot_q1_lt_pow33",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hdHi_ne : dHi ≠ 0 := by\n intro heq; rw [heq] at hdHi_ge; simp at hdHi_ge\n rw [rv64_divu_toNat uHi dHi hd... | [
{
"name": "rv64_divu_toNat",
"text": "/-- RV64 unsigned divide maps to Nat div on toNat (for nonzero divisor).\n\n Entry-level bridge for reasoning about `div128Quot`, which composes two\n `rv64_divu` calls with correction steps. The zero-divisor case returns\n `BitVec.allOnes 64` and is handled se... | [
{
"name": "div128Quot_first_round_post",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 32,
"n_chars": 1390,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
... | 3 | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | @@ -80,6 +80,21 @@
open EvmAsm.Rv64 EvmWord
open EvmAsm.Rv64.AddrNorm (bv6_toNat_32)
+/-- RV64 unsigned divide maps to Nat div on toNat (for nonzero divisor).
+
+ Entry-level bridge for reasoning about `div128Quot`, which composes two
+ `rv64_divu` calls with correction steps. The zero-divisor case returns
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bdb103861ef1_11 | 9886707bfed622e9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/KnuthTheoremB.lean | KnuthTheoremB | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 4 | [
{
"theorem_name": "div128Quot_q1_lt_pow33",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hdHi_ne : dHi ≠ 0 := by\n intro heq; rw [heq] at hdHi_ge; simp at hdHi_ge\n rw [rv64_divu_toNat uHi dHi hd... | [
{
"name": "rv64_divu_toNat",
"text": "/-- RV64 unsigned divide maps to Nat div on toNat (for nonzero divisor).\n\n Entry-level bridge for reasoning about `div128Quot`, which composes two\n `rv64_divu` calls with correction steps. The zero-divisor case returns\n `BitVec.allOnes 64` and is handled se... | [
{
"name": "div128Quot_q1c_lt_pow33",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 44,
"n_chars": 1798,
"n_subproofs": 5,
"n_tactics": 25,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 6,
"n_structural": 4,
"automation_only": false,
"... | 2 | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | @@ -80,6 +80,21 @@
open EvmAsm.Rv64 EvmWord
open EvmAsm.Rv64.AddrNorm (bv6_toNat_32)
+/-- RV64 unsigned divide maps to Nat div on toNat (for nonzero divisor).
+
+ Entry-level bridge for reasoning about `div128Quot`, which composes two
+ `rv64_divu` calls with correction steps. The zero-divisor case returns
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bdb103861ef1_12 | af53534b623f18f1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/KnuthTheoremB.lean | KnuthTheoremB | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 4 | [
{
"theorem_name": "div128Quot_q1_lt_pow33",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hdHi_ne : dHi ≠ 0 := by\n intro heq; rw [heq] at hdHi_ge; simp at hdHi_ge\n rw [rv64_divu_toNat uHi dHi hd... | [
{
"name": "rv64_divu_toNat",
"text": "/-- RV64 unsigned divide maps to Nat div on toNat (for nonzero divisor).\n\n Entry-level bridge for reasoning about `div128Quot`, which composes two\n `rv64_divu` calls with correction steps. The zero-divisor case returns\n `BitVec.allOnes 64` and is handled se... | [
{
"name": "div128Quot_rhatc_lt_2dHi",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 51,
"n_chars": 2325,
"n_subproofs": 9,
"n_tactics": 33,
"cyclomatic": 2,
"n_automation": 7,
"n_rewrites": 3,
"n_structural": 6,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | @@ -80,6 +80,21 @@
open EvmAsm.Rv64 EvmWord
open EvmAsm.Rv64.AddrNorm (bv6_toNat_32)
+/-- RV64 unsigned divide maps to Nat div on toNat (for nonzero divisor).
+
+ Entry-level bridge for reasoning about `div128Quot`, which composes two
+ `rv64_divu` calls with correction steps. The zero-divisor case returns
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bdb103861ef1_13 | c942d5d88d859a0f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/KnuthTheoremB.lean | KnuthTheoremB | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 19 | 1 | [
{
"theorem_name": "div128Quot_phase1b_post",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro q1' rhat'\n by_cases h_check : BitVec.ult rhatUn1 (q1c * dLo)\n · -- Check fires: apply correction case\n ... | [
{
"name": "div128Quot_phase1b_check_implies_q1c_pos",
"text": "/-- **Phase 1b sub-step.** When Phase 1b's `BitVec.ult rhatUn1 qDlo` check\n fires (the Knuth multiplication check), the post-Phase-1a quotient\n `q1c` must be at least 1.\n\n Proof by contradiction: if `q1c = 0`, then `qDlo = 0 * dLo =... | [
{
"name": "div128Quot_phase1b_post",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 35,
"n_chars": 1600,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"... | 2 | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | /-
EvmAsm.Evm64.EvmWordArith.KnuthTheoremB
Toward Knuth's TAOCP Vol 2 §4.3.1 Theorem B for the n=4 max-trial
call path: `div128Quot u_top u3 b3'` overestimates the true quotient
`⌊val256(a) / val256(b)⌋` by at most 2.
This is the major remaining math gap for call-trial DIV/MOD stack
specs (the real shift ... | @@ -80,6 +80,30 @@
open EvmAsm.Rv64 EvmWord
open EvmAsm.Rv64.AddrNorm (bv6_toNat_32)
+/-- **Phase 1b sub-step.** When Phase 1b's `BitVec.ult rhatUn1 qDlo` check
+ fires (the Knuth multiplication check), the post-Phase-1a quotient
+ `q1c` must be at least 1.
+
+ Proof by contradiction: if `q1c = 0`, then `q... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ee50640f5d27_0 | 653767f699f19d21 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/EarlyRet.lean | EarlyRet | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "twoRet_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hsound := Stmt.retSound Region.empty RwRegion.empty twoRetBody base ret\n \"twoRet.\" (twoRetPre flag)\n Region.emp... | [
{
"name": "twoRet_sp_post",
"text": "private theorem twoRet_sp_post (flag : Word) :\n ∀ rf ws A,\n Stmt.sp Region.empty RwRegion.empty twoRetBody (twoRetPre flag) rf ws A →\n twoRetPost flag rf ws A := by\n intro rf ws A hsp\n unfold twoRetBody at hsp\n simp only [Stmt.sp] at hsp\n rcases... | [
{
"name": "twoRet_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 28,
"n_chars": 1105,
"n_subproofs": 1,
"n_tactics": 20,
"cyclomatic": 4,
"n_automation": 10,
"n_rewrites": 1,
"n_structural": 7,
"automation_only": false,
"max_nesting... | 1 | /-
EvmAsm.Rv64.SAsm.EarlyRet
Minimal return-terminating SAsm demo: a conditional branch to two tail blocks,
each ending in a real `ret` (`JALR x0 x1 0`). This is the small mechanism
test for multi-exit return soundness; larger loop-shaped predicate routines
can build on the same return-terminating theorem w... | /-
EvmAsm.Rv64.SAsm.EarlyRet
Minimal return-terminating SAsm demo: a conditional branch to two tail blocks,
each ending in a real `ret` (`JALR x0 x1 0`). This is the small mechanism
test for multi-exit return soundness; larger loop-shaped predicate routines
can build on the same return-terminating theorem w... | @@ -34,13 +34,63 @@
def twoRetPost (flag : Word) : Reach :=
fun rf _ _ => rf.get .x10 = if flag = 0 then (1 : Word) else (2 : Word)
+private theorem twoRet_sp_post (flag : Word) :
+ ∀ rf ws A,
+ Stmt.sp Region.empty RwRegion.empty twoRetBody (twoRetPre flag) rf ws A →
+ twoRetPost flag rf ws A := 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_4624ccd38b33_0 | 0cb0fbdd23056047 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/RLP/LongFormDecodeBridge.lean | LongFormDecodeBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "decodeAux_long_bytes_lengthField_short_rejected",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [decodeAux_long_bytes_lengthField fuel pfx rest lengthField h_class h_len]\n simp [h_sh... | [
{
"name": "decodeAux_long_bytes_lengthField",
"text": "/--\nLong byte-string branch expressed through the packaged length-field result.\n\nDistinctive token: RLP.LongFormDecodeBridge.decodeAux_long_bytes_lengthField #120.\n-/\ntheorem decodeAux_long_bytes_lengthField\n (fuel : Nat) (pfx : Byte) (rest : L... | [
{
"name": "decodeAux_long_bytes_lengthField_short_rejected",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 498,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automati... | 1 | /-
EvmAsm.EL.RLP.LongFormDecodeBridge
Long-form decode bridges using the packaged read-length result (GH #120).
-/
import EvmAsm.EL.RLP.PrefixDecode
import EvmAsm.EL.RLP.ListDecodeBridge
import EvmAsm.EL.RLP.ReadLengthBridge
namespace EvmAsm.EL.RLP
namespace LongFormDecodeBridge
abbrev LengthFieldResult := Rea... | /-
EvmAsm.EL.RLP.LongFormDecodeBridge
Long-form decode bridges using the packaged read-length result (GH #120).
-/
import EvmAsm.EL.RLP.PrefixDecode
import EvmAsm.EL.RLP.ListDecodeBridge
import EvmAsm.EL.RLP.ReadLengthBridge
namespace EvmAsm.EL.RLP
namespace LongFormDecodeBridge
abbrev LengthFieldResult := Rea... | @@ -14,6 +14,32 @@
abbrev LengthFieldResult := ReadLengthBridge.LengthFieldResult
+/--
+Long byte-string branch expressed through the packaged length-field result.
+
+Distinctive token: RLP.LongFormDecodeBridge.decodeAux_long_bytes_lengthField #120.
+-/
+theorem decodeAux_long_bytes_lengthField
+ (fuel : 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_4624ccd38b33_1 | d8ec2ffa08d69141 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/RLP/LongFormDecodeBridge.lean | LongFormDecodeBridge | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "decodeAux_long_bytes_lengthField_short_rejected",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [decodeAux_long_bytes_lengthField fuel pfx rest lengthField h_class h_len]\n simp [h_sh... | [
{
"name": "decodeAux_long_bytes_lengthField",
"text": "/--\nLong byte-string branch expressed through the packaged length-field result.\n\nDistinctive token: RLP.LongFormDecodeBridge.decodeAux_long_bytes_lengthField #120.\n-/\ntheorem decodeAux_long_bytes_lengthField\n (fuel : Nat) (pfx : Byte) (rest : L... | [
{
"name": "decodeAux_long_bytes_lengthField_payload",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 623,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only... | 1 | /-
EvmAsm.EL.RLP.LongFormDecodeBridge
Long-form decode bridges using the packaged read-length result (GH #120).
-/
import EvmAsm.EL.RLP.PrefixDecode
import EvmAsm.EL.RLP.ListDecodeBridge
import EvmAsm.EL.RLP.ReadLengthBridge
namespace EvmAsm.EL.RLP
namespace LongFormDecodeBridge
abbrev LengthFieldResult := Rea... | /-
EvmAsm.EL.RLP.LongFormDecodeBridge
Long-form decode bridges using the packaged read-length result (GH #120).
-/
import EvmAsm.EL.RLP.PrefixDecode
import EvmAsm.EL.RLP.ListDecodeBridge
import EvmAsm.EL.RLP.ReadLengthBridge
namespace EvmAsm.EL.RLP
namespace LongFormDecodeBridge
abbrev LengthFieldResult := Rea... | @@ -14,6 +14,32 @@
abbrev LengthFieldResult := ReadLengthBridge.LengthFieldResult
+/--
+Long byte-string branch expressed through the packaged length-field result.
+
+Distinctive token: RLP.LongFormDecodeBridge.decodeAux_long_bytes_lengthField #120.
+-/
+theorem decodeAux_long_bytes_lengthField
+ (fuel : 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_4624ccd38b33_2 | 36b5d2fd6432fa63 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/RLP/LongFormDecodeBridge.lean | LongFormDecodeBridge | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 3 | [
{
"theorem_name": "decodeAux_long_list_lengthField_decodeListPayload",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [decodeAux_long_list_lengthField fuel pfx rest lengthField h_class h_len]\n by_cases... | [
{
"name": "decodeAux_long_list_lengthField",
"text": "/-- Long list branch expressed through the packaged length-field result. -/\ntheorem decodeAux_long_list_lengthField\n (fuel : Nat) (pfx : Byte) (rest : List Byte)\n (lengthField : LengthFieldResult)\n (h_class : classifyPrefix pfx = .longList)\... | [
{
"name": "decodeAux_long_list_lengthField_decodeListPayload",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 38,
"n_chars": 1538,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 7,
"n_automation": 5,
"n_rewrites": 1,
"n_structural": 5,
"auto... | 1 | /-
EvmAsm.EL.RLP.LongFormDecodeBridge
Long-form decode bridges using the packaged read-length result (GH #120).
-/
import EvmAsm.EL.RLP.PrefixDecode
import EvmAsm.EL.RLP.ListDecodeBridge
import EvmAsm.EL.RLP.ReadLengthBridge
namespace EvmAsm.EL.RLP
namespace LongFormDecodeBridge
abbrev LengthFieldResult := Rea... | /-
EvmAsm.EL.RLP.LongFormDecodeBridge
Long-form decode bridges using the packaged read-length result (GH #120).
-/
import EvmAsm.EL.RLP.PrefixDecode
import EvmAsm.EL.RLP.ListDecodeBridge
import EvmAsm.EL.RLP.ReadLengthBridge
namespace EvmAsm.EL.RLP
namespace LongFormDecodeBridge
abbrev LengthFieldResult := Rea... | @@ -14,6 +14,42 @@
abbrev LengthFieldResult := ReadLengthBridge.LengthFieldResult
+/-- Long list branch expressed through the packaged length-field result. -/
+theorem decodeAux_long_list_lengthField
+ (fuel : Nat) (pfx : Byte) (rest : List Byte)
+ (lengthField : LengthFieldResult)
+ (h_class : classifyPr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4624ccd38b33_3 | b08aadbf2eb163c2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/RLP/LongFormDecodeBridge.lean | LongFormDecodeBridge | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 3 | [
{
"theorem_name": "decodeAux_long_list_lengthField_decodeListPayload",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [decodeAux_long_list_lengthField fuel pfx rest lengthField h_class h_len]\n by_cases... | [
{
"name": "decodeAux_long_list_lengthField",
"text": "/-- Long list branch expressed through the packaged length-field result. -/\ntheorem decodeAux_long_list_lengthField\n (fuel : Nat) (pfx : Byte) (rest : List Byte)\n (lengthField : LengthFieldResult)\n (h_class : classifyPrefix pfx = .longList)\... | [
{
"name": "decodeAux_long_list_lengthField_short_rejected",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 494,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automatio... | 1 | /-
EvmAsm.EL.RLP.LongFormDecodeBridge
Long-form decode bridges using the packaged read-length result (GH #120).
-/
import EvmAsm.EL.RLP.PrefixDecode
import EvmAsm.EL.RLP.ListDecodeBridge
import EvmAsm.EL.RLP.ReadLengthBridge
namespace EvmAsm.EL.RLP
namespace LongFormDecodeBridge
abbrev LengthFieldResult := Rea... | /-
EvmAsm.EL.RLP.LongFormDecodeBridge
Long-form decode bridges using the packaged read-length result (GH #120).
-/
import EvmAsm.EL.RLP.PrefixDecode
import EvmAsm.EL.RLP.ListDecodeBridge
import EvmAsm.EL.RLP.ReadLengthBridge
namespace EvmAsm.EL.RLP
namespace LongFormDecodeBridge
abbrev LengthFieldResult := Rea... | @@ -14,6 +14,42 @@
abbrev LengthFieldResult := ReadLengthBridge.LengthFieldResult
+/-- Long list branch expressed through the packaged length-field result. -/
+theorem decodeAux_long_list_lengthField
+ (fuel : Nat) (pfx : Byte) (rest : List Byte)
+ (lengthField : LengthFieldResult)
+ (h_class : classifyPr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4624ccd38b33_4 | c242cedf9a17fecd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/RLP/LongFormDecodeBridge.lean | LongFormDecodeBridge | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 3 | [
{
"theorem_name": "decodeAux_long_list_lengthField_decodeListPayload",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [decodeAux_long_list_lengthField fuel pfx rest lengthField h_class h_len]\n by_cases... | [
{
"name": "decodeAux_long_list_lengthField",
"text": "/-- Long list branch expressed through the packaged length-field result. -/\ntheorem decodeAux_long_list_lengthField\n (fuel : Nat) (pfx : Byte) (rest : List Byte)\n (lengthField : LengthFieldResult)\n (h_class : classifyPrefix pfx = .longList)\... | [
{
"name": "decodeAux_long_list_lengthField_success",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 719,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only"... | 1 | /-
EvmAsm.EL.RLP.LongFormDecodeBridge
Long-form decode bridges using the packaged read-length result (GH #120).
-/
import EvmAsm.EL.RLP.PrefixDecode
import EvmAsm.EL.RLP.ListDecodeBridge
import EvmAsm.EL.RLP.ReadLengthBridge
namespace EvmAsm.EL.RLP
namespace LongFormDecodeBridge
abbrev LengthFieldResult := Rea... | /-
EvmAsm.EL.RLP.LongFormDecodeBridge
Long-form decode bridges using the packaged read-length result (GH #120).
-/
import EvmAsm.EL.RLP.PrefixDecode
import EvmAsm.EL.RLP.ListDecodeBridge
import EvmAsm.EL.RLP.ReadLengthBridge
namespace EvmAsm.EL.RLP
namespace LongFormDecodeBridge
abbrev LengthFieldResult := Rea... | @@ -14,6 +14,42 @@
abbrev LengthFieldResult := ReadLengthBridge.LengthFieldResult
+/-- Long list branch expressed through the packaged length-field result. -/
+theorem decodeAux_long_list_lengthField
+ (fuel : Nat) (pfx : Byte) (rest : List Byte)
+ (lengthField : LengthFieldResult)
+ (h_class : classifyPr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9c6299671a34_0 | b95bf767de8e753e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Program.lean | Program | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "mload_one_limb_length",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [mload_one_limb, SD, single, seq, Program.length_append,\n mload_byte_pack_length]",
"n_chars": 95,
"... | [
{
"name": "mload_byte_pack_length",
"text": "/-- Concrete instruction length of `mload_byte_pack`.\n\n `k = 0` is the seed `LBU`; each successor adds one `LBU; SLLI; OR`\n step, so the length is `1 + 3*k`. -/\ntheorem mload_byte_pack_length\n (addrReg byteReg accReg : Reg) (limbStart k : Nat) :\n ... | [
{
"name": "mload_one_limb_length",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 290,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_ne... | 1 | /-
EvmAsm.Evm64.MLoad.Program
256-bit EVM `MLOAD`: read 32 contiguous bytes from EVM memory at byte
offset `offset` and push the resulting big-endian 256-bit word onto
the EVM stack (replacing the popped `offset` operand — net zero stack
movement).
This slice is **program-only**, mirroring the shape of
... | /-
EvmAsm.Evm64.MLoad.Program
256-bit EVM `MLOAD`: read 32 contiguous bytes from EVM memory at byte
offset `offset` and push the resulting big-endian 256-bit word onto
the EVM stack (replacing the popped `offset` operand — net zero stack
movement).
This slice is **program-only**, mirroring the shape of
... | @@ -131,9 +131,25 @@
(offReg byteReg accReg addrReg memBaseReg : Reg) (base : Word) : CodeReq :=
CodeReq.ofProg base (evm_mload offReg byteReg accReg addrReg memBaseReg)
+/-- Concrete instruction length of `mload_byte_pack`.
+
+ `k = 0` is the seed `LBU`; each successor adds one `LBU; SLLI; OR`
+ step, ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9c6299671a34_1 | 29f455ae0fd6d6f9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Program.lean | Program | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "mload_one_limb_length",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [mload_one_limb, SD, single, seq, Program.length_append,\n mload_byte_pack_length]",
"n_chars": 95,
"... | [
{
"name": "mload_byte_pack_length",
"text": "/-- Concrete instruction length of `mload_byte_pack`.\n\n `k = 0` is the seed `LBU`; each successor adds one `LBU; SLLI; OR`\n step, so the length is `1 + 3*k`. -/\ntheorem mload_byte_pack_length\n (addrReg byteReg accReg : Reg) (limbStart k : Nat) :\n ... | [
{
"name": "evm_mload_length",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 294,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting... | 2 | /-
EvmAsm.Evm64.MLoad.Program
256-bit EVM `MLOAD`: read 32 contiguous bytes from EVM memory at byte
offset `offset` and push the resulting big-endian 256-bit word onto
the EVM stack (replacing the popped `offset` operand — net zero stack
movement).
This slice is **program-only**, mirroring the shape of
... | /-
EvmAsm.Evm64.MLoad.Program
256-bit EVM `MLOAD`: read 32 contiguous bytes from EVM memory at byte
offset `offset` and push the resulting big-endian 256-bit word onto
the EVM stack (replacing the popped `offset` operand — net zero stack
movement).
This slice is **program-only**, mirroring the shape of
... | @@ -131,9 +131,25 @@
(offReg byteReg accReg addrReg memBaseReg : Reg) (base : Word) : CodeReq :=
CodeReq.ofProg base (evm_mload offReg byteReg accReg addrReg memBaseReg)
+/-- Concrete instruction length of `mload_byte_pack`.
+
+ `k = 0` is the seed `LBU`; each successor adds one `LBU; SLLI; OR`
+ step, ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9c6299671a34_2 | 7ade7eacdcd53726 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/Program.lean | Program | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "mload_one_limb_length",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [mload_one_limb, SD, single, seq, Program.length_append,\n mload_byte_pack_length]",
"n_chars": 95,
"... | [
{
"name": "mload_byte_pack_length",
"text": "/-- Concrete instruction length of `mload_byte_pack`.\n\n `k = 0` is the seed `LBU`; each successor adds one `LBU; SLLI; OR`\n step, so the length is `1 + 3*k`. -/\ntheorem mload_byte_pack_length\n (addrReg byteReg accReg : Reg) (limbStart k : Nat) :\n ... | [
{
"name": "evm_mload_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 6,
"n_chars": 262,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_n... | 3 | /-
EvmAsm.Evm64.MLoad.Program
256-bit EVM `MLOAD`: read 32 contiguous bytes from EVM memory at byte
offset `offset` and push the resulting big-endian 256-bit word onto
the EVM stack (replacing the popped `offset` operand — net zero stack
movement).
This slice is **program-only**, mirroring the shape of
... | /-
EvmAsm.Evm64.MLoad.Program
256-bit EVM `MLOAD`: read 32 contiguous bytes from EVM memory at byte
offset `offset` and push the resulting big-endian 256-bit word onto
the EVM stack (replacing the popped `offset` operand — net zero stack
movement).
This slice is **program-only**, mirroring the shape of
... | @@ -131,9 +131,25 @@
(offReg byteReg accReg addrReg memBaseReg : Reg) (base : Word) : CodeReq :=
CodeReq.ofProg base (evm_mload offReg byteReg accReg addrReg memBaseReg)
+/-- Concrete instruction length of `mload_byte_pack`.
+
+ `k = 0` is the seed `LBU`; each successor adds one `LBU; SLLI; OR`
+ step, ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f63f3be0357c_0 | aa6ce0282c3f8b0b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LimbSpec/Div128Step2.lean | Div128Step2 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "divK_div128_step2_thru_guard_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 53,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro q0 rhat2 hi q0c rhat2c rhat2cHi cr\n have hcr_eq : cr =\n CodeReq.union (CodeReq.sing... | [
{
"name": "divK_div128_step2_upto_guard_spec_within",
"text": "/-- div128 step 2 upto-guard: init + clamp_q0 composition for instrs [30]-[36].\n Output at base+28 with x5=q0c, x11=rhat2c, x1=hi ready for the Phase 2b\n guard to consume.\n\n Note: proof pattern matches the pre-guard (main-branch) st... | [
{
"name": "divK_div128_step2_thru_guard_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 91,
"n_chars": 5295,
"n_subproofs": 10,
"n_tactics": 51,
"cyclomatic": 3,
"n_automation": 6,
"n_rewrites": 6,
"n_structural": 5,
"automation_o... | 1 | /-
EvmAsm.Evm64.DivMod.LimbSpec.Div128Step2
Full-step composition for instrs [30]-[46] of the `div128` subroutine —
combining step-2-init (DIVU+MUL+SUB), clamp-q0 (SRLI+BEQ+ADDI+ADD),
Phase 2b guard (SRLI+BNE — Knuth TAOCP §4.3.1 Step D3), and prodcheck2
(LD+MUL+SLLI+LD+OR + BLTU+JAL + ADDI) into a single re... | /-
EvmAsm.Evm64.DivMod.LimbSpec.Div128Step2
Full-step composition for instrs [30]-[46] of the `div128` subroutine —
combining step-2-init (DIVU+MUL+SUB), clamp-q0 (SRLI+BEQ+ADDI+ADD),
Phase 2b guard (SRLI+BNE — Knuth TAOCP §4.3.1 Step D3), and prodcheck2
(LD+MUL+SLLI+LD+OR + BLTU+JAL + ADDI) into a single re... | @@ -26,6 +26,86 @@
open EvmAsm.Rv64
+/-- div128 step 2 upto-guard: init + clamp_q0 composition for instrs [30]-[36].
+ Output at base+28 with x5=q0c, x11=rhat2c, x1=hi ready for the Phase 2b
+ guard to consume.
+
+ Note: proof pattern matches the pre-guard (main-branch) step2_spec's first
+ two sub-spe... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f63f3be0357c_1 | 0e56de07e78afb65 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LimbSpec/Div128Step2.lean | Div128Step2 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "divK_div128_step2_branch_merged_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 86,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro q0 rhat2 hi q0c rhat2c q0Dlo rhat2Un0 rhat2cHi q0'Unguarded cr\n have hcr_eq : cr =\n ... | [
{
"name": "divK_div128_step2_thru_guard_spec_within",
"text": "/-- div128 step 2 thru-guard: init + clamp_q0 + phase2b_guard composition\n for instrs [30]-[38]. Produces a cpsBranchWithin at base+28 that either takes\n the taken path to base+68 (skipping mul-check when rhat2cHi ≠ 0) or\n falls thro... | [
{
"name": "divK_div128_step2_branch_merged_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 134,
"n_chars": 8422,
"n_subproofs": 15,
"n_tactics": 91,
"cyclomatic": 9,
"n_automation": 12,
"n_rewrites": 18,
"n_structural": 5,
"automa... | 2 | /-
EvmAsm.Evm64.DivMod.LimbSpec.Div128Step2
Full-step composition for instrs [30]-[46] of the `div128` subroutine —
combining step-2-init (DIVU+MUL+SUB), clamp-q0 (SRLI+BEQ+ADDI+ADD),
Phase 2b guard (SRLI+BNE — Knuth TAOCP §4.3.1 Step D3), and prodcheck2
(LD+MUL+SLLI+LD+OR + BLTU+JAL + ADDI) into a single re... | /-
EvmAsm.Evm64.DivMod.LimbSpec.Div128Step2
Full-step composition for instrs [30]-[46] of the `div128` subroutine —
combining step-2-init (DIVU+MUL+SUB), clamp-q0 (SRLI+BEQ+ADDI+ADD),
Phase 2b guard (SRLI+BNE — Knuth TAOCP §4.3.1 Step D3), and prodcheck2
(LD+MUL+SLLI+LD+OR + BLTU+JAL + ADDI) into a single re... | @@ -106,6 +106,96 @@
(fun h hp => by xperm_hyp hp)
h12
+/-- div128 step 2 thru-guard: init + clamp_q0 + phase2b_guard composition
+ for instrs [30]-[38]. Produces a cpsBranchWithin at base+28 that either takes
+ the taken path to base+68 (skipping mul-check when rhat2cHi ≠ 0) or
+ falls through to ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f63f3be0357c_2 | b5b08d3c9be72584 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LimbSpec/Div128Step2.lean | Div128Step2 | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "divK_div128_step2_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 135,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold divKDiv128Step2Code divKDiv128Step2Post\n let q0 := rv64_divu un21 dHi\n let rhat2 := un21 - q0 * ... | [
{
"name": "divK_div128_step2_branch_merged_spec_within",
"text": "/-- div128 step 2 branch-merged: composes thru_guard + prodcheck2_merged into\n a cpsBranchWithin where BOTH legs end at base+68 (guard-fires skips directly;\n guard-doesn't-fire runs the mul-check). -/\ntheorem divK_div128_step2_branch... | [
{
"name": "divK_div128_step2_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 155,
"n_chars": 8585,
"n_subproofs": 32,
"n_tactics": 123,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 11,
"n_structural": 22,
"automation_only": f... | 3 | /-
EvmAsm.Evm64.DivMod.LimbSpec.Div128Step2
Full-step composition for instrs [30]-[46] of the `div128` subroutine —
combining step-2-init (DIVU+MUL+SUB), clamp-q0 (SRLI+BEQ+ADDI+ADD),
Phase 2b guard (SRLI+BNE — Knuth TAOCP §4.3.1 Step D3), and prodcheck2
(LD+MUL+SLLI+LD+OR + BLTU+JAL + ADDI) into a single re... | /-
EvmAsm.Evm64.DivMod.LimbSpec.Div128Step2
Full-step composition for instrs [30]-[46] of the `div128` subroutine —
combining step-2-init (DIVU+MUL+SUB), clamp-q0 (SRLI+BEQ+ADDI+ADD),
Phase 2b guard (SRLI+BNE — Knuth TAOCP §4.3.1 Step D3), and prodcheck2
(LD+MUL+SLLI+LD+OR + BLTU+JAL + ADDI) into a single re... | @@ -196,6 +196,139 @@
(fun h hp => by xperm_hyp hp)
composed
+/-- div128 step 2 branch-merged: composes thru_guard + prodcheck2_merged into
+ a cpsBranchWithin where BOTH legs end at base+68 (guard-fires skips directly;
+ guard-doesn't-fire runs the mul-check). -/
+theorem divK_div128_step2_branch_mer... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_577aab50ab9a_0 | 7a1f3ca041f0e9a0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V5Full.lean | FullPathN1V5Full | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "loopN1UnifiedPostV5_to_denormPreV5",
"depth": 1,
"n_commands": 0,
"n_lines": 32,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n delta fullDivN1DenormPreV5 fullDivN1C3V5 fullDivN1FrameV5\n rw [← fullN1S0_eq_fullDivN1R0V5, ← fullN1S... | [
{
"name": "iterN1Call_v5_unfoldU'",
"text": "theorem iterN1Call_v5_unfoldU' (v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :\n iterN1Call_v5 v0 v1 v2 v3 u0 u1 u2 u3 uTop\n = iterWithDoubleAddback (div128Quot_v5 u1 u0 v0) v0 v1 v2 v3 u0 u1 u2 u3 uTop := by\n unfold iterN1Call_v5; rfl\n\n",
"fan_in": 1,
... | [
{
"name": "loopN1UnifiedPostV5_to_denormPreV5",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 47,
"n_chars": 2667,
"n_subproofs": 0,
"n_tactics": 32,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 6,
"n_structural": 0,
"automation_only": f... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5Full
The v5 n=1 loop-post → denorm-epilogue bridge: `loopN1UnifiedPostV5` (the loop
result at `denormOff`) reduces to `fullDivN1DenormPreV5 ** fullDivN1FrameV5`, the
denorm-epilogue entry shape plus the untouched scratch/carry frame. Proven with
`xperm_chunked` aft... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5Full
The v5 n=1 loop-post → denorm-epilogue bridge: `loopN1UnifiedPostV5` (the loop
result at `denormOff`) reduces to `fullDivN1DenormPreV5 ** fullDivN1FrameV5`, the
denorm-epilogue entry shape plus the untouched scratch/carry frame. Proven with
`xperm_chunked` aft... | @@ -47,6 +47,11 @@
attribute [local irreducible] EvmWord.val256 div128Quot_v5 iterWithDoubleAddback mulsubN4 clzResult
+theorem iterN1Call_v5_unfoldU' (v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :
+ iterN1Call_v5 v0 v1 v2 v3 u0 u1 u2 u3 uTop
+ = iterWithDoubleAddback (div128Quot_v5 u1 u0 v0) v0 v1 v2 v3 u0 u1 u2 u... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_577aab50ab9a_1 | ddbb53053a1288d9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V5Full.lean | FullPathN1V5Full | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_div_n1_full_spec_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 36,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hshift_nz' : fullDivN1Shift b0 ≠ 0 := by simp only [fullDivN1Shift]; exact hshift_nz\n have hA := evm_... | [
{
"name": "loopN1UnifiedPostV5_to_denormPreV5",
"text": "/-- Loop result at `denormOff` reduces to the denorm-epilogue pre plus the frame. -/\ntheorem loopN1UnifiedPostV5_to_denormPreV5 (sp base a0 a1 a2 a3 b0 b1 b2 b3 scratchMem : Word)\n (h : PartialState)\n (hp : (loopN1UnifiedPostV5 sp base\n ... | [
{
"name": "evm_div_n1_full_spec_v5_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 83,
"n_chars": 5127,
"n_subproofs": 6,
"n_tactics": 38,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 4,
"n_structural": 2,
"automation_only": false,... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5Full
The v5 n=1 loop-post → denorm-epilogue bridge: `loopN1UnifiedPostV5` (the loop
result at `denormOff`) reduces to `fullDivN1DenormPreV5 ** fullDivN1FrameV5`, the
denorm-epilogue entry shape plus the untouched scratch/carry frame. Proven with
`xperm_chunked` aft... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5Full
The v5 n=1 loop-post → denorm-epilogue bridge: `loopN1UnifiedPostV5` (the loop
result at `denormOff`) reduces to `fullDivN1DenormPreV5 ** fullDivN1FrameV5`, the
denorm-epilogue entry shape plus the untouched scratch/carry frame. Proven with
`xperm_chunked` aft... | @@ -52,6 +52,51 @@
= iterWithDoubleAddback (div128Quot_v5 u1 u0 v0) v0 v1 v2 v3 u0 u1 u2 u3 uTop := by
unfold iterN1Call_v5; rfl
+/-- Loop result at `denormOff` reduces to the denorm-epilogue pre plus the frame. -/
+theorem loopN1UnifiedPostV5_to_denormPreV5 (sp base a0 a1 a2 a3 b0 b1 b2 b3 scratchMem : 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_c6de0f41ca55_0 | f73052093034a5ab | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Shift/ComposeBase.lean | ComposeBase | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "shr_phase_a_code_sub_ofProg",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold shr_phase_a_code shr_ld_or_acc_code\n apply CodeReq_union_sub_both\n · exact singleton_sub_ofProg bas... | [
{
"name": "singleton_sub_ofProg",
"text": "/-- A singleton at instruction `k` of a small program is subsumed by its `ofProg`. -/\ntheorem singleton_sub_ofProg (base addr : Word) (prog : List Instr) (instr : Instr) (k : Nat)\n (hk : k < prog.length)\n (hbound : 4 * prog.length < 2 ^ 64)\n (h_addr : ... | [
{
"name": "shr_phase_a_code_sub_ofProg",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 27,
"n_chars": 1564,
"n_subproofs": 0,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 21,
"n_rewrites": 1,
"n_structural": 13,
"automation_only": false,... | 2 | /-
EvmAsm.Evm64.Shift.ComposeBase
Shared helper lemmas and SHR sub-program bridges used across the
shift-opcode Compose modules (SHR `Compose.lean`, SHL `ShlCompose.lean`,
SAR `SarCompose.lean`).
Contents:
- Generic helpers: `regIs_to_regOwn`, `CodeReq_union_sub_both`,
`singleton_sub_ofProg`.
- SHR ... | /-
EvmAsm.Evm64.Shift.ComposeBase
Shared helper lemmas and SHR sub-program bridges used across the
shift-opcode Compose modules (SHR `Compose.lean`, SHL `ShlCompose.lean`,
SAR `SarCompose.lean`).
Contents:
- Generic helpers: `regIs_to_regOwn`, `CodeReq_union_sub_both`,
`singleton_sub_ofProg`.
- SHR ... | @@ -37,13 +37,27 @@
| none => simp [h1a] at h; exact h2 a i h
| some v => simp [h1a] at h; subst h; exact h1 a v h1a
+/-- A singleton at instruction `k` of a small program is subsumed by its `ofProg`. -/
+theorem singleton_sub_ofProg (base addr : Word) (prog : List Instr) (instr : Instr) (k : Nat)
+ (hk : k ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6de0f41ca55_1 | e1cbaba4854f525b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Shift/ComposeBase.lean | ComposeBase | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "shr_phase_a_code_sub_ofProg",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold shr_phase_a_code shr_ld_or_acc_code\n apply CodeReq_union_sub_both\n · exact singleton_sub_ofProg bas... | [
{
"name": "singleton_sub_ofProg",
"text": "/-- A singleton at instruction `k` of a small program is subsumed by its `ofProg`. -/\ntheorem singleton_sub_ofProg (base addr : Word) (prog : List Instr) (instr : Instr) (k : Nat)\n (hk : k < prog.length)\n (hbound : 4 * prog.length < 2 ^ 64)\n (h_addr : ... | [
{
"name": "shr_phase_c_code_sub_ofProg",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 15,
"n_chars": 797,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 9,
"n_rewrites": 1,
"n_structural": 5,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.Shift.ComposeBase
Shared helper lemmas and SHR sub-program bridges used across the
shift-opcode Compose modules (SHR `Compose.lean`, SHL `ShlCompose.lean`,
SAR `SarCompose.lean`).
Contents:
- Generic helpers: `regIs_to_regOwn`, `CodeReq_union_sub_both`,
`singleton_sub_ofProg`.
- SHR ... | /-
EvmAsm.Evm64.Shift.ComposeBase
Shared helper lemmas and SHR sub-program bridges used across the
shift-opcode Compose modules (SHR `Compose.lean`, SHL `ShlCompose.lean`,
SAR `SarCompose.lean`).
Contents:
- Generic helpers: `regIs_to_regOwn`, `CodeReq_union_sub_both`,
`singleton_sub_ofProg`.
- SHR ... | @@ -37,13 +37,27 @@
| none => simp [h1a] at h; exact h2 a i h
| some v => simp [h1a] at h; subst h; exact h1 a v h1a
+/-- A singleton at instruction `k` of a small program is subsumed by its `ofProg`. -/
+theorem singleton_sub_ofProg (base addr : Word) (prog : List Instr) (instr : Instr) (k : Nat)
+ (hk : k ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_82ceb0ff0b03_0 | c94cc01c896db534 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldReduceOnceNSAsm.lean | Secp256k1FieldReduceOnceNSAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "copyPost_to_reducePost",
"depth": 1,
"n_commands": 0,
"n_lines": 27,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h hp\n unfold copyArmPostFrame at hp\n unfold reduceJoinPost\n extract_pure_deep hp\n obtain ⟨hflag, hp⟩ ... | [
{
"name": "cmpFlag_ne_zero_reduce",
"text": "private theorem cmpFlag_ne_zero_reduce (xs orig : List (BitVec 8))\n (hflag : cmpFlagWordN xs ≠ (0 : Word)) :\n reduceOnceNFlag xs = (0 : Word) ∧ reduceOnceNBytes xs orig = xs := by\n unfold cmpFlagWordN reduceOnceNFlag reduceOnceNBytes at *\n by_cases hl... | [
{
"name": "copyPost_to_reducePost",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 31,
"n_chars": 1378,
"n_subproofs": 4,
"n_tactics": 27,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 4,
"n_structural": 3,
"automation_only": false,
"m... | 1 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsm
Final branch merge and whole-frame CPS proof for `secf_reduce_once`.
-/
import EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsmSupport
namespace EvmAsm.Codegen
open EvmAsm.Rv64 EvmAsm.Rv64.SAsm EvmAsm.Crypto
namespace Secp256k1FieldReduceOnceNSAsm
... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsm
Final branch merge and whole-frame CPS proof for `secf_reduce_once`.
-/
import EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsmSupport
namespace EvmAsm.Codegen
open EvmAsm.Rv64 EvmAsm.Rv64.SAsm EvmAsm.Crypto
namespace Secp256k1FieldReduceOnceNSAsm
... | @@ -14,6 +14,14 @@
#guard secfReduceOnceN_prog.length = 32
+private theorem cmpFlag_ne_zero_reduce (xs orig : List (BitVec 8))
+ (hflag : cmpFlagWordN xs ≠ (0 : Word)) :
+ reduceOnceNFlag xs = (0 : Word) ∧ reduceOnceNBytes xs orig = xs := by
+ unfold cmpFlagWordN reduceOnceNFlag reduceOnceNBytes at *
+ by_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_82ceb0ff0b03_1 | 614279fc11c1f60f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldReduceOnceNSAsm.lean | Secp256k1FieldReduceOnceNSAsm | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "copyBranchToReduceJoin_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hcopy0 := copyArm_spec src dst (GuestAddrs.secf_reduce_once_n + 48 : Word)\n (0 : Word) (GuestAddrs.se... | [
{
"name": "copyPost_to_reducePost",
"text": "private theorem copyPost_to_reducePost (src dst : Word) (xs orig : List (BitVec 8)) :\n ∀ h, copyArmPostFrame src dst xs h → reduceJoinPost src dst xs orig h := by\n intro h hp\n unfold copyArmPostFrame at hp\n unfold reduceJoinPost\n extract_pure_deep hp\... | [
{
"name": "copyBranchToReduceJoin_spec",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 24,
"n_chars": 1180,
"n_subproofs": 4,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
... | 3 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsm
Final branch merge and whole-frame CPS proof for `secf_reduce_once`.
-/
import EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsmSupport
namespace EvmAsm.Codegen
open EvmAsm.Rv64 EvmAsm.Rv64.SAsm EvmAsm.Crypto
namespace Secp256k1FieldReduceOnceNSAsm
... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsm
Final branch merge and whole-frame CPS proof for `secf_reduce_once`.
-/
import EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsmSupport
namespace EvmAsm.Codegen
open EvmAsm.Rv64 EvmAsm.Rv64.SAsm EvmAsm.Crypto
namespace Secp256k1FieldReduceOnceNSAsm
... | @@ -126,6 +126,35 @@
(⌜cmpFlagWordN xs = 0⌝ ** ((.x0 : Reg) ↦ᵣ (0 : Word)) **
((GuestAddrs.secf_cmp : Word) ↦ₘ cmpFlagWordN xs)))
+private theorem copyPost_to_reducePost (src dst : Word) (xs orig : List (BitVec 8)) :
+ ∀ h, copyArmPostFrame src dst xs h → reduceJoinPost src dst xs orig h := by
+ intro... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_82ceb0ff0b03_2 | 9e9337f37ed0ffcf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldReduceOnceNSAsm.lean | Secp256k1FieldReduceOnceNSAsm | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "subPost_to_reducePost",
"depth": 1,
"n_commands": 0,
"n_lines": 27,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h hp\n unfold subArmPostFrame at hp\n unfold reduceJoinPost\n extract_pure_deep hp\n obtain ⟨hflag, hp⟩ :=... | [
{
"name": "cmpFlag_eq_zero_reduce",
"text": "private theorem cmpFlag_eq_zero_reduce (xs orig : List (BitVec 8))\n (hflag : cmpFlagWordN xs = (0 : Word)) :\n reduceOnceNFlag xs = (1 : Word) ∧\n reduceOnceNBytes xs orig = U256SubBeSAsm.u256SubBeBytes xs secfNBytes orig := by\n unfold cmpFlagWordN ... | [
{
"name": "subPost_to_reducePost",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 33,
"n_chars": 1470,
"n_subproofs": 4,
"n_tactics": 27,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 4,
"n_structural": 3,
"automation_only": false,
"ma... | 1 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsm
Final branch merge and whole-frame CPS proof for `secf_reduce_once`.
-/
import EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsmSupport
namespace EvmAsm.Codegen
open EvmAsm.Rv64 EvmAsm.Rv64.SAsm EvmAsm.Crypto
namespace Secp256k1FieldReduceOnceNSAsm
... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsm
Final branch merge and whole-frame CPS proof for `secf_reduce_once`.
-/
import EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsmSupport
namespace EvmAsm.Codegen
open EvmAsm.Rv64 EvmAsm.Rv64.SAsm EvmAsm.Crypto
namespace Secp256k1FieldReduceOnceNSAsm
... | @@ -14,6 +14,15 @@
#guard secfReduceOnceN_prog.length = 32
+private theorem cmpFlag_eq_zero_reduce (xs orig : List (BitVec 8))
+ (hflag : cmpFlagWordN xs = (0 : Word)) :
+ reduceOnceNFlag xs = (1 : Word) ∧
+ reduceOnceNBytes xs orig = U256SubBeSAsm.u256SubBeBytes xs secfNBytes orig := by
+ unfold cmpFl... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_82ceb0ff0b03_3 | 19679426c0ed021e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldReduceOnceNSAsm.lean | Secp256k1FieldReduceOnceNSAsm | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "subBranchToReduceJoin_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hsub0 := subArm_spec src dst (GuestAddrs.secf_reduce_once_n + 48 : Word)\n (0 : Word) (GuestAddrs.secf_... | [
{
"name": "subPost_to_reducePost",
"text": "private theorem subPost_to_reducePost (src dst : Word) (xs orig : List (BitVec 8)) :\n ∀ h, subArmPostFrame src dst xs orig h → reduceJoinPost src dst xs orig h := by\n intro h hp\n unfold subArmPostFrame at hp\n unfold reduceJoinPost\n extract_pure_deep hp... | [
{
"name": "subBranchToReduceJoin_spec",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 33,
"n_chars": 1654,
"n_subproofs": 4,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
... | 3 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsm
Final branch merge and whole-frame CPS proof for `secf_reduce_once`.
-/
import EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsmSupport
namespace EvmAsm.Codegen
open EvmAsm.Rv64 EvmAsm.Rv64.SAsm EvmAsm.Crypto
namespace Secp256k1FieldReduceOnceNSAsm
... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsm
Final branch merge and whole-frame CPS proof for `secf_reduce_once`.
-/
import EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsmSupport
namespace EvmAsm.Codegen
open EvmAsm.Rv64 EvmAsm.Rv64.SAsm EvmAsm.Crypto
namespace Secp256k1FieldReduceOnceNSAsm
... | @@ -126,6 +126,35 @@
(⌜cmpFlagWordN xs = 0⌝ ** ((.x0 : Reg) ↦ᵣ (0 : Word)) **
((GuestAddrs.secf_cmp : Word) ↦ₘ cmpFlagWordN xs)))
+private theorem subPost_to_reducePost (src dst : Word) (xs orig : List (BitVec 8)) :
+ ∀ h, subArmPostFrame src dst xs orig h → reduceJoinPost src dst xs orig h := by
+ in... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_82ceb0ff0b03_4 | 0469dcdd74d38fa8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldReduceOnceNSAsm.lean | Secp256k1FieldReduceOnceNSAsm | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "subBranchToReduceJoin_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hsub0 := subArm_spec src dst (GuestAddrs.secf_reduce_once_n + 48 : Word)\n (0 : Word) (GuestAddrs.secf_... | [
{
"name": "subPost_to_reducePost",
"text": "private theorem subPost_to_reducePost (src dst : Word) (xs orig : List (BitVec 8)) :\n ∀ h, subArmPostFrame src dst xs orig h → reduceJoinPost src dst xs orig h := by\n intro h hp\n unfold subArmPostFrame at hp\n unfold reduceJoinPost\n extract_pure_deep hp... | [
{
"name": "reduceBodyBranch_spec",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 9,
"n_lines": 53,
"n_chars": 2825,
"n_subproofs": 5,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"ma... | 9 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsm
Final branch merge and whole-frame CPS proof for `secf_reduce_once`.
-/
import EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsmSupport
namespace EvmAsm.Codegen
open EvmAsm.Rv64 EvmAsm.Rv64.SAsm EvmAsm.Crypto
namespace Secp256k1FieldReduceOnceNSAsm
... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsm
Final branch merge and whole-frame CPS proof for `secf_reduce_once`.
-/
import EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsmSupport
namespace EvmAsm.Codegen
open EvmAsm.Rv64 EvmAsm.Rv64.SAsm EvmAsm.Crypto
namespace Secp256k1FieldReduceOnceNSAsm
... | @@ -238,6 +238,35 @@
xperm_hyp hq
exact copyPost_to_reducePost src dst xs orig h hq1
+private theorem subPost_to_reducePost (src dst : Word) (xs orig : List (BitVec 8)) :
+ ∀ h, subArmPostFrame src dst xs orig h → reduceJoinPost src dst xs orig h := by
+ intro h hp
+ unfold subArmPostFrame at hp
+ u... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_82ceb0ff0b03_5 | 76cc7d4c287ac3b1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Secp256k1FieldReduceOnceNSAsm.lean | Secp256k1FieldReduceOnceNSAsm | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "secfReduceOnceNFrame_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 40,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n set newSp := sp0 + signExtend12 (-32 : BitVec 12) with hnewSp\n have halloc0 := addi_spec_gen_same_within .x2 s... | [
{
"name": "reduceBodyBranch_spec",
"text": "private theorem reduceBodyBranch_spec (src dst ret v8 v9 v12 : Word)\n (xs orig : List (BitVec 8))\n (hroX : Region.wf ⟨src, xs⟩)\n (hrwDst : RwRegion.wf ⟨dst, 32⟩)\n (hlenX : xs.length = 32) (hlenOrig : orig.length = 32)\n (halignX : src.toNat % 8 ... | [
{
"name": "secfReduceOnceNFrame_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 11,
"n_lines": 67,
"n_chars": 3788,
"n_subproofs": 12,
"n_tactics": 41,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 10,
"n_structural": 1,
"automation_only": false,
... | 11 | /-
EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsm
Final branch merge and whole-frame CPS proof for `secf_reduce_once`.
-/
import EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsmSupport
namespace EvmAsm.Codegen
open EvmAsm.Rv64 EvmAsm.Rv64.SAsm EvmAsm.Crypto
namespace Secp256k1FieldReduceOnceNSAsm
... | /-
EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsm
Final branch merge and whole-frame CPS proof for `secf_reduce_once`.
-/
import EvmAsm.Codegen.Programs.Secp256k1FieldReduceOnceNSAsmSupport
namespace EvmAsm.Codegen
open EvmAsm.Rv64 EvmAsm.Rv64.SAsm EvmAsm.Crypto
namespace Secp256k1FieldReduceOnceNSAsm
... | @@ -298,6 +298,57 @@
xperm_hyp hq
exact subPost_to_reducePost src dst xs orig h hq1
+private theorem reduceBodyBranch_spec (src dst ret v8 v9 v12 : Word)
+ (xs orig : List (BitVec 8))
+ (hroX : Region.wf ⟨src, xs⟩)
+ (hrwDst : RwRegion.wf ⟨dst, 32⟩)
+ (hlenX : xs.length = 32) (hlenOrig : orig.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_d0c9f7e2a2bf_0 | 8756e95cb8225498 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2V4NoNopLoopUnified.lean | FullPathN2V4NoNopLoopUnified | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_div_n2_loop_unified_inst_noNop_exact_x1_v4",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases bltu_2 <;> cases bltu_1 <;> cases bltu_0 <;>\n (simp only at hbltu_0 hbltu_1 hbltu_2... | [
{
"name": "divK_loop_n2_unified_from_source_exact_loopIterScratch_v4_noNop",
"text": "/-- Unified n=2 v4 no-NOP loop source theorem, dispatching to the 8 per-case\n proofs via `bltu_2 × bltu_1 × bltu_0`. Preserves caller-owned exact `x1`.\n The 672-step bound accommodates the worst-case (all-call) pa... | [
{
"name": "evm_div_n2_loop_unified_inst_noNop_exact_x1_v4",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 85,
"n_chars": 4907,
"n_subproofs": 0,
"n_tactics": 14,
"cyclomatic": 7,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 4,
"automat... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V4NoNopLoopUnified
Unified 8-case v4/no-NOP loop dispatcher for n=2, plus preloop bridge.
Defines `loopN2UnifiedPostV4NoX1` (8 cases via bltu_2 × bltu_1 × bltu_0)
and proves `divK_loop_n2_unified_from_source_exact_loopIterScratch_v4_noNop`
by dispatching to the 8 per-... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V4NoNopLoopUnified
Unified 8-case v4/no-NOP loop dispatcher for n=2, plus preloop bridge.
Defines `loopN2UnifiedPostV4NoX1` (8 cases via bltu_2 × bltu_1 × bltu_0)
and proves `divK_loop_n2_unified_from_source_exact_loopIterScratch_v4_noNop`
by dispatching to the 8 per-... | @@ -193,6 +193,465 @@
isAddbackCarry2NzN2Max v0 v1 v2 v3
u0Orig0 r1.2.1 r1.2.2.1 r1.2.2.2.1 r1.2.2.2.2.1)
+/-- Unified n=2 v4 no-NOP loop source theorem, dispatching to the 8 per-case
+ proofs via `bltu_2 × bltu_1 × bltu_0`. Preserves caller-owned exact `x1`.
+ The 672-step bound accommodates the w... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4181f9c9bae7_0 | 6a54016ae1f79709 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/CallableV5Div.lean | CallableV5Div | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "evm_div_callable_code_v5_ret_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro a i h\n apply callable_b12_div_v5\n unfold cc_ret_code cc_ret\n simpa [CodeReq.ofProg] using h",
... | [
{
"name": "callable_b12_div_v5",
"text": "private theorem callable_b12_div_v5 {b : Word} :\n ∀ a i, (cc_ret_code (b + nopOff)) a = some i →\n (evm_div_callable_code_v5 b) a = some i := by\n unfold evm_div_callable_code_v5; simp only [CodeReq.unionAll_cons]\n skipBlockCC; skipBlockCC; skipBlockCC; ... | [
{
"name": "evm_div_callable_code_v5_ret_sub",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 409,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false... | 1 | /-
EvmAsm.Evm64.DivMod.CallableV5Div
v5 LP64-callable DIV adapter: code-subsumption lemmas from the v5 DIV body
surface (`divCode_noNop_v5`) into the callable code `evm_div_callable_code_v5`,
the `cc_ret` return-instruction subsumption, and the callable wrappers that
append the return to an x1(-and-x9)-prese... | /-
EvmAsm.Evm64.DivMod.CallableV5Div
v5 LP64-callable DIV adapter: code-subsumption lemmas from the v5 DIV body
surface (`divCode_noNop_v5`) into the callable code `evm_div_callable_code_v5`,
the `cc_ret` return-instruction subsumption, and the callable wrappers that
append the return to an x1(-and-x9)-prese... | @@ -24,11 +24,22 @@
open EvmAsm.Rv64
+private theorem callable_b12_div_v5 {b : Word} :
+ ∀ a i, (cc_ret_code (b + nopOff)) a = some i →
+ (evm_div_callable_code_v5 b) a = some i := by
+ unfold evm_div_callable_code_v5; simp only [CodeReq.unionAll_cons]
+ skipBlockCC; skipBlockCC; skipBlockCC; skipBlockCC... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4181f9c9bae7_1 | 2021b3fd615605fb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/CallableV5Div.lean | CallableV5Div | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "divCode_noNop_v5_sub_div_callable_code_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold divCode_noNop_v5; simp only [CodeReq.unionAll_cons]\n exact CodeReq.union_split_mono cal... | [
{
"name": "callable_b6_div_v5",
"text": "private theorem callable_b6_div_v5 {b : Word} :\n ∀ a i, (CodeReq.ofProg (b + copyAUOff) divK_copyAU) a = some i →\n (evm_div_callable_code_v5 b) a = some i := by\n unfold evm_div_callable_code_v5; simp only [CodeReq.unionAll_cons]\n skipBlock; skipBlock; s... | [
{
"name": "divCode_noNop_v5_sub_div_callable_code_v5",
"fan_in": 1,
"n_deps_direct": 13,
"n_deps_transitive": 13,
"n_lines": 22,
"n_chars": 1115,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automation... | 13 | /-
EvmAsm.Evm64.DivMod.CallableV5Div
v5 LP64-callable DIV adapter: code-subsumption lemmas from the v5 DIV body
surface (`divCode_noNop_v5`) into the callable code `evm_div_callable_code_v5`,
the `cc_ret` return-instruction subsumption, and the callable wrappers that
append the return to an x1(-and-x9)-prese... | /-
EvmAsm.Evm64.DivMod.CallableV5Div
v5 LP64-callable DIV adapter: code-subsumption lemmas from the v5 DIV body
surface (`divCode_noNop_v5`) into the callable code `evm_div_callable_code_v5`,
the `cc_ret` return-instruction subsumption, and the callable wrappers that
append the return to an x1(-and-x9)-prese... | @@ -54,6 +54,11 @@
(evm_div_callable_code_v5 b) a = some i := by
unfold evm_div_callable_code_v5; simp only [CodeReq.unionAll_cons]
skipBlock; skipBlock; skipBlock; skipBlock; skipBlock; exact CodeReq.union_mono_left
+private theorem callable_b6_div_v5 {b : Word} :
+ ∀ a i, (CodeReq.ofProg (b + copyAUOf... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4181f9c9bae7_2 | b3467df181446c72 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/CallableV5Div.lean | CallableV5Div | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "divCode_noNop_v5_sub_div_callable_code_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold divCode_noNop_v5; simp only [CodeReq.unionAll_cons]\n exact CodeReq.union_split_mono cal... | [
{
"name": "callable_b8_div_v5",
"text": "private theorem callable_b8_div_v5 {b : Word} :\n ∀ a i, (CodeReq.ofProg (b + loopBodyOff) (divK_loopBody 560 7736)) a = some i →\n (evm_div_callable_code_v5 b) a = some i := by\n unfold evm_div_callable_code_v5; simp only [CodeReq.unionAll_cons]\n skipBloc... | [
{
"name": "evm_div_callable_v5_spec_from_noNop_preserving_x1_x9",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 16,
"n_lines": 51,
"n_chars": 2458,
"n_subproofs": 4,
"n_tactics": 25,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"... | 16 | /-
EvmAsm.Evm64.DivMod.CallableV5Div
v5 LP64-callable DIV adapter: code-subsumption lemmas from the v5 DIV body
surface (`divCode_noNop_v5`) into the callable code `evm_div_callable_code_v5`,
the `cc_ret` return-instruction subsumption, and the callable wrappers that
append the return to an x1(-and-x9)-prese... | /-
EvmAsm.Evm64.DivMod.CallableV5Div
v5 LP64-callable DIV adapter: code-subsumption lemmas from the v5 DIV body
surface (`divCode_noNop_v5`) into the callable code `evm_div_callable_code_v5`,
the `cc_ret` return-instruction subsumption, and the callable wrappers that
append the return to an x1(-and-x9)-prese... | @@ -65,6 +65,12 @@
unfold evm_div_callable_code_v5; simp only [CodeReq.unionAll_cons]
skipBlock; skipBlock; skipBlock; skipBlock; skipBlock; skipBlock; skipBlock
exact CodeReq.union_mono_left
+private theorem callable_b8_div_v5 {b : Word} :
+ ∀ a i, (CodeReq.ofProg (b + loopBodyOff) (divK_loopBody 560 7736)... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4181f9c9bae7_3 | 188bb71a407dc994 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/CallableV5Div.lean | CallableV5Div | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "divCode_noNop_v5_sub_div_callable_code_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold divCode_noNop_v5; simp only [CodeReq.unionAll_cons]\n exact CodeReq.union_split_mono cal... | [
{
"name": "callable_b8_div_v5",
"text": "private theorem callable_b8_div_v5 {b : Word} :\n ∀ a i, (CodeReq.ofProg (b + loopBodyOff) (divK_loopBody 560 7736)) a = some i →\n (evm_div_callable_code_v5 b) a = some i := by\n unfold evm_div_callable_code_v5; simp only [CodeReq.unionAll_cons]\n skipBloc... | [
{
"name": "evm_div_callable_v5_spec_from_noNop_exact_frame",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 17,
"n_lines": 28,
"n_chars": 1357,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automa... | 17 | /-
EvmAsm.Evm64.DivMod.CallableV5Div
v5 LP64-callable DIV adapter: code-subsumption lemmas from the v5 DIV body
surface (`divCode_noNop_v5`) into the callable code `evm_div_callable_code_v5`,
the `cc_ret` return-instruction subsumption, and the callable wrappers that
append the return to an x1(-and-x9)-prese... | /-
EvmAsm.Evm64.DivMod.CallableV5Div
v5 LP64-callable DIV adapter: code-subsumption lemmas from the v5 DIV body
surface (`divCode_noNop_v5`) into the callable code `evm_div_callable_code_v5`,
the `cc_ret` return-instruction subsumption, and the callable wrappers that
append the return to an x1(-and-x9)-prese... | @@ -65,6 +65,12 @@
unfold evm_div_callable_code_v5; simp only [CodeReq.unionAll_cons]
skipBlock; skipBlock; skipBlock; skipBlock; skipBlock; skipBlock; skipBlock
exact CodeReq.union_mono_left
+private theorem callable_b8_div_v5 {b : Word} :
+ ∀ a i, (CodeReq.ofProg (b + loopBodyOff) (divK_loopBody 560 7736)... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dd3733974a6e_0 | f459f36deb54f6a9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Dispatch/Spec.lean | Spec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "dispatch_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 28,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Step A: build the 5-step compose triple over the explicit entry cell.\n have hcompose := evm_dispatch_compose_within bas... | [
{
"name": "pcFree_dispatchTableIs_rest",
"text": "/-- The residual `dispatchTableIs.rest` chain (everything except the\n selected entry) is `pcFree`. -/\ntheorem pcFree_dispatchTableIs_rest\n (base : Word) (handlers : Fin 256 → Word) (opcode : Fin 256) :\n (dispatchTableIs.rest base handlers opcode... | [
{
"name": "dispatch_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 64,
"n_chars": 3021,
"n_subproofs": 3,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 3,
"automation_only": false,
"max_nestin... | 1 | /-
EvmAsm.Evm64.Dispatch.Spec
Slice 3 of GH #106 (parent `evm-asm-77w8s`, this slice
`evm-asm-afkny`). Top-level Hoare triple `dispatch_spec` for the
full RV64 dispatch sequence (`evm_dispatch`, slice 2), expressed
against the full `dispatchTableIs` jump-table layout rather than
the explicit entry cell ex... | /-
EvmAsm.Evm64.Dispatch.Spec
Slice 3 of GH #106 (parent `evm-asm-77w8s`, this slice
`evm-asm-afkny`). Top-level Hoare triple `dispatch_spec` for the
full RV64 dispatch sequence (`evm_dispatch`, slice 2), expressed
against the full `dispatchTableIs` jump-table layout rather than
the explicit entry cell ex... | @@ -46,6 +46,16 @@
· simp [h]
exact pcFree_emp
+/-- The residual `dispatchTableIs.rest` chain (everything except the
+ selected entry) is `pcFree`. -/
+theorem pcFree_dispatchTableIs_rest
+ (base : Word) (handlers : Fin 256 → Word) (opcode : Fin 256) :
+ (dispatchTableIs.rest base handlers op... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c0520a35e226_0 | 8a0f693d740aa75e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/NormBV5.lean | NormBV5 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "divK_normB_half1_within_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro b3' b2'\n have hm1 := divK_normB_merge_spec_within 56 48 sp b3 b2 v5 v7 shift antiShift (base + no... | [
{
"name": "divK_normB_code_sub_divCode_noNop_v5",
"text": "/-- The normB block instructions are subsumed by `divCode_noNop_v5`. -/\nprivate theorem divK_normB_code_sub_divCode_noNop_v5 {base : Word} :\n ∀ a i, (CodeReq.ofProg (base + normBOff) divK_normB) a = some i →\n (divCode_noNop_v5 base) a = s... | [
{
"name": "divK_normB_half1_within_v5_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 44,
"n_chars": 2355,
"n_subproofs": 7,
"n_tactics": 30,
"cyclomatic": 1,
"n_automation": 9,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": fal... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.NormBV5
v5 normalize-B brick (21 steps, normBOff → normAOff) over `divCode_noNop_v5`.
Mirror of `divK_normB_full_spec_within_v4_noNop` (Norm.lean): the normB
instructions don't touch div128, so the same version-agnostic merge/last bodies
are extended to the v5 code via the v5 b... | /-
EvmAsm.Evm64.DivMod.Compose.NormBV5
v5 normalize-B brick (21 steps, normBOff → normAOff) over `divCode_noNop_v5`.
Mirror of `divK_normB_full_spec_within_v4_noNop` (Norm.lean): the normB
instructions don't touch div128, so the same version-agnostic merge/last bodies
are extended to the v5 code via the v5 b... | @@ -17,6 +17,13 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (se12_32 se12_40 se12_48 se12_56)
+/-- The normB block instructions are subsumed by `divCode_noNop_v5`. -/
+private theorem divK_normB_code_sub_divCode_noNop_v5 {base : Word} :
+ ∀ a i, (CodeReq.ofProg (base + normBOff) divK_normB) a = some i ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c0520a35e226_1 | 2313b8bc6fbbb869 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/NormBV5.lean | NormBV5 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "divK_normB_half1_within_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro b3' b2'\n have hm1 := divK_normB_merge_spec_within 56 48 sp b3 b2 v5 v7 shift antiShift (base + no... | [
{
"name": "divK_normB_code_sub_divCode_noNop_v5",
"text": "/-- The normB block instructions are subsumed by `divCode_noNop_v5`. -/\nprivate theorem divK_normB_code_sub_divCode_noNop_v5 {base : Word} :\n ∀ a i, (CodeReq.ofProg (base + normBOff) divK_normB) a = some i →\n (divCode_noNop_v5 base) a = s... | [
{
"name": "divK_normB_half2_within_v5_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 46,
"n_chars": 2514,
"n_subproofs": 7,
"n_tactics": 32,
"cyclomatic": 1,
"n_automation": 9,
"n_rewrites": 4,
"n_structural": 2,
"automation_only": fal... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.NormBV5
v5 normalize-B brick (21 steps, normBOff → normAOff) over `divCode_noNop_v5`.
Mirror of `divK_normB_full_spec_within_v4_noNop` (Norm.lean): the normB
instructions don't touch div128, so the same version-agnostic merge/last bodies
are extended to the v5 code via the v5 b... | /-
EvmAsm.Evm64.DivMod.Compose.NormBV5
v5 normalize-B brick (21 steps, normBOff → normAOff) over `divCode_noNop_v5`.
Mirror of `divK_normB_full_spec_within_v4_noNop` (Norm.lean): the normB
instructions don't touch div128, so the same version-agnostic merge/last bodies
are extended to the v5 code via the v5 b... | @@ -17,6 +17,13 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (se12_32 se12_40 se12_48 se12_56)
+/-- The normB block instructions are subsumed by `divCode_noNop_v5`. -/
+private theorem divK_normB_code_sub_divCode_noNop_v5 {base : Word} :
+ ∀ a i, (CodeReq.ofProg (base + normBOff) divK_normB) a = some i ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c0520a35e226_2 | 295235eb458e1170 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/NormBV5.lean | NormBV5 | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "divK_normB_half1_within_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro b3' b2'\n have hm1 := divK_normB_merge_spec_within 56 48 sp b3 b2 v5 v7 shift antiShift (base + no... | [
{
"name": "divK_normB_code_sub_divCode_noNop_v5",
"text": "/-- The normB block instructions are subsumed by `divCode_noNop_v5`. -/\nprivate theorem divK_normB_code_sub_divCode_noNop_v5 {base : Word} :\n ∀ a i, (CodeReq.ofProg (base + normBOff) divK_normB) a = some i →\n (divCode_noNop_v5 base) a = s... | [
{
"name": "divK_normB_full_spec_within_v5_noNop",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 23,
"n_chars": 1221,
"n_subproofs": 2,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only":... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.NormBV5
v5 normalize-B brick (21 steps, normBOff → normAOff) over `divCode_noNop_v5`.
Mirror of `divK_normB_full_spec_within_v4_noNop` (Norm.lean): the normB
instructions don't touch div128, so the same version-agnostic merge/last bodies
are extended to the v5 code via the v5 b... | /-
EvmAsm.Evm64.DivMod.Compose.NormBV5
v5 normalize-B brick (21 steps, normBOff → normAOff) over `divCode_noNop_v5`.
Mirror of `divK_normB_full_spec_within_v4_noNop` (Norm.lean): the normB
instructions don't touch div128, so the same version-agnostic merge/last bodies
are extended to the v5 code via the v5 b... | @@ -17,6 +17,13 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (se12_32 se12_40 se12_48 se12_56)
+/-- The normB block instructions are subsumed by `divCode_noNop_v5`. -/
+private theorem divK_normB_code_sub_divCode_noNop_v5 {base : Word} :
+ ∀ a i, (CodeReq.ofProg (base + normBOff) divK_normB) a = some i ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_cdaa355ffc3c_0 | 38c80cc3c6e4dec5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Compose/CarryBlockSpecs.lean | CarryBlockSpecs | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "evm_addmod_carry_plus_one_args_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 47,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro q0 k0 q1 k1 q2 k2 q3 k3\n simp only [q0, k0, q1, k1, q2, k2, q3, k3]\n have P0 := evm_a... | [
{
"name": "evm_addmod_carry_plus_one_reload_spec_within",
"text": "/-- Plus-one chunk (N reload): copy the parked `N` from S1 back into the\n divisor slots `F + 32..56` (8 LD/SD pairs). -/\ntheorem evm_addmod_carry_plus_one_reload_spec_within\n (sp base x5Old : Word) (n0 n1 n2 n3 u0 u1 u2 u3 : Word) :... | [
{
"name": "evm_addmod_carry_plus_one_args_spec_within",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 97,
"n_chars": 4912,
"n_subproofs": 5,
"n_tactics": 47,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_... | 3 | /-
EvmAsm.Evm64.AddMod.Compose.CarryBlockSpecs
Per-block `cpsTripleWithin` leaf specs for the straight-line carry-path
blocks of `evm_addmod_total` (issue #9704, Phase 3):
* `evm_addmod_carry_save_operands` — park N → S1, r → S2
* `evm_addmod_carry_minus_one_args` — materialize 2^256−1 in F+0..24
*... | /-
EvmAsm.Evm64.AddMod.Compose.CarryBlockSpecs
Per-block `cpsTripleWithin` leaf specs for the straight-line carry-path
blocks of `evm_addmod_total` (issue #9704, Phase 3):
* `evm_addmod_carry_save_operands` — park N → S1, r → S2
* `evm_addmod_carry_minus_one_args` — materialize 2^256−1 in F+0..24
*... | @@ -145,6 +145,47 @@
have S := sd_spec_gen_within .x12 .x6 sp (m + carryIn) w offW (base + 12)
runBlock L A C S
+/-- Plus-one chunk (N reload): copy the parked `N` from S1 back into the
+ divisor slots `F + 32..56` (8 LD/SD pairs). -/
+theorem evm_addmod_carry_plus_one_reload_spec_within
+ (sp base x5Old ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e722e784c961_0 | 896c845647201a4e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WalkDecodeBridge.lean | WalkDecodeBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 4 | [
{
"theorem_name": "decodeAux_singleByte_bridge",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [drop_eq_cons_of_getElem? hget]\n exact decodeAux_cons_singleByte_of_classifyPrefix n b (bytes.drop (off + ... | [
{
"name": "drop_eq_cons_of_getElem?",
"text": "/-- A byte present at offset `off` peels off the front of `drop off`. -/\ntheorem drop_eq_cons_of_getElem? {bytes : List Byte} {off : Nat} {b : Byte}\n (hget : bytes[off]? = some b) :\n bytes.drop off = b :: bytes.drop (off + 1) := by\n have hlt : off < ... | [
{
"name": "decodeAux_singleByte_bridge",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 473,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Rv64.RLP.WalkDecodeBridge
Reusable pure bridge from the cursor-walk view used by `rlp_walk_next`
to the EL RLP decoder. The walk routines expose offsets into one byte
buffer; these lemmas turn per-item offset facts into `decodeAux`,
`decodeItems`, and finally `decodeFully` facts.
-/
import EvmAsm... | /-
EvmAsm.Rv64.RLP.WalkDecodeBridge
Reusable pure bridge from the cursor-walk view used by `rlp_walk_next`
to the EL RLP decoder. The walk routines expose offsets into one byte
buffer; these lemmas turn per-item offset facts into `decodeAux`,
`decodeItems`, and finally `decodeFully` facts.
-/
import EvmAsm... | @@ -16,10 +16,25 @@
open EvmAsm.EL.RLP
+/-- A byte present at offset `off` peels off the front of `drop off`. -/
+theorem drop_eq_cons_of_getElem? {bytes : List Byte} {off : Nat} {b : Byte}
+ (hget : bytes[off]? = some b) :
+ bytes.drop off = b :: bytes.drop (off + 1) := by
+ have hlt : off < bytes.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_e722e784c961_1 | 910b0fff9c89009d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WalkDecodeBridge.lean | WalkDecodeBridge | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 4 | [
{
"theorem_name": "decodeAux_singleByte_bridge",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [drop_eq_cons_of_getElem? hget]\n exact decodeAux_cons_singleByte_of_classifyPrefix n b (bytes.drop (off + ... | [
{
"name": "drop_eq_cons_of_getElem?",
"text": "/-- A byte present at offset `off` peels off the front of `drop off`. -/\ntheorem drop_eq_cons_of_getElem? {bytes : List Byte} {off : Nat} {b : Byte}\n (hget : bytes[off]? = some b) :\n bytes.drop off = b :: bytes.drop (off + 1) := by\n have hlt : off < ... | [
{
"name": "decodeAux_shortBytes_bridge",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 48,
"n_chars": 2123,
"n_subproofs": 9,
"n_tactics": 35,
"cyclomatic": 3,
"n_automation": 11,
"n_rewrites": 5,
"n_structural": 5,
"automation_only": false,
... | 1 | /-
EvmAsm.Rv64.RLP.WalkDecodeBridge
Reusable pure bridge from the cursor-walk view used by `rlp_walk_next`
to the EL RLP decoder. The walk routines expose offsets into one byte
buffer; these lemmas turn per-item offset facts into `decodeAux`,
`decodeItems`, and finally `decodeFully` facts.
-/
import EvmAsm... | /-
EvmAsm.Rv64.RLP.WalkDecodeBridge
Reusable pure bridge from the cursor-walk view used by `rlp_walk_next`
to the EL RLP decoder. The walk routines expose offsets into one byte
buffer; these lemmas turn per-item offset facts into `decodeAux`,
`decodeItems`, and finally `decodeFully` facts.
-/
import EvmAsm... | @@ -16,6 +16,18 @@
open EvmAsm.EL.RLP
+/-- A byte present at offset `off` peels off the front of `drop off`. -/
+theorem drop_eq_cons_of_getElem? {bytes : List Byte} {off : Nat} {b : Byte}
+ (hget : bytes[off]? = some b) :
+ bytes.drop off = b :: bytes.drop (off + 1) := by
+ have hlt : off < bytes.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_e722e784c961_2 | d408022a25735460 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WalkDecodeBridge.lean | WalkDecodeBridge | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "decodeItems_four_of_decodeAux",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hne : ∀ {o item r}, decodeAux 1 (bytes.drop o) = some (item, r) → bytes.drop o ≠ [] := by\n intro o ... | [
{
"name": "decodeItems_cons_of_decodeAux",
"text": "/-- Prepend one decoded item to a recursive `decodeItems` run. -/\ntheorem decodeItems_cons_of_decodeAux (bytes : List Byte) (off nextOff : Nat) (item : RLPItem)\n (items : List RLPItem) (rest' : List Byte) (n : Nat)\n (hne : bytes.drop off ≠ [])\n ... | [
{
"name": "decodeItems_four_of_decodeAux",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 26,
"n_chars": 1389,
"n_subproofs": 5,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,... | 1 | /-
EvmAsm.Rv64.RLP.WalkDecodeBridge
Reusable pure bridge from the cursor-walk view used by `rlp_walk_next`
to the EL RLP decoder. The walk routines expose offsets into one byte
buffer; these lemmas turn per-item offset facts into `decodeAux`,
`decodeItems`, and finally `decodeFully` facts.
-/
import EvmAsm... | /-
EvmAsm.Rv64.RLP.WalkDecodeBridge
Reusable pure bridge from the cursor-walk view used by `rlp_walk_next`
to the EL RLP decoder. The walk routines expose offsets into one byte
buffer; these lemmas turn per-item offset facts into `decodeAux`,
`decodeItems`, and finally `decodeFully` facts.
-/
import EvmAsm... | @@ -16,6 +16,16 @@
open EvmAsm.EL.RLP
+/-- Prepend one decoded item to a recursive `decodeItems` run. -/
+theorem decodeItems_cons_of_decodeAux (bytes : List Byte) (off nextOff : Nat) (item : RLPItem)
+ (items : List RLPItem) (rest' : List Byte) (n : Nat)
+ (hne : bytes.drop off ≠ [])
+ (hitem : decodeAux... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e722e784c961_3 | 84c24fa0227faa97 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WalkDecodeBridge.lean | WalkDecodeBridge | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "decodeItems_four_of_decodeAux_chain",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hne : ∀ {bs item r}, decodeAux 1 bs = some (item, r) → bs ≠ [] := by\n intro bs item r h hnil\... | [
{
"name": "decodeItems_cons_of_decodeAux_chain",
"text": "/-- Prepend one decoded item to a recursive `decodeItems` run, phrased as a\n direct remainder chain instead of byte-offset drops. This is the shape\n produced by validating WP field posts. -/\ntheorem decodeItems_cons_of_decodeAux_chain (bs b... | [
{
"name": "decodeItems_four_of_decodeAux_chain",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 29,
"n_chars": 1317,
"n_subproofs": 5,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": ... | 1 | /-
EvmAsm.Rv64.RLP.WalkDecodeBridge
Reusable pure bridge from the cursor-walk view used by `rlp_walk_next`
to the EL RLP decoder. The walk routines expose offsets into one byte
buffer; these lemmas turn per-item offset facts into `decodeAux`,
`decodeItems`, and finally `decodeFully` facts.
-/
import EvmAsm... | /-
EvmAsm.Rv64.RLP.WalkDecodeBridge
Reusable pure bridge from the cursor-walk view used by `rlp_walk_next`
to the EL RLP decoder. The walk routines expose offsets into one byte
buffer; these lemmas turn per-item offset facts into `decodeAux`,
`decodeItems`, and finally `decodeFully` facts.
-/
import EvmAsm... | @@ -16,6 +16,18 @@
open EvmAsm.EL.RLP
+/-- Prepend one decoded item to a recursive `decodeItems` run, phrased as a
+ direct remainder chain instead of byte-offset drops. This is the shape
+ produced by validating WP field posts. -/
+theorem decodeItems_cons_of_decodeAux_chain (bs bsNext : List Byte)
+ (i... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e722e784c961_4 | cf132554a879f561 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WalkDecodeBridge.lean | WalkDecodeBridge | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 4 | [
{
"theorem_name": "decodeAux_singleByte_bridge",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [drop_eq_cons_of_getElem? hget]\n exact decodeAux_cons_singleByte_of_classifyPrefix n b (bytes.drop (off + ... | [
{
"name": "drop_eq_cons_of_getElem?",
"text": "/-- A byte present at offset `off` peels off the front of `drop off`. -/\ntheorem drop_eq_cons_of_getElem? {bytes : List Byte} {off : Nat} {b : Byte}\n (hget : bytes[off]? = some b) :\n bytes.drop off = b :: bytes.drop (off + 1) := by\n have hlt : off < ... | [
{
"name": "decodeItems_cons_singleByte",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 704,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 2 | /-
EvmAsm.Rv64.RLP.WalkDecodeBridge
Reusable pure bridge from the cursor-walk view used by `rlp_walk_next`
to the EL RLP decoder. The walk routines expose offsets into one byte
buffer; these lemmas turn per-item offset facts into `decodeAux`,
`decodeItems`, and finally `decodeFully` facts.
-/
import EvmAsm... | /-
EvmAsm.Rv64.RLP.WalkDecodeBridge
Reusable pure bridge from the cursor-walk view used by `rlp_walk_next`
to the EL RLP decoder. The walk routines expose offsets into one byte
buffer; these lemmas turn per-item offset facts into `decodeAux`,
`decodeItems`, and finally `decodeFully` facts.
-/
import EvmAsm... | @@ -16,10 +16,25 @@
open EvmAsm.EL.RLP
+/-- A byte present at offset `off` peels off the front of `drop off`. -/
+theorem drop_eq_cons_of_getElem? {bytes : List Byte} {off : Nat} {b : Byte}
+ (hget : bytes[off]? = some b) :
+ bytes.drop off = b :: bytes.drop (off + 1) := by
+ have hlt : off < bytes.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_e722e784c961_5 | b00caac65b8b7ac0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WalkDecodeBridge.lean | WalkDecodeBridge | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 4 | [
{
"theorem_name": "decodeAux_singleByte_bridge",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [drop_eq_cons_of_getElem? hget]\n exact decodeAux_cons_singleByte_of_classifyPrefix n b (bytes.drop (off + ... | [
{
"name": "drop_eq_cons_of_getElem?",
"text": "/-- A byte present at offset `off` peels off the front of `drop off`. -/\ntheorem drop_eq_cons_of_getElem? {bytes : List Byte} {off : Nat} {b : Byte}\n (hget : bytes[off]? = some b) :\n bytes.drop off = b :: bytes.drop (off + 1) := by\n have hlt : off < ... | [
{
"name": "decodeItems_cons_shortBytes",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 31,
"n_chars": 1387,
"n_subproofs": 1,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 5,
"n_structural": 0,
"automation_only": false,
... | 2 | /-
EvmAsm.Rv64.RLP.WalkDecodeBridge
Reusable pure bridge from the cursor-walk view used by `rlp_walk_next`
to the EL RLP decoder. The walk routines expose offsets into one byte
buffer; these lemmas turn per-item offset facts into `decodeAux`,
`decodeItems`, and finally `decodeFully` facts.
-/
import EvmAsm... | /-
EvmAsm.Rv64.RLP.WalkDecodeBridge
Reusable pure bridge from the cursor-walk view used by `rlp_walk_next`
to the EL RLP decoder. The walk routines expose offsets into one byte
buffer; these lemmas turn per-item offset facts into `decodeAux`,
`decodeItems`, and finally `decodeFully` facts.
-/
import EvmAsm... | @@ -16,6 +16,18 @@
open EvmAsm.EL.RLP
+/-- A byte present at offset `off` peels off the front of `drop off`. -/
+theorem drop_eq_cons_of_getElem? {bytes : List Byte} {off : Nat} {b : Byte}
+ (hget : bytes[off]? = some b) :
+ bytes.drop off = b :: bytes.drop (off + 1) := by
+ have hlt : off < bytes.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_e722e784c961_6 | 5093a4df74e43899 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WalkDecodeBridge.lean | WalkDecodeBridge | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "decodeAux_bytes_all_fuel_of_decode_list",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases bs with\n | nil =>\n simp [decode, decodeAux] at hdecode\n | cons pfx rest =>\n e... | [
{
"name": "decodeAux_bytes_all_fuel_of_decode",
"text": "/-- Any successful byte-string `decode` result is stable for every positive\n `decodeAux` fuel. This is the field-post adapter used by WP-generated\n validating walks; callers do not need to expose the precise byte prefix\n class at semantic ... | [
{
"name": "decodeAux_bytes_all_fuel_of_decode_list",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 666,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only"... | 1 | /-
EvmAsm.Rv64.RLP.WalkDecodeBridge
Reusable pure bridge from the cursor-walk view used by `rlp_walk_next`
to the EL RLP decoder. The walk routines expose offsets into one byte
buffer; these lemmas turn per-item offset facts into `decodeAux`,
`decodeItems`, and finally `decodeFully` facts.
-/
import EvmAsm... | /-
EvmAsm.Rv64.RLP.WalkDecodeBridge
Reusable pure bridge from the cursor-walk view used by `rlp_walk_next`
to the EL RLP decoder. The walk routines expose offsets into one byte
buffer; these lemmas turn per-item offset facts into `decodeAux`,
`decodeItems`, and finally `decodeFully` facts.
-/
import EvmAsm... | @@ -16,6 +16,57 @@
open EvmAsm.EL.RLP
+/-- Any successful byte-string `decode` result is stable for every positive
+ `decodeAux` fuel. This is the field-post adapter used by WP-generated
+ validating walks; callers do not need to expose the precise byte prefix
+ class at semantic joins. -/
+theorem decode... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e722e784c961_7 | eabf5f201cf3e21b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WalkDecodeBridge.lean | WalkDecodeBridge | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "decodeItems_four_of_decodeAux",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hne : ∀ {o item r}, decodeAux 1 (bytes.drop o) = some (item, r) → bytes.drop o ≠ [] := by\n intro o ... | [
{
"name": "decodeItems_cons_of_decodeAux",
"text": "/-- Prepend one decoded item to a recursive `decodeItems` run. -/\ntheorem decodeItems_cons_of_decodeAux (bytes : List Byte) (off nextOff : Nat) (item : RLPItem)\n (items : List RLPItem) (rest' : List Byte) (n : Nat)\n (hne : bytes.drop off ≠ [])\n ... | [
{
"name": "decodeFully_shortList_four",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 33,
"n_chars": 1901,
"n_subproofs": 4,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 4,
"n_structural": 5,
"automation_only": false,
... | 2 | /-
EvmAsm.Rv64.RLP.WalkDecodeBridge
Reusable pure bridge from the cursor-walk view used by `rlp_walk_next`
to the EL RLP decoder. The walk routines expose offsets into one byte
buffer; these lemmas turn per-item offset facts into `decodeAux`,
`decodeItems`, and finally `decodeFully` facts.
-/
import EvmAsm... | /-
EvmAsm.Rv64.RLP.WalkDecodeBridge
Reusable pure bridge from the cursor-walk view used by `rlp_walk_next`
to the EL RLP decoder. The walk routines expose offsets into one byte
buffer; these lemmas turn per-item offset facts into `decodeAux`,
`decodeItems`, and finally `decodeFully` facts.
-/
import EvmAsm... | @@ -16,6 +16,16 @@
open EvmAsm.EL.RLP
+/-- Prepend one decoded item to a recursive `decodeItems` run. -/
+theorem decodeItems_cons_of_decodeAux (bytes : List Byte) (off nextOff : Nat) (item : RLPItem)
+ (items : List RLPItem) (rest' : List Byte) (n : Nat)
+ (hne : bytes.drop off ≠ [])
+ (hitem : decodeAux... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e722e784c961_8 | 9ed59dee9789b594 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/WalkDecodeBridge.lean | WalkDecodeBridge | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "decodeItems_four_of_decodeAux_chain",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hne : ∀ {bs item r}, decodeAux 1 bs = some (item, r) → bs ≠ [] := by\n intro bs item r h hnil\... | [
{
"name": "decodeItems_cons_of_decodeAux_chain",
"text": "/-- Prepend one decoded item to a recursive `decodeItems` run, phrased as a\n direct remainder chain instead of byte-offset drops. This is the shape\n produced by validating WP field posts. -/\ntheorem decodeItems_cons_of_decodeAux_chain (bs b... | [
{
"name": "decodeFully_shortList_four_chain",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 29,
"n_chars": 1616,
"n_subproofs": 2,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 5,
"automation_only": fal... | 2 | /-
EvmAsm.Rv64.RLP.WalkDecodeBridge
Reusable pure bridge from the cursor-walk view used by `rlp_walk_next`
to the EL RLP decoder. The walk routines expose offsets into one byte
buffer; these lemmas turn per-item offset facts into `decodeAux`,
`decodeItems`, and finally `decodeFully` facts.
-/
import EvmAsm... | /-
EvmAsm.Rv64.RLP.WalkDecodeBridge
Reusable pure bridge from the cursor-walk view used by `rlp_walk_next`
to the EL RLP decoder. The walk routines expose offsets into one byte
buffer; these lemmas turn per-item offset facts into `decodeAux`,
`decodeItems`, and finally `decodeFully` facts.
-/
import EvmAsm... | @@ -16,6 +16,18 @@
open EvmAsm.EL.RLP
+/-- Prepend one decoded item to a recursive `decodeItems` run, phrased as a
+ direct remainder chain instead of byte-offset drops. This is the shape
+ produced by validating WP field posts. -/
+theorem decodeItems_cons_of_decodeAux_chain (bs bsNext : List Byte)
+ (i... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8aaacfefccec_0 | 4723c699b5033f32 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N4V5CallAddbackModGetLimb.lean | N4V5CallAddbackModGetLimb | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "n4_call_addback_beq_mod_getLimbN_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 75,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro shift antiShift b3' b2' b1' b0' u4 u3 u2 u1 u0 qHat ms c3 ab ab' carry\n un0Out un1Out un... | [
{
"name": "n4CallAddbackBeqQTrue_eq_toNat_div",
"text": "/-- `n4CallAddbackBeqQTrue a b = a.toNat / b.toNat`. -/\nprivate theorem n4CallAddbackBeqQTrue_eq_toNat_div (a b : EvmWord) :\n n4CallAddbackBeqQTrue a b = a.toNat / b.toNat := by\n have ha_val : val256 (a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2)... | [
{
"name": "n4_call_addback_beq_mod_getLimbN_v5",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 115,
"n_chars": 7132,
"n_subproofs": 28,
"n_tactics": 74,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 6,
"n_structural": 5,
"automation_only"... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N4V5CallAddbackModGetLimb
Combined n=4 v5 MOD call+addback-beq getLimbN: the four
`(EvmWord.mod a b).getLimbN i` remainder facts in the carry-selected
post-addback `un*Out` funnel form, from the runtime addback conditions (the v5
borrow + carry2 packaged predicates + the v5 semant... | /-
EvmAsm.Evm64.DivMod.Spec.N4V5CallAddbackModGetLimb
Combined n=4 v5 MOD call+addback-beq getLimbN: the four
`(EvmWord.mod a b).getLimbN i` remainder facts in the carry-selected
post-addback `un*Out` funnel form, from the runtime addback conditions (the v5
borrow + carry2 packaged predicates + the v5 semant... | @@ -33,6 +33,21 @@
open EvmAsm.Rv64
open EvmWord
+/-- `n4CallAddbackBeqQTrue a b = a.toNat / b.toNat`. -/
+private theorem n4CallAddbackBeqQTrue_eq_toNat_div (a b : EvmWord) :
+ n4CallAddbackBeqQTrue a b = a.toNat / b.toNat := by
+ have ha_val : val256 (a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2) (a.getLimbN 3)... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6cbad0e6b9bb_0 | 1a27b81ae560cd39 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase2LongLoopOne.lean | Phase2LongLoopOne | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "rlp_phase2_long_loop_one_byte_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [rlp_phase2_long_loop_one_byte_post_unfold]\n -- Body spec instantiated at cnt = 1.\n... | [
{
"name": "rlp_phase2_long_loop_one_byte_post_unfold",
"text": "theorem rlp_phase2_long_loop_one_byte_post_unfold\n (len ptr byteZext wordVal dwordAddr : Word) :\n rlp_phase2_long_loop_one_byte_post len ptr byteZext wordVal dwordAddr =\n ((.x11 ↦ᵣ ((len <<< 8) + byteZext)) **\n (.x13 ↦ᵣ (ptr + ... | [
{
"name": "rlp_phase2_long_loop_one_byte_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 47,
"n_chars": 2384,
"n_subproofs": 3,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 1,
"automation_o... | 1 | /-
EvmAsm.Rv64.RLP.Phase2LongLoopOne
EL.3 Phase 2 (long form) — one-iteration closure of the loop body.
Specializes `rlp_phase2_long_loop_body_spec` to the case where the
initial counter `x14` is `1`. After the single iteration the counter
decrements to `0`, the `BNE x14, x0, back` falls through, and contro... | /-
EvmAsm.Rv64.RLP.Phase2LongLoopOne
EL.3 Phase 2 (long form) — one-iteration closure of the loop body.
Specializes `rlp_phase2_long_loop_body_spec` to the case where the
initial counter `x14` is `1`. After the single iteration the counter
decrements to `0`, the `BNE x14, x0, back` falls through, and contro... | @@ -41,6 +41,16 @@
(.x12 ↦ᵣ byteZext) ** (.x0 ↦ᵣ (0 : Word)) **
(dwordAddr ↦ₘ wordVal)
+theorem rlp_phase2_long_loop_one_byte_post_unfold
+ (len ptr byteZext wordVal dwordAddr : Word) :
+ rlp_phase2_long_loop_one_byte_post len ptr byteZext wordVal dwordAddr =
+ ((.x11 ↦ᵣ ((len <<< 8) + byteZext)) *... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f7264dabf50a_0 | 88730134879913c9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/SizeSpec.lean | SizeSpec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "evm_calldatasize_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- LD tmpReg envBaseReg callDataLenOff : load env.callDataLen.\n have LLD := ld_spec_gen_within tmpReg envBa... | [
{
"name": "signExtend12_callDataLenOff",
"text": "/-- The on-disk `callDataLenOff` immediate (424) sign-extends to itself\n as a 64-bit word. Used to normalise the load address that LD's\n spec produces (`v_addr + signExtend12 (BitVec.ofNat 12 424)`) so it\n matches the canonical `v_addr + BitVec.... | [
{
"name": "evm_calldatasize_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 47,
"n_chars": 2406,
"n_subproofs": 6,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.Calldata.SizeSpec
Stack-level cpsTripleWithin specification for the EVM `CALLDATASIZE`
opcode (see `EvmAsm/Evm64/Calldata/SizeProgram.lean`).
Slice 3 of issue #104 (parent `evm-asm-xjk8`, this slice
`evm-asm-8mp7`). Authored by @pirapira; implemented by Hermes-bot
(evm-hermes).
-/
import... | /-
EvmAsm.Evm64.Calldata.SizeSpec
Stack-level cpsTripleWithin specification for the EVM `CALLDATASIZE`
opcode (see `EvmAsm/Evm64/Calldata/SizeProgram.lean`).
Slice 3 of issue #104 (parent `evm-asm-xjk8`, this slice
`evm-asm-8mp7`). Authored by @pirapira; implemented by Hermes-bot
(evm-hermes).
-/
import... | @@ -24,6 +24,16 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.EvmEnv (callDataLenOff envIs envIs_callDataLen_split envIsCallDataLenRest)
+/-- The on-disk `callDataLenOff` immediate (424) sign-extends to itself
+ as a 64-bit word. Used to normalise the load address that LD's
+ spec produces (`v_addr + signExtend12 (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_f7264dabf50a_1 | e9cb0d577ee4ac42 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/SizeSpec.lean | SizeSpec | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "evm_calldatasize_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- LD tmpReg envBaseReg callDataLenOff : load env.callDataLen.\n have LLD := ld_spec_gen_within tmpReg envBa... | [
{
"name": "signExtend12_callDataLenOff",
"text": "/-- The on-disk `callDataLenOff` immediate (424) sign-extends to itself\n as a 64-bit word. Used to normalise the load address that LD's\n spec produces (`v_addr + signExtend12 (BitVec.ofNat 12 424)`) so it\n matches the canonical `v_addr + BitVec.... | [
{
"name": "evm_calldatasize_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 39,
"n_chars": 1705,
"n_subproofs": 0,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": f... | 3 | /-
EvmAsm.Evm64.Calldata.SizeSpec
Stack-level cpsTripleWithin specification for the EVM `CALLDATASIZE`
opcode (see `EvmAsm/Evm64/Calldata/SizeProgram.lean`).
Slice 3 of issue #104 (parent `evm-asm-xjk8`, this slice
`evm-asm-8mp7`). Authored by @pirapira; implemented by Hermes-bot
(evm-hermes).
-/
import... | /-
EvmAsm.Evm64.Calldata.SizeSpec
Stack-level cpsTripleWithin specification for the EVM `CALLDATASIZE`
opcode (see `EvmAsm/Evm64/Calldata/SizeProgram.lean`).
Slice 3 of issue #104 (parent `evm-asm-xjk8`, this slice
`evm-asm-8mp7`). Authored by @pirapira; implemented by Hermes-bot
(evm-hermes).
-/
import... | @@ -24,6 +24,16 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.EvmEnv (callDataLenOff envIs envIs_callDataLen_split envIsCallDataLenRest)
+/-- The on-disk `callDataLenOff` immediate (424) sign-extends to itself
+ as a 64-bit word. Used to normalise the load address that LD's
+ spec produces (`v_addr + signExtend12 (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_eff4f9d02856_0 | bca9be9f3af21977 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/InterpreterLoopCompose.lean | InterpreterLoopCompose | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "loopFuel_add",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction nStepsA generalizing state with\n | zero => simp\n | succ nStepsA ih =>\n rw [Nat.succ_add]\n cases h_s... | [
{
"name": "loopFuel_of_not_running",
"text": "/-- Non-running states are fixed points for every nSteps budget. -/\ntheorem loopFuel_of_not_running\n (handler : Handler) (nSteps : Nat) (state : EvmState)\n (h_status : state.status ≠ .running) :\n InterpreterLoop.loopFuel handler nSteps state = state... | [
{
"name": "loopFuel_add",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 898,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 3,
"n_automation": 6,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"max_nesting"... | 1 | /-
EvmAsm.Evm64.InterpreterLoopCompose
Whole-loop composition hooks for the pure interpreter loop (GH #109).
-/
import EvmAsm.Evm64.InterpreterLoop
namespace EvmAsm.Evm64
namespace InterpreterLoopCompose
abbrev Handler := InterpreterLoop.Handler
/-- Distinctive token: InterpreterLoopCompose.loopFuel_add #109.... | /-
EvmAsm.Evm64.InterpreterLoopCompose
Whole-loop composition hooks for the pure interpreter loop (GH #109).
-/
import EvmAsm.Evm64.InterpreterLoop
namespace EvmAsm.Evm64
namespace InterpreterLoopCompose
abbrev Handler := InterpreterLoop.Handler
/-- Non-running states are fixed points for every nSteps budget.... | @@ -12,6 +12,16 @@
abbrev Handler := InterpreterLoop.Handler
+/-- Non-running states are fixed points for every nSteps budget. -/
+theorem loopFuel_of_not_running
+ (handler : Handler) (nSteps : Nat) (state : EvmState)
+ (h_status : state.status ≠ .running) :
+ InterpreterLoop.loopFuel handler nSteps stat... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_eff4f9d02856_1 | 41fc99b0d3f476dd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/InterpreterLoopCompose.lean | InterpreterLoopCompose | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "loopFuel_add",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction nStepsA generalizing state with\n | zero => simp\n | succ nStepsA ih =>\n rw [Nat.succ_add]\n cases h_s... | [
{
"name": "loopFuel_of_not_running",
"text": "/-- Non-running states are fixed points for every nSteps budget. -/\ntheorem loopFuel_of_not_running\n (handler : Handler) (nSteps : Nat) (state : EvmState)\n (h_status : state.status ≠ .running) :\n InterpreterLoop.loopFuel handler nSteps state = state... | [
{
"name": "loopFuel_add_status",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 341,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nes... | 2 | /-
EvmAsm.Evm64.InterpreterLoopCompose
Whole-loop composition hooks for the pure interpreter loop (GH #109).
-/
import EvmAsm.Evm64.InterpreterLoop
namespace EvmAsm.Evm64
namespace InterpreterLoopCompose
abbrev Handler := InterpreterLoop.Handler
/-- Distinctive token: InterpreterLoopCompose.loopFuel_add #109.... | /-
EvmAsm.Evm64.InterpreterLoopCompose
Whole-loop composition hooks for the pure interpreter loop (GH #109).
-/
import EvmAsm.Evm64.InterpreterLoop
namespace EvmAsm.Evm64
namespace InterpreterLoopCompose
abbrev Handler := InterpreterLoop.Handler
/-- Non-running states are fixed points for every nSteps budget.... | @@ -12,6 +12,16 @@
abbrev Handler := InterpreterLoop.Handler
+/-- Non-running states are fixed points for every nSteps budget. -/
+theorem loopFuel_of_not_running
+ (handler : Handler) (nSteps : Nat) (state : EvmState)
+ (h_status : state.status ≠ .running) :
+ InterpreterLoop.loopFuel handler nSteps stat... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_eff4f9d02856_2 | 824ed7fc70232f41 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/InterpreterLoopCompose.lean | InterpreterLoopCompose | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "loopFuel_add",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction nStepsA generalizing state with\n | zero => simp\n | succ nStepsA ih =>\n rw [Nat.succ_add]\n cases h_s... | [
{
"name": "loopFuel_of_not_running",
"text": "/-- Non-running states are fixed points for every nSteps budget. -/\ntheorem loopFuel_of_not_running\n (handler : Handler) (nSteps : Nat) (state : EvmState)\n (h_status : state.status ≠ .running) :\n InterpreterLoop.loopFuel handler nSteps state = state... | [
{
"name": "loopFuel_one_add",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 291,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 2 | /-
EvmAsm.Evm64.InterpreterLoopCompose
Whole-loop composition hooks for the pure interpreter loop (GH #109).
-/
import EvmAsm.Evm64.InterpreterLoop
namespace EvmAsm.Evm64
namespace InterpreterLoopCompose
abbrev Handler := InterpreterLoop.Handler
/-- Distinctive token: InterpreterLoopCompose.loopFuel_add #109.... | /-
EvmAsm.Evm64.InterpreterLoopCompose
Whole-loop composition hooks for the pure interpreter loop (GH #109).
-/
import EvmAsm.Evm64.InterpreterLoop
namespace EvmAsm.Evm64
namespace InterpreterLoopCompose
abbrev Handler := InterpreterLoop.Handler
/-- Non-running states are fixed points for every nSteps budget.... | @@ -12,6 +12,16 @@
abbrev Handler := InterpreterLoop.Handler
+/-- Non-running states are fixed points for every nSteps budget. -/
+theorem loopFuel_of_not_running
+ (handler : Handler) (nSteps : Nat) (state : EvmState)
+ (h_status : state.status ≠ .running) :
+ InterpreterLoop.loopFuel handler nSteps stat... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_eff4f9d02856_3 | 0f106fdbfa2363da | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/InterpreterLoopCompose.lean | InterpreterLoopCompose | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "loopFuel_add",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction nStepsA generalizing state with\n | zero => simp\n | succ nStepsA ih =>\n rw [Nat.succ_add]\n cases h_s... | [
{
"name": "loopFuel_of_not_running",
"text": "/-- Non-running states are fixed points for every nSteps budget. -/\ntheorem loopFuel_of_not_running\n (handler : Handler) (nSteps : Nat) (state : EvmState)\n (h_status : state.status ≠ .running) :\n InterpreterLoop.loopFuel handler nSteps state = state... | [
{
"name": "loopFuel_one_add_status",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 317,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max... | 3 | /-
EvmAsm.Evm64.InterpreterLoopCompose
Whole-loop composition hooks for the pure interpreter loop (GH #109).
-/
import EvmAsm.Evm64.InterpreterLoop
namespace EvmAsm.Evm64
namespace InterpreterLoopCompose
abbrev Handler := InterpreterLoop.Handler
/-- Distinctive token: InterpreterLoopCompose.loopFuel_add #109.... | /-
EvmAsm.Evm64.InterpreterLoopCompose
Whole-loop composition hooks for the pure interpreter loop (GH #109).
-/
import EvmAsm.Evm64.InterpreterLoop
namespace EvmAsm.Evm64
namespace InterpreterLoopCompose
abbrev Handler := InterpreterLoop.Handler
/-- Non-running states are fixed points for every nSteps budget.... | @@ -12,6 +12,16 @@
abbrev Handler := InterpreterLoop.Handler
+/-- Non-running states are fixed points for every nSteps budget. -/
+theorem loopFuel_of_not_running
+ (handler : Handler) (nSteps : Nat) (state : EvmState)
+ (h_status : state.status ≠ .running) :
+ InterpreterLoop.loopFuel handler nSteps stat... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_eff4f9d02856_4 | 4685c59d696e0737 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/InterpreterLoopCompose.lean | InterpreterLoopCompose | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "loopFuel_add",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction nStepsA generalizing state with\n | zero => simp\n | succ nStepsA ih =>\n rw [Nat.succ_add]\n cases h_s... | [
{
"name": "loopFuel_of_not_running",
"text": "/-- Non-running states are fixed points for every nSteps budget. -/\ntheorem loopFuel_of_not_running\n (handler : Handler) (nSteps : Nat) (state : EvmState)\n (h_status : state.status ≠ .running) :\n InterpreterLoop.loopFuel handler nSteps state = state... | [
{
"name": "loopFuel_add_one",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 291,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 2 | /-
EvmAsm.Evm64.InterpreterLoopCompose
Whole-loop composition hooks for the pure interpreter loop (GH #109).
-/
import EvmAsm.Evm64.InterpreterLoop
namespace EvmAsm.Evm64
namespace InterpreterLoopCompose
abbrev Handler := InterpreterLoop.Handler
/-- Distinctive token: InterpreterLoopCompose.loopFuel_add #109.... | /-
EvmAsm.Evm64.InterpreterLoopCompose
Whole-loop composition hooks for the pure interpreter loop (GH #109).
-/
import EvmAsm.Evm64.InterpreterLoop
namespace EvmAsm.Evm64
namespace InterpreterLoopCompose
abbrev Handler := InterpreterLoop.Handler
/-- Non-running states are fixed points for every nSteps budget.... | @@ -12,6 +12,16 @@
abbrev Handler := InterpreterLoop.Handler
+/-- Non-running states are fixed points for every nSteps budget. -/
+theorem loopFuel_of_not_running
+ (handler : Handler) (nSteps : Nat) (state : EvmState)
+ (h_status : state.status ≠ .running) :
+ InterpreterLoop.loopFuel handler nSteps stat... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_eff4f9d02856_5 | 14849d1f3fc9d8d1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/InterpreterLoopCompose.lean | InterpreterLoopCompose | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "loopFuel_add",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction nStepsA generalizing state with\n | zero => simp\n | succ nStepsA ih =>\n rw [Nat.succ_add]\n cases h_s... | [
{
"name": "loopFuel_of_not_running",
"text": "/-- Non-running states are fixed points for every nSteps budget. -/\ntheorem loopFuel_of_not_running\n (handler : Handler) (nSteps : Nat) (state : EvmState)\n (h_status : state.status ≠ .running) :\n InterpreterLoop.loopFuel handler nSteps state = state... | [
{
"name": "loopFuel_add_one_status",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 317,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max... | 3 | /-
EvmAsm.Evm64.InterpreterLoopCompose
Whole-loop composition hooks for the pure interpreter loop (GH #109).
-/
import EvmAsm.Evm64.InterpreterLoop
namespace EvmAsm.Evm64
namespace InterpreterLoopCompose
abbrev Handler := InterpreterLoop.Handler
/-- Distinctive token: InterpreterLoopCompose.loopFuel_add #109.... | /-
EvmAsm.Evm64.InterpreterLoopCompose
Whole-loop composition hooks for the pure interpreter loop (GH #109).
-/
import EvmAsm.Evm64.InterpreterLoop
namespace EvmAsm.Evm64
namespace InterpreterLoopCompose
abbrev Handler := InterpreterLoop.Handler
/-- Non-running states are fixed points for every nSteps budget.... | @@ -12,6 +12,16 @@
abbrev Handler := InterpreterLoop.Handler
+/-- Non-running states are fixed points for every nSteps budget. -/
+theorem loopFuel_of_not_running
+ (handler : Handler) (nSteps : Nat) (state : EvmState)
+ (h_status : state.status ≠ .running) :
+ InterpreterLoop.loopFuel handler nSteps stat... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7e3595f836c9_0 | 029a47e324efad0c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase2LongLoopThree.lean | Phase2LongLoopThree | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "rlp_phase2_long_loop_three_byte_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 49,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [rlp_phase2_long_loop_three_byte_post_unfold]\n -- Iter 1: body spec at cnt = 3. cn... | [
{
"name": "rlp_phase2_long_loop_three_byte_post_unfold",
"text": "theorem rlp_phase2_long_loop_three_byte_post_unfold\n (len ptr byte1 byte2 byte3 wordVal dwordAddr : Word) :\n rlp_phase2_long_loop_three_byte_post len ptr byte1 byte2 byte3 wordVal\n dwordAddr =\n ((.x11 ↦ᵣ ((((len <<< 8) + b... | [
{
"name": "rlp_phase2_long_loop_three_byte_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 76,
"n_chars": 3707,
"n_subproofs": 8,
"n_tactics": 46,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 7,
"n_structural": 3,
"automation... | 1 | /-
EvmAsm.Rv64.RLP.Phase2LongLoopThree
EL.3 Phase 2 (long form) — three-iteration closure of the loop body.
Specializes `rlp_phase2_long_loop_body_spec` (#333) at `x14 = 3`,
composed with `rlp_phase2_long_loop_two_byte_spec` (#336) for the
remaining two iterations. Execution:
iter 1 @ base → state at... | /-
EvmAsm.Rv64.RLP.Phase2LongLoopThree
EL.3 Phase 2 (long form) — three-iteration closure of the loop body.
Specializes `rlp_phase2_long_loop_body_spec` (#333) at `x14 = 3`,
composed with `rlp_phase2_long_loop_two_byte_spec` (#336) for the
remaining two iterations. Execution:
iter 1 @ base → state at... | @@ -41,6 +41,17 @@
(.x12 ↦ᵣ byte3) ** (.x0 ↦ᵣ (0 : Word)) **
(dwordAddr ↦ₘ wordVal)
+theorem rlp_phase2_long_loop_three_byte_post_unfold
+ (len ptr byte1 byte2 byte3 wordVal dwordAddr : Word) :
+ rlp_phase2_long_loop_three_byte_post len ptr byte1 byte2 byte3 wordVal
+ dwordAddr =
+ ((.x11 ↦ᵣ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_79ea0a928b6d_0 | e94172c703043412 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/IdentityPrecompileDispatch.lean | IdentityPrecompileDispatch | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "gasCost_empty",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [gasCost_eq_precompileGasCost]\n simp [EvmAsm.Evm64.Precompile.inputWords_zero]",
"n_chars": 88,
"n_subproofs": 0... | [
{
"name": "gasCost_eq_precompileGasCost",
"text": "theorem gasCost_eq_precompileGasCost (payload : List Byte) :\n gasCost payload = 15 + 3 * EvmAsm.Evm64.Precompile.inputWords payload.length := by\n simp [gasCost, EvmAsm.Evm64.Precompile.precompileGasCost?,\n EvmAsm.Evm64.Precompile.gasSchedule]\n\n"... | [
{
"name": "gasCost_empty",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 146,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting":... | 1 | /-
EvmAsm.EL.IdentityPrecompileDispatch
Pure EVM IDENTITY precompile framing. This module fixes the target check,
word-linear gas charge, and shared precompile result shape for address 0x04.
-/
import EvmAsm.EL.IdentityPrecompileResultBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace I... | /-
EvmAsm.EL.IdentityPrecompileDispatch
Pure EVM IDENTITY precompile framing. This module fixes the target check,
word-linear gas charge, and shared precompile result shape for address 0x04.
-/
import EvmAsm.EL.IdentityPrecompileResultBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace I... | @@ -31,8 +31,15 @@
else
EvmAsm.Evm64.PrecompileResult.fail input.gas
-theorem gasCost_empty : gasCost ([] : List Byte) = 15 := sorry
+theorem gasCost_eq_precompileGasCost (payload : List Byte) :
+ gasCost payload = 15 + 3 * EvmAsm.Evm64.Precompile.inputWords payload.length := by
+ simp [gasCost, EvmAsm.Ev... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_79ea0a928b6d_1 | 3dae944a74ced53d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/IdentityPrecompileDispatch.lean | IdentityPrecompileDispatch | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "dispatch_success_output",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatch_success h_target h_gas]\n rfl",
"n_chars": 48,
"n_subproofs": 0,
"n_tactics": 3,
"cyc... | [
{
"name": "dispatch_success",
"text": "theorem dispatch_success\n {input : EvmAsm.Evm64.PrecompileInput}\n (h_target : input.target = .identity)\n (h_gas : gasCost input.input <= input.gas) :\n dispatch input =\n EvmAsm.Evm64.PrecompileResult.ok input.input (input.gas - gasCost input.input)... | [
{
"name": "dispatch_success_output",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 260,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max... | 1 | /-
EvmAsm.EL.IdentityPrecompileDispatch
Pure EVM IDENTITY precompile framing. This module fixes the target check,
word-linear gas charge, and shared precompile result shape for address 0x04.
-/
import EvmAsm.EL.IdentityPrecompileResultBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace I... | /-
EvmAsm.EL.IdentityPrecompileDispatch
Pure EVM IDENTITY precompile framing. This module fixes the target check,
word-linear gas charge, and shared precompile result shape for address 0x04.
-/
import EvmAsm.EL.IdentityPrecompileResultBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace I... | @@ -31,11 +31,23 @@
else
EvmAsm.Evm64.PrecompileResult.fail input.gas
+theorem dispatch_success
+ {input : EvmAsm.Evm64.PrecompileInput}
+ (h_target : input.target = .identity)
+ (h_gas : gasCost input.input <= input.gas) :
+ dispatch input =
+ EvmAsm.Evm64.PrecompileResult.ok input.input (in... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_79ea0a928b6d_2 | ef5121eafffc07f1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/IdentityPrecompileDispatch.lean | IdentityPrecompileDispatch | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "dispatch_success_output",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatch_success h_target h_gas]\n rfl",
"n_chars": 48,
"n_subproofs": 0,
"n_tactics": 3,
"cyc... | [
{
"name": "dispatch_success",
"text": "theorem dispatch_success\n {input : EvmAsm.Evm64.PrecompileInput}\n (h_target : input.target = .identity)\n (h_gas : gasCost input.input <= input.gas) :\n dispatch input =\n EvmAsm.Evm64.PrecompileResult.ok input.input (input.gas - gasCost input.input)... | [
{
"name": "dispatch_success_output_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 282,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 2 | /-
EvmAsm.EL.IdentityPrecompileDispatch
Pure EVM IDENTITY precompile framing. This module fixes the target check,
word-linear gas charge, and shared precompile result shape for address 0x04.
-/
import EvmAsm.EL.IdentityPrecompileResultBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace I... | /-
EvmAsm.EL.IdentityPrecompileDispatch
Pure EVM IDENTITY precompile framing. This module fixes the target check,
word-linear gas charge, and shared precompile result shape for address 0x04.
-/
import EvmAsm.EL.IdentityPrecompileResultBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace I... | @@ -31,11 +31,23 @@
else
EvmAsm.Evm64.PrecompileResult.fail input.gas
+theorem dispatch_success
+ {input : EvmAsm.Evm64.PrecompileInput}
+ (h_target : input.target = .identity)
+ (h_gas : gasCost input.input <= input.gas) :
+ dispatch input =
+ EvmAsm.Evm64.PrecompileResult.ok input.input (in... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7eb81027630b_0 | c4ae68382f9af437 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase1Disjoint.lean | Phase1Disjoint | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "rlp_phase1_step_code_disjoint_8_at_8",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := rlp_phase1_step_code_disjoint_8 k1 k2 off1 off2 (base + 8)\n rwa [show (base + 8 : Word) + ... | [
{
"name": "rlp_phase1_step_code_disjoint_8",
"text": "/-- Two cascade-step `CodeReq`s at bases 8 bytes apart are disjoint. -/\ntheorem rlp_phase1_step_code_disjoint_8\n (k1 k2 : BitVec 12) (off1 off2 : BitVec 13) (base : Word) :\n (rlp_phase1_step_code k1 off1 base).Disjoint\n (rlp_phase1_step_co... | [
{
"name": "rlp_phase1_step_code_disjoint_8_at_8",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 490,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": f... | 1 | /-
EvmAsm.Rv64.RLP.Phase1Disjoint
Public disjointness helpers for Phase 1 cascade-step `CodeReq`s.
The Phase 1 classifier program is a chain of four cascade steps,
each occupying eight bytes. Composing them requires disjointness
between the various pairs. The proof obligations fall into three
shapes (8 / ... | /-
EvmAsm.Rv64.RLP.Phase1Disjoint
Public disjointness helpers for Phase 1 cascade-step `CodeReq`s.
The Phase 1 classifier program is a chain of four cascade steps,
each occupying eight bytes. Composing them requires disjointness
between the various pairs. The proof obligations fall into three
shapes (8 / ... | @@ -26,12 +26,21 @@
-- Pairwise step-code disjointness (8 / 16 / 24 byte gaps)
-- ============================================================================
+/-- Two cascade-step `CodeReq`s at bases 8 bytes apart are disjoint. -/
+theorem rlp_phase1_step_code_disjoint_8
+ (k1 k2 : BitVec 12) (off1 off2 : 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_7eb81027630b_1 | c093355ba4b377f1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase1Disjoint.lean | Phase1Disjoint | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "rlp_phase1_step_code_disjoint_16_at_8",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := rlp_phase1_step_code_disjoint_16 k1 k2 off1 off2 (base + 8)\n rwa [show (base + 8 : Word) ... | [
{
"name": "rlp_phase1_step_code_disjoint_16",
"text": "/-- Two cascade-step `CodeReq`s at bases 16 bytes apart are disjoint. -/\ntheorem rlp_phase1_step_code_disjoint_16\n (k1 k2 : BitVec 12) (off1 off2 : BitVec 13) (base : Word) :\n (rlp_phase1_step_code k1 off1 base).Disjoint\n (rlp_phase1_step... | [
{
"name": "rlp_phase1_step_code_disjoint_16_at_8",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 494,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": ... | 1 | /-
EvmAsm.Rv64.RLP.Phase1Disjoint
Public disjointness helpers for Phase 1 cascade-step `CodeReq`s.
The Phase 1 classifier program is a chain of four cascade steps,
each occupying eight bytes. Composing them requires disjointness
between the various pairs. The proof obligations fall into three
shapes (8 / ... | /-
EvmAsm.Rv64.RLP.Phase1Disjoint
Public disjointness helpers for Phase 1 cascade-step `CodeReq`s.
The Phase 1 classifier program is a chain of four cascade steps,
each occupying eight bytes. Composing them requires disjointness
between the various pairs. The proof obligations fall into three
shapes (8 / ... | @@ -26,12 +26,21 @@
-- Pairwise step-code disjointness (8 / 16 / 24 byte gaps)
-- ============================================================================
+/-- Two cascade-step `CodeReq`s at bases 16 bytes apart are disjoint. -/
+theorem rlp_phase1_step_code_disjoint_16
+ (k1 k2 : BitVec 12) (off1 off2 : Bit... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7eb81027630b_2 | 79e14a70d0a52aee | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase1Disjoint.lean | Phase1Disjoint | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "rlp_phase1_step_code_disjoint_8_at_8",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := rlp_phase1_step_code_disjoint_8 k1 k2 off1 off2 (base + 8)\n rwa [show (base + 8 : Word) + ... | [
{
"name": "rlp_phase1_step_code_disjoint_8",
"text": "/-- Two cascade-step `CodeReq`s at bases 8 bytes apart are disjoint. -/\ntheorem rlp_phase1_step_code_disjoint_8\n (k1 k2 : BitVec 12) (off1 off2 : BitVec 13) (base : Word) :\n (rlp_phase1_step_code k1 off1 base).Disjoint\n (rlp_phase1_step_co... | [
{
"name": "rlp_phase1_step_code_disjoint_8_at_16",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 495,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": ... | 1 | /-
EvmAsm.Rv64.RLP.Phase1Disjoint
Public disjointness helpers for Phase 1 cascade-step `CodeReq`s.
The Phase 1 classifier program is a chain of four cascade steps,
each occupying eight bytes. Composing them requires disjointness
between the various pairs. The proof obligations fall into three
shapes (8 / ... | /-
EvmAsm.Rv64.RLP.Phase1Disjoint
Public disjointness helpers for Phase 1 cascade-step `CodeReq`s.
The Phase 1 classifier program is a chain of four cascade steps,
each occupying eight bytes. Composing them requires disjointness
between the various pairs. The proof obligations fall into three
shapes (8 / ... | @@ -26,12 +26,21 @@
-- Pairwise step-code disjointness (8 / 16 / 24 byte gaps)
-- ============================================================================
+/-- Two cascade-step `CodeReq`s at bases 8 bytes apart are disjoint. -/
+theorem rlp_phase1_step_code_disjoint_8
+ (k1 k2 : BitVec 12) (off1 off2 : 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_520d7609ae6c_0 | 53b93f2052534a46 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/DivCallExactCallable.lean | DivCallExactCallable | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "evm_div_callable_v4_preserving_branch_return_x1_framed_spec_in_sdivCodeV4",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n EvmAsm.Rv64.cpsTripleWithin_frameR F (by pcFree)\n ... | [
{
"name": "evm_div_callable_v4_preserving_branch_return_x1_spec_in_sdivCodeV4",
"text": "/-- v4 branch-certificate specialization of\n `evm_div_callable_preserving_x1_exact_pre_spec_in_sdivCode`.\n\n The dispatcher precondition uses the exact return value described by\n `DivStackSpecCase.returnX1`,... | [
{
"name": "evm_div_callable_v4_preserving_branch_return_x1_framed_spec_in_sdivCodeV4",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 35,
"n_chars": 1773,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_st... | 1 | /-
EvmAsm.Evm64.SDiv.Compose.DivCallExactCallable
Exact-`x1` unsigned-DIV callable wrappers used by the SDIV div-call
postcondition sidecar proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallPostPcFreeBasics
import EvmAsm.Evm64.DivMod.CallableV1Legacy
import EvmAsm.Evm64.DivMod.CallableV4Div
namespace EvmAsm.E... | /-
EvmAsm.Evm64.SDiv.Compose.DivCallExactCallable
Exact-`x1` unsigned-DIV callable wrappers used by the SDIV div-call
postcondition sidecar proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallPostPcFreeBasics
import EvmAsm.Evm64.DivMod.CallableV1Legacy
import EvmAsm.Evm64.DivMod.CallableV4Div
namespace EvmAsm.E... | @@ -13,6 +13,43 @@
open EvmAsm.Rv64.Tactics
+/-- v4 branch-certificate specialization of
+ `evm_div_callable_preserving_x1_exact_pre_spec_in_sdivCode`.
+
+ The dispatcher precondition uses the exact return value described by
+ `DivStackSpecCase.returnX1`, while the CLZ/shift register comes from the
+ 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_520d7609ae6c_1 | 530821a1ed20f461 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/DivCallExactCallable.lean | DivCallExactCallable | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "evm_div_callable_v4_preserving_x1_exact_pre_framed_spec_in_sdivCodeV4",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n EvmAsm.Rv64.cpsTripleWithin_frameR F (by pcFree)\n (e... | [
{
"name": "evm_div_callable_v4_preserving_x1_exact_pre_spec_in_sdivCodeV4",
"text": "/-- v4 variant of the preserving-`x1` unsigned-DIV callable wrapper whose\n no-NOP body proof already has the exact caller return address in the\n dispatch precondition. -/\ntheorem evm_div_callable_v4_preserving_x1_e... | [
{
"name": "evm_div_callable_v4_preserving_x1_exact_pre_framed_spec_in_sdivCodeV4",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 32,
"n_chars": 1661,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_struct... | 1 | /-
EvmAsm.Evm64.SDiv.Compose.DivCallExactCallable
Exact-`x1` unsigned-DIV callable wrappers used by the SDIV div-call
postcondition sidecar proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallPostPcFreeBasics
import EvmAsm.Evm64.DivMod.CallableV1Legacy
import EvmAsm.Evm64.DivMod.CallableV4Div
namespace EvmAsm.E... | /-
EvmAsm.Evm64.SDiv.Compose.DivCallExactCallable
Exact-`x1` unsigned-DIV callable wrappers used by the SDIV div-call
postcondition sidecar proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallPostPcFreeBasics
import EvmAsm.Evm64.DivMod.CallableV1Legacy
import EvmAsm.Evm64.DivMod.CallableV4Div
namespace EvmAsm.E... | @@ -13,6 +13,54 @@
open EvmAsm.Rv64.Tactics
+/-- v4 variant of the preserving-`x1` unsigned-DIV callable wrapper whose
+ no-NOP body proof already has the exact caller return address in the
+ dispatch precondition. -/
+theorem evm_div_callable_v4_preserving_x1_exact_pre_spec_in_sdivCodeV4
+ (sp base x9Val... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520d7609ae6c_2 | 96ed9bedd678c169 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/DivCallExactCallable.lean | DivCallExactCallable | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "evm_div_callable_v4_preserving_x1_x9_exact_pre_framed_spec_in_sdivCodeV4",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n EvmAsm.Rv64.cpsTripleWithin_frameR F (by pcFree)\n ... | [
{
"name": "evm_div_callable_v4_preserving_x1_x9_exact_pre_spec_in_sdivCodeV4",
"text": "/-- v4 variant of\n `evm_div_callable_preserving_x1_x9_exact_pre_spec_in_sdivCode`. -/\ntheorem evm_div_callable_v4_preserving_x1_x9_exact_pre_spec_in_sdivCodeV4\n (sp base x9Val raVal : Word) (a b : EvmWord) (v2 v... | [
{
"name": "evm_div_callable_v4_preserving_x1_x9_exact_pre_framed_spec_in_sdivCodeV4",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 34,
"n_chars": 1736,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_str... | 1 | /-
EvmAsm.Evm64.SDiv.Compose.DivCallExactCallable
Exact-`x1` unsigned-DIV callable wrappers used by the SDIV div-call
postcondition sidecar proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallPostPcFreeBasics
import EvmAsm.Evm64.DivMod.CallableV1Legacy
import EvmAsm.Evm64.DivMod.CallableV4Div
namespace EvmAsm.E... | /-
EvmAsm.Evm64.SDiv.Compose.DivCallExactCallable
Exact-`x1` unsigned-DIV callable wrappers used by the SDIV div-call
postcondition sidecar proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallPostPcFreeBasics
import EvmAsm.Evm64.DivMod.CallableV1Legacy
import EvmAsm.Evm64.DivMod.CallableV4Div
namespace EvmAsm.E... | @@ -13,6 +13,39 @@
open EvmAsm.Rv64.Tactics
+/-- v4 variant of
+ `evm_div_callable_preserving_x1_x9_exact_pre_spec_in_sdivCode`. -/
+theorem evm_div_callable_v4_preserving_x1_x9_exact_pre_spec_in_sdivCodeV4
+ (sp base x9Val raVal : Word) (a b : EvmWord) (v2 v5 v6 v7 v10 v11 : Word)
+ (q0 q1 q2 q3 u0 u1 u2... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_520d7609ae6c_3 | 682bc0924e3b45f4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/DivCallExactCallable.lean | DivCallExactCallable | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "evm_div_callable_v4_exact_frame_framed_spec_in_sdivCodeV4",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n EvmAsm.Rv64.cpsTripleWithin_frameR F (by pcFree)\n (evm_div_calla... | [
{
"name": "evm_div_callable_v4_exact_frame_spec_in_sdivCodeV4",
"text": "/-- v4 embedded DIV callable wrapper with the named exact caller-frame post. -/\ntheorem evm_div_callable_v4_exact_frame_spec_in_sdivCodeV4\n (sp base x9Val raVal : Word) (a b : EvmWord) (v2 v5 v6 v7 v10 v11 : Word)\n (q0 q1 q2 q... | [
{
"name": "evm_div_callable_v4_exact_frame_framed_spec_in_sdivCodeV4",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 32,
"n_chars": 1628,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
... | 1 | /-
EvmAsm.Evm64.SDiv.Compose.DivCallExactCallable
Exact-`x1` unsigned-DIV callable wrappers used by the SDIV div-call
postcondition sidecar proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallPostPcFreeBasics
import EvmAsm.Evm64.DivMod.CallableV1Legacy
import EvmAsm.Evm64.DivMod.CallableV4Div
namespace EvmAsm.E... | /-
EvmAsm.Evm64.SDiv.Compose.DivCallExactCallable
Exact-`x1` unsigned-DIV callable wrappers used by the SDIV div-call
postcondition sidecar proofs.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallPostPcFreeBasics
import EvmAsm.Evm64.DivMod.CallableV1Legacy
import EvmAsm.Evm64.DivMod.CallableV4Div
namespace EvmAsm.E... | @@ -13,6 +13,36 @@
open EvmAsm.Rv64.Tactics
+/-- v4 embedded DIV callable wrapper with the named exact caller-frame post. -/
+theorem evm_div_callable_v4_exact_frame_spec_in_sdivCodeV4
+ (sp base x9Val raVal : Word) (a b : EvmWord) (v2 v5 v6 v7 v10 v11 : Word)
+ (q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
+ nMe... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_67b98444cd84_0 | 142a97f5a1c1d87c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/U256AddBeSAsm.lean | U256AddBeSAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 3 | [
{
"theorem_name": "add_idx_sub_self",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hidx : (BitVec.ofNat 64 (31 - i)).toNat = 31 - i := idx_toNat i hi\n rw [BitVec.toNat_sub, BitVec.toNat_add, hidx]\n... | [
{
"name": "idx_toNat",
"text": "private theorem idx_toNat (i : Nat) (hi : i ≤ 31) :\n (BitVec.ofNat 64 (31 - i)).toNat = 31 - i := by\n rw [BitVec.toNat_ofNat]\n omega\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 141,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_auto... | [
{
"name": "add_idx_sub_self",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 269,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nestin... | 1 | /-
EvmAsm.Codegen.Programs.U256AddBeSAsm
SAsm model for `u256_add_be`: add two 32-byte big-endian buffers, write the
32-byte result, and return the final carry in `a0`.
This proof uses the first additive bottom-break loop node (`Stmt.doWhileBreak`)
from PR #9902. The SAsm memory contract is intentionally s... | /-
EvmAsm.Codegen.Programs.U256AddBeSAsm
SAsm model for `u256_add_be`: add two 32-byte big-endian buffers, write the
32-byte result, and return the final carry in `a0`.
This proof uses the first additive bottom-break loop node (`Stmt.doWhileBreak`)
from PR #9902. The SAsm memory contract is intentionally s... | @@ -146,9 +146,14 @@
/-! ## Local proof helpers -/
+private theorem idx_toNat (i : Nat) (hi : i ≤ 31) :
+ (BitVec.ofNat 64 (31 - i)).toNat = 31 - i := by
+ rw [BitVec.toNat_ofNat]
+ omega
+
private theorem add_idx_sub_self (ptr : Word) (i : Nat) (hi : i ≤ 31) :
(ptr + BitVec.ofNat 64 (31 - i) - ptr).toN... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_67b98444cd84_1 | 118d83a6efbbdd1f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/U256AddBeSAsm.lean | U256AddBeSAsm | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 3 | [
{
"theorem_name": "add_idx_sub_self",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hidx : (BitVec.ofNat 64 (31 - i)).toNat = 31 - i := idx_toNat i hi\n rw [BitVec.toNat_sub, BitVec.toNat_add, hidx]\n... | [
{
"name": "idx_toNat",
"text": "private theorem idx_toNat (i : Nat) (hi : i ≤ 31) :\n (BitVec.ofNat 64 (31 - i)).toNat = 31 - i := by\n rw [BitVec.toNat_ofNat]\n omega\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 141,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_auto... | [
{
"name": "add_idx_sub_base",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 330,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nestin... | 1 | /-
EvmAsm.Codegen.Programs.U256AddBeSAsm
SAsm model for `u256_add_be`: add two 32-byte big-endian buffers, write the
32-byte result, and return the final carry in `a0`.
This proof uses the first additive bottom-break loop node (`Stmt.doWhileBreak`)
from PR #9902. The SAsm memory contract is intentionally s... | /-
EvmAsm.Codegen.Programs.U256AddBeSAsm
SAsm model for `u256_add_be`: add two 32-byte big-endian buffers, write the
32-byte result, and return the final carry in `a0`.
This proof uses the first additive bottom-break loop node (`Stmt.doWhileBreak`)
from PR #9902. The SAsm memory contract is intentionally s... | @@ -146,10 +146,15 @@
/-! ## Local proof helpers -/
+private theorem idx_toNat (i : Nat) (hi : i ≤ 31) :
+ (BitVec.ofNat 64 (31 - i)).toNat = 31 - i := by
+ rw [BitVec.toNat_ofNat]
+ omega
+
private theorem add_idx_sub_base (ptr base : Word) (i : Nat) (hi : i ≤ 31) :
(ptr + BitVec.ofNat 64 (31 - i) - ba... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_67b98444cd84_2 | b28296c7ab1e25a0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/U256AddBeSAsm.lean | U256AddBeSAsm | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "not_inRw_disjoint32",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold inRw\n rw [hws, add_idx_sub_base ptr outPtr i hi]\n intro hcontra\n rcases hdisj with hd | hd <;> omega",
... | [
{
"name": "add_idx_sub_base",
"text": "private theorem add_idx_sub_base (ptr base : Word) (i : Nat) (hi : i ≤ 31) :\n (ptr + BitVec.ofNat 64 (31 - i) - base).toNat =\n (ptr.toNat + (31 - i) + (2 ^ 64 - base.toNat)) % 2 ^ 64 := by\n have hidx : (BitVec.ofNat 64 (31 - i)).toNat = 31 - i := idx_toNat ... | [
{
"name": "not_inRw_disjoint32",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 474,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"max_ne... | 2 | /-
EvmAsm.Codegen.Programs.U256AddBeSAsm
SAsm model for `u256_add_be`: add two 32-byte big-endian buffers, write the
32-byte result, and return the final carry in `a0`.
This proof uses the first additive bottom-break loop node (`Stmt.doWhileBreak`)
from PR #9902. The SAsm memory contract is intentionally s... | /-
EvmAsm.Codegen.Programs.U256AddBeSAsm
SAsm model for `u256_add_be`: add two 32-byte big-endian buffers, write the
32-byte result, and return the final carry in `a0`.
This proof uses the first additive bottom-break loop node (`Stmt.doWhileBreak`)
from PR #9902. The SAsm memory contract is intentionally s... | @@ -151,13 +151,24 @@
rw [BitVec.toNat_ofNat]
omega
+private theorem add_idx_sub_base (ptr base : Word) (i : Nat) (hi : i ≤ 31) :
+ (ptr + BitVec.ofNat 64 (31 - i) - base).toNat =
+ (ptr.toNat + (31 - i) + (2 ^ 64 - base.toNat)) % 2 ^ 64 := by
+ have hidx : (BitVec.ofNat 64 (31 - i)).toNat = 31 - i := ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_67b98444cd84_3 | be7067c59afe8760 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/U256AddBeSAsm.lean | U256AddBeSAsm | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "byteAt_idx",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Region.byteAt\n rw [add_idx_sub_self ptr i hi]",
"n_chars": 59,
"n_subproofs": 0,
"n_tactics": 3,
"cyclo... | [
{
"name": "add_idx_sub_self",
"text": "private theorem add_idx_sub_self (ptr : Word) (i : Nat) (hi : i ≤ 31) :\n (ptr + BitVec.ofNat 64 (31 - i) - ptr).toNat = 31 - i := by\n have hidx : (BitVec.ofNat 64 (31 - i)).toNat = 31 - i := idx_toNat i hi\n rw [BitVec.toNat_sub, BitVec.toNat_add, hidx]\n omega... | [
{
"name": "byteAt_idx",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 255,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
... | 2 | /-
EvmAsm.Codegen.Programs.U256AddBeSAsm
SAsm model for `u256_add_be`: add two 32-byte big-endian buffers, write the
32-byte result, and return the final carry in `a0`.
This proof uses the first additive bottom-break loop node (`Stmt.doWhileBreak`)
from PR #9902. The SAsm memory contract is intentionally s... | /-
EvmAsm.Codegen.Programs.U256AddBeSAsm
SAsm model for `u256_add_be`: add two 32-byte big-endian buffers, write the
32-byte result, and return the final carry in `a0`.
This proof uses the first additive bottom-break loop node (`Stmt.doWhileBreak`)
from PR #9902. The SAsm memory contract is intentionally s... | @@ -151,9 +151,17 @@
rw [BitVec.toNat_ofNat]
omega
+private theorem add_idx_sub_self (ptr : Word) (i : Nat) (hi : i ≤ 31) :
+ (ptr + BitVec.ofNat 64 (31 - i) - ptr).toNat = 31 - i := by
+ have hidx : (BitVec.ofNat 64 (31 - i)).toNat = 31 - i := idx_toNat i hi
+ rw [BitVec.toNat_sub, BitVec.toNat_add, hidx]... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_67b98444cd84_4 | eed6c8e8fdb162f7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/U256AddBeSAsm.lean | U256AddBeSAsm | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "readLbu_blockVCs",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have haddr0 : rf.get addrReg + signExtend12 (0 : BitVec 12)\n = ptr + BitVec.ofNat 64 (31 - i) := by\n rw [haddr,... | [
{
"name": "not_inRw_disjoint32",
"text": "private theorem not_inRw_disjoint32 (ptr outPtr : Word) (ws : List (BitVec 8))\n (i : Nat) (hi : i ≤ 31)\n (hws : ws.length = 32)\n (hptr : ptr.toNat + 32 < 2 ^ 64)\n (hout : outPtr.toNat + 32 < 2 ^ 64)\n (hdisj : ptr.toNat + 32 ≤ outPtr.toNat ∨ outPt... | [
{
"name": "readLbu_blockVCs",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 24,
"n_chars": 1194,
"n_subproofs": 1,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 7,
"n_structural": 2,
"automation_only": false,
"max_nes... | 4 | /-
EvmAsm.Codegen.Programs.U256AddBeSAsm
SAsm model for `u256_add_be`: add two 32-byte big-endian buffers, write the
32-byte result, and return the final carry in `a0`.
This proof uses the first additive bottom-break loop node (`Stmt.doWhileBreak`)
from PR #9902. The SAsm memory contract is intentionally s... | /-
EvmAsm.Codegen.Programs.U256AddBeSAsm
SAsm model for `u256_add_be`: add two 32-byte big-endian buffers, write the
32-byte result, and return the final carry in `a0`.
This proof uses the first additive bottom-break loop node (`Stmt.doWhileBreak`)
from PR #9902. The SAsm memory contract is intentionally s... | @@ -164,6 +164,18 @@
rw [BitVec.toNat_sub, BitVec.toNat_add, hidx]
omega
+private theorem not_inRw_disjoint32 (ptr outPtr : Word) (ws : List (BitVec 8))
+ (i : Nat) (hi : i ≤ 31)
+ (hws : ws.length = 32)
+ (hptr : ptr.toNat + 32 < 2 ^ 64)
+ (hout : outPtr.toNat + 32 < 2 ^ 64)
+ (hdisj : ptr.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_67b98444cd84_5 | 76b46a25382b1d6f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/U256AddBeSAsm.lean | U256AddBeSAsm | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "readLbu_blockVCs",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have haddr0 : rf.get addrReg + signExtend12 (0 : BitVec 12)\n = ptr + BitVec.ofNat 64 (31 - i) := by\n rw [haddr,... | [
{
"name": "not_inRw_disjoint32",
"text": "private theorem not_inRw_disjoint32 (ptr outPtr : Word) (ws : List (BitVec 8))\n (i : Nat) (hi : i ≤ 31)\n (hws : ws.length = 32)\n (hptr : ptr.toNat + 32 < 2 ^ 64)\n (hout : outPtr.toNat + 32 < 2 ^ 64)\n (hdisj : ptr.toNat + 32 ≤ outPtr.toNat ∨ outPt... | [
{
"name": "execBlock_lbu_ro_idx",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 21,
"n_chars": 1001,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 6,
"n_structural": 1,
"automation_only": false,
"max... | 5 | /-
EvmAsm.Codegen.Programs.U256AddBeSAsm
SAsm model for `u256_add_be`: add two 32-byte big-endian buffers, write the
32-byte result, and return the final carry in `a0`.
This proof uses the first additive bottom-break loop node (`Stmt.doWhileBreak`)
from PR #9902. The SAsm memory contract is intentionally s... | /-
EvmAsm.Codegen.Programs.U256AddBeSAsm
SAsm model for `u256_add_be`: add two 32-byte big-endian buffers, write the
32-byte result, and return the final carry in `a0`.
This proof uses the first additive bottom-break loop node (`Stmt.doWhileBreak`)
from PR #9902. The SAsm memory contract is intentionally s... | @@ -164,6 +164,18 @@
rw [BitVec.toNat_sub, BitVec.toNat_add, hidx]
omega
+private theorem not_inRw_disjoint32 (ptr outPtr : Word) (ws : List (BitVec 8))
+ (i : Nat) (hi : i ≤ 31)
+ (hws : ws.length = 32)
+ (hptr : ptr.toNat + 32 < 2 ^ 64)
+ (hout : outPtr.toNat + 32 < 2 ^ 64)
+ (hdisj : ptr.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_67b98444cd84_6 | fa9e831f594d2af4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/U256AddBeSAsm.lean | U256AddBeSAsm | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "byteAt_idx",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Region.byteAt\n rw [add_idx_sub_self ptr i hi]",
"n_chars": 59,
"n_subproofs": 0,
"n_tactics": 3,
"cyclo... | [
{
"name": "add_idx_sub_self",
"text": "private theorem add_idx_sub_self (ptr : Word) (i : Nat) (hi : i ≤ 31) :\n (ptr + BitVec.ofNat 64 (31 - i) - ptr).toNat = 31 - i := by\n have hidx : (BitVec.ofNat 64 (31 - i)).toNat = 31 - i := idx_toNat i hi\n rw [BitVec.toNat_sub, BitVec.toNat_add, hidx]\n omega... | [
{
"name": "sumStore_effect",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 46,
"n_chars": 1973,
"n_subproofs": 0,
"n_tactics": 29,
"cyclomatic": 1,
"n_automation": 10,
"n_rewrites": 14,
"n_structural": 2,
"automation_only": false,
"max_ne... | 3 | /-
EvmAsm.Codegen.Programs.U256AddBeSAsm
SAsm model for `u256_add_be`: add two 32-byte big-endian buffers, write the
32-byte result, and return the final carry in `a0`.
This proof uses the first additive bottom-break loop node (`Stmt.doWhileBreak`)
from PR #9902. The SAsm memory contract is intentionally s... | /-
EvmAsm.Codegen.Programs.U256AddBeSAsm
SAsm model for `u256_add_be`: add two 32-byte big-endian buffers, write the
32-byte result, and return the final carry in `a0`.
This proof uses the first additive bottom-break loop node (`Stmt.doWhileBreak`)
from PR #9902. The SAsm memory contract is intentionally s... | @@ -151,6 +151,12 @@
rw [BitVec.toNat_ofNat]
omega
+private theorem add_idx_sub_self (ptr : Word) (i : Nat) (hi : i ≤ 31) :
+ (ptr + BitVec.ofNat 64 (31 - i) - ptr).toNat = 31 - i := by
+ have hidx : (BitVec.ofNat 64 (31 - i)).toNat = 31 - i := idx_toNat i hi
+ rw [BitVec.toNat_sub, BitVec.toNat_add, hidx]... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_67b98444cd84_7 | 802736b05a0ffb17 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/U256AddBeSAsm.lean | U256AddBeSAsm | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "u256AddBeBefore_effect",
"depth": 1,
"n_commands": 0,
"n_lines": 113,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro rf' ws' A' hsp\n unfold u256AddBeBefore at hsp\n obtain ⟨rfS, wsS, hwsS, hreachB, hrf', hws'⟩ := hsp\n ob... | [
{
"name": "execBlock_lbu_ro_idx",
"text": "private theorem execBlock_lbu_ro_idx (ptr outPtr : Word) (rf : RegFile)\n (ws robytes : List (BitVec 8)) (rd addrReg : Reg) (i : Nat) (hi : i ≤ 31)\n (haddr : rf.get addrReg = ptr + BitVec.ofNat 64 (31 - i))\n (hws : ws.length = 32)\n (hptrBound : ptr.t... | [
{
"name": "u256AddBeBefore_effect",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 10,
"n_lines": 131,
"n_chars": 6541,
"n_subproofs": 20,
"n_tactics": 113,
"cyclomatic": 1,
"n_automation": 26,
"n_rewrites": 32,
"n_structural": 30,
"automation_only": false,... | 10 | /-
EvmAsm.Codegen.Programs.U256AddBeSAsm
SAsm model for `u256_add_be`: add two 32-byte big-endian buffers, write the
32-byte result, and return the final carry in `a0`.
This proof uses the first additive bottom-break loop node (`Stmt.doWhileBreak`)
from PR #9902. The SAsm memory contract is intentionally s... | /-
EvmAsm.Codegen.Programs.U256AddBeSAsm
SAsm model for `u256_add_be`: add two 32-byte big-endian buffers, write the
32-byte result, and return the final carry in `a0`.
This proof uses the first additive bottom-break loop node (`Stmt.doWhileBreak`)
from PR #9902. The SAsm memory contract is intentionally s... | @@ -196,6 +196,26 @@
rw [execBlock_cons, execBlock_nil, execInstrRF]
dsimp only [aluSem, loadSem]
+private theorem execBlock_lbu_ro_idx (ptr outPtr : Word) (rf : RegFile)
+ (ws robytes : List (BitVec 8)) (rd addrReg : Reg) (i : Nat) (hi : i ≤ 31)
+ (haddr : rf.get addrReg = ptr + BitVec.ofNat 64 (31 - i))... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_67b98444cd84_8 | 4e953817459183ed | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/U256AddBeSAsm.lean | U256AddBeSAsm | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "byteAt_idx",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Region.byteAt\n rw [add_idx_sub_self ptr i hi]",
"n_chars": 59,
"n_subproofs": 0,
"n_tactics": 3,
"cyclo... | [
{
"name": "add_idx_sub_self",
"text": "private theorem add_idx_sub_self (ptr : Word) (i : Nat) (hi : i ≤ 31) :\n (ptr + BitVec.ofNat 64 (31 - i) - ptr).toNat = 31 - i := by\n have hidx : (BitVec.ofNat 64 (31 - i)).toNat = 31 - i := idx_toNat i hi\n rw [BitVec.toNat_sub, BitVec.toNat_add, hidx]\n omega... | [
{
"name": "sumStore_blockVCs",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 857,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 5,
"n_structural": 0,
"automation_only": false,
"max_nest... | 2 | /-
EvmAsm.Codegen.Programs.U256AddBeSAsm
SAsm model for `u256_add_be`: add two 32-byte big-endian buffers, write the
32-byte result, and return the final carry in `a0`.
This proof uses the first additive bottom-break loop node (`Stmt.doWhileBreak`)
from PR #9902. The SAsm memory contract is intentionally s... | /-
EvmAsm.Codegen.Programs.U256AddBeSAsm
SAsm model for `u256_add_be`: add two 32-byte big-endian buffers, write the
32-byte result, and return the final carry in `a0`.
This proof uses the first additive bottom-break loop node (`Stmt.doWhileBreak`)
from PR #9902. The SAsm memory contract is intentionally s... | @@ -151,6 +151,12 @@
rw [BitVec.toNat_ofNat]
omega
+private theorem add_idx_sub_self (ptr : Word) (i : Nat) (hi : i ≤ 31) :
+ (ptr + BitVec.ofNat 64 (31 - i) - ptr).toNat = 31 - i := by
+ have hidx : (BitVec.ofNat 64 (31 - i)).toNat = 31 - i := idx_toNat i hi
+ rw [BitVec.toNat_sub, BitVec.toNat_add, hidx]... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_67b98444cd84_9 | 58073c0bb9c07a76 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/U256AddBeSAsm.lean | U256AddBeSAsm | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "u256AddBeBefore_effect",
"depth": 1,
"n_commands": 0,
"n_lines": 113,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro rf' ws' A' hsp\n unfold u256AddBeBefore at hsp\n obtain ⟨rfS, wsS, hwsS, hreachB, hrf', hws'⟩ := hsp\n ob... | [
{
"name": "sumStore_effect",
"text": "private theorem sumStore_effect (outPtr : Word) (rf : RegFile) (ws : List (BitVec 8))\n (i : Nat) (hi : i ≤ 31) (a b : BitVec 8) (carry : Word)\n (hx30 : rf.get .x30 = a.zeroExtend 64)\n (hx31 : rf.get .x31 = b.zeroExtend 64)\n (hx6 : rf.get .x6 = carry)\n ... | [
{
"name": "u256AddBe_spec",
"fan_in": 0,
"n_deps_direct": 6,
"n_deps_transitive": 15,
"n_lines": 185,
"n_chars": 9205,
"n_subproofs": 36,
"n_tactics": 182,
"cyclomatic": 10,
"n_automation": 41,
"n_rewrites": 44,
"n_structural": 56,
"automation_only": false,
"m... | 15 | /-
EvmAsm.Codegen.Programs.U256AddBeSAsm
SAsm model for `u256_add_be`: add two 32-byte big-endian buffers, write the
32-byte result, and return the final carry in `a0`.
This proof uses the first additive bottom-break loop node (`Stmt.doWhileBreak`)
from PR #9902. The SAsm memory contract is intentionally s... | /-
EvmAsm.Codegen.Programs.U256AddBeSAsm
SAsm model for `u256_add_be`: add two 32-byte big-endian buffers, write the
32-byte result, and return the final carry in `a0`.
This proof uses the first additive bottom-break loop node (`Stmt.doWhileBreak`)
from PR #9902. The SAsm memory contract is intentionally s... | @@ -264,6 +264,51 @@
simp
· simp [BitVec.truncate_eq_setWidth, BitVec.getLsbD_setWidth, hj]
+private theorem sumStore_effect (outPtr : Word) (rf : RegFile) (ws : List (BitVec 8))
+ (i : Nat) (hi : i ≤ 31) (a b : BitVec 8) (carry : Word)
+ (hx30 : rf.get .x30 = a.zeroExtend 64)
+ (hx31 : rf.get .x31 =... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_448808bfe3e1_0 | 1ad044e12032d17d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReducePerLimb.lean | ReducePerLimb | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "reduce_bit_identity",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have e2 : (2 : Nat) ^ (64 - k) = 2 * 2 ^ (63 - k) := by\n rw [show 64 - k = (63 - k) + 1 from by omega, Nat.pow_succ... | [
{
"name": "div_mul_add_mod_div",
"text": "/-- General base-splitting identity: the high digit times the base plus the\n low part's high bits reconstructs `W`'s high bits. -/\nprivate theorem div_mul_add_mod_div (W a b : Nat) :\n W / (a * b) * b + W % (a * b) / a = W / a := by\n rw [Nat.mod_mul_right_... | [
{
"name": "reduce_bit_identity",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 748,
"n_subproofs": 3,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 5,
"n_structural": 0,
"automation_only": false,
"max_n... | 1 | /-
EvmAsm.Evm64.MulMod.ReducePerLimb
Value-level (Horner) correctness of one 64-bit carry-aware bit loop.
`mulModReduceStepNCarry r n w 64` folds all 64 bits of the product limb `w`
into the remainder, MSB first. This file proves it computes exactly the
base-`2^64` Horner step modulo `n`:
(mulModRedu... | /-
EvmAsm.Evm64.MulMod.ReducePerLimb
Value-level (Horner) correctness of one 64-bit carry-aware bit loop.
`mulModReduceStepNCarry r n w 64` folds all 64 bits of the product limb `w`
into the remainder, MSB first. This file proves it computes exactly the
base-`2^64` Horner step modulo `n`:
(mulModRedu... | @@ -25,11 +25,24 @@
open EvmAsm.Rv64
+/-- General base-splitting identity: the high digit times the base plus the
+ low part's high bits reconstructs `W`'s high bits. -/
+private theorem div_mul_add_mod_div (W a b : Nat) :
+ W / (a * b) * b + W % (a * b) / a = W / a := by
+ rw [Nat.mod_mul_right_div_self, ←... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_448808bfe3e1_1 | f697572e4ee014ab | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReducePerLimb.lean | ReducePerLimb | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "mulModReduceStepNCarry_toNat",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro k\n induction k with\n | zero =>\n intro _ w r hr\n rw [mulModReduceStepNCarry_zero, Nat.pow_ze... | [
{
"name": "shiftLeft_one_toNat",
"text": "/-- `(w <<< 1).toNat` as a `Nat`: double modulo `2^64`. -/\nprivate theorem shiftLeft_one_toNat (w : Word) :\n (w <<< 1).toNat = 2 * w.toNat % 2 ^ 64 := by\n rw [BitVec.toNat_shiftLeft, Nat.shiftLeft_eq, Nat.pow_one, Nat.mul_comm]\n\n",
"fan_in": 1,
"n_l... | [
{
"name": "mulModReduceStepNCarry_toNat",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 28,
"n_chars": 1407,
"n_subproofs": 3,
"n_tactics": 22,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 6,
"n_structural": 4,
"automation_only": false,
... | 4 | /-
EvmAsm.Evm64.MulMod.ReducePerLimb
Value-level (Horner) correctness of one 64-bit carry-aware bit loop.
`mulModReduceStepNCarry r n w 64` folds all 64 bits of the product limb `w`
into the remainder, MSB first. This file proves it computes exactly the
base-`2^64` Horner step modulo `n`:
(mulModRedu... | /-
EvmAsm.Evm64.MulMod.ReducePerLimb
Value-level (Horner) correctness of one 64-bit carry-aware bit loop.
`mulModReduceStepNCarry r n w 64` folds all 64 bits of the product limb `w`
into the remainder, MSB first. This file proves it computes exactly the
base-`2^64` Horner step modulo `n`:
(mulModRedu... | @@ -44,6 +44,11 @@
rw [e64, Nat.mul_mod_mul_left, e2,
Nat.mul_div_mul_left _ _ (by decide : (0 : Nat) < 2), ← e3, div_mul_add_mod_div]
+/-- `(w <<< 1).toNat` as a `Nat`: double modulo `2^64`. -/
+private theorem shiftLeft_one_toNat (w : Word) :
+ (w <<< 1).toNat = 2 * w.toNat % 2 ^ 64 := by
+ rw [BitVec.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_448808bfe3e1_2 | 8ecaa87b0b271048 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReducePerLimb.lean | ReducePerLimb | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "mulModReduceStepNCarry_toNat",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro k\n induction k with\n | zero =>\n intro _ w r hr\n rw [mulModReduceStepNCarry_zero, Nat.pow_ze... | [
{
"name": "inputBit_eq_div",
"text": "/-- The consumed input bit as a `Nat`: the top bit `w.toNat / 2^63`. -/\nprivate theorem inputBit_eq_div (w : Word) :\n (if mulModReduceInputBit w then (1 : Nat) else 0) = w.toNat / 2 ^ 63 := by\n have hlt : w.toNat < 2 ^ 64 := w.isLt\n have e64 : (2 : Nat) ^ 64 = ... | [
{
"name": "mulModReduceStepNCarry_toNat_full",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 11,
"n_chars": 591,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": fals... | 5 | /-
EvmAsm.Evm64.MulMod.ReducePerLimb
Value-level (Horner) correctness of one 64-bit carry-aware bit loop.
`mulModReduceStepNCarry r n w 64` folds all 64 bits of the product limb `w`
into the remainder, MSB first. This file proves it computes exactly the
base-`2^64` Horner step modulo `n`:
(mulModRedu... | /-
EvmAsm.Evm64.MulMod.ReducePerLimb
Value-level (Horner) correctness of one 64-bit carry-aware bit loop.
`mulModReduceStepNCarry r n w 64` folds all 64 bits of the product limb `w`
into the remainder, MSB first. This file proves it computes exactly the
base-`2^64` Horner step modulo `n`:
(mulModRedu... | @@ -49,6 +49,19 @@
(w <<< 1).toNat = 2 * w.toNat % 2 ^ 64 := by
rw [BitVec.toNat_shiftLeft, Nat.shiftLeft_eq, Nat.pow_one, Nat.mul_comm]
+/-- The consumed input bit as a `Nat`: the top bit `w.toNat / 2^63`. -/
+private theorem inputBit_eq_div (w : Word) :
+ (if mulModReduceInputBit w then (1 : Nat) else 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_1899da17012d_0 | 82d25559b6785a28 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/RaSpill.lean | RaSpill | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "retSpecR",
"depth": 1,
"n_commands": 0,
"n_lines": 179,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ret halign\n have hk64 : k < 2 ^ 64 := by\n have := hrw.2.1\n omega\n have hlflat : (f.body.flatten (base + 4)).le... | [
{
"name": "cpsTripleWithin_exists_pre_R",
"text": "/-- Split an `asrtR` precondition into a per-symbolic-state family, including\n a concrete value for the owned `ra`. -/\ntheorem cpsTripleWithin_exists_pre_R {n : Nat} {entry exit_ : Word}\n {cr : CodeReq} {reg : Region} {rw : RwRegion} {reach : Reach... | [
{
"name": "retSpecR",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 215,
"n_chars": 10569,
"n_subproofs": 32,
"n_tactics": 182,
"cyclomatic": 1,
"n_automation": 13,
"n_rewrites": 24,
"n_structural": 32,
"automation_only": false,
"max_nest... | 5 | /-
EvmAsm.Rv64.SAsm.RaSpill
Packaging a verified *caller* (a function whose body contains calls) as a
callee `FnHandle` (docs/sasm-design.md §3.6). A caller clobbers `ra` at
its call sites, so the packaged code spills `ra` to a dword slot of the
function's writable region on entry and restores it before ret... | /-
EvmAsm.Rv64.SAsm.RaSpill
Packaging a verified *caller* (a function whose body contains calls) as a
callee `FnHandle` (docs/sasm-design.md §3.6). A caller clobbers `ra` at
its call sites, so the packaged code spills `ra` to a dword slot of the
function's writable region on entry and restores it before ret... | @@ -221,6 +221,27 @@
-- Existential-precondition splitters with the `ra` atom alongside
-- ============================================================================
+/-- Split an `asrtR` precondition into a per-symbolic-state family, including
+ a concrete value for the owned `ra`. -/
+theorem cpsTripleWithin... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_96e52b123a55_0 | 7060a8fd985be64e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2V4NoNopCallCallMax.lean | FullPathN2V4NoNopCallCallMax | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "divK_loop_n2_call_call_max_from_source_exact_loopIterScratch_v4_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 218,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [loopN2CallCallMaxSourceConds_unfold] at hconds\n simp only [r2... | [
{
"name": "loopN2CallCallMaxSourceConds_unfold",
"text": "theorem loopN2CallCallMaxSourceConds_unfold\n (v0 v1 v2 v3 u0 u1 u2 u3 uTop u0Orig1 u0Orig0 : Word) :\n loopN2CallCallMaxSourceConds\n v0 v1 v2 v3 u0 u1 u2 u3 uTop u0Orig1 u0Orig0 =\n (let r2 := r2CCCN2V4 v0 v1 v2 v3 u0 u1 u2 u3 uTop\n ... | [
{
"name": "divK_loop_n2_call_call_max_from_source_exact_loopIterScratch_v4_noNop",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 239,
"n_chars": 12022,
"n_subproofs": 6,
"n_tactics": 214,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_st... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V4NoNopCallCallMax
Three-iteration call-call-max composition for the n=2 v4/no-NOP source path.
j=2 and j=1 take the callable trial-division path; j=0 takes the max-trial
branch. Reuses the irreducible aliases `r2CCCN2V4` / `r1CCCN2V4` from
`FullPathN2V4NoNopFinalPost... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V4NoNopCallCallMax
Three-iteration call-call-max composition for the n=2 v4/no-NOP source path.
j=2 and j=1 take the callable trial-division path; j=0 takes the max-trial
branch. Reuses the irreducible aliases `r2CCCN2V4` / `r1CCCN2V4` from
`FullPathN2V4NoNopFinalPost... | @@ -87,6 +87,23 @@
isAddbackCarry2NzN2Max v0 v1 v2 v3
u0Orig0 r1.2.1 r1.2.2.1 r1.2.2.2.1 r1.2.2.2.2.1
+theorem loopN2CallCallMaxSourceConds_unfold
+ (v0 v1 v2 v3 u0 u1 u2 u3 uTop u0Orig1 u0Orig0 : Word) :
+ loopN2CallCallMaxSourceConds
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop u0Orig1 u0Orig0 =
+ (let r2 :... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ecf3eadfa2f5_0 | 52d83943b232a24d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/FlatDecoderConcrete.lean | FlatDecoderConcrete | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "flat_decoder_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 38,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro pfx w10 w11 w13 hflat\n exact rlp_decode_single_item_reconverged_flat pfx w10 w11 w13\n 28 28 0 24 28 16 4\n ... | [
{
"name": "flat_piece",
"text": "private theorem flat_piece (base subBase : Word) (idx : Nat) (sub : List Instr)\n (h_addr : subBase = base + BitVec.ofNat 64 (4 * idx))\n (h_slice : (flat_decoder_prog.drop idx).take sub.length = sub)\n (h_range : idx + sub.length ≤ 16) :\n ∀ a i, (CodeReq.ofProg... | [
{
"name": "flat_decoder_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 55,
"n_chars": 3225,
"n_subproofs": 0,
"n_tactics": 44,
"cyclomatic": 1,
"n_automation": 35,
"n_rewrites": 0,
"n_structural": 18,
"automation_only": false,
"max_... | 2 | /-
EvmAsm.Rv64.RLP.FlatDecoderConcrete
EL.3 — a CONCRETE assembled program for the flat RLP single-item decoder, and
its spec `flat_decoder_spec` in exactly the shape the flat list-loop closure's
`decoderH` hypothesis (`FlatListLoop.lean`) expects.
`rlp_decode_single_item_reconverged_flat` (`UnifiedDecodeIt... | /-
EvmAsm.Rv64.RLP.FlatDecoderConcrete
EL.3 — a CONCRETE assembled program for the flat RLP single-item decoder, and
its spec `flat_decoder_spec` in exactly the shape the flat list-loop closure's
`decoderH` hypothesis (`FlatListLoop.lean`) expects.
`rlp_decode_single_item_reconverged_flat` (`UnifiedDecodeIt... | @@ -51,6 +51,17 @@
-- A `CodeReq.ofProg`-leaf (a contiguous slice of `flat_decoder_prog` at byte
-- offset `4*idx`) is subsumed by the whole program.
+private theorem flat_piece (base subBase : Word) (idx : Nat) (sub : List Instr)
+ (h_addr : subBase = base + BitVec.ofNat 64 (4 * idx))
+ (h_slice : (flat_deco... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_207af9035391_0 | 663885b2b396af10 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bls12KzgG2WireSAsm.lean | Bls12KzgG2WireSAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "blsgLeToBeWireFlat_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 53,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine cpsTripleWithin_weaken (fun _ hp => by xperm_hyp hp) (fun _ hq => hq)\n (cpsTripleWithin_peel_regOwns le... | [
{
"name": "exposedRegs_split2",
"text": "/-- Split the full exposed file into the `a0`/`a1` atoms plus the scratch. -/\nprivate theorem exposedRegs_split2 (vf : Reg → Word) :\n regAtomsOf vf exposedRegs\n = ((.x10 ↦ᵣ vf .x10) ** (.x11 ↦ᵣ vf .x11) ** regAtomsOf vf leScratch) := by\n show regAtomsOf ... | [
{
"name": "blsgLeToBeWireFlat_spec",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 73,
"n_chars": 3949,
"n_subproofs": 3,
"n_tactics": 55,
"cyclomatic": 1,
"n_automation": 17,
"n_rewrites": 20,
"n_structural": 9,
"automation_only": false,
... | 3 | /-
EvmAsm.Codegen.Programs.Bls12KzgG2WireSAsm
**The nested-loop-in-count-up port** (bead evm-asm-db2jq):
`blsk_g2_wire`, byte-TRANSPARENT — the emitted `blskG2Wire_prog` IS an
`abiFrameProg (-32)/(+32)` flatten with frame
`[(ra,0),(s0,8),(s1,16),(s2,24)]` and a 27-instruction body:
blsk_g2_wire: addi... | /-
EvmAsm.Codegen.Programs.Bls12KzgG2WireSAsm
**The nested-loop-in-count-up port** (bead evm-asm-db2jq):
`blsk_g2_wire`, byte-TRANSPARENT — the emitted `blskG2Wire_prog` IS an
`abiFrameProg (-32)/(+32)` flatten with frame
`[(ra,0),(s0,8),(s1,16),(s2,24)]` and a 27-instruction body:
blsk_g2_wire: addi... | @@ -109,6 +109,16 @@
def leScratch : List Reg :=
[.x5, .x6, .x7, .x28, .x29, .x30, .x31, .x12, .x13, .x14, .x15, .x16, .x17]
+/-- Split the full exposed file into the `a0`/`a1` atoms plus the scratch. -/
+private theorem exposedRegs_split2 (vf : Reg → Word) :
+ regAtomsOf vf exposedRegs
+ = ((.x10 ↦ᵣ vf .... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_207af9035391_1 | db8b3d290c9d6906 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bls12KzgG2WireSAsm.lean | Bls12KzgG2WireSAsm | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "sub_facts",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ht := toNat_add_ofNat b n (by omega)\n refine ⟨by omega, by omega, fun k hk => ?_⟩\n rw [addr_fold]\n exact hv (n + k) (b... | [
{
"name": "addr_fold",
"text": "private theorem addr_fold (b : Word) (i j : Nat) :\n (b + BitVec.ofNat 64 i) + BitVec.ofNat 64 j = b + BitVec.ofNat 64 (i + j) := by\n rw [BitVec.add_assoc]\n congr 1\n apply BitVec.eq_of_toNat_eq\n simp only [BitVec.toNat_add, BitVec.toNat_ofNat]\n omega\n\n",
"f... | [
{
"name": "sub_facts",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 17,
"n_chars": 796,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nesting": 2
... | 2 | /-
EvmAsm.Codegen.Programs.Bls12KzgG2WireSAsm
**The nested-loop-in-count-up port** (bead evm-asm-db2jq):
`blsk_g2_wire`, byte-TRANSPARENT — the emitted `blskG2Wire_prog` IS an
`abiFrameProg (-32)/(+32)` flatten with frame
`[(ra,0),(s0,8),(s1,16),(s2,24)]` and a 27-instruction body:
blsk_g2_wire: addi... | /-
EvmAsm.Codegen.Programs.Bls12KzgG2WireSAsm
**The nested-loop-in-count-up port** (bead evm-asm-db2jq):
`blsk_g2_wire`, byte-TRANSPARENT — the emitted `blskG2Wire_prog` IS an
`abiFrameProg (-32)/(+32)` flatten with frame
`[(ra,0),(s0,8),(s1,16),(s2,24)]` and a 27-instruction body:
blsk_g2_wire: addi... | @@ -105,6 +105,14 @@
-- Word helpers.
-- ============================================================================
+private theorem addr_fold (b : Word) (i j : Nat) :
+ (b + BitVec.ofNat 64 i) + BitVec.ofNat 64 j = b + BitVec.ofNat 64 (i + j) := by
+ rw [BitVec.add_assoc]
+ congr 1
+ apply BitVec.eq_of_toN... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_207af9035391_2 | 8c0fc10c2348e176 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bls12KzgG2WireSAsm.lean | Bls12KzgG2WireSAsm | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "wireStep_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 301,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Peel the five scratch registers the setup writes.\n refine cpsTripleWithin_weaken\n (fun _ hp => by\n simp only... | [
{
"name": "ofNat_shl",
"text": "private theorem ofNat_shl (i k m : Nat) (hm : 2 ^ k = m) (h : m * i < 2 ^ 64) :\n (BitVec.ofNat 64 i) <<< k = BitVec.ofNat 64 (m * i) := by\n subst hm\n have hkpos : 0 < 2 ^ k := Nat.two_pow_pos k\n have hilt : i < 2 ^ 64 := by\n have : i ≤ 2 ^ k * i := Nat.le_mul_of... | [
{
"name": "wireStep_spec",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 7,
"n_lines": 341,
"n_chars": 20165,
"n_subproofs": 57,
"n_tactics": 293,
"cyclomatic": 1,
"n_automation": 58,
"n_rewrites": 37,
"n_structural": 3,
"automation_only": false,
"max_... | 7 | /-
EvmAsm.Codegen.Programs.Bls12KzgG2WireSAsm
**The nested-loop-in-count-up port** (bead evm-asm-db2jq):
`blsk_g2_wire`, byte-TRANSPARENT — the emitted `blskG2Wire_prog` IS an
`abiFrameProg (-32)/(+32)` flatten with frame
`[(ra,0),(s0,8),(s1,16),(s2,24)]` and a 27-instruction body:
blsk_g2_wire: addi... | /-
EvmAsm.Codegen.Programs.Bls12KzgG2WireSAsm
**The nested-loop-in-count-up port** (bead evm-asm-db2jq):
`blsk_g2_wire`, byte-TRANSPARENT — the emitted `blskG2Wire_prog` IS an
`abiFrameProg (-32)/(+32)` flatten with frame
`[(ra,0),(s0,8),(s1,16),(s2,24)]` and a 27-instruction body:
blsk_g2_wire: addi... | @@ -112,6 +112,19 @@
simp only [BitVec.toNat_add, BitVec.toNat_ofNat]
omega
+private theorem ofNat_shl (i k m : Nat) (hm : 2 ^ k = m) (h : m * i < 2 ^ 64) :
+ (BitVec.ofNat 64 i) <<< k = BitVec.ofNat 64 (m * i) := by
+ subst hm
+ have hkpos : 0 < 2 ^ k := Nat.two_pow_pos k
+ have hilt : i < 2 ^ 64 := by
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_207af9035391_3 | 92acf29c121fab5b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bls12KzgG2WireSAsm.lean | Bls12KzgG2WireSAsm | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "wireStep_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 301,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Peel the five scratch registers the setup writes.\n refine cpsTripleWithin_weaken\n (fun _ hp => by\n simp only... | [
{
"name": "cnt_step_up",
"text": "private theorem cnt_step_up (n : Nat) (_h : n + 1 < 2 ^ 64) :\n BitVec.ofNat 64 n + signExtend12 (1 : BitVec 12) = BitVec.ofNat 64 (n + 1) := by\n rw [show signExtend12 (1 : BitVec 12) = BitVec.ofNat 64 1 from by decide]\n apply BitVec.eq_of_toNat_eq\n simp only [BitV... | [
{
"name": "wireLoopBody_spec",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 12,
"n_lines": 149,
"n_chars": 7724,
"n_subproofs": 15,
"n_tactics": 127,
"cyclomatic": 3,
"n_automation": 42,
"n_rewrites": 2,
"n_structural": 13,
"automation_only": false,
"... | 12 | /-
EvmAsm.Codegen.Programs.Bls12KzgG2WireSAsm
**The nested-loop-in-count-up port** (bead evm-asm-db2jq):
`blsk_g2_wire`, byte-TRANSPARENT — the emitted `blskG2Wire_prog` IS an
`abiFrameProg (-32)/(+32)` flatten with frame
`[(ra,0),(s0,8),(s1,16),(s2,24)]` and a 27-instruction body:
blsk_g2_wire: addi... | /-
EvmAsm.Codegen.Programs.Bls12KzgG2WireSAsm
**The nested-loop-in-count-up port** (bead evm-asm-db2jq):
`blsk_g2_wire`, byte-TRANSPARENT — the emitted `blskG2Wire_prog` IS an
`abiFrameProg (-32)/(+32)` flatten with frame
`[(ra,0),(s0,8),(s1,16),(s2,24)]` and a 27-instruction body:
blsk_g2_wire: addi... | @@ -118,6 +118,13 @@
rw [BitVec.toNat_add, BitVec.toNat_ofNat, Nat.zero_mod, Nat.add_zero,
Nat.mod_eq_of_lt x.isLt]
+private theorem cnt_step_up (n : Nat) (_h : n + 1 < 2 ^ 64) :
+ BitVec.ofNat 64 n + signExtend12 (1 : BitVec 12) = BitVec.ofNat 64 (n + 1) := by
+ rw [show signExtend12 (1 : BitVec 12) = ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_207af9035391_4 | 981446cf56849272 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bls12KzgG2WireSAsm.lean | Bls12KzgG2WireSAsm | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "wireStep_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 301,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Peel the five scratch registers the setup writes.\n refine cpsTripleWithin_weaken\n (fun _ hp => by\n simp only... | [
{
"name": "cnt_step_up",
"text": "private theorem cnt_step_up (n : Nat) (_h : n + 1 < 2 ^ 64) :\n BitVec.ofNat 64 n + signExtend12 (1 : BitVec 12) = BitVec.ofNat 64 (n + 1) := by\n rw [show signExtend12 (1 : BitVec 12) = BitVec.ofNat 64 1 from by decide]\n apply BitVec.eq_of_toNat_eq\n simp only [BitV... | [
{
"name": "blskG2Wire_spec",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 14,
"n_lines": 251,
"n_chars": 14983,
"n_subproofs": 21,
"n_tactics": 187,
"cyclomatic": 1,
"n_automation": 18,
"n_rewrites": 10,
"n_structural": 1,
"automation_only": false,
"m... | 14 | /-
EvmAsm.Codegen.Programs.Bls12KzgG2WireSAsm
**The nested-loop-in-count-up port** (bead evm-asm-db2jq):
`blsk_g2_wire`, byte-TRANSPARENT — the emitted `blskG2Wire_prog` IS an
`abiFrameProg (-32)/(+32)` flatten with frame
`[(ra,0),(s0,8),(s1,16),(s2,24)]` and a 27-instruction body:
blsk_g2_wire: addi... | /-
EvmAsm.Codegen.Programs.Bls12KzgG2WireSAsm
**The nested-loop-in-count-up port** (bead evm-asm-db2jq):
`blsk_g2_wire`, byte-TRANSPARENT — the emitted `blskG2Wire_prog` IS an
`abiFrameProg (-32)/(+32)` flatten with frame
`[(ra,0),(s0,8),(s1,16),(s2,24)]` and a 27-instruction body:
blsk_g2_wire: addi... | @@ -118,6 +118,13 @@
rw [BitVec.toNat_add, BitVec.toNat_ofNat, Nat.zero_mod, Nat.add_zero,
Nat.mod_eq_of_lt x.isLt]
+private theorem cnt_step_up (n : Nat) (_h : n + 1 < 2 ^ 64) :
+ BitVec.ofNat 64 n + signExtend12 (1 : BitVec 12) = BitVec.ofNat 64 (n + 1) := by
+ rw [show signExtend12 (1 : BitVec 12) = ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "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.